Viterbi Algorithm

Finding probable states
Definition
Example
Summary

Section 1 - Page 15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

  1. continued...
    This approach, in the event of a noise garble half way through the sequence, will wander away from the correct answer.

    Conversely, the Viterbi algorithm will look at the whole sequence before deciding on the most likely final state, and then `backtracking' through the f pointers to indicate how it might have arisen. This is very useful in `reading through' isolated noise garbles, which are very common in live data.