High efficiency broadband transmission with LDPC codes over GF(2s)

In this paper, we discuss the suitability and the improvement potential of LDPC codes over a finite extension field GF(2s) for future high efficiency broadband transmission systems through comparison with state-of-the-art coding schemes, i.e. LDPC codes according to IEEE 802.11n and DVB-X2. We first point out the differences between non-binary LDPC codes and their binary counterparts and discuss their advantages for high efficiency broadband transmission systems. For this, two mapping strategies can be introduced which allow for directly combining higher-order modulation and non-binary LDPC codes. We present simulation results in terms of bit error rates and packet error rates for various higher-order (square) quadrature amplitude modulations and LDPC codes over different finite extension fields for the AWGN channel and the Rayleigh fading channel. The evaluation reveals that the application of non-binary LDPC codes allows for the design of efficient transmission schemes with high spectral efficiencies. However, this is achieved at the expense of increased complexity.

[1]  Paola Bisaglia,et al.  Simplified soft-output demapper for binary interleaved COFDM with application to HIPERLAN/2 , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

[3]  David Declercq,et al.  Getting Closer to MIMO Capacity with Non-Binary Codes and Spatial Multiplexing , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[4]  Richard D. Wesel,et al.  Protograph-based q-ary LDPC codes for higher-order modulation , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[5]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

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

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

[8]  Rong-Rong Chen,et al.  Design of Nonbinary LDPC Codes over GF(q) for Multiple-Antenna Transmission , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[9]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

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

[11]  Emmanuel Boutillon,et al.  Complexity Comparison of Non-Binary LDPC Decoders , 2009 .

[12]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

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