1 ft representation of dt signals: relating ft to dtft
TRANSCRIPT
1
FT Representation of DT Signals:
• Relating FT to DTFT
n
snTttp )()(
][ oftion representa CT)(][
)()(
)()()(
nxnTtnx
nTtnTx
nTttxtx
ns
nss
ns
snTttxnx |)(][
2
a) DTFT of x[n]: nj
n
jDTFT enxeXnx
][)(][
b) FT of CT signal
compare
][)(
][
)(][)(
nj
n
j
nTj
n
ns
enxeX
enxjX
nTtnxtx
s
T
dtenTtnx
dtetxjX
tj
ns
tj
)(][
)()(
3
• Sampling. The figure shown 2 slides earlier:
• Continuous-time representation of discrete-time signal x[n]
))( & ][between difference the(notice
)()(
)()(
)(][)(
s
nss
ns
nTxnx
tptx
nTtnTx
nTtnxtx
4
ks
s
ns
kT
jX
jPjXjX
tptxtx
nTttp
)(2
)(2
1
)()(2
1
)()()(
trainimpulse - )()(
k
ss
kjXT
jX ))((1
5
The FT of a sampled signal for different sampling frequencies.Spectrum of continuous-time signal.Spectrum of sampled signal when s = 3W.Spectrum of sampled signal when s = 2W. (d) Spectrum of sampled signal when s = 1.5W.
6
Observations: 1) FT of a sampled signal: x(j) shifted by integer multiples of s
2)
aliasing 2
rate)(Nyquist frequency critical 2
goverlappin no2
||for 0)(Let
W
W
W
WjX
s
s
s
?)()()(
jPnTttp FT
ns
7
ksT
kTT
T
Ts
tjkT
Ts
sn
s
k ks
FTtjk
sFTtjk
FT
k
kjP
TdtetkP
TnTttp
kkXjXekXtx
ke
s
ss
s
s
s
s
s
)(
)(2)(
Thus, .1
)(][
:tscoefficien FT ,
, period with periodic is which ,)()(For
)(][2)(][)(
signals periodic oftion representa FS
)(2
(p342) )(21
2
21
2/
2/
1
2
8
DTFT of sampled signal x[n] and FT of x(t)
sT
jXeXnx jDTFT
)()(][
ss
Tssj
fjX
feXs
2 period with periodic is )(
22 .2 period with periodic is )( :Note 1
E Example 4.9, p366:
2/3 (iii) ,1 (ii) ,4/1 (i) if )( of FT Find ).cos()(
sss TTTtxttx
kss
s
kkT
jX
tx
)(
)()()( FT
9
The effect of sampling a sinusoid at different rates (Example 4.9). (a) Original signal and FT. (b) Original signal, impulse sampled representation and FT for Ts = ¼. (c) Original signal, impulse sampled representation and FT for Ts = 1. (d) Original signal, impulse sampled representation and FT for Ts = 3/2. A cosine of frequency /3 is shown as the dashed line.
10
E Problem 4.10, p368:
Draw the FT of a sampled version of the CT signal having the FT depictedBy the following figure for (a) Ts=1/2 and (b) Ts=2.
(a) Ts=1/2, s=4.
(b) Ts=2, s=.
11
12
E Downsampling: Let ][][ qnxny
? torelated isHow jj eXeY
x(t). signal sampling from obtained be y[n]and x[n] bothLet
sssn
sn
sn
qTTnTt
qnTttny
nTttnx
''
'
where),(
)()(:][
)()(:][
13
ksq
k
sks
s
qssssn
ks
s
FT
ns
jXqT
kjXT
jY
qTTnTttxty
kjXT
jXnTttxtx
)(1
)(1
),()()(
)(1
)()()(
''
1'''
)1~0:(remainder : , ofportion integer )~:( :,Let
qmmlll q
kqm
qk
)()(1
Obviously, .)(11 1
0
sqm
lsq
ms
s
q
m lsq
ms
s
jXljXT
ljXTq
jY
14
)/(
))/((
1
0
|
|
)()(1
Obviously, .)(1
Thus,
s
s
Tj
qTj
sqm
lsq
ms
s
q
msq
m
jXeX
jYeY
jXljXT
jXq
jY
1
0
)2(11 q
m
mjj qeXq
eY
sss TqT /2 and )/(1 is y[n]for rate sampling :Note
15
Figure 4.29 (p. 372)Effect of subsampling on the DTFT. (a) Original signal spectrum. (b) m = 0 term, Xq(ej), in Eq. (4.27) (c) m = 1 term in Eq. (4.27). (d m = q – 1 term in Eq. (4.27). (e) Y(ej), assuming that W < /q. (f) Y(ej), assuming that W > /q.
16
Sampling theorem
aliasing :2 ][ from recovered completely becan signal original aliasing, No :2
sampling rate-Nyquist :2 ||for 0)(such that
signal limitedbandwidth a be )()(Let
ms
ms
ms
m
FT
nx
jXjXtx
E Example 4.12, p347:
).(][ sequence DT theby drepresenteuniquely becan )( that so
)/(2 Determine .)10sin(
)( Suppose
s
ss
nTxnxtx
Tt
ttx
rads/s 202 minimum ,10 Thus,10||,0
10||,1)()(
msm
FT jXtx
17
Ideal reconstruction:
(a) Spectrum of original signal.Spectrum of sampled signal.(c) Frequency response of reconstruction filter.
18
nss
ns
ns
nTtcnxtx
nTthnx
bTtnxth
thtxtx
jHjXjX
))2/()((sin][)(
)(][
)(][)(
)()()(
)()(
t
tTth
TjH
s
s
s
ss
2
,
sin)(
2/||0
2/||)(
Wt
cW
Wt
Wtsin
)sin(
19
Figure 4.36 (p. 377)Ideal reconstruction in the time domain.
20
Figure 4.37 (p. 377)Reconstruction via a zero-order hold.
• Ideal reconstruction is not realizable• Practical systems could use a zero-order hold block• This distorts signal spectrum, and compensation is needed
21
Figure 4.38 (p. 378)Rectangular pulse used to analyze zero-order hold reconstruction.
s
s
Ttt
Ttth
,0,0
0,1)(0
)2/sin(2)(
)()()(
)(][
)(][)(
)()()(
2/0
00
0
0
00
sTj
ns
ns
TejH
jXjHjX
nTthnx
nTtnxth
thtxtx
s
22
Figure 4.39 (p. 379)Effect of the zero-order hold in the frequency domain.(a) Spectrum of original continuous-time signal.(b) FT of sampled signal.(c) Magnitude and phase of Ho(j).(d) Magnitude spectrum of signal reconstructed using zero-order hold.
23
Figure 4.40 (p. 380)Frequency response of a compensation filter used to eliminate some of the distortion introduced by the zero-order hold.
ms
ms
s
c T
TjH
||,0
||,)2/sin(2)(
Anti-imaging filter.
24
Figure 4.41 (p. 380)Block diagram of a practical reconstruction system.
25
Figure 4.43 (p.383)Block diagram for discrete-time processing of continuous-time signals. (a) A basic system. (b) Equivalent continuous-time system.
26
Idea: find the CT system
)()()( such that )()( jXjGjYjGtg FT
0th-order S/H: )2/sin(
2)( 2/0
sTj TejH s
)()()( jXjHjX aa
nssa
Tjc
s
nssa
Tj
s
ssn
ssas
nsa
s
kjXkjHeHjHjHT
jY
kjXkjHeHT
jY
TkjXkjHT
kjXT
jX
s
s
))(())(()()(1
)(
))(())((1
)(
/2 ,))(())((1
))((1
)(
0
27
)()()(1
)(
)()()()(1
)(
0
0
jHeHjHjHT
jG
jXjHeHjHjHT
jY
aTj
cs
aTj
cs
s
s
• If no aliasing, the anti-imaging filter Hc(j) eliminates frequency
components above s/2, leaving only k=0 terms
• If anti-aliasing and anti-imaging filters are chosen to compensate
the effects of sampling and reconstruction, then
sTj
acs
eHjG
jHjHjHT
)( Thus,
1)()()()/1( 0
28
Oversampling:
• Sampling rate must be greater than Nyquist rate to relax anti-aliasing filter design
• Let Ws be cutoff frequency of anti-aliasing filter Ha(j) and W be the maximum frequency of desired signal
Then, to avoid aliasing, ss W2
• Due to DSP, noise aliases are not of concern, thus
WWss
(see figure next slide)
29
Figure 4.44 (p. 385)Effect of oversampling on anti-aliasing filter specifications. (a) Spectrum of original signal. (b) Anti-aliasing filter frequency response magnitude. (c) Spectrum of signal at the anti-aliasing filter output. (d) Spectrum of the anti-aliasing filter output after sampling. The graph depicts the case of s > 2Ws.
30
Decimation (downsampling):
• To relax design of anti-aliasing filter and anti-imaging filters, we wish to use high sampling rates
• High-sampling rates lead to expensive digital processor
• Wish to have:
– High rate for sampling/reconstruction
– Low rate for discrete-time processing
• This can be achieved using downsampling/upsampling
31
1
0
)/)2((2
22
1
as torelated is ].[][Let q
m
qmjj
jj
eXq
eG
eXeGqnxng
]).[for rate sampling timesq is ][for (sampling
.Let .lyrespective , and interval sampling
with)( samplingby obtained be ][ and ][Let
12
2121
21
nxnx
qTTTT
txnxnx
ssss
][][][ because 121 nxqnxngeXeG jj
32
Figure 4.45 (p. 387)Effect of changing the sampling rate. (a) Underlying continuous-time signal FT. (b) DTFT of sampled data at sampling interval Ts1. (c) DTFT of sampled data at sampling interval Ts2.
sT
qTT ss /12
33
Figure 4.46 (p. 387)The spectrum that results from subsampling the DTFT X2(ej) depicted in Fig. 4.45 by a factor of q.
Figure 4.48 (p. 389)Symbol for decimation by a factor of q (downsampling).
34
Figure 4.47 (p. 388)Frequency-domain interpretation of decimation. (a) Block diagram of decimation system. (b) Spectrum of oversampled input signal. Noise is depicted as the shaded portions of the spectrum. (c) Filter frequency response. (d) Spectrum of filter output. (e) Spectrum after subsampling.
35
jq
m
mqj
m
qmj
qnn
nj
n
njz
jz
z
eX
emxemx
eqnx
enxeX
qnqnxnx
1
)(1
)(1
of multipleint
1
1
][][
]/[
][ Thus,
otherwise,0
integer /],/[][Let
Upsampling (zero padding):
36
Figure 4.49 (p. 390)Frequency-domain interpretation of interpolation. (a) Spectrum of original sequence. (b) Spectrum after inserting q – 1 zeros in between every value of the original sequence.(c) Frequency response of a filter for removing undesired replicates located at 2/q, 4/q, …, (q – 1)2/q. (d) Spectrum of interpolated sequence.
37
Figure 4.50 (p. 390)(a) Block diagram of an interpolation system.(b) Symbol denoting interpolation by a factor of q.
38
Figure 4.51 (p. 391)Block diagram of a system for discrete-time processing of continuous-time signals including decimation and interpolation.
39
FS representation of finite-duration nonperiodic signals
• Discrete-time periodic signals: DTFS representation
• Continuous-time periodic signals: FS representation
• For numerical computation, it is better to have BOTH discrete in time and discrete in frequency
40
Figure 4.52 (p. 392)The DTFS of a finite-duration nonperiodic signal.
41
Figure 4.53 (p. 394)The DTFT and length-N DTFS of a 32-point cosine. The dashed line denotes |X(ej)|, while the stems represent N|X[k]|. (a) N = 32, (b) N = 60, (c) N = 120.
42
Figure 4.54 (p. 396)Block diagram depicting the sequence of operations involved in approximating the FT with the DTFS.
43
Figure 4.55 (p. 397)Effect of aliasing.
44
Figure 4.56 (p. 398)Magnitude response of M-point window.
45
Figure 4.57 (p. 400)The DTFS approximation to the FT of x(t) = e-1/10 u(t)(cos(10t) + cos(12t). The solid line is the FT |X(j)|, and the stems denote the DTFS approximation NTs|Y[k]|. Both |X(j) and NTs|Y[k]| have even symmetry, so only 0 < < 20 is displayed. (a) M = 100, N = 4000. (b) M = 500, N = 4000. (c) M = 2500, N = 4000. (d) M = 2500, N = 16,0000 for 9 < < 13.
46
Figure 4.58 (p. 404)The DTFS approximation to the FT of x(t) = cos(2(0.4)t) + cos(2(0.45)t). The stems denote |Y[k]|, while the solid lines denote (1/M|Y (j)|. The frequency axis is displayed in units of Hz for convenience, and only positive frequencies are illustrated. (a) M = 40. (b) M = 2000. Only the stems with nonzero amplitude are depicted. (c) Behavior in the vicinity of the sinusoidal frequencies for M = 2000. (d) Behavior in the vicinity of the sinusoidal frequencies for M = 2010.
47
Figure 4.59 (p. 406)Block diagrams depicting the decomposition of an inverse DTFS as a combination of lower order inverse DTFS’s. (a) Eight-point inverse DTFS represented in terms of two four-point inverse DTFS’s. (b) four-point inverse DTFS represented in terms of two-point inverse DTFS’s. (c) Two-point inverse DTFS.
48
Figure 4.60 (p. 407)Diagram of the FFT algorithm for computing x[n] from X[k] for N = 8.