Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Improved Techniques for Estimating Signal Probabilities
IEEE Transactions on Computers
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming
IEEE Transactions on Computers
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On the OBDD-Representation of General Boolean Functions
IEEE Transactions on Computers
Functional approaches to generating orderings for efficient symbolic representations
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions
IEEE Transactions on Computers
Negation Trees: A Unified Approach to Boolean Function Complementation
IEEE Transactions on Computers
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Solution of Switching Equations Based on a Tabular Algebra
IEEE Transactions on Computers
Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"
IEEE Transactions on Computers
Data structures, minimization and complexity of boolean functions
Data structures, minimization and complexity of boolean functions
OBDD Minimization Based on Two-Level Representation of Boolean Functions
IEEE Transactions on Computers
Solution of systems of Boolean equations via the integer domain
Information Sciences: an International Journal
| Hi-index | 14.98 |
Boolean equations are important tools in digital logic. Previous algorithms for solving Boolean equations are based on the Boolean algebra of disjoint SOP forms. In this paper, we develop a new Boolean algebra with more efficient Boolean operation algorithms, called the reduced ordered SOP (ROSOP) forms, which are canonical representations. ROSOPs are closely related to the well-known OBDD data structure. The results here also show the algebraic structure of OBDDs.