Construction of Girth-Eight QC-LDPC Codes from Greatest Common Divisor

For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.

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

[2]  Bane V. Vasic,et al.  High-rate girth-eight low-density parity-check codes on rectangular integer lattices , 2004, IEEE Transactions on Communications.

[3]  Kyeongcheol Yang,et al.  A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem , 2005, IEEE Communications Letters.

[4]  M. E. O'Sullivan,et al.  Algebraic construction of sparse matrices with large girth , 2006, IEEE Transactions on Information Theory.

[5]  Jingming Kuang,et al.  Novel Algebraic Constructions of Nonbinary Structured LDPC Codes over Finite Fields , 2008, 2008 IEEE 68th Vehicular Technology Conference.

[6]  Jingming Kuang,et al.  Three algebraic methods for constructing nonbinary LDPC codes based on finite fields , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[7]  Jen-Fa Huang,et al.  Construction of quasi-cyclic LDPC codes from quadratic congruences , 2008, IEEE Communications Letters.

[8]  M. Esmaeili,et al.  Structured quasi-cyclic LDPC codes with girth 18 and column-weight J⩾3 , 2010 .

[9]  Chung-Chin Lu,et al.  On error correction capability of bit-flipping algorithm for LDPC codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[10]  Qiang,et al.  Regular Quasi Cyclic Low Density Parity Check Codes with Girth 8 from Elementary Number Theory , 2012 .

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

[12]  Xinmei Wang,et al.  New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[13]  Florian Hug,et al.  Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth , 2011, IEEE Transactions on Information Theory.