• 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

Filtering with the Discrete Fourier Transform

August 25, 2019 by

The discrete Fourier transform is often used to implement linear time-invariant filters in a computationally efficient manner. This is due to the availability of computationally efficient or fast algorithms for computing the discrete Fourier transform. You will learn about the overlap and add method for computing convolution in this lesson. Overlap and add exploits the efficient computation of the discrete Fourier transform to efficiently compute the output of a filter with finite duration impulse response and long or possibly infinite duration input signal. This and similar methods are often employed in applications with relatively limited computational resources.

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