Abstract | ||
---|---|---|
Existing techniques for path delay fault (PDF) diagnosis do not provide high diagnostic resolution. These techniques fail to prune a large number of fault free candidates from the set of possible candidate faults. This paper presents an efficienttechnique to prioritize faults (PDFs) among the set of possible candidate faults. A novel approach for PDF prioritization is presented and its effectiveness is demonstrated on the ISCAS benchmarks. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/DFT.2008.46 | DFT |
Keywords | Field | DocType |
high diagnostic resolution,novel approach,large number,path delay fault,iscas benchmarks,pdf prioritization,fault free candidate,possible candidate fault,network analysis,failure analysis,probability density function,vlsi,data structures | Data structure,Computer science,Fault free,Prioritization,Path delay,Real-time computing,Electronic engineering,Network analysis,Very-large-scale integration,Probability density function,Reliability engineering | Conference |
ISSN | Citations | PageRank |
1550-5774 | 2 | 0.39 |
References | Authors | |
18 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rajsekhar Adapa | 1 | 35 | 3.92 |
Spyros Tragoudas | 2 | 625 | 88.87 |