Documente Academic
Documente Profesional
Documente Cultură
Roll no:
Reg. no:
Sec:
Information Theory and Coding
Course Code: ECE533
Test-1 (SET A) MM: 30
---------------------------------------------------------------------------------------------------------------
PART 1 -Recall
Q1. Differentiate Mutual information and Average Mutual information with expression and
ONE example [2]
Q2. Explain given relation with one example only.
I(X;Y) = H(X)-H(X|Y) [2]
Q3. Explain why zig-zag scanning is performed in JPEG. [2]
PART 2 -Apply
Q4. Consider a message M = AAABABBABBABAADAABBBAABCCCCD
(a) Compress the message M using Huffman, Runlength and Lempel ziv algorithm show
the compressed message [5+4+4]
(b) Compare the compression ratio of all three [3]
(c) Conclude which one is efficient for such message [1]
(d) Explain which Algorithm is not applicable for this message and why? [1]
Q6. Compute Entropy of the source which produce five symbols with given probabilities.
xi = [ x1 x2 x3 x4 x5 ]
P(xi) = [ 1/3 1/3 1/9 1/9 1/9 ] [2]
----------------------------------------------------------------------------------------------------------------
Start from here:
Nikesh Bajaj
|Sep 10, 2014, 11:00AM | Name:
Roll no:
Reg. no:
Sec:
Nikesh Bajaj