The maximum-likelihood decoding - Viterbi algorithm

Armed with the description of the convolutional codes we can consider the Viterbi decoding. (There are several convolutional codes decoding algorithms. Sequential decoding was developed by Wozencraft, Fano, Zigangirov and Jelinek. Majority-logic decoding algorithm was developed by Massey.) In 1967, Viterbi [Vit67] introduced a decoding algorithm, which later was shown to be a maximum-likelihood decoding algorithm [For73] equivalent to a dynamic programming solution to the problem of finding the shortest path through a weighted graph.

 

GO TO EXPERIMENT
Go to Viterbi Algorithm Applet