Content deleted Content added
a simplification |
moving {{cleanup-technical}} to talk page |
||
Line 1:
'''Iterative Viterbi Decoding''' is an [[algorithm]] that spots the subsequence S of an observation O={o<sub>1</sub>,...,o<sub>n</sub>} having the highest average probability (i.e., probability scaled by the length of S) of being generated by a given [[hidden Markov model]] M with m states. The algorithm uses a modified [[Viterbi algorithm]] as an internal step.
| |||