Multimedia Networking Principles
Homework Assignment #2
Problem 1
Suppose eight characters have the distributions as the following: A:(1), B:(1), C:(1), D:(2). E:(3),
F:(5), G:(5), H:(10). Draw a Huffman coding tree for this distribution and calculate the average
number of bits for a character.
Problem 2
Obtain a MPEG-2 trace from the Internet. Find out the actual size of I-, P-, and B-frames from
the trace. You then need to report the maximum, average and minimum sizes of all three types of
frames.
Problem 3
and analyze their expected performance.
improvement from H.264.