Nonequispaced fast Fourier transforms for bandlimited functions
Abstract
In this paper we consider the problem of approximating function evaluations f( xj) at given nonequispaced points xj, j=1,… N, of a bandlimited function from given values f( k), k∈ I M, of its Fourier transform. Note that if a trigonometric polynomial is given, it is already known that this problem can be solved by means of the nonequispaced fast Fourier transform (NFFT). In other words, we introduce a new NFFT-like procedure for bandlimited functions, which is based on regularized Shannon sampling formulas.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.