U.S.N.

B. M. S. College of Engineering, Bengaluru - 560019

Autonomous Institute Affiliated to VTU
October / November 2021 Supplementary Examinations

Programme: B.E. Semester : V

Branch : TELECOMMUNICATION ENGINEERING Duration: 3 hrs.
Course Code: 19ET5PCITC Max Marks: 100
Course: INFORMATION THEORY AND CODING Date: 28.10.2021

1
02
Instructions: 1. Answer any FIVE full questions, choosing one full question from each unit.
2. Missing data, if any, may suitably assumed.

S2
UNIT - I
1. a) Show that the Entropy attains a maximum value when the symbols occur 05

M
with equal probabilities.

XA
b) For the First order Markov Source, as shown 09
i) Find the entropy of each state and entropy of the source.
ii) Find G1, G2 and Show that G1 > G2 > H.
YE
T AR
EN

c) The Joint probability for a channel is given below. Compute individually 06

H(X), H(Y), H(X, Y), H(Y/X), H(X/Y) and I(X, Y).
M

0.25 0 0 0
0.10 0.30 0 0
LE

0 0.05 0.10 0
0 0 0.05 0.1
PP

P(X, Y) = 0 0 0.05 0
SU

UNIT - II
2. a) Consider a source with 8 alphabets A to H with respective probabilities of 07
0.22, 0.20, 0.18, 0.15, 0.10, 0.08, 0.05, and 0.02. Construct a binary
Huffman code and determine the code efficiency and redundancy.
 b) The source emits 5 symbols A, B, C, D and E. The probability of 07
Occurrence of the symbol A is (6/16). The following sequences are given
6 10 13 15
a 1 =0 , a 2 =16 , a 3 =16 , a 4 =16 , a 5 =16 and a 6 =1 .
Compute the probabilities of B, C, D and E. Obtain the Shannon binary
encoding algorithm for the source and calculate the efficiency of the
source and redundancy.

State and Prove Noiseless Coding Theorem.

1
c) 06

02
UNIT – III
3. a) Derive an expression for channel capacity of the Binary Symmetric 07

S2
Channel.

b) Two noisy channels are cascaded whose channel matrices are given below 08
with P (X1) = P(X2) = 0.5. Find the overall mutual information I(X, Z).

M
P(Y/X) =

XA
YE
P (Z/Y) =
T AR
EN

c) Find the channel capacity for the matrix given the conditional probabilities 05
P(b1/a1)= ½, P(b2/a1)= 1/3, P(b3/a1)= 1/6; P(b1/a2)= 1/3, P(b2/a2)= 1/6,
P(b3/a2)= ½; P(b1/a3)=1/6, P(b2/a3)= ½, P(b3/a3) = 1/3.
M
LE

OR
4. a) Prove that the mutual information is non negative for continuous channel. 08
PP

b) An analog signal has a 10 KHz bandwidth. The signal is sampled at 2.5 06

times the Nyquist rate and each sample quantized into 128 equally likely
SU

levels. Assume that the successive samples are statistically independent. i

i) Find the Information rate of this source.
ii) Can the output of this source be transmitted without errors over
a Gaussian channel of bandwidth 10 KHz and (S/N) ratio of
10db?
iii) If the output of this source is to be transmitted without errors
over an analog channel having (S/N) of 20 dB, Compute the
bandwidth requirement of the channel.
 c) State and prove Shannon Hartley Law. 06
Important Note: Completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages. UNIT - IV

5. a) For a systematic (6, 3) linear block code, the check bits are given by 10
C4= d1+d2
C5 = d2+d3
C6= d1+d3
Find all possible valid code vectors.

1
(i) Draw the corresponding encoding circuit

02
(ii) Find all Hamming weights and minimum hamming distance.
(iii) Draw the syndrome calculation circuit.
Design (n,k) Hamming code with a minimum distance of 3 and a message

S2
b) 10
length of 4 bits. Construct Standard Array for the code so formed.

M
OR
6. a) A (15, 7) linear cyclic code has a generator polynomial g(x) = 1 + x4+x6 07
+x7+x8.
(i)

XA
Find the code polynomial for the message D(x) = x2+x3+x4 in
systematic form.
(ii) Assume the first and the last bit of the code vector suffer
YE
transmission errors. Find the Syndrome of the code vector.

b) The generator polynomial of a (15, 7) cyclic code is g(x) = 1+x4+x6+x7+x8 07

. Find the code word in systematic form for the message 0101010 clearly
AR

explaining all the steps. In particular list the states of the registers in each
step of code computation. Verify your answer by direct hand calculation.
T

c) A linear hamming code is described by a generator polynomial g(x) = 1+D 06

EN

+ D3
(i) Determine the generator and the parity check matrix
(ii) Design an encoder circuit
M

UNIT - V
LE

7. a) For the (2, 1, 3) convolutional code with g (1) = (1011), g (2) = (1111). 04
(i) Find the generator matrix.
(ii) Find the code word corresponding to the information sequence
PP

10111 using transform Domain approach.

b) For the binary convolutional encoder (2, 1, 2) given below. Draw the state 12
SU

transition table, trellis diagram. Using the trellis structure, find the
encoded sequence for the message 10111. If the received vector is [11 11
10 01 10 01 11] decode the input sequence using Viterbi Decoding.
 1
02
S2
M
XA
YE
T AR
EN
M
LE
PP

c) Describe RS Codes with applications. 04

SU

*****