Professional Documents
Culture Documents
Ee242 HW4
Ee242 HW4
Coding
Homework #4 (due Monday Oct 28, 2013 )
Q1
p(r|s1)
p(r|s2)
1/4
si
p(r|si)
r
-5 -2
1/3
-4
Figure 2:
p(r|s1 )
and
p(r|s2 )
for Q1
where
s1 = 1
and
s2 = 0.5.
Moreover,
p(r|s1 )
and
p(r|s2 )
(a) Assume the two messages are equiprobable. Determine the received signal when i. ii. iii. iv.
p(s2 ) = 0.25.
Q2
and
dmin
(2)
in terms of
dmin
(1)
Eb .
Eb /N0 ,
probability over a high SNR AWGN channel? (c) For each constellation, determine whether you can label signal points using three bits so that the label for nearest neighbors dier by at most one bit. If so, nd such a labeling. If not, say why not and nd some good labeling.
Q3
16-QAM constellation is shown in Fig. 4 along with another constellation which is created by moving the outer corner points of the 16-QAM constellation to the I and Q axes.
8-PSK
QAM1
Figure 3: Constellations for Q2
QAM2
(a) For each constellation, determine the average energy. Express the minimum distance in terms of the average energy per bit. (b) For each constellation, determine the average number of nearest neighbors. (c) Which constellation is better to use? Give reasons.
Q
d d
d d
Q4
Consider the classical binary detection problem with equi-probable signals (assume onedimensional observation space and
s1 > s2 ) H1 : z = s1 + n H2 : z = s2 + n
where
u()
a > 0.
Does the ML rule reduce to the minimum Euclidean distance rule (as in