Division-Free Binary-to-Decimal Conversion

Cyril Bouvier 1 Paul Zimmermann 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : This article presents algorithms that convert multiple precision integer or floating-point numbers from radix $2$ to radix $10$ (or to any radix $b > 2$). Those algorithms, based on the ''scaled remainder tree'' technique, use multiplications instead of divisions in their critical part. Both quadratic and subquadratic algorithms are detailed, with proofs of correctness. Experimental results show that our implementation of those algorithms outperforms the GMP library by up to 50\%.
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (8), pp.1895-1901. <10.1109/TC.2014.2315621>
Liste complète des métadonnées


https://hal.inria.fr/hal-00864293
Contributeur : Cyril Bouvier <>
Soumis le : mardi 21 janvier 2014 - 18:35:40
Dernière modification le : jeudi 22 septembre 2016 - 14:31:29
Document(s) archivé(s) le : mardi 22 avril 2014 - 11:41:44

Fichier

get_str.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Cyril Bouvier, Paul Zimmermann. Division-Free Binary-to-Decimal Conversion. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (8), pp.1895-1901. <10.1109/TC.2014.2315621>. <hal-00864293v2>

Partager

Métriques

Consultations de
la notice

692

Téléchargements du document

338