Scribd
Upload
53 views2 pages

Itc 2018-1

The document contains 6 questions related to information theory and coding. The questions cover topics like: 1) Log sum inequality and its consequences in information theory 2) Shannon Fano coding and bounds on average codeword length 3) Discrete memoryless symmetrical channels and channel capacity 4) Designing an encoder and decoder for a (6,3) linear block code 5) Encoding and decoding for a (15,11) cyclic code 6) Encoding and decoding using a convolutional code with a given encoder.

Uploaded by

Ritik Kundlas
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
53 views2 pages

Itc 2018-1

The document contains 6 questions related to information theory and coding. The questions cover topics like: 1) Log sum inequality and its consequences in information theory 2) Shannon Fano coding and bounds on average codeword length 3) Discrete memoryless symmetrical channels and channel capacity 4) Designing an encoder and decoder for a (6,3) linear block code 5) Encoding and decoding for a (15,11) cyclic code 6) Encoding and decoding using a convolutional code with a given encoder.

Uploaded by

Ritik Kundlas
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

C Roll. No.

National Institute of Technology Haanirpur (H.P.)


Name of Examination: B.Tech (Dual Degree) End-Semester (Dec 2018)
Semester : 7th
Branch : Electronics & Communication Engineering
Course Name : Information Theory and Coding Course Code : EC-609

Maximum Marks : 60
Time : 3 Hours
Note:
* All questions carry equal marks.
* Attempt all parts of a question at one place on the answer sheet.

1. (a) State and prove log sum inequality. What are the consequences of this inequality on information
theory field?
(b) Let the random variable X have three possible outcomes {a, b, c}. Consider two distributions on this
D (pl q) and D(4).
random variable p(x) = {0.5, 0.25, 0.25} and q(x) = {1/3, 1/3, 1/3}. Calculate
q(x) on a binary alphabet
Verify, if D(pl lq) = D(qlp). Give an example of two distributions p(x) and
such that D(pl lq) = D(q11p) (other than the trivial case p(x) = q(x)).

2. (a) Construct the Shannon Fano Elias binary code for the probability distribution {0.3, 0.2, 0.25, 0.125, 0.125}.
(b) Show that the average codeword length L of the optimal code satisfies

H(X) < L H(X) +1

Suppose the code is designed by assuming uniform distribution as opposed to the actual distribution.
What would be the effect on the above bound?
3. (a) Explain discrete memoryless symmetrical channels and define channel capacity.
(b) A channel with alphabet {0, 1, 2,3, 4} has transition probabilities of the form

p(y /x) = 0.5 ify=x±lmod 5 (1)


= 0 otherwise

Compute the capacity of this channel in bits and draw the channel diagram.

4. Consider the systematic Linear Block Code (6, 3), the three parity-check bits vo, v1, and v2 are formed
from the following equations:
Vo = Uo + U2

= U0 -I- Ui -I- U2

v2 = no +
H. Devise the encoder and syndrome
(a) Write down the generator matrix G and parity check matrix
decoder circuit along with the design equations.
(b) Comment on the error detection and correction capability of the devised circuit. Validate the encoder
and decoder circuit for data bits no = 0,u1 = 1, u2 = 0 and assuming single bit error in the received
codeword.
5. Consider the (15,11) cyclic code generated by g(X) = 1 + X + X 4.
(a) Devise the encoder for this cyclic code based on the generator polynomial. Devise the decoder based
on syndrome detection for this cyclic code.
1111111111111MMI Pr!!!

(b) What are the properties of generator polynomial for cyclic codes? Verify it for the generator poly-
nomial under consideration.
6. (a) Consider the convolutional encoder shown in the figure below. Find the encoder output produced
by the message sequence {10111}. Construct the code tree for the encoder.

Medulo 2
adder

Output

Input

(b) The trellis diagram of convolutional code is shown in the figure given below. The all zero sequence
is transmitted, and the received sequence is 100010000....Using the Viterbi algorithm, compute the
decoded sequence. What is the design code rate and constraint length of the encoder?

State
00 00 00 00
00
'‘.1.1
•• •
11 >
01 00
\
\
\ 0 ,\ 01 . \ \ 01
N \
10 \ \
\ \ \
\
10 10 1010 10 10 3.0
11 V--c) T -V V
"-0 i -- -0-1"

You might also like