Sciweavers

29 search results - page 2 / 6
» Boolean Function Manipulation on a Parallel System Using BDD...
Sort
View
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 2 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
ICCAD
1996
IEEE
123views Hardware» more  ICCAD 1996»
13 years 9 months ago
Efficient solution of systems of Boolean equations
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
Scott Woods, Giorgio Casinovi
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
13 years 9 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
14 years 2 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song