This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Division Using a Logarithmic-Exponential Transform to Form a Short Reciprocal
November 1995 (vol. 44 no. 11)
pp. 1326-1330

Abstract—Two trees are used sequentially to calculate an approximation to 1/A, where 1 ≤A < 2. These trees calculate the logarithm and exponential, and the division (reciprocation) process can be described by 1/A=e−lnA. For bit skip accuracy of six to 10, this logarithmic-exponential method uses significantly less hardware with respect to the scheme in [3], and the delays may be greater or less than those of [3], depending on the method used and the minimum bit skip.

[1] R. Stefanelli,“A suggestion for a high speed parallel binary divider,” IEEE Trans. Computers, vol. 21, pp. 42-45, Jan. 1972.
[2] D.M. Mandelbaum,“A systematic method for division with high average bit skipping,” IEEE Trans. Computers, vol. 39, pp. 127-130, Jan. 1990.
[3] D.M. Mandelbaum,“Some results on a SRT type division scheme,” IEEE Trans. Computers, vol. 42, pp. 102-106, Jan. 1993.
[4] E.M. Schwarz and M.J. Flynn,“Cost efficient high radix division,” J. VLSI Signal Processing, pp. 293-305, Aug. 1991.
[5] E.M. Schwarz and M.J. Flynn,“Hardware starting approximation for the square root operation,” Proc. IEEE 11th Symp. Computer Arithmetic, pp. 103-11, 1993.
[6] E.M. Schwarz and M.J. Flynn,“Parallel high radix nonrestoring division,” IEEE Trans. Computers, vol. 42, no. 10, pp. 1,234-1,246, Oct. 1993.
[7] D. Wong and M. Flynn,“Fast division using accurate quotient approximations to reduce the number of iterations,” IEEE Trans. Computers, vol. 41, pp. 981-995, Aug. 1992.
[8] S. Waser and M.J. Flynn,Introduction to Arithmetic for Digital System Designers.New York: CBS College Publishing, 1982.
[9] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[10] J.N. Mitchell Jr.,“Computer multiplication and division using binary logarithm,” IRE Trans. Electronic Computers, vol. 11, pp. 512-517, Aug. 1962.
[11] C.S. Wallace,“A suggestion for a fast multiplier,” IEEE Trans. Electronic Computers, vol. 13, pp. 14-17, Feb. 1964.
[12] L. Dadda,“Some schemes for parallel multipliers,” Alta Frequenza, vol. 34, pp. 349-356, May 1965.
[13] S.D. Pezaris,“A 40 ns 17 bit by 17 bit array multiplier,” IEEE Trans. Computers, vol. 20, pp. 442-447, Apr. 1971.
[14] A. Avizienis,“Signed digit number representations for fast parallel arithmetic,” IEEE Trans. Computers, vol. 10, pp. 389-400, 1961.
[15] K. Hwang,Computer Arithmetic, Principles, Architecture, and Design.New York: John Wiley&Sons, 1979.
[16] E.E. Swartzlander Jr., and A.G. Alexopoulos,“The sign/logarithm number system,” IEEE Trans. Computers, vol. 24, pp. 1,238-1,242, Dec. 1975.
[17] W.S. Briggs and D.W. Matula, "A 17×69 Bit Multiply and Add Unit with Redundant Binary Feedback and Single Cycle Latency," Proc. 11th Symp. Computer Arithmetic, pp. 163-170, 1993.
[18] M.D. Ercegovac and T. Lang,“Simple radix-4 division with operands scaling,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1,204-1,207, Sept. 1990.
[19] E.V. Krishnamurthy,“On range-transformation techniques for division,” IEEE Trans. Computers, vol. 19, no. 2, pp. 157-160, Feb. 1970.
[20] E.V. Krishnamurthy,“A more efficient range-transformation algorithm for signed-digit division,” Int’l J. Control, vol. 12, no. 1, pp. 73-79, 1970.
[21] D.W. Matula,“Design of a highly parallel IEEE floating point arithmetic unit,” Symp. Combinatorial Optimization Science and Technology (COST) at RUTCOR/DIMACS, Apr. 1991.
[22] D.D. Sarma and D.W. Matula,“Measuring the accuracy of ROM reciprocal tables,” Proc. IEEE 11th Symp. Computer Arithmetic, pp. 95-102,Windsor, Canada, 1993.
[23] A. Svoboda,“An algorithm for division,” Information Proc. Machines, no. 9, pp. 25-34, 1963.
[24] N. Takagi,H. Yasuura,, and S. Yajima,“High-speed VLSI multiplication algorithm with a redundant binary addition tree,” IEEE Trans. Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985.
[25] S.F. Anderson,J.G. Earle,R.E. Goldschmidt,, and D.M. Powers,“The IBM system/360 model 91: Floating point execution unit,” IBM J. Research and Development, vol. 11, no. 1, pp. 34-53, Jan. 1967.
[26] E.M. Schwarz,“High-radix algorithms for high-order arithmetic expressions,” doctorial dissertation, Stanford Univ., Jan. 1993.

Index Terms:
Array, division, exponential, logarithm, reciprocation, tree.
Citation:
David M. Mandelbaum, "Division Using a Logarithmic-Exponential Transform to Form a Short Reciprocal," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1326-1330, Nov. 1995, doi:10.1109/12.475129
Usage of this product signifies your acceptance of the Terms of Use.