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 : vendredi 20 septembre 2013-17:14:02

Dernière modification le : lundi 28 avril 2025-17:04:03

Archivage à long terme le : samedi 21 décembre 2013-04:32:56

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. 2013. ⟨hal-00864293v1⟩

1059 Consultations

4606 Téléchargements