Division-Free Binary-to-Decimal Conversion (original) (raw)

Résumé

This article presents algorithms that convert multiple precision integer or floating-point numbers from radix 222 to radix 101010 (or to any radix b>2b > 2b>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\%.

Domaines

Connectez-vous pour contacter le contributeur

https://inria.hal.science/hal-00864293

Soumis le : mardi 21 janvier 2014-18:35:40

Dernière modification le : mardi 4 novembre 2025-11:58:48

Archivage à long terme le : mardi 22 avril 2014-11:41:44

Dates et versions

hal-00864293 , version 1 (20-09-2013)

hal-00864293 , version 2 (21-01-2014)

Licence

Identifiants

Citer

Cyril Bouvier, Paul Zimmermann. Division-Free Binary-to-Decimal Conversion. IEEE Transactions on Computers, 2014, 63 (8), pp.1895-1901. ⟨10.1109/TC.2014.2315621⟩. ⟨hal-00864293v2⟩

1059 Consultations

4606 Téléchargements

Altmetric