You are on page 1of 10

Amrita School of Engineering, Bangalore

ES 623/ PE 610
DIGITAL SIGNAL
PROCESSING
Lecture 15
Discrete Fourier Transform Cont..

Amrita School of Engineering, Bangalore

Last Session
Properties of DFT
Circular convolution

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

Todays Session
Linear convolution using circular convolution
Computation of DFT
Tabular method
Properties of phase factor

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

DFT & its Inverse


DFT is given by the expression:
N 1

X (k ) = x(n)W ; k = 0,1,2,3......N 1
nk
N

n =0

Inverse DFT is given by the expression:


N 1

1
nk
x(n) = X (k )WN ; n = 0,1,2,3......N 1
N n =0
09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

Linear convolution using circular


convolution???
Circular Convolution of two sequences
of unequal sizes???

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

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

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

Example
Compute the DFT of 4-point sequence
x(n)=[0,1,2,3]

Ans: X(k)=[6, -2+2j, -2, -2-2j]

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

Next Session
Fast Fourier Transforms
DIT FFT

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

Amrita School of Engineering, Bangalore

Thank You

09 Octoberer 2010

Dr.Shikha Tripathi,ASE, Bangalore

10