9 search results - page 1 / 2 » Reducing the number of variable movements in exact BDD minim... |
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
VLSID
2007
IEEE
14 years 5 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
APN
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
TCAD
1998
13 years 4 months ago
1998
Abstract—We examine the implications of a new hazard-free combinational logic synthesis method [1], which generates multiplexor-based networks from binary decision diagrams (BDDs...
ICCAD
1994
IEEE
13 years 9 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...