A Fading Algorithm For Sequential Fault Diagnosis

Authors:
Shi-Yu Huang
Affiliations:
National Tsing-Hua University, Taiwan
Venue:
DFT '04 Proceedings of the Defect and Fault Tolerance in VLSI Systems, 19th IEEE International Symposium
Year:
2004

Citing 0
Cited 4

Using unsatisfiable cores to debug multiple design errors

Proceedings of the 18th ACM Great Lakes symposium on VLSI
Spatial and temporal design debug using partial MaxSAT

Proceedings of the 19th ACM Great Lakes symposium on VLSI
Automated design debugging with abstraction and refinement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Automated design debugging with maximum satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fault diagnosis algorithms for logic designs with only partial scan support remains inadequate so far because of the difficulties in dealing with the sequential fault effect. In this paper, we enhance our previous symbolic techniques to address such a challenge. Along with the baseline enhancement, we also propose a fading scheme that can effectively reduce the potentially huge memory requirement and long running time without sacrificing much accuracy. This fading algorithm incorporates a commonly used concept called local fault effect using symbolic techniques. Experimental results show that sequential fault diagnosis can actually be done effectively and accurately with reasonable CPU time.