Skip to main content
Journal ArticleOPEN ACCESS

Nonequispaced fast Fourier transforms without oversampling

  • Kunis S
PAMM (2008) 8(1) 10977-10978
DOI: 10.1002/pamm.200810977
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recently, the fast Fourier transform (FFT) has been generalised for arbitrary sampling nodes by the use of approximation schemes. We show that such nonequispaced FFTs can be implemented without oversampling, i.e., no extra memory besides the input and output array is needed. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Cite

CITATION STYLE

APA

Kunis, S. (2008). Nonequispaced fast Fourier transforms without oversampling. PAMM, 8(1), 10977–10978. https://doi.org/10.1002/pamm.200810977

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