Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
نویسندگان
چکیده
Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalization of ordered binary decision diagrams (OBDD’s) and ordered functional decision diagrams and thus combine the advantages of both. In this paper, basic properties of OKFDD’s and their efficient representation and manipulation are given. Starting with elementary manipulation algorithms, we present methods for the construction of small OKFDD’s. Our approach is based on dynamic variable ordering and decomposition-type choice. For changing the decomposition type, we use an efficient reordering-based method. We briefly discuss the implementation of PUMA, an OKFDD package, which was used in all our experiments. These experiments demonstrate the quality of our methods in comparison to sifting and interleaving for OBDD’s.
منابع مشابه
Function-driven Linearly Independent Expansions of Boolean Functions
The paper presents a family of new expansions of Boolean functions called Function-driven Linearly Independent (fLI) expansions. On the basis of this expansion a new kind of a canonical representation of Boolean functions is constructed: Function-driven Linearly Independent Binary Decision Diagrams (fLIBDDs). They generalize both Function-driven Shannon Binary Decision Diagrams (fShBDDs) and Li...
متن کاملAn Artificial Immune Algorithm to Minimize Ordered Kronecker Functional Decision Diagrams using in FPGAs
In this study, we introduce the use of one Artificial Immune System (AIS) algorithm called Clonal Selection Algorithm (CSA) in order to minimize the size of an Ordered Kronecker Functional Decision Diagram (OKFDD) which represents a Boolean function as a graph. The size of such a graph is a critical factor by reason of OKFDDs are used to derive circuits by substituting the each nodes with AND/X...
متن کاملLearning heuristics for OKFDD minimization by evolutionary algorithms
| Ordered Kronecker Functional Decision Diagrams (OKFDDs) are a data structure for e cient representation and manipulation of Boolean functions. OKFDDs are very sensitive to the chosen variable ordering and the decomposition type list, i.e. the size may vary from linear to exponential. In this paper we present an Evolutionary Algorithm (EA) that learns good heuristics for OKFDD minimization sta...
متن کاملInternational Colloquium on Automata , Languages and Programming ( ICALP )
Ordered Decision Diagrams (ODDs) as a means for the representation of Boolean functions are used in many applications in CAD. Depending on the decomposition type, various classes of ODDs have been deened, the most important being the Ordered Binary Decision Diagrams (OBDDs), the Ordered Functional Decision Diagrams (OFDDs) and the Ordered Kronecker Functional Decision Diagrams (OKFDDs). In this...
متن کاملB . Becker , R . E . Bryant , O . Coudert , Ch . Meinel ( Hrsg
s of the Talks 7 Probabilistic Analysis of Large Finite State Machines F. Somenzi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Improving OBDD-Based Verification in a Synthesis Environment W. Kunz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Computing the Maximum Power Cycle of Sequential Circuits A. Pardo . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 17 شماره
صفحات -
تاریخ انتشار 1998