M-ary Signaling Techniques Optimum Receiver

M -ary Signaling Techniques
EE456 – Digital Communications

“A First Course in Digital Communications”
by Ha H. Nguyen and E. Shwedyk, Cambridge University Press,
March 2009
Department of Electrical & Computer Engineering

University of Saskatchewan
Saskatoon, SK, Canada, S7N 5A9
ha.nguyen@usask.ca
Fall 2008
EE456 – Digital Communications Ha H. Nguyen

Introduction
There are benefits to be gained when M -ary (M = 4)

signaling methods are used rather than straightforward binary
signaling.
In general, M -ary communication is used when one needs to
design a communication system that is bandwidth efficient.
Unlike QPSK and its variations, the gain in bandwidth is
accomplished at the expense of error performance.
To use M -ary modulation, the bit stream is blocked into
groups of λ bits ⇒ the number of bit patterns is M = 2λ .
The symbol transmission rate is rs = 1/Ts = 1/(λTb ) = rb /λ
symbols/sec ⇒ there is a bandwidth saving of 1/λ compared
to binary modulation.
Shall consider M -ary ASK, PSK, QAM (quadrature amplitude
modulation) and FSK.
Optimum Receiver for M-ary Signaling
mi
si (t ) r (t )
m̂i

w (t )
w(t) is zero-mean white Gaussian noise with power spectral

density of N20 (watts/Hz).
Receiver needs to make the decision on the transmitted signal
based on the received signal r(t) = si (t) + w(t).
The determination of the optimum receiver (with minimum
error) proceeds in a manner analogous to that for the binary
case.

Represent M signals by an orthonormal basis set, {φn (t)}N

n=1 ,
N ≤ M:
si (t) = si1 φ1 (t) + si2 φ2 (t) + · · · + siN φN (t),

Z Ts
sik = si (t)φk (t)dt.
0
Expand the received signal r(t) into the series
r(t) = si (t) + w(t)

= r1 φ1 (t) + r2 φ2 (t) + · · · + rN φN (t) + rN +1 φN +1 (t) + · · ·
For k > N , the coefficients rk can be discarded.

Need to partition the N -dimensional space formed by
~r = (r1 , r2 , . . . , rN ) into M regions so that the message error
probability is minimized.

N − dimensiona l observatio n space

r = (r1 , r2 , , rM )
ℜ1
Choose s1 (t ) or m1
ℜ2
ℜM Choose s2 (t ) or m2
Choose s M (t ) or mM
The optimum receiver is also the minimum-distance receiver:

Choose mi if
PN 2
PN 2
(r
k=1 k − s ik ) < k=1 (rk − sjk ) ;
j = 1, 2, . . . , M ; j 6= i.
M-ary Coherent Amplitude-Shift Keying (M-ASK)

r
2
si (t) = Vi cos(2πfc t), 0 ≤ t ≤ Ts
Ts
r
2
= [(i − 1)∆]φ1 (t), φ1 (t) = cos(2πfc t), 0 ≤ t ≤ Ts ,
Ts
i = 1, 2, . . . , M.
s1 (t ) s2 ( t ) s3 (t ) sk (t ) sM −1 (t ) sM (t )
φ1 (t )
0 ∆ 2∆ (k − 1)∆ (M − 2)∆ (M − 1)∆
t = kTs
si (t ) r (t )
kTs r1 ! m̂i
(• )dt "
( k −1) Ts
w (t ) φ1 (t )
N0
WGN, strength watts/Hz
2
Minimum-Distance Decision Rule for M-ASK

 sk (t), if k − 32 ∆ < r1 < k − 12 ∆, k = 2, 3, . . . , M − 1
Choose s (t), if r1 < ∆ .
 1 2
sM (t), if r1 > M − 32 ∆
f (r1 sk (t ) )
r1
0 ∆ (k − 1)∆
Choose s1 (t ) ⇐ # Choose s (t )
M
Choose sk (t )

Error Performance of M-ASK

