Optimized Design of Finite-Length Separable Circulant-Based Spatially-Coupled Codes: An Absorbing Set-Based Analysis

In this paper, we characterize the finite-length performance of separable circulant-based spatially-coupled (SCB-SC) LDPC codes for transmission over the additive white Gaussian noise channel. For a general class of finite-length graph-based codes, it is known that the existence of small absorbing sets causes a performance degradation in the error floor regime. We first present the mathematical conditions for the existence of absorbing sets in binary SCB-SC codes. This analysis enables us to find the exact number of absorbing sets as a function of the design parameters. In particular, our results show that the choice of the cutting vector affects the number of absorbing sets and, therefore, the error floor performance of the code. For a fixed column weight, we find provably optimal cutting vectors that result in the least number of absorbing sets. Furthermore, we extend our analysis to nonbinary SCB-SC codes, where we show that the choice of the cutting vector is not as critical as in the binary case. We provide an algorithm which provably removes the problematic nonbinary absorbing sets from nonbinary SCB-SC codes by informed selection of edge labels. Our simulation results show the superior error floor performance of our designed binary and nonbinary SCB-SC codes compared with binary unstructured and nonbinary quasi-cyclic SC codes available in the open literature.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Kenta Kasai,et al.  Spatially coupled codes over the multiple access channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[3]  Joseph R. Cavallaro,et al.  Multi-layer parallel decoding algorithm and vlsi architecture for quasi-cyclic LDPC codes , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[4]  Sarah J. Johnson,et al.  Memory-efficient quasi-cyclic spatially coupled low-density parity-check and repeat-accumulate codes , 2014, IET Commun..

[5]  David G. M. Mitchell,et al.  Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes , 2013, IEEE Transactions on Information Theory.

[6]  Sarah J. Johnson,et al.  Spatially Coupled Repeat-Accumulate Codes , 2013, IEEE Communications Letters.

[7]  Lara Dolecek,et al.  Optimized array-based spatially-coupled LDPC Codes: An absorbing set approach , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[8]  Tinoosh Mohsenin,et al.  A Low-Complexity Message-Passing Algorithm for Reduced Routing Congestion in LDPC Decoders , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Kenta Kasai,et al.  Terminated LDPC convolutional codes over GF(2p) , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Lara Dolecek,et al.  Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.

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

[12]  Pablo M. Olmos,et al.  Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains , 2014, ArXiv.

[13]  Lara Dolecek,et al.  The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes , 2012, IEEE Transactions on Information Theory.

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

[15]  Kenta Kasai,et al.  Threshold saturation on channels with memory via spatial coupling , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[16]  Erozan M. Kurtas.  Advanced Error Control Techniques for Data Storage Systems , 2005 .

[17]  Kai Zhang,et al.  High-throughput layered decoder implementation for quasi-cyclic LDPC codes , 2009, IEEE Journal on Selected Areas in Communications.

[18]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[19]  Michael Lentmaier,et al.  New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes , 2010, 2010 IEEE International Symposium on Information Theory.

[20]  Alexandre Graell i Amat,et al.  Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel , 2016, IEEE Transactions on Information Theory.

[21]  Ali Emre Pusane,et al.  A Comparison Between LDPC Block and Convolutional Codes , 2006 .

[22]  Amir H. Banihashemi,et al.  On the girth of quasi cyclic protograph LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[23]  Pablo M. Olmos,et al.  A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes , 2014, IEEE Transactions on Information Theory.

[24]  Michael Lentmaier,et al.  Quasi-cyclic asymptotically regular LDPC codes , 2010, 2010 IEEE Information Theory Workshop.

[25]  Nicolas Macris,et al.  Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels , 2013, IEEE Transactions on Information Theory.

[26]  Lara Dolecek,et al.  Absorbing set characterization of array-based spatially coupled LDPC codes , 2014, 2014 IEEE International Symposium on Information Theory.

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

[28]  Ali Emre Pusane,et al.  Deriving Good LDPC Convolutional Codes from LDPC Block Codes , 2010, IEEE Transactions on Information Theory.

[29]  Henry D. Pfister,et al.  Threshold saturation of spatially-coupled codes on intersymbol-interference channels , 2012, 2012 IEEE International Conference on Communications (ICC).

[30]  Rudiger Urbanke,et al.  Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC , 2010, ISIT.

[31]  Xu Chen,et al.  A 2.0 Gb/s Throughput Decoder for QC-LDPC Convolutional Codes , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[32]  D. Costello,et al.  Approaching capacity with asymptotically regular LDPC codes , 2009, 2009 Information Theory and Applications Workshop.

[33]  M. Karimi,et al.  Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes , 2012, IEEE Transactions on Information Theory.

[34]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[35]  Manabu Hagiwara,et al.  Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices" , 2009, IEEE Trans. Inf. Theory.

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

[37]  Pablo M. Olmos,et al.  Analyzing finite-length protograph-based spatially coupled LDPC codes , 2014, 2014 IEEE International Symposium on Information Theory.

[38]  Roxana Smarandache,et al.  Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds , 2009, IEEE Transactions on Information Theory.

[39]  Daniel J. Costello,et al.  A construction for low density parity check convolutional codes based on quasi-cyclic block codes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[40]  Michael Lentmaier,et al.  Challenges and some new directions in channel coding , 2015, Journal of Communications and Networks.

[41]  Lara Dolecek,et al.  Some results on spatially coupled protograph LDPC codes , 2016, 2016 Information Theory and Applications Workshop (ITA).

[42]  Kenta Kasai,et al.  Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding , 2013, 2013 IEEE International Symposium on Information Theory.

[43]  Joseph R. Cavallaro,et al.  VLSI Decoder Architecture for High Throughput, Variable Block-size and Multi-rate LDPC Codes , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[44]  Xiao Ma,et al.  Performance Comparison of LDPC Block and Spatially Coupled Codes Over GF $(q)$ , 2014, IEEE Transactions on Communications.

[45]  Kenta Kasai,et al.  Spatially-coupled MacKay-Neal codes and Hsu-Anastasopoulos codes , 2011, ISIT.

[46]  Jungwon Lee,et al.  Non-binary algebraic spatially-coupled quasi-cyclic LDPC codes , 2014, 2014 IEEE International Symposium on Information Theory.

[47]  Lara Dolecek,et al.  Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes , 2014, IEEE Transactions on Communications.

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