Multiplication by an Integer Constant
Vincent Lefèvre · 2001
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. Keywords: multiplication, addition chains R'esum'e Nous pr'esentons un algorithme permettant de faire des multiplications enti`eres par des constantes. Cet algorithme est compar'e `a d'autres algorithmes existants. De tels algorithmes sont utiles, car ils interviennent dans plusieurs probl`emes, comme les algorithmes du style Toom-Cook pour multiplier des entiers `a grande pr'ecision, le calcul approch'e de valeurs cons'ecutives d'un polyn ome et la g'en'eration de multiplications enti`eres par les compilateurs. Mots-cl'es: multiplication, chaines d'additions 1 Introduct...