Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel

IEEE Transactions on Information Theory

Volumn 55, Issue 6, 2009, Pages 2602-2617

  Sason, Igal ^a   Wiechman, Gil ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Accumulate repeat accumulate (ARA) codes; Area theorem; Binary erasure channel (BEC); Density evolution (DE); Extrinsic information transfer (EXIT) charts; Iterative message passing decoding; Low density parity check (LDPC) codes; Stability condition

Indexed keywords

ACCUMULATE-REPEAT-ACCUMULATE (ARA) CODES; AREA THEOREM; BINARY ERASURE CHANNEL (BEC); DENSITY EVOLUTION (DE); EXTRINSIC INFORMATION TRANSFER (EXIT) CHARTS; ITERATIVE MESSAGE-PASSING DECODING; LOW-DENSITY PARITY-CHECK (LDPC) CODES; STABILITY CONDITION;

CHANNEL CAPACITY; CONTROL THEORY; MESSAGE PASSING;

ITERATIVE DECODING;

EID: 67049086587     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2018342     Document Type: Article

References (34)

1. A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate-repeat-accumulate codes," IEEE Trans. Commun., vol. 55, no. 4, pp. 692-702, Apr. 2007.
2. A. Amraoui, A. Montanari, and R. Urbanke, "How to find good finite-length codes: From art towards science," Europ. Trans. Telecommun., vol. 18, no. 5, pp. 491-508, Aug. 2007.
3. K. Andrews, V. Stanton, S. Dolinar, V. Chen, J. Berner, and F. Pollara, "Turbo-decoder implementation for the deep space network," in The Interplanetary Network Progress Report, Oct.-Dec. 2001, pp. 1-20, IPN Progress Rep. 42-148.
4. M. Ardakani, B. Smith, W. Yu, and F. R. Kschischang, "Complexity-optimized low-density parity-check codes," in Proc. 43rd Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2005, pp. 45-54.
5. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
6. O. Barak, D. Burshtein, and M. Feder, "Bounds on achievable rates of LDPC codes used over the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2483-2489, Oct. 2004.
7. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 909-926, May 1998.
8. C. Di, D. Proietti, I. E. Telatar, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
9. C. H. Hsu and A. Anastasopoulos, "Capacity-achieving codes for noisy channels with bounded graphical complexity and maximum-likelihood decoding," IEEE Trans. Inf. Theory, submitted for publication.
10. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 1-8.
11. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel," in Proc. IEEE Int. Symp. Information Theory (ISIT), Washington, DC, Jun. 2001, p. 1.
12. A. Khandekar, "Graph-based Codes and Iterative Decoding," Ph.D. dissertation, Clifornia Inst. Technol., Pasadena, CA, 2002.
13. M. G. Luby,M.Mitzenmacher,M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure-correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
14. M. G. Luby, "LT codes," in Proc. 43rd Symp. Foundations of Computer Science (FOCS 2002), Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
15. X. Ma and E. Yang, "Low-density parity-check codes with fast decoding convergence speed," in Proc. Int. Symp. Information Theory (ISIT) Chicago, IL, Jun. 2004, p. 277.
16. R. J. McEliece, "Are turbo-like codes effective on nonstandard channels?," IEEE Information Theory Soc. Newsletter, vol. 51, no. 4, pp. 1-8, Dec. 2001.
17. C. Measson, A. Montanari, T. Richardson, and R. Urbanke, "The generalized area theorem and some of its consequences," IEEE Trans. Inf. Theory, Nov. 2005 [Online]. Available: http://arxiv.org/abs/cs/0511039″, submitted for publication
18. C. Measson, "Conservation laws for coding," Ph.D. dissertation, EPFL, Lausanne, Switzerland, 2006.
19. P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
20. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2362-2379, Jul. 2005.
21. 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. Inf. Theory, vol. 53, no. 6, pp. 2088-2115, Jun. 2007.
22. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Uni. Press, 2008 [Online].HAvailable: http:// lthcwww.epfl.ch/mct/index.php
23. T. Richardson and R. Urbanke, "Finite-Length Density Evolution and the Distribution of the Number of Iterations for the Binary Erasure Channel," [Online]. Available: http://lthcwww.epfl.ch/RiU02.ps, unpublished
24. I. Sason, "On universal properties of capacity-approaching LDPC code ensembles," IEEE Trans. Inf. Theory, to be published.
25. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1611-1635, Jul. 2003.
26. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1247-1256, Jun. 2004.
27. R. Y. Shao, S. Lin, and M. P. C. Fossorier, "Two simple stopping criteria for turbo decoding," IEEE Trans. Commun., vol. 47, no. 8, pp. 1117-1120, Aug. 1999.
28. E. Sharon, S. Litsyn, and J. Goldenberg, "Efficient serial message-passing schedules for LDPC decoding," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4076-4091, Nov. 2007.
29. A. Shokrollahi, "Capacity-achieving sequences," IMA Volume in Mathematics and its Applications, vol. 123, pp. 153-166, 2000.
30. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
31. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
32. S. ten Brink, "Code characteristic matching for iterative decoding of serially concatenated codes," Ann. Telecommun., vol. 56, no. 7-8, pp. 394-408, Jul.-Aug. 2001.
33. W. Yu, M. Ardakani, B. Smith, and F. R. Kschischang, "Complexity-optimized LDPC codes for Gallager decoding algorithm B," in Proc, IEEE Int. Symp. Information Theory (ISIT), Adelaide, Australia, Sep. 2005, pp. 1488-1492.
34. Big-O Notation, [Online]. Available: http://www.nist.gov/dads/HTML/bigOnotation.html