Fault Collapsing Using a Novel Extensibility Relation

作者: M Chandrasekar , M S Hsiao

DOI: 10.1109/VLSID.2011.56

关键词:

摘要: Fault Collapsing of a target fault-list can help in obtaining compact test set, decreasing test-generation/fault simulation time, and indirectly reducing data volume application time during Manufacturing Test. These factors have direct impact on economics, thus fault list is essential. In this paper, we propose novel extensibility relation that aids identifying non-trivial dominance relationships among fault-pairs. We show our technique supersedes existing dominance-based collapsing techniques may identify more relations faults. To end, learn several necessary assignments for faults low-cost independent manner, which memory requirements are also low. Further, from theoretical point interest, theorize lower bound the size collapsed fault-list. Experimental results ISCAS85 full-scan versions ISCAS89 circuits indicate that, an average, eliminate 5% reported by best known engine. consumed only 2% -4% used engine, provided 2:3x average speed-up!

参考文章(23)
Zainalabedin Navabi, Mohammad R. Movahedin, Mehran Nadjarbashi, Line Oriented Structural Equivalence Fault Collapsing ,(2000)
A. Lloy, Advanced fault collapsing (logic circuits testing) IEEE Design & Test of Computers. ,vol. 9, pp. 64- 71 ,(1992) , 10.1109/54.124518
Balakrishnan Krishnamurthy, Sheldon B. Akers, On the Complexity of Estimating the Size of a Test Set IEEE Transactions on Computers. ,vol. 33, pp. 750- 753 ,(1984) , 10.1109/TC.1984.5009364
Maheshwar Chandrasekar, Nikhil P. Rahagude, Michael S. Hsiao, Search State Compatibility Based Incremental Learning Framework and Output Deviation Based X-filling for Diagnostic Test Generation Journal of Electronic Testing. ,vol. 26, pp. 165- 176 ,(2010) , 10.1007/S10836-010-5142-2
Stanford University Stanford Electronics Laboratories. Digital Systems Laboratory, Fault Equivalence in Combinational Logic Networks IEEE Transactions on Computers. ,vol. C-20, pp. 1286- 1293 ,(1971) , 10.1109/T-C.1971.223129
J.P. Marques-Silva, K.A. Sakallah, GRASP: a search algorithm for propositional satisfiability IEEE Transactions on Computers. ,vol. 48, pp. 506- 521 ,(1999) , 10.1109/12.769433
T. Gruning, U. Mahlstedt, H. Koopmeiners, DIATEST: a fast diagnostic test pattern generator for combinational circuits international conference on computer aided design. pp. 194- 197 ,(1991) , 10.1109/ICCAD.1991.185229
A.V.S.S. Prasad, V.D. Agrawal, M.V. Atre, A new algorithm for global fault collapsing into equivalence and dominance sets international test conference. pp. 391- 397 ,(2002) , 10.1109/TEST.2002.1041783