20 citations · 39 across the 2 of their papers we have counts for
2 papers
math.NA2016★ 20 cited
A sparse Fast Fourier Algorithm for Real Nonnegative Vectors
Gerlind Plonka, Katrin Wannenwetsch
In this paper we propose a new fast Fourier transform to recover a real nonnegative signal from its discrete Fourier transform. If the signal appears to hav…
math.NA2015★ 19 cited
A deterministic sparse FFT algorithm for vectors with small support
Gerlind Plonka, Katrin Wannenwetsch
In this paper we consider the special case where a discrete signal of length N is known to vanish outside a support interval of length . If the support length …