Fast Fourier Transform

An algorithm for fast computation of the Fourier transform of a sampled signal. It involves increasing the number of samples N to the next-highest power of two, and the computation time scales as N log N.

In Praat, the Fast Fourier Transform is used:

  1. For the Fourier transform of an entire sound: Sound: To Spectrum... with yes for the Fast setting, and Spectrum: To Sound.
  2. For the Fourier transform of consecutive frames in a sound. See Sound: To Spectrogram....
  3. For the fast computation of correlations, e.g. in Sound: To Pitch (raw autocorrelation)....

### Links to this page

- FFT