Deterministic Girth-Eight QC-LDPC Codes with Large Column Weight

For any row weight L, several novel classes of (J = 5, L) and (J = 6, L) quasi-cyclic LDPC codes are deterministically constructed with girth eight. From these results, it is proved that (5, L) QC-LDPC codes with girth eight exist for any circulant permutation matrix (CPM) size P ≥ (2L + 3)(L - 1) + 1, and that girth-eight (6, L) QC-LDPC codes exist for any P ≥ 2(L+5)(L-1)+1. The two novel bounds remarkably improve the existing bounds of L2(L-1) + 1 and (L2+1)(L-1)+1, respectively. Moreover, for any column weight J and any row weight L, a construction for (J,L) QC-LDPC codes with girth eight is also proposed. This is the first deterministic and systematic construction which can generate girth-eight QC-LDPC codes with J ≥ 7.

[1]  Keith M. Chugg,et al.  An algorithm for counting short cycles in bipartite graphs , 2006, IEEE Transactions on Information Theory.

[2]  Weizhong Liu,et al.  Recursive Design of High Girth (2,k) LDPC Codes from (k,k) LDPC Codes , 2011, IEEE Communications Letters.

[3]  Matsumoto Wataru,et al.  A Study on QC-LDPC codes with girth 8 or 10 for broadband communications , 2007 .

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

[5]  Tor Helleseth,et al.  On the minimum distance of array codes as LDPC codes , 2003, IEEE Trans. Inf. Theory.

[6]  Kyung-Joong Kim,et al.  Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes , 2013, IEEE Transactions on Information Theory.

[7]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

[8]  Zongwang Li,et al.  A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

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

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

[11]  Xinmei Wang,et al.  Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least Eight , 2013, IEEE Communications Letters.

[12]  Amir H. Banihashemi,et al.  On the girth of quasi cyclic protograph LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[14]  Xinmei Wang,et al.  Construction of Girth-Eight QC-LDPC Codes from Greatest Common Divisor , 2013, IEEE Communications Letters.

[15]  Wang Xin-mei,et al.  Explicit construction of girth-eight QC-LDPC codes and its application in CRT method , 2012 .