Improving Goldschmidt Division, Square Root and Square Root Reciprocal

Abstract : 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.
Document type :
Complete list of metadatas
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:15:08 AM
Last modification on : Wednesday, October 9, 2019 - 9:42:11 AM


  • HAL Id : inria-00072909, version 1


Milos Ercegovac, Laurent Imbert, David Matula, Jean-Michel Muller, Guoheng Wei. Improving Goldschmidt Division, Square Root and Square Root Reciprocal. [Research Report] RR-3753, LIP RR-1999-41, INRIA, LIP. 1999. ⟨inria-00072909⟩



Record views


Files downloads