Wraparound multiplicaton vs mullo
tg at gmplib.org
Wed Oct 21 09:13:28 CEST 2009
nisse at lysator.liu.se (Niels Möller) writes:
Recursive implementation would also be more attractive if one could
write an efficient base case. But I'd expect it's going to be slower
than mul_basecase, since one have to do soome indexing wraparound in
the inner addmul_1 loop.
Not just that, I think. One would get a carry-out from these addmul
loops to handle somehow. A negacyclic basecase would need the addmul to
become a submul halfway through.
More information about the gmp-devel