The Discrete Fourier Transform and the Fast Fourier Transform
Terry M. Peters, J. H. T. Bates · Birkhäuser Boston eBooks · 1998
The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm directly, and presents some practical guidelines for using the FFT. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.