Lecture 02 Digital Modulation I-Hsiang Wang ihwang@ntu.edu.tw - - PowerPoint PPT Presentation

lecture 02 digital modulation
SMART_READER_LITE
LIVE PREVIEW

Lecture 02 Digital Modulation I-Hsiang Wang ihwang@ntu.edu.tw - - PowerPoint PPT Presentation

Principle of Communications, Fall 2017 Lecture 02 Digital Modulation I-Hsiang Wang ihwang@ntu.edu.tw National Taiwan University 2017/9/14, 9/21, 9/27 Outline Digital-to-analog and analog-to-digital: a signal space perspective


slide-1
SLIDE 1

Principle of Communications, Fall 2017

Lecture 02 Digital Modulation

I-Hsiang Wang

ihwang@ntu.edu.tw National Taiwan University 2017/9/14, 9/21, 9/27

slide-2
SLIDE 2

Outline

  • Digital-to-analog and analog-to-digital: a signal space perspective
  • Pulse amplitude modulation (PAM), pulse shaping, and the Nyquist criterion
  • Quadrature amplitude modulation (QAM), and the equivalent complex baseband

representation

  • Symbol mapping and constellation set

2

slide-3
SLIDE 3

System architecture of digital modulation

  • Three major components (for the Tx):
  • Symbol mapping: bit sequence → symbol sequence
  • Pulse shaping: symbol sequence → (baseband) waveform
  • Up conversion: baseband waveform → passband waveform

3

passband waveform

Symbol Mapper Pulse Shaper Sampler + Filter Symbol Demapper

discrete sequence

Up Converter Down Converter

baseband waveform

Noisy Channel coded bits

{ci} {ˆ ci}

{um} {ˆ um} xb(t) yb(t)

y(t) x(t)

slide-4
SLIDE 4

Symbol mapping

  • To be designed: the constellation set and how to map bits to symbols
  • Constellation sets to be covered: standard PSK, standard PAM, standard QAM
  • Mapping: Gray mapping

4

passband waveform

Symbol Mapper Pulse Shaper Sampler + Filter Symbol Demapper

discrete sequence

Up Converter Down Converter

baseband waveform

Noisy Channel coded bits

{ci} {ˆ ci}

{um} {ˆ um} xb(t) yb(t)

y(t) x(t)

slide-5
SLIDE 5

Conversion between sequence and waveform

  • A pragmatic approach: Pulse Amplitude Modulation (PAM)
  • To be designed: the modulating pulse
  • System parameter: bandwidth
  • Nyquist criterion: a sufficient condition for the pulse to satisfy in order to avoid

aliasing effect

5

passband waveform

Symbol Mapper Pulse Shaper Sampler + Filter Symbol Demapper

discrete sequence

Up Converter Down Converter

baseband waveform

Noisy Channel coded bits

{ci} {ˆ ci}

{um} {ˆ um} xb(t) yb(t)

y(t) x(t)

slide-6
SLIDE 6

Conversion between basedband and passband

  • A pragmatic approach: Quadrature Amplitude Modulation (QAM)
  • Essentially speaking, PAM with two branches:
  • ne mixed with cosine, the other with sine
  • system parameter: carrier frequency
  • Equivalent complex baseband representation

6

passband waveform

Symbol Mapper Pulse Shaper Sampler + Filter Symbol Demapper

discrete sequence

Up Converter Down Converter

baseband waveform

Noisy Channel coded bits

{ci} {ˆ ci}

{um} {ˆ um} xb(t) yb(t)

y(t) x(t)

slide-7
SLIDE 7

7

Part I. Signal Space

A Linear Algebraic Point to View for the Conversion between Sequences and Waveforms

slide-8
SLIDE 8

8

Fourier series for time-limited signals

x(t) → x[m] Analysis (waveform → sequence) Synthesis (sequence → waveform) x[m] → x(t) x[m] = 1 T

  • T

x(t)e− j2πm

T

t dt

x(t) =

  • m=−∞

x[m]ej 2πm

T

t

x[m] = ∞

−∞

x(t) 1 √ T e− j2πm

T

t dt

x(t) =

  • m=−∞

x[m] 1 √ T ej 2πm

T

t

φm ≡ φm(t) 1 √ T exp(j2π T mt), m ∈ Z, Fourier Basis:

φ∗

m(t)

φm(t)

slide-9
SLIDE 9

9

Sampling theorem for band-limited signals

