Efficient algorithm for untestable pathdetection

Heo, Hwang · Electronics Letters · 1996

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.

Read the paper · More papers on PaperTik