AT77.

13 Digital Communications
Solutions for Quiz 1, Feb 2011
Problem 1 (8 points): (a) (1 point) YES. The marginal PMFs such that fX,Y (x, y) = below.   1/4, 1/2, x = −1 1/2, fX (x) = fY (y) = 1/2, x = 1  1/4, (b) (2 points) We compute H(Y ) below. H(Y ) = −2 × 1 1 1 1 log2 − log2 = 1.5 4 4 2 2 fX (x)fY (y) are given y = −1 y=0 y=1

For H(X|Y ), note that the independence between X and Y implies that H(X|Y ) = H(X) = 1. (c) (2 points) The values of Z under all possibilities of X and Y are listed below. fX,Y (x, y) x y z 1/8 −1 −1 −2 1/4 −1 0 −1 1/8 −1 1 0 1/8 1 −1 0 1/4 1 0 1 1/8 1 1 2 It follows that the PMF of Z is   1/8, z    1/4, z  1/4, z fZ (z) =   1/4, z    1/8, z = −2 = −1 =0 =1 =2

yielding the entropy equal to

H(Z) = −2 ×

1 1 1 1 log2 − 3 × log2 = 2.25. 8 8 4 4

1

is shown below.(d) (3 points) One possible optimal code tree. PMF 0 1/2 0 1/4 0 1 1/2 1 1/4 0 1 1/8 1/8 2 1 1/4 1/4 0 1 symbol 2 . which can be obtained through the Huffman algorithm.

Sign up to vote on this title
UsefulNot useful