BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-96-700
       ENTRY:: July 23, 1996
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: Fast IEEE Rounding for Division by Functional Iteration
        TYPE:: Technical Report
      AUTHOR:: Oberman, Stuart F.
      AUTHOR:: Flynn, Michael J.
        DATE:: July 1996
       PAGES:: 23
    ABSTRACT:: A class of high performance division algorithms is functional
               iteration. Division by functional iteration uses
               multiplication as the fundamental operator. The main
               advantage of division by functional iteration is quadratic
               convergence to the quotient. However, unlike non-restoring
               division algorithms such as SRT division, functional
               iteration does not directly provide a final remainder. This
               makes fast and exact rounding difficult. This paper clarifies
               the methodology for correct IEEE compliant rounding for
               quadratically-converging division algorithms. It proposes an
               extension to previously reported techniques of using extended
               precision in the computation to reduce the frequency of back
               multiplications required to obtain the final remainder.
               Further, a technique applicable to all IEEE rounding modes is
               presented which replaces the final subtraction for remainder
               computation with very simple combinational logic.
       NOTES:: [Adminitrivia V1/Prg/19960723]
         END:: STAN//CSL-TR-96-700