Performance evaluation and parameter optimization of sparse Fourier transform

Abstract The sparse Fourier transform (SFT) dramatically accelerates spectral analyses by leveraging the inherit sparsity in most natural signals. However, a satisfactory trade-off between the estimation performance and the computational complexity commonly requires sophisticated empirical parameter tuning. In this work, we attempt to further enhance SFT by optimizing the parameter selection mechanism. We first derive closed-form expressions of objective performance metrics. On top of this, a parameter optimization algorithm is designed to minimize the complexity, under the premise that the performance metrics can meet the specified requirements. The proposed scheme, termed as optimized SFT, is shown to be able to automatically determine the optimized parameter settings as per the a priori knowledge and the performance requirements in the numerical simulations. Experimental studies of continuous-wave radar detection are also conducted to demonstrate the potential of the optimized SFT in the practical application scenarios.

[1]  Hongchi Zhang,et al.  Parameter Optimization of Sparse Fourier Transform for Radar Target Detection , 2020, 2020 IEEE Radar Conference (RadarConf20).

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

[3]  Shang-Ho Tsai,et al.  On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm , 2017, IEEE Transactions on Signal Processing.

[4]  Mohamed-Slim Alouini,et al.  Some new results for integrals involving the generalized Marcum Q function and their application to performance evaluation over fading channels , 2003, IEEE Trans. Wirel. Commun..

[5]  Piotr Indyk,et al.  Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data , 2014, IEEE Signal Processing Magazine.

[6]  Tao Shan,et al.  A fast pulse compression algorithm based on sparse inverse fourier transform , 2016, 2016 CIE International Conference on Radar (RADAR).

[7]  Gonzalo R. Arce,et al.  Optimized Spectrum Permutation for the Multidimensional Sparse FFT , 2017, IEEE Transactions on Signal Processing.

[8]  Yue Wang,et al.  Sparse Discrete Fractional Fourier Transform and Its Applications , 2014, IEEE Transactions on Signal Processing.

[9]  Hassan Foroosh,et al.  An Exact and Fast Computation of Discrete Fourier Transform for Polar and Spherical Grid , 2017, IEEE Transactions on Signal Processing.

[10]  Vishal M. Patel,et al.  The Robust Sparse Fourier Transform (RSFT) and Its Application in Radar Signal Processing , 2017, IEEE Transactions on Aerospace and Electronic Systems.

[11]  Piotr Indyk,et al.  Faster GPS via the sparse fourier transform , 2012, Mobicom '12.

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

[13]  Yan Han,et al.  High-Speed Target Detection Algorithm Based on Sparse Fourier Transform , 2018, IEEE Access.

[14]  Kannan Ramchandran,et al.  R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT , 2018, IEEE Transactions on Information Theory.

[15]  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).

[16]  Xiaohan Yu,et al.  Fast Detection Method for Low-Observable Maneuvering Target via Robust Sparse Fractional Fourier Transform , 2020, IEEE Geoscience and Remote Sensing Letters.

[17]  Kannan Ramchandran,et al.  FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time , 2018, IEEE Transactions on Information Theory.

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

[19]  Omid Salehi-Abari,et al.  GHz-wide sensing and decoding using the sparse Fourier transform , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[20]  Alexander López-Parrado,et al.  Cooperative Wideband Spectrum Sensing Based on Sub-Nyquist Sparse Fast Fourier Transform , 2016, IEEE Transactions on Circuits and Systems II: Express Briefs.

[21]  Frédo Durand,et al.  Light Field Reconstruction Using Sparsity in the Continuous Fourier Domain , 2014, ACM Trans. Graph..