Hardware algorithms for VLSI systems
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 105-129
- https://doi.org/10.1007/bfb0043450
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Design for Testability—A SurveyIEEE Transactions on Computers, 1982
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Width and depth of combinational logic circuitsInformation Processing Letters, 1981
- Square rooting is as difficult as multiplicationComputing, 1979
- A High Density Programmable Logic Array ChipIEEE Transactions on Computers, 1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- A Compact High-Speed Parallel Multiplication SchemeIEEE Transactions on Computers, 1977
- Tree Realizations of Iterative CircuitsIEEE Transactions on Computers, 1977
- Power Minimization Problems of Logic NetworksIEEE Transactions on Computers, 1974
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964