Lec10 PDF
Lec10 PDF
Maxim Raginsky
Recall from the last lecture that any sufficiently regular (e.g.,
finite-energy) continuous-time signal x(t) can be represented in frequency
domain via its Fourier transform
Z ∞
X(ω) = x(t)e−jωt dt.
−∞
We can recover x(t) from X(ω) via the inverse Fourier transform formula:
Z ∞
1
x(t) = X(ω)ejωt dω.
2π −∞
Note that, even though the underlying signal x[n] is discrete-time, the
DTFT is a function of a continuous frequency Ω.
The first thing to note is that the DTFT X(Ω) of x[n] is 2π-periodic:
∞
X
X(Ω + 2π) = x[n]e−jn(Ω+2π)
n=−∞
X∞
= x[n]e−jnΩ |e−j2πn
{z }
n=−∞ =1
∞
X
= x[n]e−jnΩ
n=−∞
= X(Ω).
valid whenever q1 and q2 are integers with q2 > q1 and r is any real or
complex number.
Maxim Raginsky Lecture X: Discrete-time Fourier transform
Computing DTFT’s: another example
Consider the signal
x[n] = an u[n],
where |a| < 1. Then
∞
X
X(Ω) = an e−jnΩ
n=0
X∞
= (ae−jΩ )n
n=0
1
= ,
1 − ae−jΩ
where we used the formula
∞
X 1
rn = ,
n=0
1−r
Then
q
X
X(Ω) = e−jnΩ
n=−q
Like its continuous-time counterpart, the DTFT has several very useful
properties. These are listed in any text on signals and systems. We will
take a look at a couple of them.
then
c1 x1 [n] + c2 x2 [n] ↔ c1 X1 (Ω) + c2 X2 (Ω)
for any two constants c1 , c2 .
Proof:
∞ ∞ Z 2π
X X 1 jΩn
x[n]v[n] = x[n] V (Ω)e dΩ
n=−∞ n=−∞
2π 0
Z !
2π ∞
1 X
jΩn
= V (Ω) x[n]e dΩ
2π 0 n=−∞
Z !
2π ∞
1 X
−j(−Ω)n
= V (Ω) x[n]e dΩ
2π 0 n=−∞
| {z }
=X(−Ω)
Z 2π
1
= V (Ω)X(Ω)dΩ
2π 0