x(t) → x[m] Analysis (waveform → sequence) Synthesis (sequence → waveform) x[m] → x(t) Sinc Basis:

φ∗

m(t)

φm(t)

x[m] = x(t)|t= m

2W = x

m 2W

  • x(t) =

  • m=−∞

x[m] sinc(2Wt − m) x[m] = 1 √ 2W x(m/2W) x(t) =

  • m=−∞

x[m] √ 2Wsinc(2Wt − m) = ∞

−∞

x(t) √ 2Wsinc(2Wt − m) dt

check!

φm ≡ φm(t) √ 2Wsinc(2Wt − m), m ∈ Z

slide-10
SLIDE 10

Signal space intrepretation

10

x(t) → x[m] waveform → sequence sequence → waveform x[m] → x(t) {x[m]} → {φm(t)} → x(t) =

  • m=−∞

x[m]φm(t) x(t) → φm(t) → x[m] = ∞

−∞

x(t)φ∗

m(t) dt

slide-11
SLIDE 11

Signal space intrepretation

11

x(t) → x[m] waveform → sequence sequence → waveform x[m] → x(t) {x[m]} → {φm} → x =

  • m=−∞

x[m]φm

expansion over an

  • rthonormal basis

x φm x[m] = x, φm

projection onto an

  • rthonormal basis

waveform ⟷ vectors integration ⟷ inner product

u, v ∞

−∞

u(t)v∗(t) dt x(t) x

slide-12
SLIDE 12

12

Part II. Pulse Amplitude Modulation

A pragmatic approach to convert symbols to baseband waveforms and back

slide-13
SLIDE 13

Modulation basis as time-shifted pulses

  • T = 1/2W : transmission interval
  • W : operational bandwidth
  • Desired properties of the pulse function p(t):
  • Time-limited (approximately)
  • Band-limited

13

Pulse Shaper {um} xb(t) xb(t) =

  • m=−∞

um p(t − mT). φm(t) = p(t − mT), T = 1 2W {um} → {φm(t)} → xb(t)

slide-14
SLIDE 14

PAM modulation and demodulation

  • Key question: how to design the pulse p(t) and the filter q(t)?

14

yb(t) Filter q(t) T =

1 2W

ˆ um = ∞

−∞

yb(τ)q(mT − τ) dτ Pulse Shaper {um} xb(t)

xb(t) =

  • m=−∞

um p(t − mT).

slide-15
SLIDE 15

ISI-free condition when the channel is perfect

15

yb(t) Filter q(t) T =

1 2W

ˆ um = ∞

−∞

yb(τ)q(mT − τ) dτ Pulse Shaper {um} xb(t)

xb(t) =

  • m=−∞

um p(t − mT). xb(t) xb(τ)

Want: ˆ um = um, ∀ m.

g(t) (p ∗ q)(t)

A sufficient condition: g(ˆ kT) =

  • if ˆ

k = 0 1 if ˆ k = 0

ˆ um = (xb ∗ q)(mT) =

  • k=−∞

uk g(mT − kT) =

  • k=−∞

uk g((m − k)T))

slide-16
SLIDE 16

T rect(Tf) =

  • m

˘ g

  • f − m

T

  • rect(Tf)

Ideal Nyquist and the Nyquist criterion

16

A sufficient condition (in time domain) g(ˆ kT) =

  • if ˆ

k = 0 1 if ˆ k = 0 An equivalent condition (in frequency domain)

f 1

rect(f)

1 2

− 1

2

slide-17
SLIDE 17

Nyquist criterion

17

Excessive bandwidth: Bb − W ← this should not be too large Typical choice: W ≤ Bb ≤ 2W T rect(Tf) =

  • m

˘ g

  • f − m

T

  • rect(Tf)

˘ g(f) f

1 2T ≡ W

− 1

2T ≡ −W

T ≡

1 2W

˘ g(f − m/T) ˘ g(f + m/T)

· · · · · · · · · · · ·

1

slide-18
SLIDE 18

⇐ ⇒

  • Re {˘

g(W − ∆)} + Re {˘ g(W + ∆)} = T Im {˘ g(W − ∆)} = Im {˘ g(W + ∆)} , ∀ ∆ ∈ [0, W] ˆ g(f) T

✟ ✟ ✯

T − ˆ g(Wb−∆) f ˆ g(Wb+∆)

✟ ✟ ✙

Wb Bb

T − Re{˘ g(W − ∆)} Re{˘ g(W + ∆)} Re{˘ g(f)} W

