EE462: Advanced Digital

Communications
Week # 07

1
 Contents

• Bandpass modulation and Demodulation

• ASK, FSK, PSK

• Coherent Detection

The contents of this material are based on

• Chapter 4, Sklar, B., 2001. Digital communications (Vol. 2, p. 1011). Upper Saddle
River, NJ, USA:: Prentice hall.

2
 Bandpass Modulation and Demodulation
Introduction

• In baseband, the signal is transmitted as pulses and there is no carrier.

• In case of bandpass modulation, the pulses modulate a sinusoid, ‘carrier’
which is converted, for radio transmission, to an electromagnetic (EM) field
to propagate it to the desired destination.
• Why do we need a carrier for radio transmission?
• Antenna Size
• Frequency Division Multiplexing.
• Better SNR tradeoff

3
 Digital The general form of the carrier wave, s(t), is

Modulation s(t) = A(t)cos(t), where(t) = 0t + (t).

Techniques
The process of
transforming digital The basic modulation/demodulation types are listed below
symbols into a Coherent Noncoherent
waveforms that are
• PSK, • DPSK
compatible with the • FSK
• FSK
characteristics of • ASK
• ASK
channel is called • Continuous Phase
• Continuous Phase
digital modulation. Modulation (CPM) Hybrids
Modulation (CPM) Hybrids

4
 Digital If the carrier phase is known at the receiver, we
call the process coherent detection
Modulation (demodulation). This when we use the carrier
phase to detect the signal.
Techniques
On the other hand, when the phase is not used,
the detection is noncoherent.
Note:
Demodulation means waveform recovery, and
Detection means symbol decision.
But, in digital communication, they are often
used interchangeably.
5
 Simple ASK is one of the earliest form of digital modulation used in radio
Amplitude telegraphy at the beginning of 19th century.
It is called on-off keying.

Shift Keying si (t) = 2Ei (t) cos( t + ), 0  t T,i =1,2,...,M.

T
(ASK)
The amplitude have M discrete values.
2Ei /T
The phase  is an arbitrary constant.

For binary, i.e., M=2, 2Ei /T = 2E /T or zero

Now, let us look to the above equation as amplitude A and we want to see how to relate A to E .

A
2
= r.m.sEi = A2
2
T energy/bit .

6
 Similar to the FM in analog communication.
Frequency In this technique, the frequency is shifted from frequency fm to
Shift Keying space of frequency fs, i.e.,

(FSK)  Acos(2f mt + ), for '1'

s(t) = 
 Acos(2f st + ), for '0'
T
Or it can be put in the
following form si (t) = Acos(0t + k f  Ii dt +), where Ii =1or 0.
0
In a compact form, si(t)
can be rewritten as si (t) = 2E
T
cos(it + ), 0  t  T,i =1,2,...,M.

7
 Phase si (t) = Acos( 0 t + k p I i ), where k p is in radian.
Shift Keying = A cos( 0 t + i (t )), where  i (t ) = 2i
, i = 1,..., M
(PSK) M

For binary case, it is called BPSK, and si(t) for i=0,1 is written as:

si (t ) = A cos(0t + i), 0  t  T .
= 2E /T cos(0t + i).
The phase is shifted by 180 from 1 to 0 (Antipodal).
For M = 4, the modulation is called Quadriphase shift keying (QPSK) and the
phase shift between the successive bits is 90o . This type of modulation is widely
used in satellite communication.
For M, it is called MPSK. 8
 Coherent Recall that the receive signal is

r(t) = si(t) + n(t),

Detection of ASK
(Binary case) si (t) = 2Ei (t)
T
cos(0t + ), 0  t  T.
Using the matched filter or correlator, E + no (t), for '1'
the out put z(t) at t = T is: z(T) = 
 no (t), for '0'
Where n (t) is AWGN with zero mean and
0
 = N E / 2.
2
0 0
The bit error rate BER is

PB = Q( 2E0 ) = Q( E
2N 0
).
9
 Coherent Recall that the receive signal is

r(t) = si(t) + n(t),

Detection of
 E + no (t), for '1'
Binary PSK z(T) = 
− E + no (t), for '0'

The probability error rate is PB = Q( E0 ) = Q( 2E

N0
).

Therefore, for fixed power (or energy), the BER for PSK is more than
that for ASK.
Again, for this scheme, we need one matched filter (or correlator) to
detect the incoming signal.
10
 Another interpretation of the goodness of different
schemes is the minimum distance.
Minimum
The distance between the signals si(t) and sj(t) is
Distance defined as
T T T

d i 2j =  i
( s (t ) − s j ( t )) 2
dt =  s i (t ) 2 d t +  s j (t ) 2 dt
0 0 0
T

