A New Class of Sequential Circuits with Acyclic Test Generation Complexity
暂无分享,去创建一个
[1] Chia Yee Ooi,et al. Classification of Sequential Circuits Based on tauk Notation and Its Applications , 2005, IEICE Trans. Inf. Syst..
[2] Melvin A. Breuer,et al. The BALLAST Methodology for Structured Partial Scan Design , 1990, IEEE Trans. Computers.
[3] 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).
[4] Chia Yee Ooi,et al. Classification of Sequential Circuits Based on τ^k Notation and Its Applications(VLSI Systems) , 2005 .
[5] Malgorzata Marek-Sadowska,et al. Cost-free scan: a low-overhead scan path design methodology , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Kurt Keutzer,et al. Why is ATPG easy? , 1999, DAC '99.
[7] Hideo Fujiwara. A New Class of Sequential Circuits with Combinational Test Generation Complexity , 2000, IEEE Trans. Computers.
[8] Hideo Fujiwara,et al. A DFT Method for RTL Data Paths Based on Partially Strong Testability to Guarantee Complete Fault Efficiency , 2005, 14th Asian Test Symposium (ATS'05).
[9] Chia Yee Ooi,et al. Classification of sequential circuits based on /spl tau//sup k/ notation , 2004, 13th Asian Test Symposium.
[10] Prabhakar Goel. Test generation costs analysis and projections , 1980, DAC '80.
[11] Susanta Chakraborty,et al. Max-testable class of sequential circuits having combinational test generation complexity , 2004, 13th Asian Test Symposium.