Loading [a11y]/accessibility-menu.js
Optimized Least-Square Nonuniform Fast Fourier Transform | IEEE Journals & Magazine | IEEE Xplore

Optimized Least-Square Nonuniform Fast Fourier Transform


Abstract:

The main focus of this paper is to derive a memory efficient approximation to the nonuniform Fourier transform of a support limited sequence. We show that the standard no...Show More

Abstract:

The main focus of this paper is to derive a memory efficient approximation to the nonuniform Fourier transform of a support limited sequence. We show that the standard nonuniform fast Fourier transform (NUFFT) scheme is a shift invariant approximation of the exact Fourier transform. Based on the theory of shift-invariant representations, we derive an exact expression for the worst-case mean square approximation error. Using this metric, we evaluate the optimal scale-factors and the interpolator that provides the least approximation error. We also derive the upper-bound for the error component due to the lookup tablebased evaluation of the interpolator; we use this metric to ensure that this component is not the dominant one. Theoretical and experimental comparisons with standard NUFFT schemes clearly demonstrate the significant improvement in accuracy over conventional schemes, especially when the size of the uniform fast Fourier transform (FFT) is small. Since the memory requirement of the algorithm is dependent on the size of the uniform FFT, the proposed developments can lead to iterative signal reconstruction algorithms with significantly lower memory demands.
Published in: IEEE Transactions on Signal Processing ( Volume: 57, Issue: 6, June 2009)
Page(s): 2165 - 2177
Date of Publication: 06 February 2009

ISSN Information:


References

References is not available for this document.