Good Codes Based on Very Sparse Matrices
Proceedings of the 5th IMA Conference on Cryptography and Coding
Bit-interleaved coded modulation
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation
IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties
IEEE Transactions on Information Theory
On the optimality of the binary reflected Gray code
IEEE Transactions on Information Theory
Stochastic analysis of turbo decoding
IEEE Transactions on Information Theory
Nonuniform error correction using low-density parity-check codes
IEEE Transactions on Information Theory
Gray Coding for Multilevel Constellations in Gaussian Noise
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.