Test set compaction algorithms for combinational circuits
暂无分享,去创建一个
[1] J.H. Patel,et al. Test set compaction algorithms for combinational circuits , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).
[2] Irith Pomeranz,et al. On compacting test sets by addition and removal of test vectors , 1994, Proceedings of IEEE VLSI Test Symposium.
[3] Irith Pomeranz,et al. ROTCO: a reverse order test compaction technique , 1992, Proceedings Euro ASIC '92.
[4] Yusuke Matsunaga. MINT-An Exact Algorithm for Finding Minimum Test Set (Special Section on VLSI Design and CAD Algorithms) , 1993 .
[5] Irith Pomeranz,et al. Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Michael H. Schulz,et al. SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] Jau-Shien Chang,et al. Test set compaction for combinational circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] P. Goel. Test Generation and Dynamic Compaction of Tests , 1979 .
[9] S. B. Akers,et al. On the Role of Independent Fault Sets in the Generation of Minimal Test Sets , 1987 .
[10] Irith Pomeranz,et al. COMPACTEST: a method to generate compact test sets for combinational circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[11] Janak H. Patel,et al. New Techniques for Deterministic Test Pattern Generation , 1999, J. Electron. Test..
[12] John P. Hayes,et al. High-level test generation using physically-induced faults , 1995, Proceedings 13th IEEE VLSI Test Symposium.
[13] Sheldon B. Akers,et al. On the Complexity of Estimating the Size of a Test Set , 1984, IEEE Transactions on Computers.