Nonuniform fast Fourier transforms using min-max interpolation

  title={Nonuniform fast Fourier transforms using min-max interpolation},
  author={Jeffrey A. Fessler and Bradley P. Sutton},
  journal={IEEE Trans. Signal Process.},
  • J. FesslerB. Sutton
  • Published 1 February 2003
  • Engineering, Computer Science
  • IEEE Trans. Signal Process.
The fast Fourier transform (FFT) is used widely in signal processing for efficient computation of the FT of finite-length signals over a set of uniformly spaced frequency locations. However, in many applications, one requires nonuniform sampling in the frequency domain, i.e., a nonuniform FT. Several papers have described fast approximations for the nonuniform FT based on interpolating an oversampled FFT. This paper presents an interpolation method for the nonuniform FT that is optimal in the… 

Optimized Least-Square Nonuniform Fast Fourier Transform

  • M. Jacob
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2009
A memory efficient approximation to the nonuniform Fourier transform of a support limited sequence is derived based on the theory of shift-invariant representations and an exact expression for the worst-case mean square approximation error is derived.

Fast interpolation of bandlimited functions

This work extends a recent method for computing a periodized fast multipole method with an adaptive algorithm that reduces the required number of multipole-to-local and local- to-local translations by an order of magnitude, and results in an algorithm that is competitive with other nonuniform fast Fourier transforms.

Accelerating the Nonuniform Fast Fourier Transform

This paper observes that one of the standard interpolation or "gridding" schemes, based on Gaussians, can be accelerated by a significant factor without precomputation and storage of the interpolation weights, of particular value in two- and three- dimensional settings.

A Nonuniform Fast Fourier Transform Based on Low Rank Approximation

A fast and quasi-optimal algorithm for computing the NUDFT based on the fast Fourier transform (FFT) is proposed, which is essentially the FFT, and is competitive with state-of-the-art algorithms.

A SVD-based algorithm for dense Nonuniform fast Fourier Transform

This work introduces a fast algorithm based on Singular Value Decomposition to compute the Nonuniform Fourier Transform, which results to be optimum for dense nonuniformly sampled frequencies.

A novel algorithm for computing nonuniform Fourier Transform

This paper presents a different approach, in which an approximation method to the complex exponentials via Legendre polynomials is combined with FFT to compute the nonuniform FT.

The type 3 nonuniform FFT and its applications June -

The nonequispaced or nonuniform fast Fourier transform (NUFFT) arises in a variety of application areas, including imaging processing and the numerical solution of partial differential equations. In

Spectrum Estimation of Pseudo-random Nonuniformly Sampled Signals in the Fractional Fourier Transform Domain

  • Xu HuifaLiu Feng
  • Computer Science
    2010 WASE International Conference on Information Engineering
  • 2010
First, the digital spectrum of nonuniformly sampled signals in the Fractional Fourier transform domain is introduced and the result shows that these theories are also effective in the fractional Fouriers transform domain.

Non-Uniform Sparse Fourier Transform and Its Applications

A novel estimation algorithm is constructed for NUDFT-II, which is the general form of the sparse Fourier transform (SFT), and the cyclic convolution in the non-uniform frequency domain is proposed and derive the product and convolution theorem.

Optimized Nonuniform FFTs and Their Application to Array Factor Computation

An optimized approach for implementing nonuniform fast Fourier transform (NUFFT) algorithms under a general and new perspective for 1-D transformations is developed and results demonstrate that the method is more accurate and does not introduce any additional computational or memory burden.



A min-max approach to the multidimensional nonuniform FFT: application to tomographic image reconstruction

  • B. SuttonJ. Fessler
  • Computer Science
    Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)
  • 2001
This paper presents a method for the nonuniform FT that is optimal in a min-max sense, and minimizes the worst-case approximation error over all signals of unit norm.

Nonuniform fast Fourier transform

Numerical experiments for 1-D and 2-D implementations confirm the theoretically predicted accuracy and efficiency properties of the NFFT, and a numerically optimized filter shows the best results.

A frequency-domain approach to interpolation from a nonuniform grid

On the Fast Fourier Transform of Functions with Singularities

An explicit approximation of the Fourier Transform of generalized functions of functions with singularities based on projecting such functions on a subspace of Multiresolution Analysis is obtained and a fast algorithm based on its evaluation is developed.

Analysis and design of minimax-optimal interpolators

  • Hyeokho ChoiD. Munson
  • Computer Science
    1995 International Conference on Acoustics, Speech, and Signal Processing
  • 1995
The authors consider a class of interpolation algorithms that includes the least-squares optimal interpolator proposed by J.L. Yen, and derive a closed-form expression of the interpolation error for interpolators of this type.

A novel method for designing FIR digital filters with nonuniform frequency samples

Attractive features of the proposed method are the applicability to unequally spaced samples, the recursive and semipermanent computation of filter parameters, the capability of obtaining short transition bands or sharp cut-off frequency responses, and the design of efficient algorithms for real-time applications.

Fast Fourier Transforms for Nonequispaced Data, II

A group of algorithms generalizing the fast Fourier transform to the case of noninteger frequencies and nonequispaced nodes on the interval [-π, π] is presented, and it turns out that the scheme of Dutt et al. is preferable for the forward problem, while the method introduced here is considerably more efficient for the inverse one.

An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's)

Based on the (m, N, q)-regular Fourier matrix, a new algorithm is proposed for fast Fourier transform (FFT) of nonuniform (unequally spaced) data with accuracy much better than previously reported results with the same computation complexity.

The gridding method for image reconstruction by Fourier transformation

The authors explore a computational method for reconstructing an n-dimensional signal f from a sampled version of its Fourier transform f;, which provides a fast and accurate alternative to the filtered backprojection.

Nonuniform fast Hankel transform (NUFHT) algorithm.

The newly developed, to the authors' knowledge, nonuniform fast Fourier transform algorithm is used for the fast computation of Hankel transforms on a set of non uniformly spaced sample points.