Design of non-binary quasi-cyclic LDPC codes by absorbing set removal

Non-binary quasi-cyclic (NB-QC) codes are a class of graph-based codes with high performance and implementation-friendly structure. In this paper, we introduce a new method for designing NB-QC codes with improved performance in the low error-rate region. Specifically, we propose a construction which reduces the number of non-binary absorbing sets, which are known to cause errors when decoding non-binary LDPC codes. Our construction is based on a careful selection of the code design parameters. Simulation results demonstrate the superior performance of codes designed according to our technique compared to existing state-of-the-art NB-QC codes.

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

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

[3]  Amir H. Banihashemi,et al.  An efficient algorithm for finding dominant trapping sets of LDPC codes , 2011, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[4]  H. Vincent Poor,et al.  Finding All Small Error-Prone Substructures in LDPC Codes , 2009, IEEE Transactions on Information Theory.

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

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

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

[8]  M. Karimi,et al.  Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes , 2012, IEEE Transactions on Information Theory.

[9]  Dejan Vukobratovic,et al.  Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design , 2008, IEEE Communications Letters.

[10]  Lara Dolecek,et al.  Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes , 2014, IEEE Transactions on Communications.

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

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