Name
Abstract | ||
|---|---|---|
Conversion between binary and decimal floating-point representations is ubiquitous. Floating-point radix conversion means converting both the exponent and the mantissa. We develop an atomic operation for FP radix conversion with simple straight-line algorithm, suitable for hardware design. Exponent conversion is performed with a small multiplication and a lookup table. It yields the correct result without error. Mantissa conversion uses a few multiplications and a small lookup table that is shared amongst all types of conversions. The accuracy changes by adjusting the computing precision. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ACSSC.2013.6810471 | Pacific Grove, CA |
Keywords | Field | DocType |
floating point arithmetic,table lookup,FP radix conversion,IEEE754-2008,binary floating-point representations,decimal floating-point representations,floating-point radix conversion,lookup table,mantissa conversion,mixed radix floating-point arithmetic,multiplications,simple straight-line algorithm | Lookup table,Computer science,Floating point,Double-precision floating-point format,Arithmetic,Radix,Significand,IEEE floating point,Mixed radix,Binary number | Journal |
Volume | ISSN | ISBN |
abs/1312.0455 | 1058-6393 | 978-1-4799-2388-5 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olga Kupriianova | 1 | 2 | 0.80 |
| Christoph Quirin Lauter | 2 | 84 | 9.74 |
| Jean-Michel Muller | 3 | 466 | 66.61 |