Scribd
Upload
430 views

Problems Convolutional Codes PDF

This document discusses cyclic codes and convolutional codes. It provides examples of encoding processes for various cyclic and convolutional codes. It asks questions about encoding message sequences using different rate and constraint length convolutional encoders, constructing trellis and state diagrams, and using the Viterbi algorithm for decoding.

Uploaded by

prb
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
430 views

Problems Convolutional Codes PDF

This document discusses cyclic codes and convolutional codes. It provides examples of encoding processes for various cyclic and convolutional codes. It asks questions about encoding message sequences using different rate and constraint length convolutional encoders, constructing trellis and state diagrams, and using the Viterbi algorithm for decoding.

Uploaded by

prb
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Advanced Digital Communication

Cyclic Codes and Convolutional Codes

1. A (15,5) linear cyclic code has a generator polynomial


g ( x) = 1 + X + X 2 + X 4 + X 5 + X 8 + X 10
(a) Draw block diagrams of an encoder and syndrome calculator for this code.
(b) Find the code polynomial for the message polynomial M ( X ) = 1 + X 2 + X 4 (in a
systematic form).
(c) Is R ( X ) = 1 + X 4 + X 6 + X 8 + X 14 a code polynomial? If not, find the syndrome
of R ( X ) .

2. Consider the convolutional encoder shown in Figure 1. The message bits are shifted
into the encoder two bits at a time. Assume the initial content of the registers to be
zero and find the code block for the input message block 110101.

c1
c2
c3
Figure 1

3. Consider the rate r = 1/2, constraint length K = 2 convolutional encoder of Figure 2.


The code is systematic. Find the encode output produced by the message sequence
10111 …

1
Modulo-2
adder

Output
Input

Flip-flop

Figure 2

4. Figure 3 shows the encoder for a rate r = 1/2, constraint length K = 4 convolutional
code. Determine the encoder output produced by the message sequence 10111…

Modulo-2
adder

Input Output

Flip-flop

Figure 3

5. Construct the trellis diagram for the encoder of Figure 3, assuming a message
sequence of length 5. Trace the path through the trellis corresponding to the message
sequence 10111…. Compare the resulting encoder output with that found in Q. 4.

6. Construct the state diagram for the encoder of Figure 3. Starting with all-zero state,
trace the path that corresponds to the message sequence 10111…, and compare the
resulting code sequence with that determined in Q. 4.

7. Consider the encoder of Figure 4 for a rate r = 2/3, constraint length K = 2


convolutional code. Determine the code sequence produced by the message sequence
10111…

2
Input Output

Modulo-2
adder

Flip-flop

Figure 4

8. Consider the encoder of Figure 4


(a) Construct the state diagram for this encoder.
(b) Starting from the all-zero state, trace the path that corresponds to the message
sequence 10111…. Compare the resulting sequence with that determined in Q. 7.

9. The trellis diagram of a rate-1/2, constraint length-3 convolutional code is shown in


Figure 5. The all-zero sequence is transmitted, and the received sequence is
100010000…. Using Viterbi algorithm, compute the decoded sequence.

3
State
00 00 00 00 00
00

11 11 11 11 11

01 11 11 11
00 00 00

01 01 01 01
10

10 10 10 10 10 10 10

11
01 01 01

Figure 5

4
Solution
1. (b) X n − k M ( X ) = X 10 M ( X ) = X 10 + X 12 + X 14
Divide X n− k M ( X ) by g(x), we have

X 4 +1
X 10 + X 8 + X 5 + X 4 + X 2 + X + 1 X 14 + X 12 + X 10
X 14 + X 12 + X 9 + X 8 + X 6 + X 5 + X 4
X 10 + X 9 + X 8 + X 6 + X 5 + X 4
X 10 + X 8 + X 5 + X 4 + X 2 + X + 1
X 9 + X 6 + X 2 + X +1

Therefore, B(X)=X9+X6+X2+X+1
As C ( X ) = B( X ) + X n− k M ( X ),
C ( X ) = X 14 + X 12 + X 10 + X 9 + X 6 + X 2 + X + 1

(c) Divide R(X) by g(x)


X4 +X2
X 10 + X 8 + X 5 + X 4 + X 2 + X + 1 X 14 + X 8 + X 6 + X 4 +1
X 14 + X 12 + X 9 + X 8 + X 6 + X 5 + X 4
X 12 + X 9 + X 5 + 1
X 12 + X 10 + X 7 + X 6 + X 4 + X 3 + X 2
X 10 + X 9 + X 7 + X 6 + X 4 + X 3 + X 2 + 1

As S ( X ) = X 10 + X 9 + X 7 + X 6 + X 4 + X 3 + X 2 + 1 ≠ 0 , R(X) is not a code


polynomial.

2. Assume the message bits are shifted into the encoder one bit at a time.
The impulse response of path 1 is g (1) ( D) = 1 + D .
The impulse response of path 2 is g ( 2 ) ( D) = 1 .
The impulse response of path 3 is g (3) ( D) = 1 + D + D 2

c (1) ( D) = g (1) ( D)m( D) = (1 + D)(1 + D + D 3 + D 5 )


The outputs are
= 1 + D2 + D3 + D4 + D5 + D6

5
c ( 2 ) ( D) = g ( 2 ) ( D)m( D) = (1)(1 + D + D 3 + D 5 )
= 1 + D + D3 + D5
c ( 3) ( D) = g (3) ( D)m( D) = (1 + D + D 2 )(1 + D + D 3 + D 5 )
= 1 + D2 + D6 + D7

As two bits are shifted into the encoder at a time, only the terms with odd power are
needed. Therefore, we have
c (1) ( D) = D 3 + D 5 ⇒ 011

c ( 2 ) ( D) = D + D 3 + D 5 ⇒ 111

c ( 3) ( D) = D 7 ⇒ 0001

The code is 010, 110, 110, 001


3.

6
4.

7
5.

8
6.

9
7.

10
8.

11
9.

12

You might also like