稀疏傅里叶变换算法利用了数字信号处理，特别是高斯和多尔夫-切比雪夫滤波器的技术。与传统的解决方法不同，对于这个问题我们的算法是不迭代的。也就是说，它用一种类似绘制/流式算法的方式“一次”识别并估计k个最大系数，而并非估计“大”系数以及在提示下相减、递归。-Sparse Fast Fourier Transform (SFFT) is a class of sub-linear time algorithms for computing the discrete Fourier

transform of a time domain signal which is sparse in the frequency domain, i.e. there are very few “large”

coefficients in the frequency domain. The algorithm was presented in [1]. As reported in that paper, experiments

with two C++ implementations of the algorithm (SFFT 1.0 and 2.0) demonstrates practical improvement in

the runtime over Fast Fourier Transform (FFT) for a wide range of signal sparsities.