Professional Documents
Culture Documents
ES 623/ PE 610 Digital Signal Processing: Discrete Fourier Transform Cont.
ES 623/ PE 610 Digital Signal Processing: Discrete Fourier Transform Cont.
ES 623/ PE 610
DIGITAL SIGNAL
PROCESSING
Lecture 15
Discrete Fourier Transform Cont..
Last Session
Properties of DFT
Circular convolution
09 Octoberer 2010
Todays Session
Linear convolution using circular convolution
Computation of DFT
Tabular method
Properties of phase factor
09 Octoberer 2010
X (k ) = x(n)W ; k = 0,1,2,3......N 1
nk
N
n =0
1
nk
x(n) = X (k )WN ; n = 0,1,2,3......N 1
N n =0
09 Octoberer 2010
09 Octoberer 2010
09 Octoberer 2010
Computation of DFT
DFT as linear transformation:
If xN is an N-point vector of signal x(n),
XN is an N-point vector of frequency samples X(k)
and WN is an NxN matrix then
X N = WN x N
If WN1 exists then
1 *
x N = W X N = WN X N
N
1
N
09 Octoberer 2010
Example
Compute the DFT of 4-point sequence
x(n)=[0,1,2,3]
09 Octoberer 2010
Next Session
Fast Fourier Transforms
DIT FFT
09 Octoberer 2010
Thank You
09 Octoberer 2010
10