A discrete memory less source has an alphabet of 7 letters x1 x2 x3 x4 x5 x6 x7 with probabilities 0.35, 0.30, 0.20, 0.10, 0.04, 0.005 and 0.005 respectively. Use the Huffman encoding procedure to determine a binary code for the source output.
A discrete memory less source has an alphabet of 7 letters x1 x2 x3 x4 x5 x6 x7 with probabilities 0.35, 0.30, 0.20, 0.10, 0.04, 0.005 and 0.005 respectively. Use the Huffman encoding procedure to determine a binary code for the source output.
A discrete memory less source has an alphabet of 7 letters x1 x2 x3 x4 x5 x6 x7 with probabilities 0.35, 0.30, 0.20, 0.10, 0.04, 0.005 and 0.005 respectively. Use the Huffman encoding procedure to determine a binary code for the source output.
NR M.Tech. – II Semester Regular Examinations, September, 2008
CODING THEORY & TECHNIQUES
(Digital Electronics & Communication Systems)
Time: 3hours Max. Marks:60
Answer any FIVE questions
All questions carry equal marks --- 1.a) Define information rate. Obtain the expression for information rate. b) Compare fixed and variable length coding. What are the properties of prefix codes?
2. A discrete memory less source has an alphabet of 7 letters
x1 x2 x3 x4 x5 x6 x7 with probabilities 0.35, 0.30, 0.20, 0.10, 0.04, 0.005 and 0.005 respectively. Use the Huffman encoding procedure to determine a binary code for the source output. Also calculate coding efficiency.
3. Use Lempel-Zin algorithm to encode the following sequence.