A cache-friendly truncated FFT
Symbolic Computation
2008-10-20 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.0810.3203,
title = {A cache-friendly truncated FFT},
author = {David Harvey},
journal= {arXiv preprint arXiv:0810.3203},
year = {2008}
}
Comments
14 pages, 11 figures, uses algorithm2e package