Time and memory requirements of the nonequispaced FFT

Sampling Theory in Signal and Image Processing

Volumn 7, Issue 1, 2008, Pages 77-100

  Kunis, Stefan ^a   Potts, Daniel ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

FFT; Nonequispaced Fast Fourier Transform

Indexed keywords

EID: 39449086482     PISSN: 15306429     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (41)

1. C. Anderson and M. Dahleh, Rapid computation of the discrete Fourier transform, SIAM J. Sci. Comput., 17, 913-919, 1996.
2. A. Averbuch, R. Coifman, D. L. Donoho, M. Elad, and M. Israeli, Fast and accurate polar Fourier transform, Appl. Comput. Harmon. Anal., 211, 145-167, 2006.
3. S. Bagchi and S. K. Mitra, The nonuniform discrete Fourier transform. In F. Marvasti, editor, Nonuniform Sampling: Theory and Practice, Kluwer/Plenum, 2001.
4. P. J. Beatty, D. G. Nishimura, and J. M. Pauly, Rapid gridding reconstruction with a minimal oversampling ratio, IEEE Trans. Med. Imag., 24, 799-808, 2005.
5. G. Beylkin, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal., 2, 363-381, 1995.
6. E. J. Candes, L. Demanet, D. L. Donoho, and L. Yin, Fast discrete curvelet transforms, SIAM Multiscale Model. Simul., 3, 861-899, 2006.
7. A. J. W. Duijndam and M. A. Schonewille, Nonuniform fast Fourier transform, Geophysics, 64, 539-551, 1999.
8. A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Stat. Comput., 14, 1368-1393, 1993.
9. A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data II, Appl. Comput. Harmon. Anal., 2, 85-100, 1995.
10. H. Eggers, T. Knopp, and D. Potts, Field inhomogeneity correction based on gridding reconstruction, IEEE Trans. Med. Imag., 26, 374-384, 2007.
11. B. Elbel and G. Steidl, Fast Fourier transform for nonequispaced data. In C. K. Chui and L. L. Schumaker, editors, Approximation Theory IX, 39-46, Vanderbilt University Press, Nashville, 1998.
12. G. E. Fasshauer and J. Zhang, Recent results for moving least squaxes approximation. In L. Lucian and M. Neamtu, editors, Geometric Modeling and Computing, 163 - 176, Nashboro Press, Brentwood, 2003.
13. H. G. Feichtinger, K. Gröchenig, and T. Strohmer, Efficient numerical methods in non-uniform sampling theory, Numer. Math., 69, 423-440, 1995.
14. M. Fenn, S. Kunis, and D. Potts, On the computation of the polar FFT, Appl. Comput. Harmon. Anal., 22, 257-263, 2007.
15. J. A. Fessler and B. P. Sutton, Nonuniform fast Fourier transforms using min-max interpolation, IEEE Trans. Signal Process., 51, 560-574, 2003.
16. K. Fourmont, Non equispaced fast Fourier transforr with applications to tomography, J. Fourier Anal. Appl., 9, 431-450, 2003.
17. M. Frigo and S. G. Johnson, FFTW, C subroutine library,. http://www.fftw.org.
18. D. Gottlieb, B. Gustafsson, and P. Forssen, On the direct Fourier method for computer tomography, IEEE Trans. Med. Imag., 9, 223-232, 2000.
19. L. Greengard and J.-Y. Lee, Accelerating the nonuniform fast Fourier transform, SIAM Rev., 46, 443-454, 2004.
20. K. Gröchenig, A discrete theory of irregular sampling, Lin. Alg. Appl., 193, 129-150, 1993.
21. J. A. Hogan and J. D. Lakey, Time-Frequency and Time-Scale Methods: Wavelets, Sampling, Uncertainty Principles, Applied and Numerical Harmonic Analysis series, Birkhauser, Boston, 2005.
22. J. I. Jackson, C. H. Meyer, D. G. Nishimura, and A. Macovski, Selection of a convolution function for Fourier inversion using gridding, IEEE Tans. Med. Imag., 10, 473-478, 1991.
23. J. Keiner, S. Kunis, and D. Potts, Fast summation of radial functions on the sphere, Computing, 78, 1-15, 2006.
24. S. Kunis and D. Potts, NFFT, Softwarepackage, C subroutine library, http://vvw.tu-chemnitz.de/~potts/nfft, 2002-2006.
25. S. Kunis and D. Potts, Fast spherical Fourier algorithims, J. Comput. Appl. Math., 161, 75-98, 2003.
26. S. Kunis and D. Potts, Stability results for scattered data interpolation by trigonometric polynomials, SIAM J. Sci. Comput., 29, 1403-1419, 2007.
27. J. Ma and M. Fenn, Combined complex ridgelet shrinkage and total variation minimization, SIAM J. Sci. Comput., 28, 984-1000, 2006.
28. S. Matej, J. A. Fessler, and I. G. Kazantsev, Iterative tomographic image reconstruction using Fourier-based forward and back-projectors, IEEE Trans. Med. Imag., 23, 401-412, 2004.
29. F. Natterer and F. Wübbeling, Mathematical Methods in Image Reconstruction, SIAM, Philadelphia, 2000.
30. N. Nguyen and Q. H. Liu, The regular Fourier matrices and nonuniform fast Fourier transforms, SIAM J. Sci. Comput., 21, 283-293, 1999.
31. A. Nieslony and G. Steidl, Approximate factorizations of Fourier matrices with nonequispaced knots, Linear Algebra Appl., 266, 337-1351, 2003.
32. J. D. O'Sullivan, A fast sinc function gridding algorithm for Fourier inversion in computer tomography, IEEE Trans. Med. Imag., 4, 200-207, 1985.
33. D. Potts, Schnelle Fourier-Transformationen für Nichtäquidistante Daten und Anwendungen, Habilitation, Universität zu Lübeck, 2003. http://www.tu-chemnitz.de/~potts
34. D. Potts and G. Steidl, A new linogram algorithm for computerized tomography, IMA J. Numer. Anal., 21, 769-782, 2001.
35. D. Potts and G. Steidl, Fast summation at nonequispaced knots by NFFTs, SIAM J. Sci. Comput., 24, 2013-2037, 2003.
36. D. Potts, G. Steidl, and A. Nieslony, Fast convolution with radial kernels at nonequispaced knots, Numer. Math., 98, 329-351, 2004.
37. D. Potts, G. Steidl, and M. Tasche, Fast Fourier transforms for nonequispaced data: A tutorial. In J. J. Benedetto and P. J. S. G. Ferreira, editors, Modern Sampling Theory: Mathematics and Applications, 247-270, Birkhäuser, Boston, 2001.
38. G. Steidl, A note on fast Fourier transforms for nonequispaced grids, Adv. Comput. Math., 9, 337-353, 1998.
39. B. P. Sutton, D. C. Noll, and J. A. Fessler, Fast, iterative, field-corrected image reconstruction for MRI in the presence of field inhomogeneities, IEEE Trans. Med. Imag., 22, 178-188, 2003.
40. M. Tasche and H. Zeunor, Roundoff error analysis for fast trigonometric transforms. In Handbook of Analytic-Computational Methods in Applied Mathematics, 357-406, CRC Press, Boca Raton, FL, 2000.
41. A. F. Ware, Fast approximate Fourier transforms for irregularly spaced data. SIAM Rev., 40, 838-856, 1998.