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

Optical Fiber Communication Conference

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

Tian Xia, Toshiaki Koike–Akino, David S. Millar, Keisuke Kojima, Kieran Parsons, Yoshikuni Miyata, Kenya Sugihara, Wataru Matsumoto

Published Jan 1, 2015• 3 citations
Publisher

Abstract

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.
DOI
10.1364/ofc.2015.th3e.4

Related papers

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

Aravind R. Iyengar, Marco Papaleo, Paul H. Siegel +3 more

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.

arXiv:1010.4548•IEEE Transactions on Information Theory•Nov 23, 2011•220 citations

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

Stochastic decoding for LDPC convolutional codes

Xin-Ru Lee, Chih-Lung Chen, Hsie-Chia Chang +1 more

Among LDPC codes, LDPC convolutional codes (LDPC-CCs) seem to be more suitable for variable length applications. However, a LDPC-CC decoder is difficult to implement for its long latency and large storage usage. The stochastic computation makes the decoding of LDPC-CCs more efficient, but the boundary effect of sliding window causes poor performance. In this paper, a stochastic LDPC-CC decoder with virtual edge compensation as well as decoder architecture is presented. The simulation results based on (491, 3, 6) time-varying LDPC-CC show that under the same signal-to-noise ratio, our proposed decoder could achieve better performance, 60% less decoding latency and 40% storage reduction compared to log-BP decoder with 10 processors.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2012•3 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

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

Efficient message passing scheduling for terminated LDPC convolutional codes

Michael Lentmaier, Maria Mellado Prenda, Gerhard Paul Fettweis

Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•67 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
Among LDPC codes, LDPC convolutional codes (LDPC-CCs) seem to be more suitable for variable length applications. However, a LDPC-CC decoder is difficult to implement for its long latency and large storage usage. The stochastic computation makes the decoding of LDPC-CCs more efficient, but the boundary effect of sliding window causes poor performance. In this paper, a stochastic LDPC-CC decoder with virtual edge compensation as well as decoder architecture is presented. The simulation results based on (491, 3, 6) time-varying LDPC-CC show that under the same signal-to-noise ratio, our proposed decoder could achieve better performance, 60% less decoding latency and 40% storage reduction compared to log-BP decoder with 10 processors.
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.