5 search results - page 1 / 1 » A Method for Finding Good Ashenhurst Decompositions and Its ... |
DAC
1995
ACM
13 years 8 months ago
1995
ACM
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
FPGA
1997
ACM
13 years 8 months ago
1997
ACM
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
ASYNC
2004
IEEE
13 years 8 months ago
2004
IEEE
This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesi...
DAC
2008
ACM
14 years 5 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...