NIST

Viterbi algorithm

(algorithm)

Definition: An algorithm to compute the optimal (most likely) state sequence in a hidden Markov model given a sequence of observed outputs.

Aggregate child (... is a part of or used in me.)
hidden Markov model.

See also Baum Welch algorithm.

Note: Also used to decode, i.e. remove noise from, linear error-correcting codes.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 6 July 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "Viterbi algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 July 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/viterbiAlgorithm.html