Professional Documents
Culture Documents
The Discrete Fourier Transform: Quote of The Day
The Discrete Fourier Transform: Quote of The Day
Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, ©1999-2000 Prentice Hall
Inc.
Sampling the Fourier Transform
• Consider an aperiodic sequence with a Fourier transform
x[n] DT FT
X e j
• Assume that a sequence is obtained by sampling the DTFT
~
Xk X e j
X e j2 / Nk
2 / Nk
• Since the DTFT is periodic resulting sequence is also periodic
• We can also write it in terms of the z-transform
~
Xk Xz z e2 / N k X e j2 / Nk
• The sampling points are shown in figure
~
• Xk could be the DFS of a sequence
• Write the corresponding sequence
~ 1 N 1 ~
x[n] Xk e j2 / Nkn
N k 0
xme
~
Xe j jm
Xk X e j2 / Nk ~ 1 N 1 ~
x[n] Xk e j2 / Nkn
m N k 0
• Combine equation to get
~ 1 N1
x[n] xme j2 / Nkm e j2 / Nkn
N k 0 m
1 N1 j2 / Nk nm
~
xm e xmp n m
m N k 0 m
• Term in the parenthesis is
~ 1 N1 j2 / Nk n m
p n m e n m rN
N k 0 r
• So we get
~
x[n] xn n rN xn rN
r r
~x n 0 n N 1
xn
0 else
~ 4
Xk e j2 k / 5 n
n0
1 e j2 k
1 e j2 k / 5
5 k 0,5,10,...
0 else
• Duality
xn DFT
Xk
Xn DFT
Nx k N
xn DFT
Xk
xn mN 0 n N - 1 DFT
Xk e j2k / Nm
N 1
x3 n x mx n m
2 1 N
m0
1 0 n L 1
x1 n x2 n
0 else
• DFT of each sequence
2
N 1
N k 0
X1 k X2 k
j kn
e N
n0 0 else
• Multiplication of DFTs
N2 k 0
X3 k X1 k X2 k
0 else
• Multiplication of DFTs
2
j
2 Lk
1 e N
X3 k 2 k
1e N
j