An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's)

IEEE Microwave and Guided Wave Letters

Volumn 8, Issue 1, 1998, Pages 18-20

  Liu, Q H ^a,b   Nguyen, N ^c  

^a IEEE   (United States)

^b New Mexico State Univ   (United States)

^c NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

Discrete Fourier transforms; Fourier series; Interpolation; Nonuniform fast Fourier transform (NUFFT)

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAST FOURIER TRANSFORMS; INTERPOLATION; MATRIX ALGEBRA;

NONUNIFORM FAST FOURIER TRANSFORMS (NUFFT);

ELECTROMAGNETIC FIELD THEORY;

EID: 0031695020     PISSN: 10518207     EISSN: None     Source Type: Journal    
DOI: 10.1109/75.650975     Document Type: Article

References (5)

1. J. W. Cooley and J. W. Tukey, "Algorithm for the machine computation of complex Fourier series," Math. Comp., vol. 19, pp. 297-301, 1965.
2. A. Dutt and V. Rokhlin, "Fast Fourier transforms for nonequispaced data," SlAM J. Sci. Comp., vol. 14, pp. 1368-1393, 1993.
3. G. Beylkin, "On the fast Fourier transform of functions with singularities," Appl. Computat. Harmonic Anal., vol. 2, pp. 363-382, 1995.
4. N. Nguyen and Q. H. Liu, "The regular Fourier matrices and nonuniform fast Fourier transforms," New Mexico State University Tech. Rep., July 1997.
5. Q. H. Liu, "The PSTD algorithm: A time-domain method requiring only two cells per wavelength," Microwave Opt. Tech. Lett., vol 15, no. 3, pp. 158-165, June 1997.