Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits
暂无分享,去创建一个
[1] Sreejit Chakravarty. On the complexity of computing tests for CMOS gates , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] R. L. Wadsack,et al. Fault modeling and logic simulation of CMOS and MOS integrated circuits , 1978, The Bell System Technical Journal.
[3] Jonathan S. Turner,et al. Approximation Algorithms for the Shortest Common Superstring Problem , 1989, Inf. Comput..
[4] Sudhakar M. Reddy,et al. Testable Realizations for FET Stuck-Open Faults in CMOS Combinational Logic Circuits , 1986, IEEE Transactions on Computers.
[5] David Maier,et al. On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..
[6] Sudhakar M. Reddy,et al. A Gate Level Model for CMOS Combinational Logic Circuits with Application to Fault Detection , 1984, 21st Design Automation Conference Proceedings.
[7] Zvonko G. Vranesic,et al. On Fault Detection in CMOS Logic Networks , 1983, 20th Design Automation Conference Proceedings.
[8] Yves Crouzet,et al. Physical Versus Logical Fault Models MOS LSI Circuits: Impact on Their Testability , 1980, IEEE Transactions on Computers.
[9] Charles R. Kime,et al. Pseudo-Exhaustive Adjacency Testing: A BIST Approach for Stuck-Open Faults , 1985, International Test Conference.
[10] Harry B. Hunt,et al. The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits , 1989, IEEE Trans. Computers.
[11] Vishwani D. Agrawal,et al. Modeling and Test Generation Algorithms for MOS Circuits , 1985, IEEE Transactions on Computers.