Skip to main content
Article thumbnail
Location of Repository

Spiral-Generated Modular FFT Algorithms [Extended Abstract]

By Lingchuan Meng, Yevgen Voronenko, Jeremy R. Johnson, Marc Moreno Maza, Franz Franchetti and Yuzhen Xie


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. Categories and Subject Descriptor

Topics: D.1.2 [Software, Programming Techniques, Automatic Programming, G.4 [Mathematics of Computing, Mathematical Software, Efficiency, I.1.3 [Computing Methodologies, Symbolic and Algebraic Manipulation, Languages and Systems General Terms Algorithms, Performance Keywords FFT, modular arithmetic, code generation, vectorization, high performance
Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.