Week 10: 4.2-1 Optimal Detection For The Vector AWGN Channel 4.2-1 Optimal Detection For The Vector AWGN Channel

Dr. Ashraf Tahat, Ph.D.
Monday, May 17, 2021
Week 10
hD
Digital
Communications
,P
‫ ﺃﺷﺭﻑ ﺃﻛﺭﻡ ﻁﺎﻫﺎﺕ‬.‫ﺩ‬
at
Dr. Ashraf A. Tahat, Ph.D.
tahat@psut.edu.jo
May 17, 2021

h Dr. Ashraf A Tahat 1
Ta
fA
ra
sh
4.2-1 Optimal Detection for the Vector

AWGN Channel
rA
D
May 17, 2021 Dr. Ashraf A Tahat 2
Princess Sumaya University for

Technology -- Cellular Communications 1
Dr. Ashraf Tahat, Ph.D. Monday, May 17, 2021
The AWGN Vector Channel

 The AWGN vector channel is the vector equivalent channel to the
waveform AWGN channel. In which the components of the noise
vector are iid zero-mean Gaussian random variables with variance
hD
N 0/ 2 .
,P
at
The joint probability density function (pdf) of (real) n, is given by:
May 17, 2021

Ta
fA
Pm : prior or apriori probabilities.

ra
sh
rA
D
f (r|sm): conditional probability density functions.

It is the probabilistic description of the channel.

Optimal Detection for the Vector

AWGN Channel (MAP Decision Rule)
hD
(MAP Decision Rule)
,P
h at
Ta
fA

AWGN Channel (ML Decision Rule)
ra
(ML Decision Rule)

sh
rA
D
also known as Minimum Distance decision rule.

Decision Region
 From MAP rule, the decision region Dm is:
hD
,P
 From ML rule, the decision region Dm is:
h at
Ta
fA
Decision Region
ra
 A geometric interpretation : The receiver receives r and looks

among all sm to find the one that is closest to r using standard
Euclidean distance.
sh
 Such a detector is called a nearest-neighbor, or minimum-distance,

detector.
 Since the signals are equiprobable, the MAP and the ML detector
coincide, and both are equivalent to the minimum-distance detector.
rA
 In this case, the boundaries of decisions Dm and Dm’ are the set of
points that are equidistant from sm and sm’ ,
 which is the perpendicular bisector of the line connecting these two
signal points.
 This boundary in general is a hyperplane.
D
 For the case of N = 2 the boundary is a line, and for N = 3 it is a

plane. These hyperplanes completely determine the decision
regions.

Decision Region
 An example of a two-dimensional constellation (N = 2) with four
signal points (M = 4) is shown.
 The solid lines denote the boundaries of the decision regions
hD
which are the perpendicular bisectors of the dashed lines
connecting the signal points.
,P
at
The decision regions for equiprobable signaling.
May 17, 2021

Ta
fA

AWGN Channel
ra
sh
rA
D


AWGN Channel
hD
,P
h at
Ta
fA
Realization of ML Rule
ra
sh
rA
D

Block diagram for the realization of the ML rule
hD
,P
h at
Ta
fA
Optimal Detection for Binary Antipodal Signaling

ra
sh
rA
D

Threshold Detection
hD
,P
-1
h at
Ta
fA
Error Probability of Binary Antipodal Signaling

ra
sh
rA
D

ML decision for Binary Antipodal

Signaling
hD
-1
,P
h at
Ta
fA
ra
sh
f(r/sm)
f(r/s2) f(r/s1)
rA
r
D
 Binary Signal Transmission Through a

Noisy Channel

Error Probability of Binary Antipodal Signaling
hD
,P
h at
Ta
fA
ra
sh
rA
D

Error Probability for Equiprobable Binary

Signaling Schemes
 If the transmitter transmits one of the two equiprobable signals s1(t)
hD
and s2(t) over the AWGN channel.
 And since the signals are equiprobable, the two decision regions are
separated by the perpendicular bisector of the line connecting s1
and s2.
 By symmetry, error probabilities when s1 or s2 is transmitted are
,P
equal. Therefore, Pb = P [error |s1 sent ].
at
The decision regions and the perpendicular
bisector of the line connecting s1 and s2
are shown.
May 17, 2021

