A minimal universal test set for self-test of EXOR-Sum-of-Products circuits

被引:25
作者
Kalay, U [1 ]
Hall, DV [1 ]
Perkowski, MA [1 ]
机构
[1] Portland State Univ, Dept Elect & Comp Engn, Portland, OR 97207 USA
关键词
universal test set; AND-EXOR realizations; Reed-Muller expressions; single stuck-at fault model; easily testable combinational networks; design for testing (DFT); self-testable circuits; Built-In-Self-Test (BIST); test pattern generation;
D O I
10.1109/12.841130
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A testable EXOR-Sum-of-Products (ESOP) circuit realization and a simple, universal test set which detects all single stuck-at faults in the internal lines and the primary inputs/outputs of the realization are given. Since ESOP is the most general form of AND-EXOR representations, our realization and test set are more versatile than those described by other researchers for the restricted GRM, FPRM, and PPRM forms of AND-EXOR circuits. Our circuit realization requires only two extra inputs for controllability and one extra output for observability. The cardinality of our test set for an n input circuit is (n + 6). For Built-in Self-Test (BIST) applications, we show that our test set can be generated internally as easily as a pseudorandom pattern and that it provides 100 percent single stuck-at fault coverage. In addition, our test set requires a much shorter test cycle than a comparable pseudoexhaustive or pseudorandom test set.
引用
收藏
页码:267 / 276
页数:10
相关论文
共 27 条
[1]  
Abramovici M, 1990, DIGITAL SYSTEMS TEST
[2]  
Bardell PaulH., 1987, BUILT IN TEST VLSI P
[3]  
BHATTACHARYA BB, 1985, IEE PROC-E, V132, P155, DOI 10.1049/ip-e.1985.0022
[4]  
CORTNER JM, 1987, DIGITAL TEST ENG
[5]  
DAEHN W, 1981, IEEE T COMPUT, V30, P829, DOI 10.1109/TC.1981.1675713
[6]   FAULT-DETECTION IN COMBINATIONAL-NETWORKS BY REED-MULLER TRANSFORMS [J].
DAMARLA, TR ;
KARPOVSKY, M .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (06) :788-797
[7]  
DRECHSLER R, 1997, P EUR DES TEST C MAR
[8]   ALGORITHM FOR THE GENERATION OF DISJOINT CUBES FOR COMPLETELY AND INCOMPLETELY SPECIFIED BOOLEAN FUNCTIONS [J].
FALKOWSKI, BJ ;
PERKOWSKI, MA .
INTERNATIONAL JOURNAL OF ELECTRONICS, 1991, 70 (03) :533-538
[9]  
FUJIWARA H, 1981, IEEE T COMPUT, V30, P556, DOI 10.1109/TC.1981.1675840
[10]  
Fujiwara H., 1985, LOGIC TESTING DESIGN