Code-Matched Interleaver Design over Surrogate Channels

Recently, the universality of a well-designed LDPC code ensemble has been recognized. Take the DVB standards for example. The structured LDPC codes originally developed for satellite communications have been reused in terrestrial and cable channels. To this end, a bit interleaver can be employed to adapt the profile of the given code to the variation of channel conditions. In this paper, we focus on the design of code-dependent bit interleavers for parallel non-uniform channels. Since the channel-dependence of a given code ensemble is dominated by the mutual information between the channel input and output, we propose to simplify the analysis about the decoding behavior by using a set of surrogate binary erasure channels (BEC). The approximation of the actual channel by the surrogate BEC is established on the equivalence of bitwise capacities, which represent the mutual information between the uniformly-distributed binary input and the likelihood ratios of the effective parallel AWGN channels. Moreover, the transition of the erasure probabilities is modeled by a linear difference equation around the decoding threshold SNR, from which we can derive a necessary condition on the convergence of decoding iterations and achieve a useful guideline for the configuration of the bit interleavers.

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

[2]  Richard D. Wesel,et al.  The universality of LDPC codes on wireless channels , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[3]  David J. C. MacKay,et al.  Good Codes Based on Very Sparse Matrices , 1995, IMACC.

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

[5]  Branka Vucetic,et al.  A code-matched interleaver design for turbo codes , 2002, IEEE Trans. Commun..

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

[7]  Jing Lei,et al.  Matching graph connectivity of LDPC codes to high-order modulation by bit interleaving , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[8]  Erik G. Ström,et al.  Gray Coding for Multilevel Constellations in Gaussian Noise , 2007, IEEE Transactions on Information Theory.

[9]  Gianluigi Ferrari,et al.  Does the Performance of LDPC Codes Depend on the Channel? , 2006, IEEE Transactions on Communications.

[10]  Gian Mario Maggio,et al.  Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation , 2003, IEEE Trans. Inf. Theory.

[11]  Surrogate-channel design of universal LDPC codes , 2006, IEEE Communications Letters.

[12]  Minyue Fu,et al.  Stochastic analysis of turbo decoding , 2005, IEEE Transactions on Information Theory.

[13]  Erik G. Ström,et al.  On the optimality of the binary reflected Gray code , 2004, IEEE Transactions on Information Theory.

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

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

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

[17]  Masoud Ardakani,et al.  A more accurate one-dimensional analysis and design of irregular LDPC codes , 2004, IEEE Transactions on Communications.

[18]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[19]  Jing Li,et al.  On Accuracy of Gaussian Assumption in Iterative Analysis for LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.

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

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

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