Optimized geometric LDPC codes with quasi-cyclic structure

This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting in the extrinsic information transfer (EXIT) charts. Simulation results show that the proposed codes perform very well with an iterative decoding over the AWGN channel.

[1]  Rüdiger L. Urbanke,et al.  Weight Distribution of Low-Density Parity-Check Codes , 2006, IEEE Transactions on Information Theory.

[2]  Qiuju Diao,et al.  Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets , 2012, IEEE Transactions on Information Theory.

[3]  Shu Lin,et al.  Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach , 2008, IEEE Transactions on Communications.

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

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  Xinmei Wang,et al.  Design of Quasi-Cyclic LDPC codes based on Euclidean Geometries , 2009, 2009 International Conference on Advanced Information Networking and Applications.

[7]  J.M.F. Moura,et al.  Partition-and-shift LDPC codes , 2005, IEEE Transactions on Magnetics.

[8]  Shu Lin,et al.  Codes on finite geometries , 2005, IEEE Transactions on Information Theory.

[9]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

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

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

[12]  Shu Lin,et al.  Error Control Coding , 2004 .

[13]  Moon Ho Lee,et al.  Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem , 2009, IEEE Communications Letters.

[14]  Moon Ho Lee,et al.  Construction of multiple-rate quasi-cyclic LDPC codes via the hyperplane decomposing , 2011, Journal of Communications and Networks.

[15]  Moon Ho Lee,et al.  Large Girth Non-Binary LDPC Codes Based on Finite Fields and Euclidean Geometries , 2009, IEEE Signal Processing Letters.

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

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

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

[19]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[20]  Qiuju Diao,et al.  Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets , 2010, ArXiv.

[21]  A. Ramamoorthy,et al.  Lowering the error floors of irregular high-rate LDPC codes by graph conditioning , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[22]  Kyeongcheol Yang,et al.  Lifting methods for quasi-cyclic LDPC codes , 2006, IEEE Communications Letters.