Sharp Bounds on Generalized EXIT Functions

Authors:
N. Macris
Affiliations:
Ecole Polytechnique Federale de Lausanne, Lausanne
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 4

Capacity-achieving codes for finite-state channels with maximum-likelihood decoding

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Sharp bounds for optimal decoding of low-density parity-check codes

IEEE Transactions on Information Theory
Decay of correlations in low density parity check codes: low noise regime

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity-achieving codes for channels with memory with maximum-likelihood decoding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1

Quantified Score

Hi-index	754.90

Visualization

Abstract

We consider communication over binary-input memoryless symmetric channels with low-density parity-check (LDPC) codes. The relationship between maximum a posteriori and belief propagation decoding is investigated using a set of correlation inequalities that first appeared in statistical mechanics of Gaussian spin glasses. We prove bounds on generalized extrinsic information transfer (EXIT) functions, that are believed to be tight, and discuss their relationship with the ones obtained by the interpolation method.