Nonequispaced fast Fourier transforms without oversampling
Stefan Kunis · PAMM · 2008
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)