− 2  si ( t ) s j ( t ) d t = E i + E j − 2 Ei E j ij ,
0
T
1
where ij =
EiE j
s i (t ) s j (t ) d t .
0

The last equation equal zero when si(t) and sj(t) are orthogonal.
11
 Let Ei = Ej = E, and

Minimum 1 (t) = 2
T
cos1t, 0  t  T,
Distance 2 (t) = 2
T
cos2t, 0  t  T.
2 Notice that the above two basis are orthonormal for proper
E choice of 1 and 2 . Therefore

1
s1 (t) = E 1 (t)and s2 (t) = E 2 (t)
E
The above equation represents binary FSK.

d ij2
BER = Q( 2N 0
) = Q( E
N0
).
12
 For ASK, let 1(t) is defined as

Minimum 1 (t) = 2
T
cos 0t, 0  t  T.
Distance s1 (t) = E 1 (t) and s2 (t) = 0.
E
s2 = 0 s1 1

d ij2
BER = Q( 2N 0
) = Q( E
2N 0
).

Notice that short minimum distance means difficult to distinguish between

signals. On the other hand, large distance makes the distinguishing easier.
13
 For BPSK (antipodal),

Minimum
Distance
E E
s2 s1 1

1 (t) = 2
T
cos 0t, 0  t  T.
 s1 (t) = E 1 (t) and s2 (t) = − E 1 (t)and
BER =Q( 2E
N0
).
14
 Coherent Let’s assume that the waveform si(t) of the M-ary be:

Detection for
MPSK si (t) = 2E/T cos(0t −2i/ M), 0  t T.
Where E is the energy of si(t) over each symbol duration T.
Assume that 1(t) and 2(t) be orthonormal basis of the form

1 (t) = 2
T
cos 0t, 0  t  T,
2 (t) = 2
T
sin 0t, 0  t  T

Now, si(t) can be represented as a linear combination of 1(t) and

2(t), i.e., 15
Coherent si (t) = ai11 (t) + ai 2  2 (t), i = 1,2,...., M , where
T T
Detection ai1 =  si (t)1 (t) dt =
2
E  cos( 0 t −  i ) cos( 0 t) dt
T
for MPSK 0 0

2i
= E cos(i ), where  i = .
M
Similarly,

T T
2
ai 2 =  si (t)2 (t) dt = E  cos( 0 t −  i ) sin(  0 t) dt
0
T 0

2i
= E sin(  i ), where  i = .
M
16
 si (t) = E cos(i )1 (t) + E sin( i )2 (t), i = 1,2,....,M .

For M =4, i.e., QPSK, we have 2i

i = ,i = 1, 2,3, 4.
4
S1=√E 2(t), S2= -√E 1(t)
2
S3= -√E 2(t) & S4= √E 1(t). s1

s2 s4
1
This figure is called
signal space diagram
or signal constellation
of QPSK
s3 17
Notice that the choice of angle i is an arbitrary. The only restriction is that the phase shift between
the successive symbols is 2 /M. For example, if we choose the angle i to be 2 (i - 1)/M, then the
locations of si’s in the signal constellation is different. Moreover, the symbol si is two bits symbol. So,
if we arrange the bits in a way that if there is an error in the decision, then there is one bit error.
This is called GRAY ENCODING.

For the signal constellation diagram, s1 is represented by 01; s2 is represented by 11; s3 is

represented by 10 and s4 is represented by 00.

In MATLAB, to find the order of gray code,

gray_encode=bitxor([0:M-1], floor([0:M-1]/2));
For example, for M= 4, the order is 0, 1, 3, 2 =(00, 01,
11, 10). The order is counter clockwise.
Similarly, for M = 8, gray_encode = 0, 1, 3, 2, 6, 7, 5, 4.

18
 Coherent For M = 8, the signal constellation is shown below.
Detection for Let us assume that i is 2(i - 1)/M,
then the locations of si’s in the signal constellation
MPSK is distributed as shown.
The gray encoding is distributed as follows:
s4 s2 s1 = 000; s2 = 001; s3 = 011; s4 = 010; s5 = 110;
E
s6 = 111; s7 = 101 and s8 = 100.

s5 s1
The minimum distance between two adjacent
signals is defined as:
s6 s8
s7
19
 Coherent
Detection for
MPSK

The detection of MPSK takes the following steps:

Notice if r(t) is free of noise, then

20
 Coherent Which means that X is the projection on 1(t) and Y is the projection
on 2(t). Notice here, we need only two correlators to detect M
Detection for symbols. So the demodulator computes for each of the

MPSK and chooses the one the gives the smallest difference.

See Example 4.2 in your book to see how critical is the phase for coherent detection.
What will be the price paid if noncoherent detection is used? The answer to this question will be
addressed in the noncoherent detection.

21