Name
Abstract | ||
|---|---|---|
We present two algorithms, called list-based scheme and tree-based scheme, to compute bridging fault (BF) coverage of IDDQ tests. These algorithms use the novel ideal of “indistinguishable pairs,” which makes it more efficient and versatile than known fault simulation algorithms. Unlike known algorithms, the two algorithms can be used for combinational as well as sequential circuits and for arbitrary sets of BFs. Experiments show that the tree-based scheme is, in general, better than the list-based scheme. But the list-based scheme is better for some classes of faults. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1145/264995.264999 | ACM Trans. Design Autom. Electr. Syst. |
Keywords | DocType | Volume |
novel ideal,IDDQ test set,sequential circuit,known fault simulation algorithm,known algorithm,tree-based scheme,list-based scheme,IDDQ test,fault coverage,indistinguishable pair,arbitrary set | Journal | 2 |
Issue | Citations | PageRank |
3 | 2 | 0.39 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Thadikaran | 1 | 9 | 2.58 |
| Sreejit Chakravarty | 2 | 518 | 57.46 |
| Janak Patel | 3 | 2 | 0.39 |