Iterative decoding of compound codes by probability propagation in graphical models

IEEE Journal on Selected Areas in Communications

Volumn 16, Issue 2, 1998, Pages 219-230

  Kschischang, Frank R ^a,b,c   Frey, Brendan J ^d  

^a IEEE   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Concatenated coding; Decoding; Graph theory; Iterative methods; Product codes

Indexed keywords

ALGORITHMS; GRAPH THEORY; ITERATIVE METHODS; RANDOM PROCESSES;

COMPOUND CODES; CONCATENATED CODING; GRAPHICAL MODELS; ITERATIVE DECODING ALGORITHMS;

DECODING;

EID: 0031996401     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.661110     Document Type: Article

References (37)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun. (ICC), Geneva, Switzerland, 1993, pp. 1064-1070.
2. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
3. S. Benedetto and G. Montorsi, "Serial concatenation of block and convolutional codes," Electron. Lett., vol. 32, pp. 887-888, 1996.
4. _, "Iterative decoding of serially concatenated convolutional codes," Electron. Lett., vol. 32, pp. 1186-1188, 1996.
5. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
6. J. Lodge, R. Young, P. Hoeher, and J. Hagenauer, "Separable MAP "filters' for the decoding of product and concatenated codes," in Proc. IEEE Int. Conf. Commun., 1993, pp. 1740-1745.
7. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, 1996.
8. B. J. Frey and F. R. Kschischang, "Probability propagation and iterative decoding," in Proc. 34th Annual Allerton Conf. Commun., Contr., Computing, Monticello, IL, Oct. 1996, pp. 482-493.
9. B. J. Frey, Graphical Models for Machine Learning and Digital Communication. Cambridge, MA: MIT Press, 1998 [www]. http://www.cs.utoronto.ca/~frey.
10. J. Pearl, "Fusion, propagation, and structuring in belief networks," Artif. Intell., vol. 29, pp. 241-288, 1986.
11. S. L. Lauritzen and D. J. Spiegelhalter, "Local computations with probabilities on graphical structures and their application to expert systems," J. Roy. Stat. Soc. B, vol. 50, pp. 157-224, 1988.
12. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988, revised 2nd printing.
13. R. E. Neapolitan, Probabilistic Reasoning in Expert Systems: Theory and Algorithms. Toronto, Ont., Canada: Wiley, 1990.
14. F. V. Jensen, An Introduction to Bayesian Networks. New York: Springer Verlag, 1996.
15. S. L. Lauritzen, Graphical Models. Oxford, U.K.: Oxford Univ. Press, 1996.
16. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding, 5th IMA Conf., C. Boyd, Ed., no. 1025 in Lecture Notes in Computer Science. Berlin, Germany: Springer, 1995, pp. 100-111.
17. _, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, 1996. Reprinted in Electron. Lett., vol. 33, pp. 457-458, Mar. 1997.
18. _, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, 1996. Reprinted in Electron. Lett., vol. 33, pp. 457-458, Mar. 1997.
19. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, submitted for publication, 1997.
20. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's 'belief propagation' algorithm," this issue, pp. 140-152.
21. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Eur. Trans. Telecommun., vol. 6, pp. 513-525, Sept./Oct. 1995.
22. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Sweden, 1996.
23. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
24. G. D. Forney, Jr., "Trellises old and new," in Communications and Cryptography: Two Sides of One Tapestry, R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer, Eds. Norwell, MA: Kluwer, 1994, pp. 115-128.
25. _, "The forward-backward algorithm," in Proc. 34th Annual Allerton Conf. Commun., Contr., Computing, Monticello, IL, Oct. 1996, pp. 432-446.
26. R. Kindermann and J. L. Snell, Markov Random Fields and their Applications. Providence, RI: American Mathematical Society, 1980.
27. C. J. Preston. Gibbs States on Countable Sets. Cambridge, U.K.: Cambridge Univ. Press, 1974.
28. V. Isham, "An introduction to spatial point processes and Markov random fields," Int. Statist. Rev., vol. 49, pp. 21-43, 1981.
29. G. E. Hinton and T. J. Sejnowski, "Learning and relearning in Boltzmann machines," Parallel Distributed Processing: Explorations in the Microstructure of Cognition, D. E. Rumelhart and J. L. McClelland, Eds. Cambridge MA: MIT Press, 1986, vol. I, pp. 282-317.
30. S. M. Aji and R. J. McEliece, "A general algorithm for distributing information on a graph," in Proc. 1997 IEEE Int. Symp. Inform. Theory, Ulm, Germany, July 1997, p. 6.
31. S. Verdú and H. V. Poor, "Abstract dynamic programming models under commutativity conditions," SIAM J. Contr. Optim., vol. 25, pp. 990-1006, July 1987.
32. R. J. McEliece, "On the BJCR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
33. E. Schrödinger, Statistical Thermodynamics. Cambridge: Cambridge University Press, 1962.
34. B. J. Frey, F. R. Kschischang, and P. G. Gulak, "Concurrent turbodecoding," in Proc. 1997 IEEE Int. Symp. Inform. Theory. Ulm, Germany, 1997, p. 431.
35. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
36. L. E. Baum and T. Petrie, "Statistical inference for probabilistic funclions of finite state Markov chains," Ann. Math. Statist., vol. 37, pp. 1559-1563, 1966.
37. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, 1974.