Multiplication by an Integer Constant - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Multiplication by an Integer Constant


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4192.pdf (170.85 Ko) Télécharger le fichier

Dates and versions

inria-00072430 , version 1 (24-05-2006)


  • HAL Id : inria-00072430 , version 1


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


Gmail Facebook Twitter LinkedIn More