2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/171813We 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 packageSymbolic ComputationData Structures and Algorithmstext