1

EE4140-Digital Communication Systems

Tutorial-1 August 2015
1) Consider the so called Binary Phase Shift Keying (BPSK) signalling system with
si (t) = (1)i p(t)cos(2fc t), {i = 0, 1},
wherep(t) is bandlimited to [W, W ]. Determine the signal constellation using
a) 2W sinc(t n/2W ) as the orthonormal basis set.
b) a minimal basis set.
c) Sketch the constellation for (b).
d) Sketch the transmit waveform for two successive symbols when p(t) = A rect((t T /2)/T )
and the bits are {0, 1}.
2) Consider the so called Binary Frequency Shift Keying (BFSK) signalling system with
si(t) = Ac exp((1)i 2jf t)rect((t T /2)/T ), i = {0, 1}.
1
and sketch the constellation.
a) Determine the minimal orthonormal basis set for f = 4T
k
b) Repeat for f = 4T , k=2,3,...
c) Sketch the locus of the constellation point s1 as f increases from 0. (Hint: Calculate the
projection of s1(t) onto s0(t) with f as a parameter.)

3) Now consider the so called Quadrature (or Quaternary) Phase Shift Keying (QPSK) signalling system
with
si,j (t) = (1)i p(t)cos(2fc t) + (1)j p(t)sin(2fc t), i, j = {0, 1}
a) Determine the signal constellations using a minimal basis set.
b) Label the constellation points with the pair (i, j). What do you notice with regard to the labels
as you traverse the points clockwise (or anti clockwise).
4) Consider the so called M -QAM (Quadrature Amplitude Modulation) 2-D constellation with points
at {(2i 1)d, (2j 1)d} where i, j = 2k + 1, ... 1, 0, 1, .., 2k .
a) Sketch the constellation for k=1 and k=2 and determine M in each case.
b) Assuming that the basis function on each axis is ( 1 )p(t) where Ep is the energy of p(t).
Ep

Write an expression for si,j (t) corresponding to the (i, j)th point.
5) The following four waveforms are used for quaternary signalling in a digital communication system.
s0 (t)=rect(t-0.5)+rect(t-2.5)
s1 (t)=rect(t-0.5)+rect(t-3.5)
s2 (t)=rect(t-1.5)+rect(t-2.5)
s3 (t)=rect(t-1.5)-rect(t-3.5)
a) Determine an orthonormal basis and the corresponding constellation in two ways
i) by using Gram-Schmidt Orthogonalisation starting with s0 (t) and going in sequence, and
ii) by inspection of the waveforms without any computations.
b) Verify that one constellation can be obtained from the other simply by rotation.

c) What is the distance of each point si from the origin? Is it the same in both constellations?
Why? How do the distances of s0 , s1 , s2 and s3 compare in either case?
6)

a) Consider the so called Orthogonal Frequency Division Multiplexing System (OFDM) signalling
system with
N 1
P X(k)ej2fk t , 0 < t < T
x(t) = k=0

0,
otherwise.
1
Specify {fk }N
symmetrically about f =0 such that X(i)ej2fi t is orthogonal to X(j)ej2fj t
0
in [0, T ], i 6= j and for any (complex) constants X(i) and X(j), and such that the minimum
bandwidth is employed by x(t).
b) Show in (a) that the orthogonality is not disturbed if x(t) is defined over < t < T + for
any .
c) Determine an orthogonal (complex) basis set for the OFDM signal. What is the minimum
dimensionality?

7) Consider a complex code c(t) =

NP
1
k=0

cr (k)p(t kTc ) + j

NP
1

ci (k)p(t kTc ), where {cr (k)} and

k=0

{ci (k)} are binary-valued in {1, 1} and p(t) is a pulse of duration Tc . Two codes cp (t) and cq (t)
NRTc
NP
1
X(k)ck (t) where the codes ck (t),
cp (t)cq (t)dt = 0. Let x(t) =
are said to be orthogonal if
0

k=0

k = 0, 1, ...N 1 are orthogonal codes, and X(k) are complex constants. (Assume that N such
codes can be found).
a) Compare the signal constellation obtained with that of the OFDM signal in problem 6.
b) Comparing qualitatively the spectrum of the signal in Problem 6 and 7 if p(t) is a rectangular
pulse.
8)

a) Look up the definition of binary Walsh codes of length M = 2n , n = 1, 2... There are M
codes of length M . Show that the Walsh codes of length M form a M dimensional orthogonal
basis set for a signal constellation.
b) Consider next a Walsh code tree. Here, the codes are arranged in a tree structure, beginning
with the two codes of length 2. All codes of length M with the first M/2 bits identical are
grouped together, and placed below the node of the tree with the first M/2 bits. Each level
of the tree gives the codes for increasing n. Show that any code is orthogonal to codes not
belonging to common mother code at a higher level in the tree (except the root), with the
shorter code repeated to obtain the same length.