no code implementations • 15 Dec 2020 • Bin Li, Zhikang Jiang, Jie Chen
Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time.
no code implementations • 11 Nov 2020 • Bin Li, Zhikang Jiang, Jie Chen
In the second part, we make two categories of experiments for computing the signals of different SNR, different N, different K by a standard testing platform and record the run time, percentage of the signal sampled and L0, L1, L2 error both in the exactly sparse case and general sparse case.
no code implementations • 11 Nov 2020 • Bin Li, Zhikang Jiang, Jie Chen
The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal inherent characteristics that a large number of signals are sparse in the frequency domain(e. g., sensors, video data, audio, medical image, etc.).
