HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Multiplication by an Integer Constant

Vincent Lefèvre 1
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present and compare various algorithms, including a new one, allowing to perform multiplications by integer constants using elementary operations. Such algorithms are useful, as they occur in several problems, such as the Toom-Cook-like algorithms to multiply large multiple-precision integers, the approximate computation of consecutive values of a polynomial, and the generation of integer multiplications by compilers.
Document type :
Reports
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072430
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 9:56:30 AM
Last modification on : Friday, February 4, 2022 - 3:30:20 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:07:15 PM

Identifiers

  • HAL Id : inria-00072430, version 1

Collections

Citation

Vincent Lefèvre. Multiplication by an Integer Constant. [Research Report] RR-4192, INRIA. 2001. ⟨inria-00072430⟩

Share

Metrics

Record views

173

Files downloads

1018