On the application of LDPC codes to arbitrary discrete-memoryless channels

Amir Bennatan, David Burshtein

Research output: Contribution to journalArticlepeer-review

Abstract

We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF (q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.

Original languageEnglish
Pages (from-to)417-438
Number of pages22
JournalIEEE Transactions on Information Theory
Volume50
Issue number3
DOIs
StatePublished - Mar 2004

Keywords

  • Belief propagation
  • Coset codes
  • Iterative decoding
  • LDPC codes
  • Q-ary low-density parity check (LDPC)
  • Turbo codes

Fingerprint

Dive into the research topics of 'On the application of LDPC codes to arbitrary discrete-memoryless channels'. Together they form a unique fingerprint.

Cite this