Upper bounds on the MAP threshold of iterative decoding systems with erasure noise

2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Volumn , Issue , 2008, Pages 7-12

  Wang, ChiaWen ^a   Pfister, Henry D ^a  

^a Department of Electrical and Computer Engineering

Author keywords

Erasure channel; EXIT function; Iterative decoding; LDPC codes; MAP threshold

Indexed keywords

A POSTERIORI; BINARY ERASURE CHANNELS; DECODING THRESHOLDS; ERASURE CHANNEL; EXIT FUNCTION; ISI CHANNELS; JOINT ITERATIVE DECODING; LDPC CODES; UPPER BOUNDS;

CODES (SYMBOLS); CONFORMAL MAPPING; DECODING; INTERSYMBOL INTERFERENCE; TURBO CODES;

ITERATIVE DECODING;

EID: 57849087861     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TURBOCODING.2008.4658664     Document Type: Conference Paper

References (17)

1. C. Méasson, A. Montanari, and R. Urbanke, "Maxwell's construction: The hidden bridge between iterative and maximum a posteriori decoding," Arxiv preprint cs.IT/0506083v1, June 2005.
2. C. Méasson, "Conservation laws for coding," Ph.D. dissertation, Swiss Federal Institute of Technology, Lausanne, 2006.
3. S. ten Brink, "Convergence of iterative decoding," Electronic Letters, vol. 35, no. 10, pp. 806-808, May 1999.
4. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
5. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: model and erasure channel properties," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2657-2674, Nov. 2004.
6. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. Int. Symp. on Turbo Codes & Related Topics, Brest, France, Sept. 2000.
7. A. Abbasfar, D. Divsalar, and Y. Kung, "Accumulate repeat accumulate codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, June 2004, p. 505.
8. H. D. Pfister and I. Sason, "Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity," IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 2088-2115, June 2007.
9. C. Douillard, M. Jézéquel, C. Berrou, A. Picart, P. Didier, and A. Glavieux, "Iterative correction of intersymbol interference: Turbo equalization," Eur. Trans. Telecom., vol. 6, no. 5, pp. 507-511, Sept. - Oct. 1995.
10. B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, "Joint message-passing decoding of LDPC codes and partial-response channels," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1410-1422, June 2002.
11. H. D. Pfister and P. H. Siegel, "Joint iterative decoding of LDPC codes for channels with memory and erasure noise," IEEE J. Select. Areas Commun., vol. 26, no. 2, pp. 320-337, Feb. 2008.
12. C. Méasson, A. Montanari, and R. Urbanke, "Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, June 2004, p. 225.
13. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
14. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
15. A. Montanari, "Tight bounds for LDPC and LDGM codes under MAP decoding," IEEE Trans. Inform. Theory, vol. 51, no. 9, pp. 3221-3246, 2005.
16. H. D. Pfister, "On the capacity of finite state channels and the analysis of convolutional accumulate-m codes," Ph.D. dissertation, University of California, San Diego, La Jolla, CA, USA, March 2003.
17. C. Measson, A. Montanari, T. Richardson, and R. Urbanke, "The generalized area theorem and some of its consequences," Arxiv preprint cs.IT/0511039, 2005.