We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Time and Memory Requirements of the Nonequispaced FFT.
- Authors
Kunis, Stefan; Potts, Daniel
- Abstract
We consider the fast Fourier transform at nonequispaced nodes (NFFT), and give detailed information on the time and memory requirements of its building blocks. This manuscript reviews the state of the art approaches and focuses within the most successful scheme on the most computationally involved part. Beside a rigorous derivation of a lookup table technique, we compare a wide range of precomputation schemes which lead to substantially different computation times of the NFFT. In particular, we show how to balance accuracy, memory usage, and computation time.
- Subjects
FOURIER transforms; FOURIER analysis; MATHEMATICAL transformations; ALGORITHMS; MATHEMATICS
- Publication
Sampling Theory in Signal & Image Processing, 2008, Vol 7, Issue 1, p77
- ISSN
1530-6429
- Publication type
Article
- DOI
10.1007/bf03549487