This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Radix 2 Division with Over-Redundant Quotient Selection
January 1997 (vol. 46 no. 1)
pp. 85-92

Abstract—In this paper we present a new radix 2 division algorithm that uses a recurrence employing simple 3-to-2 digit carry-free adders to perform carry-free addition/subtraction for computing the partial remainders in radix 2 signed-digit form. The quotient digit, during any iteration of the division recursion, is generated from the two most-significant radix 2 digits of the partial remainder and independent of the divisor in over-redundant radix 2 digit form (i.e., with digits which belong to the digit set {−2, −1, 0, +1, +2}). The over-redundant quotient digits are then converted to the conventional radix 2 digits (belonging to the set {−1, 0, +1}) by using a reduction technique. This division algorithm is well suited for IEEE 754 standard operands belonging to the range [1, 2) and is slightly faster than previously proposed radix 2 designs (such as the radix 2 SRT), which do not employ input scaling, since the quotient selection for such algorithms is a function of more than two most-significant radix 2 digits of the partial remainder. In comparison with the designs that employ input scaling, the proposed design although slightly slower saves hardware required for scaling purposes.

[1] A. Avizienis, "Signed Digit Number Representation for Fast Parallel Arithmetic," IRE Trans. Electronic Computers, vol. 10, pp. 389-400, Sept. 1961.
[2] J.E. Robertson, "A New Class of Digital Division Methods," IRE Trans. Electronic Computers, vol. 7, pp. 218-222, Sept. 1958.
[3] T.D. Tocher, "Techniques of Multiplication and Division for Automatic Binary Computers," Quarterly J. Mech. App. Math., vol. 2, pt. 3, pp. 364-384, 1958.
[4] S. Kuninobu, T. Nishiyama, H. Edamatsu, T. Tanaguchi, and N. Takagi, "Design of High Speed MOS Multiplier and Divider Using Redundant Binary Representation," Proc. Eight Symp. Computer Arithmetic, pp. 80-86,Como, Italy, 1987.
[5] A. Vandemeulebroecke,E. Vanzieleghem,T. Denayer, and P.G.A. Jespers,"A New Carry-Free Diversion Algorithm and Its Application to a Single-Chip 1024-b RSA Processor," IEEE J. Solid State Circuits, vol. 25, no. 3, pp. 748-765, 1990.
[6] M.D. Ercegovac and T. Lang, Division and Square Root.Norwell, Mass.: Kluwer Academic, 1994.
[7] N. Burgess,“A fast division algorithm for VLSI,” Proc. ICCD, pp. 560-563, 1991.
[8] 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. 80-86,Windsor, Ontario, Canada, 29 June- July2 1993.
[9] A. Svoboda, "An Algorithm for Division," Information Processing Machines, vol. 9, pp. 183-190, Mar. 1963.
[10] C. Tung, "A Division Algorithm for Signed-Digit Arithmetic," IEEE Trans. Computers, vol. 17, pp. 887-889, Sept. 1968.
[11] P. Montuschi and L. Ciminiera, "Over-Redundant Digit Sets and the Design of Digit-by-Digit Division Units," IEEE Trans. Computers, vol. 43, no. 3, pp. 269-279, Mar. 1994.
[12] H.R. Srinivas, "High Speed Computer Arithmetic Architectures," PhD thesis, Univ. of Minnesota, Dept. of Electrical Eng., Sept. 1994.
[13] D.E. Atkins, "Higher-Radix Divsion Using Estimates of the Divisor and Partial Remainders," IEEE Tans. Computers, vol. 17, pp. 925-934, Oct. 1968.
[14] 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.
[15] P. Montuschi and L. Ciminiera, "Design of a Radix-4 Division Unit with Simple Selection Table," IEEE Trans. Computers, vol. 41, no. 12, pp. 1,606-1,611, Dec. 1992.
[16] H.R. Srinivas and K.K. Parhi, "A Fast Radix-4 Division Algorithm and Its Architecture," IEEE Trans. Computers, vol. 44, no. 6, pp. 826-831, June 1995.
[17] J. Fandrianto, "Algorithm for High-Speed Shared Radix-4 Division Algorithm," Proc. Eighth IEEE Symp. Computer Arithmetic, pp. 73-79,Como, Italy, May 1987.
[18] M.D. Ercegovac and T. Lang,"On-the-Fly Conversion of Redundant into Conventional Representations," IEEE Trans. Computers, vol. 36, pp. 895-897, 1987.
[19] M.J. Irwin and R.M. Owens, "Design Issues in Digit Serial Signal Processors," Proc. IEEE Int'l Symp. Circuits and Systems, pp. 441-444,Portland, Ore., 1989.
[20] I. Koren, Computer Arithmetic Algorithms.Englewood Cliffs, N.J.: Prentice Hall, 1993.
[21] H.R. Srinivas and K.K. Parhi, "High-Speed VLSI Arithmetic Processors Using Hybrid Number Systems," J. VLSI Signal Processing, vol. 4, pp. 177-198, Apr. 1992.
[22] R.P. Brent and H.T. Kung, "A Regular Layout for Parallel Adders," IEEE Trans. Computers, vol. 31, no. 3, pp. 260-264, Mar. 1982.

Index Terms:
Division, radix 2 redundant arithmetic, signed digit arithmetic, over-redundant representation, division without prescaling, two-digit quotient selection.
Citation:
Hosahalli R. Srinivas, Keshab K. Parhi, Luis A. Montalvo, "Radix 2 Division with Over-Redundant Quotient Selection," IEEE Transactions on Computers, vol. 46, no. 1, pp. 85-92, Jan. 1997, doi:10.1109/12.559806
Usage of this product signifies your acceptance of the Terms of Use.