Spiral-generated modular FFT algorithms
Lingchuan Meng, Yevgen Voronenko, Jeremy Russell Johnson, Marc Moreno Maza, Franz Franchetti, Yuzhen Xie · 2010
This paper presents an extension of the Spiral system to automatically generate and optimize FFT algorithms for the discrete Fourier transform over finite fields. The generated code is intended to support modular algorithms for multivariate polynomial computations in the modpn library used by Maple. The resulting code provides an order of magnitude speedup over the original implementations in the modpn library, and the Spiral system provides the ability to automatically tune the FFT code to different computing platforms.