Fast Fourier transforms for nonequispaced data
SIAM Journal on Scientific Computing
Efficient numerical methods in non-uniform sampling theory
Numerische Mathematik
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
ACM Transactions on Mathematical Software (TOMS)
Nonuniform fast Fourier transforms using min-max interpolation
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
This paper proposes a fast algorithm, called the SpiralFFT, that computes samples of the 3-D discrete Fourier transform of an object of interest along spiral contours in frequency space. This type of sampling geometry is prevalent in 3-D magnetic resonance imaging, as spiral sampling patterns allow for rapid, uninterrupted scanning over a large range of frequencies. We show that parameterizing the spiral contours in a certain way allows us to decompose the computation into a series of 1-D transforms, meaning that the 3-D transform is effectively separable, while still yielding spiral sampling patterns that are geometrically faithful and provide dense coverage of 3-D frequency space. We present a number of simulations which demonstrate that the SpiralFFT compares favorably to a state-of-the-art algorithm for computing general non-uniform discrete Fourier transforms.