An analysis of the block error probability performance of iterative decoding

IEEE Transactions on Information Theory

Volumn 51, Issue 11, 2005, Pages 3834-3855

  Lentmaier, Michael ^a,b   Truhachev, Dmitri V ^c   Zigangirov, Kamil Sh ^a,d   Costello Jr , Daniel J ^a  

^a University of Notre Dame   (United States)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

^c UNIVERSITY OF ALBERTA   (Canada)

^d INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Belief propagation; Block error probability; Convergence analysis; Density evolution; Iterative decoding; Low density parity check (LDPC) codes; Turbo codes

Indexed keywords

ALGORITHMS; BIT ERROR RATE; BLOCK CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); CONVERGENCE OF NUMERICAL METHODS; DECODING; ERROR ANALYSIS; ITERATIVE METHODS; PROBABILITY; TURBO CODES;

BELIEF PROPAGATION; BLOCK ERROR PROBABILITY; CONVERGENCE ANALYSIS; DENSITY EVOLUTION; ITERATIVE DECODING; LOW-DENSITY PARITY-CHECK (LDPC) CODES;

SIGNAL ENCODING;

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

References (45)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
3. C. Berrou, G. Glavieux, and P. Thitimajshima, "Near Shannon limit coding and decoding: Turbo-codes" in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
4. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inf. Theory, vol. IT-11, no. 1, pp. 3-18, Jan. 1965.
5. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.
6. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1451-1461, Jun. 2002.
7. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
8. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practically loss-resilient codes," in Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, 1997, pp. 150-159.
9. M. 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.
10. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
11. K. S. Zigangirov, M. Lentmaier, and D. V. Truhachev, "Two approaches to the analysis of low-density parity-check codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun/ Jul. 2002, p. 29.
12. V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes," Probl. Inf. Transmission (Probl. Pered. Inform.), vol. 11, no. 1, pp. 18-28, May 1976.
13. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1723, Nov. 1996.
14. D. Burshtein and G. Miller, "Expander graph arguments for message-passing algorithms," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 782-790, Feb. 2001.
15. M. Lentmaier, D. V. Truhachev, and K. S. Zigangirov, "On the theory of low-density convolutional codes II," Probl. Inf. Transm. (Probl. Pered. Inform.), vol. 37, no. 4, pp. 288-306, Oct./Dec. 2001.
16. A. Khandekar and R. J. McEliece, "A lower bound on the iterative decoding threshold of irregular LDPC code ensembles," in Proc. 36th Conf. Information Sciences and Systems (CISS 2002), Princeton, NJ, Mar. 2002.
17. A. Khandekar, "Graph-based codes and iterative decoding," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, CA, 2002.
18. A. Bhattacharyya, "On a measure of divergence between two statistical populations defined by their probability distributions," Bull. Calcutta Math. Soc., vol. 35, pp. 99-110, 1943.
19. M. Lentmaier, D. V. Truhachev, D. J. Costello Jr., and K. Sh. Zigangirov, "On the block error probability of iteratively decoded LDPC codes," in Proc. 5th ITG Conf. Source and Channel Coding, Erlangen, Germany, Jan. 2004, pp. 71-78.
20. M. Lentmaier, D. V. Truhachev, D. J. Costello Jr., and K. Sh. Zigangirov, "Turbo codes and Shannon's condition for reliable communication," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 442.
21. A.J. Feltström and K. Sh. Zigangirov, "Periodic time-varying convolutional codes with low-density parity-check matrices," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 2181-2190, Sep. 1999.
22. K. Engdahl and K. Sh. Zigangirov, "On the theory of low-density convolutional codes I," Probl. Inf. Transm. (Probl. Pered. Inform.), vol. 35, no. 4, pp. 295-310, Oct./Dec. 1999.
23. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, submitted for publication.
24. M. Lentmaier and K. Sh. Zigangirov, "Iterative decoding of generalized low-density parity-check codes," in Proc. IEEE Int. Symp. Information Theory, Boston, MA, Aug. 1998, p. 149.
25. M. Lentmaier and K. Sh. Zigangirov, "On generalized low-density parity-check codes based on Hamming component codes," IEEE Commun. Lett., vol. 3, no. 8, pp. 248-250, Aug. 1999.
26. M. Lentmaier, D. V. Truhachev, and K. Sh. Zigangirov, "Iteratively decodable sliding codes on graphs," in Proc. 8th Int. Workshop on Algebraic and Combinatorial Theory (ACCT-VIII), St. Petersburg, Russia, Sep. 2002, pp. 190-193.
27. D. V. Truhachev, M. Lentmaier, and K. Sh. Zigangirov, "On braided block codes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 32.
28. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
29. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
30. K. Pehkonen and P. Komulainen, "A superorthogonal turbo-code for CDMA applications," in Proc. IEEE 4th Int. Symp. Spread Spectrum Techniques and Applications, vol. 2, Mainz, Germany, Sep. 1996, pp. 580-584.
31. O. Wintzell, M. Lentmaier, and K. Sh. Zigangirov, "Asymptotic analysis of superorthogonal turbo codes," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 253-258, Jan. 2003.
32. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 284-287, Mar. 1974.
33. S. Sesia, G. Caire, and G. Vivier, "Incremental redundancy hybrid arq schemes based on low-density parity-check codes," IEEE Trans. Commun., vol. COM-52, no. 8, pp. 1311-1321, Aug. 2004.
34. D. V. Truhachev, M. Lentmaier, and K. Sh. Zigangirov, "Some results concerning design and decoding of turbo codes," in Probl. Inf. Transm. (Probl. Pered. Inform.), vol. 37, Jul./Sept. 2001, pp. 190-205.
35. T. Johansson and K. Sh. Zigangirov, "A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes," IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 3124-3129, Nov. 1998.
36. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
37. T. Richardson and R. Urbanke, "Thresholds for turbo codes," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, Jun. 2000, p. 317.
38. T. Richardson and R. Urbanke, "An introduction to the analysis of iterative coding systems," in Codes, Systems, and Graphical Models, ser. IMA Volume in Mathematics and Its Applications. New York: Springer-Vrtlsg, 2001, pp. 1-37.
39. H. El Gamal and A. R. Hammons, Jr., "Analyzing the turbo decoder using the Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 671-686, Feb. 2001.
40. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
41. D. Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 891-907, May 2001.
42. K. Sh. Zigangirov and M. Lentmaier, "Mathematical analysis of an iterative decoding algorithm for low-density codes," Probl. Inf. Transm. (Probl. Pered. Inform.), vol. 36, no. 4, pp. 314-324, Oct./Dec. 2000.
43. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, N.J.: IEEE Press, 1999.
44. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," IEEE Trans. Inf. Theory, submitted for publication.
45. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1692-1710, Aug. 2004.