Faster FFTs in medium precision


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 until 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.

Authors: Joris van der Hoeven, Grégoire Lecerf

Keywords: floating point arithmetic, quadruple precision, complexity bound, FFT, SIMD

A.M.S. subject classification: 65Y04, 65T50, 68W30

View: Html, TeXmacs, Pdf, BibTeX