Competing Definitions

  Fast Fourier Transform  [hits=1 votes=1 rating=5.0] - The Fast Fourier Transform (FFT) is a fast algorithm for computing the Discrete Fourier Transform (DFT)
  Fast Fourier Transform  [hits=1 votes=1 rating=5.0] : FFTW Home Page - FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification.
  Fast Fourier Transform  [hits=1 votes=1 rating=5.0] : Fast Fourier Transform -- from MathWorld