Two is Better than One: Reducing the Loss of the Window Decoder for SC-LDPC Codes

In this paper, we consider spatially coupled LDPC codes derived from protographs. In particular, we analyze the performance of the window decoder (WD), which allows reducing the complexity, the memory requirements, and the latency of the flood belief-propagation decoder. We show that the performance degradation of WD is due to the fact that it exploits a single decoding wave instead of two. This has effect both in the ideal case of infinite code length, where it may imply a threshold loss, and in the case of finite length, where it affects the slope of the BER curve in the waterfall region. We show how a forwardbackward decoder can reduce such problems at the price of a limited increase of average complexity.

[1]  Rüdiger L. Urbanke,et al.  Spatially coupled ensembles universally achieve capacity under belief propagation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[2]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[3]  Michael Lentmaier,et al.  Decoder Error Propagation Mitigation for Spatially Coupled LDPC Codes , 2020, ArXiv.

[4]  Gerhard Fettweis,et al.  Efficient message passing scheduling for terminated LDPC convolutional codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Shadi Abu-Surra,et al.  Spatially-coupled low-density parity check codes: Zigzag-window decoding and code-family design considerations , 2015, 2015 Information Theory and Applications Workshop (ITA).

[6]  Baoming Bai,et al.  Combating Error Propagation in Window Decoding of Braided Convolutional Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[7]  Michael Lentmaier,et al.  A Novel Design of Spatially Coupled LDPC Codes for Sliding Window Decoding , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[8]  Paul H. Siegel,et al.  Windowed Decoding of Spatially Coupled Codes , 2011, IEEE Transactions on Information Theory.

[9]  Michael Lentmaier,et al.  Implementation aspects of LDPC convolutional codes , 2008, IEEE Transactions on Communications.

[10]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[11]  Lara Dolecek,et al.  Spatially coupled sparse codes on graphs: theory and practice , 2013, IEEE Communications Magazine.

[12]  Laurent Schmalen,et al.  Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes , 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

[13]  David G. M. Mitchell,et al.  Design of Spatially Coupled LDPC Codes Over GF $(q)$ for Windowed Decoding , 2016, IEEE Transactions on Information Theory.

[14]  Rolf Johannesson,et al.  LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios , 2014, 2014 IEEE International Symposium on Information Theory.

[15]  Paul H. Siegel,et al.  Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels , 2010, IEEE Transactions on Information Theory.

[16]  Michael Lentmaier,et al.  Spatially Coupled LDPC Codes Constructed From Protographs , 2014, IEEE Transactions on Information Theory.

[17]  Marc P. C. Fossorier,et al.  Iterative Decoding With Replicas , 2007, IEEE Transactions on Information Theory.