Protograph-based q-ary LDPC codes for higher-order modulation

This paper introduces a protograph-based method for designing q-ary LDPC codes for use with modulations larger than QPSK. Simulations focus on a GF(16), 16-QAM example. The proposed construction method achieves the maximum gain when the average column weight is chosen so that the linear minimum distance growth property is satisfied. In this region, the benefit of a protograph-based design over a standard PEG approach was 0.3 dB. We found that a careful field-element selection algorithm provides about 0.1 dB of improvement over random field-element selection. Overall, the proposed improvements yielded 0.4 dB of gain over a PEG-based GF(16) code with randomly selected Galois field elements. The performance of this baseline GF(16) code was comparable to the best known binary LDPC code for 16-QAM, so that the proposed improvements allow the GF(16) LDPC code to outperform known binary approaches.

[1]  Matthew C. Davey,et al.  Error-Correction using Low Density Parity Check Codes , 1999 .

[2]  Nazanin Rahnavard,et al.  Nonuniform error correction using low-density parity-check codes , 2005, IEEE Transactions on Information Theory.

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

[4]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

[6]  Tao Jiang,et al.  Combine LDPC Codes Over GF(q) With q-ary Modulations for Bandwidth Efficient Transmission , 2008, IEEE Transactions on Broadcasting.

[7]  Evangelos Eleftheriou,et al.  On the computation of the minimum distance of low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[8]  Paul H. Siegel,et al.  Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes , 2003, IEEE Trans. Inf. Theory.

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

[10]  Rüdiger L. Urbanke,et al.  Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes , 2005, ArXiv.

[11]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[12]  Richard D. Wesel,et al.  Constellation labeling for linear encoders , 2001, IEEE Trans. Inf. Theory.

[13]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

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

[15]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

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

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

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

[19]  David Declercq,et al.  Using binary images of non binary LDPC codes to improve overall performance , 2006 .

[20]  Sae-Young Chung,et al.  On the construction of some capacity-approaching coding schemes , 2000 .

[21]  Dariush Divsalar,et al.  Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.

[22]  David J. C. MacKay,et al.  Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.

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