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

被引：228

作者：

Liu, QH ^{[1
]}

Nguyen, N

机构：

[1] New Mexico State Univ, Klipsch Sch Elect & Comp Engn, Las Cruces, NM 88003 USA

[2] New Mexico State Univ, Dept Math Sci, Las Cruces, NM 88003 USA

来源：

IEEE MICROWAVE AND GUIDED WAVE LETTERS | 1998年 / 8卷 / 01期

关键词：

discrete Fourier transforms; Fourier series; interpolation; nonuniform fast Fourier transform (NUFFT);

D O I：

10.1109/75.650975

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Based on the (m, N, q)-regular Fourier matrix, a new algorithm is proposed for fast Fourier transform (FFT) of nonuniform (unequally spaced) data. Numerical results show that the accuracy of this algorithm is much better than previously reported results with the same computation complexity of O(N log(2) N). Numerical examples are shown for the applications in computational electromagnetics.

引用

页码：18 / 20

页数：3

共 6 条

[1] ON THE FAST FOURIER-TRANSFORM OF FUNCTIONS WITH SINGULARITIES
BEYLKIN, G
[J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 1995, 2 (04) : 363 - 381
[2] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES
COOLEY, JW
TUKEY, JW
[J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &
[3] FAST FOURIER-TRANSFORMS FOR NONEQUISPACED DATA
DUTT, A
ROKHLIN, V
[J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (06) : 1368 - 1393
[4] Liu QH, 1997, MICROW OPT TECHN LET, V15, P158, DOI 10.1002/(SICI)1098-2760(19970620)15:3<158::AID-MOP11>3.0.CO
[5] 2-3
[6] NGUYEN N, 1997, REGULAR FOURIER MATR

← 1 →