Solutions Convolutional Codes

Solutions
Solutions
Solutions to Chapte 7: Channel Coding

(Bernard Sklar)
Note: State diagram, tree diagram and trellis diagram for K=3 are same
only changes will occur in the output that depends upon the connection
vector.
Manjunatha. P
(JNNCE)
Coding Techniques
July 5, 2013
1 / 11
Solutions
Solutions
7.1 Draw the state diagram, tree diagram and trellis diagram for the K=3, rate=1/3 code generated by
g1 (X ) = X + X 2 ,
g2 (X ) = 1 + X + X 2 , g3 (X ) = 1 + X
Table: State transition table (rate=1/2, K=3)

Input
bit
0
1
0
1
0
1
0
1
1
Input U
Output
2
3
State at
time ti
00
00
01
01
10
10
11
11
States represent possible contents of the

rightmost K-1 register content.
State at
time ti + 1
00
10
00
10
01
11
01
11
Output bit
For this example there are only two transitions

from each state corresponding to two possible
input bits.
Output
000
011
110
101
111
100
001
010
0(000)
1(011)
a=00
0(110)
Input bit
Solid line denotes for input bit zero, and dashed

line denotes for input bit one.
1(101)
c=01
b=10
0(111)
Tuple
00
10
01
11
State
a
b
c
d
0(001)
d=11
1(100)
1(010)
Figure: State diagram for rate=1/3 and K=3

Manjunatha. P
(JNNCE)
Coding Techniques
July 5, 2013
2 / 11
Solutions
Solutions
000
000
a
000
a
011
011
111
b
100
000
110
111
011
b
101
100
001
d
010
000
00
110
a
111
c
11
101
111
b
011
b
100
110
t1
a=00
001
c
100
0
010
001
d
011
011
000
t3
011
000
t4
011
000
t5
011
000
t6
011
110
110
101
101
111
110
101
111
111
c=01
111
b
100
100
001
100
001
001
100
100
d=11
111
c
110
010
111
101
b
Steady State
010
000
b
110
a
Figure: Trellis diagram for rate=1/3 and K=3
011
101
111
b
100
d
010
001
d
001
c
010
101
100
011
100
110
001
c
010
d
101
010
001
d
t2
t2
b=10
000
110
a
t1
011
010
000
000
101
t3
t4
010
t5
Figure: Tree diagram for rate=1/3 and

Coding Techniques
K=3Manjunatha. P (JNNCE)
July 5, 2013
3 / 11
Solutions
Solutions
7.2 Given a K=3 and rate 1/2 binary convolutional code with the partially completed state diagram shown in Figure 7.1 find the
complete state diagram, and sketch a diagram for encoder
Output bit
1(11)
00
Input bit
01
10
0(10)
11
1(00)
Figure: State diagram for rate=1/2, K=3
Input
bit
0
1
0
1
0
1
0
1
State at
time ti
00
00
01
01
10
10
11
11

State at
time ti + 1
00
10
00
10
01
11
01
11
Output bit
1(11)

input bits.
Output
00
11
01
10
10
01
11
00
0(00)
00
0(01)
Input bit
1(10)
01
10
0(10)
1
0(11)
Input U
11
1(01)
Output
1(00)
Figure: Encoder diagram

Manjunatha. P
(JNNCE)
Figure: Modified State diagram

Coding Techniques
July 5, 2013
4 / 11
Solutions
7.3 Draw the state diagram, tree diagram and trellis diagram for the convolutional encoder characterized by the block diagram
in Figure p7.2

Input
bit
0
1
0
1
0
1
0
1
Input U
Output
State at
time ti
00
00
01
01
10
10
11
11

input bits.
State at
time ti + 1
00
10
00
10
01
11
01
11
Output bit
0(00)
1(10)
a=00
Output
00
10
11
01
11
01
00
10
0(11)
Input bit
Solid line denotes for input bit zero, and dashed

line denotes for input bit one.
1(01)
01
10
0(11)
Tuple
00
10
01
11
State
a
b
c
d
0(00)
11
1(01)
1(10)

Manjunatha. P
(JNNCE)
Coding Techniques
July 5, 2013
5 / 11
Solutions
00
00
a
00
a
10
10
11
b
01
00
11
11
c
10
b
a
01
01
00
d
10
00
00
11
a
11
c
11
01
11
b
10
b
t1
a=00
01
00
10
t2
00
t3
10
00
t4
10
00
t5
10
00
t6
10
11
00
c
01
0
01
10
11
10
10
c=01
11
b
11
c
01
01
11
c
01
01
01
00
00
01
10
10
01
10
00
d
10
00
d=11
11
01
b
01
11
11
00
11
a
11
01
01
10
00
11
11
b=10
00
d
10
Steady State
00
b
11
a
00
c
10
01
11
b
01
d
11
00
c
10
d
01
10
00
d
t1
t2
01
t3
t4
10
t5
Manjunatha.
(JNNCE)for rate=1/3 and Coding Techniques
Figure:
Tree Pdiagram
July 5, 2013
6 / 11
Solutions
Solutions
7.5 Consider the convolutional encoder shown in Fiugre a)Write the connection vectors and polynomials for this encoder.
b)Draw the state diagram, tree diagram and trellis diagram

