On the computation of the polar FFT

Applied and Computational Harmonic Analysis

Volumn 22, Issue 2, 2007, Pages 257-263

  Fenn, Markus ^a   Kunis, Stefan ^b   Potts, Daniel ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

FFT; Linogram grid; NFFT; Nonequispaced FFT; Polar Fourier transform; Polar grid; USFFT

Indexed keywords

EID: 33846620999     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2006.05.009     Document Type: Letter

References (19)

1. A. Averbuch, R. Coifman, D. Donoho, M. Elad, M. Israeli, Fast and accurate polar Fourier transform, Appl. Comput. Harmon. Anal., in press
2. A. Averbuch, R. Coifman, D. Donoho, M. Israeli, J. Walden, Fast slant stack: A notion of Radon transform for data in a Cartesian grid which is rapidly computible, algebraically exact, geometrically faithful and invertible, SIAM J. Sci. Comput., in press
3. Bailey D., and Swarztrauber P. The fractional Fourier transform and applications. SIAM Rev. 33 (1991) 389-404
4. Bass R., and Gröchenig K. Random sampling of multivariate trigonometric polynomials. SIAM J. Math. Anal. 36 (2004) 773-795
5. Beylkin G. On the fast Fourier transform of functions with singularities. Appl. Comput. Harmon. Anal. 2 (1995) 363-381
6. E. Candes, L. Demanet, D. Donoho, L. Ying, Fast discrete curvelet transforms, SIAM Multiscale Model. Simul., in press
7. Dutt A., and Rokhlin V. Fast Fourier transforms for nonequispaced data. SIAM J. Sci. Stat. Comput. 14 (1993) 1368-1393
8. Feichtinger H., Gröchenig K., and Strohmer T. Efficient numerical methods in non-uniform sampling theory. Numer. Math. 69 (1995) 423-440
9. Frigo M., and Johnson S.G. FFTW, a C Subroutine Library. http://www.fftw.org/
10. Gröchenig K. A discrete theory of irregular sampling. Linear Algebra Appl. 193 (1993) 129-150
11. Hogan J.A., and Lakey J.D. Time-Frequency and Time-Scale Methods: Wavelets, Sampling, Uncertainty Principles. Appl. Numer. Harmon. Anal. (2005), Birkhäuser, Boston
12. Kunis S., and Potts D. NFFT, Softwarepackage, C Subroutine Library (2002-2005). http://www.tu-chemnitz.de/~potts/nfft
13. S. Kunis, D. Potts, Time and memory requirements of the nonequispaced FFT, preprint, TU-Chemnitz, 2006
14. J. Ma, M. Fenn, Combined complex ridgelet shrinkage and total variation minimization, SIAM J. Sci. Comput., in press
15. Natterer F. The Mathematics of Computerized Tomography (1986), Wiley, New York
16. Potts D., and Steidl G. A new linogram algorithm for computerized tomography. IMA J. Numer. Anal. 21 (2001) 769-782
17. Potts D., Steidl G., and Tasche M. Fast Fourier transforms for nonequispaced data: A tutorial. In: Benedetto J.J., and Ferreira P.J.S.G. (Eds). Modern Sampling Theory: Mathematics and Applications (2001), Birkhäuser, Boston 247-270
18. Steidl G. A note on fast Fourier transforms for nonequispaced grids. Adv. Comput. Math. 9 (1998) 337-353
19. Ware A.F. Fast approximate Fourier transforms for irregularly spaced data. SIAM Rev. 40 (1998) 838-856