Sciweavers

6 search results - page 1 / 2
» Efficient Boolean characteristic function for fast timed ATP...
Sort
View
ICCAD
2006
IEEE
140views Hardware» more  ICCAD 2006»
14 years 1 months ago
Efficient Boolean characteristic function for fast timed ATPG
Yu-Min Kuo, Yue-Lung Chang, Shih-Chieh Chang
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 9 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
13 years 11 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak
ITC
2003
IEEE
148views Hardware» more  ITC 2003»
13 years 10 months ago
HyAC: A Hybrid Structural SAT Based ATPG for Crosstalk
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
Xiaoliang Bai, Sujit Dey, Angela Krstic
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
13 years 11 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...