Iterative algorithm for nonuniform inverse fast Fourier transform (NU-IFFT)

被引：22

作者：

Liu, QH ^{[1
]}

Tang, XY ^{[1
]}

机构：

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

来源：

ELECTRONICS LETTERS | 1998年 / 34卷 / 20期

关键词：

D O I：

10.1049/el:19981372

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A nonuniform inverse fast Fourier transform (NU-IFFT) for nonuniformly sampled data is realised by combining the conjugate-gradient fast Fourier transform (CG-FFT) method with the newly developed nonuniform fast Fourier transform (NUFFT) algorithms. An example application of the algorithm in computational electromagnetics is presented.

引用

页码：1913 / 1914

页数：2

共 5 条

[1] ON THE FAST FOURIER-TRANSFORM OF FUNCTIONS WITH SINGULARITIES [J].

BEYLKIN, G .

APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 1995, 2 (04) :363-381

[2]

Catedra M. F., 1995, CG FFT METHOD APPL S

[3] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].

COOLEY, JW ;

TUKEY, JW .

MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&

[4] FAST FOURIER-TRANSFORMS FOR NONEQUISPACED DATA [J].

DUTT, A ;

ROKHLIN, V .

SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (06) :1368-1393

[5] An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's) [J].

Liu, QH ;

Nguyen, N .

IEEE MICROWAVE AND GUIDED WAVE LETTERS, 1998, 8 (01) :18-20

← 1 →