Skip to main content
Log in

On Selecting Testable Paths in Scan Designs

  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

Abstract

We propose an efficient method to select a minimal set of testable paths in scan designs, such that every line in the circuit is covered by at least one of the longest testable paths that contain it (if there are any). The proposed path selection approach is based on a stepwise path expansion procedure that uses delay information and compact information about untestable paths to select longest paths while avoiding untestable paths. Techniques called delay analysis and delay-constrained path expansion are used to speedup the selection of paths to test. Compared to earlier approaches, the proposed approach is fast and it is guaranteed to find testable paths. Additionally the procedure also derives tests for the selected paths. Experimental results for ISCAS89 benchmark circuits using standard scan and broadside testing are presented to demonstrate the effectiveness of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K.T. Cheng and H.-C. Chen, “Classification and Identification of Nonrobust Untestable Path Delay Faults,” in IEEE TCAD, pp. 845-853, Aug. 1996.

  2. K.-T. Cheng, S. Devadas, and K. Keutzer, “Delay-Fault Test Generation and Synthesis for Testability Under a Standard Scan Design Methodology,” in IEEE TCAD, pp. 1217-1231, Aug. 1993.

  3. P. Goel, “An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits,” in IEEE Trans. on Computers, pp. 215-222, March 1981.

  4. K. Heragu, J.H. Patel, and V.D. Agrawal, “Segment Delay Faults: A New Fault Model,” in Proc. VTS, April 1996, pp. 32-39.

  5. S. Kajihara, K. Kinoshita, I. Pomeranz, and S.M. Reddy, “A Method for Identifying Robust Dependent and Functionally Unsensitizable Paths,” in Proc. 10th Int’l Conf. on VLSI Design, Jan. 1997, pp. 82-87.

  6. W.-N. Li, S.M. Reddy, and S.K. Sahni, “On Path Selection in Combinational Logic Circuits,” in IEEE TCAD, pp. 56-63, Jan. 1989.

  7. C.J. Lin and S.M. Reddy, “On Delay Fault Testing in Logic Circuits,” in IEEE TCAD, pp. 694-703, Sept. 1987.

  8. A.K. Majhi, J. Jacob, L.M. Patnaik, and V.D. Agrawal, “On Test Coverage of Path Delay Faults,” in Proc. 9th Int’l Conf. on VLSI Design, Jan. 1996, pp. 418-421.

  9. A. Murakami, S. Kajihara, T. Sasao, I. Pomeranz, and S.M. Reddy, “Selection of Potentially Testable Path Delay Faults for Test Generation,” in Proc. ITC, Oct. 2000, pp. 376-384.

  10. E.S. Park and M.R. Mercer, “An Efficient Delay Test Generation System for Combinational Logic Circuits,” in IEEE TCAD, pp. 926-938, July 1992.

  11. I. Pomeranz and S.M. Reddy, “An Efficient Non-Enumerative Method to Estimate Path Delay Fault Coverage,” in Proc. ICCAD, Nov. 1992, pp. 560-566.

  12. J. Rearick, “Too Much Delay-Fault Coverage is a Bad Thing,” in Proc. ITC, Oct. 2001, pp. 624-633.

  13. Y. Shao, S.M. Reddy, S. Kajihara, and I. Pomeranz, “An Efficient Method to Identify Untestable Path Delay Faults,” in Proc. ATS, Nov. 2001, pp. 233-238.

  14. M. Sharma and J.H. Patel, “Testing of Critical Paths for Delay Faults,” in Proc. ITC, Oct. 2001, pp. 634-641.

  15. G.L. Smith, “Model for Delay Faults Based Upon Paths,” in Proc. ITC, Sept. 1985, pp. 342-349.

  16. B. Underwood, W.O. Law, S. Kang, and H. Konuk, “Fastpath: A Path-Delay Test Generator for Standard Scan Designs,” in Proc. ITC, Oct. 1994, pp. 154-163.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shao, Y., Reddy, S.M., Pomeranz, I. et al. On Selecting Testable Paths in Scan Designs. Journal of Electronic Testing 19, 447–456 (2003). https://doi.org/10.1023/A:1024648227669

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024648227669

Navigation