2016
DOI: 10.1007/978-3-319-40970-2_14
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT

Abstract: Abstract. Two Boolean functions are NPN equivalent if one can be obtained from the other by negating inputs, permuting inputs, or negating the output. NPN equivalence is an equivalence relation and the number of equivalence classes is significantly smaller than the number of all Boolean functions. This property has been exploited successfully to increase the efficiency of various logic synthesis algorithms. Since computing the NPN representative of a Boolean function is not scalable, heuristics have been propo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 20 publications
0
9
0
Order By: Relevance
“…al. [43], this calculation can still be time-consuming. This effort can be reduced immensely by proving NPN isomorphism on smaller logic blocks and then composing proved classes to obtain larger ones.…”
Section: Composition Of Npn Isomorphismmentioning
confidence: 99%
“…al. [43], this calculation can still be time-consuming. This effort can be reduced immensely by proving NPN isomorphism on smaller logic blocks and then composing proved classes to obtain larger ones.…”
Section: Composition Of Npn Isomorphismmentioning
confidence: 99%
“…The canonical form of each equivalence class has a special value. References [6][7][8][9][10][11][12] studied Boolean matching based on canonical forms and attained significant achievements.…”
Section: Related Workmentioning
confidence: 99%
“…Although LEXSAT has emerged recently, it is already shown useful for many Electronic Design Automation (EDA) applications. For example, Soeken et al [11] show that LEX-SAT enables heuristic NPN classification of large functions with up to 194 variables. In this case, LEXSAT improves an algorithm that was previously limited to functions with up to 16 variables, for which truth tables could be computed [4].…”
Section: Applications Of Lexsatmentioning
confidence: 99%
“…Generation of a single LEXSAT assignment. Some LEXSAT-based applications, such as the NPN classifica-tion [11], require multiple LEXSAT assignments, but they are not in a consecutive order or they are for different functions. Thus, first, we evaluate the runtime and number of SAT calls required by each algorithm for generating a single LEXSAT assignment.…”
Section: Runtime Comparisonmentioning
confidence: 99%