Section 21
Free Access
Deterministic sparse FFT algorithms
Abstract
In this paper we consider sparse signals which are known to vanish outside a support interval of length bounded by m < N. For the case that m is known, we propose a deterministic algorithm of complexity for reconstruction of x from its discrete Fourier transform (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)
