PSD of Digitally Modulated Signals Saravanan Vijayakumaran - - PowerPoint PPT Presentation

psd of digitally modulated signals
SMART_READER_LITE
LIVE PREVIEW

PSD of Digitally Modulated Signals Saravanan Vijayakumaran - - PowerPoint PPT Presentation

PSD of Digitally Modulated Signals Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay 1 / 30 Digital Modulation Digital Modulation Definition The process of mapping a bit


slide-1
SLIDE 1

PSD of Digitally Modulated Signals

Saravanan Vijayakumaran sarva@ee.iitb.ac.in

Department of Electrical Engineering Indian Institute of Technology Bombay

1 / 30

slide-2
SLIDE 2

Digital Modulation

slide-3
SLIDE 3

Digital Modulation

Definition

The process of mapping a bit sequence to signals for transmission over a channel.

Information Source Source Encoder Channel Encoder Modulator Channel Demodulator Channel Decoder Source Decoder Information Destination

3 / 30

slide-4
SLIDE 4

Digital Modulation

Example (Binary Baseband PAM)

1 → p(t) and 0 → −p(t)

t A p(t) t −A −p(t)

4 / 30

slide-5
SLIDE 5

Classification of Modulation Schemes

  • Memoryless
  • Divide bit sequence into k-bit blocks
  • Map each block to a signal sm(t), 1 ≤ m ≤ 2k
  • Mapping depends only on current k-bit block
  • Having Memory
  • Mapping depends on current k-bit block and L − 1 previous blocks
  • L is called the constraint length
  • Linear
  • Complex baseband representation of transmitted signal has the

form u(t) =

  • n

bng(t − nT) where bn’s are the transmitted symbols and g is a fixed baseband waveform

  • Nonlinear

5 / 30

slide-6
SLIDE 6

PSD Definition for Linearly Modulated Signals

slide-7
SLIDE 7

PSD Definition for Linearly Modulated Signals

  • Consider a real binary PAM signal

u(t) =

  • n=−∞

bng(t − nT) where bn = ±1 with equal probability and g(t) is a baseband pulse of duration T

  • PSD = F [Ru(τ)] Neither SSS nor WSS

7 / 30

slide-8
SLIDE 8

Cyclostationary Random Process

Definition (Cyclostationary RP)

A random process X(t) is cyclostationary with respect to time interval T if it is statistically indistinguishable from X(t − kT) for any integer k.

Definition (Wide Sense Cyclostationary RP)

A random process X(t) is wide sense cyclostationary with respect to time interval T if the mean and autocorrelation functions satisfy mX(t) = mX(t − T) for all t, RX(t1, t2) = RX(t1 − T, t2 − T) for all t1, t2.

8 / 30

slide-9
SLIDE 9

Power Spectral Density of a Cyclostationary Process

To obtain the PSD of a cyclostationary process with period T

  • Calculate autocorrelation of cyclostationary process

RX(t, t − τ)

  • Average autocorrelation between 0 and T,

RX(τ) = 1

T

T

0 RX(t, t − τ) dt

  • Calculate Fourier transform of averaged autocorrelation

RX(τ)

9 / 30

slide-10
SLIDE 10

Power Spectral Density of a Realization

Time windowed realizations have finite energy xTo(t) = x(t)I[− To

2 , To 2 ](t)

STo(f) = F(xTo(t)) ˆ Sx(f) = |STo(f)|2 To (PSD Estimate)

PSD of a realization

¯ Sx(f) = lim

To→∞

|STo(f)|2 To |STo(f)|2 To ↔ 1 To

  • To

2

− To

2

xTo(u)x∗

To(u − τ) du = ˆ

Rx(τ)

10 / 30

slide-11
SLIDE 11

Power Spectral Density of a Cyclostationary Process

X(t)X ∗(t − τ) ∼ X(t + T)X ∗(t + T − τ) for cyclostationary X(t) ˆ Rx(τ) = 1 To

  • To

2

− To

2

x(t)x∗(t − τ) dt = 1 KT

  • KT

2

− KT

2

x(t)x∗(t − τ) dt (for To = KT) = 1 T T 1 K

K 2 −1

  • k=− K

2

x(t + kT)x∗(t + kT − τ) dt (for even K) − →

K→∞

1 T T E [X(t)X ∗(t − τ)] dt = 1 T T RX(t, t − τ) dt = RX(τ) PSD of a cyclostationary process = F[RX(τ)]

11 / 30

slide-12
SLIDE 12

PSD of a Linearly Modulated Signal

  • Consider

u(t) =

  • n=−∞

bnp(t − nT)

  • u(t) is cyclostationary wrt to T if {bn} is stationary
  • u(t) is wide sense cyclostationary wrt to T if {bn} is WSS
  • Suppose Rb[k] = E[bnb∗

n−k]

  • Let Sb(z) = ∞

k=−∞ Rb[k]z−k

  • The PSD of u(t) is given by

Su(f) = Sb

  • e j2πfT |P(f)|2

T

12 / 30

slide-13
SLIDE 13

PSD of a Linearly Modulated Signal

Ru(τ) = 1 T T Ru(t + τ, t) dt = 1 T T

  • n=−∞

  • m=−∞

E [bnb∗

mp(t − nT + τ)p∗(t − mT)] dt

= 1 T

  • k=−∞

  • m=−∞

−(m−1)T

−mT

E [bm+kb∗

mp(λ − kT + τ)p∗(λ)] dλ

= 1 T

  • k=−∞

−∞

E [bm+kb∗

mp(λ − kT + τ)p∗(λ)] dλ

= 1 T

  • k=−∞

Rb[k] ∞

−∞

p(λ − kT + τ)p∗(λ) dλ

13 / 30

slide-14
SLIDE 14

PSD of a Linearly Modulated Signal

Ru(τ) = 1 T

  • k=−∞

Rb[k] ∞

−∞

p(λ − kT + τ)p∗(λ) dλ ∞

−∞

p(λ + τ)p∗(λ) dλ ↔ |P(f)|2 ∞

−∞

p(λ − kT + τ)p∗(λ) dλ ↔ |P(f)|2e −j2πfkT Su(f) = F [Ru(τ)] = |P(f)|2 T

  • k=−∞

Rb[k]e −j2πfkT = Sb

  • e j2πfT |P(f)|2

T where Sb(z) = ∞

k=−∞ Rb[k]z−k. 14 / 30

slide-15
SLIDE 15

PSD of Line Codes

slide-16
SLIDE 16

Line Codes

1 1 1 1 1 1 1 Unipolar NRZ Polar NRZ Bipolar NRZ Manchester

Further reading: Digital Communications, Simon Haykin, Chapter 6

16 / 30

slide-17
SLIDE 17

Unipolar NRZ

  • Symbols independent and equally likely to be 0 or A

P (b[n] = 0) = P (b[n] = A) = 1 2

  • Autocorrelation of b[n] sequence

Rb[k] =     

A2 2

k = 0

A2 4

k = 0

  • p(t) = I[0,T)(t) ⇒ P(f) = Tsinc(fT)e −jπfT
  • Power Spectral Density

Su(f) = |P(f)|2 T

  • k=−∞

Rb[k]e −j2πkfT

17 / 30

slide-18
SLIDE 18

Unipolar NRZ

Su(f) = A2T 4 sinc2(fT) + A2T 4 sinc2(fT)

  • k=−∞

e −j2πkfT = A2T 4 sinc2(fT) + A2 4 sinc2(fT)

  • n=−∞

δ

  • f − n

T

  • =

A2T 4 sinc2(fT) + A2 4 δ(f)

18 / 30

slide-19
SLIDE 19

Normalized PSD plot

0.5 1 1.5 2 0.5 1 fT

Su(f) A2T

Unipolar NRZ

19 / 30

slide-20
SLIDE 20

Polar NRZ

  • Symbols independent and equally likely to be −A or A

P (b[n] = −A) = P (b[n] = A) = 1 2

  • Autocorrelation of b[n] sequence

Rb[k] =    A2 k = 0 k = 0

  • P(f) = Tsinc(fT)e −jπfT
  • Power Spectral Density