Solution: g1 = [1 0 1], g2 = [0 1 1]
g1 (X ) = 1 + X 2 , g2 (X ) = X + X 2
1
Input U
Output
Input
bit
0
1
0
1
0
1
0
1
State at
time ti
00
00
01
01
10
10
11
11
State at
time ti + 1
00
10
00
10
01
11
01
11
Output
00
10
11
01
01
11
10
00
Output bit
1(10)

0(00)
00
0(11)
Input bit

input bits.
1(01)
01
10
0(01)
Tuple
00
10
01
11
State
a
b
c
d
0(10)
11
1(11)
1(00)

Manjunatha. P
(JNNCE)
Coding Techniques
July 5, 2013
7 / 11
Solutions
Solutions
00
00
a
00
a
10
10
01
b
11
00
11
01
c
10
b
a
01
11
10
d
00
00
00
11
a
01
c
01
b
10
b
t1
11
01
a=00
00
10
t2
00
t3
10
00
t5
00
t6
10
11
c
01
00
01
10
10
c=01
01
b
11
11
11
01
c
01
b
01
11
10
10
11
11
d=11
00
00
00
00
Steady State
11
a
10
c
11
10
d
10
01
01
b
11
d
10
00
10
01
01
01
00
11
a
01
c
11
01
01
00
00
11
11
b=10
10
d
11
11
10
c
00
d
01
00
10
d
t2
00
10
10
11
t1
t4
10
11
t3
t4
00
t5
Figure: Tree diagram for rate=1/3 and

K=3
Manjunatha. P
(JNNCE)
Coding Techniques
July 5, 2013
8 / 11
Solutions
Solutions
7.6 An encoder diagram is shown in Figure. Find the encoder output for an input sequence 1 0 0 1 0 1 0
Solution: g1 = [1 0 1], g2 = [1 1 1]
g1 (X ) = 1 + X 2 , g2 (X ) = 1 + X + X 2
Input U
Output
Manjunatha. P
(JNNCE)

Input
bit
1
0
0
1
0
1
0
Register
Contents
000
100
010
001
100
010
101
010
Coding Techniques
State at
time ti
00
00
10
01
00
10
01
10
State at
time ti + 1
00
10
01
00
10
01
10
01
Output
00
11
01
11
11
01
00
01
July 5, 2013
9 / 11
Solutions
Solutions
7.6 Figure shows an encoder for a (3,2) convolutional code. Find the transfer function T (D) and minimum free distance for this
code. Also, draw the state diagram for the code.
Input U
1
Output
Manjunatha. P
(JNNCE)
Coding Techniques
July 5, 2013
10 / 11
References
S. Lin and D. J. C. Jr., Error Control Coding, 2nd ed.
Pearson / Prentice Hall, 2004.
R. Blahut, Theory and Practice of Error Control Codes, 2nd ed.

J. G. Proakis, Digital communications, 4th ed.
Addison Wesley, 1984.
Prentice Hall, 2001.
J. G. Proakis and M. Salehi, Communication Systems Engineering, 2nd ed.

2002.
S. Haykin, Digital communications, 2nd ed.
Manjunatha. P
(JNNCE)
Prentice Hall,
Wiley, 1988.
Coding Techniques
July 5, 2013
11 / 11

Solutions Convolutional Codes

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Solutions Convolutional Codes

Uploaded by

Copyright:

Available Formats

Solutions

Solutions to Chapte 7: Channel Coding

Table: State transition table (rate=1/2, K=3)

States represent possible contents of the

For this example there are only two transitions

Solid line denotes for input bit zero, and dashed

Figure: State diagram for rate=1/3 and K=3

Figure: Trellis diagram for rate=1/3 and K=3

Figure: Tree diagram for rate=1/3 and

Table: State transition table (rate=1/2, K=3)

Figure: State diagram for rate=1/2, K=3

States represent possible contents of the

For this example there are only two transitions

Figure: Encoder diagram

Figure: Modified State diagram

Table: State transition table (rate=1/2, K=3)

States represent possible contents of the

Solid line denotes for input bit zero, and dashed

Figure: State diagram for rate=1/3 and K=3

Figure: Trellis diagram for rate=1/3 and K=3

Table: State transition table (rate=1/2, K=3)

States represent possible contents of the

For this example there are only two transitions

Figure: State diagram for rate=1/3 and K=3

Figure: Trellis diagram for rate=1/3 and K=3

Figure: Tree diagram for rate=1/3 and

Table: State transition table (rate=1/2, K=3)

S. Lin and D. J. C. Jr., Error Control Coding, 2nd ed.

Pearson / Prentice Hall, 2004.

R. Blahut, Theory and Practice of Error Control Codes, 2nd ed.

Addison Wesley, 1984.

Prentice Hall, 2001.

J. G. Proakis and M. Salehi, Communication Systems Engineering, 2nd ed.

You might also like