1993 European Conference on Design Automation With the European Event in ASIC Design
DOI: 10.1109/edac.1993.386445
|View full text |Cite
|
Sign up to set email alerts
|

Multi-level logic optimization based on pseudo maximum sets of permissible functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…One idea was to use an easy computable subset of permissible functions, what resulted in a weaker optimization capability. Another approach was to determine, for a node in a network, a superset of permissible functions and later check the validity of the perturbation and/or transformation [14]. Selection of a gate to be perturbed as well as the resulting changes are determined based on the structure of the network and on the permissible functions of the nodes.…”
Section: Introductionmentioning
confidence: 99%
“…One idea was to use an easy computable subset of permissible functions, what resulted in a weaker optimization capability. Another approach was to determine, for a node in a network, a superset of permissible functions and later check the validity of the perturbation and/or transformation [14]. Selection of a gate to be perturbed as well as the resulting changes are determined based on the structure of the network and on the permissible functions of the nodes.…”
Section: Introductionmentioning
confidence: 99%