Electrical Engineering

Electronics and Communications

Forth Year

Electric Communication Systems (3)

ELC 411

M-ary Modulations

Dr. Saad Elsayed

 Lecture One Review
Basic Digital Modulation Overview (ASK, FSK, and

PSK )

A Brief History of Digital Communications

 Modulation Trade-Off

Gray Code Overview.

2
 Multi-level (M-ary) Digital Modulations

M = 2n
Symbol rate
Bandwidth
Efficiency
 M-ary Digital Modulations
M=2

Pe
e
Calculating BER
Coherent M -ary PSK

i=1, 2, 3,…., M
 Probability of Error of MPSK
d2 d2
p e/m = 2 Q
1 = erfc
2No 4No

d2
pe / m = 2Q
1
2No

For M>2
PSD of MPSK
PSD of MPSK
Bandwidth of MPSK
QPSK (4-ary PSK)
QPSK
QPSK Modulator/Demodulator
QPSK Modulator/Demodulator (another
form)
even bits

Odd bits
Timing diagram for QPSK
 Probability of Error of QPSK
E π
• Since symbol error probability is pe = erfc sin
No M

E E
• Then for M=4 pe = erfc = 2Q
2No No

• Since there are two bits per symbol, the transmitted signal
energy per symbol is twice the signal energy per bit: E = 2Eb
Then the symbol error probability in terms of Eb is given
by:

Eb 2 Eb erfc( y) = 2Q( y 2 )
pe = erfc = 2Q
No No
 Bit Error Rate of QPSK
• Then:
Pe Pe 1 Eb
BER = = = erfc
n 2 2 No
2Eb
=Q
No

Which is the same as coherent BPSK. Note that the QPSK

scheme uses half the bandwidth of the BPSK. This explains
why the QPSK scheme is preferred over BPSK in many
applications.
M -ary FSK
• Since the individual signal frequencies are separated by 1/2T Hz,
the M-ary FSK signals are orthogonal:
T
si (t ) s j (t ) dt = 0, i ≠ j
0
Accordingly, MFSK is described by M-dimensional signal space
diagram

Ex: M=2 &3

 Detection of MFSK
• For coherent MFSK,
the optimum receiver
consists of a bank of
φ1 (t )
M correlators or
matched filters with iφ(t ) .

• The receiver makes φ2 (t )

decisions based on
the largest MF output
According to ML rule.

φM (t )
 Probability of error of MFSK
The BER of coherent orthogonal MFSK is
difficult to obtain in closed form. Numerical
integrations are used to obtain it and the
results are shown in the Fig.
Power spectra of MFSK signals
 Bandwidth of MFSK
• The channel bandwidth required to transmit MFSK is:

M
B=
2T
1
Since T = Tb log 2 M and Rb = , then
Tb

B = Rb M
2 log 2 M

The Bandwidth efficiency of MFSK is therefore

ρ = Rb = 2 log 2 M
B M
 Bandwidth Efficiency of MFSK
• The following Table shows the values of ρ for different
values of M:

M 4 8 16 32 64
ρ
[bits/Hz] 1 0.75 0.5 0.3125 0.1875

• From this Table we see that increasing the number of

levels M tends to decrease the bandwidth efficiency of
MFSK. This is in contrast to MPSK. We say that
MPSK is spectrally efficient whereas MFSK signals
are spectrally inefficient.
 M -ary ASK

ai = (2 (i + 1) − M ); i = 1, 2,..., M
 Example: 4-ary ASK (M=4)

0 6
2 4

ai = (2 (i + 1) − 4); i = 1, 2,..., 4
a1 = 0, a2 = 2, a3 = 4, a4 = 6
• Generally: The probability of making an error when sending
one of these outer constellation points is the probability of
the noiseEexceeds
0
in one direction only. For the inner
constellation points there is two directions. The probability of
error is the probability of the noise 0exceeds
E in either
direction.
 Symbol Error Probability of MASK

• Then the symbol error probability is given by:

2(M − 1) 6E s
Pe = Q
M (M 2 − 1) N o
Performance of MASK