Beruflich Dokumente
Kultur Dokumente
Contents
Chapter 4.1
Waveform and Vector Channel Models
Based on the observed signal r(t), the receiver makes the decision
about which message m, 1m M was transmitted
m]
Optimum decision: minimize error probability Pe = P[m
Chapter 4.1
4.1--1
Optimal Detection for General Vector Channel
4.1--1 Optimal
4.1
p
Detection for General Vector Channel ((1))
n2
j =1 j
2 2
1
=
N
0
N
e 0
4.1--1 Optimal
4.1
p
Detection for General Vector Channel ((2))
= arg max P[ sm | r ]
1 m M
10
max P[ sm | r ]
Optimum decision rule: m = g opt (r ) = arg
1 m M
11
12
m =1
m =1
Pe|m =
Dmc
p(r | sm )dr =
1 m M
m m
Dm
p(r | sm )dr
Pe = Pm
m =1
1 m M
m m
Dm
p(r | sm )dr
13
R l i between
Relation
b
symbol
b l error prob.
b andd bit
bi error prob.
b
Pe
Pb Pe kPb
k
14
1 m M
1 m M
Based only
y on r1 r1 : sufficient
ff
statistics for detection of sm
r2 can be ignored r2 : irrelevant data or irrelevant information
Preprocessing
p
g at the Receiver ((1))
sm
Channel
G(r)
Detector
1 m M
Preprocessing
p
g at the Receiver ((2))
17
Chapter 4.2
Waveform and Vector AWGN Channels
18
By Gram-Schmidt
B
G
S h idt procedure,
d
we derive
d i an orthonormal
th
l basis
b i
{j(t), 1 j N}, and vector representation of signals {sm, 1 m M}
n1 (t ) = n j j (t ),
)
j =1
where
h n j = n(t )), j (t )
n2 (t ) = n(t ) n1 (t )
19
j =1
j=
N
j (t ), where smj = sm (t ), j (t )
(s
j =1
mj
mj
+ n j ) j (t ) + n2 (t )
Define rj = smj + n j
where
rj = sm (t ),
) j (t ) + n(t ),
) j (t ) = sm (t ) + n(t ),
) j (t ) = r (t ),
) j (t )
N
So r (t ) = rj j (t ) + n2 (t )
j =1
where rj = r(t), j (t )
20
Prove that the noise components {nj} are iid zero-mean Gaussian
with variance N0/2
n j = n(t ) j (t )dt
(Zero-Mean)
E[n j ] = E n(t ) j (t )dt = E[n(t )] j (t )dt = 0
= ( N 0 / 2) (t s )i (t )dt j ( s )ds
d
i= j
N0 / 2
= ( N 0 / 2) i ( s ) j ( s )ds =
i j
0
21
n(t) is white.
i =1
N0
N0
t
s
s
ds
=
(
)
j (t )
j
2
2
N0
N0
=
j (t ) j (t ) = 0
2
2
22
r (t ) = ( smj + n j ) j (t ) + n2 (t )
j =1
1 m M
1 m M
23
Chapter 4.24.2-1
Optimal Detection for the Vector AWGN
Channel
Wireless Information Transmission System Lab.
Institute of Communications Engineering
g
g
National Sun YatYat-sen University
24
4.2--1 Optimal
4.2
p
Detection for the Vector AWGN Channel ((1))
= arg max Pm [ pn (r s m )]
r = sm + n
1 m M
N
r sm
1
N
= arg max Pm
e 0
N
1 m M
0
2
r sm
= arg max Pm e N0
1 m M
r sm
= arg max ln Pm
N 0
1 m M
25
n ~ N (0,
1
N
0
N0
I)
2
is a constant
ln(x) is increasing
4.2--1 Optimal
4.2
p
Detection for the Vector AWGN Channel ((2))
2
r sm
m = arg max ln Pm
Multiply N0/2
N 0
1 m M
(c)
1
2
N
= arg max 0 ln Pm r s m
2
1 m M 2
1
2
2
N
= arg max 0 ln Pm ( r + s m 2r s m )
2
s
= Em
2
1 m M 2
m
(b)
1
N
= arg max 0 ln Pm Em + r s m
2
1 m M 2
(d )
(e)
= argg max [ m + r s m ]
1 m M
(MAP)
26
is dropped
N0
1
ln Pm Em
2
2
Bi term
Bias
t
m =
4.2--1 Optimal
4.2
p
Detection for the Vector AWGN Channel ((3))
m =
N0
1
ln Pm Em
2
2
1
2
2
N
m = arg max 0 ln Pm r s m = arg max r s m
2
1 m M 2
1 m M
= arg
arg min r s m
1 m M
27
4.2--1 Optimal
4.2
p
Detection for the Vector AWGN Channel ((4))
m =
m = arg max r s m
1 m M
28
4.2--1 Optimal
4.2
p
Detection for the Vector AWGN Channel ((5))
r (t )sm (t )dt
r sm =
Em = s
2
m
= sm2 (t )dt
in
i AWGN channel,
h
l
1 2
N0
2
1 m M 2
1 2
29
4.2--1 Optimal
4.2
p
Detection for the Vector AWGN Channel ((6))
( r (t ) sm (t ) ) dt
= arg max
max [ N 0 ln Pm + C (r, s m ) ]
1 m M
30
Optimal
p
Detection for Binary
y Antipodal
p
Signaling
g
g (1)
( )
s1 =
ES =
s2 = E S = Eb
Eb
F
From
(4
(4.2-20)
2 20)
N
N
1
1
D1 = r : r Eb + 0 ln p Eb > r Eb + 0 ln(1 p) Eb
2
2
2
2
N0
1 p
= r : r >
ln
p
N0
4 Eb
1 p
rth =
ln
p
4 Eb
= {r : r > rth }
31
Optimal
p
Detection for Binary
y Antipodal
p
Signaling
g
g (2)
( )
N0
1 p
ln
D1 = r : r > rth
p
4 Eb
Pe = Pm
m =1
1 m 2
m m
Dm
(
= p p ( r | s =
P(r | s m )dr
)
(
E ) dr + (1 p) p ( r | s =
)
E ) dr
= p p r | s = Eb dr + (1 p) p r | s = Eb dr
D2
rth
D1
rth
32
Optimal
p
Detection for Binary
y Antipodal
p
Signaling
g
g (3)
( )
(
= pP N (
)
(
/ 2 ) < r + (1 p) P N (
rth
rth
Eb , N 0
th
Eb rth
rth + Eb
= pQ
+ (1 p)Q
N /2
N /2
0
0
Eb , N 0 / 2 > rth
Q( x) = P [ N (0,1) > x ]
Q( x) = 1 Q( x)
Pe = p p r | s = Eb dr + ((1 p) p r | s = Eb dr
P N
Eb , N 0 / 2 < rth
Eb rth
= Q
N 2
0
33
= 1 P N Eb , N 0 / 2 > rth
r Eb
= 1 Q th
N 2
0
r is in D2
Distance between the pprojection
j
of rs1 on s2s1 from s1
is greater than d12/2, d12=|| s2s1 ||
n ( s2 s1 ) d12
d122
>
Pb = P
= P n ( s2 s1 ) >
d
2
2
12
s2 s1
is a unit vector. n = r s1.
d12
34
2
Since n ( s2 s1 ) ~ N (0, d12 N 0 / 2)
Pb = P n ( s2 s1 ) > d122 / 2
d
d12 / 2
= Q
= Q
d N /2
2N0
0
12
2
12
m
P[ X > ] = Q
m
P[ X < ] = Q
( 2.3 12 )
Since Q(
Q(x)) is decreasing,
g min. error pprobabilityy =max. d12
d =
2
12
( s1 (t ) s2 (t ) )
dt
When equiprobable
q p
signals
g
have the same energy,
gy, Es1= Es2 =E
d122 = Es1 + Es 2 2 s1 (t ), s2 (t ) = 2 E (1 )
1 1 is cross-correlation coefficient
d12 is maximized when = 1 antipodal signals
35
Optimal
p
Detection for Binaryy Orthogonal
g
Signaling
g
g (1)
( )
Eb i = j
si (t )s j (t )dt = 0 i j 1 i, j 2
j (t ) = s j (t ) / Eb , vector representation
Ch
Choose
i is
i
s1 =
Eb , 0 ;
s 2 = 0, Eb
When
h signals
i l are equiprobable
i b bl (figure)
(fi
)
Error probability : ( d = 2 Eb )
Pb = Q d 2 / 2 N 0 = Q Eb / N 0
) (
Optimal
p
Detection for Binaryy Orthogonal
g
Signaling
g
g (2)
( )
b = Eb / N 0
37
Chapter 4.24.2-2
Implementation of the Optimal Receiver for
AWGN Channels
Wireless Information Transmission System Lab.
Institute of Communications Engineering
g
g
National Sun YatYat-sen University
38
4.2--2 Implementation
4.2
p
of the Optimal
p
Receiver for AWGN Channels
39
(from 4.2-17)
The MAP decision in AWGN channel
N0
1
where m =
ln Pm Em
m = arg max[ m + r s m ],
1 m M
1)
r is derived
from
1))
2)
3)
40
41
41
Another implementation
Requires M correlators
Usually M > N
Less preferred
42
where m =
N0
1
ln Pm Em
2
2
rx = r (t ) x(t )dt
x(t)
( ) is j((t)) or sm((t))
Define h(t)= x(Tt) for arbitrary T: filter matched to x(t)
If r(t)
( ) is applied
pp
to h(t),
( ) the output
p y(
y(t)) is
y (t ) = r (t ) * h(t )=
=
r ( )h(t )d
r ( ) x(T t + )d
h ( t ) = x (T t )
h ( ) = x (T )
h ( t ) = x (T ( t ) )
= x (T t + )
rx = y (T ) = r ( ) x( )d
44
Sampling delay of T
|H( f )|=|S( f )|
H( f ))= S(
S( f ) 2 f T
45
Assume that r(t) = s(t) + n(t) is passed through a filter h(t), and the output
y(t) yS(t)+v(t) is sampled at time T
ys (T ) = H ( f ) S ( f )e j 2 f T df
VAR[v(T )] = ( N 0 / 2) H ( f ) df = ( N 0 / 2) Eh
R l i h' Theorem:
Rayleigh's
Th
46
x ( t ) dt =
2
X ( f ) df = Ex
2
2
S
H ( f ) df
j 2 fT
df
S ( f )e
Rayleigh's Theorem:
j 2 fT
x ( t ) dt =
2
X ( f ) df = Ex
df =Eh Es
SNR O
Es Eh
2E
E
= s = S
( N 0 / 2) Eh
N0 N0 2
Matched--Filter
Matched
y (t ) = r (t ) h(t ) = r ( )h(t )d
0
= s ( )h(t )d + n( )h(t )d
48
Matched--Filter
Matched
Proof: ((cont.))
At the sampling instant t=T:
T
T
y (T ) = s ( ) h (T ) d + n ( ) h (T ) d
0
= y s (T ) + yn (T )
This problem
Thi
bl is
i to
t select
l t the
th filter
filt impulse
i
l response that
th t
maximizes the output SNR0 defined as:
SNR 0 =
E y (T ) =
2
n
ys2 (T )
E yn2 (T )
T T
T
1
1
= N 0 (t )h(T )h(T t )dtd = N 0 h 2 (T t )dt
0 0
0
2
2
49
Matched--Filter
Matched
Proof: (cont.)
2
By substituting for ys (T) and E y n ( T ) into SNR0.
' = T
2
s ( ) h(T ) d
h ( ') s (T ') d '
0
SNR 0 =
=
T
T
1
1
2
N 0 h (T t ) dt
N 0 h 2 (T t ) dt
0
0
2
2
T
Matched--Filter
Matched
Proof: (cont.)
Cauchy-Schwarz inequality: if g1(t) and g2(t) are finiteenergy signals, then
2
g (t ) g (t ) dt g 2 (t ) dt g 2 (t ) dt
2
1 2
1
51
Matched--Filter
Matched
Proof: (cont.)
The output (maximum) SNR obtained with the matched
filter is:
2
s ( ) h(T ) d
s ( )Cs (T (T ) ) d
2 0
0
SNR 0 =
=
T
T
2 2
1
N
2
0
C
s (T (T t ) ) dt
N 0 h (T t ) dt
0
0
2
h ( t ) = s (T t )
2 T 2
2
=
s (t ) dt =
h ( ) = s (T )
0
N0
N0
T
h (T ) = s (T (T ) )
Note that the output SNR from the matched filter depends
on the energy of the waveform s(t) but not on the detailed
characteristics
h
t i ti off s(t).
(t)
52
0t T /2
2 (t ) = 2 / T ,
T /2t T
IImpulse
l response off two
t
matched filters (fig (b))
h1 (t ) = 1 (T t ) = 2 / T ,
T /2t T
h2 (t ) = 2 (T t ) = 2 / T ,
0t T /2
y ( t ) = s ( t ) * h ( t ) = s ( )h(t )d
= s ( ) s (T t + )d
53
If s1(t) is transmitted
transmitted, the received vector formed from two
matched filter outputs at sampling instances t = T is
r = (r1 , r2 ) = ( E + n1 , n2 )
ykn
k (T ) = n (t )k (t ) dt ,
k = 1, 2
a)
b))
E[nk ] = E[ ykn(T )] = 0
VAR[[ nk ] = ( N 0 / 2)) Ek = N 0 / 2
VAR[v(T ))] = ( N 0 / 2 ) Eh
( 4.2 52 )
Chapter 4.24.2-3
AU
Union
i B
Bound
d on P
Probability
b bilit
of Errors of ML Detection
Wireless Information Transmission System Lab.
Institute of Communications Engineering
g
g
National Sun YatYat-sen University
55
4.2-3
4.2A Union Bound on Probability of Errors of ML Detection (1)
1
Pe|m =
M
m =1
M
m =1 1 m ' M
m ' m
Dm '
p(r | s m )dr
1 m ' M
m ' m
Dm '
p (r | s m )dr =
r s m
Dm '
1 m ' M
m ' m
pn (r s m )dr
(4.2-63)
1
N
=
D e 0 dr
N 1 m ' M m '
0
m ' m
For most constellation, the integrals does not have a close form
Its convenient to have upper bounds for the error probability
The union bound is the simplest and most widely used bound which
is quite tight particularly at high SNR.
56
4.2-3
4.2A Union Bound on Probability of Errors of ML Detection (2)
Dm '
p ( r | sm )dr
Pe|m =
1 m ' M
m ' m
1 m ' M
m ' m
1
Pe
M
Dmm '
Dm '
p ( r | sm ) dr
Dmm '
Probability Pmm
(4.2-67)
p (r | s m )dr
p (r | sm )dr =
m =1 1 m ' M
m ' m
Dmm '
1 m ' M
m ' m
Pmm '
1
p (r | sm )dr
d =
M
57
m =1 1 m ' M
m ' m
Pmm '
4.2-3
4.2A Union Bound on Probability of Errors of ML Detection (3)
In an AWGN channel
2M
2
Pairwise probability : Pmm ' = Pb = Q d mm
' /(2 N 0 )
d2
1 M
Pe
Q mm '
M m =1 1 m ' M 2 N 0
m ' m
1 x /2
M
Q( x) e
2
2
d mm
'
4 N0
(4.2-37)
m =1 1 m ' M
m ' m
T(X ) =
2
d mm
'
ad X
d2
1m ,m ' M ,m m '
4.2-3
4.2A Union Bound on Probability of Errors of ML Detection (4)
Union bound: Pe 1
2M
2
d mm
'
4 N0
m =1 1 m ' M
m ' m
1
=
T(X ) 1
2M
X = e 4 N0
|| s m s m ' ||
Minimum distance: d min = 1 mmin
, m ' M ,
mm '
Th error probability
The
b bilit (looser
(l
form
f
off the
th union
i bound)
b d)
2
d min
2
2
d mm '
d min
1
M 1 4 N0
Pe
Q
(
M
1)
)
Q
M m =1 1 m ' M 2 N 0
2 N0
2
m ' m
M
59
4.2-3
4.2A Union Bound on Probability of Errors of ML Detection (5)
6 log 2 M
8
=
Ebavg =
Ebavg
M 1
5
Total 1615
15=240
240 possible distances
9d 2
10 d 2
T ( X ) = 48 X d + 36 X 2 d + 32 X 4 d + 48 X 5 d + 16 X 8d
+ 16 X
+ 24 X
+ 16 X
13 d 2
+ 4X
18 d 2
60
4.2-3
4.2A Union Bound on Probability of Errors of ML Detection (6)
Pe
M 1
e
2
2
d min
4 N0
15
e
2
2 Ebavg
5 N0
1
4 N0
48
e
32
2
d min
i
4 N0
3
e
2
d2
9 4 Ebavg
Q
4 5N0
(
(see
example
l 4.3-1)
4 3 1)
61
),
2 Ebavg
5 N0
M
1
=
M
1 M
p (r | s m )dr
P[Error | m sent] =
D
M m =1 m
m =1
M
1 M
p (r | s m )dr = p (r | s m )dr
Dmc ' m
M m =1 Dmm '
m =1
M
d mm '
Q
,
2
N
m =1
0
D
'
m
To derive the tightest lower bound maximize the right hand side
m
d mm ' 1 M d min
max Q
Q
=
m ' m
M
N
N
2
2
m
=
1
m =1
0
0
1
Pe
M
m
d min
62
m
(d min
denotes the distance from m to its nearest neighbor in the constellation)
m
d min
Q d min / 2 N 0 , At least one signal at distance d min from s m
Q
2N
otherwise
0
0,
1
Pe
M
d min
Q
N
2
1< m < M
0
N min d min
Q
2N
M
0
d min
Pe ( M 1)Q
2N
0
63
64
Chapter 4.3
4.3--1 Optimal Detection & Error Prob.
for ASK or PAM Signaling
65
Chapter 4.3
4.3--1 Optimal Detection & Error Prob.
for ASK or PAM Signaling
(3.2-22)
12 log 2 M
Ebavg
2
M 1
d min
1
2
2
N
66
d min
1
Peo = Pei = Q
2N
2
0
Chapter 4.3
4.3--1 Optimal Detection & Error Prob.
for ASK or PAM Signaling
Symbol
y
error pprobabilityy
d min
d min
1
P error m sent =
2( M 2)Q
+ 2Q
M
m =1
2 N0
2 N 0
2 ( M 1) d min
=
Q
12 log
l 2M
M
2 N0
d min =
Ebavg
2
M 1
E
6log 2 M bavg
1
= 2 1 Q
2
M M 1 N 0
6log M Ebavg
Doubling M
b
2
2Q
for
large
M
increasing rate by 1
M 2 1 N0
bit/transmission
1
Pe =
M
Decrease with M
SNR/bit
67
Chapter 4.3
4.3--1 Optimal Detection & Error Prob.
for ASK or PAM Signaling
68
Chapter 4.3
4.3--2 Optimal Detection & Error Prob.
for PSK Signaling
When
s1 = ( E , 0)
r = ( r1 , r2 ) = ( E + n1 , n2 )
r1
p
~ N ( E , N 0 / 2)) and r2 ~ N ((0,, N 0 / 2)) are indep.
(r1 E ) 2 + r22
1
p (r1 , r2 ) =
exp
N
N0
0
r2
V = r + r , = arctan
r1
2
1
2
2
v 2 + E 2 Ev cos
v
pV , (v, ) =
exp
N0
N0
69
Chapter 4.3
4.3--2 Optimal Detection & Error Prob.
for PSK Signaling
Marginal PDF of Q is
p ( ) = pV , (v, ) dv
0
v
e
N0
v 2 + E 2 Ev cos
N0
1 s sin 2
=
e
ve
0
2
dv
( v 2 s cos ) 2
2
dv
E
Symbol SNR: s = N
0
As gs increases, pQ(q ) is
more peaked around q = 0.
70
Chapter 4.3
4.3--2 Optimal Detection & Error Prob.
for PSK Signaling
Decision region:
g
D1 = { : / M < / M }
Error probability is
Pe = 1
/M
/ M
p ( )d
2 Eb / N 0
When M=4
M=4, two binary phase modulation signals
2
2
Pc = (1 Pb ) = 1 Q 2 Eb / N 0
Pe = 1 Pc = 2Q 2 Eb / N 0 1 Q 2 Eb / N 0
2
71
Chapter 4.3
4.3--2 Optimal Detection & Error Prob.
for PSK Signaling
M , Required SNR
72
Chapter 4.3
4.3--2 Optimal Detection & Error Prob.
for PSK Signaling
For large
g SNR (E/N
(
) , p() is approximated
pp
0>> 1)
p ( ) s / cos e
s sin 2
, for | | / 2
sin( / M )
u2
u = s sin
s = E / N0
du
2 Eb
= 2Q 2 s sin = 2Q (2 log 2 M ) sin
M
M N0
Eb
s
E
=
=
When M=2 or 4:
N 0 N 0 log 2 M log 2 M
Pe 2Q 2 Eb / N 0
73
Chapter 4.3
4.3--2 Optimal Detection & Error Prob.
for PSK Signaling
For large
g M and large
g SNR:
sin(/M) ~ /M
Error probability is approximated by
2 2 log M E
b
2
Pe 2Q
M
N 0
for large M
For large M,
M doubling M reduces effective SNR by 6 dB.
dB
In p
practice,, the carrier pphase is extracted from the
received signal by performing nonlinear operation
phase ambiguity
p
g y
For BPSK
For QPSK,
QPSK there are phase ambiguities of 90 and 180 in
the phase estimate.
Consequently,
q
y, we do not have an absolute estimate of the
carrier phase for demodulation.
75
The p
phase ambiguity
g y can be overcome by
y encodingg the
information in phase differences between successive signals.
In BPSK
IIn QPSK
QPSK, the
h phase
h
shifts
hif are 0,
0 90, 180, and
d -90
90, corresponding
di
to bits 00, 01, 11, and 10, respectively.
77
Chapter 4.3
4.3--3 Optimal Detection & Error Prob.
for QAM Signaling
In detection of Q
QAM signals,
g
, need two filter matched to
1 (t ) = 2 / Eg g (t ) cos 2 f ct
2 (t ) = 2 / Eg g (t ) sin 2 f ct
Output of matched filters r =( r1, r2)
Compute C (r, s m ) = 2r s m Em (See 4.2-28)
Select m = arg max C (r, s m )
1 m M
r = 2 A Eavg = 2 A2
1
2(3 A2 ) + 2 A2 = 2 A2
E
=
A1 = A, A2 = 3 A avg
4
78
Chapter 4.3
4.3--3 Optimal Detection & Error Prob.
for QAM Signaling
1
=
M
A2
=
M
2
2
(
A
+
A
mc ms )
m =1
M
(a
m =1
2
mc
2
+ ams
)
79
Chapter 4.3
4.3--3 Optimal Detection & Error Prob.
for QAM Signaling
Rectangular QAM
Generated by two PAM signals in I-phase and Q-phase carriers.
Easily demodulated.
For M16, only requires energy slight greater than that of the
best 16-QAM constellation.
When k is even, the constellation is square, the minimum
distance
6 log M
d min =
Ebavg
M 1
Can be considered as two M -ary PAM constellations.
An error occurs if either n1 or n2 is large enough to cause an error.
error
Probability of correct decision is
Pc , M QAM = P
2
c , M PAM
80
= 1 Pe,
M PAM
Chapter 4.3
4.3--3 Optimal Detection & Error Prob.
for QAM Signaling
Pe , M QAM = 1 (1 Pe,
M PAM
1
1 Pe ,
2
M PAM
Th error probability
The
b bilit off PAM is
i (from
(f
(4.3-4)
(4 3 4) & (4.3-5)
(4 3 5) )
Pe,
2
)
= 2 Pe ,
M PAM
M PAM
1 d min
= 2 1
Q
M 2 N0
1 3log 2 M Ebavg
= 2 1
Q
M 1 N0
M
Pe, M QAM
1 3log 2 M Ebavg
= 4 1
Q
M 1 N0
M
3log M bavg
2
4Q
M 1 N0
1 3log 2 M Ebavg
1 1
Q
M 1 N0
M
Chapter 4.3
4.3--3 Optimal Detection & Error Prob.
for QAM Signaling
Chapter 4.3
4.3--4 Demodulation and Detection
Chapter 4.3
4.3--4 Demodulation and Detection
x(t ), y (t ) = Re { xl (t ), yl (t ) } / 2
g max r s m +
ln Pm Em
m = arg
2
2
1 m M
1
2
2
1 m M
ML decision rule is
1
2
m = arg max Re
R rl (t ) s ml (t )dt
d s ml (t ) dt
d
2
1 m M
84
Chapter 4.3
4.3--4 Demodulation and Detection
Complex
p
matched filter.
Detailed structure of a
complex matched filter
in terms of its in-phase
and quadrature
components..
Chaper 4.4:Optimal
Ch
4 4 O i l Detection
D
i and
d
Error Probability for PowerLimited Signaling
Wireless Information Transmission System Lab.
Institute of Communications Engineering
g
g
National Sun YatYat-sen University
86
2E
E is symbol energy
( 1, n2,, nM) are iid zero-mean Gaussian r.vs
(n
r vs with n2 = N 0 / 2
R1 = r s1
= ( E + n1 , n2 ,,...,, nM )
Rm = r s m , 1 m M
E,0
,0
= E + En1
Rm = Enm , 2 m M
Bayes
Theorem
n2, n3,,
nM are iid
( P[n
< n + E | s1 sent,n1 = n]
88
M 1
pn1 (n) dn
Since n2~N(0,N
( , 0/2))
n+ E
P[n2 < n + E | s1 sent,n1 = n] = 1 Q
N /2
0
M 1
n2
1
n+ E
N
Pc =
1 Q
e 0 dn
n+ E
N 0
N 0 / 2
x=
2
N0 / 2
x 2 E / N0 )
(
1
M 1
2
(1 Q ( x)) e
=
dx
2
2
x 2 E / N0 )
( x
(
1
1
M 1
e
2
1
(1
(
))
Pe = 1 Pc =
Q
x
e
dx
2
2
Pe
Pe
P[[s m received | s1 sent ] =
= k
, 2 m M.
M 1 2 1
89
2 E / N0
2
dx = 1
Probability
y that first bit is detected as 1 =
prob. of detecting as {sm: first bit =1}
Pb = 2
k 1
Pe
2k 1
1
=
P
Pe
e
k
k
2 1 2 1
2
90
l
,
2T
0.715
T
91
M 1
e
2
2
d min
4 N0
In orthogonal signaling
signaling, d min = 2 E
E
M 1 2 N0
Pe
e
< Me 2 N0
2
kEb
2 N0
=e
k E
b 2ln 2
2 N0
If SNR per bit > 1.42 dB, reliable communication is possible (Sufficient, but
y)
not necessary)
92
Pe
2
k ( Eb / N 0 ln
l 2)
2e
, ln 2 Eb / N 0 4 ln 2
93
A set of M
M=2
2k biorthogonal signals comes from N
N=M/2
M/2
orthogonal signals by including the negatives of these signals
Requires
q
onlyy M/2 cross-correlators or matched filters
94
94
1 m M / 2
1
N0
r1
r1
e x
/ N0
dx =
1
2
r1
N0 2
r1
e x / 2 dx
N0 2
r1 ~ N ( E , N 0 / 2)
1
2
N0 2
x /2
Pc =
e
dx
p (r1 )dr1
r1
v = r1 2 / N 0
0
2
N
0
( M / 2) 1
1
1 v + 2 E / N0 x2 / 2
v2 / 2
=
e
d
dx
e
dv
d
2E/N 0
( v + 2 E / N0 )
2
2
r1
95
Fi Pe v.s. Eb/N0
Fig:
E=k Eb
Shannon
Limit
96
96
Simplex
p signals
g
are obtained from shifting
g a set of orthogonal
g
signals by the average of these orthogonal signals
Geometry of simples signals is exactly the same as that of original
orthogonal signals
M 1
e
1
(1
(
))
Q
x
M 2E
x
M 1 N 0
/ 2
dx
A relative
l i gain
i off 10 llog(M/M1)
( / 1) dB
d over orthogonal
h
l signaling
i li
97
Chap 44.5
Ch
5 :Optimal
O i l Detection
D
i in
i
Presence of Uncertainty: Noncoherent Detection
Wireless Information Transmission System Lab.
Institute of Communications Engineering
g
g
National Sun YatYat-sen University
98
{sm(t
r (t ) = sm (t ; ) + n(t )
r = s m , + n
99
= arg
g max Pm p (r | m, ) p ( )d
1 m M
= arg max Pm pn (r s m , ) p ( )d
1 m M
Pe = Pm
m 1
M
= Pm
m 1
Dmc
( p(r | m, ) p( )d ) dr
( p (r s
M
m '=1
m ' m
Dm '
m ,
) p ( )d dr
100
(4.5-3)
{
= {r : e
D1 = r : e
( r A Eb ) 2 / N 0
A2 Eb / N 0
= {r : r > 0}
p ( A) dA > e
( r + A Eb ) 2 / N 0
2 rA
A Eb / N 0
2 rA
A Eb / N 0
2 rA Eb / N 0
=e
p ( A)dA
4rA
A Eb / N 0
2 rA Eb / N 0
>1
=>4rA Eb / N 0 > 0
101 => r > 0
>0
(e 2 rA
Eb / N 0
2 rA Eb / N 0
)>0
N0
Pb =
e
dr p ( A)dA
0 0
N0
= P N ( A Eb , 0 ) > 0 p ( A)dA
0
2
A Eb
P N (0,1) >
p( A)dA
N 0 / 2
(
= E Q ( A
)
2 E / N )
= Q A 2 Eb / N 0 p ( A)dA
0
102
In AWGN channel,
r (t ) = sm (t td ) + n(t )
td : random
d
time
ti asynchronism
h i between
b t
t and
tx
d rx
r (t ) = Re sml (t td )e j 2 fc ( t td ) + n(t )
= Re sml (t td )e j 2 fctd e j 2 fct + n(t )
Noncoherent Detection
103
Pm 2
j
(
r
s ml )d
m = arg max
p
e
l
nl
0
2
1 m M
2
F
From
(4
(4.5-3)
5 3)
2 rl e j s ml /(4 N0 )
Pm
1
= arg max
e
d
N 0
2 ( 4 N 0 )
1 m M
104
nl ~ N (0 N 1 , 2 N 0 I N )
E
m
2 N0
Pm
e
2
P
= arg max m e
2
1 m M
= arg max
1 m M
Em
2 N0
Em
2 N0
e
e
e
rl e j s ml /(4 N 0 )
sm = sml cos 2 f c t
1
Re[ rl e j s ml ]
2 N0
1
Re[|rl s ml |e j ( ) ]
2 N0
{
2 Re
R {r e
}
} + 2E
= rl 2 Re rl e j sml + e j sml
2
= rl
sml
= 2Em
rl e j sml
1
Re[( rl s ml ) e j ]
2 N0
rl e j sml = e j sml
sml
r =e- j ( sml ) r
H
=e- j r sml
rl s ml =| rl s ml | e j
: phase of rl s ml
Pm 2 N0 2 2 N0 |rl sml |cos( )
= arg max
e
e
d
0
2
1 m M
I 0 ( x) is modified Bessel function
Em
= arg max Pm e
1 m M
Em
2 N0
| r s |
I 0 l ml
2 N0
105
1
2
e x cos d
m = arg max I 0
2
N
1 m M
0
= arg max | rl s ml |
I0(x) is increasing
1 m M
E l Detector
Envelop
D t t
106
4.6 Comparison
p
of Digital
g
Modulation Methods
107
4.6 Comparison
p
of Digital
g
Modulation Methods
4.6 Comparison
p
of Digital
g
Modulation Methods
M
M
M
R
=
=
2T 2(k R ) 2 log 2 M
4.6 Comparison
of Digital
Modulation Methods
p
g
A compact and meaningful
comparison of modulation
methods is one based on the
normalized data rate R/W (bits per
second per hertz of bandwidth)
versus the
th SNR per bit (b/N0 )
required to achieve a given error
probability
probability.
In the case of PAM, QAM, and
PSK, increasing M results in a
higher bit-to-bandwidth ratio R/W.
110
4.6 Comparison
p
of Digital
g
Modulation Methods
4.6 Comparison
p
of Digital
g
Modulation Methods
Consequently, M
M-ary
ary orthogonal signals are appropriate for
power-limited channels that have sufficiently large bandwidth to
accommodate a large number of signals.
A M, the
As
h error probability
b bili can be
b made
d as small
ll as desired,
d i d
provided that SNR>0.693 (-1.6dB). This is the minimum SNR
per bit required to achieve reliable transmission in the limit as
the channel bandwidth W and the corresponding R/W0.
The figure above also shown the normalized capacity of the
b d li i d AWGN channel,
band-limited
h
l which
hi h is
i due
d to Shannon
h
(1948).
(
)
The ratio C/W, where C (=R) is the capacity in bits/s, represents
the highest achievable bit rate-to-bandwidth
rate to bandwidth ratio on this
channel.
Hence,, it serves the upper
pp bound on the bandwidth efficiencyy of
any type of modulation.
112