The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1977 vol.26)
pp: 712-726
null Shyh-Ching Chen , Burroughs Corporation, Great Valley Laboratory
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.
INDEX TERMS
Binary addition, binary multiplication, circuit synthesis, combinational circuits, component bounds, sequential circuits, time bounds.
CITATION
null Shyh-Ching Chen, D.J. Kuck, "Combinational Circuit Synthesis with Time and Component Bounds", IEEE Transactions on Computers, vol.26, no. 8, pp. 712-726, August 1977, doi:10.1109/TC.1977.1674909
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool