4.1: Introduction

Fast Fourier Transforms · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    Learning Objectives

    • Calculating DFT by convolution

    A major application of the FFT is fast convolution or fast filtering where the DFT of the signal is multiplied term-by-term by the DFT of the impulse (helps to be doing finite impulse response (FIR) filtering) and the time-domain output is obtained by taking the inverse DFT of that product. What is less well-known is the DFT can be calculated by convolution. There are several different approaches to this, each with different application.

    Contributor

    • ContribEEBurrus

    This page titled 4.1: Introduction was last modified on Mon, 22 Mar 2021 02:54:45 GMT and is shared under a CC BY license and was authored, remixed, and/or curated by C. Sidney Burrus.