Abstract

The authors present an algorithm for detecting untestable paths in multi-level circuits. By constructing equivalent normal form (ENF) for reconvergent paths only, the proposed algorithm detects and removes untestable paths efficiently in terms of run-time and memory usage.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call