Noun
(plural fast Fourier transforms)
- A member of a certain family of algorithms for efficiently computing the discrete Fourier transform of data.
- An instance of performing one of these algorithms.
Usage notes
- Often abbreviated FFT.
