Communications Engineering

Chapter 4

Optimum Receivers for AWGN Channels

Thái Truyển Đại Chấn
4.1 WAVEFORM AND VECTOR CHANNEL MODELS
• Model for received signal passed through an AWGN channel

sm(t): the transmitted signal which (one of M possible signals);

n(t): zero-mean white Gaussian noise with power spectral density of N0/2;
r(t): the received waveform
4.1 WAVEFORM AND VECTOR CHANNEL MODELS
• The receiver observes r(t) and optimally decides which message m was sent.
• The probability of disagreement between the transmitted message m and the
detected message 𝑚:

• The decision must optimize Pe.

• Using an orthonormal basis {φj(t), 1 ≤ j ≤ N}, each signal sm(t) can be represented
by a vector sm ∈ RN.
• Any orthonormal basis can be used for expansion of a zero-mean white Gaussian
process[Example 2.8–1]
↔
4.1–1 Optimal Detection for a General Vector Channel

• Maximum a posteriori probability (MAP) rule

• Maximum-likelihood (ML) receiver

• Decision Region

• Symbol error probability and Bit error probability

• The Error Probability
4.1–1 Optimal Detection for a General Vector Channel
• The receiver observes r and based on this observation decides which message
was transmitted.
• The decision function

• The probability of a correct decision, given that r is received

• P[correct decision|r] = P[𝑚 sent|r ]
• The probability of a correct decision
• P[correct decision] = P[correct decision|r]p(r)dr
= P [𝑚 sent|r]p(r)dr
4.1–1 Optimal Detection for a General Vector Channel
• The probability of a correct decision
• P[correct decision] = P[correct decision|r]p(r)dr
= P [𝑚 sent|r]p(r)dr
• The optimal detection rule

 Maximum a posteriori probability (MAP) rule

4.1–1 Optimal Detection for a General Vector Channel

by conditional probability

p(r) is independent of m and for all m

remains the same

in case the messages are equiprobable a

priori (Pm = 1/M)
the likelihood of message m
Maximum-likelihood (ML) receiver
4.1–1 Optimal Detection for a General Vector Channel
• The Decision Regions
• Any detector partitions the output space RN into M regions (D1, D2,…, DM such
that if r ∈ Dm, then 𝑚 = g(r) = m.
s2

• Dm is the decision region for message m. s3 s1

• For a MAP detector we have

s4
4.1–1 Optimal Detection for a General Vector Channel
• The Decision Regions

s2 s1 s1

s1 s2 s3 s4
s2

s3 s4 s3 s4
4.1–1 Optimal Detection for a General Vector Channel
• The Error Probability
• When sm is transmitted, an error occurs when the received r is not in Dm.
• The symbol error probability:
(The message error probability)

s2

s3 s1

s4
4.1–1 Optimal Detection for a General Vector Channel
• Symbol error probability and Bit error probability
Can you analytically prove this?
𝑘
𝑘
𝑃𝑒 = 1 − 1 − 𝑃𝑏 𝑘 =1− (−1)𝑖 𝑃𝑏𝑖 ≤ 𝑘𝑃𝑏
𝑖
𝑖=0

When a symbol is wrong, not all of its bits are wrong (a smaller ratio).
When a symbol is wrong, more than 1 bit can be wrong.
4.1–1 Optimal Detection for a General Vector Channel
• The Error Probability
• The error probability when message m is transmitted:
4.1–1 Optimal Detection for a General Vector Channel
s‘2
• EXAMPLE 4.1–1 s2
• 2 equiprobable message signals s1 = (0, 0) and s2 = (1, 1)
s‘2
• The channel adds iid noise components n1 and n2 s1 s'1

s‘1

• Equiprobable  MAP detector = ML detector

 p(r = 1.7|sm = 1) = p(n = 0.7)
p(r = 0.7|sm = 0) = p(n = 0.7)

sm= 0 n = 0.7 sm= 1 n = 0.7

r = sm + n = 1.7
4.1–1 Optimal Detection for a General Vector Channel
• EXAMPLE 4.1–1
4.1–1 Optimal Detection for a General Vector Channel
• EXAMPLE 4.1–1