Frank R. Kschischang, Senior Member, IEEE, Brendan J. Frey, Member, IEEE, and
\nHans-Andrea Loeliger, Member, IEEE<\/p>\n
Abstract:<\/strong> Factor Graphs and the Sum-Product Algorithm Frank R. Kschischang, Senior Member, IEEE, Brendan J. Frey, Member, IEEE, and Hans-Andrea Loeliger, Member, IEEE Abstract: 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 \u201clocal\u201d functions, each of which depends on […]<\/p>\n","protected":false},"author":88,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[3],"tags":[5,7,10,8,9,4,6],"_links":{"self":[{"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/posts\/85"}],"collection":[{"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/users\/88"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/comments?post=85"}],"version-history":[{"count":3,"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/posts\/85\/revisions"}],"predecessor-version":[{"id":113,"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/posts\/85\/revisions\/113"}],"wp:attachment":[{"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/media?parent=85"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/categories?post=85"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.discovery.wisc.edu\/sysbiojournalclub\/wp-json\/wp\/v2\/tags?post=85"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nAlgorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of \u201clocal\u201d 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 sum-product algorithm computes-either exactly or approximately-various marginal functions derived from the global function. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can be derived as specific instances of the sum-product algorithm, including the forward\/backward algorithm, the Viterbi algorithm, the iterative \u201cturbo\u201d decoding algorithm, Pearl’s (1988) belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform (FFT) algorithms.<\/p>\n","protected":false},"excerpt":{"rendered":"