首页> 外文会议>IEEE/ACM International Conference on Computer Aided Design >Exploring Linear Structures of Critical Path Delay Faults to Reduce Test Efforts
【24h】

Exploring Linear Structures of Critical Path Delay Faults to Reduce Test Efforts

机译:探索关键路径延迟故障的线性结构,减少测试努力

获取原文

摘要

It has been shown that the delay of a target path can be composed linearly of other path delays. If the later paths are robustly testable (with known delay values), the target path can then be validated through simple calculation. Yet, no decomposition process is available to find paths that satisfy the above property. In this paper, given a set of target critical paths, we propose a two-stage method to find a set of robust-testable paths (with smaller number than the original set). The first stage constructs a necessary subset for critical robust paths, and the second stage identifies remaining functional sensitizable segments and their corresponding composing robust paths. The experiments show that a large percentage (several benchmarks close to only a few tens of segments in the circuit (except for one circuit, s35932). DfT technique can then be applied to these uncovered segments for full testability with small overheads.
机译:已经表明,目标路径的延迟可以与其他路径延迟线性地组成。如果稍后的路径是强大的可测试的(具有已知延迟值),则可以通过简单的计算验证目标路径。然而,没有分解过程可用于查找满足上述属性的路径。在本文中,给定一组目标关键路径,我们提出了一种两级方法来查找一组鲁棒可测试的路径(具有比原始组的数量较小)。第一阶段构造一个必要的临界稳健路径子集,第二阶段识别剩余的功能可感性段及其相应的组合稳健路径。实验表明,大百分比(电路中只接近几十个段的几个基准(S35932)。然后可以将DFT技术应用于这些未覆盖的区段,以便具有小开销的完全可测试性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号