Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The aim of this paper is to accelerate division, square root, and square root reciprocal computations when the 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.  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. If  call G/sub m/ the Goldschmidt algorithm with m iterations, our variants allow us to reach an accuracy that is beten that of G/sub 3/ and that of G/sub 4/, with a number of cycle equal to that of G/sub 3/.
['Milos D. Ercegovac', 'Laurent Imbert', 'David W. Matula', 'Jean-Michel Muller', 'Guoheng Wei']
I am writing a research paper on a idea Improving Goldschmidt division, square root, and square root reciprocal
[{"from": "human", "value": "I am writing a research paper on a idea Improving Goldschmidt division, square root, and square root reciprocal"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The aim of this paper is to accelerate division, square root, and square root reciprocal computations when the 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.  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. If  call G/sub m/ the Goldschmidt algorithm with m iterations, our variants allow us to reach an accuracy that is beten that of G/sub 3/ and that of G/sub 4/, with a number of cycle equal to that of G/sub 3/."}]