Fiveable

📚Signal Processing Unit 8 Review

QR code for Signal Processing practice questions

8.3 Spectral Analysis using DFT/FFT

📚Signal Processing
Unit 8 Review

8.3 Spectral Analysis using DFT/FFT

Written by the Fiveable Content Team • Last updated September 2025
Written by the Fiveable Content Team • Last updated September 2025
📚Signal Processing
Unit & Topic Study Guides

The DFT and FFT are powerful tools for analyzing signals in the frequency domain. They transform time-domain data into a spectrum, revealing hidden patterns and frequencies. This process is crucial for various applications, from audio processing to image analysis.

Spectral analysis using DFT/FFT allows us to interpret frequency components, understand signal characteristics, and perform tasks like filtering and denoising. It's a fundamental technique that bridges the gap between time and frequency representations of signals.

Spectral Analysis with DFT and FFT

Discrete Fourier Transform (DFT)

  • Mathematical tool converts finite sequence of equally-spaced samples of a function into same-length sequence of equally-spaced samples of discrete-time Fourier transform (DTFT), a complex-valued function of frequency
  • Defined by formula X[k]=n=0N1x[n]ej2πkn/NX[k] = \sum_{n=0}^{N-1} x[n] * e^{-j*2*\pi*k*n/N}, where:
    • x[n]x[n] input signal
    • X[k]X[k] output spectrum
    • NN number of samples
    • kk frequency index

Fast Fourier Transform (FFT)

  • Efficient algorithm computes DFT, reducing computational complexity from O(N2)O(N^2) to O(NlogN)O(N \log N)
  • Based on divide-and-conquer approach
    • Recursively breaks down DFT into smaller DFTs
    • Exploits symmetry and periodicity properties of complex exponential term
  • Requires number of samples NN to be power of 2 for optimal performance
    • Zero-padding can extend signal length to nearest power of 2 (2n2^n, where nn is an integer)

Frequency Spectrum Interpretation

Frequency Spectrum Components

  • DFT/FFT output X[k]X[k] represents frequency spectrum of input signal x[n]x[n]
    • Each value corresponds to specific frequency component
  • Magnitude spectrum X[k]|X[k]| provides information about amplitude or strength of each frequency component in signal
  • Phase spectrum X[k]\angle X[k] represents phase shift of each frequency component relative to origin

Frequency Resolution and Symmetry

  • Frequency resolution of spectrum given by fs/Nf_s/N, where:
    • fsf_s sampling frequency
    • NN number of samples
  • Determines spacing between frequency bins in spectrum
  • Spectrum symmetric around Nyquist frequency (fs/2f_s/2) for real-valued input signals
    • Second half is complex conjugate of first half

Frequency Resolution and Leakage

Frequency Resolution

  • Ability to distinguish between closely spaced frequency components in spectrum
  • Determined by number of samples NN and sampling frequency fsf_s
  • Increasing number of samples NN improves frequency resolution
    • Allows for better separation of nearby frequency components

Spectral Leakage

  • Occurs when input signal is not periodic within DFT/FFT window
    • Causes energy from one frequency component to leak into adjacent frequency bins
  • Caused by implicit rectangular windowing of input signal by DFT/FFT
    • Introduces discontinuities at boundaries
  • Windowing techniques (Hann, Hamming, Blackman) can reduce spectral leakage
    • Applied to input signal before DFT/FFT
    • Smooths signal at boundaries

DFT/FFT Applications

Filtering

  • Achieved by modifying DFT/FFT coefficients and performing inverse DFT/FFT to obtain filtered signal
  • Low-pass filtering removes high-frequency components by setting corresponding DFT/FFT coefficients to zero
  • High-pass filtering removes low-frequency components by setting corresponding DFT/FFT coefficients to zero
  • Band-pass and band-stop filtering achieved by selectively retaining or removing specific frequency ranges

Denoising

  • Performed by identifying and suppressing noise components in frequency domain
  • Thresholding techniques (hard or soft thresholding) applied to DFT/FFT coefficients to remove noise while preserving signal components
  • Choice of threshold depends on noise characteristics and desired trade-off between noise reduction and signal preservation

Feature Extraction

  • Involves identifying and extracting relevant frequency-domain features from DFT/FFT spectrum for further analysis or classification
  • Spectral features computed from DFT/FFT coefficients
    • Peak frequencies
    • Spectral centroid
    • Spectral bandwidth
    • Spectral entropy
  • Features used for tasks such as:
    • Audio classification
    • Speech recognition
    • Signal characterization