Question: 9 Points [Entropy] (a) (3 points) Show that, for a source generating N symbols, the entropy is maximum when the symbols are all equiprobable. (b)
9 Points [Entropy]
(a) (3 points) Show that, for a source generating N symbols, the entropy is maximum when the symbols are all equiprobable.
(b) (5 points) Suppose we receive the sequence of symbols 4 5 8 6 4 7 8 9 4 8.
i. If we know that the probabilities of receiving such symbols are: P4 = P5 = P6 = P7 = P8 = P9 = 1 6, then what is the entropy of symbols under this probability model?
ii. Now assume that the probability model is given by the frequency of occurrence of the symbols that were actually received. Now what is the entropy? Explain the di?erence.
iii. Calculate how many bits in total and how many bits per symbol are needed to transmit symbols in the probability model stated above in part (ii) if the actual symbol stream is: 4 4 4. Explain any discrepancy from the entropy.
(c) (1 point) What is the lower limit, in bits per pixel, for the Hu?man coder? Explain brie?y.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
