Maximum a posteriori decoding and turbo codes for general memoryless channels

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1241-1245

  Méasson, Cyril ^a   Urbanke, Rüdiger ^a   Montanari, Andrea ^b   Richardson, Tom ^c  

^a EPFL   (Switzerland)

^b CNRS   (France)

^c QUALCOMM INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL MEMORYLESS CHANNELS; GENERALIZED EXIT CURVES;

ITERATIVE METHODS; TURBO CODES;

DECODING;

EID: 33749434954     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523540     Document Type: Conference Paper

References (17)

1. C. Méasson and R. Urbanke, "An upper-bound for the ML threshold of iterative coding systems over the BEC", Proc. of the forty-first Allerton Conference on Communications, Control and Computing, Allerton House, Monticello, USA, October 1-3, 2003.
2. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans. on Communications, vol. 49, no. 10, October 2001.
3. A. Ashikhmin, G. Kramer and S. ten Brink, "Code rate and the area under extrinsic information transfer curves", Proc. of the 2002 ISIT, Lausanne, Switzerland, June 30-July 5, 2002.
4. A. Ashikhmin, G. Kramer and S. ten Brink, "Extrinsic Information Transfer Functions: Model and Erasure Channel Property", IEEE Trans. on Information Theory, vol. 50, no. 11, pp. 2657-2673, November 2004.
5. C. Méasson, A Montanari and R. Urbanke, "Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding", Proc. of the 2004 ISIT, Chicago, USA, June 27-July 2, 2004.
6. C. Méasson, A Montanari, T. Richardson and R. Urbanke, "Life above threshold: from list decoding to Area Theorem and MSE", Proc. of the 2004 ITW, San Antonio, USA, October 24-29, 2004.
7. M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi and D.A. Spielman, "Efficient erasure correcting codes", IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 569-584, February 2001.
8. M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi and D.A. Spielman, "Improved low-density parity-check codes using irregulars graphs", IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 585-598, February 2001.
9. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 599-618, February 2001.
10. T. Richardson, M.A. Shokrollahi and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes", IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 619-637, February 2001.
11. R. G. Gallager, Low-Density Parity-Check Codes, Monograph, M.I.T. Press, 1963.
12. C. Berrou, A. Glavieux and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding", Proc. of ICC'93, pp. 1064-1070, Geneve, Switzerland, May 1993.
13. C. Méasson and R. Urbanke, "Further analytic properties of EXIT-like curves and applications", Proc. of the 2003 ISIT, Yokohama, Japan, June 29-July 4, 2003.
14. T. J. Richardson and R. Urbanke, "Thresholds for Turbo codes", Proc. of the 2001 ISIT, Sorrento, Italy, June 25-30, 2000.
15. T. J. Richardson and R. Urbanke, Modern Coding Theory, preliminary draft, January 2005.
16. J. Hagenauer, E. Offer and L. Papke, "Iterative Decoding of Binary Block and Convolutional Codes", IEEE Trans. on Information Theory, vol. 42, no. 2, pp. 429-445, March 1996.
17. D. Guo, S. Shamai and S. Verdú, "Mutual Information and Minimum Mean-Square Error in Gaussian Channels", IEEE Trans. on Information Theory, vol. 51, no. 4, pp. 1261-1283, April 2005.