Professional Documents
Culture Documents
com
USN r-;tpEC55
". , _,
\\)~
1'_, \::'
" , / > ('
Fifth
,
Semester B.E. Degree Examination,
../
Dec.2017
.
/Jan.f~f8~ / "
,/
,/ 0 Information Theory and Coding ~/
,~
\'j
\) /)
m
Time: 3 hrs. r (- Max, Marks: 100
~ ,,) ote: Answer any FIVE full questions, selecting .-'
(-/-: at/east TWO questions from each part.rv-
v\,-:~~, ',:/
co
(~7/ l/
(~;>
\ \ (;
, "/
PAR T - A (F ),<~I
.,::--.. /
-
, (~\\--
1 a. A source emits one Oft~~)our probable messages mi, mJ:in3 I1l4 with probabilities 3/11, ~~d
g.
2111,2111 and 4111 respecrjvely. Find the entropy of the source and show that for the second
order extension of the source H(S2) = 2 H(S) by listing the symbols of second extended
source along with their probabilities. (10 Marks)
lo
b. A certain data source has 8" symbo Is that are produced in blocks of four at a rate of
500 blocks/sec. The first symbol in each block "5 always the same for synchronization. The
remaining three symbols are filled by any of the 8 symbols with equal probability. Find
c.
entropy rate of this source. /~,: / _
Explain the block diagram of an infdrmatJo:n system.
(/ ~
I') "-
r
ib
v'
(06 Marks)
<
(04 Marks)
)
ik
2 a. Explain the steps in the Shannon's encoding algorithm for generating binary code.
r r.--' (04 Marks)
D~ Show that H(X, Y) = H(Y) -H(XJY)~ + (04 Marks)
w
c. The state diagram ofthe mark off source is as shown in the Fig.Q2(c).
i) Find the stationary distribution.
ii) Find the entropy of each stare and hence the entropy of the source
-
ia
\. \
iii) Find the entropy oftf~/<jdjbint source and verify tHat,H(S) < H(S). (12 Marks)
t"vi//' ~ "
.: '~.,,</ oob .> '>
I ',.,
,
ed
.J Ir
.) (,/ /
.p
V
\.'" 7 J
1\ / /:/"
'-t
I \ \-/
Fig.Q2(c) 'n" ,.
w
',. )
/ I'
/<..1/ /1'
\' ~ \
" ,II
./ \' )~
'\'>
3 a. A discrete memoryless source has an alphabet of seven symbols with probabilities for its
w
"
output as S = {SI, S2, S3, S4, S5, S6, S7) ; P = {0.25, 0.25, 0.125,0.125,0.125"
/
0.0625,
u . O.0625}; x = {O, I}, compute the Huffman code for this source, moving the composite
-0
z .s :mbol as high as possible. Explain why the computed source code has an efficiency of
w
lof2
/) 'lOEC55
4 f' lWO noisy channels are cascaded whose channel matrices are given by :
';(~/X)=[~
C(/ >
~X ~
Ys]P(z/y)=[O
~ )j'
Ys
X
Xl
0 ,\
wiihy(.x\) = P(X2) = ~. Find the overall mutual information I(X,Z) and show that
rrx, Y)"">? roc, Z).
m
(12 Marks)
b. Alpha~~eric .data are entered into a computer from a remote terminal through a voice -
grade tel~?9-9~ channel. The channel has a bandwidth of 3.2KHz and output signal to noise
ratio of 20dI3. Tpe terminal has a total of 256 symbols. Assume that the symbols are
co
equiprobable 9)l1e successive transmissions are statistically independent.
i) Calculate ch' tJ.eJ,capacity )
ii) Find the avet1jo~%formation content per character \ "-
iii) Calculate the maximum symbol rate for which error free transmission over the channel
g.
is possible. < ("-
'/
A
("\ IJ'.. :) v
(08 Marks)
lo
5 a. Design a systematic (4, 2y'ItQ'ear'block code:
i) Find the generator matnx [0] and parity check matrix [H]
ii) Find all possible code vectors ..
iii) Write the standard array"
(14 Marks)
ik
b. Draw the general encoding circuit for (n, 1<:) Iinear block code and explain its operation.
(06 Marks)
/:
7 a. Write short notes on : i) RS codes ii) Go lay codes iii) Sh -rtened cyclic codes iv) Burst
error correcting c{d~s~) "(I5 Marks)
b. Define cyclic ~~d(( Explain how cyclic codes are generated from the generating
.p
/ \
s ate diagram
ii) Drae the' code tree
iii) Find~t.!1~encoder output produced by the message sequence 10111
iv) e,J;,ifythe output using time - domain approach (matrix method).
w
(14 Marks)
~... ~ I}
< /
{../<, -0
.:r."
w
Fig.Q8(a)
b. Explain encoding of convolution codes using time domain approach with an example.
(06 Marks)
*****
20f2