DocumentCode
1650255
Title
Faster FFTs in Medium Precision
Author
Van Der Hoeven, Joris ; Lecerf, Gregoire
Author_Institution
Lab. d´Inf. de l, Ecole Polytech., Palaiseau, France
fYear
2015
Firstpage
75
Lastpage
82
Abstract
In this paper, we show how to speed up 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.
Keywords
fast Fourier transforms; fixed point arithmetic; floating point arithmetic; parallel processing; FFT; SIMD instructions; complex numbers; fast Fourier transforms; medium-precision; vectorial multiple precision fixed-point arithmetic; Context; Fast Fourier transforms; Hardware; Libraries; Nails; Program processors; Timing; FFT; SIMD; complexity bound; floating point arithmetic; quadruple precision;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic (ARITH), 2015 IEEE 22nd Symposium on
Conference_Location
Lyon
ISSN
1063-6889
Print_ISBN
978-1-4799-8663-7
Type
conf
DOI
10.1109/ARITH.2015.10
Filename
7203799
Link To Document