A sparse fast Fourier algorithm for real non-negative vectors

作者：

Highlights：

•

摘要

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

论文关键词：65T50,42A38,Discrete Fourier transform,Sparse Fourier reconstruction,Sublinear sparse FFT

论文评审过程：Received 17 February 2016, Revised 16 January 2017, Available online 22 March 2017, Version of Record 5 April 2017.

论文官网地址：https://doi.org/10.1016/j.cam.2017.03.019