0% found this document useful (0 votes)
26 views3 pages

Ect306 Information Theory and Coding, December 2024

The document is an examination paper for the B.Tech Degree in Information Theory and Coding from APJ Abdul Kalam Technological University. It includes questions divided into two parts, with Part A containing short answer questions and Part B requiring detailed answers from various modules. Topics covered include entropy, coding theorems, channel capacity, and error detection in coding systems.

Uploaded by

adarshstudies887
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)
26 views3 pages

Ect306 Information Theory and Coding, December 2024

The document is an examination paper for the B.Tech Degree in Information Theory and Coding from APJ Abdul Kalam Technological University. It includes questions divided into two parts, with Part A containing short answer questions and Part B requiring detailed answers from various modules. Topics covered include entropy, coding theorems, channel capacity, and error detection in coding systems.

Uploaded by

adarshstudies887
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/ 3

c 1200ECT306052401

RegNo.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UMVERSITY


B.Tech Degree 56 (S, FE) / 56 (PT) (S, FE) Examination December2024 (201

Course Code: ECT306


Course Name: INFORMATION THEORY AI{D CODING
Max. Marks: 100 Duration:3 Hours
PART A
Answer all questions, each carries 3 marks. Marks

.Define
the term entropy of a discrete memory-less source. Calculate the entropy (3)

of a DMS'with trvo symbols with respective probabifities 1i i 1.

2 Differentiate between source coding and channel coding (3)


3 State Shannon's channel coding theorem (3)
4 What is meant by the differential entropy? Derive an expression for the same (3)
) Evaluate the expresst"" over the prime field modulo-5 operation
(3)
{(hll$
6 Differentiate between block codes and convolutional codes. (3)
7 Elaborate on the features of cyclic codes and their benefits. (3)
8 Explain the parameters of Hamming codes (3)
9 Draw the convolutional encoder whose connection vectors are, gr:(l I l) and (3)
g2:(l0l).
l0 Explain the features of any one 'capacity approaching' code. (3)
PART B
Answer onefull questionfrom each module, each carries 14 marhs.
Module I

ll a) Determine the mutual information between two discrete memoryless sources X (7)
and Y with conditional probability matrix giv€i by
[o.s o.s o I
P(YD() = lo.s 0 0.s I
L 0 0.5 0.5J

Veriff the formula H(X,YF H(X) + H(YD(). Given p(xr):0.6, p(xz)=0.3 &
p(xr):0.1.
b) For any discrete memoryless source S- {sr, s2: s3: sq}, prove that (7)
0 S H(S) < logzq , where H(S) is the entropy of the source.

OR

Page lof3 ?
L

1200EcT306052401

12 a) ConsideraDMSwithsourceprobabilities{0.35,0.25'0.2,0.15,0.05}(10)
i. Determine the binary Huftnan code for this source
symbols A' B
ii. Determine the ternary Huftnan code for this source using
and C.
tength and compare'
iii. Determine the average code wd'd
:A oi'r*,6';'*Ords, of which 15 occur with (4)
b) givOfii,,sortrce alphabet consists

pr0babil,iry.,0.06eachandtheremainiii$w,otdsoccurwithprobability0.00035
each"If1000wordsaretransmittedeachs€cond,whatistheaveragerateof
informatio* transmission? 'i"

Modulell'
A)
13 a) A binaqy;qlannel has the followint ""-l*'i'ti"*cteristics:
pgno =E,nn t,-]
Findthechannelcapacity,efficiencyandredundancyofthechannel,ifthe
probabilities p(xr) = 213 and p(xz) = l/3'
source symbols are occurred with
theorem 0)
b) State and derive Shannon-Hartley
OR
employs a continuous source' The channel noise
is (7)
14 a) A communication system
bandwidth of the sourte output is
l0 MHz and signal to
white and Gaussian. The
nsisepower ratio at the receiver is
100'

i. Determine the channel caPacitY


to achieve the
ii. If the SNR drops to 10, how rhuch bandwidth is needed
same channel caPacitY?
infinite bandwidth' Discuss shannon's
limit Q)
b) Find the capacity of a channel with
Module lll
(10)
whose parity check equations are:
, 15 a) consider a systematic block code l
pt = mt+m2+m4 i
p2 = ml+m3+m4
p3 = mt+m2+m3
pn = mz*ml*ffi+
this code
i, Constnrct the G and H matrices for
and correct?
ii. How many errors can the code detect
iii. Is the vector l0l0l0l0 a valid codewotd?

0l0l I100 a valid codeword?


iv. Is the vector

?
\
PageZof3
1200ECT306052/101

b) Which among the following block codes are perfect codes? Justi$ your answer. (4)
i. (7,3) .

ii. (7,4)
OR
16 a) 'lthe parity check matrix for a (7,4) 1gg is-given below:

11 1 9l (7)
o=lo 1 1l
tl;rJ
Draw the *fndrome calculator circuit ftr the code.
:1
b) Exptain th€ standard array decoding of linear block code. Derive the standard (T)
trray fur,a (5,1) repetition code.
'.:

Module tV
17 a),',,Encode th message l0l in systematic form for a cyclic code with generator (5)
PolYnomial g(X) : I + X + X2 +X4.
b) Design a feedback shift register e.ncoder for an (8,5) cyclic code with generator (9)
polynomial g(X) : I + X + X2 +X3. Use the encoder to find the codeword for the
message l0l0l in systematic form.

OR
18 a) considerthe generator polynomial of e,4) cycric code as g(X) = l+X2+xr. (s)
:i :, i. Determine the parity check polynomial for this code
ii. Find the generator and parity check matrices in systematic form
",
':: iii. Determine the error detecting and correcting capability of the code.
' b) A (15'5) cyclic code has a generator polynomial as follows: (6)
gCX)= I *X+X2+X5+1E tXro.
i. Find the code polynomial forthe message l0l0l
ii. Has any eror occurred during transmission for the received word
' 100010101000001? j
Module V
19 a) Draw the state, tree and trellis diagram for the K=3, rate l/3 code generated by, (14)
gr(X) = X+X2
ga(X) =l* X
g;r(X) =l+ X+X2
OR
20 a) Explain decoding of convolutional codes using viterbi algorithm. (14)
****

Page 3of3 ?
\

You might also like