f (r1 sk (t ) )
r1
∆ ∆
2 2
M
X
P [error] = P [si (t)]P [error|si (t)].
i=1
p
P [error|si (t)] = 2Q ∆/ 2N0 , i = 2, 3, . . . , M − 1.
p
P [error|si (t)] = Q ∆/ 2N0 , i = 1, M.
2(M − 1) p
P [error] = Q ∆/ 2N0 .
M
Modified M-ASK Constellation

The maximum and average transmitted energies can be reduced, without
any sacrifice in error probability, by changing the signal set to one which
includes the negative version of each signal.
r
∆ 2
si (t) = (2i − 1 − M ) cos(2πfc t), 0 ≤ t ≤ Ts , i = 1, 2, . . . , M.
| {z 2} Ts
Vi
'()
φ1 (t )
3∆ ∆ 0 ∆ 3∆
$ − − $
2 2 2 2
'*)
φ1 (t )
& − 2∆ −∆ 0 ∆ 2∆ %
PM M
∆2 X Ei (M 2 − 1)∆2
Es = i=1
(2i − 1 − M )2 =
= .
M 4M i=1 12
r
Es (M 2 − 1)∆2 (12 log2 M )Eb
Eb = = ⇒ ∆=
log2 M 12 log2 M M2 − 1
Probability of Symbol Error for M-ASK

s s !
!
2(M − 1) 2(M − 1) 6 log2 M Eb
6Es
P [error] = Q Q . =
M M (M 2 − 1)N0
M 2 − 1 N0
s !
1 2(M − 1) 6 log2 M Eb
P [bit error] = P [symbol error] = Q (with Gray mapping)
λ M log2 M M 2 − 1 N0
−1
10
−2
10
M=16
(W=1/4T )
b
−3
10
P[symbol error]
M=8
(W=1/3T )
b
−4
10
M=4
(W=1/2T )
b
−5
10
M=2
(W=1/T )
b
−6
10
−7
10
0 5 10 15 20 25
E /N (dB)
b 0
W is obtained by using the W Ts = 1 rule-of-thumb. Here 1/Tb is the bit rate (bits/s).
Example of 2-ASK (BPSK) and 4-ASK Signals

Baseband information signal
1
−1
0 Tb 2Tb 3Tb 4Tb 5Tb 6Tb 7Tb 8Tb 9Tb 10Tb
BPSK Signalling
−2
0 Tb 2Tb 3Tb 4Tb 5Tb 6Tb 7Tb 8Tb 9Tb 10Tb
4−ASK Signalling
−2
0 2Tb 4Tb 6Tb 8Tb 10Tb

M-ary Phase-Shift Keying (M-PSK)

(i − 1)2π
si (t) = V cos 2πfc t − , 0 ≤ t ≤ Ts ,
M
i = 1, 2, . . . , M ; fc = k/Ts , k integer; Es = V 2 Ts /2 joules

(i − 1)2π (i − 1)2π
si (t) = V cos cos(2πfc t)+V sin sin(2πfc t).
M M
V cos(2πfc t) V sin(2πfc t)
φ1 (t) =√ , φ2 (t) = √ .
Es Es

p (i − 1)2π p (i − 1)2π
si1 = Es cos , si2 = Es sin .
M M
√
The signals lie on a circle of radius Es , and are spaced every
2π/M radians around the circle.

Signal Space Plot of 8-PSK

(i − 1)2π
si (t) = V cos 2πfc t − , 0 ≤ t ≤ Ts ,
M
φ2 (t )
s3 (t ) ↔ 011
010 ↔ s4 (t ) s2 (t ) ↔ 001
Es
110 ↔ s5 (t ) π 4 s1 ( t ) ↔ 000
0 φ1 (t )
111 ↔ s6 (t ) s8 (t ) ↔ 100
s7 (t ) ↔ 101

Signal Space Plot of General M-PSK

(i − 1)2π
si (t) = V cos 2πfc t − , 0 ≤ t ≤ Ts ,
M
φ2 (t )
s 2 (t )
Es
2π M s1 (t )
φ1 (t )
0 − 2π M
s M (t )

Optimum Receiver for M-PSK

t = Ts
,
Ts r1
(•)dt Compute
0
r (t ) (r1 − si1 )2 + (r+

2 − si 2 )
2
m̂i
for i = 1, 2, ,M
φ1 (t ) t = Ts
and choose
-
Ts r2
(• )dt the smallest
0
φ 2 (t )
P [error] = P [error|s1 (t)]
ZZ
r2
Region 2 = 1− f (r1 , r2 |s1 (t))dr1 dr2 .
Choose s2 (t )
r1 ,r2 ∈Region 1
s2 ( t )
Es
π M s1 (t )
r1
0
Region 1
Choose s1 (t )

Lower Bound of P [error] of M-PSK
r2
Region 2
Choose s2 (t )
r2
s2 ( t ) s2 ( t )
ℜ1
Es Es sin (π M )
π M s1 (t ) π M s1 (t )
r1 r1
( )
0 0
Region 1 Es ,0
Choose s1 (t )
P [error|s1 (t)] > P [r1 , r2 fall in ℜ1 |s1 (t)], or

n π p o
P [error|s1 (t)] > Q sin 2Es /N0 .
M

Upper Bound of P [error] of M-PSK

r2
s2 ( t )
ℜ1
Es sin (π M )
r2 s1 (t )
π M
Region 2 r1
Choose s2 (t )
0
( Es ,0 )
s2 ( t )
Es r2
π M s1 (t )
r1
0
Region 1 ( Es ,0 )
r1
Choose s1 (t ) 0 −π M s1 (t )
Es sin (π M )
ℜ2
s M (t )
P [error] < P [r1 , r2 fall in ℜ1 |s1 (t)] + P [r1 , r2 fall in ℜ2 |s1 (t)], or
π p
P [error] < 2Q sin 2Es /N0 ,
M
Symbol Error Probability of M-PSK

−1
10
M=32
−2
10
M=16
−3
10
P[symbol error]
M=8
Exact
−4
10
M=4
−5
10
M=2
−6
10
Lower bound
Upper bound
−7
10
0 5 10 15 20 25
E /N (dB)
b 0
With a Gray mapping, the bitqerror probability is approximated as:

1

π 2Eb
P [bit error]M -PSK ≃ log M Q λ sin2 M N0 . 2
Comparison of BPSK and M-PSK
r !
π 2E
b
P [error]M -PSK ≃ Q λ sin2 , where Es = λEb .
M N0
p
P [error]BPSK = Q( 2Eb /N0 ).
λ M M -ary BW/Binary BW λ sin2 (π/M ) M -ary Energy/Binary Energy

3 8 1/3 0.44 3.6 dB
4 16 1/4 0.15 8.2 dB
5 32 1/5 0.05 13.0 dB
6 64 1/6 0.0144 17.0 dB

M-ary Quadrature Amplitude Modulation (M-QAM)

M -QAM constellations are two-dimensional and they involve
inphase (I) and quadrature (Q) carriers:
r
2
φI (t) = cos(2πfc t), 0 ≤ t ≤ Ts ,
Ts
r
2
φQ (t) = sin(2πfc t), 0 ≤ t ≤ Ts ,
Ts
The ith transmitted M -QAM signal is:
r r
2 2 0 ≤ t ≤ Ts
si (t) = VI,i cos(2πfc t) + VQ,i sin(2πfc t),
Ts Ts i = 1, 2, . . . , M
r
p 2
= Ei cos(2πfc t − θi )
Ts
VI,i and VQ,i are the information-bearing discrete amplitudes of the
2 2
two quadrature carriers, Ei = VI,i + VQ,i and
θi = tan (VQ,i /VI,i ).
−1

(1,3)
(1,7)
(4,4)
M =4
M =8
Rectangle
Rectangle
Triangle

Hexagon
(4,12)
(8,8)
R2
R2
R1
R1
M = 16
Rectangle
Triangle
(1,5,10)
R2
R1
A Simple Comparison of M-QAM Constellations
With the same minimum distance of all the constellations, a more

efficient signal constellation is the one that has smaller average
transmitted energy.
<=>?@AB CDEDF
3456789: 4 ./012 ;
M =8
Es for the rectangular, triangular, (1,7) and (4,4) constellations are

