The Discrete Fourier Transform

Chapter 8

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] DTFT
 X e j  
• Assume that a sequence is obtained by sampling the DTFT
~
 
Xk   X e j  X e j2  / Nk
  2  / N k
 
• Since the DTFT is periodic resulting sequence is also periodic
• We can also write it in terms of the z-transform
~

Xk   Xz  z  e2  / N k  X e j2  / Nk 
• The sampling points are shown in figure
• ~
Xk  could be the DFS of a sequence
• Write the corresponding sequence

~ 1 N 1 ~
x[n]   Xk e j2  / Nkn
N k 0
 Sampling the Fourier Transform Cont’d
• The only assumption made on the sequence is that DTFT exist

    xme

~
Xe j  jm

Xk   X e j2  / Nk  ~ 1 N 1 ~
x[n]   Xk e j2  / Nkn
m   N k 0
• Combine equation to get
~ 1 N 1   
x[n]     xme  j2  / Nkm e j2  / Nkn
N k  0 m   
 1 N 1 j2  / Nk n m  
 
~
  xm  e    xmp n  m
m   N k 0  m  
• Term in the brackets is

~ 1 N 1 j2  / Nk n m  
p n  m   e   n  m  rN
N k 0 r  
• So we get
 
~
x[n]  xn   n  rN   xn  rN
r   r  
 Relation between Finite-length and Periodic Signals
• Consider finite length signal x[n] spanning from 0 to N-1
• Convolve with periodic impulse train
 
x[n]  x[n]  ~
~ p[n]  x[n]   n  rN   xn  rN
r   r  
• The Fourier transform of the periodic sequence is
~ j j ~ j
        2N    2Nk 

X e  X e P e  X e j
k    
2  j N  
2 k
~ j
  2k 

Xe  
k   N
X  e   
N 

  
• This implies that

~  j 2Nk 
Xk   X e  
  X e j 2 k
 
  N
• DFS coefficients of a periodic signal can be thought as equally
spaced samples of the Fourier transform of one period
Sampling the Fourier Transform Cont’d

351M Digital Signal Processing

 The Discrete Fourier Transform
• Consider a finite length sequence x[n] of length N
xn  0 outside of 0  n  N  1
• For given length-N sequence associate a periodic sequence

~
x n   xn  rN
r  
• The DFS coefficients of the periodic sequence are samples of
the DTFT of x[n]
• Since x[n] is of length N there is no overlap between terms of
x[n-rN] and we can write the periodic sequence as
~
x n  xn mod N  xnN 
• To maintain duality between time and frequency
– We choose one period of ~ as the Fourier transform of x[n]
Xk 
~Xk  0  k  N  1 ~
Xk    Xk   Xk mod N  Xk N 
 0 else
The Discrete Fourier Transform
 The Discrete Fourier Transform Cont’d
• The DFS pair
~ 1 N 1 ~
~ x[n]   Xk e j2  / Nkn
N 1
Xk   ~
 x[n]e j2 / Nkn
n0
N k 0
• The equations involve only on period so we can write
N 1 ~
 x[n]e  j2  / Nkn 0  k  N  1
Xk   n  0
 0 else
 1 N 1 ~
  Xk e j2  / Nkn 0  k  N  1
x[n]  N k  0
 0 else
• The Discrete Fourier Transform
N 1
1 N 1
Xk    x[n]e x[n]   Xk e j2  / Nkn
 j2  / N kn

n0 N k 0
• The DFT pair can also be written as
Xk  DFT
 x[n]
 Example
• The DFT of a rectangular pulse
• x[n] is of length 5
• We can consider x[n] of any
length greater than 5
• Let’s pick N=5
• Calculate the DFS of the periodic
form of x[n]

~ 4
Xk    e  j2 k / 5 n

n0

1  e  j2 k

1  e  j2 k / 5 
5 k  0,5,10,...

0 else
 Example Cont’d
• If we consider x[n] of length 10
• We get a different set of DFT
coefficients
• Still samples of the DTFT but in
different places
 Properties of DFT
• Linearity
x1 n DFT
 X1 k 
x2 n DFT
 X2 k 
ax1 n  bx2 n DFT
 aX1 k   bX2 k 

• Circular Shift of a Sequence

 Circular Convolution
• Circular convolution of of two finite
length sequences
N 1
x3 n   x mx n  m 
1 2 N
m0

N 1
x3 n   x mx n  m 
2 1 N
m0
 Example
• Circular convolution of two rectangular pulses L=N=6

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

n0 0 else
• Multiplication of DFTs

N2 k  0
X3 k   X1 k X2 k   
 0 else
• And the inverse DFT

N 0  n  N  1
x3 n  
0 else
 Example
• We can augment zeros to
each sequence N=2L=12
• The DFT of each sequence
2 Lk
j
1e N
X1 k   X2 k   2 k
j
1e N

• Multiplication of DFTs
2
 j
2 Lk

1  e N 
X3 k    2 k 
1e Nj

 
 Review

• Discrete Fourier Series Pair

• Discrete Fourier Transform Pair

N 1
Xk    x[n]e  j2  / N kn

n0
~
 
Xk   X e j
  2  / N k

 X e j2  / Nk 
1 N 1
x[n]   Xk e j2  / Nkn
N k 0
Linear Convolution Using DFT
Linear Convolution Using DFT
Linear Convolution Using DFT
LTI Systems Using DFT
LTI Systems Using DFT
Block Convolution Techniques