Scribd
Upload
41 views2 pages

HW 3

This document contains 6 problems related to digital communications and signal processing. Problem 1 involves ternary hypothesis testing with Gaussian observations. Problem 2 involves calculating probabilities for multivariate Gaussian random variables. Problem 3 involves drawing decoding regions for M-ary signaling over an AWGN channel. Problem 4 involves binary hypothesis testing with different noise variances. Problem 5 models data storage using an input-dependent Gaussian channel. Problem 6 compares 16-PAM and 16-QAM signaling over an AWGN channel.

Uploaded by

김동욱
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views2 pages

HW 3

This document contains 6 problems related to digital communications and signal processing. Problem 1 involves ternary hypothesis testing with Gaussian observations. Problem 2 involves calculating probabilities for multivariate Gaussian random variables. Problem 3 involves drawing decoding regions for M-ary signaling over an AWGN channel. Problem 4 involves binary hypothesis testing with different noise variances. Problem 5 models data storage using an input-dependent Gaussian channel. Problem 6 compares 16-PAM and 16-QAM signaling over an AWGN channel.

Uploaded by

김동욱
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE

School of Computer and Communication Sciences


Handout 6 Principles of Digital Communications
Problem Set 3 Mar. 4, 2020

Problem 1. Consider the ternary hypothesis testing problem


H0 : Y = c0 + Z, H1 : Y = c1 + Z, H2 : Y = c2 + Z,
T
√
where
√ Y =
√ T[Y 1 , Y2 ] is
√ the two-dimensional
√ T observation vector, c 0 = E[1, 0]T , c1 =
1 1
2
E[−1, 3] , c2 = 2 E[−1, − 3] , and Z = [Z1 , Z2 ]T ∼ N (0, σ 2 I2 ).
(a) Assuming the three hypotheses are equally likely, draw the optimal decision regions in
the (Y1 , Y2 ) plane.
(b) Assume now that the apriori probabilities for the hypotheses are Pr{H = 0} = 21 ,
Pr{H = 1} = Pr{H = 2} = 41 . Draw the decision regions in the (L1 , L2 ) plane where
fY |H (Y |i)
Li := , i = 1, 2.
fY |H (Y |0)

Problem 2. Let X ∼ N (0, σ 2 I2 ). For each of the three diagrams shown below, express the
probability that X lies in the shaded region. You may use the Q function when appropriate.
x2
x2
x2
2

x1 1
−2 1 x1 x1
2 2

(a) (b) (c)

Problem 3. Let H ∈ {0, 1, 2, 3} and assume that when H = i you transmit the code-
word ci shown in the following diagram. Under H = i, the receiver observes Y = ci + Z.

(a) Draw the decoding regions assuming that Z ∼ N (0, σ 2 I2 ) and


that PH (i) = 1/4, i ∈ {0, 1, 2, 3}. y2
c1
(b) Draw the decoding regions (qualitatively) assuming Z ∼
N (0, σ 2 I2 ) and PH (0) = PH (2) > PH (1) = PH (3). Justify your
y1
answer. c2 c0
c3
 i ∈ {0, 1, 2, 3} and that Z ∼
(c) Assume again that PH(i) = 1/4,
σ2 0
N (0, K), where K = . How do you decode now?
0 4σ 2

Problem 4. The following problem relates to the design of multi-antenna systems. Con-
sider the binary equiprobable hypothesis testing problem:
H = 0 : Y1 = A + Z1 , Y2 = A + Z2
H = 1 : Y1 = −A + Z1 , Y2 = −A + Z2
where Z1 , Z2 are independent Gaussian random variables with different variances σ12 6= σ22 ,
that is, Z1 ∼ N (0, σ12 ) and Z2 ∼ N (0, σ22 ). A > 0 is a constant.
(a) Show that the decision rule that minimizes the probability of error (based on the
observable Y1 and Y2 ) can be stated as
0
σ22 y1 + σ12 y2 ≷ 0
1

(b) Draw the decision regions in the (Y1 , Y2 ) plane for the special case where σ1 = 2σ2 .
(c) Evaluate the probability of the error for the optimal detector as a function of σ12 , σ22
and A.

Problem 5. The process of storing and retrieving binary data on a thin-film disk can be
modeled as transmitting binary symbols across an additive white Gaussian noise channel
where the noise Z has a variance that depends on the transmitted (stored) binary symbol
X. The noise has the following input-dependent density:
 2
− z
 √ 1 2 e 2σ12 if X = 1


2πσ1
fZ (z) = 2
− z
 √ 1 2 e 2σ02 if X = 0,


2πσ0

where σ1 > σ0 . The channel inputs are equally likely.

(a) On the same graph, plot the two possible output probability density functions. Indicate,
qualitatively, the decision regions.
(b) Determine the optimal receiver in terms of σ0 and σ1 .
(c) Write an expression for the error probability Pe as a function of σ0 and σ1 .

Problem 6. The following two signal constellations are used to communicate across an
additive white Gaussian noise channel. Let the noise variance be σ 2 . Each point represents
a codeword ci for some i. Assume each codeword is used with the same probability.
x2
b

a
x x1
0

16-PAM 16-QAM

(a) For each signal constellation, compute the average probability of error Pe as a function
of the parameters a and b, respectively.
(b) For each signal constellation, compute the average energy per symbol E as a function
of parameters a and b, respectively:
16
X
E= PH (i)kci k2
i=1

E
(c) Plot Pe versus σ2
for both signal constellations and comment.

You might also like