fast Fourier transform


Also found in: Acronyms, 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 ?
The seasonality and diurnal variation of wind speed are observed by applying Fast Fourier Transform on NOAA wind data in New York and Austin.
In conclusion, the Fast Fourier Transform and Wavelet Analysis able to locate and detect the faulty insulation where the partial discharge occurrence is said to affect the power system and this may lead to ultimate system breakdown.
Caption: FIGURE 5: Limit cycles and Fast Fourier Transform on the stationary self-excited vibrations for one degree-of- freedom of the disc at the normal component: (a, b) [mu] = 0.5, (c, d) [mu] = 0.6, (a, c) limit cycles, and (b, d) FFT, black color for the reference and red color for the reduced model with 15 interface modes.
CUI, A sparse data fast Fourier transform (SDFFT), IEEE Trans.
Finally and after applying these element excitation constraints, the fast Fourier transform is performed to get new sum and difference patterns.
This paper proposes two fast Fourier transform subspace-based optimization methods (NFF-SOM and LF-SOM) to solve the EIT problem with arbitrary boundary.
We use a combination of Gaussian and Fast Fourier Transform that is known as homomorphic filtering, for the enhancement.
For the application of the discrete fast Fourier transform (DFFT), y1 presents the frequency components of the original signal [13].
In this context, a set of algorithms named sFFT takes advantage of the signal sparsity in the DFT domain to speed up the runtime of the Fast Fourier Transform (FFT) algorithms used to calculate the DFT [1],[2],[3].
With comprehensive functions, such as, configurable RF scans, real-time IF analysis and Fast Fourier Transform (FFT) analysis for overview measurements, solutions to measurement problem are quick and reliable.
[10] proposed an iterative reconstruction framework based on nonuniform fast Fourier transform (NUFFT) and reduced the number of view with broadband sound wave.
For the past decades, the main concern of the researchers was to develop a fast Fourier transform (FFT) algorithm in which the number of operations required is minimized.
Full browser ?