32 search results - page 7 / 7 » hf 2008 |
114
Voted
TCAD
1998
15 years 3 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
138
Voted
DAC
2008
ACM
16 years 4 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...