Performance of ML Receiver for Binary Signaling Saravanan - - PowerPoint PPT Presentation

performance of ml receiver for binary signaling
SMART_READER_LITE
LIVE PREVIEW

Performance of ML Receiver for Binary Signaling Saravanan - - PowerPoint PPT Presentation

Performance of ML Receiver for Binary Signaling Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 7, 2013 1 / 14 Real AWGN Channel M -ary Signaling in AWGN Channel


slide-1
SLIDE 1

Performance of ML Receiver for Binary Signaling

Saravanan Vijayakumaran sarva@ee.iitb.ac.in

Department of Electrical Engineering Indian Institute of Technology Bombay

October 7, 2013

1 / 14

slide-2
SLIDE 2

Real AWGN Channel

slide-3
SLIDE 3

M-ary Signaling in AWGN Channel

  • One of M continuous-time signals s1(t), . . . , sM(t) is transmitted
  • The received signal is the transmitted signal corrupted by real AWGN
  • M hypotheses with prior probabilities πi, i = 1, . . . , M

H1 : y(t) = s1(t) + n(t) H2 : y(t) = s2(t) + n(t) . . . . . . HM : y(t) = sM(t) + n(t)

  • If the prior probabilities are equal, ML decision rule is optimal
  • The ML decision rule is

δML(y) = argmin

1≤i≤M

y − si2 = argmax

1≤i≤M

y, si − si2 2

  • We want to study the performance of the ML decision rule

3 / 14

slide-4
SLIDE 4

ML Decision Rule for Binary Signaling

  • Consider the special case of binary signaling

H0 : y(t) = s0(t) + n(t) H1 : y(t) = s1(t) + n(t)

  • The ML decision rule decides H0 is true if

y, s0 − s02 2 > y, s1 − s12 2

  • The ML decision rule decides H1 is true if

y, s0 − s02 2 ≤ y, s1 − s12 2

  • The ML decision rule

y, s0 − s1

H0

  • H1

s02 2 − s12 2

  • The distribution of y, s0 − s1 is required to evaluate decision rule

performance

4 / 14

slide-5
SLIDE 5

Performance of ML Decision Rule for Binary Signaling

  • Let Z = y, s0 − s1
  • Z is a Gaussian random variable

Z = y, s0 − s1 = si, s0 − s1 + n, s0 − s1

  • The mean and variance of Z under H0 are

E[Z|H0] = s02 − s0, s1 var[Z|H0] = σ2s0 − s12 where σ2 is the PSD of n(t)

  • Probability of error under H0 is

Pe|0 = Pr

  • Z ≤ s02 − s12

2

  • H0
  • = Q

s0 − s1 2σ

  • 5 / 14
slide-6
SLIDE 6

Performance of ML Decision Rule for Binary Signaling

  • The mean and variance of Z under H1 are

E[Z|H1] = s1, s0 − s12 var[Z|H1] = σ2s0 − s12

  • Probability of error under H1 is

Pe|1 = Pr

  • Z > s02 − s12

2

  • H1
  • = Q

s0 − s1 2σ

  • The average probability of error is

Pe = Pe|0 + Pe|1 2 = Q s0 − s1 2σ

  • 6 / 14
slide-7
SLIDE 7

Different Types of Binary Signaling

  • Let Eb = 1

2

  • s02 + s12
  • For antipodal signaling, s1(t) = −s0(t)

Eb = s02 = s12 and s0 − s1 = 2s0 = 2s1 = 2√Eb Pe = Q √Eb σ

  • = Q
  • 2Eb

N0

  • where σ2 = N0

2

  • For on-off keying, s1(t) = s(t) and s0(t) = 0 and

Pe = Q

  • Eb

N0

  • For orthogonal signaling, s1(t) and s2(t) are orthogonal (s0, s1 = 0)

Pe = Q

  • Eb

N0

  • 7 / 14
slide-8
SLIDE 8

Performance Comparison of Antipodal and Orthogonal Signaling

2 4 6 8 10 12 14 16 18 20 10−9 10−7 10−5 10−3 10−1

Eb N0 (dB)

Pe Orthogonal Antipodal

8 / 14

slide-9
SLIDE 9

Optimal Choice of Signal Pair

  • For any s0(t) and s1(t), the probability of error of the ML decision rule is

Pe = Q s0 − s1 2σ

  • How to chose s0(t) and s1(t) to minimize Pe?
  • If Eb is not fixed, the problem is ill-defined
  • For a given Eb, we have

Pe = Q  

  • s0 − s12

2N0   = Q  

  • Eb(1 − ρ)

N0   where ρ = s0, s1 Eb , − 1 ≤ ρ ≤ 1

  • ρ = −1 for antipodal signaling, s0(t) = −s1(t)
  • Any pair of antipodal signals is the optimal choice

9 / 14

slide-10
SLIDE 10

Complex AWGN Channel

slide-11
SLIDE 11

ML Rule for Complex Baseband Binary Signaling

  • Consider binary signaling in the complex AWGN channel

H0 : y(t) = s0(t) + n(t) H1 : y(t) = s1(t) + n(t) where y(t) Complex envelope of received signal si(t) Complex envelope of transmitted signal under Hi n(t) Complex white Gaussian noise with PSD N0 = 2σ2

  • n(t) = nc(t) + jns(t) where nc(t) and ns(t) are independent WGN with

PSD σ2

  • The ML decision rule is

Re (y, s0) − s02 2

H0

  • H1

Re (y, s1) − s12 2 Re (y, s0 − s1)

H0

  • H1

s02 − s12 2

  • The distribution of Re (y, s0 − s1) is required to evaluate decision rule

performance

11 / 14

slide-12
SLIDE 12

Performance of ML Rule for Complex Baseband Binary Signaling

  • Let Z = Re (y, s0 − s1)
  • Z is a Gaussian random variable

Z = Re (y, s0 − s1) = yc, s0,c − s1,c + ys, s0,s − s1,s = si,c + nc, s0,c − s1,c + si,s + ns, s0,s − s1,s = si,c, s0,c − s1,c + nc, s0,c − s1,c +si,s, s0,s − s1,s + ns, s0,s − s1,s

  • The mean and variance of Z under H0 are

E[Z|H0] = s0,c2 + s0,s2 − s0,c, s1,c − s0,s, s1,s = s02 − Re (s0, s1) var[Z|H0] = σ2s0,c − s1,c2 + σ2s0,s − s1,s2 = σ2s0 − s12

  • Probability of error under H0 is

Pe|0 = Pr

  • Z ≤ s02 − s12

2

  • H0
  • = Q

s0 − s1 2σ

  • 12 / 14
slide-13
SLIDE 13

Performance of ML Rule for Complex Baseband Binary Signaling

  • The mean and variance of Z under H1 are

E[Z|H1] = s1,c, s0,c + s1,s, s0,s − s1,c2 − s1,s2 = Re (s1, s0) − s12 var[Z|H1] = σ2s0,c − s1,c2 + σ2s0,s − s1,s2 = σ2s0 − s12

  • Probability of error under H1 is

Pe|1 = Pr

  • Z > s02 − s12

2

  • H1
  • = Q

s0 − s1 2σ

  • The average probability of error is

Pe = Pe|0 + Pe|1 2 = Q s0 − s1 2σ

  • 13 / 14
slide-14
SLIDE 14

Thanks for your attention

14 / 14