2 papers
cs.DS2013
New modular multiplication and division algorithms based on continued fraction expansion
Mourad Gouicem
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplica…
cs.MS2012
GPU-accelerated generation of correctly-rounded elementary functions
Pierre Fortin, Mourad Gouicem, Stef Graillat
The IEEE 754-2008 standard recommends the correct rounding of some elementary functions. This requires to solve the Table Maker's Dilemma which implies a huge amount of CPU computa…