Revision as of 23:08, 5 December 2004 edit Gzornenplatz (talk \| contribs) 10,553 edits mNo edit summary ← Previous edit		Revision as of 14:04, 20 March 2005 edit undo Noe (talk \| contribs) 4,069 edits Added {{cleanup-technical}} tag Next edit →
Line 1: {{cleanup-technical}} '''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.

Iterative Viterbi decoding: Difference between revisions