Deterministic Sparse Sublinear FFT with Improved Numerical Stability
share
In this paper we extend the deterministic sublinear FFT algorithm for fast reconstruction of M-sparse vectors of length N= 2^J considered in Plonka et al. (2018). Our numerical experiences show that our modification has a huge impact on the stability of the algorithm, while the runtime of the algorithm is still O(M^2 log N).
READ FULL TEXT