Chp 5:

Discrete Fourier Transform (DFT)

Digital Signal Processing
Zafri Baharuddin
Discrete Fourier Transform (DFT)
Computer based frequency domain analysis

To analyse signals & systems in frequency domain: use Fourier Transform

To analyse signals & systems using computers: use DFT

Discrete Fourier Transform (DFT)
Applications:
• Spectral analysis (e.g. finding periodicities, viewing frequency content)
Discrete Fourier Transform (DFT)
Applications:
• Denoising
• Compression (e.g. jpeg, mp4)
 Discrete Fourier Transform (DFT)
Applications:
• Filtering
• Fast convolution (an efficient numerical algorithm)

Alisa,Hamiza,Vanessa, “Noise Removal Using FIR Filter”, Sem 2, 2019

Discrete Fourier Transform (DFT)

Computer analysis: discrete time, finite duration (N-points)

Discrete Fourier Transform (DFT)
Matrix Interpretation of the DFT

Interpret this operation as the product of an NxN DFT matrix

and an Nx1 vector of signal values
• Useful way to view DFT
• Power of matrix (linear) algebra in signal processing
Example: N = 4
Example: g[n] = { 1, 2, 0, 1 }; 0 ≤ n ≤ 3 Find G[k] using the matrix intrepertation
The Inverse DFT (Matrix intrepertation)
Example: Given G[k] find g[n], then find G(ejω)
Symmetry of the DFT
Symmetry of the DFT
 The Fast Fourier Transform (FFT) Algorithm
• Numerically efficient method to calculate DFT
• Gauss 1805, Cooley + Tukey 1965
N −1 2πk
−j n N complex multiplications,
X [k ] =  x[n]e N
0 ≤ k ≤ N −1 N-1 complex additions
For each k
n =0

N2 computations for direct DFT

vs. N log2N computations for FFT

N 1000 106 109 If one computation takes 1 ns:

N2 106 1012 1018 1018 ns  31.2 years

N log2N 104 20 x 106 30 x 109 30 x 109 ns  30 seconds
Discrete Fourier Transform (DFT)
Discrete Fourier
Transform

Matrix
multiplication FFT Circular
method convolution

X[k] = DNxN x[n] DIT-FFT

DIF-FFT