Results 1 -
3 of
3
Fast Fourier transforms for nonequispaced data: A tutorial
, 2000
"... In this section, we consider approximative methods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the frequency domain. In particular, we are interested in the approximation error as function of the arithmetic complexity o ..."
Abstract
-
Cited by 92 (30 self)
- Add to MetaCart
In this section, we consider approximative methods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the frequency domain. In particular, we are interested in the approximation error as function of the arithmetic complexity of the algorithm. We discuss the robustness of NDFT-algorithms with respect to roundoff errors and apply NDFT-algorithms for the fast computation of Bessel transforms.
New Fourier reconstruction algorithms for computerized tomography
"... In this paper, we propose two new algorithms for high quality Fourier reconstructions of digital N × N images from their Radon transform. Both algorithms are based on fast Fourier transforms for nonequispaced data (NFFT) and require only O(N²log N) arithmetic operations. While the rst alg ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
In this paper, we propose two new algorithms for high quality Fourier reconstructions of digital N × N images from their Radon transform. Both algorithms are based on fast Fourier transforms for nonequispaced data (NFFT) and require only O(N²log N) arithmetic operations. While the rst algorithm includes a bivariate NFFT on the polar grid, the second algorithm consists of several univariate NFFTs on the so-called linogram.
