Multiplication by an Integer Constant: Lower Bounds on the Code Length - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Multiplication by an Integer Constant: Lower Bounds on the Code Length

Abstract

The multiplication by a constant problem consists in generating code to perform a multiplication by an integer constant, using elementary operations, such as left shifts (multiplications by powers of two), additions and subtractions. This can also be seen as a method to compress (or more generally encode) integers. We will not discuss about the quality of this compression method, but this idea will be used to find lower bounds on the code length (number of elementary operations).

Domains

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

Dates and versions

inria-00072095 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072095 , version 1

Cite

Vincent Lefèvre. Multiplication by an Integer Constant: Lower Bounds on the Code Length. [Research Report] RR-4493, INRIA. 2002, pp.15. ⟨inria-00072095⟩
103 View
89 Download

Share

Gmail Facebook Twitter LinkedIn More