On extrinsic information of good binary codes operating over Gaussian channels
- 7 August 2006
- journal article
- research article
- Published by Wiley in European Transactions on Telecommunications
- Vol. 18 (2) , 133-139
- https://doi.org/10.1002/ett.1130
Abstract
We show that the extrinsic information about the coded bits of any good (capacity achieving) binary code operating over a Gaussian channel is zero when the channel capacity is lower than the code rate and unity when capacity exceeds the code rate, that is, the extrinsic information transfer (EXIT) chart is a step function of the signal to noise ratio and independent of the code. It follows that, for a common class of iterative receivers where the error correcting decoder must operate at first iteration at rate above capacity (such as in turbo equalization, iterative channel estimation, parallel and serial concatenated coding and the like), classical good codes which achieve capacity over the Additive White Gaussian Noise Channel are not effective and should be replaced by different new ones. Copyright © 2006 AEIT.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Extremes of Information CombiningIEEE Transactions on Information Theory, 2005
- Mutual Information and Minimum Mean-Square Error in Gaussian ChannelsIEEE Transactions on Information Theory, 2005
- LDPC coded MIMO multiple access with iterative joint decodingIEEE Transactions on Information Theory, 2005
- Code rate and the area under extrinsic information transfer curvesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient Communication Over the Discrete‐Time Memoryless Rayleigh Fading Channel with Turbo Coding/DecodingEuropean Transactions on Telecommunications, 2000
- The empirical distribution of good codesIEEE Transactions on Information Theory, 1997
- Approximation theory of output statisticsIEEE Transactions on Information Theory, 1993