You are on page 1of 3

U.S.N.

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


Autonomous Institute Affiliated to VTU
JAN / FEB - 2021 Semester End Main Examinations

Programme: B.E. Semester : V


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

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

UNIT - I
Important Note: Completing your answers, compulsorily draw diagonal cross lines on the remaining

1. a) Justify that the information content of a message is a logarithmic function 06


of its probability of emission

b) i)A source emits one of 5 symbols once every millisecond. The symbol 04
blank pages. Revealing of identification, appeal to evaluator will be treated as malpractice.

probabilities are 1/2, 1/4, 1/8, 1/16 and 1/16 respectively. Calculate the
entropy of the source and information rate.

c) Given is the model of a Markov Process as shown in figure 1. Find 10


i) State probability
ii) Entropy of first order and second order source H(S) and H(S 2)
iii)G1, G2
iv) Efficiency and redundancy of first order source

Figure. 1

UNIT - II
2. a) A source produces two symbols A and B with probabilities 0.05 and 0.95 10
respectively. Construct a suitable binary code such that efficiency of
coding is at least 65%.

b) Apply Huffman encoding procedure for the following set of messages and 10
determine the efficiency of the binary code so formed
X1 0.7
X2 0.15
X3 0.15

If the same technique is applied to the 2nd order extension for the above
messages, how much will the efficiency be improved?
UNIT – III
3. a) Two noisy channels are cascaded whose channel matrices are given below 10
with p(x1)=p(x2)=1/2.
Show that I(x,y) is greater than I(x,z)
1 2
1 1 1 0
3 3
𝑌 4 2 4 𝑍 2 1
𝑃( )= [1 1 1 ] 𝑃( ) = 0
𝑋 𝑌 3 3
2 4 4 1 2
[0 3 3]

b) Find the capacity of the following discrete channel. 10


𝑌 0.8 0.2 0
𝑃 ( ) = [0.1 0.8 0.1]
𝑋
0 0.2 0.8

OR
4. a) Show that I(A,B) is always non negative. 07

b) Discuss the implications of Shanon-Hartley Law with appropriate 08


illustration

c) An analog signal has 4 KHz bandwidth. The signal is sampled at 2.5 times 05
the Nyquist rate and each sample quantized into 256 equally likely levels.
Assume that the successive samples are statistically independent.
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 50KHz and (S/N) ratio of 20
dB?
iii) If the output of this source is to be transmitted without errors
over an analog channel having (S/N) of 10dB. Compute the
bandwidth requirement of the channel.

UNIT - IV

5. a) For a systematic (7,4) linear block code, the parity matrix P is given by 12
1 1 1
1 1 0
[P]=
1 0 1
0 1 1
Find i) Find all possible valid code-vectors.
ii) Draw the corresponding encoding circuit.
iii)A single error has occurred in each of these received vectors.
Detect and correct those errors. i) Ra=[0111110] ii)Rb=[1011100]
iv)Draw the syndrome calculation circuit
b) Consider a (6,3) linear code whose generator matrix is 08
1 0 0 1 0 1
G= 0 1 0 1 1 0
0 0 1 0 1 1
i) Find all code vectors.
ii) Find all the Hamming weights and distances.
iii) Find minimum weight parity check matrix.
iv) Draw the encoder circuit for the above codes.

OR
6. a) Consider a (15,11) cyclic code generated by g(x)=1+x+x 4. Devise a 08
feedback shift register encoder circuit. Illustrate the encoding procedure
with the message vector 10010110111 by listing the state of the registers.

b) A (15,5) linear cyclic code has a generator polynomial 12


g(x)=1+x+x2+x4+x5+x8+x10
i) Draw the block diagram of an encoder and syndrome calculator for this
code.
ii) Find the code polynomial for the message polynomial
D(x)=1+x2+x4 in systematic form.
iii)Is V(x) = 1+x 4+x6+x8+x14 a code polynomial?

UNIT - V
7. a) For the (2,1,3) convolutional encoder shown, 10
i) Draw the state diagram.
ii) Draw code tree.
iii) Find the encoder output produced by the message sequence by
traversing through the code-tree.

b) For the given encoder, draw the trellis structure and obtain the output for 10
the given input message 10111 by tracing the path.

*****

You might also like