Tight Certification Techniques for Digit-by-Rounding Algorithms with Application to a New 1/sqrt(x) Design

Citations Over TimeTop 24% of 2011 papers

Abstract

Digit-by-rounding algorithms enable efficient hardware implementations of algebraic functions such as the reciprocal, square root, or reciprocal square root, but certifying the correctness of such algorithms is a nontrivial endeavor. Traditionally, sufficient conditions for correctness are derived as closed-form formulae relating key design parameters. These sufficient conditions, however, often prove stricter than necessary, excluding correct and efficient designs. In this paper, we present a rigorous, computer-aided method for correctness certification that better approximates the necessary conditions, lowering the risk of rejecting correct designs. We also present two specific applications of this method. First, when applied to a conventional digit-by-rounding reciprocal square root design, our method enabled a fourfold reduction in lookup table size relative to the minimum dictated by a standard sufficient condition. Second, our method certified the correctness of a novel reciprocal square root design that we developed to parallelize two computational steps whose sequential execution lies on the critical path of conventional designs. The difficulty in deriving closed-form sufficient conditions to ascertain this design's correctness provided the original motivation for development of the new certification method.

Related Papers

• → Very-high radix combined division and square root with prescaling and selection by rounding(2002)27 cited
• → Complex Square Root with Operand Prescaling(2007)10 cited
• → Complex square root with operand prescaling(2004)9 cited
• → Reciprocal, Division, Reciprocal Square Root, and Square Root by Iterative Approximation(2004)1 cited
• → Fast Compensated Algorithms for the Reciprocal Square Root, the Reciprocal Hypotenuse, and Givens Rotations(2021)1 cited