EXIT functions for binary input memoryless symmetric channels
Authors:
- A. AshikhminAAA. Ashikhmin
- S. LitsynSLS. Litsyn
- 17 July 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 54 (7) , 1207-1214
Abstract
Use of extrinsic information transfer (EXIT) functions, characterizing the amplification of mutual information between the input and output of the maximum a posteriori (MAP) decoder, significantly facilitates analysis of iterative coding schemes. Previously, EXIT functions derived for binary erasure channels (BECs) were used as an approximation for other channels. Here, we improve on this approach by introducing more accurate methods to construct EXIT functions for binary-input memoryless symmetric (BMS) channels. By defining an alternative pseudo-MAP decoder coinciding with the MAP decoder over BEC, we provide an expression for the EXIT functions of block codes over BEC. Furthermore, we draw a connection between the EXIT function over BEC and the EXIT function over the BMS channel under certain conditions. This is used for deriving accurate or approximate expressions of EXIT functions over BMS channels in certain scenariosKeywords
This publication has 10 references indexed in Scilit:
- Analysis of Low-Density Parity-Check Codes Based on EXIT FunctionsIEEE Transactions on Communications, 2006
- Extremes of Information CombiningIEEE Transactions on Information Theory, 2005
- Bounds on Information CombiningIEEE Transactions on Information Theory, 2005
- Extrinsic information transfer functions: model and erasure channel propertiesIEEE Transactions on Information Theory, 2004
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 12002
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Convergence of iterative decodingElectronics Letters, 1999
- An optimum symbol-by-symbol decoding rule for linear codesIEEE Transactions on Information Theory, 1976
- Low-Density Parity-Check Codes1963