Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets

Absorbing sets are known to be the primary factor in the error-floor performance of low-density parity-check (LDPC) codes with message passing decoders over the additive white Gaussian noise (AWGN) channel. Besides showing excellent waterfall performance, spatially coupled LDPC (SC-LDPC) codes that are constructed by an edge spreading technique are known to have fewer cycles and absorbing sets than their block code counterparts, and therefore to exhibit better error-floor performance. Based on our previously obtained results for quantized LDPC block decoders, we derive lower bounds on the performance of quantized SC-LDPC decoders, including both a flooding schedule decoder and a sliding window decoder. Numerical simulation results confirm the accuracy of the obtained bounds and show that, for quantized decoders, properly designed SC-LDPC codes have better error-floor performance than their underlying LDPC block codes.

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

[2]  David G. M. Mitchell,et al.  Lower bounds for quantized LDPC min-sum decoders based on absorbing sets , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  David G. M. Mitchell,et al.  Performance bounds for quantized LDPC decoders based on absorbing sets , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[4]  Lara Dolecek,et al.  Spatially Coupled Codes Optimized for Magnetic Recording Applications , 2017, IEEE Transactions on Magnetics.

[5]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

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

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

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

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

[10]  Paul H. Siegel,et al.  Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes , 2012, IEEE Transactions on Communications.

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

[12]  Amir H. Banihashemi,et al.  New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes , 2016, IEEE Transactions on Information Theory.

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

[14]  Haiyang Liu,et al.  On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes , 2010, IEEE Communications Letters.

[15]  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).

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

[17]  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).