Preprint
Sep 2026
Exact Factorisation and Fast Computation of Invertible Constant-Q Transforms
The proposed implementation of Flash-CQT reduces analysis-synthesis round-trip time by factors of two to eight relative to a baseline computing the same CQT, and uses over 30% less peak temporary workspace and reaches a negligible reconstruction error.
Facundo Franchino, Eloi Moliner, V. Välimäki
· 0 citations