Scribd
Upload
95 views1 page

It2302 PDF

This document lists 20 questions related to the subject of Information Theory and Coding that will be included on an exam for the IT2302 course at Anna University for the November/December 2013 session. The questions cover topics such as properties of mutual information, source coding theorem, entropy calculation, Huffman coding, speech coding, DPCM, LPC, JPEG, video coding standards H.261, Hamming codes, CRC codes, convolutional codes, and turbo codes.

Uploaded by

SonaAnnya
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
95 views1 page

It2302 PDF

This document lists 20 questions related to the subject of Information Theory and Coding that will be included on an exam for the IT2302 course at Anna University for the November/December 2013 session. The questions cover topics such as properties of mutual information, source coding theorem, entropy calculation, Huffman coding, speech coding, DPCM, LPC, JPEG, video coding standards H.261, Hamming codes, CRC codes, convolutional codes, and turbo codes.

Uploaded by

SonaAnnya
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/ 1

REJINPAUL.

COM IMPORTANT QUESTIONS


ANNA UNIVERSITY NOV/DEC 2013 EXAMS
IT2302 - Information Theory and Coding
1. State and prove the properties of mutual information
2. State and prove the source coding theorem
3. A discrete memory less source has an alphabet of five symbols with there are given by, [X] = [X1, X2, X3, X4, X5] [P]
= [0.35, 0.25,0.18,0.10,0.25].Compute Entropy & second order Extension for the Symbol. Find the amount of
Information gained by observing the source.
4. Find the channel matrix of the resultant channel. Find P(z1) if P(x1)= 0.6 and P(x2)= 0.4
5. Encode the following messages with their respective probability using basic Huffman Algorithm
calculate the efficiency of coding and comment on the result

M1
1/2

M2
1/8

M3
1/8

M4
1/16

M5
1/16

M6
1/16

M7
1/32

M8
1/32

6.Explain the LPC model of analysis and synthesis of speech signal. State the advantages of coding speech at low bit rates
7. Explain in detail about Adaptive Huffman Coding
8. With a block diagram explain psychoacoustic model
9. With the block diagram explain DPCM system. Compare DPCM & ADPCM systems.
10. Explain Linear Predictive Coding
11. Explain the compression principles of P and B frames.
12. explain the working of JPEG encoder, With a neat block diagram,
13. Explain in detail about H.261
14. Consider the (7, 4) Hamming code defined by the generator polynomial g(x) = 1+x+x3. The code word 1000101 is sent
over a noisy channel, producing the received word 0000101 that has a single error. Determine the syndrome polynomial
s(x) for this received word. Find its corresponding message vector m and express m in polynomial m(x)
15. Determine the encoded message for the following 8- bit data codes using the CRC generating polynomial g(x) = x4+x3+x0.
(i)
11001100 (ii) 01011111
16. Consider a (7, 4) cyclic code with generator polynomial g(x) = 1+x+x3. Let data d= (1010). Find the corresponding
systematic code word
17. Explain the Turbo Decoding in detail and its uses
18. Construct a convolutional encoder for the following specifications: rate efficiency , constraint length 3, the
connections from the shift register to modulo 2 adder are described by the following equations, g1(x) =1+x+x2,
g2(x)=1+x2.Determine the output codeword for the message [10011]
19. A convolution encoder has a single shift register with 2 stages, 3 mod-2 adders and an output Mux. The generator
sequence of the encoder as follows: g(1)=(1,0,1), g(2)=(1,1,0) g(3)=(1,1,1). Draw the block diagram and encode the message
sequence (1110) and also draw the state diagram
20. A rate 1/3 convolution encoder has generating vectors as g1= (100), g2= (111), g3= (101)
(i)Sketch the encoder configuration. (ii)Draw the code tree, state diagram and trellis diagram. (iii)If the message
sequence is 10110, determine the output sequence of the encoder

You might also like