Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels
<|reference_start|>Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels: We present an analysis, under iterative decoding, of coset LDPC codes over GF(q), designed for use over arbitrary discrete-memoryless channels (particularly nonbinary and asymmetric channels). We use a random-coset analysis to produce an effect that is similar to output-symmetry with binary channels. We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the decoder messages, which simplifies their analysis and approximation. We generalize several properties, including symmetry and stability from the analysis of binary LDPC codes. We show that under a Gaussian approximation, the entire q-1 dimensional distribution of the vector messages is described by a single scalar parameter (like the distributions of binary LDPC messages). We apply this property to develop EXIT charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present simulation results for the AWGN channel, including results within 0.56 dB of the unconstrained Shannon limit (i.e. not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz.<|reference_end|>
@article{bennatan2005design,
    title={Design and Analysis of Nonbinary LDPC Codes for Arbitrary
  Discrete-Memoryless Channels},
    author={Amir Bennatan and David Burshtein},
    journal={IEEE Transactions on Information Theory, vol. IT-52, no. 2, pp.
  549-583, 2006},
    year={2005},
    doi={10.1109/TIT.2005.862080},
    archivePrefix={arXiv},
    eprint={cs/0511040},
    primaryClass={cs.IT math.IT}
}