Integer division by constants: optimal bounds

HIGHLIGHTS

• who: Daniel Lemire from the Université du Québec (TELUQ), Saint-Denis, Montreal, Quebec, Canada have published the paper: Integer division by constants: optimal bounds, in the Journal: (JOURNAL)
• what: That is, the authors provide an optimal bound for the multiply-add technique.1. The authors show that the authors can adapt Robison's technique to compute remainders directly and derive a novel bound. Fixing 𝑁 and 𝑑, the authors seek the value 𝑛 ∈ minimizing 𝑓 (𝑛)=1 + (𝑑 - remainder(𝑛, 𝑑))∕𝑛. The authors show the more elegant result that remainder(𝑐 * 𝑛, 𝑚) and amp;lt; 𝑐 is a divisibility test (see Proposition 1).
•  

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.