Scribd
Upload
136 views

Relationship DFT and DTFT

The document discusses the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT). It provides the equations for the DFT and IDFT, and explains their relationship to the discrete-time Fourier transform (DTFT). It also discusses zero padding, the matrix formulation of the DFT, and circular convolution as it relates to applying the fast Fourier transform.

Uploaded by

nikunj0580
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
136 views

Relationship DFT and DTFT

The document discusses the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT). It provides the equations for the DFT and IDFT, and explains their relationship to the discrete-time Fourier transform (DTFT). It also discusses zero padding, the matrix formulation of the DFT, and circular convolution as it relates to applying the fast Fourier transform.

Uploaded by

nikunj0580
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

DFT and IDFT

IDFT:
N −1
1 X 2πkn
x(n) = X(k)ej N n = 0, 1, . . . , N − 1
N n=0

DFT:
N
X −1
2πkn
X(k) = x(n)e−j N k = 0, 1, . . . , N − 1
n=0

Digital Signal Processing 1 Lecture 2

Relationship DFT ↔ DTFT

X(k) = XN (f )cf = k
N

• Truncation of the signal to length N :



x(n) n = 0, 1, . . . , N − 1
xN (n) =
0 otherwise

• Sampling of the frequency axis:


k
f=
N

Digital Signal Processing 2 Lecture 2


Zero Padding
If x(n) has length N and we want to evaluate
N
X −1
X(f ) = x(n)e−j2πf n
n=0

at M > N frequency values, calculate the M -point DFT of

xZP (n) = {x(0), x(1), . . . , x(N − 1), 0, . . . , 0 }


| {z }
M −N zeros

Gives
XZP (k) = X(f )cf = k
M

Digital Signal Processing 3 Lecture 2

Matrix formulation of DFT

DFT: X = Wx
1 H
IDFT: x = NW X
j2π
where (wN = e− N )
     
x(0) X(0) 1 1 ··· 1
     
1 N −1

 x(1) 
 
 X(1) 

 wN ··· wN 

x= .
, X = 
.
 , W = .
. .. .. 

 .. 


 .. 
 . . .


     
N −1 .. (N −1)(N −1)
x(N − 1) X(N − 1) 1 wN . wN
 −1
1 1 1
√ W is a unitary (orthogonal) matrix ⇐⇒ √ W = √ WH
N N N

Digital Signal Processing 4 Lecture 2


Circular Convolution
Sequences of length N and the N –point DFT

FFT[x1 (n)] = X1 (k)


FFT[x2 (n)] = X2 (k)
FFT[x3 (n)] = X3 (k) = X1 (k)X2 (k)

⇐⇒
N
X −1
x3 (n) = x1 (k)x2 ((n − k)mod N) = x1 (n)
N x2 (n)
k=0

Notation: x1 (n)
N x2 (n), circular convolution of length N .

Digital Signal Processing 5 Lecture 2

You might also like