You are on page 1of 2

KING ABDULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY

ELECTRICAL ENGINEERING DEPARTMENT


Fall 2013
EE 242 Digital Communications and Coding
Homework #4
(due Monday Oct 28, 2013 )

Q1

Consider the channel in Fig. 1

p(r|s1)

si

p(r|si)

1/3

r
-5

Figure 1: Channel for Q1

where

s1 = 1

and

s2 = 0.5.

p(r|s2)

-2

-4

Figure 2:

Moreover,

p(r|s1 )

1/4

and

p(r|s2 )

p(r|s1 )

and

p(r|s2 )

for Q1

are shown in Fig. 2.

(a) Assume the two messages are equiprobable. Determine the received signal when
i.

r = 2

ii.

r = 1

iii.

r=3

iv.

r = 7

(b) Calculate the probability of error assuming that

Q2

p(s1 ) = 0.75

and

p(s2 ) = 0.25.

Three 8-ary constellations are shown in Fig. 3.


(a) Express

and

(b) For a given

(2)

dmin

Eb /N0 ,

in terms of

(1)

dmin

so that all three constellations have the same

Eb .

which constellation do you expect to have the smallest bit error

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

QAM2

Figure 3: Constellations for Q2

(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.

d
d

Figure 4: Constellations for Q3

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

with additive exponential noise, i.e.,


function and

a > 0.

pn (n) = aean u(n),

where

u()

is the standard unit-step

Does the ML rule reduce to the minimum Euclidean distance rule (as in

the AWGN case)?

You might also like