The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four

This letter presents a necessary and sufficient condition for a class of quasi-cyclic low-density parity-check (QC LDPC) codes without girth four. Girth-four property of a class of QC LDPC codes is investigated. Good QC LDPC codes without girth four can be constructed by selecting proper shifting factors according to the proposed theorems. Examples are provided to verify the theorems. The simulation results show that the QC LDPC codes without girth four achieve a better BER performance compared with that of randomly constructed LDPC codes.

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

[2]  Yang Xiao Evaluations of Good LDPC Codes Based on Generator Matrices , 2006, 2006 8th international Conference on Signal Processing.

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

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

[5]  Moon Ho Lee,et al.  Construction of good quasi-cyclic LDPC codes , 2006 .

[6]  Moon Ho Lee,et al.  Low Complexity MIMO-LDPC CDMA Systems over Multipath Channels , 2006, IEICE Trans. Commun..