Test set compaction algorithms for combinational circuits

被引:95
作者
Hamzaoglu, I [1 ]
Patel, JH [1 ]
机构
[1] Univ Illinois, Ctr Reliable & High Performance Comp, Urbana, IL 61801 USA
关键词
combinational circuits; minimum test set size estimation; stuck-at fault model; test generation; test set compaction;
D O I
10.1109/43.856980
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a new algorithm, essential fault reduction, for generating compact test sets fur combinational circuits under the single stuck-at fault model, and a new heuristic for estimating the minimum single stuck-at fault test set size. These algorithms together with the dynamic compaction algorithm are incorporated into an advanced automatic test pattern generation system for combinational circuits, called MinTest. MinTest found better lower bounds and generated smaller test sets than the previously published results fur the ISCAS85 and full scan versions of the ISCAS89 benchmark circuits.
引用
收藏
页码:957 / 963
页数:7
相关论文
共 19 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]  
[Anonymous], 1989, SYSTEMS ISCAS
[3]  
[Anonymous], P INT TEST C
[4]  
BRGLEZ F, 1985, P INT S CIRC SYST JU
[5]   TEST SET COMPACTION FOR COMBINATIONAL-CIRCUITS [J].
CHANG, JS ;
LIN, CS .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1995, 14 (11) :1370-1378
[6]  
Goel P., 1979, 1979 Test Conference. LSI & Boards, P189
[7]   New techniques for deterministic test pattern generation [J].
Hamzaoglu, I ;
Patel, JH .
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 1999, 15 (1-2) :63-73
[8]   New techniques for deterministic test pattern generation [J].
Hamzaoglu, I ;
Patel, JH .
16TH IEEE VLSI TEST SYMPOSIUM, PROCEEDINGS, 1998, :446-452
[9]  
HAMZAOGLU I, 1998, P INT C COMP AID DES
[10]  
Hansen M. C., 1995, Proceedings 13th IEEE VLSI Test Symposium (Cat. No.95TH8068), P20, DOI 10.1109/VTEST.1995.512612