This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
High-Radix Division and Square-Root with Speculation
August 1994 (vol. 43 no. 8)
pp. 919-931

The speed of high-radix digit-recurrence dividers and square-root units is mainly determined by the complexity of the result-digit selection. We present a scheme in which a simpler function speculates the result digit, and, when this speculation is incorrect, a rollback or a partial advance is performed. This results in operations with a shorter cycle time and a variable number of cycles. The scheme can be used in separate division and square-root units, or in a combined one. Several designs were realized and compared in terms of execution time and area. The fastest unit considered is a radix-512 divider with a partial advance of six bits.

[1] D.E. Atkins, "Higher-radix division using estimates of the divisor and partial remainder,"IEEE Trans. Comput., vol. C-17, pp. 925-934, Oct. 1968.
[2] R. Braytonet al., "MIS: A multiple level logic optimization system,"IEEE Trans. Comput.-Aided Design, vol. CAD-6, pp. 1062-1081, Nov. 1987.
[3] L. Ciminiera and P. Montuschi, "Higher radix square-rooting,"IEEE Trans. Comput., vol. 39, pp. 1220-1231, Oct. 1990.
[4] J. Cortadella and T. Lang, "Division with speculation of quotient digits," UPC/DAC Tech. Rep., 1993.
[5] M. D. Ercegovac and T. Lang, "On-the-fly conversion of redundant into conventional representations,"IEEE Trans. Comput., vol. C-36, no. 7, pp. 895-897, July 1987.
[6] M. Ercegovac and T. Lang, "Fast multiplication without carry propagation,"IEEE Trans. Comput., vol. 39, pp. 1385-1390, Nov. 1990.
[7] M. D. Ercegovac and T. Lang,Division and Square Root: Digit-Recurrence Algorithms and Implementations. New York: Kluwer Academic, 1994.
[8] European Silicon Structures,ES2 ECPD10 Library Databook, Apr. 1991.
[9] J. Fandrianto, "Algorithm for high speed shared radix 4 division and radix-4 square-root,"Proc. 8th IEEE Symp. Comput. Arithmetic, 1987, pp. 73-79.
[10] T. Lang and P. Montuschi, "Higher radix square-root with prescaling,"IEEE Trans. Comput., vol. 41, pp. 996-1009, Aug. 1992.
[11] D.W. Matula, "Design of a highly parallel floating point arithmetic unit,"Symp. Combinatorial Optimization Sci. and Technol. (COST), Apr. 1991.
[12] P. Montuschi and L. Ciminiera, "On the efficient implementation of higher radix square root algorithms," inProc. 9th Symp. Comput. Arithmetic, Sept. 1989, pp. 154-161.
[13] G.S. Taylor, "Radix-16 SRT dividers with overlapped quotient selection stages,"Proc. 7th IEEE Symp. Comput. Arithmetic, 1985, pp. 64-71.
[14] T. E. Williams and M. A. Horovitz, "A 160nS 54bit CMOS division implementation using self-timing and symmetrically overlapped SRT stages," inProc. 10th IEEE Symp. Comput. Arithmetic, Grenoble, France, June 1991, pp. 210-217.

Index Terms:
digital arithmetic; square-root; high-radix division; digit-recurrence dividers; result digit; speculation; execution time; partial advance; digital arithmetic; digit recurrence; variable-time operation.
Citation:
J. Cortadella, T. Lang, "High-Radix Division and Square-Root with Speculation," IEEE Transactions on Computers, vol. 43, no. 8, pp. 919-931, Aug. 1994, doi:10.1109/12.295854
Usage of this product signifies your acceptance of the Terms of Use.