Faster FFTs in medium precision - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2014

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.
Fichier principal
Vignette du fichier
quad.pdf (283.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01081743 , version 1 (10-11-2014)

Identifiers

  • HAL Id : hal-01081743 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More