Hard-Wired Multipliers with Encoded Partial Products

A multibit overlapped scanning multiplication algorithm for sign-magnitude and two's complement hard-wired multipliers is presented. The theorems necessary to construct the multiplication matrix for sign-magnitude representations are emphasized. Consequently, the algorithm for sign-magnitude multiplication and its variation to include two's complement numbers are presented. The proposed algorithm is compared to previous algorithms that generate a sign extended partial product matrix, with an implementation and with a study of the number of elements in the partial product matrix. The proposed algorithm is shown to yield significant savings over well known algorithms for the generation and the reduction of the partial product matrix of a multiplier designed with multibit overlapped scanning. >

[1]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[2]  Stamatis Vassiliadis,et al.  Array two's-complement multiplier and square function , 1987 .

[3]  G. De Micheli,et al.  Approaching a nanosecond: a 32 bit adder , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[4]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

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

[6]  Paul A. Wintz,et al.  Fast Multipliers , 1970, IEEE Transactions on Computers.

[7]  Huey Ling.  High Speed Binary Adder , 1981, IBM J. Res. Dev..

[8]  Luigi Dadda.  Composite Parallel Counters , 1980, IEEE Transactions on Computers.

[9]  R. De Mori,et al.  A Parallel Structure for Signed-Number Multiplication and Addition , 1972, IEEE Transactions on Computers.

[10]  E. Schwarz,et al.  Unified multi-bit overlapped-scanning multiplier algorithm , 1988, Proceedings of the IEEE Southern Tier Technical Conference.

[11]  Stamatis Vassiliadis.  Recursive equations for hardwired binary adders , 1989 .

[12]  Joseph Cavanagh,et al.  Digital Computer Arithmetic , 1983 .

[13]  Stylianos D. Pezaris.  A 40-ns 17-Bit by 17-Bit Array Multiplier , 1971, IEEE Transactions on Computers.

[14]  Jack Sklansky,et al.  Conditional-Sum Addition Logic , 1960, IRE Trans. Electron. Comput..

[15]  Stamatis Vassiliadis,et al.  A General Proof for Overlapped Multiple-Bit Scanning Multiplications , 1989, IEEE Trans. Computers.

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

[17]  Norman R. Scott.  Computer Number Systems and Arithmetic , 1984 .

[18]  S. Vassiliadis,et al.  Parallel Encryted Array Multipliers , 1988, IBM J. Res. Dev..

[19]  Stamatis Vassiliadis.  A comparison between adders with new defined carries and traditional schemes for addition , 1988 .