Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization

Quasi-cyclic low-density parity-check (QC-LDPC) codes constructed by using algebraic approaches, such as finite geometry and finite field, generally have good structural properties and very low error-floors, and facilitate hardware implementation. Irregular QC-LDPC codes constructed from such QC-LDPC codes by using the masking technique, when decoded with the sum-product algorithm (SPA), have low decoding complexity, but often show early error-floors. In this paper, the relationship of cycle, girth and approximate cycle EMD (ACE) between the masking matrix and masked matrix is investigated, and the ACE algorithm is modified and used to construct the masking matrix for irregular QC-LDPC codes. Simulations demonstrate that the codes constructed by masking with ACE optimization exhibit much improved waterfall performance and lower error floors.

[1]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.

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

[3]  Richard D. Wesel,et al.  Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.

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

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

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

[7]  Simon Litsyn,et al.  Design of non-binary quasi-cyclic LDPC codes by ACE optimization , 2013, 2013 IEEE Information Theory Workshop (ITW).