Fast interpolation of bandlimited functions
Samuel F. Potter, Nail A. Gumerov, Ramani Duraiswami
Abstract
The nonuniform fast Fourier transform comprises a set of algorithms which approximately interpolate the usual discrete Fourier transform in the time and/or frequency domain. A nonuniform fast Fourier transform based on the fast multipole method was previously developed but passed over in favor of other approaches [1, 2]. This work extends a recent method for computing a periodized fast multipole method [3] with an adaptive algorithm that reduces the required number of multipole-to-local and local-to-local translations by an order of magnitude. This combination improves the speed and accuracy of the original algorithm, and results in an algorithm that is competitive with other nonuniform fast Fourier transforms. Numerical experiments are carried out comparing our implementation with others, demonstrating its viability.
BibTeX
@inproceedings{icassp2017_fastinterpolatio,
title = {Fast interpolation of bandlimited functions},
author = {Samuel F. Potter and Nail A. Gumerov and Ramani Duraiswami},
booktitle = {ICASSP 2017},
year = {2017}
}