Skip to main content
Book Chapter

Fast Fourier Transforms for Nonequispaced Data: A Tutorial

  • Potts D
  • Steidl G
  • Tasche M
Birkhäuser Boston, (2001), 247-270
DOI: 10.1007/978-1-4612-0143-4_12
N/ACitations
Citations of this article
124Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this section, we consider approximate methodsfor the fast computiation of multivariate discreteFourier transforms for nonequispaced data (NDFT) inthe time domain and in the frequency domain. Inparticular, we are interested in the approximationerror as function of arithmetic complexity of thealgorithm. We discuss the robustness ofNDFT-algorithms with respect to roundoff errors andapply NDFT-algorithms for the fast computation ofBessel transforms.

Cite

CITATION STYLE

APA

Potts, D., Steidl, G., & Tasche, M. (2001). Fast Fourier Transforms for Nonequispaced Data: A Tutorial. In Modern Sampling Theory (pp. 247–270). Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-0143-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free