A sparse fast Fourier algorithm for real non-negative vectors

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̂=FNx∈CN. If the signal x appears to have a short support, i.e., vanishes outside a support interval of length m