I Tutorial Sheet 2018 – 19

DIGITAL COMMUNICATION (EL-342)

1. Let u and v are orthogonal vectors. If u-v  u+v, show that |u|=|v|.
2. Apply the optimum receiver algorithm to the case P[r0|m0]=0.9, P[r1|m0]=0.1, P[r0|m1]=0.4 and P[r1|m1]=0.6
(a) If P[m0]=0.7 and P[m1]=0.3.
(b) If P[m0]=0.9 and P[m1]=0.1.
(c) Calculate the values of error probabilities for (a) and (b).
3. A binary communication system transmits signal si(t), i=1, 2. The receiver test statistics z(T)=ai+n, where the
signal component ai is either +1 or -1 (if i=1 and2 respectively) and noise component n is uniform, yielding
the conditional pdf given by
0.5 for - .2  z  1.8 0.5 for - 1.8  z  0.2
p( z | s1 )   and p ( z | s2 )   .
 0 otherwise  0 otherwise
Find the probability of bit error, Pb, for the case of equally likely signaling and the use of optimum decision
threshold.
4. A five signal constellation in a 2-dimensional space is shown in Fig – 1.
a. Choose appropriate ϕ1(t) and ϕ2(t) and sketch the waveforms of the signals.
b. In signal space, sketch optimum decision regions, assuming AWGN channel.
c. Determine the error probability Pe as a function of average signal energy E of the optimum
receiver.

Fig – 1
5. The basis functions of a three-dimensional signal space are given by
1(t )  p(t ), 2 (t )  p(t  T ) and 3 (t )  p(t  2T ), where p(t )  2
T
sin Tt [u(t )  u(t  T )]
a. Sketch the waveforms of the signals represented by (1, 1, 1), (-2, 0, 1) and (-0.5, -1, 2) in
this space.
b. Find the energy of each signal in part a.
1 𝜋 2𝜋
6. For the three basis signals 𝜙1 (𝑡) = , 𝜙2 (𝑡) = √2/𝑇 cos ( ) , 𝜙3 (𝑡) = √2/𝑇 cos ( ) 0 ≤ 𝑡 ≤ 𝑇, of a
√𝑇 𝑇 𝑇
three dimensional signal space repeat Q 4.
7. Consider a signal detector with an input 𝑟 = ±𝐴 + 𝑛 where A and –A occur with equal probability and n is
1
described by its pdf as 𝑓(𝑛) = 𝑒 −|𝑛|√2/𝜎 .
√(2𝜎)
(a) Determine the probability of error as a function of A and .
(b) Determine the SNR required to achieve an error probability of 10 -5. How does the SNR compare
with the result of Gaussian pdf?
8. The discrete sequence rk  E ck  nk , k  1,2,, n represents the output sequence from a demodulator,
where ck=±1 are elements of one of two possible codewords, c1=[1 1 …. 1] and c2=[1 1 …. 1 -1 -1 ….. -1].
The codeword c2 has w elements which are +1 and n-w elements which are -1, where w is some positive
integer. The noise sequence {nk} is white Gaussian with variance σ2.
a. What is the optimum ML detector for the two possible transmitted signals?
b. Determine the probability of error as a function of the parameters (σ2, Eb, w), where Eb denotes the
bit energy.
 c. What is the value of w that minimizes the error probability.
9. Consider the signal set consisting of M=4 signals shown in Fig – 2. Apply the Gram-Schmidt procedure to
obtain the set of basis functions that span the set of signals and plot the signal constellation diagram.

Fig – 2

10. Draw the optimum decision boundaries of the following signal space diagrams. Assume that the minimum
distance between adjacent points is 2A.

11. In the demodulation of a binary PSK signal received in white Gaussian noise, a PLL is used to estimate the
carrier phase ϕ.
a. Determine the effect of a phase error   ˆ on the probability of error.
b. What is the loss in SNR if the phase error   ˆ  45 0.