17th International Conference on VLSI Design. Proceedings.
DOI: 10.1109/icvd.2004.1261022
|View full text |Cite
|
Sign up to set email alerts
|

Boolean decomposition using two-literal divisors

Abstract: This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of too many Boolean divisors has been the main reason why Boolean decomposition has had limited success. This paper explores a new strategy based on the decomposition of Boolean functions by means of two-literal divisors. The strategy is shown to derive superior results while still maintaining an affordable complexity. The results show im… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(15 citation statements)
references
References 15 publications
0
15
0
Order By: Relevance
“…By reducing the amount of two-level minimizations compared to [15], runtime is reduced 40 times on average, without sacrificing the quality of the results. Note that the results in this work cannot be directly compared with [15], which only presents the decomposition of single-output functions and it is not applied for circuit optimization.…”
Section: Aig Optimization Examplementioning
confidence: 99%
See 4 more Smart Citations
“…By reducing the amount of two-level minimizations compared to [15], runtime is reduced 40 times on average, without sacrificing the quality of the results. Note that the results in this work cannot be directly compared with [15], which only presents the decomposition of single-output functions and it is not applied for circuit optimization.…”
Section: Aig Optimization Examplementioning
confidence: 99%
“…This section introduces a new AIG optimization approach, based on Boolean decomposition with two-literal divisors [15]. Boolean methods are known to be inefficient and not scalable, but also to obtain better results when compared with algebraic methods.…”
Section: Aig Optimization Approachmentioning
confidence: 99%
See 3 more Smart Citations