The generalized distributive law

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 325-343

  Aji, Srinivas M ^b   McEliece, Robert J ^a,b  

^a IEEE   (United States)

^b California Institute of Technology   (United States)

Author keywords

Belief propagation; Distributive law; Graphical models; Junction trees; Turbo codes

Indexed keywords

ALGORITHMS; CONVOLUTIONAL CODES; DECODING; FAST FOURIER TRANSFORMS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

BAUM-WELCH ALGORITHMS; BELIEF PROPAGATIONS; GALLAGER-TANNER-WIBERG DECODING ALGORITHMS; GENERAL DISTRIBUTED LAW (GDL); JUNCTION TREES; SHAFER-SHENOY PROBABILITY PROPAGATION ALGORITHMS; TURBO CODES; VITERBI ALGORITHMS;

SIGNAL ENCODING;

EID: 0033907315     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825794     Document Type: Article

References (41)

1. S. M. Aji, "Graphical models and iterative decoding," Ph.D. dissertation, Cal. Inst. Technol., Pasadena, CA, 1999.
2. S. M. Aji, G. B. Horn, and R. J. McEliece, "On the convergence of iterative decoding on graphs with a single cycle," in Proc. 32nd Conf. Information Sciences and Systems, Princeton, NJ, Mar. 1998.
3. S. M. Aji, G. B. Horn, R. J. McEliece, and M. Xu, "Iterative min-sum decoding of tail-biting codes," in Proc. IEEE Information Theory Workshop, Killarney, Ireland, June 1998, pp. 68-69.
4. S. M. Aji, R. J. McEliece, and M. Xu, "Viterbi's algorithm and matrix multiplication," in Proc. 33rd Conf. Information Sciences and Systems, Baltimore, MD, Mar. 1999.
5. 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, Mar. 1974.
6. L. E. Baum and T. Petrie, "Statistical inference for probabilistic functions of finite-state Markov chains," Ann. Math. Stat, vol. 37, pp. 1559-1563, 1966.
7. R. W. Chang and J. C. Hancock, "On receiver structures for channels having memory," IEEE Trans. Inform. Theory, vol. IT-12, pp. 463-4168, Oct. 1966.
8. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comp., vol. 19, p. 297, Apr. 1965.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT-McGraw-Hill, 1990.
10. R. Dechter, "Bucket elimination: A unifying framework for probabilistic inference," Artificial Intell., vol. 113, pp. 41-85, 1999.
11. G. D. Forney Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
12. G. D. Forney Jr., F. R. Kschischang, and B. Marcus, "Iterative decoding of tail-biting trellises," in IEEE Information Theory Workshop, San Diego, CA, Feb. 1998, pp. 11-12.
13. B. J. Frey, "Bayesian networks for pattern classification, data compression, and channel coding," Ph.D. dissertation, Univ. Toronto, Toronto, ON, Canada, 1997.
14. B. J. Frey and D. J. C. MacKay, "A revolution: Belief propagation in graphs with cycles," in Advances in Neural Information Processing Systems, M. I. Jordan, M. I. Kearns, and S. A. Solla, Eds. Cambridge, MA: MIT Press, 1998, pp. 470-485.
15. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
16. _, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
17. R. C. Gonzalez and R. E. Woods, Digital Image Processing. Reading, MA: Addison-Wesley, 1992.
18. F. V. Jensen, An Introduction to Bayesian Networks. New York: Springer-Verlag, 1996.
19. F. V. Jensen and F. Jensen, "Optimal junction trees," in Proc. 10th Conf. Uncertainty in Artificial Intelligence, R. L. de Mantaras and D. Poole, Eds. San Francisco, CA, 1994, pp. 360-366.
20. J. H. Kim and J. Pearl, "A computational model for causal and diagnostic reasoning," in Proc. 8th Int. Joint Conf. Artificial Intelligence, 1983, pp. 190-193.
21. F. R. Kschischang and B. J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models," IEEE J. Select. Areas Commun., vol. 16, pp. 219-230, Feb. 1998.
22. S. L. Lauritzen and F. V. Jensen, "Local computation with valuations from a commutative semigroup," Ann. Math. AI, vol. 21, no. 1, pp. 51-69, 1997.
23. S. L. Lauritzen and D. J. Spiegelhalter, "Local computation with probabilities on graphical structures and their application to expert systems," J. Roy. Statist. Soc. B, pp. 157-224, 1988.
24. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding, 5th IMA Conf., ser. Springer Lecture Notes in Computer Science No. 1025. Berlin, Germany: Springer-Verlag, 1995, pp. 100-111.
25. _, "Near Shannon limit performance of low density parity-check codes," Electron. Lett., vol. 33, pp. 457-4158, 1996.
26. P. L. McAdam, L. R. Welch, and C. L. Weber, "M.A.P. bit decoding of convolutional codes," in P roc. 1972 IEEE Int. Symp. Information Theory, Asilomar, CA, Jan. 1972, p. 91.
27. R. J. McEliece, R. B. Ash, and C. Ash, Introduction to Discrete Mathematics. New York: Random House, 1989.
28. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propagation algorithm," IEEE J. Select. Areas Comm., vol. 16, pp. 140-152, Feb. 1998.
29. J. Pearl, Probabilistic Reasoning in Intelligent Systems. San Mateo, CA: Morgan Kaufmann, 1988.
30. A. M. Poritz, "Hidden Markov models: A guided tour," in Proc. 1988 IEEE Conf. Acoustics, Speech, and Signal Processing, vol. 1, pp. 7-13.
31. E. C. Posner, "Combinatorial structures in planetary reconnaissance," in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1968.
32. L. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol. 77, pp. 257-285, 1989.
33. G. R. Shafer and P. P. Shenoy, "Probability propagation," Ann. Math. Art. Intel., vol. 2, pp. 327-352, 1990.
34. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
35. G. Ungerboeck, "Nonlinear equalization of binary signals in Gaussian noise," IEEE Trans. Commun. Technol., vol. COM-19, pp. 1128-1137, Dec. 1971.
36. S. Verdú and V. Poor, " dynamic programming models under commutativity conditions," SIAM J. Contr. Optimiz., vol. 25, pp. 990-1006, July 1987.
37. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
38. Y. Weiss, "Correctness of local probability propagation in graphical models with loops," Neural Comput., vol. 12, pp. 1-411, 2000.
39. N. Wiberg, "Codes and decoding on general graphs ," dissertation no. 440, Linkoping Studies in Science and Technology, Linkoping, Sweden, 1996.
40. M. Yannakakis, "Computing the minimum fill-in is NP-complete," SIAM J. Alg. Discr. Methods, vol. 2, pp. 77-79, 1981.
41. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, submitted for publication.