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

Fingerprint

Message passing
Factorization
Signal processing
communications
Law
Communication

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)

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

Factor graphs. / Howard, Sheryl L.

Trellis and Turbo Coding. John Wiley and Sons Inc., 2004. p. 227-249.

Research output: Chapter in Book/Report/Conference proceedingChapter

Howard, SL 2004, Factor graphs. in Trellis and Turbo Coding. John Wiley and Sons Inc., pp. 227-249. https://doi.org/10.1002/0471667846.ch8
Howard SL. Factor graphs. In Trellis and Turbo Coding. John Wiley and Sons Inc. 2004. p. 227-249 https://doi.org/10.1002/0471667846.ch8
Howard, Sheryl L. / Factor graphs. Trellis and Turbo Coding. John Wiley and Sons Inc., 2004. pp. 227-249
@inbook{cd4e27d07d764f13a847bc0894ee1190,
title = "Factor graphs",
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.",
keywords = "Belief propagation, Decoding, Markov processes, Probabilistic logic, Probability, Signal processing algorithms, Sum product algorithm",
author = "Howard, {Sheryl L}",
year = "2004",
month = "1",
day = "1",
doi = "10.1002/0471667846.ch8",
language = "English (US)",
isbn = "0471227552",
pages = "227--249",
booktitle = "Trellis and Turbo Coding",
publisher = "John Wiley and Sons Inc.",
address = "United States",

}

TY - CHAP

T1 - Factor graphs

AU - Howard, Sheryl L

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

KW - Belief propagation

KW - Decoding

KW - Markov processes

KW - Probabilistic logic

KW - Probability

KW - Signal processing algorithms

KW - Sum product algorithm

UR - http://www.scopus.com/inward/record.url?scp=85036539428&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85036539428&partnerID=8YFLogxK

U2 - 10.1002/0471667846.ch8

DO - 10.1002/0471667846.ch8

M3 - Chapter

SN - 0471227552

SN - 9780471227557

SP - 227

EP - 249

BT - Trellis and Turbo Coding

PB - John Wiley and Sons Inc.

ER -