We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transform (NUFFT) algorithms based on the Gaussian gridding to fulfill a prescribed accuracy. This is a problem of significant interest in many areas of applied electromagnetics, as for example fast antenna analysis and synthesis and fast calculation of the scattered fields, as well as in medical imaging comprising ultrasound tomography, computed axial tomography, positron emission tomography and magnetic resonance imaging. The approach is related to the one dimensional case and follows the work in [15]. The accuracy of the proposed choice is first numerically assessed and then compared to that achieved by the approach in [2]. The convenience of t...
We illustrate the use of Non-Uniform Fast Fourier Transform (NUFFT) routines in "complex" (i.e., amp...
We show that the aggregation and disaggregation stages of the Fast Multipole Method (FMM) can be eff...
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) ...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
We discuss how the parameters of 1D Type 3 Non-Uniform Fast Fourier Transform (NUFFT) algorithms bas...
We deal with an optimized approach for implementing non-uniform fast Fourier transform (NUFFT) algor...
Abstract—Based on the regular Fourier matrix, a new set of ac-curacy factors is proposed for the non...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We deal with an approach based on Non-Uniform FFTs (NUFFTs) of type-3 and on a pruned FFT to efficie...
We deal with developing an optimized approach for implementing nonuniform fast Fourier transform (NU...
The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to ...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
Near-field antenna characterization consists of measuring, on proper scanning surfaces, the near-fie...
We illustrate the use of Non-Uniform Fast Fourier Transform (NUFFT) routines in "complex" (i.e., amp...
We show that the aggregation and disaggregation stages of the Fast Multipole Method (FMM) can be eff...
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) ...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
We discuss how the parameters of 1D Type 3 Non-Uniform Fast Fourier Transform (NUFFT) algorithms bas...
We deal with an optimized approach for implementing non-uniform fast Fourier transform (NUFFT) algor...
Abstract—Based on the regular Fourier matrix, a new set of ac-curacy factors is proposed for the non...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We deal with an approach based on Non-Uniform FFTs (NUFFTs) of type-3 and on a pruned FFT to efficie...
We deal with developing an optimized approach for implementing nonuniform fast Fourier transform (NU...
The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to ...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
Near-field antenna characterization consists of measuring, on proper scanning surfaces, the near-fie...
We illustrate the use of Non-Uniform Fast Fourier Transform (NUFFT) routines in "complex" (i.e., amp...
We show that the aggregation and disaggregation stages of the Fast Multipole Method (FMM) can be eff...
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) ...