Sciweavers

79 search results - page 1 / 16
» Efficient breadth-first manipulation of binary decision diag...
Sort
View
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
13 years 9 months ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong
ISMVL
1998
IEEE
109views Hardware» more  ISMVL 1998»
13 years 9 months ago
Implementing a Multiple-Valued Decision Diagram Package
Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider issues regarding the efficient implementation of a...
D. Miller, Rolf Drechsler
ICCD
2006
IEEE
125views Hardware» more  ICCD 2006»
14 years 1 months ago
Partial Functional Manipulation Based Wirelength Minimization
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
Avijit Dutta, David Z. Pan
DAC
1998
ACM
14 years 5 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 8 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge