Slides Receiver

Wireless Communications Group
Optimum Receiver for AWGN channel
Francois Horlin
1
Outline
Introduction
Signal demodulation
Symbol detection
Pulse-amplitude modulation (PAM) performance
Quadrature-amplitude modulation (QAM) performance
Frequency-shift keying (FSK) performance
Phase-shift keying (PSK) performance
Non-coherent receiver
Exercise
2
References
Digital Communications, Fourth Edition, J. G. Proakis
3
Outline
Introduction
Signal demodulation
Symbol detection
Exercise
4
Introduction
The transmitter sends information by the use of M waveforms sm (t)

The channel corrupts the waveform by the addition of white Gaussian
noise n(t) (power spectral density equal to n (f ) = N0 /2 [W/Hz]):
r(t) = sm (t) + n(t)
The optimum receiver is designed to minimize the probability of

making an error
5
Outline
Introduction
Signal demodulation
Symbol detection
Exercise
6
Outline: Signal demodulation
Correlation demodulator
Matched filter
7
The received signal is passed

through a bank of K correlators,
that compute the projection of
r(t) onto the orthonormal basis
functions fk (t) (n = 1, , K)
The basis functions fk (t) span

entirely the signal space
8
At the output of the correlator with fk (t):

Z
rk := r(t)fk (t)dt
t=
Z Z
= sm (t)fk (t)dt + n(t)fk (t)dt
t= t=
:= smk + nk
The variables rk are Gaussian of mean smk and variance N0 /2 (see

next slide)
9
Gaussian noise variables nk
Mean of nk : Z
E [nk ] = E [n(t)] fk (t)dt = 0
t=
Covariance of nk :
Z Z
E [nk nl ] = E [n(t)n(t )] fk (t)fl (t )dtdt
t= t =
Z Z
N0
= (t t )fk (t)fl (t )dtdt
t= t = 2
Z
N0
= fk (t)fl (t)dt
2 t=
N0
= kl
2
10
Vector model
By gathering the correlator outputs:
r = sm + n
with:
h iT
sm := sm1 smK
h iT
r := r1 rK
h iT
n := n1 nK
11
Conditional probability
K
Y
p(r|sm ) = p(rk |smk )
k=1
K
Y 1 1
= p exp (rk smk )2
(N0 ) N0
k=1
K
" #
1 1 X
= p exp (rk smk )2
(N0 )K N0
k=1
which is obtained because the variables rk are independent
12
Remaining noise
Because the functions fk (t) span entirely the signal space but not the
noise space, there is a remaining noise process n (t):
K
X K
X
r(t) = smk fk (t) + nk fk (t) + n (t)
k=1 k=1
K
X
= rk fk (t) + n (t)
k=1
where:
K
X
n (t) := n(t) nk fk (t)
k=1
13
Remaining noise
E [n (t)rk ] = E [n (t)] smk + E [n (t)nk ]

= E [n (t)nk ]
K
" ! #
X
= E n(t) nl fl (t) nk
l=1
Z K
X
= E [n(t)n(t )] fk (t )dt E [nl nk ] fl (t)
t = l=1
N0 N0
= fk (t) fk (t) = 0
2 2
14
Sufficient statistics
The random variables n (t) and rk are independent (Gaussian and

uncorrelated)
Therefore the remaining noise n (t) does not contain any relevant
information and the correlator outputs rk contain all the available
information for the symbol detection
In this sense, the correlator outputs rk are called sufficient statistics
15
Concept of matched filter
The matched filter h(t) to the signal s(t) is defined as h(t) := s(t)
The response of the filter h(t) to the signal s(t) is the auto-correlation
of the signal s(t):
Z +
y(t) = s( )h(t )d
=
Z +
= s( )s( t)d
=
The auto-correlation function is even and peaks at t = 0
16
Matched filter demodulator
Instead of using a bank of K correlators to generate the variables rk ,

we can equivalently use a bank of K filters matched to the basis
functions hk (t) := fk (t) and sample the outputs at t = 0:
Z
yk (t = 0) = r( )hk (t )d
= |t=0
Z
= r( )fk ( t)d
= |t=0
Z
= r( )fk ( )d = rk
=
17
Matched filter demodulator
18
Maximization of the SNR
If a signal s(t) is corrupted by AWGN, the filter with an impulse

response matched to s(t) maximizes the signal-to-noise ratio (SNR)
The SNR at the output of the matched filter is equal to:
2E
SNR =
N0
where:
E is the energy of the signal
N0 is the noise one sided power spectral density
Demonstration in the next slides
19
Maximization of the SNR (demonstration)
The received signal is the initial signal s(t) corrupted by AWGN n(t):
r(t) = s(t) + n(t)
The signal r(t) is convolved with a filter h(t) and sampled at t = 0:

Z
y(t = 0) = r( )h(t )d
= t=0
Z Z
= s( )h( )d + n( )h( )d
= =
S N
:= y +y
Which filter h(t) maximizes the SNR?
20
The SNR is the signal power (the signal s(t) is deterministic) divided
by the noise power (the noise n(t) is random):
(y S )2
SNR :=
E [(y N )2 ]
Variance of the noise term:

Z Z
N 2
E (y ) = E [n( )n( )] h( )h( )d d
= =
Z Z
N0
= ( )h( )h( )d d
= = 2
Z
N0 2
= h ( )d
2 =
21
hR i2

=
s( )h( )d
SNR := N0
R
2 =
h2 ( )d
Cauchy-Schwartz inequality:
Z 2 Z Z
g1 (t)g2 (t)dt g12 (t)dt g22 (t)dt
t= t= t=
Equality if g1 (t) = kg2 (t) for any arbitrary constant k
22
Therefore, the SNR is maximized if h(t) = ks(t) (h(t) is matched to

the signal s(t)) and is equal to:

2
Z
SNR = s2 ( )d
N0 =
2E
=
N0
23
Matched filter in the frequency domain
Z
H(f ) = s(t)ej2f t dt
t=
Z
= s(t)ej2f t dt
t=
Z
= s(t)ej2f t dt
t=
= S (f )
The magnitude of H(f ) is identical to the magnitude of S(f )

The phase of H(f ) is the negative of the phase of S(f )
24
Outline
Introduction
Signal demodulation
Symbol detection
Exercise
25
Outline: Symbol detection
Maximum a posteriori
Maximum likelihood
26
Detection of memoryless modulations
Goal: make a decision on the transmitted signal sm based on the

observation r
Because the system has no memory, we can focus on a single time
interval
Two optimization criteria:
Maximum a posteriori
Maximum likelihood
27
Maximum a posteriori detector
Maximum a posteriori (MAP) criterion:
sM
m
AP
= max p(sm |r)
sm
The MAP criterion maximizes the probability of a correct decision, or

equivalently minimizes the probability of making an error (bit error
rate)
28
Maximum a posteriori detector
Bayes rule:
p(r|sm ) p(sm )
p(sm |r) =
p(r)
The denominator is independent on the hypothetic transmitted signal
and can be neglected in the MAP criterion:
sM
m
AP
= max p(r|sm ) p(sm )
sm
Knowledge of the a-priori probabilities p(sm ) and of the conditional

probabilities p(r|sm ) is required
29
Maximum likelihood detector
Maximum likelihood (ML) criterion:
sM
m
L
= max p(r|sm )
sm
The MAP detector is equivalent to the ML detector when the M

transmitted signals are equally probable p(sm ) = 1/M
30
Minimize the Euclidian distance
We have computed that (see slide 13):

K
" #
1 1 X
p(r|sm ) = p exp (rk smk )2
(N0 )K N0
k=1
The ln function is monotonic, so that:
sM
m
L
= max (ln p(r|sm ))
sm
K
!
X
= min (rk smk )2
sm
k=1
The ML criterion reduces to finding the signal sm that is closest in

distance to the received vector r (minimum Euclidian distance)
31
Select the signal with the largest correlation
Equivalently:
K K
!
X X
sM
m
L
= max 2 rk smk s2mk
sm
k=1 k=1
H 2

= max 2 r sm ksm k
sm
Z
= max 2 r(t)sm (t)dt Em
sm t=
First term : projection of the received signal onto each of the M

possible transmitted signal
Second term: bias to compensate for signal sets that have unequal
energies (example: PAM)
32
Alternative receiver structure
33
Outline
Introduction
Signal demodulation
Symbol detection
Pulse-amplitude modulation (PAM)
performance
Exercise
34
Binary PAM
Relationship input symbol/output correlator:
r = sm + n
with:

s 1 = Eb

s 2 = Eb
Conditional probability:

1 1
p(r|sm ) = p exp (r sm )2
(N0 ) N0
35
Decision rule
The ML criterion reduces to selecting sm that minimizes the Euclidian

distance (r sm )2
Binary PAM: compare r with the threshold 0

Eb Eb
s2 0 s1
36
Performance
Probability of making an error if s1 has been transmitted:

Z 0
P (e|s1 ) = p(r|s1 )dr

0 2
1 (r Eb )
Z
= p exp dr
(N0 ) N0
Z 2Eb /N0
1 x2 /2
= e dx
2
Z r !
1 x2 /2 2Eb
= e dx = Q
2 2Eb /N0 N0
37
Performance
P (e|s2 ) = P (e|s1 )
r !
2Eb
= Q
N0
The average probability of making an error (the symbols are equally

likely):
1 1
Pb = P (e|s1 ) + P (e|s2 )
2 2
r !
2Eb
= Q
N0
38
M-ary PAM
The SNR per bit required to

achieve a given error probability
increases by over 4 dB for every
factor-of-two increase in M
39
Outline
Introduction
Signal demodulation
Symbol detection
Quadrature-amplitude modulation (QAM)

performance
Exercise
40
Rectangular QAM
Rectangular QAM constellations

are seen as two PAM signals
impressed on phase-quadrature
carriers
The bit error rate given as a
function of the energy per bit is
therefore identical to the one of
M-ary PAM (but number of bits
per symbol and symbol energy
are different!)
41
Outline
Introduction
Signal demodulation
Symbol detection

Exercise
42
Orthogonal binary FSK
r = sm + n
with:
h iT
s1 := Eb 0
h iT
s2 := 0 Eb
and
h iT
r := r1 r2
h iT
n := n1 n2
43
Orthogonal binary FSK
ML criterion reduces to selecting sm that minimizes the Euclidian

P2
distance k=1 (rk smk )2
Binary FSK:
s2

2E b
0
s1
44
Performance

2 2
!
X X
P (e|s1 ) = p (rk s2k )2 < (rk s1k )2
k=1 k=1
p p
= p((r1 ) + (r2 Eb ) < (r1 Eb )2 + (r2 )2 )
2 2
p p
= p((n1 + Eb ) + (n2 Eb )2 < (n1 )2 + (n2 )2 )
2
p
= p(n2 n1 > Eb )
Z
1 (x2 /2N0 )
=
e dx
2N0 x= Eb
Z r !
1 (x2 /2) Eb
= e dx = Q
2 x= Eb /N0 N0
45
Performance
P (e|s2 ) = P (e|s1 )
r !
Eb
= Q
N0
The average probability of making an error (the symbols are equally

likely):
1 1
Pb = P (e|s1 ) + P (e|s2 )
2 2
r !
Eb
= Q
N0
46
Comparison binary PAM / binary FSK
Orthogonal signals (binary

FSK) require a factor of 2
increase in energy to achieve the
same error probability as
antipodal signals (binary PAM)
The difference of 3 dB is simply

due to the different minimum
Euclidian distance between the
signal points
47
M-ary FSK
By increasing the number M of

waveforms, the SNR per bit
required to achieve a given
probability of bit error can be
reduced
Minimum required SNR per bit

to achieve an arbitrarily small
error probability as M
(Shannon limit):
Eb
> ln 2 = 1.6 dB
N0
48
Outline
Introduction
Signal demodulation
Symbol detection

Exercise
49
PSK
r = sm + n
with:
h iT
sm := Es cos 2
M (m 1) Es sin 2
M (m 1)
and
h iT
r := r1 r2
h iT
n := n1 n2
50
Decision rule
ML criterion reduces to selecting sm that minimizes the Euclidian

P2
distance k=1 (rk smk )2
PSK: compute the phase of the received signal based on r and select
the signal sm whose phase is the closest (phase detector)
r2
r = arctan
r1
51
Probability distribution function of r
Received vector PDF if s1 has been transmitted:

2 2

1 (r1 Es ) + (r2 )
pr (r1 , r2 ) = exp
N0 N0
Relation coordinates r1 and r2 to the modulus vr and phase r of the

received vector:
p
vr = r12 + r22 r1 = vr cos r
or
r = arctan r2 /r1 r2 = vr sin r
52
Probability distribution function of r
Joint modulus and phase PDF (after variable change):

2
vr vr + Es 2 Es vr cos r
pvr ,r (vr , r ) = exp
N0 N0
Phase-only PDF:
Z
pr (r ) = pvr ,r (vr , r )dvr
vr =0
" #

r
vr Es Es
Z
2
= exp vr + 2 vr cos r dvr
vr =0 N0 N0
53
Performance
Symbol error probability if s1 has been transmitted:

Z /M
P (e|s1 ) = 1 pr (r )dr
r =/M
Symbol error probability (signal symmetry):
Ps = P (e|s1 )
The integral of pr (r ) does not lead to a simple form and should be

evaluated numerically
Note: the 2-PSK case is equivalent to the binary PAM
54
Performance
Es
s :=
N0
55
Performance
The bit error probability is difficult to derive from the symbol error
probability due to its dependence on the mapping of the bits onto the
corresponding signal phases
When a Gray code is used, two symbols corresponding to adjacent
signal phases differ only in a single bit
Since the most probable errors due to the noise result in the erroneous
selection of an adjacent phase to the true phase, most symbol errors
contain only a single bit error
Therefore the bit error probability can be approximated as:
Ps
Pb
log2 M
56
Outline
Introduction
Signal demodulation
Symbol detection
Exercise
57
Phase synchronization requirements
The optimal receiver is built assuming identical carrier phases at the

transmitter and receiver
In practice, there always exists a random phase difference between the
two sides of the link that needs to be corrected before the data
transmission can start
In the case of orthogonal FSK only, it is possible to get rid of this
requirement at the expense of a slight performance loss
58
Orthogonal FSK
Assume a binary FSK signal:

r
2Eb
sm (t) = cos (2(fc + mf )t) (0 t T ; m = 0, 1)
T
59
FSK non-coherent demodulation
Sufficient statistics are obtained if the received signal is projected on a

set of orthonormal functions that span the signal space:
r
R 2
f1 (t) = cos (2fc t + )
T
r
I 2
f1 (t) = sin (2fc t + )
T
r
R 2
f2 (t) = cos (2(fc + mf )t + )
T
r
I 2
f2 (t) = sin (2(fc + mf )t + )
T
where is the unknown carrier phase at the receiver
60
FSK non-coherent demodulation
Assuming s1 (t) is transmitted, the received coefficients are given by:

p
R
r1 = Eb cos () + nR1
p
I
r1 = Eb sin () + nI1
r2R = nR
2
r2I = nI2
The noise variables nR I R I

1 , n1 , n2 and n2 are independent random
variables of Gaussian distribution G(0, N20 )
The received vector is formed:
h iT
r = r1R r1I r2R r2I
61
Optimum detector
The decision is made according to the MAP criterion:
p(s1 |r) >< p(s2 |r)
which is equivalently expressed as:

p(r|s1 ) P (s2 )
><
p(r|s2 ) P (s1 )
62
Computation p(r|s1 )
The variables r1R , r1I , r2R and r2I are independent:
p(r|s1 , ) = p(r1R , r1I |s1 , ) p(r2R , r2I |s1 , )
with:
R
2 I
2

1 (r1 Eb cos ) + (r1 Eb sin )
p(r1R , r1I |s1 , ) = exp
N0 N0
R 2 I 2

1 (r2 ) + (r2 )
p(r2R , r2I |s1 , ) = exp
N0 N0
63
2
1
Z
p(r|s1 ) = p(r|s1 , ) d
2 =0
2
1 1
= exp ((r1R )2 + (r1I )2 + (r2R )2 + (r2I )2 + Eb )
N0 N0
q
2 Eb
I0 (r1R )2 + (r1I )2
N0
where I0 (x) is the modified Bessel function of order 0, such that:

q Z 2
2 Eb 1 2 Eb R
I0 R 2 I 2
(r1 ) + (r1 ) = exp (r1 cos + r1I sin ) d
N0 2 =0 N0
64
Modified bessel function of order 0
12
10
8
I0(x)
0
0 0.5 1 1.5 2 2.5 3 3.5 4
x
65
Similarly:
2
1 1
p(r|s2 ) = exp ((r1R )2 + (r1I )2 + (r2R )2 + (r2I )2 + Eb )
N0 N0
q
2 Eb
I0 (r2R )2 + (r2I )2
N0
66
Optimum detector
The MAP criterion reduces to:

p
I0 2N0Eb (r1R )2 + (r1I )2 P (s2 )
p ><
I0 2N0Eb (r2R )2 + (r2I )2 P (s1 )
When the symbols are equiprobable, the MAP criterion reduces to an

envelope detector due to the monotonicity of the modified bessel
function of order 0:
q q
(r1R )2 + (r1I )2 >< (r2R )2 + (r2I )2
67
FSK non-coherent receiver
68
Performance
Similarly to the coherent

receiver, the BER improves as
the number of levels M increases
(the required bandwidth
increases too!)
69
Impact of signal correlation
The performance decreases when

the correlation between the
transmitted signals is increasing
The non-coherent receiver does

not work for typical QAM
modulations because there is
always a phase ambiguity!
70
Outline
Introduction
Signal demodulation
Symbol detection
Exercise
71
Exercise
Evaluate the bit error probability for a M-ary PAM modulation as a

function of the ratio average bit energy to noise one-sided PSD.
72

Slides Receiver

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Slides Receiver

Hochgeladen von

Copyright:

Verfügbare Formate

Wireless Communications Group

Optimum Receiver for AWGN channel

Digital Communications, Fourth Edition, J. G. Proakis

The transmitter sends information by the use of M waveforms sm (t)

r(t) = sm (t) + n(t)

The optimum receiver is designed to minimize the probability of

The received signal is passed

The basis functions fk (t) span

At the output of the correlator with fk (t):

The variables rk are Gaussian of mean smk and variance N0 /2 (see

By gathering the correlator outputs:

which is obtained because the variables rk are independent

E [n (t)rk ] = E [n (t)] smk + E [n (t)nk ]

The random variables n (t) and rk are independent (Gaussian and

In this sense, the correlator outputs rk are called sufficient statistics

The auto-correlation function is even and peaks at t = 0

Instead of using a bank of K correlators to generate the variables rk ,

If a signal s(t) is corrupted by AWGN, the filter with an impulse

r(t) = s(t) + n(t)

The signal r(t) is convolved with a filter h(t) and sampled at t = 0:

Which filter h(t) maximizes the SNR?

Variance of the noise term:

Equality if g1 (t) = kg2 (t) for any arbitrary constant k

Therefore, the SNR is maximized if h(t) = ks(t) (h(t) is matched to

The magnitude of H(f ) is identical to the magnitude of S(f )

Goal: make a decision on the transmitted signal sm based on the

Maximum a posteriori (MAP) criterion:

The MAP criterion maximizes the probability of a correct decision, or

Knowledge of the a-priori probabilities p(sm ) and of the conditional

Maximum likelihood (ML) criterion:

The MAP detector is equivalent to the ML detector when the M

We have computed that (see slide 13):

The ln function is monotonic, so that:

The ML criterion reduces to finding the signal sm that is closest in

First term : projection of the received signal onto each of the M

Relationship input symbol/output correlator:

The ML criterion reduces to selecting sm that minimizes the Euclidian

Binary PAM: compare r with the threshold 0

Probability of making an error if s1 has been transmitted:

Probability of making an error if s2 has been transmitted:

The average probability of making an error (the symbols are equally

The SNR per bit required to

Quadrature-amplitude modulation (QAM)

Rectangular QAM constellations

Frequency-shift keying (FSK) performance

ML criterion reduces to selecting sm that minimizes the Euclidian

Probability of making an error if s1 has been transmitted:

Probability of making an error if s2 has been transmitted:

The average probability of making an error (the symbols are equally

Orthogonal signals (binary

The difference of 3 dB is simply

By increasing the number M of

Minimum required SNR per bit

Phase-shift keying (PSK) performance

Relationship input symbol/output correlator:

ML criterion reduces to selecting sm that minimizes the Euclidian

Received vector PDF if s1 has been transmitted:

Relation coordinates r1 and r2 to the modulus vr and phase r of the

Joint modulus and phase PDF (after variable change):

Symbol error probability if s1 has been transmitted:

Symbol error probability (signal symmetry):

The integral of pr (r ) does not lead to a simple form and should be

The optimal receiver is built assuming identical carrier phases at the

Assume a binary FSK signal: