Sciweavers

5 search results - page 1 / 1
» Variable Reordering and Sifting for QMDD
Sort
View
ISMVL
2007
IEEE
76views Hardware» more  ISMVL 2007»
13 years 11 months ago
Variable Reordering and Sifting for QMDD
This paper considers variable reordering for quantum multiple-valued decision diagrams (QMDD) used to represent the matrices describing reversible and quantum gates and circuits. ...
D. Michael Miller, David Y. Feinstein, Mitchell A....
ICCD
1997
IEEE
78views Hardware» more  ICCD 1997»
13 years 9 months ago
Speeding up Variable Reordering of OBDDs
In this paper, we suggest a block-restricted sifting strategy which is based on the restriction of Rudell's sifting to certain blocks of variables. The application of this st...
Christoph Meinel, Anna Slobodová
ICCAD
1999
IEEE
74views Hardware» more  ICCAD 1999»
13 years 9 months ago
Lazy group sifting for efficient symbolic state traversal of FSMs
This paper proposes lazy group sifting for dynamic variable reordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables...
Hiroyuki Higuchi, Fabio Somenzi
DAC
2000
ACM
14 years 5 months ago
Efficient variable ordering using aBDD based sampling
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static orde...
Yuan Lu, Jawahar Jain, Edmund M. Clarke, Masahiro ...
DAC
1999
ACM
13 years 9 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther