Nonuniform fast fourier transforms using min-max interpolation
Top Cited Papers
- 22 January 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 51 (2) , 560-574
- https://doi.org/10.1109/tsp.2002.807005
Abstract
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 min-max sense of minimizing the worst-case approximation error over all signals of unit norm. The proposed method easily generalizes to multidimensional signals. Numerical results show that the min-max approach provides substantially lower approximation errors than conventional interpolation methods. The min-max criterion is also useful for optimizing the parameters of interpolation kernels such as the Kaiser-Bessel function.Keywords
This publication has 55 references indexed in Scilit:
- Warped discrete cosine transform and its application in image compressionIEEE Transactions on Circuits and Systems for Video Technology, 2000
- Nonuniform fast Fourier transformGeophysics, 1999
- Discrete frequency warped wavelets: theory and applicationsIEEE Transactions on Signal Processing, 1998
- Fast Approximate Fourier Transforms for Irregularly Spaced DataSIAM Review, 1998
- A note on fast Fourier transforms for nonequispaced gridsAdvances in Computational Mathematics, 1998
- Rapid Computation of the Discrete Fourier TransformSIAM Journal on Scientific Computing, 1996
- The nonuniform discrete Fourier transform and its applications in filter design. I. 1-DIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1996
- On the Fast Fourier Transform of Functions with SingularitiesApplied and Computational Harmonic Analysis, 1995
- Fast Fourier Transforms for Nonequispaced Data, IIApplied and Computational Harmonic Analysis, 1995
- Fast Fourier Transforms for Nonequispaced DataSIAM Journal on Scientific Computing, 1993