Factor graphs

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Belief propagation and many algorithms used in digital communications and signal processing are all representations of a more general message-passing algorithm, the sum-product algorithm, operating on factor graphs. This algorithm computes marginals of a global probabilistic function in terms of local functions. The factor graph of a code is a visual expression of this factorization into local probabilistic functions. Aji and McEliece present an equivalent but alternative formulation with their generalized distributive law (GDL). In this chapter we discuss the sum-product algorithm after examining graphical models for probabilistic inference.

Original languageEnglish (US)
Title of host publicationTrellis and Turbo Coding
PublisherJohn Wiley and Sons Inc.
Pages227-249
Number of pages23
ISBN (Electronic)9780471667841
ISBN (Print)0471227552, 9780471227557
DOIs
StatePublished - Jan 1 2004
Externally publishedYes

Keywords

  • Belief propagation
  • Decoding
  • Markov processes
  • Probabilistic logic
  • Probability
  • Signal processing algorithms
  • Sum product algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)
  • Social Sciences(all)

Fingerprint Dive into the research topics of 'Factor graphs'. Together they form a unique fingerprint.

  • Cite this

    Howard, S. L. (2004). Factor graphs. In Trellis and Turbo Coding (pp. 227-249). John Wiley and Sons Inc.. https://doi.org/10.1002/0471667846.ch8