Improving Goldschmidt Division, Square Root and Square Root Reciprocal

: The aim of this paper is to accelerate division, square root and square root reciprocal computations, when Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the addition of a correcting term that can be looked up during the early iterations. We describe several variants of the Goldschmidt algorithm assuming 4-cycle pipelined multiplier and discuss obtained number of cycles and error achieved. Extensions to other than 4-cycle multipliers are given. Key-words: Division, Square root, Square root reciprocal, Convergence division, Computer Arithmetic, Goldschmidt iteration. (Rsum : tsvp) This work has been partially supported by a French CNRS and Ministre des Affaires trangres grant PICS-479, Vers des arithmtiques plus souples et plus prcises. University of California at Los Angeles, Los Angeles, USA y Laboratoire d'Informatique de Marseille, Marseille, France z Southern Methodist University, Dallas, USA # CNRS, projet CNRS-E..