Professional Documents
Culture Documents
Convolutional Codes: Dr. Muqaibel / EE430 1
Convolutional Codes: Dr. Muqaibel / EE430 1
This is the
survival
path in
this
example
Decoded
sequence is
m=[10 1110]
Compute the two possible paths at
Add the weight of the
path at each state
each state and select the one
with less cumulative Hamming
This is called
the survival
weight path
Distance Properties of Conv. Codes
Sequence 2:
code sequence: .. 00 11 10 11 00 ..
state sequence: a0 b c a1
Labeled: (D2LN)(DL)(D2L) = D5L3N
Prop. : w =5, dinf =1, diverges from the allzero path by 3 branches.
Sequence 3:
code sequence: .. 00 11 01 01 00 10 11 00 ..
state sequence: a0 b d c b c a1
Labeled: (D2LN)(DLN)(DL)(DL)(LN)(D2L) = D7L6N3
Prop. : w =7, dinf =3, diverges from the allzero path by 6 branches.
• Input-Output relations:
a0 = 1
b = D2LN a0 + LNc
c = DLb + DLNd
d = DLNb + DLNd
a1 = D2Lc
• The transfer function T(D,L,N) = a1 /a0
D5 L3
T(D, L, N)
1 DNL(1 L)
Dr. Muqaibel \ EE430 Convolutional Codes 17
Transfer Function (cont’d)