论文信息 - Design of a Hih-Speed Square Root Multiply and Divide Unit

Design of a Hih-Speed Square Root Multiply and Divide Unit

In this paper radix-4 algorithms for square root and division are developed. The division algorithm evaluates the more useful function xz/y. These algorithms are shown to be suitable for implementing as a unified hardware unit which evaluates square root, division, and multiplication. Cost reductions in the hardware are obtained by use of gate arrays. A design based on the Motorola MCA2500 series of Macrocell gate array (MCA) is presented. At a cost of 9 MCA's and 16 commercial ECL 100 K parts a 64-bit square root can be evaluated in 750 us using worst case delays. Division takes 710 ns and multiplication 325 ns. Redundancy in the digit set together with carry-save adders are used to achieve this high performance.

J. B. Gosling | John H. Zurawski | J. Gosling | J. Zurawski

[1] James E. Robertson,et al. A New Class of Digital Division Methods , 1958, IRE Trans. Electron. Comput..

[2] T. C. Chen. Automatic computation of exponentials, logarithms, ratios and square roots , 1972 .

[3] Neil R. Lincoln. Technology and Design Tradeoffs in the Creation of a Modern Supercomputer , 1982, IEEE Transactions on Computers.

[4] J. B. Gosling,et al. Design of High-Speed Digital Divider Units , 1981, IEEE Transactions on Computers.

[5] J. B. Gosling,et al. Hardware evaluation of mathematical functions , 1981 .

[6] D. J. Kinniment,et al. Uncommitted logic array which provides cost-effective multiplication even for long words , 1979 .

[7] Ansi Ieee,et al. IEEE Standard for Binary Floating Point Arithmetic , 1985 .

[8] John B. Gosling,et al. Design of Arithmetic Units for Digital Computers , 1980, Springer New York.

[9] J. V. Woods,et al. MU6-G. a new design to achieve mainframe performance from a mini-sized computer , 1980, ISCA '80.

[10] Garry J. Tee,et al. Handbook for computing elementary functions , 1968 .