loading...
K Longest Paths Per Gate (KLPG) Test Generation for Scan-Based Sequential Circuits
Charlotte, NC, USA October 26-October 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITC.2004.113International Test Conference 2004 (I ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wangqi Qiu, Texas A&M University, College Station, TX
Jing Wang, Texas A&M University, College Station, TX
D. M. H. Walker, Texas A&M University, College Station, TX
Divya Reddy, Texas Instruments, Inc.
Zhuo Li, Dept. of Electrical Engineering, Texas A&M University, College Station, TX
Weiping Shi, Dept. of Electrical Engineering, Texas A&M University, College Station, TX
Hari Balachandran, Texas Instruments, Inc.
To detect the smallest delay faults at a fault site, the longest path(s) through it must be tested at full speed. Existing test generation tools are inefficient in automatically identifying the longest testable paths due to the high computational complexity. In this work a test generation methodology for scan-based synchronous sequential circuits is presented, under two at-speed test strategies used in industry. The two strategies are compared and the test generation efficiency is evaluated on ISCAS89 benchmark circuits and industrial designs. Experiments show that testing transition faults through the longest paths can be done in reasonable test set size.
Citation:
Wangqi Qiu, Jing Wang, D. M. H. Walker, Divya Reddy, Zhuo Li, Weiping Shi, Hari Balachandran, "K Longest Paths Per Gate (KLPG) Test Generation for Scan-Based Sequential Circuits," itc, pp.223-231, International Test Conference 2004 (ITC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.