Efficient calculations of 3-D FFTs on spiral contours

DOI10.1007/S10915-011-9534-YzbMath1241.65126OpenAlexW2104894531MaRDI QIDQ427174

Christopher K. Turnes, Justin Romberg

Publication date: 13 June 2012

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-011-9534-y

zbMATH Keywords

algorithmdiscrete Fourier transformmagnetic resonance imagingnonuniform FFTchirp Z-transformspiral contoursspiral MRI

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

SpiralFFT

Uses Software

• FFTW
• NFFT3

Cites Work

• Fast and accurate polar Fourier transform
• On the computation of the polar FFT
• A note on fast Fourier transforms for nonequispaced grids
• Efficient numerical methods in non-uniform sampling theory
• On the fast Fourier transform of functions with singularities
• Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Fourier Transforms for Nonequispaced Data
• Accelerating the Nonuniform Fast Fourier Transform
• Nonuniform fast fourier transforms using min-max interpolation

This page was built for publication: Efficient calculations of 3-D FFTs on spiral contours