Su(f) = A2Tsinc2(fT)

20 / 30

slide-21
SLIDE 21

Normalized PSD plots

0.5 1 1.5 2 0.5 1 fT

Su(f) A2T

Unipolar NRZ Polar NRZ

21 / 30

slide-22
SLIDE 22

Manchester

  • Symbols independent and equally likely to be −A or A

P (b[n] = −A) = P (b[n] = A) = 1 2

  • Autocorrelation of b[n] sequence

Rb[k] =    A2 k = 0 k = 0

  • P(f) = jTsinc

fT

2

  • sin

πfT

2

  • e−jπfT
  • Power Spectral Density

Su(f) = A2Tsinc2 fT 2

  • sin2

πfT 2

  • 22 / 30
slide-23
SLIDE 23

Normalized PSD plots

0.5 1 1.5 2 0.5 1 fT

Su(f) A2T

Unipolar NRZ Polar NRZ Manchester

23 / 30

slide-24
SLIDE 24

Bipolar NRZ

  • Successive 1’s have alternating polarity

→ Zero amplitude 1 → +A or − A

  • Probability mass function of b[n]

P (b[n] = 0) = 1 2 P (b[n] = −A) = 1 4 P (b[n] = A) = 1 4

  • Symbols are identically distributed but they are not independent

24 / 30

slide-25
SLIDE 25

Bipolar NRZ

  • Autocorrelation of b[n] sequence

Rb[k] =    A2/2 k = 0 − A2/4 k = ±1

  • therwise
  • Power Spectral Density

Su(f) = Tsinc2(fT) A2 2 − A2 4

  • e j2πfT + e −j2πfT

= A2T 2 sinc2(fT) [1 − cos(2πfT)] = A2Tsinc2(fT) sin2(πfT)

25 / 30

slide-26
SLIDE 26

Normalized PSD plots

0.5 1 1.5 2 0.5 1 fT

Su(f) A2T

Unipolar NRZ Polar NRZ Manchester Bipolar NRZ

26 / 30

slide-27
SLIDE 27

PSD of Passband Modulated Signals

slide-28
SLIDE 28

Relating the PSDs of a Passband Modulated Signal and its Complex Envelope

  • Definitions
  • sp(t) is a passband signal realization with complex envelope s(t)
  • For observation interval To, ˆ

sp(t) = sp(t)I

− To

2 , To 2

(t)

  • ˆ

sp(t) has complex envelope ˆ s(t)

  • ˆ

sp(t) ↔ ˆ Sp(f) and ˆ s(t) ↔ ˆ S(f)

  • PSD approximations for sp(t) and s(t)

Ssp(f) ≈

  • ˆ

Sp(f)

  • 2

To , Ss(f) ≈

  • ˆ

S(f)

  • 2

To

  • From the relationship between the deterministic signals

ˆ Sp(f) = 1 √ 2

  • ˆ

S(f − fc) + ˆ S∗(−f − fc)

  • Since ˆ

S(f − fc) and ˆ S∗(−f − fc) do not overlap, we have

  • ˆ

Sp(f)

  • 2

= 1 2

  • ˆ

S(f − fc)

  • 2

+

  • ˆ

S∗(−f − fc)

  • 2

28 / 30

slide-29
SLIDE 29

Relating the PSDs of a Passband Modulated Signal and its Complex Envelope

  • Dividing by To
  • ˆ

Sp(f)

  • 2

To = 1 2   

  • ˆ

S(f − fc)

  • 2

To +

  • ˆ

S∗(−f − fc)

  • 2

To   

  • As the observation interval To → ∞, we get

Ssp(f) = 1 2 [Ss(f − fc) + Ss(−f − fc)]

  • By a similar argument, we get

Ss(f) = 2Ssp(f + fc)u(f + fc)

29 / 30

slide-30
SLIDE 30

References

  • Section 2.5, Fundamentals of Digital Communication,

Upamanyu Madhow, 2008

  • Section 2.3.1, Fundamentals of Digital Communication,

Upamanyu Madhow, 2008

  • Chapter 6, Digital Communications, Simon Haykin, 2006

30 / 30