
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Wong, M. Flynn, "Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations," IEEE Transactions on Computers, vol. 41, no. 8, pp. 981995, August, 1992.  
BibTex  x  
@article{ 10.1109/12.156541, author = {D. Wong and M. Flynn}, title = {Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {8}, issn = {00189340}, year = {1992}, pages = {981995}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.156541}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations IS  8 SN  00189340 SP981 EP995 EPD  981995 A1  D. Wong, A1  M. Flynn, PY  1992 KW  quotient approximations; iterative integer division algorithms; lookup table; Taylorseries; reciprocal; ECL components; exact remainder; precise rounding specifications; algorithm theory; approximation theory; digital arithmetic; dividing circuits; iterative methods; number theory. VL  41 JA  IEEE Transactions on Computers ER   
A class of iterative integer division algorithms is presented based on lookup table and Taylorseries approximations to the reciprocal. The algorithm iterates by using the reciprocal to find an approximate quotient and then subtracting the quotient multiplied by the divisor from the dividend to find a remaining dividend. Fast implementations can produce an average of either 14 or 27 b per iteration, depending on whether the basic or advanced version of this method is implemented. Detailed analyses are presented to support the claimed accuracy per iteration. Speed estimates using stateoftheart ECL components show that this method is faster than the NewtonRaphson technique and can produce 53b quotients of 53b numbers in about 25 ns using the basic method and 21 ns using the advanced method. In addition, these methods naturally produce an exact remainder, which is very useful for implementing precise rounding specifications.
[1] R. Alverson and D. Matula, private communication in 1991. Tera Computer, Seattle, WA and Dep. Comput. Sci. Eng., Southern Methodist Univ., Dallas, TX.
[2] D. Atkins. "Higherradix division using estimates of the divisor and partial remainders,"IEEE Trans. Comput., vol. C17, no. 10, pp. 925934, Oct. 1968.
[3] G. Bewick, P. Song, G. De Micheli, and M. J. Flynn, "Approaching a nanosecond: A 32 bit adder," inProc. ICCD Conf., 1988, pp. 221224.
[4] G. Bewick, private communications between 1990 and 1992 about work in progress. Comput. Syst. Lab., Stanford Univ., Stanford, CA.
[5] W. Briggs, T. Brightman, and D. Matula, "Method and apparatus for performing the square root function using a rectangular aspect ratio multiplier," United States Patent no. 5 060 182, Oct. 1991.
[6] W. Briggs and D. Matula, "Method and apparatus for performing division using a rectangular aspect ratio multiplier," United States Patent no. 5 046 038, Sept. 1991.
[7] T. Brightman, Slides from presentation on Cyrix coprocessor. 1989, presented at future Trends panel session of 9th Symp. Comput. Arithmetic.
[8] M. Ercegovac and T. Lang, "Fast radix2 division with quotient digit prediction,"J. VLSI Signal Processing, vol. 1, no. 3, pp. 169180, Nov. 1989.
[9] J. Fandrianto, "Algorithm for high speed shared radix 8 division and radix 8 square root," inProc. 9th Symp. Comput. Arithmetic, Sept. 1989, pp. 6875.
[10] P. M. Farmwald, "High bandwidth evaluation of elementary functions," inProc. 5th Symp. Comput. Arithmetic, 1981, pp. 139142.
[11] M. Flynn, "Subnanosecond arithmetic proposal," unpublished report, Comput. Syst. Lab., Stanford Univ., Stanford, CA, 1989,
[12] M. Flynn, "Subnanosecond arithmetic proposal," unpublished report, Comput. Syst. Lab., Stanford Univ., Stanford, CA, 1989,
[13] L. A. Glasser and D. W Dobberpuhl,The Design and Analysis of VLSI Circuits. Reading, MA: AddisonWesley, 1985.
[14] J. Klir, "A note on Svoboda's algorithm for division," inProc. 9th Symp. Inform. Processing Machines, vol. 9, 1963, pp. 3539.
[15] E. Krishnamurthy, "On rangetransformation techniques for division,"IEEE Trans. Comput., vol. C19, no. 2, pp. 157160, Feb. 1970.
[16] P. Markstein, "Computation of elementary functions on the IBM RISC System/6000 processor,"IBM J. Res Develop., vol. 34, no. 1, pp. 111119, Jan. 1990.
[17] M. Matsuiet al., "An 8ns 1Mb ECL BiCMOS SRAM," inProc. 1989 Int. SolidState Circuits Conf., Feb. 1989, pp. 3839.
[18] D. Matula, "Highly parallel divide and square root algorithms for a new generation floating point processor," extended abstract presented at SCAN89 Symp. Comput. Arithmetic and SelfValidating Numerical Methods, Oct. 1989.
[19] D. Mathula, "Design of a highly parallel IEEE standard floating point arithmetic unit," extended abstract presented at Symp. Combinational Optimization on Sci. and Technol. (COST) at RUTCOR/DIMACS, Apr. 1991.
[20] D. W. Ruck, S. K. Rogers, M. Kabrinsky, M. E. Oxley, and B. W. Sutter, "The multilayer perceptron as an approximation to a Bayes optimal discriminant function,"IEEE Trans. Neural Networks, vol. 1, no. 4, pp. 296298, Dec. 1990.
[21] A. Svoboda, "An algorithm for division," inProc. 9th Symp. Inform. Processing Machines, vol. 9, pp. 2534, 1963.
[22] H. Tranet al., "An 8n BiCMOS 1Mb ECL SRAM with a configurable memory array size," inProc. 1989 Int. SolidState Circuits Conf., Feb. 1989, pp. 3637.
[23] M. J. Flynn and S. Waser,Introduction to Arithmetic for Digital Systems Designers. CBS College Publishing, 1982, pp. 215222.
[24] D. Wong, G. De Micheli, and M. Flynn, "Designing highperformance digital circuits using wave pipelining," inProc. VLSI '89 Conf., Aug. 1989, pp. 241252.
[25] D. Wong and M. Flynn, "Fast division using accurate quotient approximations to reduce the number of iterations," inProc. 10th IEEE Symp. Comput. Arithmetic, June 1991, pp. 191201.
[26] K. Yamaguchi, H. Nanbu, K. Kanetani,et al., "An experimental softerror immune 64Kb 3ns ECL Bipolar RAM," inProc. 1988 Bipolar Circuits and Technol. Meet., Sept. 1988, pp. 2627.