A cache-friendly truncated FFT

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.