Global and Modular Two's Complement Cellular Array Multipliers

Two new families of LSI iterative logic arrays are proposed to perform two's complement multiplication based on the Baugh–Wooley algorithm [2]. The global approach is faster and attractive for LSI but limited in size due to current monolithic and packaging technology. The modular approach is better suited to realizing arbitrarily large array multipliers at only slight decrease in speed. The proposed additive multiply modules can be externally programmed by hardwiring to multiply binary numbers in either two's complement or unsigned format. No peripheral logic circuits such as Wallace trees or complementers are needed in constructing the proposed modular multiplication networks. Speed analysis, hardware complexity, packaging, and application requirements of the proposed array multipliers are also provided.

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

[2]  Jayanti C. Majithia,et al.  An Iterative Array for Multiplication of Signed Binary Numbers , 1971, IEEE Transactions on Computers.

[3]  R. Mori Suggestion for an i.c. fast parallel multiplier , 1969 .

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

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

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

[7]  Sudhir Ahuja,et al.  Effective Pipelining of Digital Systems , 1978, IEEE Transactions on Computers.

[8]  John A. Gibson,et al.  Synthesis and Comparison of Two's Complement Parallel Multipliers , 1975, IEEE Transactions on Computers.