The Fast Fourier Transform (FFT) is a landmark algorithm used in fields ranging from signal processing to high-performance computing. First popularized by two American scientists in 1965, the Fast Fourier Transform has since been optimized and adapted for a number of different applications.

In this collection, Dr. Sidney Burrus of Rice University provides a comprehensive look at the FFT, its range of applications and several variant algorithms. Fast Fourier Transforms also includes FFT flowgraphs, computer programs, and a wealth of other material related to the FFT.