BTech/PE-702/XEC1/20o

B.Tech 7th Semester Exam., 2020

held in March, 2021

INFORMATION THEORY AND CoDING

Paper PE-702/XEC-1

Full Marks : 60
Time 2 hours

The figures in the margin indicate full marks

for the questionss

Answer Question No. 1 which is compulsory

and any one from each Module

1. Answer all the questions 2x6 12

(a) How does entropy coding differ from
source coding?
What is Hamming distance? Write
(b) down the expression for number of
errors to be detected and corrected.
c) What is entropy? What will be the
entropy of binary memoryless source?
(d) What is the importance of using
Lempel-Ziv coding?
e) What is the information content in an
event with probability 1/2?
the and
Compute error detection error
correction capability of a Hamming
code if minimum distance, dnin = 5 bit.

13-21/59 (Turn Over )

 3)
2)
s o u r c e emits six
(c) A discrete memoryless
MODULE-1 messages
with probabilities {0-4, 0.2,
S h a n n o n - F a n o code
2. (a) State the mutual information of a 0-2, 0-1, 01}. Find
and determine efficiency.
channel. Verify that the mutual
information I(X; Y) 2 0. the three important
properties
(d) Explain 2+3+4+3=12
of mutual information.
(b) (i) For a
binary symmetric channel
(BSC)-
MODULE-2

Shanenjuman
tonpe
tiv
ame 1. show that
information I(X; Y)
the
is
I(X; Y) = H(Y)+ Plog2 P
mutual
given by 4. (a) Define
decoding
the concept
for linear block
code.

the
of syndrome

following
control code has
+(1- P)lo82(l- P); An error
parity check matrix:
2. calculate I(X; Y) for a =
0.5
and P=0.1. 1 0 1 1 0 0p
1-P H =|1 1 0 0 1 o
0 1 1 o o 1
matrix G.
Determine the generator
(i) with
word that begin
Plx)-1- (ii) Find the code

1-P y2 101..
received code word
(ii) Decode the
error
(ii) Verify that the channel capacity for 110110 and
comment on

a BSC channel, of this code.

d e t e c t i o n capability
particular
C, =1+ Plog2 P +(1- P}log2(1 -P) The parity
check matrix
of a

(b) code is given by

linear block
(2+3)+(4+3)=12 (7, 4)
11 1 0 1 0 0
3. (a) Define discrete memoryless source. 0 1 0
10 1
(b) Compute the entropy of a DMS with [H] =|1 1
10 1 100
source alphabet
vectors.
code
List all the
S -
1so. S], S2} with probabilities (i)
(Turn Over )
)

13-21/59
13-21/59 (Continued )
 4) 5)

(i) What is the minimum distance Define Galois field with

c) example.
between the code vectors?
(d) Perform addition of two
polynomials
fii) How many errors can be detected
alx)= 1 X X* xS
and corrected? (24)6-12
bx)=1 Xx -x* -x 3-3-3-3-12
5. (a) State the cyclic code and write down
the properties of cyclic code. 7. (a) Define field with example.
Draw the encoder for a(7, 4) (b) Let P is prime and GF(P) is defined as
cyclic Hamming code generated by
the
GFP)=10,1, 2,, P-1
generator polynomial given by
Compute Modulo-P addition and
GP) =1+P+PS. multiplication.
(b) A message 101101 is to be transmitted
m =4 P(X) =1 X x
in cyclic code with a generator (c) With and
polynomial GP) =P* pS,1. primitive polynomial over GF(2)
construct GF(24). Tabulate power
(i) Obtain the transmitted code word. representation, polynomial representa
(ii) How many check bits does the tion and 4-tuple representation. 3-4-5-12
encoded message contain?
(üi) Draw the encoding MODULE4
arrangement
for the same. 8. fa) State the importance of convolutional
(2+4)+6-12
codes. A convolutional encoder has a
single -shift register with two stages
MoDULE-3 (1.e., constraint length K- 3). three
modulo 2 adders, and an output
6. (a) Identify the conditions to be satisfied by multiplexer. The generator sequences
the operations of a set G to be defined of the encoder are as follows
as a group.

(b) Consider a set of integers G as follows

g-(1.0,1
G {0, 1, 2,, m-1 g-(1.1,0
Compute modulo m addition results gS-(1.1,1)
with m = 5. Draw the block diagram of the encoder.

13-21/59 13 21/59 Turn Over )

(Continued )
 6
7)

(b) The below figure shows the encoder for

a rate r=1/2, ionstraint length K =4 (b) (i) Consider the rate r 1/2 with =

constraint length K=2 convolu-

convolutional code. Determine the
tional encoder of the following
encoder output produced by the
figure. If the code is systematic,
message sequence 10111...
then find the encoder output
produced by the message sequence
Modulo-2 10111.
adder
ii) Construct the code tree for the
convolutional encoder of the figure.
Input|
O-

Flip-flop
Output >Output Trace the path through the tree
that corresponds to the message
sequence 10111.

Modulo-2
(2+4)+6-12 adder

9. (a) Determine the state diagram for the V2&

v. Output
convolutional encoder shown in figure. V
Draw the Trellis diagram
through Input Flip-flop
first set of steady state transitions. the
On m
the second Trellis diagram, show the 6+(3+3)-12
termination of the Trellis to the all-zero
state.

Inputr S

Output
13-21/59
(Continued) 13-21-1 10/59 BTech/PE-702/XEC1/20