Portal de Periódicos da CAPES

An Introduction to factor graphs

2004; Institute of Electrical and Electronics Engineers; Volume: 21; Issue: 1 Linguagem: Inglês

10.1109/msp.2004.1267047

1558-0792

Hans‐Andrea Loeliger,

Algorithms and Data Compression

A large variety of algorithms in coding, signal processing, and artificial intelligence may be viewed as instances of the summary-product algorithm (or belief/probability propagation algorithm), which operates by message passing in a graphical model.Specific instances of such algorithms include Kalman filtering and smoothing, the forwardbackward algorithm for hidden Markov models, probability propagation in Bayesian networks, and decoding algorithms for error correcting codes such as the Viterbi algorithm, the BCJR algorithm, and the iterative decoding of turbo codes, low-density parity check codes, and similar codes.New algorithms for complex detection and estimation problems can also be derived as instances of the summary-product algorithm.In this paper, we give an introduction to this unified perspective in terms of (Forney-style) factor graphs.