Scribd
Upload
55 views

Assignment On Convolutional Codes

This list is by no means an authoritative or a final list on sportscars that cricketers own. We were however just a little bit sick of the fact that just about every list of cars Hummers, Ferraris and GT-Rs were mentioned in the same breath. Hell, one list even had a Toyota Camry on it (Gautam Gambhir's)! It's then that we decided to put the Friday evening to good use and set down a constantly growing list of sportscars owned by cricketers. Do send us more pictures/tips on the story if you find any

Uploaded by

Jijo P Paul
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
55 views

Assignment On Convolutional Codes

This list is by no means an authoritative or a final list on sportscars that cricketers own. We were however just a little bit sick of the fact that just about every list of cars Hummers, Ferraris and GT-Rs were mentioned in the same breath. Hell, one list even had a Toyota Camry on it (Gautam Gambhir's)! It's then that we decided to put the Friday evening to good use and set down a constantly growing list of sportscars owned by cricketers. Do send us more pictures/tips on the story if you find any

Uploaded by

Jijo P Paul
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
You are on page 1/ 2

Assignment on Convolutional Codes

EE5142: Introduction to Information Theory and Coding


Questions marked (Q) or (F) are questions from previous quizzes or final exams,
respectively.
1. (F) Consider a convolutional code with the generator matrix


G(D) = 1 + D3 1 + D + D2 + D3 .
(a) Draw the circuit for a non-systematic encoder for the code.
(b) Draw the circuit for a systematic encoder for the code.
(c) Draw one stage of the trellis for the systematic encoder.
2. (F) Consider the convolutional encoder shown in Fig. 1.

  

  








Figure 1: Encoder for Problem 2


(a) Draw one stage of the trellis for the encoder.
(b) Write down the transfer function matrix for the convolutional code.
(c) Encode the infinite message sequence (11111111.......) (all 1s).
3. Consider the convolutional encoder shown in Fig. 2.

Figure 2: Encoder for Problem 3


(a) Draw the trellis corresponding to four information digits.
(b) Find the number of codewords represented in the trellis (or calculate the number of paths in
the trellis).
(c) Decode the received sequence r = [11; 01; 10; 00; 10] over a BSC.

(d) Decode the received sequence r = [1.5, 1.1; +0.8, 2.5; 0.4, +0.4; 1.2, +0.7; +2.8, 0.9]
assuming BPSK modulation over an AWGN channel.
4. (F) Let u be the input sequence to a rate-1/2 convolutional encoder. Let v (0) and v (1) denote the
two output sequences.
vn(0)

= un + un1 + un2 ,

vn(1)

= un + un1 .

(a) Provide a D-flipflop implementation of the encoder. Provide one stage of the complete trellis.
(b) Decode r = [00 10 11 01 10] over a BSC assuming zero termination.

You might also like