V iterbi Algorithm
A.J. Viterbi · 2003
Abstract The Viterbi Algorithm is a computationally efficient technique for determining the most probable path taken through a Markov graph. The graph, and underlying Markov sequence, is characterized by a finite set of states, state transition probabilities and output (observable parameter) probabilities. The algorithm, expressed as a recursion, is derived from elementary Markov sequence principles. Then the six most often cited applications of the algorithm are briefly described.