Bounds on the performance of belief propagation decoding

Author

Burshtein, David ; Miller, Gadi

Author_Institution

Dept. of Electr. Engineering-Systems, Tel Aviv Univ., Israel

Volume

48

Issue

1

fYear

2002

fDate

1/1/2002 12:00:00 AM

Firstpage

112

Lastpage

122

Abstract

We consider Gallager´s (1963) 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

Keywords

channel coding; error detection codes; graph theory; iterative decoding; noise; Gallager´s soft-decoding algorithm; algorithm performance; belief propagation decoding; binary-input symmetric-output channel; channel noise; irregular LDPC codes; iterative decoding; low-density parity-check codes; lower bounds; memoryless channel; performance bounds; regular LDPC codes; regular graphs; sum product algorithm; upper bounds; Algorithm design and analysis; Belief propagation; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Noise robustness; Parity check codes; Performance analysis; Turbo codes; Upper bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.971742

Filename

971742