TY - GEN
T1 - Faster FFTs in Medium Precision
AU - Van Der Hoeven, Joris
AU - Lecerf, Grégoire
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/8/14
Y1 - 2015/8/14
N2 - 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.
AB - 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.
KW - FFT
KW - SIMD
KW - complexity bound
KW - floating point arithmetic
KW - quadruple precision
UR - https://www.scopus.com/pages/publications/84952307455
U2 - 10.1109/ARITH.2015.10
DO - 10.1109/ARITH.2015.10
M3 - Conference contribution
AN - SCOPUS:84952307455
T3 - Proceedings - Symposium on Computer Arithmetic
SP - 75
EP - 82
BT - Proceedings - IEEE 22nd Symposium on Computer Arithmetic, ARITH 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 22nd IEEE Symposium on Computer Arithmetic, ARITH 2015
Y2 - 22 June 2015 through 24 June 2015
ER -