Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
