This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Digit Selection for SRT Division and Square Root
March 2005 (vol. 54 no. 3)
pp. 294-303
The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a redundant representation. The number of leading bits needed depends on the quotient radix and digit set, and is usually found by an extensive search, to assure that the next quotient digit can be chosen as valid for all points (remainder, divisor) in a set defined by the truncated remainder and divisor, i.e., an "uncertainty rectangle.” This paper presents expressions for the number of bits needed from the truncated remainder and divisor (the truncation parameters), thus eliminating the need for a search through the truncation parameter space for validation. The analysis is then extended to the digit selection in SRT square root algorithms, where it is shown that, in general, it may be necessary to increase the number of leading bits needed for digit determination in a combined divide and square root algorithm. An easy condition to check the number of bits needed is established, also checking the number of initial digits of the root may have to be found by other means, e.g., by table look-up. The minimally redundant, radix-4 combined divide and square root algorithm is finally analyzed and it is shown that, in this case, it can be implemented without such a special table to determine initial digits for the square root.

[1] P. Kornerup, “Revisiting SRT Quotient Digit Selection,” Proc. 16th IEEE Symp. Computer Arithmetic, pp. 38-45, June 2003.
[2] J. Robertson, “A New Class of Digital Division Methods,” IRE Trans. Electronic Computers, vol. 7, pp. 218-222, 1958, reprinted in [16].
[3] K. Tocher, “Techniques of Multiplication and Division for Automatic Binary Computers,” Quarterly J. Mechanics and Applied Math., vol. 11, pp. 364-384, 1958.
[4] D. Atkins, “Higher-Radix Division Using Estimates of the Divisor and Partial Remainders,” IEEE Trans. Computers, vol. 17, pp. 925-934, 1968, reprinted in [16].
[5] T. Coe and P. Tang, “It Takes Six Ones to Reach a Flaw,” Proc. 12th IEEE Symp. Computer Arithmetic, 1995.
[6] G. Taylor, “Radix 16 SRT Dividers with Overlapped Quotient Selection Stages,” Proc. Seventh IEEE Symp. Computer Arithmetic, pp. 64-71, 1985.
[7] T. Williams and M. Horowitz, “SRT Division Diagrams and Their Usage in Designing Custom Integrated Circuits for Division,” Technical Report CSL-TR-87-326, Stanford Univ., 1986.
[8] N. Burgess and T. Williams, “Choices of Operand Truncation in the SRT Division Algorithm,” IEEE Trans. Computers, vol. 44, no. 7, pp. 933-938, July 1995.
[9] M. Ercegovac and T. Lang, Division and Square Root: Digit-Recurrence Algorithms and Implementations. Kluwer Academic, 1994.
[10] S. Oberman and M. Flynn, “Minimizing the Complexity of SRT Tables,” IEEE Trans. VLSI Systems, vol. 6, no. 1, pp. 141-149, Mar. 1998.
[11] B. Parhami, “Precision Requirements for Quotient Digit Selection in High-Radix Division,” Proc. 35th Asilomar Conf. Circuits, Systems, and Computers, pp. 1670-1673, 2001.
[12] L. Ciminiera and P. Montuschi, “Higher Radix Square Rooting,” IEEE Trans. Computers, vol. 39, no. 10, pp. 1220-1231, Oct. 1990.
[13] M. Ercegovac and T. Lang, “Radix-4 Square Root without Initial PLA,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1016-1024, Aug. 1990.
[14] M. Ercegovac and T. Lang, “On-the-Fly Conversion of Redundant into Conventional Representations,” IEEE Trans. Computers, vol. 36, no. 7, pp. 895-897, July 1987, reprinted in [17].
[15] M. Daumas and D. Matula, “Further Reducing the Redundancy of Notation over a Minimally Redundant Digit Set,” J. VLSI Signal Processing, vol. 33, nos. 1/2, pp. 7-18, 2003.
[16] Computer Arithmetic, Vol I, E.E. Swartzlander, ed. Dowden, Hutchinson and Ross, Inc., 1980, reprinted by IEEE CS Press, 1990.
[17] Computer Arithmetic, Vol II, E.E. Swartzlander, ed. IEEE CS Press, 1990.

Index Terms:
Digit selection, division, square root.
Citation:
Peter Kornerup, "Digit Selection for SRT Division and Square Root," IEEE Transactions on Computers, vol. 54, no. 3, pp. 294-303, March 2005, doi:10.1109/TC.2005.47
Usage of this product signifies your acceptance of the Terms of Use.