An ecient package for construction of and operation on ordered K r onecker F unctional D e cision Diagrams (OKFDD) is presented. OKFDDs are a generalization o f OBDDs and OFDDs and as such provide a more c ompact representation of the functions than either of the two decision diagrams. In this paper b asic properties of OKFDDs and their ecient representation and manipulation a r e presented. Based on the comparison of the three d e cision diagrams for several b enchmark functions, a 25% improvement in size over OBDDs is observed for OKFDDs.
| This paper presents a new decomposition problem: decomposition of multi-valued (MV) relations, and a method of its solution. Decomposition is non-disjoint and multi-level. A fundamental di erence in decomposition of MV functions and MV relations is discussed: the column (cofactor) pair compatibility translates to the group compatibility for functions, but not for relations. This makes the decomposition of relations more di cult. The method is especially e cient for strongly unspeci ed data typical for Machine Learning (ML). It is implemented in program GUD-MV. 1 I. Introduction. Functional Decomposition of switching functions has applications in binary and multiple-valued circuit design, Machine Learning (ML), and Knowledge Discovery from Data Bases (KDD). Despite the fundamental nature of the MV decomposition problem and many possible applications of its solutions, e cient MV decomposers do not exist yet, with the exception of 1]. (The Curtis decomposition of binary functions is presented in detail in 4], Curtis-like decomposition of multi-valued functions based on graph coloring was presented in 6]). In this paper we will focus on a new problem of Curtis-like Decomposition of MV Relations. We present also an e cient computer program for this task. The solution of the MV Relation Decomposition Problem nds numerous applications in Machine Learning, binary circuits and Finite State Machine design. An example of a relation with binary inputs and a single MV output is shown in Table 1. Observe, that only the care minterms (care cubes) are present in the relation table as its rows. Standard don't cares ("unknown data samples" in ML) are represented by the remaining, implicit, minterms. The values in the column for output variable f include also the so-called "generalized d o n 't
A compact data representation, in which the typically required operations are performed rapidly, and effective and efficient algorithms that work on these representations are the essential elements of a successful CAD tool. The objective of this paper is to present a new data representation—term trees (TTs)—and to discuss its application for an effective and efficient structural automatic test-pattern generation (ATPG). Term trees are decision diagrams similar to BDDs that are particularly suitable for structure representation of AND–OR and AND–EXOR circuits. In the paper, a flexible algorithm for minimum term-tree construction is discussed and an effective and efficient algorithm for ATPG for AND–EXOR and AND–OR circuits is proposed. The term trees can be used for many other purposes in logic design and in other areas—for all purposes where compact representation and efficient manipulation of term sets is important. The presented experimental results show that term trees are indeed a compact data representation allowing fast manipulations. They form a good base for algorithms considering the function's and circuit's term structures.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.