A generalized algebraic approach to optimizing SC-LDPC codes

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of (3,3)-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes constructed in this way are able to outperform previously published constructions, in terms of the number of dominant absorbing sets and with respect to both standard and windowed decoding.

[1]  Aravind R. Iyengar,et al.  Windowed erasure decoding of LDPC Convolutional Codes , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

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

[3]  C. Kelley,et al.  On codes designed via algebraic lifts of graphs , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

[5]  J. Thorpe.  Analysis and design of protograph based LDPC codes and ensembles , 2005 .

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

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

[8]  Lara Dolecek,et al.  A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

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

[11]  David G. M. Mitchell,et al.  Edge spreading design of high rate array-based SC-LDPC codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[12]  Christine A. Kelley,et al.  Avoiding trapping sets in SC-LDPC codes under windowed decoding , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[13]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[14]  Shashi Kiran Chilappagari,et al.  Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers , 2008, IEEE Transactions on Information Theory.

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

[16]  Lara Dolecek,et al.  Optimized Design of Finite-Length Separable Circulant-Based Spatially-Coupled Codes: An Absorbing Set-Based Analysis , 2016, IEEE Transactions on Communications.