114_1_image_proc_exam_2009_Part2

114_1_image_proc_exam_2009_Part2 - 2 =0.1, p 3 =0.05, and p...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EE114 Introduction to Speech and Image Processing Winter Quarter, 2009 Page 5 of 5 5. Huffman Coding (20 points) Consider a set of symbols s 0 , s 1 , s 2 , s 3 , and s 4 , with associated probabilities p 0 , p 1 , p 2 , p 3 , and p 4 . Assume that p 0 =0.7, p 1 =0.1, p
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2 =0.1, p 3 =0.05, and p 4 =0.05. a) (10 points) Find all the possible Huffman tree structures. How many are they? b) (10 points) Find the average code length corresponding to all possible tree structures....
View Full Document

Ask a homework question - tutors are online