Extrinsic information transfer functions: model and erasure channel properties
Top Cited Papers
- 25 October 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (11) , 2657-2673
- https://doi.org/10.1109/tit.2004.836693
Abstract
Extrinsic information transfer (EXIT) charts are a tool for predicting the convergence behavior of iterative processors for a variety of communication problems. A model is introduced that applies to decoding problems, including the iterative decoding of parallel concatenated (turbo) codes, serially concatenated codes, low-density parity-check (LDPC) codes, and repeat-accumulate (RA) codes. EXIT functions are defined using the model, and several properties of such functions are proved for erasure channels. One property expresses the area under an EXIT function in terms of a conditional entropy. A useful consequence of this result is that the design of capacity-approaching codes reduces to a curve-fitting problem for all the aforementioned codes. A second property relates the EXIT function of a code to its Helleseth-Klove-Levenshtein information functions, and thereby to the support weights of its subcodes. The relation is via a refinement of information functions called split information functions, and via a refinement of support weights called split support weights. Split information functions are used to prove a third property that relates the EXIT function of a linear code to the EXIT function of its dual.Keywords
This publication has 41 references indexed in Scilit:
- Design of Serially Concatenated Systems Depending on the Block LengthIEEE Transactions on Communications, 2004
- Higher weights and graded rings for binary self-dual codesDiscrete Applied Mathematics, 2003
- Iterative turbo decoder analysis based on density evolutionIEEE Journal on Selected Areas in Communications, 2001
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximationIEEE Transactions on Information Theory, 2001
- 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
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- Analyzing the turbo decoder using the Gaussian approximationIEEE Transactions on Information Theory, 2001
- The effective length of subcodesApplicable Algebra in Engineering, Communication and Computing, 1994
- The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)Discrete Mathematics, 1977