(Nearly) Sample-optimal sparse Fourier transform in any dimension; RIPless and Filterless

V Nakos, Z Song, Z Wang - 2019 IEEE 60th Annual Symposium …, 2019 - ieeexplore.ieee.org
In this paper, we consider the extensively studied problem of computing a k-sparse
approximation to the d-dimensional Fourier transform of a length n signal. Our algorithm …
被引用次数：13 相关文章

(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless

V Nakos, Z Song, Z Wang - 2019 IEEE 60th Annual Symposium on …, 2019 - computer.org
In this paper, we consider the extensively studied problem of computing a k-sparse
approximation to the d-dimensional Fourier transform of a length n signal. Our algorithm …

2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)

V Nakos, Z Song, Z Wang - conferences.computer.org
In this paper, we consider the extensively studied problem of computing a k-sparse
approximation to the d-dimensional Fourier transform of a length n signal. Our algorithm …

(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless

V Nakos, Z Song, Z Wang - arXiv e-prints, 2019 - ui.adsabs.harvard.edu
In this paper, we consider the extensively studied problem of computing a $ k $-sparse
approximation to the $ d $-dimensional Fourier transform of a length $ n $ signal. Our …

(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless

V Nakos, Z Song, Z Wang - arXiv preprint arXiv:1909.11123, 2019 - arxiv.org
In this paper, we consider the extensively studied problem of computing a $ k $-sparse
approximation to the $ d $-dimensional Fourier transform of a length $ n $ signal. Our …