DocumentCode
61710
Title
Division-Free Binary-to-Decimal Conversion
Author
Bouvier, Cyril ; Zimmermann, Paul
Author_Institution
Dept. of Comput. Sci., Univ. de Lorraine, Nancy, France
Volume
63
Issue
8
fYear
2014
fDate
Aug. 1 2014
Firstpage
1895
Lastpage
1901
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 percent (using the same low-level routines).
Keywords
floating point arithmetic; trees (mathematics); division-free binary-to-decimal conversion; floating-point number conversion; multiplications; precision integer conversion; radix 10; radix 2; scaled remainder tree technique; subquadratic algorithm; Approximation algorithms; Approximation methods; Complexity theory; Computers; Documentation; Libraries; Vegetation; Binary-to-decimal conversion; GMP; scaled remainder tree;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.2014.2315621
Filename
6782640
Link To Document