A structured review of sparse fast Fourier transform algorithms
E Rajaby, SM Sayedi - Digital Signal Processing, 2022 - Elsevier
Discrete Fourier transform (DFT) implementation requires high computational resources and
time; a computational complexity of order O (N 2) for a signal of size N. Fast Fourier …
time; a computational complexity of order O (N 2) for a signal of size N. Fast Fourier …
On performance of sparse fast Fourier transform algorithms using the flat window filter
B Li, Z Jiang, J Chen - IEEE Access, 2020 - ieeexplore.ieee.org
The problem of computing the Sparse Fast Fourier Transform (sFFT) of a K-sparse signal of
size N has received significant attention for a long time. The first stage of sFFT is hashing the …
size N has received significant attention for a long time. The first stage of sFFT is hashing the …
Empirical evaluation of typical sparse fast Fourier transform algorithms
Z Jiang, J Chen, B Li - IEEE Access, 2021 - ieeexplore.ieee.org
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 …
long time. The sFFT algorithms decrease the runtime and sampling complexity by taking …
Performance of the multiscale sparse fast Fourier transform algorithm
B Li, Z Jiang, J Chen - Circuits, Systems, and Signal Processing, 2022 - Springer
How to compute the sparse fast Fourier transform (sFFT) has been a critical topic for a long
period of time. sFFT algorithms have faster runtimes and reduced sampling complexities by …
period of time. sFFT algorithms have faster runtimes and reduced sampling complexities by …
On performance of sparse fast Fourier transform algorithms using the aliasing filter
B Li, Z Jiang, J Chen - Electronics, 2021 - mdpi.com
Computing the sparse fast Fourier transform (sFFT) has emerged as a critical topic for a long
time because of its high efficiency and wide practicability. More than twenty different sFFT …
time because of its high efficiency and wide practicability. More than twenty different sFFT …
SoC-FPGA implementation of the sparse fast Fourier transform algorithm
A López-Parrado… - 2017 IEEE 60th …, 2017 - ieeexplore.ieee.org
This brief presents the SoC-FPGA implementation of the modified Nearly Optimal Sparse
Fast Fourier Transform (sFFT) algorithm. The implementation was carried out by using …
Fast Fourier Transform (sFFT) algorithm. The implementation was carried out by using …
From FFT to sparse FFT: Innovations in efficient signal processing for large sparse data
A Shen - Theoretical and Natural Science, 2024 - ewadirect.com
This paper explores the advancements from the traditional Fast Fourier Transform (FFT) to
the Sparse Fast Fourier Transform (sFFT) and their implications for efficient signal …
the Sparse Fast Fourier Transform (sFFT) and their implications for efficient signal …
Empirical Evaluation of Typical Sparse Fast Fourier Transform Algorithms
B Li, Z Jiang, J Chen - arXiv preprint arXiv:2012.08238, 2020 - arxiv.org
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. The sFFT algorithms decrease the runtime and …
emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and …