Signal

Processing
First

Copyright Monash University 2009

Lecture9
DtoAConversion

READING ASSIGNMENTS
ThisLecture:
Chapter4:Sections44,45

OtherReading:
Recitation:Section43(StrobeDemo)
NextLecture:Chapter5(beginning)

Copyright Monash University 2009

LECTURE OBJECTIVES
DIGITALtoANALOGCONVERSIONis
Reconstructionfromsamples
SAMPLINGTHEOREMapplies

SmoothInterpolation

MathematicalModelofDtoA
SUMofSHIFTEDPULSES
LinearInterpolationexample

Copyright Monash University 2009

SAMPLING SUMMARY
SAMPLINGPROCESS
Convertx(t)tonumbers x[n]
nisaninteger;x[n]isasequenceofvalues
Thinkofnasthestorageaddressinmemory

UNIFORMSAMPLINGatt=nTs
IDEAL:x[n]=x(nTs)
x(t)

Copyright Monash University 2009

C-to-D

x[n] = x(nTs)

DIGITAL FREQ

SUMMARY

2 f
2
Ts
fs
2 f
Ts
2
fs
Copyright Monash University 2009

ALIASING

FOLDED ALIAS

SPECTRUM (DIGITAL) SUMMARY

Spectrumofx[n]hasmorethanonelinefor
eachcomplexexponential
ALIASING,FOLDEDALIAS

SPECTRUMisPERIODICwithperiod=2
PRINCIPAL(MINIMUM)ALIASIN[
SAMPLINGGUI(con2dis)demo

Copyright Monash University 2009

SAMPLING GUI (con2dis)

cos(0t )

a pair of
spectrum
lines @
o

cos[0n]

a pair of
spectrum
lines in
[- , ]

Copyright Monash University 2009

Normalized
spectrum
7

SAMPLING SUMMARY

Copyright Monash University 2009

NYQUIST RATE
Nyquist Rate Sampling
fs >TWICE theHIGHESTFrequencyinx(t)
SamplingabovetheNyquist rate

BANDLIMITEDSIGNALS
DEF:x(t)hasaHIGHESTFREQUENCY
COMPONENTinitsSPECTRUM
NONBANDLIMITEDEXAMPLE
SQUAREWAVEisNOT BANDLIMITED

Copyright Monash University 2009

SIGNAL TYPES
x(t)

A-to-D

x[n]

COMPUTER

y[n]

D-to-A

y(t)

AtoD
Convertx(t)tonumbers storedinmemory

DtoA
Converty[n] backtoacontinuoustimesignal,
y(t)
y[n] iscalledadiscretetimesignal
Copyright Monash University 2009

10

FREQUENCY DOMAINS
x(t)

A-to-D

x[n]

y[n]

f
2
2
fs
-0.5 f 0.5 or - or
Copyright Monash University 2009

D-to-A

y(t)

f
fs
2
-fs/2 f fs/2
11

D-to-A Reconstruction
x(t)

A-to-D

x[n]

COMPUTER

y[n]

D-to-A

y(t)

Createcontinuousy(t)fromy[n]
IDEAL
Ifyouhaveformulafory[n]

Replaceniny[n]withfst
y[n]=Acos(0.2n+)withfs=8000Hz
y(t)=Acos(2(800)t+)
Copyright Monash University 2009

12

D-to-A is AMBIGUOUS !
ALIASING
Giveny[n],whichy(t)dowepick???
INFINITENUMBERofy(t)
PASSINGTHRUTHESAMPLES,y[n]

DtoARECONSTRUCTIONMUSTCHOOSEONE
OUTPUT

RECONSTRUCT
THESMOOTHEST ONE
THELOWEST FREQ,ify[n]=sinusoid

Copyright Monash University 2009

13

SPECTRUM (ALIASING CASE)

f
2

fs

1
2

f s 80Hz 2.5

1
2

1
2

1
2

1
2

1
2

1.5

0.5

0.5

1.5

2.5

x[n ] A cos(2 (100)( n / 80) )

Copyright Monash University 2009

14

Reconstruction (D-to-A)
CONVERTSTREAMofNUMBERStox(t)
CONNECTTHEDOTS
INTERPOLATION
INTUITIVE,
conveys the idea

y[k]
y(t)
kTs
Copyright Monash University 2009

(k+1)Ts

t
15

SAMPLE & HOLD DEVICE

CONVERTy[n]toy(t)
y[k]shouldbethevalueofy(t)att=kTs
Makey(t)equaltoy[k]for
kTs 0.5Ts<t<kTs +0.5Ts

STAIR-STEP
APPROXIMATION

y[k]
y(t)
(k-1)Ts
Copyright Monash University 2009

kTs

(k+1)Ts

t
16

SQUARE PULSE CASE

Copyright Monash University 2009

17

OVER-SAMPLING CASE

EASIER TO RECONSTRUCT

Copyright Monash University 2009

18

MATH MODEL for D-to-A

SQUARE PULSE:

Copyright Monash University 2009

19

EXPAND the SUMMATION

y[n] p(t nT )
s

y[1] p(t Ts ) y[0] p(t ) y[1] p(t Ts ) y[2] p(t 2Ts )

SUMofSHIFTEDPULSESp(tnTs)
WEIGHTEDbyy[n]
CENTEREDatt=nTs
SPACED byTs
RESTORESREALTIME
Copyright Monash University 2009

20

p(t)

Copyright Monash University 2009

21

TRIANGULAR PULSE (2X)

Copyright Monash University 2009

22

OPTIMAL PULSE ?
CALLED
BANDLIMITED
INTERPOLATION
t

p(t )

sin Ts
t
Ts

for t

p(t ) 0 for t Ts , 2Ts ,

Copyright Monash University 2009

Sinc
function

23

Ideal reconstruction

y (t ) y[n]

sin

( t nTs )

Ts
( t nTs )
Ts

This is a decomposition of band-limited

signals using a sinc function basis

y (t ) cn n (t )

Exact reconstruction
Copyright Monash University 2009

24