24 December 2003 Relaxing the reciprocal error needed to achieve a fixed quotient error bound
Author Affiliations +
High-performance arithmetic algorithms are often based on functional iteration and these algorithms do not directly produce a remainder. Without the remainder, rounding often requires additional computation or increased quotient precision. Often multiplicative divide algorithms compute the quotient as the product of the dividend and the reciprocal of the divisor, Q =a x (1/b). Typical rounding techniques require that the quotient error be less than a maximum bound such as 1/2 unit in the last place (ulp). When using normalized floating point numbers the quotient error may be approximately twice as large as the reciprocal error since amax ≈ 2 and Eq ≈ 2 x Er. If the rounding algorithm requires |Eq| < 1/2 ulp, then the reciprocal error bound must be |Er| < 1/4 ulp. This work proposes a quantitative method to relax the reciprocal error bound for normalized floating point numbers to achieve a fixed quotient error bound. The proposed error bound of Er < 1/(2 x b) guarantees the quotient error, Eq < 1/2 ulp and the reciprocal error is in the range of 1/4 to 1/2 ulp. Using the relaxed error bound, the reciprocal error may be greater in the region where it is hardest to compute without increasing the quotient error bound.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Albert A. Liddicoat, "Relaxing the reciprocal error needed to achieve a fixed quotient error bound", Proc. SPIE 5205, Advanced Signal Processing Algorithms, Architectures, and Implementations XIII, (24 December 2003); doi: 10.1117/12.506592; https://doi.org/10.1117/12.506592


On the design of a radix 10 online floating point...
Proceedings of SPIE (September 03 2009)
Mapping ORM 2.0 into OWL 2
Proceedings of SPIE (January 12 2012)
A hardware error estimate for floating-point computations
Proceedings of SPIE (September 03 2008)
Design of binary filters by sequential basis expansion
Proceedings of SPIE (April 27 2001)
Implementation of a speculative Ling adder
Proceedings of SPIE (August 24 2009)

Back to Top