˘ g∗(W − ∆) + ˘ g(W + ∆) = T, ∀ ∆ ∈ [0, W]

Band-edge symmetry

18

When taking the typical choice: W ≤ Bb ≤ 2W the Nyquist criterion can be simplified to the following band-edge symmetry:

slide-19
SLIDE 19

Excessive bandwidth and rolloff factor

19

Excessive bandwidth: Bb − W Rolloff factor: Bb W − 1

ˆ g(f) T

✟ ✟ ✯

T − ˆ g(Wb−∆) f ˆ g(Wb+∆)

✟ ✟ ✙

Wb Bb

T − Re{˘ g(W − ∆)} Re{˘ g(W + ∆)} Re{˘ g(f)} W

slide-20
SLIDE 20

gβ(t) =

  • π

4 sinc

  • 1

  • ,

if |t| = T

sinc t

T

cos( πβt

T )

1−4 β2t2

T 2

,

  • therwise

Raised cosine pulse

20

time domain rolloff factor = β

β = 0 β = 0.3 β = 0.5

Decay to zero with speed ∼ 1 t3 as t → ∞ when β > 0

slide-21
SLIDE 21

Raised cosine pulse

21

frequency domain rolloff factor = β

β = 0 β = 0.3 β = 0.5

The larger it is, the smoother it transits from T to 0 in the frequency domain, and hence converges to zero faster in the time domain.

˘ gβ(f) =      T if |f| ≤ 1−β

2T

if |f| > 1+β

2T

T cos2( πT

2β (|f| − 1−β 2T ))

if 1−β

2T < |f| ≤ 1+β 2T

slide-22
SLIDE 22
  • A theorem:
  • The principle of designing p(t) and q(t)
  • If p(t) ∈ R (which is normally the case), then ˘

q(f) = ˘ p∗(f) = ˘ p(−f) and hence q(t) = p(−t). Choose ˘ q(f) = ˘ p∗(f) Choose ˘ p(f) such that |ˆ p(f)|2 satisfies the Nyquist Criterion |˘ p(f)|2 satisfies the Nyquist Criterion

Choosing the shifted pulses as an orthonormal set

22

{p(t − mT) : m ∈ Z} form an orthonormal set ⇐ ⇒ For faster decay in the time-domain (less approximation error) in t = ⇒ need "larger room" for smoother transition from T to 0 in the frequency domain.

slide-23
SLIDE 23

23

Part III. Quadrature Amplitude Modulation

A pragmatic approach to convert baseband to passband waveforms and back

slide-24
SLIDE 24
  • We want to shift baseband signals to passband with center frequency fc:
  • Recall the frequency-shift property of Fourier Transform:
  • So, a naive way is to multiply the signal by a complex sinusoid
  • But, at this point we don’t know how to implement a complex signal in real world
  • We can take the real part after multiplying with the complex sinusoid:
  • But this is a waste of spectrum.

         Re{˘ s(f)} = Re{˘ s(−f)} Im{˘ s(f)} = −Im{˘ s(−f)} |˘ s(f)| = |˘ s(−f)| ∠˘ s(f) = −∠˘ s(−f) mod 2π

exp(j2πf0t)s(t)

F

← → ˘ s(f − f0)

24

How to shift the frequency response?

Re {exp(j2πf0t)s(t)} = s(t) cos(2πfct) s(t) ∈ R

real part imaginary part

slide-25
SLIDE 25

Two degrees of freedom for complex signal

  • Why not multiplex two individual baseband waveforms?
  • Quadrature amplitude modulation (QAM):

25

x(t) = x(I)

b (t)

√ 2 cos(2πfct) − x(Q)

b

(t) √ 2 sin(2πfct)

PAM p(t) √ 2 cos(2πfct) PAM p(t) − √ 2 sin(2πfct) {u(Q)

m }

{u(I)

m }

x(I)

b (t)

x(Q)

b

(t)

x(t)

slide-26
SLIDE 26

QAM modulation: real-domain implementation

26

x(t) = x(I)

b (t)

√ 2 cos(2πfct) − x(Q)

b

(t) √ 2 sin(2πfct)

PAM p(t) √ 2 cos(2πfct) PAM p(t) − √ 2 sin(2πfct) {u(Q)

m }

{u(I)

m }

x(I)

b (t)

x(Q)

b

(t)

x(t)

in-phase component quadrature component

slide-27
SLIDE 27

QAM modulation: equivalent complex

27

xb(t) x(I)

b (t) + jx(Q) b

(t) um u(I)

m + ju(Q) m

PAM p(t)

x(t)

{um} xb(t) √ 2 exp(j2πfct) Re{·}

x(t) = x(I)

b (t)

√ 2 cos(2πfct) − x(Q)

b

(t) √ 2 sin(2πfct) = √ 2Re {xb(t) exp(j2πfct)}

slide-28
SLIDE 28

Up conversion

28

PAM p(t) √ 2 cos(2πfct) PAM p(t) − √ 2 sin(2πfct) {u(Q)

m }

{u(I)

m }

x(I)

b (t)

x(Q)

b

(t)

x(t)

PAM p(t)

x(t)

{um} xb(t) √ 2 exp(j2πfct) Re{·}

slide-29
SLIDE 29
  • Re{˘

x(I)

b (f)}

  • Im{˘

x(Q)

b

(f)}

1 1

29

PAM p(t) √ 2 cos(2πfct) PAM p(t) − √ 2 sin(2πfct) {u(Q)

m }

{u(I)

m }

x(I)

b (t)

x(Q)

b

(t)

x(t)

PAM p(t)

x(t)

{um} xb(t) √ 2 exp(j2πfct) Re{·}

Re{ˆ xb(f)}

  • 1
slide-30
SLIDE 30

2

≈ ≈ ≈

  • 1

√ 2 1 √ 2

Real part Real part

30

PAM p(t) √ 2 cos(2πfct) PAM p(t) − √ 2 sin(2πfct) {u(Q)

m }

{u(I)

m }

x(I)

b (t)

x(Q)

b

(t)

x(t)

PAM p(t)

x(t)

{um} xb(t) √ 2 exp(j2πfct) Re{·}

Real part

√ 2 cos(2πfct) = 1 √ 2

  • ej2πfct + e−j2πfct

− √ 2 sin(2πfct) = j √ 2

  • ej2πfct − e−j2πfct
slide-31
SLIDE 31

Re{s(t)}

F

← → 1 2(˘ s(f) + ˘ s∗(−f))

≈ ≈ ≈

  • 1

√ 2 1 √ 2

Real part Real part

31

PAM p(t) √ 2 cos(2πfct) PAM p(t) − √ 2 sin(2πfct) {u(Q)

m }

{u(I)

m }

x(I)

b (t)

x(Q)

b

(t)

x(t)

PAM p(t)

x(t)

{um} xb(t) √ 2 exp(j2πfct) Re{·}

  • 1

√ 2

Real part

slide-32
SLIDE 32

32

Down conversion

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

slide-33
SLIDE 33

33

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

  • 1

√ 2

  • 1

√ 2

  • 1

√ 2

Real part

slide-34
SLIDE 34

1 Real part

34

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

  • 1

√ 2

Imaginary part

1 Real part

√ 2 cos(2πfct) = 1 √ 2

  • ej2πfct + e−j2πfct

− √ 2 sin(2πfct) = j √ 2

  • ej2πfct − e−j2πfct
slide-35
SLIDE 35

  • 1

Imaginary part

  • 1

Real part

35

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

  • 1

√ 2

Real part

√ 2 cos(2πfct) = 1 √ 2

  • ej2πfct + e−j2πfct

− √ 2 sin(2πfct) = j √ 2

  • ej2πfct − e−j2πfct
slide-36
SLIDE 36

  • 1

Im{˘ y(Q)

b

(f)}

  • 1

Re{˘ y(I)

b (f)}

36

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

  • 1

√ 2

Real part

slide-37
SLIDE 37

  • 1

√ 2

37

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

Real part

  • 1

Im{˘ y(Q)

b

(f)}

  • 1

Re{˘ y(I)

b (f)}

slide-38
SLIDE 38

Re{˘ yb(f)}

  • 1

38

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct)

  • 1

Re{ˆ y(I)

b (f)}

  • 1

Im{ˆ y(Q)

b

(f)}

slide-39
SLIDE 39

39

QAM demodulation

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) Filter q(t) Filter q(t) T =

1 2W

T =

1 2W

{ˆ u(Q)

m }

{ˆ u(I)

m }

LPF 1 {|f| ≤ Bb} LPF 1 {|f| ≤ Bb} y(I)

b (t)

y(Q)

b

(t)

y(t)

Step Filter 1 {f ≥ 0} yb(t) √ 2 exp(−j2πfct) Filter q(t) T =

1 2W

{ˆ um}

merge

slide-40
SLIDE 40

40

QAM demodulation

