Discrete Fourier Transforms, Fast Fourier Transforms and Convolution Algorithms

This readable handbook provides complete coverage of both the theory and implementation of modern signal processing algorithms for computing the discrete Fourier transform. Reviews continuous and discrete-time transform analysis of signals and properties of DFT, several ways to compute the DFT at a few frequencies, and the three main approaches to an FFT. Practical, tested FORTRAN and assembly language programs are included with enough theory to adapt them to particular applications. Compares and evaluates various algorithms.