Sciweavers

16 search results - page 3 / 4
» Deterministic BIST with Partial Scan
Sort
View
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
14 years 22 days ago
Bist Reseeding with very few Seeds
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
ETS
2009
IEEE
79views Hardware» more  ETS 2009»
13 years 5 months ago
Concurrent Self-Test with Partially Specified Patterns for Low Test Latency and Overhead
Structural on-line self-test may be performed to detect permanent faults and avoid their accumulation. This paper improves concurrent BIST techniques based on a deterministic test ...
Michael A. Kochte, Christian G. Zoellin, Hans-Joac...
ICCAD
1996
IEEE
121views Hardware» more  ICCAD 1996»
13 years 11 months ago
Identification of unsettable flip-flops for partial scan and faster ATPG
State justification is a time-consuming operation in test generation for sequential circuits. In this paper, we present a technique to rapidly identify state elements (flip-flops)...
Ismed Hartanto, Vamsi Boppana, W. Kent Fuchs
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 23 days ago
Fast Computation of Data Correlation Using BDDs
Data correlation is a well-known problem that causes difficulty in VLSI testing. Based on a correlation metric, an efficient heuristic to select BIST registers has been proposed...
Zhihong Zeng, Qiushuang Zhang, Ian G. Harris, Maci...
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...