|
Published Articles >> Table of Contents >> Abstract
12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95)
p. 2
Efficient Initial Approximation and Fast Converging Methods for Division and Square Root
Masayuki Ito, Nagoya University
Naofumi Takagi, Nagoya University
Shuzo Yajima, Nagoya University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1995.465383
Send link to a friend
| Abstract |
|
Efficient initial approximations and fast converging algorithms are important to achieve the desired precision faster at lower hardware cost in multiplicative division and square root. In this paper, a new initial approximation method for division, an accelerated higher order converging division algorithm, and a new square root algorithm are proposed. They are all suitable for implementation on an arithmetic unit where one multiply-accumulate operation can be executed in one cycle. In the case of division, the combination of our initial approximation method and our converging algorithm enables a single iteration of the converging algorithm to produce double-precision quotients. Our new square root algorithm can form double-precision square roots faster using smaller look-up tables than the Newton-Raphson method.
|
 Additional Information
|
Citation:
Masayuki Ito, Naofumi Takagi, Shuzo Yajima,
"Efficient Initial Approximation and Fast Converging Methods for Division and Square Root,"
arith,
p. 2,
12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95),
1995
|
|
