Re: division-free binary-to-decimal conversion

2013-10-07 Thread Zimmermann Paul
Torbjörn, > we mean "faster than GMP's conversion functions", but still using GMP for > the > low-level operations. > > Then please say so in the paper. indeed that was not clear, we will say it in the revised version. Paul ___ gmp-devel

Re: division-free binary-to-decimal conversion

2013-10-07 Thread Torbjorn Granlund
Zimmermann Paul writes: we mean "faster than GMP's conversion functions", but still using GMP for the low-level operations. Then please say so in the paper. not only. For large operands we believe there is still room to improve our code. In particular an important part of the total ti

Re: division-free binary-to-decimal conversion

2013-10-07 Thread Zimmermann Paul
Torbjörn, > From: Torbjorn Granlund > Date: Mon, 07 Oct 2013 10:45:56 +0200 > > I did a quick first read. > > I take it that "faster than GMP" means "faster than GMP's conversion > functions, using GMP"... Or did you actually beat GMP without GMP? we mean "faster than GMP's conversion

Re: division-free binary-to-decimal conversion

2013-10-07 Thread Torbjorn Granlund
I did a quick first read. I take it that "faster than GMP" means "faster than GMP's conversion functions, using GMP"... Or did you actually beat GMP without GMP? I cannot recall how the present mpf conversion code works, since I don't actively develop that. For integer conversion, the most impo