Ta
fA

Signaling Schemes
ra
 Since we are assuming that s1 is sent, an error occurs if r is in D2,

which means the distance between the projection of r −s1 on s2−s1,
(i.e., point A, from s1 is larger than (d12/2 ), where d12 = ||s2 −s1|| )
sh
 Since s1 is sent, n = r −s1, and the projection of r −s1 on s2−s1

becomes equal to n ·(s2−s1)/d12 .
 Therefore, the error probability is given by:
rA
or
 We note that n · (s2−s1) is a zero-mean Gaussian random variable

with variance d212N0/2 ; therefore, we obtain:
D

Note:
hD
,P
h at
Ta
fA

Signaling Schemes
ra
 This is very general result and applies to all binary equiprobable

signaling systems regardless of the shape of the signals.
sh
 Since Q(·) is a decreasing function, in order to minimize the error

probability, the distance between signal points has to be maximized.
 The distance d12 can be obtained from:
rA
 In the special case that the binary signals have equal energy, we
have:
 where ρ is the cross-correlation coefficient between s1(t) and s2(t) .
D
 Since −1 ≤ ρ ≤ 1,
we observe that the binary signals are maximally separated when
ρ = −1, i.e., when the signals are antipodal.
 Then error probability of the system is minimized.

hD
,P
h at
Ta
fA
ra
sh
rA
D

Optimal Detection for Binary Orthogonal

Signaling
 For binary orthogonal signals we have:
hD
 Since the system is binary with equal energy, we have εb = ε
 And using :
,P
 The vector representations of the signal set become:
 For this signaling scheme
h at
Ta
fA
Binary Antipodal vs Orthogonal

ra
sh
rA
D

Error probability for binary Antipodal and

binary Orthogonal signaling
hD
,P
h at
Ta
fA
ra
sh
4.2-2 Implementation of the Optimal

Receiver for AWGN Channels
rA
D

Implementation of the Optimal Receiver for

AWGN Channels
 The different implementations of the optimal receiver for the AWGN
hD
channel presented here are for the MAP.
 All these structures are equivalent in performance and result in
minimum error probability.
 The underlying relation that is implemented by all these structures is
the optimal (MAP) decision rule for an AWGN vector channel is
,P
given as:
h at
Ta
fA
Implementation of the Optimal Receiver for

AWGN Channels
ra
 Recall that the optimal decision rule is expressed as:

sh
rA
 This suggests a correlation receiver.

 The first step to implement at the receiver is to derive r from the
D
received signal r (t). Using the relation

Correlation Receiver
 The receiver multiplies r (t) by each basis function φj (t) and
integrates the result to find all components of r.
hD
 Then, it finds the inner product of r with each sm, 1 ≤ m ≤ M,
 Finally, it adds the bias terms ηm and compares the results.
 It chooses the m that maximizes the result.
 Since the received signal r (t) is correlated with each φj (t), this
implementation of the optimal receiver is called a correlation
,P
receiver.
 Note that, ηm’s and sm’s are independent of the received signal r (t);
 They can be computed once and stored in a memory for later
access.
h at
Ta
fA
ra
sh
rA
D
t =T

 Another implementation of the optimal detector is
possible by noting that the optimal detection rule is
hD
equivalent to:
,P
 Therefore, r · sm can be directly found by
at
correlation of r (t) with sm(t)’s.
May 17, 2021

Ta
fA
ra
sh
rA
D
t =T

Matched Filter Receiver
 In both correlation receiver implementations, we
hD
compute quantities of the form:
 where x(t) is either φj (t) or sm(t).
,P
 If we define h(t) = x(T − t), where T is arbitrary,
 Then, consider a filter with impulse response h(t), this
filter is called a filter matched to x(t), or a matched filter.
h at
Ta
fA

ra
sh
rA
D

hD
,P
h at
Ta
fA

ra
sh
rA
D

Optimality of Matched Filter
hD
,P
h at
Ta
fA
Optimality of Matched Filter

ra
sh
=
rA
D

Example 4.2-1
 M = 4 biorthogonal signals are constructed from the two orthogonal
signals shown in the Figure for transmitting information over an AWGN
hD
channel.
 The noise is assumed to have zero mean and power spectral
