Absorbing set spectrum approach for practical code design

This paper focuses on controlling the absorbing set spectrum for a class of regular LDPC codes known as separable, circulant-based (SCB) codes. For a specified circulant matrix, SCB codes all share a common mother matrix, examples of which are array-based LDPC codes and many common quasi-cyclic codes. SCB codes retain the standard properties of quasi-cyclic LDPC codes such as girth, code structure, and compatibility with efficient decoder implementations. In this paper, we define a cycle consistency matrix (CCM) for each absorbing set of interest in an SCB LDPC code. For an absorbing set to be present in an SCB LDPC code, the associated CCM must not be full column-rank. Our approach selects rows and columns from the SCB mother matrix to systematically eliminate dominant absorbing sets by forcing the associated CCMs to be full column-rank. We use the CCM approach to select rows from the SCB mother matrix to design SCB codes of column weight 5 that avoid all low-weight absorbing sets (4; 8), (5; 9), and (6; 8). Simulation results demonstrate that the newly designed code has a steeper error-floor slope and provides at least one order of magnitude of improvement in the low error rate region as compared to an elementary array-based code.

[1]  Lara Dolecek,et al.  LDPC absorbing sets, the null space of the cycle consistency matrix, and Tanner's constructions , 2011, 2011 Information Theory and Applications Workshop.

[2]  Lara Dolecek,et al.  Towards improved LDPC code designs using absorbing set spectrum properties , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[3]  Lara Dolecek,et al.  On absorbing sets of structured sparse graph codes , 2010, 2010 Information Theory and Applications Workshop (ITA).

[4]  C. K. Michael Tse,et al.  Constructing Short-Length Irregular LDPC Codes with Low Error Floor , 2010, IEEE Transactions on Communications.

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Chih-Chun Wang,et al.  Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder , 2010, 2010 IEEE International Symposium on Information Theory.

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

[8]  Shuai Zhang,et al.  On the dynamics of the error floor behavior in regular LDPC codes , 2009, 2009 IEEE Information Theory Workshop.

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

[10]  Shashi Kiran Chilappagari,et al.  Structured LDPC codes from permutation matrices free of small trapping sets , 2010, 2010 IEEE Information Theory Workshop.

[11]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[12]  Lara Dolecek,et al.  Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix , 2011, 2011 IEEE International Conference on Communications (ICC).

[13]  Navin Kashyap,et al.  Shortened Array Codes of Large Girth , 2005, IEEE Transactions on Information Theory.

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

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

[16]  Shu Lin,et al.  Error Control Coding , 2004 .

[17]  Lara Dolecek,et al.  Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices , 2009, IEEE Transactions on Communications.

[18]  Johannes B. Huber,et al.  CTH02-4: When Does One Redundant Parity-Check Equation Matter? , 2006, IEEE Globecom 2006.