• Publication
  • 1997
  • Issue No. 4 - April
  • Abstract - Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification
April 1997 (vol. 46 no. 4)
pp. 495-498

Abstract—An efficient initial approximation method for multiplicative division and square root is proposed. It is a modification of the piecewise linear approximation. The multiplication and the addition required for the linear approximation are replaced by only one multiplication with a slight modification of the operand. The same accuracy is achieved. The modification of the operand requires only a bit-wise inversion and a one-bit shift, and can be implemented by a very simple circuit. One clock cycle may be saved, because the addition is removed. The required table size is also reduced, because only one coefficient instead of two has to be stored.

[1] I. Koren, Computer Arithmetic Algorithms.Englewood Cliffs, N.J.: Prentice Hall, 1993.
[2] A. Omondi, Computer Arithmetic Systems: Algorithms, Architectures, and Implementation. Prentice Hall, 1994.
[3] D. Das Sarma and D.W. Matula, “Measuring the Accuracy of ROM Reciprocal Tables,” IEEE Trans. Computers, vol. 43, no. 8, Aug. 1994.
[4] Numerical Methods. G. Dahlquist, A. Bjorck, and N. Anderson, eds., Prentice Hall, 1974.
[5] P.M. Farmwald, "High Bandwidth Evaluation of Elementary Functions," Proc. Fifth Symp. Computer Arithmetic, pp. 139-142, 1981.
[6] M. Ito, N. Takagi, and S. Yajima, "Efficient Initial Approximation Methods for Division and Square Root Using a Multiply-Add Unit," Technical Report HPC 55-10, Information Processing Soc. of Japan, Mar. 1995.
[7] M. Ito, N. Takagi, and S. Yajima, “Efficient Initial Approximation and Fast Converging Methods for Division and Square Root,” Proc. 12th Symp. Computer Arithmetic (ARITH12), pp. 2-9, 1995.

Index Terms:
Computer arithmetic, division, initial approximation, linear approximation, reciprocal, square root.
Citation:
Masayuki Ito, Naofumi Takagi, Shuzo Yajima, "Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification," IEEE Transactions on Computers, vol. 46, no. 4, pp. 495-498, April 1997, doi:10.1109/12.588066
Usage of this product signifies your acceptance of the Terms of Use.