On the computation of the polar FFT

DOI10.1016/j.acha.2006.05.009zbMath1110.65128OpenAlexW2010566374MaRDI QIDQ869654

Markus Fenn, Daniel Potts, Stefan Kunis

Publication date: 8 March 2007

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2006.05.009

zbMATH Keywords

numerical examplesfast Fourier transformsignal reconstructionpolar Fourier transformlinogram gridnonequispaced FFTpolar grid

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

Fourier–Bessel series of compactly supported convolutions on disks ⋮ Motion detection in diffraction tomography by common circle methods ⋮ Efficient calculations of 3-D FFTs on spiral contours ⋮ Numerical stability of nonequispaced fast Fourier transforms ⋮ Direct Inversion of the Three-Dimensional Pseudo-polar Fourier Transform

Uses Software

• NFFT

Cites Work

• Fast and accurate polar Fourier transform
• A note on fast Fourier transforms for nonequispaced grids
• A discrete theory of irregular sampling
• Efficient numerical methods in non-uniform sampling theory
• Time-frequency and time-scale methods. Adaptive decompositions, uncertainty principles, and sampling
• On the fast Fourier transform of functions with singularities
• A new linogram algorithm for computerized tomography
• The Fractional Fourier Transform and Applications
• Combined Complex Ridgelet Shrinkage and Total Variation Minimization
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Fourier Transforms for Nonequispaced Data
• Random Sampling of Multivariate Trigonometric Polynomials
• Fast Discrete Curvelet Transforms
• Unnamed Item
• Unnamed Item