期刊文献+

A Complete Critical Path Algorithm for Test Generation of Combinational Circuits

A Complete Critical Path Algorithm for Test Generation of Combinational Circuits
原文传递
导出
摘要 It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- oriented technique,the principal critical path algorithm,propagating the critical value back to primary inputs along a single path,the principal critical path,and allowing multiple path sensitization if needed.Relationship among test patterns is also discussed to accelerate test generation. It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- oriented technique,the principal critical path algorithm,propagating the critical value back to primary inputs along a single path,the principal critical path,and allowing multiple path sensitization if needed.Relationship among test patterns is also discussed to accelerate test generation.
作者 周权 魏道政
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 1991年第1期74-82,共9页 计算机科学技术学报(英文版)
  • 相关文献

参考文献5

  • 1Lin Xiangdong,计算机学报,1984年,7卷,1期,90页
  • 2魏道政,计算机学报,1982年,5卷,2期,125页
  • 3魏道政,计算机学报,1978年,1卷,2期,93页
  • 4Wang D T,IEEE Trans Computers,1975年,24卷,7期,742页
  • 5Wang D T,IEEE Trans Computers,1975年,24卷,7期,746页

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部