
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Luis A. Montalvo, Keshab K. Parhi, Alain Guyot, "New SvobodaTung Division," IEEE Transactions on Computers, vol. 47, no. 9, pp. 10141020, September, 1998.  
BibTex  x  
@article{ 10.1109/12.713319, author = {Luis A. Montalvo and Keshab K. Parhi and Alain Guyot}, title = {New SvobodaTung Division}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {9}, issn = {00189340}, year = {1998}, pages = {10141020}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.713319}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  New SvobodaTung Division IS  9 SN  00189340 SP1014 EP1020 EPD  10141020 A1  Luis A. Montalvo, A1  Keshab K. Parhi, A1  Alain Guyot, PY  1998 KW  Computer arithmetic KW  digitrecurrence division KW  SvobodaTung method KW  operand prescaling KW  redundant number system. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—This paper presents a general theory for developing new SvobodaTung (or simply NST) division algorithms not suffering the drawbacks of the "classical" SvobodaTung (or simply ST) method. NST avoids the drawbacks of ST by proper recoding of the two most significant digits of the residual before selecting the most significant digit of this recoded residual as the quotientdigit. NST relies on the divisor being in the range [1, 1 + δ), where δ is a positive fraction depending upon: 1) the radix, 2) the signeddigit set used to represent the residual, and 3) the recoding conditions of the two most significant digits of the residual. If the operands belong to the IEEEStd range [1, 2), they have to be conveniently prescaled. In that case, NST produces the correct quotient but the final residual is scaled by the same factor as the operands, therefore, NST is not useful in applications where the unscaled residual is necessary. An analysis of NST shows that previously published algorithms can be derived from the general theory proposed in this paper. Moreover, NST reveals a spectrum of new possibilities for the design of alternative division units. For a given radix
[1] D.E. Atkins, "HigherRadixDivision Using Estimates of the Divisor and Partial Remainders," IEEE Trans. Computers, vol. 17, no. 10, pp. 925934, Oct. 1968.
[2] C. Tung, "A Division Algorithm for SignedDigit Arithmetic," IEEE Trans. Computers, vol. 17, no. 9, pp. 887889, Sept. 1968.
[3] C. Tung, "SignedDigit Division Using Combinational Arithmetic Nets," IEEE Trans. Computers, vol. 19, no. 8, pp. 746748, Aug. 1970.
[4] A. Avizienis, "Signed Digit Number Representation for Fast Parallel Arithmetic," IRE Trans. Electronic Computers, vol. 10, pp. 389400, Sept. 1961.
[5] P. Montuschi and L. Ciminiera, "OverRedundant Digit Sets and the Design of DigitbyDigit Division Units," IEEE Trans. Computers, vol. 43, no. 3, pp. 269279, Mar. 1994.
[6] L. Montalvo and A. Guyot, "SvobodaTung Division with No Compensation," Proc. Eighth IEEE Int'l Conf. VLSI Design, pp. 381385,New Delhi, India, Jan. 1995.
[7] N. Burgess,“A fast division algorithm for VLSI,” Proc. ICCD, pp. 560563, 1991.
[8] H.R. Srinivas and K.K. Parhi, "A Fast Radix4 Division Algorithm and Its Architecture," IEEE Trans. Computers, vol. 44, no. 6, pp. 826831, June 1995.
[9] A. Houelle, H. Mehrez, N. Vaucher, L. Montalvo, and A. Guyot, "Application of Fast Layout Synthesis Environment to Dividers Evaluation," Proc. 12th Symp. Computer Arithmetic, pp. 6774,Bath, England,1921 July 1995.
[10] L. Montalvo and A. Guyot, "A Minimally Redundant Radix4 Divider with Operands Scaling," Proc. IX Congreso de Diseño de Circuitos Integrados DCIS '94, pp. 471476,Gran Canaria, Spain, Nov. 1994.
[11] E.V. Krishnamurthy, "On RangeTransformation Techniques for Division," IEEE Trans. Computers, vol. 19, no. 2, pp. 157160, Feb. 1970.
[12] 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.
[13] 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.
[14] 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.
[15] ANSI/IEEE Std. 7541985, Binary FloatingPoint Arithmetic, IEEE Press, Piscataway, N.J., 1985 (also called ISO/IEC 559).
[16] J.E. Robertson, "A New Class of Digital Division Methods," IRE Trans. Electronic Computers, vol. 7, pp. 218222, Sept. 1958.
[17] L.A. Montalvo, "Number Systems for High Performance Dividers," Phd thesis, Institut National Politechnique de Gre noble, Grenoble, France, Mar. 1995.
[18] L. Montalvo and A. Guyot, "Combinational DigitSet Converters for Hybrid Radix4 Arithmetic," Proc. IEEE Int'l Conf. Computer Design ICCD '94, pp. 498503,Cambridge, Mass., Oct. 1994.
[19] D. Das Sarma and D.W. Matula, “Measuring the Accuracy of ROM Reciprocal Tables,” IEEE Trans. Computers, vol. 43, no. 8, Aug. 1994.
[20] M.D. Ercegovac and T. Lang, Division and Square Root.Norwell, Mass.: Kluwer Academic, 1994.
[21] D. Ferrari, "A Division Method Using a Parallel Multiplier," IEEE Trans. Computers, vol. 16, pp. 224226, 1967.
[22] A. Guyot, L. Montalvo, A. Houelle, H. Mehrez, and N. Vaucher, "Comparison of the Layout Synthesis of Radix2 and PseudoRadix4 Dividers," Proc. of Eighth Int'l Conf. VLSI Design, pp. 386391, Jan. 1995.
[23] L. Montalvo, B. Behnam, T. Vassileva, and A. Guyot, "CMOS Implementation of a Hybrid Radix4 Divider," Proc. 20th European SolidState Circuits Conf. ESSCIRC '94, pp. 204207,Ulm, Germany, Sept. 1994.
[24] T.M. Carter and J.E. Robertson,“Radix16 signeddigit division,” IEEE Trans. Computers, vol. 39, pp. 1,4241,433, 1990.
[25] M.D. Ercegovac and T. Lang,"OntheFly Conversion of Redundant into Conventional Representations," IEEE Trans. Computers, vol. 36, pp. 895897, 1987.
[26] P. Montuschi and L. Ciminiera, "Design of a Radix4 Division Unit with Simple Selection Table," IEEE Trans. Computers, vol. 41, no. 12, pp. 1,6061,611, Dec. 1992.
[27] S. Kuninobu, H.E.T. Nishiyama, T. Tanaguchi, and N. Takagi, "Design of High Speed MOS Multiplier and Divider Using Redundant Binary Representation," Proc. Eighth Symp. Computer Arithmetic, pp. 8086,Como, Italy, 1987.
[28] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1995.
[29] A. Greiner and F. Pêcheux, "ALLIANCE: A Complete Set of CAD Tools for Teaching VLSI Design," Proc. Third Eurochip Workshop,Grenoble, France, Sept. 1992.
[30] A. Svoboda, "An Algorithm for Division," Information Processing Machines, no. 9, pp. 2532, 1963.