Proves Ω(k²) adversarial lower bound for non-coprime CRT sparse FFT and introduces certified framework with bucket/candidate checks plus adaptive dense fallback to enforce O(N log N) worst-case complexity.
The residue number system,
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
-
Safety-Certified CRT Sparse FFT: $\Omega(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
Proves Ω(k²) adversarial lower bound for non-coprime CRT sparse FFT and introduces certified framework with bucket/candidate checks plus adaptive dense fallback to enforce O(N log N) worst-case complexity.