A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Factor graphs and the sum-product algorithm

2001
*
IEEE Transactions on Information Theory
*

Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which depends on a subset of the variables. Such a factorization can be visualized with a bipartite graph that we call a factor graph. In this tutorial paper, we present a generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph. Following a single, simple computational rule, the

doi:10.1109/18.910572
fatcat:7ogeo7loqvhvxcduit2z6o5poa