eIRA Codes for Coded Modulation Systems

In this paper we discuss the design of linear time encodable extended irregular repeat-accumulate (eIRA) codes for bit-interleaved coded modulation (BICM) systems. We interpret eIRA codes as a particular instance of the recently introduced multi-edge type (MET) low-density parity-check (LDPC) codes. This allows us to take into account during the design step both the systematic nature of these codes and the different level of protection given to each bit by the choice of input alphabet and mapping function. Furthermore, we extend to the eIRA-BICM case the method used by Roumy et al., IEEE Trans. Inf. Theory, 2004, to optimize LDPC codes for the binary input AWGN (bi-AWGN) channel. This method is based on EXIT functions and leads to a linear program. Using this method we design capacity-approaching eIRA codes for 4PAM and 8PSK. For both short and long block lengths these codes have performance approximately 0.1 dB worse than LDPC codes optimized with density evolution and with similar decoding complexity.

[1]  William E. Ryan,et al.  Bit-reliability mapping in LDPC-coded modulation systems , 2005, IEEE Communications Letters.

[2]  Krishna R. Narayanan,et al.  Design of low-density parity-check (LDPC) codes for high order constellations , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[3]  Francesco Sottile,et al.  Design of variable-rate irregular LDPC codes with low error floor , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[4]  William E. Ryan,et al.  Design of efficiently encodable moderate-length high-rate irregular LDPC codes , 2004, IEEE Transactions on Communications.

[5]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[6]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[7]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

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

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

[10]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[11]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

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

[13]  Li Ping,et al.  Low density parity check codes with semi-random parity check matrix , 1999 .

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

[15]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

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