Multiplication by an Integer Constant

Abstract : We present an algorithm allowing to perform integer multiplications by constants. This algorithm is compared to existing algorithms. 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 metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101792
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:06:25 AM
Last modification on : Wednesday, November 20, 2019 - 2:52:55 AM

File

RR1999-06.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101792, version 1

Collections

Citation

Vincent Lefevre. Multiplication by an Integer Constant. [Research Report] LIP RR-1999-06, Laboratoire de l'informatique du parallélisme. 1999, 2+5p. ⟨hal-02101792⟩

Share

Metrics

Record views

13

Files downloads

17