Classification of Sequential Circuits Based on τ^k Notation and Its Applications(VLSI Systems)
暂无分享,去创建一个
[1] Hideo Fujiwara. A New Class of Sequential Circuits with Combinational Test Generation Complexity , 2000, IEEE Trans. Computers.
[2] Janusz Rajski,et al. A complexity analysis of sequential ATPG , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Melvin A. Breuer,et al. The BALLAST Methodology for Structured Partial Scan Design , 1990, IEEE Trans. Computers.
[4] Srimat T. Chakradhar,et al. Sequential circuits with combinational test generation complexity , 1996, Proceedings of 9th International Conference on VLSI Design.
[5] Melvin A. Breuer,et al. Partial scan design of register-transfer level circuits , 1995, J. Electron. Test..
[6] Kozo Kinoshita,et al. Easily Testable Sequential Machines with Extra Inputs , 1975, IEEE Transactions on Computers.
[7] Chia Yee Ooi,et al. Some tau-equivalent classes of sequential circuits , 2004 .
[8] Hideo Fujiwara,et al. An extended class of sequential circuits with combinational test generation complexity , 2002, Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[9] Hideo Fujiwara,et al. An optimal time expansion model based on combinational ATPG for RT level circuits , 1998, Proceedings Seventh Asian Test Symposium (ATS'98) (Cat. No.98TB100259).
[10] Melvin A. Breuer,et al. Testability properties of acyclic structures and applications to partial scan design , 1992, Digest of Papers. 1992 IEEE VLSI Test Symposium.
[11] Chia Yee Ooi,et al. Classification of Sequential Circuits Based on Combinational Test Generation Complexity , 2004 .