FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time

DOI10.1109/TIT.2017.2746568zbMath1477.65273OpenAlexW2752855532MaRDI QIDQ4566644

Sameer A. Pawar, Kannan Ramchandran

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2746568

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (3)

Performance of the multiscale sparse fast Fourier transform algorithm ⋮ A discrete dynamics approach to sparse calculation and applied in ontology science ⋮ A note on the high-dimensional sparse Fourier transform in the continuous setting*

This page was built for publication: FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time