The Applied and Numerical Harmonic Analysis (ANHA) book series aims to provide the
engineering, mathematical, and scientific communities with significant developments in …

Fast Fourier Transform has long been established as an essential tool in signal processing.
To address the computational issues while helping the analysis work for multi-dimensional …

In this paper, we derive a new deterministic sparse inverse fast Fourier transform (FFT)
algorithm for the case that the resulting vector is sparse. The sparsity needs not to be known …

We extend the recent sparse Fourier transform algorithm of [1] to the noisy setting, in which a
signal of bandwidth N is given as a superposition of k≪ N frequencies and additive random …

In this paper we propose a new fast Fourier transform to recover a real non-negative signal
x∈ R+ N from its discrete Fourier transform x ̂= FN x∈ C N. If the signal x appears to have …

For every fixed constant α> 0, we design an algorithm for computing the k-sparse Walsh-
Hadamard transform (ie, Discrete Fourier Transform over the Boolean cube) of an N …

We present a dimension-incremental algorithm for the nonlinear approximation of high-
dimensional functions in an arbitrary bounded orthonormal product basis. Our goal is to …

With the increasing size of datasets in wideband spectrum sensing, high-resolution radar
imaging and high-definition multimedia, real-time computation, and sample storage have …

In this paper we consider the special case where a signal x∈ ℂ N ∈\,C^N is known to
vanish outside a support interval of length m< N. If the support length m of x or a good bound …

Suppose an length signal has known frequency support of size. Given access to samples of
this signal, how fast can we compute the DFT? The answer to this question depends on the …