Results 1 
2 of
2
Nonuniform fast Fourier transform
 Geophysics
, 1999
"... The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to as the nonuniform fast Fourier transform (NFFT). In L dimensions, the NFFT requires O(N(ln #) L + ( Q L #=1 M # ) P L #=1 log M # ) operations, where M # is the number of Fourier components ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to as the nonuniform fast Fourier transform (NFFT). In L dimensions, the NFFT requires O(N(ln #) L + ( Q L #=1 M # ) P L #=1 log M # ) operations, where M # is the number of Fourier components along dimension #, N is the number of irregularly spaced samples, and # is the required accuracy. This is a dramatic improvement over the O(N Q L #=1 M # ) operations required for the direct evaluation (NDFT). The performance of the NFFT depends on the lowpass filter used in the algorithm. A truncated Gauss pulse, proposed in the literature, is optimized. A newly proposed filter, a Gauss pulse tapered with a Hanning window, performs better than the truncated Gauss pulse and the Bspline, also proposed in the literature. For small filter length, a numerically optimized filter shows the best results. Numerical experiments for 1D and 2D implementations confirm the theoretically predicted ...