Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
SOCRATES: a system for automatically synthesizing and optimizing combinational logic
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
ACM Transactions on Graphics (TOG)
Quasi-algebraic decompositions of switching functions
ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
Factorizing complex predicates in queries to exploit indexes
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
EURO-DAC '90 Proceedings of the conference on European design automation
Factoring boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Transistor-Level Optimization of Supergates
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
World-set decompositions: Expressiveness and efficient algorithms
Theoretical Computer Science
Synthesis of multi-level dual reed-muller expressions
NANOTECHNOLOGY'09 Proceedings of the 1st WSEAS international conference on Nanotechnology
Factoring Boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
World-set decompositions: expressiveness and efficient algorithms
ICDT'07 Proceedings of the 11th international conference on Database Theory
FDB: a query engine for factorised relational databases
Proceedings of the VLDB Endowment
Aggregation and ordering in factorised databases
Proceedings of the VLDB Endowment
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
A factored form is a representation of a logic function that is either a single literal or a sum or product of factored forms. Thus it is equivalent to a parenthesized algebraic expression. It is one of many possible representations of a logic function, but seems to be the most appropriate one for use in multilevel logic synthesis. We give a number of methods for obtaining different factored forms for a given logic function. These methods range from purely algebraic ones, which are quite fast, to so-called Boolean ones, which are slower but are capable of giving better results. One of the methods given is both fast and gives good results, and is useful in providing continuous estimates of area and delay as logic synthesis proceeds. In multilevel logic synthesis, each of the methods given has a use in a system where run-time and quality are traded off. We also formulate the problem of optimal algebraic factorization, and pose its solution as a rectangle-covering problem for which a heuristic method is given.