Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Engineering LibreTexts

Fast Fourier Transforms (Burrus)

( \newcommand{\kernel}{\mathrm{null}\,}\)

This book focuses on the discrete Fourier transform (DFT), discrete convolution, and, particularly, the fast algorithms to calculate them. These topics have been at the center of digital signal processing since its beginning, and new results in hardware, theory and applications continue to keep them important and exciting. This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided.

Thumbnail: The Fourier transform of a delayed unit pulse as a function of frequency. (CC BY-SA 4.0 Unported; IkamusumeFan via Wikipedia)


This page titled Fast Fourier Transforms (Burrus) is shared under a CC BY license and was authored, remixed, and/or curated by C. Sidney Burrus.

Support Center

How can we help?