Professional Documents
Culture Documents
1/13
Namely X ()
jn
x
[
n
]
e
(DTFT) can be computed analytically
Lets explore this possibility it will lead us to the Discrete Fourier Transform
Suppose we have a finite duration signal: x[n] = 0 for n < 0 and n N
Then the DTFT of this finite duration signal is:
X ()
x[n]e
jn
N 1
x[n]e jn
n 0
X ()
-3
-2
-/2
/2
X ()
-3
-2
-/2
/2
Region of Interest
4/13
Dont need
same as = 0
X ()
-3
-2
-/2
/2
0 0,
2
,
1
M
2
,
2 2
M
...
2
, M 1 ( M 1)
M
5/13
Thus mathematically what we have computed for our finite-duration signal is:
N 1
X ( k ) x[n ]e
jn k
n 0
N 1
x[n ]e
jnk 2M
for k 0, 1, 2, , M 1
n 0
We must set M = N
X [k ] x[n ]e
n 0
j 2kn / N
Definition
k 0,1, 2, ..., N 1
of the DFT
k k
2
N
6/13
X [k ]
X ()
But we know
that these points
can be tied back
to the true D-T
frequency :
0 1
2 3 4 5 6
7 8
-/2
/2
N
8
4
7/13
X [ N k ] X [k ], k 0,1, 2, ..., N 1
8/13
X [ N k ] X [k ], k 0,1, 2, ..., N 1
N = 8 case
X ()
0 1
2 3 4 5 6
7 8
Because the upper DFT points are just like the negative index DFT points
this DFT symmetry property is exactly the same as the DTFT symmetry around the
origin:
X ()
0 1
2 3 4 5 6
7 8
9/13
2. Inverse DFT
Recall that the DTFT can be inverted given X() you can find the signal x[n]
Because we arrived at the DFT via the DTFT it should be no surprise that the
DFT inherits an inverse property from the DTFT.
Actually, we needed to force M = N to enable
the DFT inverse property to hold!!
So
1
x[n ]
N
N 1
X [k ]e
j 2kn / N
n 0,1, 2, ..., N 1
n 0
Inverse DFT
(IDFT)
X [k ] x[n ]e j 2kn / N
k 0,1, 2, ..., N 1
DFT
n 0
10/13
The following plot shows the drastic improvement the FFT gives
over the DFT:
12/13
Given N DFT points we can get back the N signal data points
And we can do this efficiently using the IFFT algorithm