Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8
Viterbi Decoding Algorithm
1. If an all zero sequence is sent over the noisy
channel, and the receiver bits is 01,00,01,00,00. Step 1: Step 2: Step 3: Neglect high values, b2 to c2 is 5 and d1 to d2 is 4 Step 4: Step 5: Step 6: Survivors: Neglecting the branch which has largest metric branch. The line (Red colour) is the maximum likelihood path.
a1-a2 a2-a3 a3-a4 a4-a5 a5-a6 Path
00 00 00 00 00 0 0 0 0 0 msg sequence 2. Use viterbi algorithm to decode the sequence 100, 110, 111, 101, 001, 101, 001, 010 for the message sequence 11010100. Step 1: Step 2: Take smallest branch, neglect the largest branch.