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 expensive variable movements. Experimental results are given to show the efficiency of the approach.
منابع مشابه
Linear Transformations and Exact Minimization of BDDs
We present an exact algorithm to nd an optimal linear transformation for the variables of a Boolean function to minimize its corresponding ordered Binary Decision Diagram (BDD). To prune the huge search space, techniques known from algorithms for nding the optimal variable ordering are used. This BDD minimization nds direct application in FPGA design. We give experimental results for a large va...
متن کاملImplementation and Visualization of a BDD Package in JAVA
Decision Diagrams (DDs) are often used in VLSI CAD systems for efficient representation and manipulation of Boolean functions. The most popular data structure are reduced ordered Binary Decision Diagrams (BDDs) [Bry86,DB98], also called ROBDDs. They are part of almost all courses on function representation in VLSI CAD education. BDDs are very sensitive to the variable ordering, i.e. the size of...
متن کاملAn implicit formulation for exact BDD minimization
This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don’t care sets. Specifically, given an incompletely specified function and a fixed ordering of the variables, we propose an exact algorithm for selecting such that is a cover for and the binary decision diagram for is of minimum size. The approach described is the only known exact algorithm for th...
متن کاملBdd Minimization by Linear Transformations
Binary Decision Diagrams (BDDs) are a powerful tool and are frequently used in many applications in VLSI CAD, like synthesis and veriication. Unfortunately, BDDs are very sensitive to the variable ordering and their size often becomes infeasible. Recently, a new approach for BDD minimization based on linear transformations, i.e. a special type of spectral techniques, has been proposed. In this ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003