DocumentCode
3435730
Title
Test data compression and test time reduction of longest-path-per-gate tests based on Illinois scan architecture
Author
Sharma, Manish ; Patel, Janak H. ; Rearick, Jeff
Author_Institution
Illinois Univ., Urbana, IL, USA
fYear
2003
fDate
27 April-1 May 2003
Firstpage
15
Lastpage
21
Abstract
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.
Keywords
automatic test pattern generation; data compression; delays; integrated circuit testing; integrated logic circuits; logic testing; sequential circuits; ATPG; Illinois scan architecture; delay test set; localized delay defects; longest-path-per-gate tests; resistive opens; resistive shorts; sequential circuits; test application time reduction; test data compression; test data volume reduction; Automatic test pattern generation; Circuit testing; Delay effects; Gas detectors; Logic testing; Robustness; Sequential analysis; Sequential circuits; Test data compression; Wire;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Test Symposium, 2003. Proceedings. 21st
ISSN
1093-0167
Print_ISBN
0-7695-1924-5
Type
conf
DOI
10.1109/VTEST.2003.1197628
Filename
1197628
Link To Document