A deterministic sparse FFT framework reduces candidate pairs via keyed multi-view CRT gating and achieves O(sqrt(N) log k) expected time through peeling recovery and self-reduction while guaranteeing O(N log N) worst-case via dense fallback.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Sparse FFT via Keyed Multi-View Gating with $O(\sqrt{N} \log k)$ Expected Time
A deterministic sparse FFT framework reduces candidate pairs via keyed multi-view CRT gating and achieves O(sqrt(N) log k) expected time through peeling recovery and self-reduction while guaranteeing O(N log N) worst-case via dense fallback.