Factor Graphs and the Sum-Product Algorithm Export

@article{citeulike:474266, 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 \"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 ...}, author = {Kschischang and Frey and Loeliger}, citeulike-article-id = {474266}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4482}, journal = {IEEETIT: IEEE Transactions on Information Theory}, keywords = {graph}, posted-at = {2008-06-02 16:28:54}, priority = {2}, title = {Factor Graphs and the Sum-Product Algorithm}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4482}, volume = {47}, year = {2001} }

TY - JOUR ID - citeulike:474266 L3 - citeulike-article-id:474266 N2 - 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 ... JF - IEEETIT: IEEE Transactions on Information Theory TI - Factor Graphs and the Sum-Product Algorithm VL - 47 KW - graph AU - Kschischang AU - Frey AU - Loeliger PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4482 ER -