A cache-friendly truncated FFT
classification
💻 cs.SC
cs.DS
keywords
truncatedcache-friendlydescribealgorithmarisingcasecoefficientsexamine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.