By Topic

Accurate algorithms for nonuniform fast forward and inverse Fourier transforms and their applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Q. H. Liu ; Klipsch Sch. of Electr. & Comput. Eng., New Mexico State Univ., Las Cruces, NM, USA ; N. Nguyen ; X. Y. Tang

Regular fast Fourier transform (FFT) algorithms require uniformly sampled data. In many practical situations, however, the input data is nonuniform, and hence the regular FFT does not apply. To overcome this difficulty the authors have proposed an accurate algorithm for the nonuniform forward FFT (NUFFT) based on a new class of matrices, the regular Fourier matrices. For the nonuniform inverse FFT (NU-IFFT) algorithm, the conjugate-gradient method and the regular FFT algorithm are combined to speed up a matrix inversion. Numerical results show that these algorithms are more than one order of magnitude more accurate than existing algorithms

Published in:

Geoscience and Remote Sensing Symposium Proceedings, 1998. IGARSS '98. 1998 IEEE International  (Volume:1 )

Date of Conference:

6-10 Jul 1998