The viterbi algorithm

TLDR

The Viterbi algorithm is a recursive optimal method for estimating state sequences in finite‑state Markov processes observed in memoryless noise, a framework applicable to many digital communication problems. The paper provides a tutorial exposition of the Viterbi algorithm, detailing its implementation and analysis. The tutorial covers implementation, analysis, and reviews applications to date. The authors anticipate growing use of the algorithm across a widening range of areas.

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.