2 search results - page 1 / 1 » Bi-decomposing large Boolean functions via interpolation and... |
117
Voted
DAC
2008
ACM
16 years 2 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...
132
click to vote
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...