7 citations · 9 across the 2 of their papers we have counts for
3 papers
math.NA2018
Real Sparse Fast DCT for Vectors with Short Support
Sina Bittens, Gerlind Plonka
In this paper we present a new fast and deterministic algorithm for the inverse discrete cosine transform of type II for reconstructing the input vector ,…
math.NA2018★ 7 cited
Sparse Fast DCT for Vectors with One-block Support
Sina Bittens, Gerlind Plonka
In this paper we present a new fast and deterministic algorithm for the inverse discrete cosine transform of type II that reconstructs the input vector $\mathbf{x}\in\mathbb{R}^{N}…
math.NA2017★ 2 cited
A Deterministic Sparse FFT for Functions with Structured Fourier Sparsity
Sina Bittens, Ruochuan Zhang, Mark A. Iwen
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhi…