Scribd
Upload
9 views2 pages

Convolutional Coding Problem Set 4

The document outlines a problem set for a course on Compression and Coding, focusing on convolutional encoders. It includes exercises on determining encoder parameters, state transition tables, tree diagrams, Viterbi decoding, and the application of puncturing techniques to increase coding rates. Additionally, it covers the principles of recursive systematic convolutional encoders and requires the drawing of trellis modules and state diagrams.

Uploaded by

medjdoubbouchra5
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

Convolutional Coding Problem Set 4

The document outlines a problem set for a course on Compression and Coding, focusing on convolutional encoders. It includes exercises on determining encoder parameters, state transition tables, tree diagrams, Viterbi decoding, and the application of puncturing techniques to increase coding rates. Additionally, it covers the principles of recursive systematic convolutional encoders and requires the drawing of trellis modules and state diagrams.

Uploaded by

medjdoubbouchra5
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Faculty of Electrical Engineering (USTHB)

Advanced Telecommunication Technologies (ATT)

COURSE: COMPRESSION AND CODING

Problem Set 4

Exercise 1 :

Given a convolutional encoder described by the following circuit:

⊕
n1
•
X xi M1 xi-1 M2 xi-2 • o C
(k = 1) (n = 2)
n2 Selector

⊕
1)- Determine the parameters (characteristics) of this convolutional encoder.

2)- Knowing that, by convention, the state of the convolutional encoder is defined by the
binary value of the shift register cells M 1 M 2 , determine the encoder states, the state
transition table and the output table.

3)- Draw the tree diagram, the state diagram, and the elementary trellis module.

4)- Determine the tree coding of the input sequence: 1 0 0 1 1.

5)- For a 5-bit all-zero input sequence, the convolutional encoder generates a 10-bit coded
sequence C = (0000000000). Assume that this coded sequence C is transmitted over a
noisy channel and that the received sequence at the channel output is: Ĉ = (0100010000).
− Perform the Viterbi decoding of the received sequence.

6)- Provide your remarks regarding the reconstructed sequence after convolutional decoding.
Was this result predictable? Justify your answer by calculating the error-correction
capability of the convolutional code.

Exercise 2 :

We consider the same convolutional encoder (rate r = 1/2) from the previous exercise.

Now assume that the states of the convolutional encoder are given by the binary values of the
shift-register cells M 2 M 1 .

− Repeat all questions (2) to (6) from the previous exercise under this new assumption.

1
ATT Engineering – FGE- USTHB, Pr. M. BOUZID Problem Set 4: Convolutional Codes

Exercise 3 :

We still consider the same convolutional encoder (rate r =1/2) from Exercise 1.

1)- Using the puncturing technique, how can the rate of the convolutional encoder be
increased to r = 2/3 ?

2)- Provide the block diagram of the new encoder, specifying the puncturing matrix that is
applied.

3)- Propose a puncturing matrix that increases the encoder rate to r =3/4.

Exercise 4 :

Consider a recursive systematic convolutional (RSC) encoder with coding rate 1/2 and
constraint length K = 3.

⊕ ci1
g1 1 1 1
n1
Input
• Output
Sequence
(k = 1)
xi ⊕ M1 M2 • n2 o
Selector
Sequence
(n = 2)
2
g2 1 ci

1)- Explain the operating principle of the RSC convolutional encoder.

2)- Determine the encoder states (M 1 M 2 ), the state transition table and the output table of the
RSC encoder.

3)- Draw the elementary trellis module and the state diagram of RSC encoder.

You might also like