Global and Modular Two's Complement Cellular Array Multipliers
- 1 April 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-28 (4) , 300-306
- https://doi.org/10.1109/tc.1979.1675350
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Effective Pipelining of Digital SystemsIEEE Transactions on Computers, 1978
- Synthesis and Comparison of Two's Complement Parallel MultipliersIEEE Transactions on Computers, 1975
- A Two's Complement Parallel Array Multiplication AlgorithmIEEE Transactions on Computers, 1973
- A 40-ns 17-Bit by 17-Bit Array MultiplierIEEE Transactions on Computers, 1971
- An Iterative Array for Multiplication of Signed Binary NumbersIEEE Transactions on Computers, 1971
- Fast MultipliersIEEE Transactions on Computers, 1970
- Suggestion for an i.c. fast parallel multiplierElectronics Letters, 1969
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964