Division by Invariant Integers using Multiplication

13 years 8 months ago

Download gmplib.org

Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer constants and run

Torbjörn Granlund, Peter L. Montgomery

Real-time Traffic

Integer | Integer Multiplication | Integer Multiplication Declines | PLDI 1994 | Programming Languages |

claim paper

» Using the Parallel Karatsuba Algorithm for Long Integer Multiplication and Division

» NBit Unsigned Division via NBit MultiplyAdd

» Sparse polynomial division using a heap

» Optimal Size Integer Division Circuits

» Strength Reduction of Integer Division and Modulo Operations

» The wordlength determination problem of linear time invariant systems with multiple output...

» ChannelAdaptive Optimal OFDMA Scheduling

» Optimal power allocation and joint sourcechannel coding for wireless DSCDMA visual sensor ...

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	PLDI
Authors	Torbjörn Granlund, Peter L. Montgomery

Comments (0)

Sciweavers

Division by Invariant Integers using Multiplication

Integer | Integer Multiplication | Integer Multiplication Declines | PLDI 1994 | Programming Languages |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers