Exact BDD Minimization for Path-Related Objective Functions
نویسندگان
چکیده
In this paper we investigate the exact optimization of BDDs with respect to path-related objective functions. We aim at a deeper understanding of the computational effort of exact methods targeting the new objective functions. This is achieved by an approach based on Dynamic Programming which generalizes the framework of Friedman and Supowit. A prime reason for the computational complexity can be identified using this framework. For the first time, experimental results give the minimal expected path length of BDDs for benchmark functions. They have been obtained by an exact Branch&Bound method which can be derived from the general framework. The exact solutions are used to evaluate a heuristic approach. Apart from a few exceptions, the results prove the high quality of the heuristic solutions.
منابع مشابه
Minimization of Average Path Length in BDDs by Variable Reordering
Minimizing the Average Path Length (APL) in a BDD reduces the time needed to evaluate Boolean functions represented by BDDs. This paper describes an efficient heuristic APL minimization procedure based on BDD variable reordering. The reordering algorithm is similar to classical variable sifting with the cost function equal to the APL rather than the number of BDD nodes. The main contribution of...
متن کاملBDD Path Length Minimization Based on Initial Variable Ordering
A large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path length. The Average...
متن کاملExact Minimization of Free BDDs and Its Application to Pass-Transistor Logic Optimization
In several design methods for Pass-transistor Logic (PTL) circuits, Boolean functions are expressed as OBDDs in decomposed form and then the component OBDDs are directly mapped to PTL cells. The total size of OBDDs (number of nodes) corresponds to the circuit size. In this paper, we investigate a method for PTL synthesis based on exact minimization of Free BDDs (FBDDs). FBDDs are well-studied e...
متن کاملReducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space search. In contrast to all previous approaches, in which variables are moved through the BDD when exploring the state space, the new method makes use of a new technique to expand states to its successor states without ex...
متن کاملOn the Exact Minimization of Path-Related Objective Functions for BDDs
Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis and formal verification. In recent practical applications, BDDs are optimized with respect to new objective functions. In this paper we investigate the exact optimization of BDDs with respect to path-related objectiv...
متن کامل