Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles

The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some substructures of the code’s Tanner graple (simple) cycle have a nonzero finite average multiplicity. In this paper, we compute the asymptotic expected multiplicity of such ETS structures in random LDPC code ensembles. The computation, in general, involves two subproblems: (i) counting the number of cycles of a certain length with different combinations of variable node degrees, and (ii) counting the number of ways trees of different sizes can be appended to such a cycle to form an ETS. The first subproblem, which counts the number of leafless ETSs (LETSs), is solved by the authors in other papers. The second subproblem is formulated as a recursive counting problem and is solved in this paper, with the solution being a generalization of Catalan numbers. We also demonstrate through numerical results that the asymptotic expected values computed in this paper match the multiplicity of ETSs in randomly selected finite-length LDPC codes, even at relatively short block lengths.

[1]  Amir H. Banihashemi,et al.  On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles , 2017, IEEE Transactions on Information Theory.

[2]  P. Hilton,et al.  Catalan Numbers, Their Generalization, and Their Uses , 1991 .

[3]  Amir H. Banihashemi,et al.  Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[4]  Amir H. Banihashemi,et al.  Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[5]  Emina Soljanin,et al.  Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles , 2007, IEEE Transactions on Information Theory.

[6]  Amir H. Banihashemi,et al.  Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles , 2017, ArXiv.

[7]  David J. C. MacKay,et al.  Encyclopedia of Sparse Graph Codes , 1999 .

[8]  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.

[9]  Amir H. Banihashemi,et al.  Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles , 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).