Spiral-generated modular FFT algorithms

Authors:
Lingchuan Meng;Yevgen Voronenko;Jeremy R. Johnson;Marc Moreno Maza;Franz Franchetti;Yuzhen Xie
Affiliations:
Drexel University, Philadelphia, PA;Carnegie Mellon University, Pittsburgh, PA;Drexel University, Philadelphia, PA;University of Western Ontario, London, Canada;Carnegie Mellon University, Pittsburgh, PA;University of Western Ontario, London, Canada
Venue:
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Year:
2010

Citing 5
Cited 1

Implementation techniques for fast polynomial arithmetic in a high-level programming environment

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
FFT program generation for shared memory: SMP and multicore

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Computations modulo regular chains

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A rewriting system for the vectorization of signal transforms

VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Efficient implementation of polynomial arithmetic in a multiple-level programming environment

ICMS'06 Proceedings of the Second international conference on Mathematical Software

Towards parallel general-size library generation for polynomial multiplication

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.