Constrained Information Combining: Theory and Applications for LDPC Coded Systems

Author

Sutskover, I. ; Shamai, Shlomo ; Ziv, J.

Author_Institution

Fac. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa

Volume

53

Issue

5

fYear

2007

fDate

5/1/2007 12:00:00 AM

Firstpage

1617

Lastpage

1643

Abstract

This paper tightens previous information combining bounds on the performance of iterative decoding of binary low-density parity-check (LDPC) codes over binary-input symmetric-output channels by tracking the probability of erroneous bit in conjunction with mutual information. Evaluation of the new bounds as well as of other known bounds on different LDPC ensembles demonstrates sensitivity of the finite dimensional iterative bounds to lambda₂, the fraction of edges connected to degree 2 variable nodes

Keywords

binary codes; channel coding; error statistics; iterative decoding; parity check codes; LDPC; binary low-density parity-check code; binary-input symmetric-output channel; error probability; finite dimensional iterative bound; iterative decoding; tracking; Bit error rate; Channel coding; Constraint theory; Error analysis; Information analysis; Iterative decoding; Jacobian matrices; Mutual information; Parity check codes; Performance analysis; Bit error rate (BER); Chebyshev systems; Lagrange dual problem; channel coding; entropy; extrinsic information transfer (EXIT) charts; information combining; information flow; iterative decoding; low-density parity-check (LDPC) codes; maximum a posteriori probability (MAP) decoding; mutual information; probability of error; turbo codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2007.894645

Filename

4167754