Anna University,Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
Information Theory and coding IT2302
UNIT I-V
1.     Encode the following messages with their respective probability using basic Huffman algorithm
 M1 M2 M3 M4 M5 M6 M7 M8 1/2 1/8 1/8 1/16 1/16 1/16 1/32 1/32

calculate the efficiency of coding and comment on the result
2.     Find the channel matrix of the resultant channel. Find P(z1) if P(x1)= 0.6 and P(x2)= 0.4
3.     State and prove the source coding theorem
4.     State and prove the properties of mutual information
5.     A discrete memory less source has an alphabet of seven symbols whose probabilities of occurrence are as described below
Symbol:             s0        s1        s2        s3        s4        s5        s6
Prob :      0.25    0.25    0.0625           0.0625           0.125             0.125             0.125
Compute the Huffman code for this source moving combined symbols as high as possible
6.     Explain the LPC model of analysis and synthesis of speech signal. State the advantages of coding speech at low bit rates.