FFT

FFT

Abbrev. for Fast Fourier Transform. A particularly efficient implementation of the Fourier transform for computers. It is used extensively in aperture synthesis, digital signal processing and image processing.

FFT

(mathematics) fast Fourier transform

FFT

Fast Fourier Transform

FFT

(Fast Fourier Transform) A computer algorithm used in digital signal processing (DSP) to modify, filter and decode digital audio, video and images. FFTs commonly change the time domain into the frequency domain.

Myriad Recognition Uses
FFTs are widely used in voice recognition and myriad other pattern recognition applications. For example, noise-cancelling headphones use FFT to turn unwanted sounds into simple waves so that inverse signals can be generated to cancel them. FFTs are used to sharpen edges and create effects in static images and are widely used to turn a number series into sine waves and graphs.

Fast DFT Processing
The FFT quickly performs a discrete Fourier transform (DFT), which is the practical application of Fourier transforms. Developed by Jean Baptiste Joseph Fourier in the early 19th century, the Fourier equations were invented to transform one complex function into another. One of Fourier's primary goals was to predict the rate of heat transfer based on temperature, mass and proximity. In practice, the terms FFT, DFT and Fourier transform are used synonymously. See DSP.

An FFT Transform
A Fourier transform was used to chart the power levels at different frequencies from the half second of digital samples (top).