Dissemin is shutting down on January 1st, 2025

Published in

2010 6th International Symposium on Turbo Codes & Iterative Information Processing

DOI: 10.1109/istc.2010.5613862

Links

Tools

Export citation

Search in Google Scholar

Latency constrained protograph-based LDPC convolutional codes

Proceedings article published in 2010 by Giovanni E. Corazza ORCID, Aravind R. Iyengar, Marco Papaleo, Paul H. Siegel, Alessandro Vanelli-Coralli, Jack K. Wolf
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

We propose a windowed decoding scheme for protograph-based LDPC convolutional codes (LDPC-CC) that allows us to efficiently trade-off decoding performance for gains in latency. We study the performance of regular LDPC-CC with the windowed decoding scheme. In particular, we show that the class of LDPC-CC proposed in the literature with good belief propagation performance is ill-suited for windowed decoding. Further, we establish properties of code ensembles with good windowed decoding performance over erasure channels with and without memory.