A cache-friendly truncated FFT

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, 11 figures, uses algorithm2e package

Keywords

Symbolic Computation, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/171813

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0810.3203
 http://arxiv.org/abs/0810.3203

Collections

arXiv