The viterbi algorithm
G. David Forney · Proceedings of the IEEE · 1973
The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discrete-time finite-state Markov process observed in memoryless noise. Many problems in areas such as digital communications can be cast in this form. This paper gives a tutorial exposition of the algorithm and of how it is implemented and analyzed. Applications to date are reviewed. Increasing use of the algorithm in a widening variety of areas is foreseen.
Cited by 5,647 works. doi:10.1109/proc.1973.9030
Authors
References
- A Mathematical Theory of Communication
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Principles of Communication Engineering
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate
- Prediction and Entropy of Printed English
- Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
- Shift Register Sequences
- A heuristic discussion of probabilistic decoding
- Fast Sequential Decoding Algorithm Using a Stack