Area—Time optimal VLSI integer multiplier with minimum computation time
Open Access
- 1 July 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 58 (1-3) , 137-156
- https://doi.org/10.1016/s0019-9958(83)80061-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A very fast multiplication algorithm for VLSI implementationIntegration, 1983
- A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large IntegersIEEE Transactions on Computers, 1983
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980
- Schnelle Multiplikation großer ZahlenComputing, 1971
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964