2021 IEEE International Symposium on Circuits and Systems (ISCAS) 2021
DOI: 10.1109/iscas51556.2021.9401664
|View full text |Cite
|
Sign up to set email alerts
|

Fast Logic Optimization Using Decision Trees

Abstract: This work evaluates the use of Decision Trees (DTs) methods for a fast logic minimization of Boolean functions. The proposed DT approach is compared to traditional Espresso logic minimizer and the minimization algorithms available in the ABC tool. The methods are compared with respect to the execution time, number of nodes and number of logic levels. The DT methods proved to be a faster alternative, reducing time by an average of 52% and 5.5% when compared to Espresso and ABC respectively, while keeping compet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…This is one of the supervised ML models used for both classification and regression [33]. Its structure resembles a flowchart and is made up of internal nodes, branches, and leaf nodes.…”
Section: ) Dtmentioning
confidence: 99%
“…This is one of the supervised ML models used for both classification and regression [33]. Its structure resembles a flowchart and is made up of internal nodes, branches, and leaf nodes.…”
Section: ) Dtmentioning
confidence: 99%
“…They usually represent the logic structure itself, meaning a direct mapping is realized from DT or RF structure to the Boolean network. In Abreu [48], a logic optimization technique focused on fast synthesis is proposed using DT, presenting superior results in runtime compared to ABC and Espresso techniques with total accuracy. This approach explores the creation of DT trained on top of a given truth table.…”
Section: B Logic Learningmentioning
confidence: 99%