A cache-friendly truncated FFT

Authors:
David Harvey
Affiliations:
Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012-1185, United States
Venue:
Theoretical Computer Science
Year:
2009

Citing 6
Cited 2

FFTs in external or hierarchical memory

The Journal of Supercomputing
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Irregular primes and cyclotomic invariants to 12 million

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the second Magma conference
The truncated fourier transform and applications

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
SAGE: system for algebra and geometry experimentation

ACM SIGSAM Bulletin
Computing L-series of hyperelliptic curves

ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory

An in-place truncated fourier transform and applications to polynomial multiplication

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Fast library for number theory: an introduction

ICMS'10 Proceedings of the Third international congress conference on Mathematical software

Quantified Score

Hi-index	5.23

Visualization

Abstract

We describe a cache-friendly version of van der Hoeven's truncated FFT and inverse truncated FFT, focusing on the case of 'large' coefficients, such as those arising in the Schonhage-Strassen algorithm for multiplication in Z[x]. We describe two implementations and examine their performance.