首页> 外文会议>New security paradigms workshop >A Novel, Low-Cost Algorithm for Sequentially Untestable Fault Identification
【24h】

A Novel, Low-Cost Algorithm for Sequentially Untestable Fault Identification

机译:一种新颖的,低成本的算法,用于顺序不可判定的故障识别

获取原文

摘要

This paper presents a new and low-cost approach for identifying sequentially untestable faults. Unlike the single fault theorem, where the stuck-at fault is injected only in the right-most time frame of the k-frame unrolled circuit, our approach can handle fault injection in any time frame within the unrolled sequential circuit. To efficiently apply our concept to untestable fault identification, powerful sequential implications are used to efficiently extend the unobservability propagation of gates in multiple time frames. Application of the proposed theorem to ISCAS?89 sequential benchmark circuits showed that more untestable faults could be identified using our approach, at practically no overhead in both memory and execution time.
机译:本文介绍了一种新的和低成本方法,用于识别依次不可能的故障。与单个故障定理不同,仅在k帧展开电路的最右转最多的时间框架中注入粘附故障,我们的方法可以在展开的顺序电路内的任何时间帧中处理故障注射。为了有效地将我们的概念应用于不可竞争的故障识别,强大的顺序含义用于在多个时间帧中有效地扩展栅极的不可解助性传播。将建议定理应用于ISCAS?89顺序基准电路表明,可以使用我们的方法来识别更多不可能的故障,在内存和执行时间几乎没有开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号