Uniform error estimates for nonequispaced fast Fourier transforms

In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. So far, various window functions have been used and new window functions have recently been pro...

Full description

Saved in:
Bibliographic Details
Published in:Sampling theory, signal processing, and data analysis signal processing, and data analysis, 2021-12, Vol.19 (2), Article 17
Main Authors: Potts, Daniel, Tasche, Manfred
Format: Article
Language:English
Subjects:
Abstract Harmonic Analysis
Machine Learning
Mathematics
Mathematics and Statistics
Original Article
Signal,Image and Speech Processing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. So far, various window functions have been used and new window functions have recently been proposed. We present novel error estimates for NFFT with compactly supported, continuous window functions and derive rules for convenient choice from the parameters involved in NFFT. The error constant of a window function depends mainly on the oversampling factor and the truncation parameter.
ISSN:2730-5716
2730-5724
DOI:10.1007/s43670-021-00017-z