fast Fourier transform

(redirected from Fast Fourier Transforms)
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 ?
However, as before, efficient implementation is possible using fast Fourier transforms.
Sutton, Nonuniform fast Fourier transforms using min-max interpolation, IEEE Trans.
0 adds significant new capabilities such as multidimensional Fast Fourier Transforms for signal processing and high-performance random number generator functions for various analysis applications.
in Electrical Engineering from Johns Hopkins University, and is the author of the definitive book The Handbook of Real-Time Fast Fourier Transforms.
IPs that Lattice intends to make available include popular functions such as Finite Impulse Response (FIR) Filters and Fast Fourier Transforms (FFTs).
She said the CF90 Programming Environment also includes: CrayTools programming toolset, a full set of advanced visual programming tools for debugging, source-code analysis and performance analysis; and the CrayLibs highly optimized scientific libraries that include routines such as BLAS levels 1, 2 and 3; LINPACK/EISPACK; LAPACK; and new fast Fourier transforms (FFTs).
Instead, engineers can quickly model transmission lines as rational functions, a type of behavioral model that is faster, more accurate, and provides greater insight into transmission line characteristics than traditional alternatives like inverse fast Fourier transforms (IFFTs).
This library is based on the VSIPL 'core' profile and contains over 500 functions including vector & scalar arithmetic, Fast Fourier Transforms (FFTs), window functions, filters, matrix operations, system solvers, logical operations, QR decomposition and vector trig functions.
Artifacts can be eliminated from images with the use of forward and inverse Fast Fourier Transforms (FFTs).
For example, some could be assigned compute-intensive Fast Fourier Transforms (FFT) while others handle wireless connectivity, standard I/O interfaces or drive external memory.
Some examples of Papamichalis' efforts include working on efficient Fast Fourier Transforms (FFTs), encryption algorithms and communication algorithms implemented on TI DSP devices while he was a member of the DSP Applications Department in Houston.
We use a fast summation algorithm based on Nonequispaced Fast Fourier Transforms, building on previous work that used Fast Multipole Methods.
Full browser ?