On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm

DOI10.1109/TSP.2017.2740198MaRDI QIDQ4621928zbMATH OpenOpenAlexFDO

Authors Guilin Chen, Shang-Ho Tsai, Kai-Jiun Yang

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2017.2740198

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• Performance of the multiscale sparse fast Fourier transform algorithm
• scientific article; zbMATH DE number 6796498
• scientific article; zbMATH DE number 7053345
• The sparse Fourier transform: theory and practice
• Nearly optimal sparse Fourier transform
• Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
• A sparse data fast fourier transform (SDFFT)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
• Empirical evaluation of a sub-linear time sparse DFT algorithm

Cited in

(2)

• Optimized Spectrum Permutation for the Multidimensional Sparse FFT
• Performance of the multiscale sparse fast Fourier transform algorithm

This page was built for publication: On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621928)