Experiment No.

6 SC & ET 2013-14
GHRIET Page 1

Experiment No. 6

AIM:
Implementation of algorithm for decoding convolution codes using viterbis algorithm.

THEORY:
Convolution code can be decoded by the following methods:-
1. Viterbis algorithm
2. Sequential decoding
3. Feedback decoding
The most commonly used in the viterbi algorithm.

VITERBIS ALGORITHM:
Lets represent the received signal by y. Convolution decoding operates continuously on input
data. Let 1 and 0 have same transmission error probability.
Then,matric in the discrepancy between the received signal y and decoded signal at a particular mode. This
matric can be added over a few nodes for a particular path.
In this method output or the received code is compared with the trellis diagram. If the output of the
node in the trellis diagram matches with the received node then all paths are checked and the respective
matric are written down.
In case if there are two paths having same matric then only one of them is continued. Otherwise the
path having same matric is chosen whenever the path is broken it shows the message bit m=1 and if it is
continuous message bit then m=0.If it is continuous between two nodes method of decoding in viterbi
algorithm is called max likelihood decoding.

In this decoding,
Surviving path=2
(k-1)R

Where,
K=constant length
R=message bit

If the number of message bits cleared decoded are very large then storage requirements is also large since
the decoder has to store multiple paths. To avoid this, metric diversion effect is used.


Experiment No. 6 SC & ET 2013-14
GHRIET Page 2


PROBLEM:
For the convolution encoder shown draw the trellis diagram and using viterbi algorithm decoded sequence
01000100.






Input v1
FF1 FF2
V2





SOLUTION:
TRELLIS DIAGRAM:

m
2
m
1
m
0
m
2
m
1
V
1
V
2


000 00 00
001 01 11
010 10 00
011 11 11
100 00 11
101 00


To build a trellis structure that describes it,use the command below.
Trellis=struct(numInputSymbols,2,numOutputSymbols,4..
numStates,4,nextStates,[0 2 ; 0 2 ; 1 3 ; 1 3],.
outputs,[0 3 ;1 2;3 0; 2 1]);

Experiment No. 6 SC & ET 2013-14
GHRIET Page 3

The number of input symbols is 2 beacause the trellis diagram has two types of input path,the solid arrow
and the dashed arrow.The number of output symbols is 4 because the numbers above the arrows can be
either 0,1,2,or 3.The number of states is 4 because there are four bullets on the left side of the trellis
diagram(equivalently , four on the right side).

The string decoding indicates the type of decision that the decoder makes, and influence the type of data the
decoder expects in code.
Hard contains binary input values.
Trunc-The encoder is assumed to have started at the all zers state.The decoder traces back from the state
with the best metric. This mode incurs no delay. This mode is appropriate when you cannot assume the
encoder ended at all zeros state and when you do not want to preserve continuity between successive
invocations of this function.

GIVEN SEQUENCE: 01000100.
S1
S2
S3
S4
The path with least metric is the first path with metric 2 hence it is surviving path and it gives message bit
output. Hence the output is 0000.


CONCLUSION :