A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes

The parity-check matrix of a quasi-cyclic low- density parity-check (QC-LDPC) code can be compactly represented by a polynomial parity-check matrix. By using this compact representation, we derive a necessary and sufficient condition for determining the girth of QC-LDPC codes in a systematic way. The new condition avoids an explicit enumeration of cycles for determining the girth of codes, and thus can be well employed to generate QC-LDPC codes with large girth.

[1]  Roxana Smarandache,et al.  On regular quasicyclic LDPC codes from binomials , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[4]  Xiaohu You,et al.  An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Tong Zhang,et al.  Design of VLSI implementation-oriented LDPC codes , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

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

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

[8]  Robert C. Williamson,et al.  Loop removal from LDPC codes , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).