Design of non-binary quasi-cyclic LDPC codes by ACE optimization

An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The efficiency of the algorithm is demonstrated by generating good codes of short to moderate length over small fields, outperforming codes generated by the known methods.

[1]  Naresh R. Shanbhag,et al.  High-throughput LDPC decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..

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

[3]  Shu Lin,et al.  Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach , 2008, IEEE Transactions on Communications.

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

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

[6]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[7]  Amir H. Banihashemi,et al.  Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings , 2012, IEEE Transactions on Communications.

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

[9]  Amir H. Banihashemi,et al.  Lowering the Error Floor of LDPC Codes Using Cyclic Liftings , 2011, IEEE Trans. Inf. Theory.

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

[11]  Wuyang Zhou,et al.  Large-Girth Nonbinary QC-LDPC Codes of Various Lengths , 2010, IEEE Transactions on Communications.

[12]  Simon Litsyn,et al.  Constructing LDPC codes by error minimization progressive edge growth , 2008, IEEE Transactions on Communications.

[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]  Dejan Vukobratovic,et al.  Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design , 2008, IEEE Communications Letters.

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