Studies on Hardware Algorithms for Arithmetic Operations with a Redundant Binary Representation

Arithmetic has played important roles in human civilization, especially in the area of science, engineering and technology. With recent advances of IC (Integrated Circuit) technology, more and more sophisticated arithmetic processors have become standard hardware for high-performance digital computing systems. It is desired to develop high-speed multipliers, dividers and other specialized arithmetic circuits suitable for VLSI (Very Large Scale Integrated circuit) implementation. In order to develop such high-performance arithmetic circuits, it is important to design hardware algorithms for these operations, i.e., algorithms suitable for hardware implementation. The design of hardware algorithms for arithmetic operations has become a very attractive research subject. In this thesis, new hardware algorithms for multiplication, division, square root extraction and computations of several elementary functions are proposed. In these algorithms a redundant binary representation which has radix 2 and a digit set {l,O,l} is used for internal computation. In the redundant binary number system, addition can be performed in a constant time

[1]  F. J. Taylor,et al.  Residue Arithmetic A Tutorial with Examples , 1984, Computer.

[2]  Stanislaw Majerski.  Square-Rooting Algorithms for High-Speed Digital Circuits , 1985, IEEE Transactions on Computers.

[3]  Walter H. Ku,et al.  Fixed-Point High-Speed Parallel Multipliers in VLSI , 1981 .

[4]  Raymond M. Kline,et al.  Digital computer design , 1977 .

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

[6]  David W. Matula.  Fixed-slash and floating-slash rational arithmetic , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[7]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[8]  Gernot Metze,et al.  Minimal Square Rooting , 1965, IEEE Trans. Electron. Comput..

[9]  C. K. Wong,et al.  A hardware sort-merge system , 1985 .

[10]  W. McAllister,et al.  An NMOS 64b floating-point chip set , 1986, 1986 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[11]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[12]  Naofumi Takagi,et al.  Design of high speed MOS multiplier and divider using redundant binary representation , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

[13]  Damiel E. Atkins.  Higher-Radix Division Using Estimates of the Divisor and Partial Remainders , 1968, IEEE Transactions on Computers.

[14]  J. Vuillemin,et al.  Recursive implementation of optimal time VLSi integer multipliers , 1984 .

[15]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

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

[17]  D.E. Atkins.  Design of the Arithmetic Units of ILLIAC III: Use of Redundancy and Higher Radix Methods , 1970, IEEE Transactions on Computers.

[18]  H. T. Kung,et al.  The Area-Time Complexity of Binary Multiplication , 1981, JACM.

[19]  W. Kenneth Jenkins,et al.  The Design of Error Checkers for Self-Checking Residue Number Arithmetic , 1983, IEEE Transactions on Computers.

[20]  Hiroto Yasuura,et al.  The Parallel Enumeration Sorting Scheme for VLSI , 1982, IEEE Transactions on Computers.

[21]  James E. Smith,et al.  Strongly Fault Secure Logic Networks , 1978, IEEE Transactions on Computers.

[22]  N. Takagi,et al.  A high-speed multiplier using a redundant binary adder tree , 1987 .

[23]  Gernot Metze,et al.  Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes , 1973, IEEE Transactions on Computers.

[24]  Dharma P. Agrawal.  High-Speed Arithmetic Arrays , 1979, IEEE Transactions on Computers.

[25]  H. Garner.  The residue number system , 1959, IRE-AIEE-ACM '59 (Western).

[26]  George S. Taylor.  Radix 16 SRT dividers with overlapped quotient selection stages: A 225 nanosecond double precision divider for the S-1 Mark IIB , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[27]  William J. Kubitz,et al.  A Compact High-Speed Parallel Multiplication Scheme , 1977, IEEE Transactions on Computers.

[28]  矢島 脩三,et al.  Redundant Coding and Local Computability in Parallel Computation(Mathematical Foundations of Computer Science and Their Applications) , 1985 .

[29]  James E. Robertson,et al.  Logical design of a redundant binary adder , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).