The Community for Technology Leaders
Proceedings. 21st VLSI Test Symposium, 2003. (2003)
Napa Valley, California
Apr. 27, 2003 to May 1, 2003
ISSN: 1093-0167
ISBN: 0-7695-1924-5
pp: 15
Manish Sharma , University of Illinois at Urbana Champaign
Janak H. Patel , University of Illinois at Urbana Champaign
Jeff Rearick , Agilent Technologies
Localized delay defects, like resistive shorts, resistive opens, etc., can be effectively detected by testing the longest testable path through each wire (or gate) in the circuit. Such a delay test set is referred to as a longest-path-per-wire test set. In this paper we study test data volume and test application time reduction techniques for such tests based on the Illinois Scan architecture. We present a novel ATPG flow to quickly determine longest-path-per-wire test sets under constraints imposed by the Illinois scan architecture. Results of experiments on ISCAS sequential circuits are presented. On an average we achieve a test data volume reduction of 2.79X and number of test cycles reduction of 3.28X for robust path delay tests (as compared to the case without Illinois scan). The corresponding numbers for non-robust tests are 3.58X and 4.24X.

J. H. Patel, M. Sharma and J. Rearick, "Test Data Compression and Test Time Reduction of Longest-Path-Per-Gate Tests based on Illinois Scan Architecture," Proceedings. 21st VLSI Test Symposium, 2003.(VTS), Napa Valley, California, 2003, pp. 15.
86 ms
(Ver 3.3 (11022016))