Untestable fault identification using recurrence relations and impossible value assignments

@article{Syal2004UntestableFI,
  title={Untestable fault identification using recurrence relations and impossible value assignments},
  author={Manan Syal and Michael S. Hsiao},
  journal={17th International Conference on VLSI Design. Proceedings.},
  year={2004},
  pages={481-486}
}
This paper presents two novel and low cost techniques that can be used for the purpose of untestable fault identification. First, we present a new theorem and a practical method using static implications to identify unexcitable nets using recurrence relations in sequential circuits. Since each unexcitable net generally infers to more than one untestable fault, this theorem helps us to quickly identify significantly more sequentially untestable faults. In addition to discovering unexcitable nets… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…