The discrete Fourier transform (DFT) is a fundamental component of numerous
computational techniques in signal processing and scientific computing. The most popular …

We consider the sparse Fourier transform problem: given a complex vector x of length n, and
a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transform of x …

We consider the problem of computing the k-sparse approximation to the discrete Fourier
transform of an n-dimensional signal. We show: An O (k log n)-time randomized algorithm for …

We present the first sample-optimal sublinear time algorithms for the sparse Discrete Fourier
Transform over a two-dimensional√ n×√ n grid. Our algorithms are analyzed for the …

We give an algorithm for ℓ 2/ℓ 2 sparse recovery from Fourier measurements using O (k log
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …

In this paper modified variants of the sparse Fourier transform algorithms from Iwen
(2010)[32] are presented which improve on the approximation error bounds of the original …

We consider the problem of computing ak-sparse approximation to the Fourier transform of a
length N signal. Our main result is a randomized algorithm for computing such an …

We consider the problem of computing ak-sparse approximation to the discrete Fourier
transform of an n-dimensional signal. Our main result is a randomized algorithm that …

We present a new deterministic algorithm for the sparse Fourier transform problem, in which
we seek to identify k≪ N significant Fourier coefficients from a signal of bandwidth N …

The problem of computing the Fourier Transform of a signal whose spectrum is dominated
by a small number k of frequencies quickly and using a small number of samples of the …