0% found this document useful (0 votes)
2 views4 pages

19ece312_vi Sem May 2022

This document outlines the examination details for the B.Tech. degree in Electronics and Communication Engineering at Amrita Vishwa Vidyapeetham, specifically for the Information Theory and Coding course. It includes course outcomes, a set of ten questions covering various topics in information theory, coding algorithms, and channel capacity, along with their respective marks distribution. The exam is designed to assess students' understanding and application of coding techniques and information theory principles.
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
0% found this document useful (0 votes)
2 views4 pages

19ece312_vi Sem May 2022

This document outlines the examination details for the B.Tech. degree in Electronics and Communication Engineering at Amrita Vishwa Vidyapeetham, specifically for the Information Theory and Coding course. It includes course outcomes, a set of ten questions covering various topics in information theory, coding algorithms, and channel capacity, along with their respective marks distribution. The exam is designed to assess students' understanding and application of coding techniques and information theory principles.
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/ 4

Roll No.

: _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
Amrita Vishwa Vidyapeetham
Amrita School of Engineering, Coimbatore
B.Tech. Degree Examinations –May 2022
Sixth Semester
Electronics and Communication Engineering
19ECE312 Information Theory and Coding
Duration: Three hours Maximum: 100 Marks
CO Course Outcomes
CO1 Able to understand the Information theory fundamentals and the fundamental
limits of communication system.
CO2 Able to analyze the basic types of codes and understand the source coding
algorithms.
CO3 Able to derive the channel capacity of communication channel models.
CO4 Able to understand the method of encoding and decoding technique of linear
block code, cyclic code, convolutional codes.
CO5 Able to carry out implementation of different source coding and channel coding
algorithms

Answer all questions


1. Let the polynomial

g(x) = x10 + x8 + x5 +x4 + x2 + x + 1

be the generator polynomial of a cyclic code over GF(2) with block length 15.

(i) Find the generator matrix G


(ii) Find the parity check matrix H.
(iii)Find the parity check polynomial.
(iv) Determine the generator matrix G in systematic form.
(v) Determine the minimum Hamming distance of the code.
[2+2+2+2+2] [CO4] [BTL 3]
2. Construct the standard array for the ternary Hamming (4,2) code over GF(3) with the
following generator matrix. Use the array to decode the received word 1 2 1 1.

1 0 1 2
𝐺= ( )
0 1 1 1

[10] [CO4, CO5] [BTL 5]

Page 1 of 4
3. A binary information source emits the sequence of symbols:

01000011000010100000101000001100.

Construct the encoding dictionary using Lempel -Ziv Source coding algorithm. Decode the

information from the encoded string.

[10] [CO2] [BTL 3]

4. A convolutional code is described by generating sequences:

G1 = [100]

G2 = [101]

G3 = [111]

(i) Draw the encoder corresponding to this code.

(ii) Draw the state transition diagram for this code.

(iii)Draw the trellis diagram for this code.

(iv) Use Viterbi algorithm on the trellis obtained in (iii) to decode the received sequence
(101001011110111……) [2+2+3+3] [CO4,CO5][ BTL 4]

5. A channel has the following transition matrix

0.2 0.3 0.5


𝑃 = (0.5 0.3 0.2)
0.3 0.2 0.5

Sketch the channel diagram and compute H(Y), H(X/Y), H(Y/X), H(X,Y) and channel capacity

where X and Y are input and output random variables. Assume source has equally likely inputs.

[10] [CO3] [BTL 4]

Page 2 of 4
6. (a) Prove that the ternary [11, 6, 5] code is perfect.

(b) Show that the minimum Hamming distance of a code is the minimum number of columns of

its parity check matrix that are linearly dependent. [5+5] [CO4] [BTL 4]

7. (a) The generator polynomial for a (15, 7) cyclic code is g(x) = x8+ x7+x6+x4+1. Find the code

vector in systematic form for the message m(x) = x4+x3+x2.

(b) For a (15,11) binary linear cyclic block code generated by the polynomial g(x) = x4 +x+1,

Determine the code vector in systematic form of the message vector m = (11001101011).

[5+5][CO4][BTL 3]

8. Consider linear block code with generator matrix over GF (2) given below.

1 0 1 0 1 1
𝐺 = |0 1 1 1 0 1|
0 1 1 0 1 0

(i) Find the generator matrix and the parity-check matrix for an equivalent systematic

code.

(ii) How many codewords are there of weights 0, 1, 2, 3, 4, 5, 6?

(iii) Find the nonsystematic codeword with 101 as data symbols.

(iv) Decode the received word 111001. [4+2+2+2] [CO4,CO5] [BTL 3]

9. (a) Determine the generator polynomial of a double error correcting primitive BCH

code of block length n=15.

Page 3 of 4
(b) Determine the syndromes in a received polynomial v(x) = x 8+x6+x4+x2 of a (15,7)

double error correcting primitive BCH code.

[5+5][CO4] [BTL 3]

10. A binary system produces symbols +1’s with probability 0.7 and -1’s with

probability 0.3. Of these, 2/7 of the +1’s are received in error and 1/3 of the

-1’s are received in error. Estimate the mutual information and justify.

[10] [CO1] [BTL 5]

*****

Course Outcome / Bloom’s Taxonomy Level (BTL) Mark Distribution Table

CO Marks BTL Marks


CO01 10 BTL 1 -
CO02 10 BTL 2 -
CO03 10 BTL 3 50
CO04 55 BTL 4 30
CO05 15 BTL 5 20

Page 4 of 4

You might also like