Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1010.4548 · IEEE Transactions on Information Theory

Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels

Aravind R. Iyengar, Marco Papaleo, Paul H. Siegel, Jack Keil Wolf, Alessandro Vanelli‐Coralli, Giovanni Emanuele Corazza

Published Nov 23, 2011• 220 citations
arXivHTMLPDF

Abstract

We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory.

DOI
10.1109/tit.2011.2177439

Related papers

1Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels

Aravind Raghava Iyengar, Marco Papaleo, Paul H. Siegel +4 more

Abstract—We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory. Index Terms—Low-density parity-check codes, Convolutional

•Jan 1, 2012•168 citations

On the Design of LDPC-Convolutional Ensembles Using the TEP Decoder

Pablo M. Olmos, Luis Salamanca, Juan José Murillo-Fuentes +1 more

Low-density parity-check convolutional (LDPCC) codes asymptotically achieve channel capacity under belief propagation (BP) decoding. In this paper, we decode LDPCC codes using the Tree-Expectation Propagation (TEP) decoder, recently proposed as an alternative decoding method to the BP algorithm for the binary erasure channel (BEC). We show that, for LDPCC codes, the TEP decoder improves the BP solution with a comparable complexity or, alternatively, it allows using shorter codes to achieve similar error rates. We also propose a window-sliding scheme for the TEP decoder to reduce the decoding latency.

IEEE Communications Letters•Mar 13, 2012•2 citations

Windowed erasure decoding of LDPC Convolutional Codes

Marco Papaleo, Aravind Raghava Iyengar, Paul H. Siegel +2 more

We consider windowed decoding of LDPC Convolutional Codes on the Binary Erasure Channel (BEC) to study the trade-off between the decoding latency and the code performance. We make some key observations about regular LDPC Convolutional code ensembles under windowed decoding and give modified constructions of these codes that allow us to efficiently trade-off performance for gains in latency.

IEEE Information Theory Workshop (ITW)•Jan 1, 2010•56 citations

Convergence analysis for a class of LDPC convolutional codes on the erasure channel

Arvind Sridharan, Michael Lentmaier, Daniel J. Costello +1 more

An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is introduced.The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble when operating on the erasure channel is analyzed.The structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to the corresponding LDPC block codes.

•Jan 1, 2004•52 citations

On the thresholds of generalized LDPC convolutional codes based on protographs

Michael Lentmaier, Gerhard Paul Fettweis

A threshold analysis of terminated generalized LDPC convolutional codes (GLDPC CCs) is presented for the binary erasure channel. Different ensembles of protograph-based GLDPC CCs are considered, including braided block codes (BBCs). It is shown that the terminated PG-GLDPC CCs have better thresholds than their block code counterparts. Surprisingly, our numerical analysis suggests that for large termination factors the belief propagation decoding thresholds of PG-GLDPC CCs coincide with the ML decoding thresholds of the corresponding PG-GLDPC block codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•75 citations

Dynamic Window Decoding for LDPC Convolutional Codes in Low-Latency Optical Communications

Tian Xia, Toshiaki Koike–Akino, David S. Millar +5 more

We propose a dynamic window decoding scheme for LDPC convolutional codes to reduce the latency compared to the belief propagation decoding. The BER performance of our proposed memory-efficient decoding scheme is verified by simulations.

Optical Fiber Communication Conference•Jan 1, 2015•3 citations
We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory.
Abstract—We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory. Index Terms—Low-density parity-check codes, Convolutional
Low-density parity-check convolutional (LDPCC) codes asymptotically achieve channel capacity under belief propagation (BP) decoding. In this paper, we decode LDPCC codes using the Tree-Expectation Propagation (TEP) decoder, recently proposed as an alternative decoding method to the BP algorithm for the binary erasure channel (BEC). We show that, for LDPCC codes, the TEP decoder improves the BP solution with a comparable complexity or, alternatively, it allows using shorter codes to achieve similar error rates. We also propose a window-sliding scheme for the TEP decoder to reduce the decoding latency.
A threshold analysis of terminated generalized LDPC convolutional codes (GLDPC CCs) is presented for the binary erasure channel. Different ensembles of protograph-based GLDPC CCs are considered, including braided block codes (BBCs). It is shown that the terminated PG-GLDPC CCs have better thresholds than their block code counterparts. Surprisingly, our numerical analysis suggests that for large termination factors the belief propagation decoding thresholds of PG-GLDPC CCs coincide with the ML decoding thresholds of the corresponding PG-GLDPC block codes.