Bounds on the performance of belief propagation decoding

David Burshtein*, Gadi Miller

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We consider Gallager's soft-decoding (belief propagation) algorithm for decoding low-density parity-check (LDPC) codes, when applied to an arbitrary binary-input symmetric-output channel. By considering the expected values of the messages, we derive both lower and upper bounds on the performance of the algorithm. We also derive various properties of the decoding algorithm, such as a certain robustness to the details of the channel noise. Our results apply both to regular and irregular LDPC codes.

Original languageEnglish
Pages (from-to)112-122
Number of pages11
JournalIEEE Transactions on Information Theory
Volume48
Issue number1
DOIs
StatePublished - Jan 2002

Keywords

  • Belief propagation
  • Iterative decoding
  • Low-density parity-check (LDPC) codes
  • Sum product algorithm

Fingerprint

Dive into the research topics of 'Bounds on the performance of belief propagation decoding'. Together they form a unique fingerprint.

Cite this