| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438035 | Theoretical Computer Science | 2009 | 10 Pages |
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 Schönhage–Strassen algorithm for multiplication in . We describe two implementations and examine their performance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
