Empirical Evaluation of Typical Sparse Fast Fourier Transform Algorithms

Empirical Evaluation of Typical Sparse Fast Fourier Transform Algorithms

Computing the Sparse Fast Fourier Transform(sFFT) has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal’s inherent characteristics that a large number of signals are sparse in the frequency domai...

Full description

Bibliographic Details
Main Authors: Zhikang Jiang, Jie Chen, Bin Li
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Sparse Fast Fourier Transform(sFFT)
flat filter
spike train filter
Dirichlet kernel filter bank
sub-linear algorithms
computational complexity
Online Access:https://ieeexplore.ieee.org/document/9475507/

Internet

https://ieeexplore.ieee.org/document/9475507/

Similar Items