A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor

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

• Type: Conference
• Year: 2009
• Where: ARITH
• Authors: Claude-Pierre Jeannerod, Herve Knochel, Christophe Monat, Guillaume Revy, Gilles Villard
• Keywords: Applied Computing, ARITH 2009, Binary Floating-point Division, Correct Rounding, Particular Bivariate Polynomials