Gate for gate modular replacement of combinational switching networks

Authors:
Douglas C. Schmidt
Affiliations:
-
Venue:
DAC '72 Proceedings of the 9th Design Automation Workshop
Year:
1972

Citing 3
Cited 3

An extension of the Munkres algorithm for the assignment problem to rectangular matrices

Communications of the ACM
Algorithm 415: Algorithm for the assignment problem (rectangular matrices)

Communications of the ACM
On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits

DAC '68 Proceedings of the 5th annual Design Automation Workshop

Technology Mapping in Circuit Design Aids

IEEE Design & Test
Speculation on the future of design automation

DAC '74 Proceedings of the 11th Design Automation Workshop
Modular Replacement of Combinational Switching Networls

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Design automation processors are best known for their ability to competently accomplish the more tedious tasks in computer design. Almost invariably they are restricted to tasks which occur after the logic design is completed (diagnosis, partitioning, assignment, routing, etc.). The procedure presented in this paper may be applied to take fuller advantage of the computer's capabilities.