fast Fourier transform

(redirected from FFT algorithm)
Also found in: Encyclopedia, Wikipedia.

fast Fourier transform

An MRI term for a very fast and efficient computational method of performing a Fourier transform—the mathematical process by which raw data is processed into a usable image.
References in periodicals archive ?
Figure 8 compares the predicted and measured times for the FFT algorithm running with a 2MB complex input vector for the Cray T3E, Silicon Graphics Origin 2000 and Digital Alpha Server.
The FFT algorithm in Mercury's Scientific Algorithm Library (SAL) takes advantage of architectural improvements in the G4+ processors that raise the sustained instruction rate per cycle.
The DSPs execute an FFT algorithm, while data transfers through shared memories are controlled by the ARM processor.