期刊文献+

压缩测试向量的准确求法

Exact Solution to the Maximal Compact Test Pattern
下载PDF
导出
摘要 本文讨论了在源输入的确定赋值数最小时组合电路的测试生成方法后,介绍了基于可满足性的测试向量压缩的整数线性规划(ILP)模型。利用ISCAS85基准电路仿真的结果说明了用此模型求解压缩测试向量非常有效。 The problem of test pattern generation for single stuck-at fault in combinational circuits is discussed. Under the additional constraint conditions, the number of specified primary input assignments is minimized. The proposed approach is based on the integer linear programming (ILP) formulation which is built on an existing Propositional Satisflability (SAT) model for the test pattern generation.The experiment results on benchmark circuits show the applicability of proposed test pattern minimization model.
出处 《电路与系统学报》 CSCD 2000年第2期67-70,共4页 Journal of Circuits and Systems
关键词 数字电路 整数线性规划 测试向量 组合电路 Digital circuits,Integer linear programming,Automatic test pattern generation
  • 相关文献

参考文献4

  • 1Larrabee T. Test Pattern Generation Using Boolean Satisfiability. IEEE Tran. CAD. 1992, 11 (1):4-15
  • 2Irith Pomeranz, Lakshmi N Reddy and Sudhakar M Reddy. COMPACTEST: A Method to Generation Compact Test Sets for Combinational Circuits. IEEE Tran. CAD. 1993, 12 (7):1040-1048
  • 3Silva P M and Sakallah K A. Robust Algorithms for Test Pattern Generation. Proc. FTC, 1997, :152-161.
  • 4Flores P, Neto H and J Marques Silva. An Exact Solution to the minimum-Size Test Pattern Problem. In: IEEE/ACM IWLS, 1998.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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