The Area-Time Complexity of Binary Multiplication
- 1 July 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (3), 521-534
- https://doi.org/10.1145/322261.322269
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On the area of binary tree layoutsInformation Processing Letters, 1980
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980
- The chip complexity of binary arithmeticPublished by Association for Computing Machinery (ACM) ,1980
- Cost and performance of VLSI computing structuresIEEE Journal of Solid-State Circuits, 1979
- A Survey of Some Recent Contributions to Computer ArithmeticIEEE Transactions on Computers, 1976
- On the Addition of Binary NumbersIEEE Transactions on Computers, 1970
- An approach to the implementation of digital filtersIEEE Transactions on Audio and Electroacoustics, 1968
- On the Time Required to Perform MultiplicationJournal of the ACM, 1967
- On the Time Required to Perform AdditionJournal of the ACM, 1965
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964