fast fourier transform


Definition: An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain.

Also known as FFT.

Note: Used to convert a complicated wave into its component sine waves.

Author: PS


Worst-case behavior annotated for real time (WOOP/ADA).
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 14 May 2007.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Paul Steffas, "fast fourier transform", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 14 May 2007. (accessed TODAY) Available from: