Nonbinary Protograph-Based LDPC Codes Based on Additive Group of Finite Field

This letter proposes a flexible construction method of nonbinary protograph-based low-density parity-check codes based on finite field additive group operation from node perspective. First, nonzero element labels of nodes are optimized by minimum distance of corresponding binary image of rows of the parity-check matrix. Then, quasi-girth calculating method is proposed to jointly optimize node permutation label so as to improve global code's minimum distance upper bound. Simulation results illustrate the excellent performance of the proposed codes with adequately selected node's value label and permuting label.

[1]  ZhouBo,et al.  High performance non-binary quasi-cyclic LDPC codes on euclidean geometries , 2009 .

[2]  Wuyang Zhou,et al.  Design of nonbinary quasi-cyclic low-density parity-check codes by maximising the minimum distance , 2014, Trans. Emerg. Telecommun. Technol..

[3]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme , 2014, IEEE Transactions on Communications.

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

[5]  Shu Lin,et al.  Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions - [transactions papers] , 2009, IEEE Transactions on Communications.

[6]  Shu Lin,et al.  High Performance Nonbinary Quasi-Cyclic LDPC Codes on Euclidean Geometries , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[7]  Lara Dolecek,et al.  Non-binary protograph-based LDPC codes for short block-lengths , 2012, 2012 IEEE Information Theory Workshop.

[8]  Lingjun Kong,et al.  Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization , 2014, IEEE Communications Letters.

[9]  Rong-Rong Chen,et al.  Design of Nonbinary Quasi-Cyclic LDPC Cycle Codes , 2007, 2007 IEEE Information Theory Workshop.

[10]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[11]  Lara Dolecek,et al.  Graph cover ensembles of non-binary protograph LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[12]  Lara Dolecek,et al.  Non-Binary Protograph-Based LDPC Codes: Enumerators, Analysis, and Designs , 2014, IEEE Transactions on Information Theory.

[13]  David Declercq,et al.  Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images , 2008, IEEE Transactions on Communications.

[14]  Zhi Ding,et al.  High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries LDPC Codes on Euclidean Geometries , 2009, IEEE Transactions on Communications.