Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields

A new class of quasi-cyclic LDPC codes whose parity-check matrices are arrays of circulant permutation matrices constructed based on cyclic subgroups of finite fields is presented. This class of codes contains several known classes of algebraic quasi-cyclic LDPC codes as subclasses. Experimental results show that the codes constructed perform very well over the AWGN channel when decoded with iterative decoding based on belief propagation. This class of new QC-LDPC codes contains a subclass of codes which have large minimum distances. Combinatorial expressions for the ranks of the parity-check matrices of a subclass of codes constructed based on fields of characteristic two are given.

[1]  Eisaku Sasaki,et al.  Efficient encoding of QC-LDPC codes related to cyclic MDS codes , 2008, IEEE Journal on Selected Areas in Communications.

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

[3]  Kyeongcheol Yang,et al.  Quasi-cyclic LDPC codes for fast encoding , 2005, IEEE Transactions on Information Theory.

[4]  William Ryan,et al.  Channel Codes by William Ryan , 2009 .

[5]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[6]  Shu Lin,et al.  Channel Codes: Classical and Modern , 2009 .

[7]  Khaled A. S. Abdel-Ghaffar,et al.  A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields , 2009, IEEE Transactions on Communications.

[8]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[9]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[10]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[11]  William Ryan,et al.  Channel Codes: Classical and Modern , 2009 .

[12]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[13]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

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

[15]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[16]  Khaled A. S. Abdel-Ghaffar,et al.  On algebraic construction of Gallager and circulant low-density parity-check codes , 2004, IEEE Transactions on Information Theory.

[17]  Qin Huang,et al.  Quasi-cyclic LDPC codes: an algebraic construction , 2010, IEEE Transactions on Communications.

[18]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

[19]  Shu Lin,et al.  Near-Shannon-limit quasi-cyclic low-density parity-check codes , 2004, IEEE Trans. Commun..

[20]  Zhongfeng Wang,et al.  Low-Complexity High-Speed Decoder Design for Quasi-Cyclic LDPC Codes , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[21]  Khaled A. S. Abdel-Ghaffar,et al.  Two reliability-based iterative majority-logic decoding algorithms for LDPC codes , 2009, IEEE Transactions on Communications.

[22]  Qin Huang,et al.  Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares , 2010, IEEE Transactions on Communications.

[23]  Keshab K. Parhi,et al.  Overlapped message passing for quasi-cyclic low-density parity check codes , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.