Skip to main content

Belief Propagation and Parallel Decoding

  • Chapter
Turbo Coding

Abstract

Probabilistic reasoning can be modeled through the use of graphs — the vertices in the graphs represent random variables, while the edges represent dependencies between the random variables. Such representations play a fundamental role in the development of expert systems, in part because they allow for a rapid factorization and evaluation of the joint probability distributions of the graph variables [CGH97].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. S.M. Aji and RJ. McEliece. A general algorithm for distributing information on a graph. In Proc. 1997 IEEE Int. Symp. on Inform. Theory, Ulm, Germany, July 1997.

    Google Scholar 

  2. C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding: Turbo Codes. Proceedings of the 1993 International Conference on Communications, pages 1064–1070, 1993.

    Google Scholar 

  3. E. Castillo, J.M. Gutierrez and A.S. Hadi. Expert Systems and Probabilistic Network Models. Monographs in Computer Science, Springer-Verlag, 1997.

    Book  Google Scholar 

  4. G.F. Cooper. The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks. Artificial Intelligence 42:393–405, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  5. F.V. Jensen, S.L. Lauritzen and K.G. Olesen, “Bayesian updating in recursive graphical models by local computation,” Computational Statistical Quarterly 4:269–282, 1990.

    MathSciNet  Google Scholar 

  6. S. Kim. Probabilistic Reasoning, Parameter Estimation, and Issues in Turbo Decoding. Ph.D. dissertation, Cornell University, 1998.

    Google Scholar 

  7. S. Kim and S.B. Wicker. A Connection Between the Baum-Welch Algorithm and Turbo Decoding. Proceedings of the 1998 Information Theory Workshop, Killarney, Ireland, June 22–26, pp. 12–13, 1998.

    Google Scholar 

  8. S. Kim and S.B. Wicker. Belief Propagation in Graphs and Parallel Turbo Decoding. Submitted to the IEEE Transactions on Information Theory, 1998.

    Google Scholar 

  9. F.R. Kschischang and B.J. Frey. Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models. IEEE Journal on Selected Areas in Communications, SAC-16(2):219–230, 1998.

    Article  Google Scholar 

  10. S.L. Lauritzen and DJ. Spiegelhalter. Local Computation with Probabilities on Graphical Structures and Their Application to Expert Systems. Journal of the Royal Statistical Society, Series B, 50:157–224, 1988.

    MathSciNet  MATH  Google Scholar 

  11. D.J.C. MacKay and R.M. Neal. Good error-correcting codes based on very sparse matrices. In Cryptography and Coding, 5th IMA Conference no. 1025 in Lecture Notes in Computer Science, pp. 100–111, Springer-Verlag, 1995.

    Google Scholar 

  12. D.J.C. MacKay. Good Error-Correcting Codes based on Very Sparse Matrices. Submitted to IEEE Trans. Inform. Theory.

    Google Scholar 

  13. R.J. McEliece, E. Rodemich and J.-F. Cheng. The Turbo Decision Algorithm. In Proc. 33rd Allerton Conference on Communications, Control and Computing, 1995.

    Google Scholar 

  14. R.J. McEliece, D.J.C. MacKay and J.-F. Cheng. Turbo Decoding as an Instance of Pearl’s;Belief Propagation1 Algorithm. IEEE Journal on Selected Areas in Communications, SAC-16(2):140–152, 1998.

    Article  Google Scholar 

  15. J. Pearl, Probablistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1988.

    Google Scholar 

  16. S.E. Shimony. Finding MAPs for belief networks is NP-hard. Artificial Intelligence 68:399–410, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  17. M. Sipser and D.A. Spielman. Expander Codes. IEEE Trans. Inform. Theory, IT-42:1710–1722, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  18. P. Smyth, D. Heckerman and M.I. Jordan. Probabilistic Independence Networks for Hidden Markov Probability Models. Neural Computation 9:227–269, 1997.

    Article  MATH  Google Scholar 

  19. R.M. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inform. Theory, vol.IT-27, pp. 533–547, Sept. 1981.

    Article  MathSciNet  MATH  Google Scholar 

  20. Y. Weiss. Belief Propagation and Revision in Networks with Loops. M.I.T. A.I. Memo No. 1616 and C.B.C.L. Paper No. 155, Nov. 1997.

    Google Scholar 

  21. N. Wiberg, H.-A. Loeliger and R. Kotter. Codes and iterative decoding on general graphs. European Trans. on Telecommunication,6:513–525, 1995

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Heegard, C., Wicker, S.B. (1999). Belief Propagation and Parallel Decoding. In: Turbo Coding. The Springer International Series in Engineering and Computer Science, vol 476. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2999-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2999-3_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5069-7

  • Online ISBN: 978-1-4757-2999-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics