Combinational Circuit Synthesis with Time and Component Bounds
- 1 August 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (8) , 712-726
- https://doi.org/10.1109/tc.1977.1674909
Abstract
New results are given concerning the design of combinational logic circuits. We give time and component bounds for combinational circuits specified in several ways. For any sequential machine defined by linear recurrence relations, we discuss an algorithm for the synthesis of equivalent combinational logic. The procedure includes upper bounds on the time and components involved. We also discuss the transformation of nonlinear recurrences into combinational circuits. Examples are given using gates as well as IC's as components. These include binary addition, multiplication, and ones' position counting. The time and component bounds our procedure yields compare favorably with traditional results.Keywords
This publication has 12 references indexed in Scilit:
- Solving Triangular Systems on a Parallel ComputerSIAM Journal on Numerical Analysis, 1977
- Reduction of Depth of Boolean Networks with a Fan-In ConstraintIEEE Transactions on Computers, 1977
- Time and Parallel Processor Bounds for Linear Recurrence SystemsIEEE Transactions on Computers, 1975
- An Algorithm for High-Speed Digital FiltersIEEE Transactions on Computers, 1974
- Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativityActa Informatica, 1974
- The Parallel Evaluation of Arithmetic Expressions Without DivisionIEEE Transactions on Computers, 1973
- 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
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961