Extremes of information combining

Author

Sutskover, Ilan ; Shamai, Shlomo ; Ziv, Jacob

Author_Institution

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

Volume

51

Issue

4

fYear

2005

fDate

4/1/2005 12:00:00 AM

Firstpage

1313

Lastpage

1325

Abstract

Extreme densities for information combining are found for two important channel models: the binary-input symmetric parallel broadcast channel and the parity-constrained-input symmetric parallel channels. Following, upper and lower mutual information thresholds are stated for per-bit maximum a posteriori probability (MAP) decoding and low-density parity-check (LDPC) code ensembles.

Keywords

broadcast channels; channel coding; iterative decoding; maximum likelihood decoding; parity check codes; turbo codes; EXIT; LDPC; MAP decoding; binary-input symmetric parallel channel; broadcast channel; channel coding; extrinsic information transfer charts; information combining extreme density; iterative decoding; low-density parity-check code; maximum aposteriori probability; mutual information; parity-constrained-input channel; turbo codes; Broadcasting; Data mining; Iterative algorithms; Iterative decoding; Jacobian matrices; Mutual information; Parity check codes; Performance analysis; Tree graphs; Turbo codes; Channel coding; extrinsic information transfer (EXIT) charts; information combining; iterative decoding; low-density parity-check (LDPC) codes; mutual information; turbo codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2005.844077

Filename

1412027