Factor graphs and the sum-product algorithm
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
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 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 "turbo" decoding algorithm, Pearl's (1988) belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform (FFT) algorithms.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- IEEE Transactions on Information Theory
- Topic
- Error Correcting Code Techniques
- Field
- Computer Science
- Canadian institutions
- University of WaterlooUniversity of Toronto
- Funders
- Massachusetts Institute of Technology
- Keywords
- Factor graphAlgorithmComputer sciencePrime-factor FFT algorithmViterbi algorithmBipartite graphMathematicsGraphDecoding methodsTheoretical computer scienceFourier transformFractional Fourier transformFourier analysis
- Has abstract in OpenAlex
- yes