inria-00072430, version 1
Multiplication by an Integer Constant
N° RR-4192 (2001)
Résumé : 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.
- 1 : SPACES (INRIA Lorraine - LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domaine : Informatique/Autre
- Mots-clés : INTEGER MULTIPLICATION / ADDITION CHAINS
- Référence interne : RR-4192
- inria-00072430, version 1
- http://hal.inria.fr/inria-00072430
- oai:hal.inria.fr:inria-00072430
- Contributeur : Rapport De Recherche Inria
- Soumis le : Mercredi 24 Mai 2006, 09:56:30
- Dernière modification le : Mardi 27 Juin 2006, 16:38:01
Documents associés
Exporter