
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tomás Lang, Paolo Montuschi, "Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit," IEEE Transactions on Computers, vol. 48, no. 8, pp. 827841, August, 1999.  
BibTex  x  
@article{ 10.1109/12.795124, author = {Tomás Lang and Paolo Montuschi}, title = {Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {8}, issn = {00189340}, year = {1999}, pages = {827841}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.795124}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit IS  8 SN  00189340 SP827 EP841 EPD  827841 A1  Tomás Lang, A1  Paolo Montuschi, PY  1999 KW  Division KW  square root KW  selection by rounding KW  recurrence prescaling. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—An algorithm for square root with prescaling and selection by rounding is developed and combined with a similar scheme for division. Since division is usually more frequent than square root, the main concern of the combined implementation is to maintain the low execution time of division, while accepting a somewhat larger execution time for square root. The algorithm is presented in detail, including the mathematical development of bounds for the first squareroot digit and for the scaling factor. The proposed implementation is described, evaluated and compared with other combined div/sqrt units. The comparisons show that the proposed scheme potentially produces a significant speedup for division, whereas, for square root, the speedup is small.
[1] W.S. Briggs and D.W. Matula, “Method and Apparatus for Performing Division Using a Rectangular Aspect Ratio Multiplier,” U. S. Patent No. 5 046 038, Sept. 1991.
[2] W.S. Briggs, T.B. Brightman, and D.W. Matula, “Method and Apparatus for Performing the Square Root Function Using a Rectangular Aspect Ratio Multiplier,” U.S. Patent No. 5 060 182, Oct. 1991.
[3] J. Cortadella and T. Lang, "HighRadix Division and Square Root with Speculation," IEEE Trans. Computers, vol. 43, no. 8, pp. 919931, Aug. 1994.
[4] D. DasSarma and D.W. Matula, “Faithful Bipartite ROM Reciprocal Tables,” Proc. 12th IEEE Symp. Computer Arithmetic, pp. 1225, Bath, England, July 1995.
[5] M.D. Ercegovac, “A Division with Simple Selection of Quotient Digits,” Proc. Sixth IEEE Symp. Computer Arithmetic, pp. 9498, Aahrus, Denmark, June 1983.
[6] M.D. Ercegovac and T. Lang,“Simple radix4 division with operands scaling,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1,2041,207, Sept. 1990.
[7] M.D. Ercegovac and T. Lang, “Module to Perform Multiplication, Division and Square Root in Systolic Arrays for Matrix Computations,” J. Parallel and Distributed Computing, vol. 11, no. 3, pp. 212221, Mar. 1991.
[8] M.D. Ercegovac and T. Lang, Division and Square Root—DigitRecurrence Algorithms and Implementations. Kluwer Academic, 1994.
[9] M.D. Ercegovac, T. Lang, and P. Montuschi, “Very High Radix Division with Prescaling and Selection by Rounding,” IEEE Trans. Computers, vol. 43, no. 8, pp. 909917, Aug. 1994.
[10] J. Fandrianto,“Algorithm for highspeed shared radix8 division and radix8 square root,” Proc. Ninth IEEE Computer Arithmetic Symp., pp. 6875, 1989.
[11] M.J. Flynn, “On Division by Functional Iteration,” IEEE Trans. Computers, vol. 19, no. 8, pp. 702706, Aug. 1970.
[12] J.B. Gosling and C.M.S. Blakeley, “Arithmetic Unit with Integral Division and Square Root,” IEE Proc., Part E, vol. 134, pp. 1723, Jan. 1987.
[13] J. Klir, “A Note on Svoboda's Algorithm for Division,” Information Processing Machines (Stroje na Zpracovani Informaci), no. 9, pp. 3539, 1963.
[14] E.V. Krishnamurthy, “On RangeTransformation Techniques for Division,” IEEE Trans. Computers, vol. 19, no. 2, pp. 157160, Feb. 1970.
[15] M. Ito, N. Takagi, and S. Yajima, "Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification," IEEE Trans. Computers, vol. 46, no. 4, pp. 495498, Apr. 1997.
[16] T. Lang and P. Montuschi,“Higher radix square root with prescaling,” IEEE Trans. Computers, vol. 41, pp. 9961,009, 1992.
[17] T. Lang and P. Montuschi, “Improved Methods to a Linear Interpolation Approach for Computing the Prescaling Factor for Very High Radix Division,” I.R. DAI/ARC 694, Dipartimento di Automatica e Informatica, Politecnico di Torino, 1994.
[18] T. Lang and P. Montuschi, "VeryHigh Radix Combined Division and SquareRoot with Prescaling and Selection by Rounding," Proc. 12th IEEE Symp. Computer Arithmetic, pp. 124131, 1995.
[19] T. Lang and P. Montuschi, “Very High Radix Square Root with Prescaling and Selection by Rounding and a Shared Division and Square Root Architecture,” I.R. DAI/ARC 697, Dipartimento di Automatica e Informatica, Politecnico di Torino, 1997.
[20] S.E. McQuillan and J.V. McCanny, “VLSI Module for High Performance Multiply, Square Root and Divide,” IEE Proc., Part E, vol. 139, no. 6, pp. 505510, June 1992.
[21] S.E. McQuillan, J.V. McCanny, and R. Hamill, "New Algorithms and VLSI Architectures for SRT Division and Square Root," Proc. 11th Symp. Computer Arithmetic, pp. 8086,Windsor, Ontario, Canada, 29 June July2 1993.
[22] D.M. Mandelbaum, “Division Using a LogarithmicExponential Transfrom to Form a Short Reciprocal,” IEEE Trans. Computers, vol. 44, no. 11, pp. 1,3261,330, Nov. 1995.
[23] D.W. Matula, “Highly Parallel Divide and Square Root Algorithms for a New Generation Floating Point Processors,” Proc. SCAN89 Symp. Computer Arithmetic and SelfValidating Numerical Methods, Oct. 1989.
[24] P. Montuschi and M. Mezzalama, “Survey of Square Rooting Algorithms,” IEE Proc., Part E, vol. 137, no. 1, pp. 3140, Jan. 1990.
[25] P. Montuschi and L. Ciminiera, "Reducing Iteration Time When Result Digit Is Zero for Radix 2 SRT Division and Square Root with Redundant Remainders," IEEE Trans. Computers, vol. 42, no. 2, pp. 239246, Feb. 1993.
[26] S.F. Oberman and M.J. Flynn, “Design Issues in Division and Other Floating Point Operations,” IEEE Trans. Computers, vol. 46, no. 2, pp. 154161, Feb. 1997.
[27] S.F. Oberman and M.J. Flynn, “Division Algorithms and Implementations,” IEEE Trans. Computers, vol. 46, no. 8, pp. 833854, Aug. 1997.
[28] C.V. Ramamoorthy, J.R. Goodman, and K.H. Kim, “Some Properties of Iterative SquareRooting Methods Using HighSpeed Multiplication,” IEEE Trans. Computers, vol. 21, no. 8, pp. 837847, Aug. 1972.
[29] M.J. Schulte and J.E. Stine, “Symmetric Bipartite Tables for Accurate Function Approximation” Proc. 13th Symp. Computer Arithmetic (ARITH13), pp. 175183, 1997.
[30] E. Schwarz and M.J. Flynn, “Hardware Starting Approximation Method and Its application to the Square Root Operation,” IEEE Trans. Computers, vol. 45, no. 12, pp. 1,3561,369, Dec. 1996.
[31] A. Svoboda, “An Algorithm for Division,” Information Processing Machines, vol. 9, pp. 2532, 1963.
[32] N. Takagi, "Generating a Power of an Operand by a Table LookUp and a Multiplication," Proc. 13th Symp. Computer Arithmetic, pp. 126131, July 1997.
[33] C. Tung, “A Division Algorithm for SignedDigit Arithmetic,” IEEE Trans. Computers, vol. 17, no. 9, pp. 887889, Sept. 1970.
[34] Weitek, “W4164 and W4364 Floating Point Processors, Technical Overview,” Oct. 1990.
[35] D. Wong and M. Flynn,“Fast division using accurate quotient approximations to reduce the number of iterations,” IEEE Trans. Computers, vol. 41, pp. 981995, Aug. 1992.
[36] WF. Wong and E. Goto, “Fast Evaluation of Elementary Functions in Single Precision,” IEEE Trans. Computers, vol. 44, no. 3, pp. 453457, Mar. 1995.
[37] J.H.P. Zurawski and J.B. Gosling, “Design of a HighSpeed Square Root Multiply and Divide Unit,” IEEE Trans. Computers, vol. 36, no. 1, pp. 1323, Jan. 1987