论文部分内容阅读
本算法根据故障的可检测性导出了电路引线的“G-F”二值描述和“G-F”二值基本运算公式,根据这一公式分别求故障块和敏化块的测试码和敏化条件。为了快速回推(解方程),用故障路标、值区、隐含以及布尔代数运算等措施,效果显著。 由于在时序电路中引入时间参数t和脉冲变量cp,统一了组合电路和时序电路的处理。 本算法已在50万次/秒的计算机上编制了程序,处理了超过4000个门的大型时序电路。故障覆盖率平均达98％,90％的故障定位到一块组件,本文最后给出了几种插件的实测结果。
According to the detectability of the fault, this algorithm derives the binary description of “G-F” and the basic calculation formula of “G-F”. According to this formula, the test code and sensitization condition of fault block and sensitized block are obtained respectively. In order to push back quickly (solve the equation), the method of fault signpost, value area, implicit and Boolean algebra operation is very effective. Due to the introduction of timing parameters in the timing circuit and the pulse variable pulse tint cp, unified circuit and timing circuit processing. The algorithm has been in the 500,000 times / second computer programmed to handle more than 4,000 gates of large timing circuits. Fault coverage averaged 98%, 90% of the fault location to a component, at the end of this article gives several plug-in test results.