arxivcs.LGcs.AImath.NA2026-06-29
Structure of the Circular-Dyadic Convolution Error
Ben Fauber, Alireza Moradzadeh
Dyadic and circular convolution can both be computed in $O(N\log N)$ time using the Hadamard transform and the FFT-computed discrete Fourier transform (DFT), respectively. The Hadamard transform is preferable for its real-valued sign flips, yet its substitution for the DFT introd…