Skip to Main content Skip to Navigation
Conference papers

A new binary floating-point division algorithm and its software implementation on the ST231 processor

Claude-Pierre Jeannerod 1, 2, * Hervé Knochel 3 Christophe Monat 3 Guillaume Revy 4 Gilles Villard 1, 2, *
* Corresponding author
2 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
4 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targets a VLIW integer processor of the ST200 family, and is based on fast and accurate programs for evaluating some particular bivariate polynomials. We start by giving approximation and evaluation error conditions that are sufficient to ensure correct rounding. Then we describe the heuristics used to generate such evaluation programs, as well as those used to automatically validate their accuracy. Finally, we propose, for the binary32 format, a complete C implementation of the resulting division algorithm. With the ST200 compiler and compared to previous implementations, the speed-up observed with our approach is by a factor of almost 1.8.
Document type :
Conference papers
Complete list of metadata
Contributor : Claude-Pierre Jeannerod <>
Submitted on : Monday, May 19, 2014 - 4:01:35 PM
Last modification on : Thursday, November 21, 2019 - 2:26:42 AM

Links full text



Claude-Pierre Jeannerod, Hervé Knochel, Christophe Monat, Guillaume Revy, Gilles Villard. A new binary floating-point division algorithm and its software implementation on the ST231 processor. ARITH: Computer Arithmetic, Jun 2009, Portland, OR, United States. pp.95-103, ⟨10.1109/ARITH.2009.19⟩. ⟨hal-00993090⟩