Sciweavers

624 search results - page 42 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
DATE
2000
IEEE
136views Hardware» more  DATE 2000»
15 years 8 months ago
On Applying Incremental Satisfiability to Delay Fault Testing
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah...
ICCAD
2009
IEEE
133views Hardware» more  ICCAD 2009»
15 years 1 months ago
A parallel preconditioning strategy for efficient transistor-level circuit simulation
A parallel computing approach for large-scale SPICE-accurate circuit simulation is described that is based on a new preconditioned iterative solver. The preconditioner involves the...
Heidi Thornquist, Eric R. Keiter, Robert J. Hoekst...
KES
2008
Springer
15 years 4 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada
FMCAD
2000
Springer
15 years 7 months ago
SAT-Based Image Computation with Application in Reachability Analysis
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Anubhav G...
VLSID
1996
IEEE
110views VLSI» more  VLSID 1996»
15 years 8 months ago
On test coverage of path delay faults
W epropose a coverage metric and a two-pass test generation method for path delay faults in combinational logic circuits. The coverage is measured for each line with a rising and ...
Ananta K. Majhi, James Jacob, Lalit M. Patnaik, Vi...