found to be 1.50∆2 , 1.125∆2 , 1.162∆2 and 1.183∆2 , respectively.

Rectangular M-QAM
φQ (t )
M = 64
M = 16 M = 32
M =8
φI (t )
0
M =4
The signal components take value from the set of discrete values
{(2i − 1 − M )∆/2}, i = 1, 2, . . . , M
2 .
Modulation of Rectangular M-QAM

Each group of λ = log2 M bits can be divided into λI inphase bits
and λQ quadrature bits, where λI + λQ = λ.
Inphase bits and quadrature bits modulate the inphase and
quadrature carriers independently.
Inphase bits
Select VI ,i
Infor. bits GHI 2 si (t )

Inphase ASK cos(2πf c t )
JKLMNOL HP HQ Ts XYZ WN[VSL
Quadrature bits
Select VQ,i
2
Quadrature ASK sin( 2πf c t )
Ts
RST UQSVWJ NMMHQ
Demodulation of Rectangular M-QAM

Due to the orthogonality of the inphase and quadrature signals, inphase
and quadrature bits can be independently detected at the receiver.
t = Ts
Ts Inphase
∫ ( • ) dt ASK
0 decision
r (t ) = si (t ) + w (t ) Decision
2
φI ( t ) = cos(2π f c t ) Multiplexer
Ts
t = Ts
Ts Quadrature
∫ ( •) dt ASK
0 decision
2
φQ (t ) = sin(2π f ct )
Ts (b) Receiver
The most practical rectangular QAM constellation is one which

λI = λQ = λ/2, i.e., M is a perfect square and the rectangle is a square.
Symbol Error Probability of M-QAM

For square constellations:
2
P [error] = 1 − P [correct] = 1 − 1 − P√M [error] ,
s !
√
1 3Es
P M [error] = 2 1 − √ Q ,
M (M − 1)N0
where Es /N0 is the average SNR per symbol.
For general rectangular constellations:
" s !#2
3Es
P [error] ≤ 1 − 1 − 2Q
(M − 1)N0
s !
3λEb
≤ 4Q
(M − 1)N0
where Eb /N0 is the average SNR per bit.

−1
10
M=256
−2
10
M=64
−3
10
P[symbol error]
M=16
−4
10
M=4
−5
10
M=2
−6
10
Exact performance
Upper bound
−7
10
0 5 10 15 20 25
Eb/N0 (dB)

Performance Comparison of M-PSK and M-QAM

q
2Es π
For M -PSK, approximate P [error] ≈ Q sin M .
q N0
3λEb
For M -QAM, use the upper bound 4Q (M −1)N0 .
Comparing the arguments of Q(·) for the two modulations
gives:
3/(M − 1)
κM = .
2 sin2 (π/M )
M 10 log10 κM
8 1.65 dB
16 4.20 dB
32 7.02 dB
64 9.95 dB
256 15.92 dB
1024 21.93 dB
Performance Comparison of M-ASK, M-PSK, M-QAM

−1
10
−2
10
P[symbol error]
−3
10
4−QAM or QPSK
−4
10
M=4, 8, 16, 32
−5
10
M−ASK
M−PSK
−6
M−QAM
10
0 5 10 15 20
Eb/N0 (dB)
M-ary Coherent Frequency-Shift Keying (M-FSK)

V cos(2πfi t), 0 ≤ t ≤ Ts
si (t) = , i = 1, 2, . . . , M,
0, elsewhere
where fi are chosen to have orthogonal signals over [0, Ts ].

 (k ± i) 1 , (coherently orthogonal)
fi = 2Ts , i = 0, 1, 2, . . .
 (k ± i) 1 , (noncoherently orthogonal)
Ts
φ 2 (t )
s 2 (t )
Es
Es s1 (t )
0
φ1 (t )
s3 ( t ) Es
φ 3 (t )
Minimum-Distance Receiver of M-FSK

Choose mi if
M M
X
2
X Choose mi if
(rk − sik ) < (rk − sjk )2 ⇒
ri > rj , j = 1, 2, . . . , M ; j 6= i.
k=1 k=1
j = 1, 2, . . . , M ; j 6= i,
t = Ts
f
Ts r1
(• )dt
0
\]^^_`
r (t ) h h a]` Decision
s (t )
φ1 (t ) = 1 bcde` _a
Es
t = Ts
g
Ts rM
(•)dt
0
s M (t )
φM ( t ) =
Es
Symbol Error Probability of M-FSK

P [error] = P [error|s1 (t)] = 1 − P [correct|s1 (t)].
P [correct|s1 (t)] = P [(r2 < r1 ) and · · · and (rM < r1 )|s1 (t) sent].
Z ∞
= P [(r2 < r1 ) and · · · and (rM < r1 )|{r1 = r1 , s1 (t)}]f (r1 |s1 (t))dr.
r1 =−∞
M
Y
P [(r2 < r1 ) and · · · and(rM < r1 )|{r1 = r1 , s1 (t)}] = P [(rj < r1 )|{r1 = r1 , s1 (t)}]
j=2
Z r1
1 λ2
P [rj < r1 |{r1 = r1 , s1 (t)}] = √ exp − dλ.
−∞ πN0 N0
Z Z r1 M−1
∞
1 λ2
P [correct] = √ exp − dλ ×
r1 =−∞ λ=−∞ πN0 N0
√
1 (r1 − Es )2
√ exp − dr1 .
πN0 N0

−1
10
−2
10
M=64
−3
10
P[symbol error]
M=2
M=32 M=4
−4
10
M=16
−5
10
M=8
−6
10
−7
10
−2 0 2 4 6 8 10 12 14 16
Eb/N0 (dB) 
Z " Z M −1 # s !2 
1 ∞ 1 y 1 2 log2 M Eb
−x2 /2
P [error] = √ 1− √ e dx exp  − y−  dy.
2π −∞ 2π −∞ 2 N0

Bit Error Probability of M-FSK

Due to the symmetry of M -FSK constellation, all mappings
from sequences of λ bits to signal points yield the same bit
error probability.
For equally likely signals, all the conditional error events are
equiprobable and occur with probability
Pr[symbol error]/(M − 1) = Pr[symbol error]/(2λ − 1).
λ
There are k ways in which k bits out of λ may be in error
⇒ The average number of bit errors per λ-bit symbol is
λ
X λ Pr[symbol error] 2λ−1
k = λ Pr[symbol error].
k 2λ − 1 2λ − 1
k=1
The probability of bit error is simply the above quantity
divided by λ:
2λ−1
Pr[bit error] = Pr[symbol error].
2λ − 1
Union Bound on the Symbol Error Probability of M-FSK
P [error] = P [(r1 < r2 ) or (r1 < r3 ) or, · · · , or (r1 < rM )|s1 (t)].
Since the events are not mutually exclusive, the error

probability is bounded by:
P [error] < P [(r1 < r2 )|s1 (t)]+

P [(r1 < r3 )|s1 (t)] + · · · + P [(r1 < rM )|s1 (t)].
p
But P [(r1 < rj )|s1 (t)] = Q Es /N0 , j = 3, 4, . . . , M .
Then
p p
P [error] < (M −1)Q Es /N0 < M Q Es /N0 < M e−Es /(2N0 ) .
n 2o
where the bound Q(x) < exp − x2 has been used.

An Upper Bound on Q(x)

Z ∞ 2 2
1 λ x
Q(x) = √ exp − dλ < exp −
x 2π 2 2
0
10
2
Q(x) and its simple upper bound
exp(−x /2)
−5
10
Q(x)
−10
10
−15
10
0 1 2 3 4 5 6 7 8
x
Interpretations of P [error] < Me−Es /(2N0 )

1 Let M = 2λ = eλ ln 2 and Es = λEb . Then
P [error] < eλ ln 2 e−λEb /(2N0 ) = e−λ(Eb /N0 −2 ln 2)/2 .
As λ → ∞, or equivalently, as M → ∞, the probability of

error approaches zero exponentially, provided that
Eb
> 2 ln 2 = 1.39 = 1.42 dB.
N0
2 Since Es = λEb = V 2 Ts /2, then
2 T /(4N ) 2 /(4N
P [error] < eλ ln 2 e−V s 0
= e−Ts [−rb ln 2+V 0 )]
2
If −rb ln 2 + V 2 /(4N0 ) > 0, or rb < 4NV0 ln 2 the probability or
error tends to zero as Ts or M becomes larger and larger.

Comparison of M-ary Signaling Techniques

A compact and meaningful comparison is based on the bit rate-to
bandwidth ratio, rb /W (bandwidth efficiency) versus the SNR per
bit, Eb /N0 (power efficiency) required to achieve a given P [error].
M -ASK with single-sideband (SSB) transmission, W = 1/(2Ts ) and
r
b
= 2 log2 M (bits/s/Hz).
W SSB-ASK
M -PSK (M > 2) must have double sidebands, W = 1/Ts and
r
b
= log2 M, (bits/s/Hz),
W PSK
(Rectangular) QAM has twice the rate of ASK, but must have
double sidebands ⇒ QAM and SSB-ASK have the same bandwidth
efficiency.
For M -FSK with the minimum frequency separation of 1/(2Ts ),
M M M
W = 2T = 2(λ/r b)
= 2 log rb , and
s 2M
r 2 log2 M
b
= .
W FSK M
USSB Transmission of BPSK Signal
cos(2π f ct )
m(t ) + sUSSB (t )
+
LTI Filter
h (t ) ←→ H( f ) mˆ (t )
H ( f ) = j sgn( f )
sin(2π f ct )
Z
1 1 ∞ m(t − λ)
m̂(t) = m(t) ∗ h(t) = m(t) ∗ − =− dλ
πt π −∞ λ

Example of USSB-BPSK Transmitted Signal

(a) BPSK signal
−V
0 Tb 2Tb 3Tb 4Tb 5Tb 6Tb
t
(b) USSB−BPSK signal
−V
0 Tb 2Tb 3Tb 4Tb 5Tb 6Tb 7Tb 8Tb

t
Power-Bandwidth Plane (At P [error] = 10−5)

10
M=64
5 M=16 M=64
M=32
3 M=16
M=4 M=8
2
r /W (bits/s/Hz)
Bandwidth−limited
M=2 region: r /W>1
b
1
M=8
Power−limited
b
0.5 M=16 region: r /W<1

b
0.3 M=32
0.2 M=64 PSK

QAM and ASK (SSB)
FSK
0.1
−10 −5 −1.6 0 5 10 15 20 25 30
SNR per bit, Eb/N0 (dB)

Two Statements
Consider information transmission over an additive white Gaussian

noise (AWGN) channel. The average transmitted signal power is
Pav , the noise power spectral density is N0 /2 and the bandwidth is
W . Two statements are:
1 For each transmission rate rb , there is a corresponding limit
on the probability of bit error one can achieve.
2 For some appropriate signalling rate rb , there is no limit on
the probability of bit error one can achieve, i.e., one can
achieve error-free transmission.
Which statement sounds reasonable to you?

Shannon’s Channel Capacity

Pav
C = W log2 1 + ,
W N0
where W is bandwidth in Hz, Pav is the average power and N0 /2
is the two-sided power spectral density of the noise.
Shannon proved that it is theoretically possible to transmit
information at any rate rb , where rb ≤ C, with an arbitrarily
small error probability by using a sufficiently complicated
modulation scheme. For rb > C, it is not possible to achieve
an arbitrarily small error probability.
Shannon’s work showed that the values of Pav , N0 and W set
a limit on transmission rate, not on error probability!
The normalized channel capacity C/W (bits/s/Hz) is:

C Pav C Eb
= log2 1 + = log2 1 + .
W W N0 W N0
Eb 2C/W −1
Shannon’s Capacity Curve N0 = C/W
10
Channel capacity
limit, C/W M=64
5 M=16 M=64
M=32
3 M=16
M=4 M=8
2
r /W (bits/s/Hz)
Shannon limit Bandwidth−limited

M=2 region: r /W>1
b
1
M=8
Power−limited
b
0.5 M=16 region: rb/W<1

0.3 M=32
0.2 M=64 PSK

QAM and ASK (SSB)
FSK
0.1
−10 −5 −1.6 0 5 10 15 20 25 30
SNR per bit, E /N (dB)
b 0

Spectrum Efficiency of DVB-S2 Standard
4. 5 Example 2: 80 Mbit/s in 36MHz at 9.5dB with 8PSK

Spectrum Efficiency
3. 5
2. 5
1. 5
Example 1: 50Mbit/s in 36MHz at 4dB with QPSK

0. 5
0
-4 -2 0 2 4 6 8 10 12 14 16
SNR (dB)
More information: www.dvb.org

M-ary Signaling Techniques Optimum Receiver

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

M-ary Signaling Techniques Optimum Receiver

Caricato da

Copyright:

Formati disponibili

M -ary Signaling Techniques

EE456 – Digital Communications

Department of Electrical & Computer Engineering

EE456 – Digital Communications Ha H. Nguyen

There are benefits to be gained when M -ary (M = 4)

Optimum Receiver for M-ary Signaling

w(t) is zero-mean white Gaussian noise with power spectral

EE456 – Digital Communications Ha H. Nguyen

Represent M signals by an orthonormal basis set, {φn (t)}N

si (t) = si1 φ1 (t) + si2 φ2 (t) + · · · + siN φN (t),

Expand the received signal r(t) into the series

r(t) = si (t) + w(t)

For k > N , the coefficients rk can be discarded.

EE456 – Digital Communications Ha H. Nguyen

N − dimensiona l observatio n space

The optimum receiver is also the minimum-distance receiver:

M-ary Coherent Amplitude-Shift Keying (M-ASK)

Minimum-Distance Decision Rule for M-ASK

EE456 – Digital Communications Ha H. Nguyen

Error Performance of M-ASK

Modified M-ASK Constellation

Probability of Symbol Error for M-ASK

Example of 2-ASK (BPSK) and 4-ASK Signals

EE456 – Digital Communications Ha H. Nguyen

M-ary Phase-Shift Keying (M-PSK)

EE456 – Digital Communications Ha H. Nguyen

Signal Space Plot of 8-PSK

EE456 – Digital Communications Ha H. Nguyen

Signal Space Plot of General M-PSK

EE456 – Digital Communications Ha H. Nguyen

Optimum Receiver for M-PSK

r (t ) (r1 − si1 )2 + (r+

EE456 – Digital Communications Ha H. Nguyen

Lower Bound of P [error] of M-PSK

P [error|s1 (t)] > P [r1 , r2 fall in ℜ1 |s1 (t)], or

EE456 – Digital Communications Ha H. Nguyen

Upper Bound of P [error] of M-PSK

Symbol Error Probability of M-PSK

With a Gray mapping, the bitqerror probability is approximated as:

Comparison of BPSK and M-PSK

λ M M -ary BW/Binary BW λ sin2 (π/M ) M -ary Energy/Binary Energy

EE456 – Digital Communications Ha H. Nguyen

M-ary Quadrature Amplitude Modulation (M-QAM)

EE456 – Digital Communications Ha H. Nguyen

EE456 – Digital Communications Ha H. Nguyen

A Simple Comparison of M-QAM Constellations

With the same minimum distance of all the constellations, a more

Es for the rectangular, triangular, (1,7) and (4,4) constellations are

EE456 – Digital Communications Ha H. Nguyen

Modulation of Rectangular M-QAM

Infor. bits GHI 2 si (t )

Demodulation of Rectangular M-QAM

The most practical rectangular QAM constellation is one which

Symbol Error Probability of M-QAM

where Eb /N0 is the average SNR per bit.

EE456 – Digital Communications Ha H. Nguyen

Performance Comparison of M-PSK and M-QAM

Performance Comparison of M-ASK, M-PSK, M-QAM

M-ary Coherent Frequency-Shift Keying (M-FSK)

Minimum-Distance Receiver of M-FSK

Symbol Error Probability of M-FSK

EE456 – Digital Communications Ha H. Nguyen

With a Gray mapping, the bitqerror probability is approximated as: