Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Faster FFTs in medium precision

Abstract : In this paper, we present new algorithms for the computation of fast Fourier transforms over complex numbers for "medium" precisions, typically in the range from 100 until 400 bits. On the one hand, such precisions are usually not supported by hardware. On the other hand, asymptotically fast algorithms for multiple precision arithmetic do not pay off yet. The main idea behind our algorithms is to develop efficient vectorial multiple precision fixed point arithmetic, capable of exploiting SIMD instructions in modern processors.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Joris Van Der Hoeven Connect in order to contact the contributor
Submitted on : Monday, November 10, 2014 - 6:24:32 PM
Last modification on : Wednesday, November 18, 2020 - 10:32:02 PM
Long-term archiving on: : Wednesday, February 11, 2015 - 3:40:56 PM


Files produced by the author(s)


  • HAL Id : hal-01081743, version 1



Joris van Der Hoeven, Grégoire Lecerf. Faster FFTs in medium precision. 2014. ⟨hal-01081743⟩