Coalgebraic division for multilevel logic synthesis
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Logic synthesis
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
The Fanout Structure of Switching Functions
Journal of the ACM (JACM)
Factoring logic functions using graph partitioning
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Factoring and recognition of read-once functions using cographs and normality
Proceedings of the 38th annual Design Automation Conference
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Logic synthesis for vlsi design
Logic synthesis for vlsi design
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
IBM Journal of Research and Development - Mathematics and computing
Efficient Boolean division and substitution using redundancy addition and removing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Boolean division and factorization using binary decision diagrams
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Factoring Boolean functions is one of the basic operations in algorithmic logic synthesis. Current algorithms for factoring Boolean functions are based on some kind of division (Boolean or algebraic). In this paper, we present an algorithm for factoring that uses graph partitioning rather than division. Our algorithm is recursive and operates on the function and on its dual, to obtain the better factored form. As a special class, which appears in the lower levels of the factoring process, we handle read-once functions separately, as a special purpose subroutine which is known to be optimal. Since obtaining an optimal (shortest length) factorization for an arbitrary Boolean function is an NP-hard problem, all practical algorithms for factoring are heuristic and provide a correct, logically equivalent formula, but not necessarily a minimal length solution. Our method has been implemented in the SIS environment, and an empirical evaluation indicates that we usually get significantly better factorizations than algebraic factoring and are quite competitive with Boolean factoring but with lower computation costs.