How to square floats accurately and efficiently on the ST231 integer processor - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

How to square floats accurately and efficiently on the ST231 integer processor

(1) , (1, 2) , (2) , (3)
1
2
3

Abstract

We consider the problem of computing IEEE floating-point squares by means of integer arithmetic. We show how the specific properties of squaring can be exploited in order to design and implement algorithms that have much lower latency than those for general multiplication, while still guaranteeing correct rounding. Our algorithm descriptions are parameterized by the floating-point format, aim at high instruction-level parallelism (ILP) exposure, and cover all rounding modes. We show further that their C implementation for the binary32 format yields efficient codes for targets like the ST231 VLIW integer processor from STMicroelectronics, with a latency at least 1.75x smaller than that of general multiplication in the same context.
Fichier principal
Vignette du fichier
sqr.pdf (992.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00532829 , version 1 (19-11-2010)

Identifiers

  • HAL Id : ensl-00532829 , version 1

Cite

Claude-Pierre Jeannerod, Jingyan Jourdan-Lu, Christophe Monat, Guillaume Revy. How to square floats accurately and efficiently on the ST231 integer processor. 2010. ⟨ensl-00532829⟩
534 View
323 Download

Share

Gmail Facebook Twitter LinkedIn More