TUTORIAL #8-2014

T UTORIAL 8
Question 1:
Consider 2-user BPSK signaling in AWGN, with received signal
y = b1 u1 + b2 u2 + n,

(1)

where u1 = (1, 1)T , u2 = (2, 1)T , b1 , b2 take values 1 with equal probability and n is AWGN of
variance 2 per dimension.
(a) Draw the decision regions in the (y1 , y2 ) plane for making joint ML decisions for b1 , b2 , and specify
the decision if y = (2.5, 1)T .
(b) Find the union bound on the conditional error probability, conditioned on b1 = +1, b2 = +1, for the
joint ML rule (an error occurs if either of the bits are wrong). Repeat for b1 = +1, b2 = 1.
Solution:
(a) From Eq.(1), the joint ML decision region is shown in Fig.1. Thus if y = (2.5, 1)T , then b =
(1, 1)T .

Fig. 1.

ML decision regions for Problem 1

Dr. J. Chen, EE 4TM4: Digital Communications II

TUTORIAL #8-2014

(b) From Fig.1, the decision region for b1 = +1, b2 = +1, which corresponds to the signal point (1, 0)T ,
involves all three neighbors. The distances from the neighbors are given by d2 = 4, 8, 20, and the


d
intelligent union bound is given by the sum of Q 2
terms:
 
 
 
1
2
5
+Q
+Q
.
(2)
P (e|(+1, +1)) Q

This union bound is the same as the union bound for b1 = 1, b2 = 1. For b1 = +1, b2 = 1,
the signal point is (3, 2). The ML decision region is determined by two neighbors at distances
given by d2 = 8, 20, and the intelligent union bound is
 
 
2
5
P (e|(+1, 1)) Q
+Q
.

(3)

This union bound is the same as the union bound for b1 = 1, b2 = +1. Thus, from Eqs.(2) and
(3), the overall union bound is
1
Pe = [P (e|(+1, +1)) + P (e|(+1, 1))] Q
2

 
 
 
2
5
1
+ 2Q
+ 2Q
.

(4)

Question 2:
Consider a digitally modulated system using QPSK signaling at bit rate 2/T , and with transmit filter,
channel and receive filter specified as follows:
gTX (t) = I[0,T /2] I[T /2,T ] ;

1
gC (t) = (t) (t T /2);
2

gRX (t) = I[0,T /2]

(5)

Let z[k] denote the receive filter output sample at time kTs + , where Ts is a sampling interval to be
chosen.
(a) Show that ML sequence detection using the samples {z[k]} is possible, given an appropriate choice
of Ts and . Specify the corresponding choice of Ts and .
(b) How many states are needed in the trellis for implementing ML sequence detection using the Viterbi
algorithm?

Solution:
(a) Given a bit rate of 2/T , the symbol rate for QPSK signaling is 2/(T log2 4) = 1/T . The output of
the optimal received filter is given by
Z
zopt [n] = (y pmf )(nT ) =

y(t)p(t nT )dt

(6)

Dr. J. Chen, EE 4TM4: Digital Communications II

TUTORIAL #8-2014

where, from Eq.(5), p(t nT ), the impulse response of the cascade of the transmit and channel
filters, is given by
3
1
p(t nT ) = I[nT,nT +T /2] I[nT +T /2,nT +T ] + I[nT +T,nT +3/2T ] .
2
2

(7)

The receive filter output sample at time kTs + is

Z
z[k] = (y gRX )(kTs + ) =

y(t)gRX (kTs + t)dt.

(8)

Setting = 0 and Ts = T /2, from Eq.(5), we get gRX (kT /2 t) = I[(k1)T /2,kT /2] . We can then
rewrite p(t nT ) in terms of gRX (t). For example, the first term in the expression for p(t nT )
above is given by I[nT,nT +T /2] = gRX ((2n + 1)T /2 t). Thus, from Eq.(7),
3
1
p(t nT ) = gRX ((2n + 1)T /2 t) gRX ((2n + 2)T /2 t) + gRX ((2n + 3)T /2 t)
2
2

(9)

Applying the above result in Eq.(9), we see that zopt [k] can be generated from the samples z[k], in
Eq.(8), as follows:
3
1
zopt [k] = z[2n + 1] z[2n + 2] + z[2n + 3].
(10)
2
2
R
(b) The sampled autocorrelation sequence is given by h[n] = p(t)p(t nT )dt. The finite memory

condition is satisfied with L = 1:

h[n] = 0, |n| > 1.

(11)

The number of required states, given QPSK signaling, is M L = 41 = 4 states.

Dr. J. Chen, EE 4TM4: Digital Communications II