On the computation of the polar FFT
type: Item
instance of: scholarly article
title: On the computation of the polar FFT
zbMATH Open document ID: 1110.65128
author: Markus Fenn
author: Stefan Kunis
author: Daniel Potts
published in: Applied and Computational Harmonic Analysis
publication date: 2007-03-08T00:00:00Z
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 5131623
zbMATH Keywords: nonequispaced FFT
zbMATH Keywords: polar Fourier transform
zbMATH Keywords: polar grid
zbMATH Keywords: linogram grid
zbMATH Keywords: signal reconstruction
zbMATH Keywords: numerical examples
zbMATH Keywords: fast Fourier transform
describes a project that uses: NFFT
MaRDI profile type: Publication
full work available at URL: j.acha.2006.05.009
OpenAlex ID: W2010566374
cites work: Fast and accurate polar Fourier transform
cites work: The Fractional Fourier Transform and Applications
cites work: Random Sampling of Multivariate Trigonometric Polynomials
cites work: On the fast Fourier transform of functions with singularities
cites work: Fast Discrete Curvelet Transforms
cites work: Fast Fourier Transforms for Nonequispaced Data
cites work: Efficient numerical methods in non-uniform sampling theory
cites work: A discrete theory of irregular sampling
cites work: Time-frequency and time-scale methods. Adaptive decompositions, uncertainty principles, and sampling
cites work: Q5190155
cites work: Combined Complex Ridgelet Shrinkage and Total Variation Minimization
cites work: Q3754464
cites work: A new linogram algorithm for computerized tomography
cites work: A note on fast Fourier transforms for nonequispaced grids
cites work: Fast Approximate Fourier Transforms for Irregularly Spaced Data
DOI: 10.1016/J.ACHA.2006.05.009
description: scientific article; zbMATH DE number 5131623