• DocumentCode
    1254008
  • Title

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

  • Author

    Liu, Q.H. ; Nguyen, N.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., New Mexico State Univ., Las Cruces, NM, USA
  • Volume
    8
  • Issue
    1
  • fYear
    1998
  • fDate
    1/1/1998 12:00:00 AM
  • Firstpage
    18
  • Lastpage
    20
  • Abstract
    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 log2 N). Numerical examples are shown for the applications in computational electromagnetics
  • Keywords
    Fourier series; computational complexity; electromagnetism; fast Fourier transforms; interpolation; matrix algebra; Fourier matrix; accurate algorithm; computation complexity; computational electromagnetics; fast Fourier transforms; nonuniform FFT; Approximation algorithms; Approximation error; Computational electromagnetics; Discrete Fourier transforms; Equations; Fast Fourier transforms; Fourier series; Fourier transforms; Interpolation; Linear matrix inequalities;
  • fLanguage
    English
  • Journal_Title
    Microwave and Guided Wave Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1051-8207
  • Type

    jour

  • DOI
    10.1109/75.650975
  • Filename
    650975
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1254008