• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar

ALLSIGNALPROCESSING.COM

Learn signal processing online

  • Home
  • Courses
  • Courses
  • About
  • FAQ
  • My Account
  • Blog
  • News
  • Contact
  • Login
  • Logout
  • Get All Access

Introduction to Circular Convolution and Filtering with the Discrete Fourier Transform

September 5, 2019 by

The convolution-multiplication property is one of the most insightful and useful properties of the Fourier transform and discrete-time Fourier transform. This lesson introduces the convolution-multiplication property for the DFT. Multiplication of DFT coefficients corresponds to circular convolution of time signals. You will gain an understanding of the difference between linear and circular convolution that is critical for properly using the DFT to filter signals.

Circular convolution and using the DFT for filtering are explored in much greater detail in the subsequent two lessons.

Click here to purchase immediate access to this and every other (more than 120) lesson!

Primary Sidebar

Courses

  • Foundations

  • Time Domain LTI Systems

  • Fourier Series and Transforms

  • Sampling and Reconstruction

  • The DFT and Applications

  • The Z-Transform

  • Intro to Filter Design

  • IIR Filter Design

  • FIR Filter Design

  • Random Signal Characterization

  • Basis Representations of Signals

  • Estimation of Power Spectra and Coherence

  • Introduction to Signal Estimation and Detection Theory

  • MMSE Filtering and Least-Squares Problems

Copyright © 2023 ALLSIGNALPROCESSING.COM | Site Design by 3200 Creative

  • Terms of Service
  • Privacy Policy
  • Contact