Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Factoring and recognition of read-once functions using cographs and normality
Proceedings of the 38th annual Design Automation Conference
Factorizing complex predicates in queries to exploit indexes
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Factoring boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics
Factoring Boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
On algebraic expressions of series-parallel and Fibonacci graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
| Hi-index | 0.00 |
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical properties and the dependent stage where mapping to a physical cell library is done. The independent stage includes logic operations like Decomposition, Extraction, Factoring, Substitution and Elimination. These operations are done with some kind of division (boolean, algebraic), with the goal being to obtain a logically equivalent factored form which minimizes the number of literals.In this paper, we present an algorithm for factoring that uses graph partitioning rather than division. Central to our approach is to combine this with the use of special classes of boolean functions, such as read-once functions, to devise new combinatorial algorithms for logic minimization. Our method has been implemented in the SIS environment, and an empirical evaluation indicates that we usually get significantly better results than algebraic factoring and are quite competitive with boolean factoring but with lower computation costs.