Sciweavers

231 search results - page 1 / 47
» Improvements to combinational equivalence checking
Sort
View
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
14 years 1 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
13 years 9 months ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
13 years 9 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann
TVLSI
2008
107views more  TVLSI 2008»
13 years 4 months ago
Novel Probabilistic Combinational Equivalence Checking
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...
Shih-Chieh Wu, Chun-Yao Wang, Yung-Chih Chen
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...