Question: Consider a discrete memory less source with alphabet (s 0 , s 1 , s 2 ,) and statistics {0.7, 0.15, 0.15) for its output.
Consider a discrete memory less source with alphabet (s0, s1, s2,) and statistics {0.7, 0.15, 0.15) for its output.
(a) Apply the Huffman algorithm to this source. Hence, show that the average code word length of the l-Iuffm.an code equals 1.3 bits/symbol.
(b) Let the source be extended to order two. Apply the Huffman algorithm to the resulting extended source, and show that the average code-word length of the new code equals 1.1975 bits/symbol.
(c) Compare the average code-word length calculated in part (b) with the entropy of the original source.
Step by Step Solution
3.31 Rating (169 Votes )
There are 3 Steps involved in it
a 0 81 2 50 0 10 11 07 015 015 The Huffman code is therefore O The averag... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
19-E-T-E-C-S (130).docx
120 KBs Word File
Study Help