Structure of The Convolutional Codes
Structure of The Convolutional Codes
In previous linear block coding, each k data digits are encoded into n digits to
generate (n,k) code by adding the r parity digits. An alternative scheme that
groups the data stream into much smaller blocks k digits and encode them into n
digits with order of k say 1, 2 or 3 digits at most is the convolutional codes. Such
code structure can be realized using convolutional structure for the data digits.
Structure of the convolutional codes
A convolutional code is specified by three parameters : ( n, k, L) where :
L is the constraint length of the convolutinal code (no. of groups each group has k shift
register)
The code rate is k/n
Convolutional code is defined by giving it’s generators. These are n vectors[ , each of Lk
length describing the selected taps from the shift register to be mod-2 summed
Output bits
n=3 so we have 3 output bits C1,C2 and C3 and the 3 generator vectors are: [g 1]=[1011],
[g2]=[1101], [g3]=[1010 ]describing the connections for C1,C2 and C3 output (in octal
form, these generators are given as 13,15,12).
C1=Q1+Q3+Q4
C2=Q1+Q2+Q4
C3=Q1+Q3
Since the generator vectors have 4 bits then L=2, then we have 2 groups each with two
stages( k=2), so we have 4 shift registers.
convolutional Codes with Code Rate 1/5
convolutional Codes with Code Rate 1/3
convolutional Codes with Code Rate 1/4
convolutional Codes with Code Rate 1/2
There are 3 methods that are used to describe a convolutional code.
1) tree diagram
2) state diagram
3) trellis diagram.
1) Tree diagram: To draw the tree diagram of the coder described in example1. Here, we
make a simple tree structure starting with Q1Q2Q3=[000]
L=3, k=1, n=3 [g1]=[100], [g2]=[101], [g3]=[111]
C1=Q1; C2=Q1+Q3; C3=Q1+Q2+Q3
If say the data input is 1011…, then the output sequence will be: 111 001 100 110
Example2: Draw the tree diagram of the convolutional encoder given in example2
L=2, k=2, n=3 convolutional encoder
g1 = (1011)
g2 = (1101)
g3 = (1010)
Example1: Draw the state diagram of the convolutional encoder given in example1.
Here L=3, k=1, [g1]=[100],[g2]=[101],[g3]=[111].
Solution:
1) no. of states= = =4 states which are the same states a,b,c,d
no. of branches= = =2 branches leaving from or entering into each node( state)
2) we will prepare the transition table that gives the present state of Q2Q3, next state
of Q2Q3 and the output for each possible two inputs:
3) draw the state diagram