articleTop 1% cited
The viterbi algorithm
Proceedings of the IEEE · 1973 · Vol. 61(3) · pp. 268–278
Abstract
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.
Advanced Wireless Communication TechniquesCellular Automata and ApplicationsBlind Source Separation TechniquesViterbi algorithmAlgorithmComputer scienceVariety (cybernetics)Sequence (biology)State (computer science)Iterative Viterbi decodingMarkov chainForward algorithmMarkov process
Citations
5,618
FWCI
24.00
field-weighted impact
References
50
Percentile
100%
vs. same field & year
Citations per year
Cited by
Techniques for automatically correcting words in text
ACM Computing Surveys · 1992 · 1,246 citations
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information Theory · 1974 · 5,141 citations
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
IEEE Journal on Selected Areas in Communications · 1998 · 907 citations
Near optimum error correcting coding and decoding: turbo-codes
IEEE Transactions on Communications · 1996 · 2,748 citations
A tutorial on hidden Markov models and selected applications in speech recognition
Proceedings of the IEEE · 1989 · 22,616 citations
Minimum probability of error for asynchronous Gaussian multiple-access channels
IEEE Transactions on Information Theory · 1986 · 2,137 citations
Iterative decoding of binary block and convolutional codes
IEEE Transactions on Information Theory · 1996 · 2,309 citations
Quantization
IEEE Transactions on Information Theory · 1998 · 1,569 citations
References
Optimal decoding of linear codes for minimizing symbol error rate
IEEE Transactions on Information Theory · 1974 · 4,675 citations
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory · 1967 · 6,722 citations
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information Theory · 1974 · 5,141 citations
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
IEEE Transactions on Information Theory · 1972 · 2,459 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.