Convolutional Codes

EL5110 Information Theory & Coding

Dr. Emir Husni, ECC:
Convolutional Codes
1
EL5110 Information Theory & Coding
By
Ir. Emir Mauludi Husni, M.Sc., Ph.D.
School of Electrical Engineering & Informatics,
Institut Teknologi Bandung
Convolutional Codes
Tree codes
Encoder has memory of previous frames
Finite memory
Linear
Input and output frames small
Typically k =1, n =2
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 2
Typically k
0
=1, n
0
=2
Restricted number of input frames stored
Memory order, m, is the maximum number of shift register stages
in the path to any input bit
Typically m=6
Memory constraint length v =no. of bits stored
Input constraint length K =v +k
0
Output constraint length the number , n, of output bits for which
the effect of any one input bit persists; equal to (m+1)n0
Convolutional Encoder
K
0
=1 n
0
=2 m=2 v=2 K=3 R=1/2
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 3
Input 1 0 1 1 0 1
Output 11 10 00 01 01 00 10 11
Polynomial Representation
Contribution of input i to output j designated
( )
( ) D g
j
i
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 4
For example encoder
( )
( )
( )
( )
2 2
2 1
1
1
D D g
D D D g
+ =
+ + =
Encoder State Diagram
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 5
Free Distance
Count of lowest number of differences
between two paths of infinite length
Value finite because paths which diverge
later merge and therefore differ over finite
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 6
later merge and therefore differ over finite
length
Weight of lowest weight path which leaves
state zero and returns to it
Using zero path for comparison in linear code
For example code d
free
=5
Transfer Function of
Convolutional Codes (1)
Transfer function represents number of paths
of output weight d, length l frames and input
weight i starting from and ending at state zero
Transfer function can be used to provide
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 7
Transfer function can be used to provide
more detailed information than just the
distance of the various paths
Transfer Function of
Convolutional Codes (2)
W is corresponding to an increase of 1 in the output
weight
L is corresponding to an increase of one frame in
the code sequence length
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 8
I is representing an increase of 1 in the input
sequence weight
Generating transfer function approach to finding the
weight distribution quickly become impractical as the
total encoder memory v exceeds 4 or 5
Transfer Function of
Convolutional Codes (3)
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 9
Transfer Function of
Convolutional Codes (4)
c b c
c b d
d a b
LX W X
WLIX WLIX X
WLX WLX X
LIX LIX W X
2
2
=
+ =
+ =
+ =
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 10
d e
LX W X
2
=
( )
( )
+ + + +
+ + =
+
= =
3 7 7 3 6 7 3 5 7
2 5 6 2 4 6 3 5
3 5
2
1 1
, ,
I L W I L W I L W
I L W I L W I L W
L WLI
I L W
X
X
I L W T
a
e
Transfer Function of
Convolutional Codes (5)
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 11
D is corresponding to
an increase of 1 in the
output weight
Transfer Function of
Convolutional Codes (6)
c b d
d a b
WX WX X
X X W X
+ =
+ =
2
d e
c b c
X W X
WX WX X
2
=
+ =
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 12
( )
( )

=
+
=
+ + + + =

= =
0
5
8 7 6 5
5
2
8 4 2
2 1
d
d d
a
e
W
W W W W
W
W
X
X
W T

Example 1 (1)
11
110
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 13
01
10
110
000
001
111
k
0
=2 n
0
=3 m=1 v=2 K=4 R=2/3
Example 1 (2)
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 14
Example 1 (3)
( )
( )
( )
( )
( )
( )
( )
( )
( )
( )
( )
( ) 1 , 1 ,
1 , , 1
3
2
2
2
1
2
3
1
2
1
1
1
= = =
+ = = + =
D g D g D D g
D D g D D g D D g
(
+ + 1 1 D D D
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 15
( )
(

+ +
=
1 1
1 1
D
D D D
D G
( )
( )
( )
( ) D D u
D D u
+ =
+ =
1
1
2
2 1
Example 1 (4)
( )
( )
( )
( )
( )
( )
( ) | |
| |
| |
3 2 3 3
2
3 2 1
, 1 , 1
1 1
1 1
1 , 1
, ,
D D D D
D
D D D
D D
D D D D
+ + + =
(

+ +
+ + =
= v v v v
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 16
| |
3 2 3 3
, 1 , 1 D D D D + + + =
( )
( )
( )
( )
( )
( )
( )
( )
( )
( )
( )
( )
( )
( ) ( ) ( )
11 10 9 8
11 8 10 9
3 3 2 3 2 3 1
1 2 1
1
1
D D D D D
D D D D D
D D D D D
D D D D D D
n n n n n
+ + + + + =
+ + + + + =
+ + =
+ + + =

v v v
v v v v
Systematic Convolutional
Codes (1)
K
0
=1 n
0
=2 m=3 v=3 K=4 R=1/2
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 17
( ) | |
3
1 1 D D D G + + =
Systematic Convolutional
Codes (2)
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 18
( ) | |
( )
(

+ +
+
=
+ + + =
2
2
2 2
1
1
1
1 1
D D
D
D G
D D D D G
Systematic Convolutional
Codes (3)
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 19
( )
( )
( )
m
m
m
m
D q D q
D p D p p
D
D
D G
+ + +
+ + +
= =

1
1 0
1
u
v
Systematic Convolutional
Codes (4)
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 20
( )
(

+ +
+
=
2
2
1
1
1
D D
D
D G
Systematic Convolutional
Codes (5)
Next State:
u D D D
D D
NS
NS
+ + =
=
2
2
Dr. E. M. Husni, ECC:
Convolutional Codes
2004, 21
Output:
NS
( )
( )
u D V
u V
+ =
=
2
1