On Bi-Decompositions of Logic Functions
نویسندگان
چکیده
A logic function f has a disjoint bi-decomposition i f can be represented as f = h(g1(X1); g2(X2)), where X1 and X2 are disjoint set of variables, and h is an arbitrary two-variable logic fuction. f has a non-disjoint bidecomposition i f can be represented as f(X1;X2; x) = h(g1(X1; x); g2(X2; x)), where x is the common variable. In this paper, we show a fast method to nd bidecompositions. Also, we enumerate the number of functions having bi-decompositions.
منابع مشابه
DECOMPOS: An Integrated System for Functional Decomposition
This paper presents a system for disjoint decompositions of logic functions with many inputs. It is a combination of three di erent methods: 1) Disjoint decompositions with a few bound set variables; 2) Disjoint bi-decompositions; and 3) Decompositions using Jacobian. 1) and 2) are quick, but nd only limited classes of decompositions, while 3) nds all disjoint decompositions by spending more ti...
متن کاملAn E cient Method for Finding an Optimal Bi - Decomposition
This paper presents a new e cient method for nding an \optimal" bi-decomposition form of a logic function. A bi-decomposition form of a logic function is the form: f(X) = (g1(X ); g2(X )). We call a bi-decomposition form optimal when the total number of variables in X and X is the smallest among all bi-decomposition forms of f . This meaning of optimal is adequate especially for the synthesis o...
متن کاملBi-Decompositions of Multi-Valued Functions for Circuit Design and Data Mining Applications
We present eÆcient algorithms for the bi-decomposition of arbitrary incompletely speci ed functions in variable-valued logic. Several special cases are discussed. The algorithms are especially applicable for Data Mining applications, because, in contrast to the general multi-valued approaches to function decomposition that decompose to arbitrary tables, we create a network from multi-valued two...
متن کاملNew Methods to Find Optimal Non-Disjoint Bi-Decompositions
This paper presents new efficient methods to find “optimal bi-decomposition” forms of logic functions. An “optimal bi-decomposition” form of f(X) is f = α(g1(X ), g2(X )) where the total number of variables in X and X is the smallest among all bi-decomposition forms of f . We consider two methods; one’s decomposition form is (g1 · g2) and the other’s is (g1⊕g2). The proposed methods can find on...
متن کاملFinding All Simple Disjoint Decompositions in Frequent Itemset Data
(Abstract) In this paper, we propose a method of finding simple disjoint decompositions in frequent itemset data. The techniques for decomposing Boolean functions have been studied for long time in the area of logic circuit design, and recently , there is a very efficient algorithm to find all possible simple disjoint decompositions for a given Boolean functions based on BDDs (Binary Decision D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997