y(t)

√ 2 cos(2πfct) − √ 2 sin(2πfct) Filter q(t) Filter q(t) T =

1 2W

T =

1 2W

{ˆ u(Q)

m }

{ˆ u(I)

m }

slide-41
SLIDE 41

Passband expansion

  • In summary, under QAM, the transmitted waveform is
  • Identify
  • Rewrite

41

x(t) = x(I)

b (t)

√ 2 cos(2πfct) − x(Q)

b

(t) √ 2 sin(2πfct) =

  • m

u(I)

m p(t − mT)

√ 2 cos(2πfct) −

  • k

u(Q)

k

p(t − kT) √ 2 sin(2πfct).

ψ(I)

m (t)

ψ(Q)

m (t)

p(t − mT) ← → φm(t) p(t − mT) √ 2 cos(2πfct) ← → ψ(I)

m (t)

−p(t − mT) √ 2 sin(2πfct) ← → ψ(Q)

m (t)

x(t) =

  • m

u(I)

m ψ(I) m (t) + u(Q) m ψ(Q) m (t). ← is this an orthonormal expansion?

slide-42
SLIDE 42

Passband expansion

42

Theorem

Consider an orthonormal set of waveforms {φm(t) : m ∈ Z}. Assume the Fourier transform exists for each φm(t) and is band-limited, that is, ˘ φm(f) = 0, ∀ |f| > Bb. Then for a center frequency fc > Bb, {ψ(I)

m (t), ψ(Q) m (t) | m ∈ Z} also form an

  • rthonormal set, where

ψ(I)

m (t) φm(t)

√ 2 cos(2πfct), ψ(Q)

m (t) −φm(t)

√ 2 sin(2πfct).

In words, a baseband orthonormal basis remains orthonormal after up conversion

slide-43
SLIDE 43

43

Part IV. Constellation Set and Symbol Mapping

Standard PAM, QAM, and PSK constellations Gray mapping

slide-44
SLIDE 44

Symbol mapping

  • To be designed: the constellation set and how to map bits to symbols
  • A standard way:

44

passband waveform

Symbol Mapper Pulse Shaper Sampler + Filter Symbol Demapper

discrete sequence

Up Converter Down Converter

baseband waveform

Noisy Channel coded bits

{ci} {ˆ ci}

{um} {ˆ um} xb(t) yb(t)

y(t) x(t)

group bits and map them to a symbol in a constellation set A (c1, c2, . . . , c)

  • u A {a1, a2, . . . , aM}
slide-45
SLIDE 45

45

0010001111001010000100001110 Coded bit sequence = 4 Grouping 0010 0011 1100 1010 0001 0000 1110 Mapping u1 u2 u3 u4 u5 u6 u7 ← depends on 1) Constellation set 2) Mapping from bits to symbols Symbol sequence

slide-46
SLIDE 46

46

Standard PAM constellation sets

d −d d −d −3d 3d

typically M = 2

APAM,2

  • ±d, ±3d, . . . , ±(2 − 1)d
  • dmin = 2d

M = 4 M = 2

slide-47
SLIDE 47

d −d gray −3d 3d non- gray 01 11 00 10 01 10 00 11 d −d gray 1

Gray mapping

  • Gray mapping assigns all possible combinations of ordered bits to

constellation points in a way such that there is only one-bit difference between nearest neighboring points.

47

  • M = 4

M = 2

slide-48
SLIDE 48

Standard QAM constellation sets

48

0110 1110 0010 1010 0111 1111 0011 1011 0101 1101 0001 1001 0100 1100 0000 1000 3d(1 + j) d(1 − j)

M = 16

AQAM,22

  • a(I) + ja(Q)
  • a(I), a(Q) ∈ APAM,2
  • .

typically M = 22 direct product of two 2-ary standard PAM constellation sets

dmin = 2d

slide-49
SLIDE 49

M = 8

Standard PSK constellation set

49

000 001 011 111 101 100 110 010

d √ 2(1 + j)

APSK,M

  • d exp
  • j2π

M k

  • k = 0, 1, . . . , M − 1
  • .

typically M = 2

encode the information

  • n the phase

dmin = 2d sin π M

slide-50
SLIDE 50

Design principles of constellation sets

  • Energy
  • Depends on minimum distance dmin and the total number of points M
  • Increase with M under fixed dmin
  • Increase with dmin under fixed M
  • Reliability
  • Higher reliability if dmin is larger
  • Rate
  • Higher rate if M is larger

50