Application Research on Sparse Fast Fourier Transform Algorithm in White Gaussian Noise

In sparse fast Fourier transform algorithm, noise will increase the difficulty in frequency location. As to this problem, probability of detected frequency are analyzed with respect to noise level and bucket in this paper. Firstly different mean and variance of compressed vector in frequency domain are derived under the hypothesis of whether there is a signal, then these statistical characteristics are used to analyze the impact of signal-to-noise ratio and number of point per bucket on detection probability of frequency. Finally, simulation curves is given under the conditions of different noise and bucket. Simulation shows that frequency of signal with additive white Gaussian noise could be effectively detected when SNR is higher than 10dB and number of point per bucket smaller than 212. And in order to ensure effective detection of frequency, when SNR decrease, number of point per bucket should be reduced. Through the analysis, this paper provides a theoretical support to enhance the reliability of the algorithm.

[1]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[2]  Anantha P. Chandrakasan,et al.  Data driven signal processing: an approach for energy efficient computing , 1996, Proceedings of 1996 International Symposium on Low Power Electronics and Design.

[3]  Eyal Kushilevitz,et al.  Learning Decision Trees Using the Fourier Spectrum , 1993, SIAM J. Comput..

[4]  Sudipto Guha,et al.  Near-optimal sparse fourier representations via sampling , 2002, STOC '02.

[5]  Ingrid Daubechies,et al.  A Sparse Spectral Method for Homogenization Multiscale Problems , 2007, Multiscale Model. Simul..

[6]  Piotr Indyk,et al.  Simple and practical algorithm for sparse Fourier transform , 2012, SODA.

[7]  Piotr Indyk,et al.  Sample-Optimal Fourier Sampling in Any Constant Dimension , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[8]  Mark A. Iwen,et al.  Empirical evaluation of a sub-linear time sparse DFT algorithm , 2007 .

[9]  Piotr Indyk,et al.  Nearly optimal sparse fourier transform , 2012, STOC '12.

[10]  Mark A. Iwen,et al.  Combinatorial Sublinear-Time Fourier Algorithms , 2010, Found. Comput. Math..

[11]  Anna C. Gilbert,et al.  Improved time bounds for near-optimal sparse Fourier representations , 2005, SPIE Optics + Photonics.

[12]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[13]  Piotr Indyk,et al.  Sample-optimal average-case sparse Fourier Transform in two dimensions , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Andrea Montanari,et al.  The Noise-Sensitivity Phase Transition in Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[15]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.