density ½N0.
 Let us determine the basis functions for this signal set, the impulse
responses of the matched filter demodulators, and the output
,P
waveforms of the matched filter demodulators when the transmitted
signal is s1(t).
h at
Ta
fA
Example 4.2-1 (Cont.)

ra
 The M = 4 biorthogonal signals have dimensions N = 2. Hence, two

basis functions are needed to represent the signals. We choose
φ1(t) and φ2(t) as:
sh
rA
φ1(t) φ2(t)
D


 The impulse responses of the two matched filters are:
hD
,P
h at
Ta
fA

ra
 If s1(t) is transmitted, the (noise-free) responses of the two matched

filters are as shown in the Figure below.
sh
Since y1(t) and y2(t) are sampled at t = T , we observe that

rA
 Note that ½ A2T = ε, the signal energy.

 Hence, the received vector formed from the two matched filter
outputs at the sampling instant t = T is
D
 where n1 = y1n(T ) and n2 = y2n(T ) are the noise components at the

outputs of the matched filters.

hD
,P
h at
Ta
fA
ra
sh
rA
D


Week 10: 4.2-1 Optimal Detection For The Vector AWGN Channel 4.2-1 Optimal Detection For The Vector AWGN Channel

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Week 10: 4.2-1 Optimal Detection For The Vector AWGN Channel 4.2-1 Optimal Detection For The Vector AWGN Channel

Uploaded by

Copyright:

Available Formats

Dr. Ashraf Tahat, Ph.D.

Monday, May 17, 2021

May 17, 2021

4.2-1 Optimal Detection for the Vector

May 17, 2021 Dr. Ashraf A Tahat 2

Princess Sumaya University for

The AWGN Vector Channel

May 17, 2021

Pm : prior or apriori probabilities.

f (r|sm): conditional probability density functions.

May 17, 2021 Dr. Ashraf A Tahat 4

Princess Sumaya University for

Optimal Detection for the Vector

Optimal Detection for the Vector

(ML Decision Rule)

also known as Minimum Distance decision rule.

May 17, 2021 Dr. Ashraf A Tahat 6

Princess Sumaya University for

 A geometric interpretation : The receiver receives r and looks

 Such a detector is called a nearest-neighbor, or minimum-distance,

 For the case of N = 2 the boundary is a line, and for N = 3 it is a

Princess Sumaya University for

May 17, 2021

Optimal Detection for the Vector

May 17, 2021 Dr. Ashraf A Tahat 10

Princess Sumaya University for

Optimal Detection for the Vector

May 17, 2021 Dr. Ashraf A Tahat 12

Princess Sumaya University for

Block diagram for the realization of the ML rule

Optimal Detection for Binary Antipodal Signaling

May 17, 2021 Dr. Ashraf A Tahat 14

Princess Sumaya University for

Error Probability of Binary Antipodal Signaling

May 17, 2021 Dr. Ashraf A Tahat 16

Princess Sumaya University for

ML decision for Binary Antipodal

 Binary Signal Transmission Through a

Princess Sumaya University for

Error Probability of Binary Antipodal Signaling

May 17, 2021 Dr. Ashraf A Tahat 20

Princess Sumaya University for

Error Probability for Equiprobable Binary

May 17, 2021

Error Probability for Equiprobable Binary

 Since we are assuming that s1 is sent, an error occurs if r is in D2,

 Since s1 is sent, n = r −s1, and the projection of r −s1 on s2−s1

 We note that n · (s2−s1) is a zero-mean Gaussian random variable

May 17, 2021 Dr. Ashraf A Tahat 22

Princess Sumaya University for

Error Probability for Equiprobable Binary

 This is very general result and applies to all binary equiprobable

 Since Q(·) is a decreasing function, in order to minimize the error

Princess Sumaya University for

May 17, 2021 Dr. Ashraf A Tahat 26

Princess Sumaya University for

Optimal Detection for Binary Orthogonal

 For this signaling scheme

Binary Antipodal vs Orthogonal

May 17, 2021 Dr. Ashraf A Tahat 28

Princess Sumaya University for

Error probability for binary Antipodal and

4.2-2 Implementation of the Optimal