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

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 : 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).
Type de document :
Rapport
[Research Report] RR-4493, INRIA. 2002, pp.15
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00072095
Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 23 mai 2006 - 19:46:36
Dernière modification le : mardi 25 octobre 2016 - 16:57:22
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:52:55

Fichiers

Identifiants

  • HAL Id : inria-00072095, version 1

Collections

Citation

Vincent Lefèvre. Multiplication by an Integer Constant: Lower Bounds on the Code Length. [Research Report] RR-4493, INRIA. 2002, pp.15. 〈inria-00072095〉

Partager

Métriques

Consultations de
la notice

121

Téléchargements du document

147