首页> 外文会议>IEEE International Symposium on On-Line Testing and Robust System Design >Application Specific True Critical Paths Identification in Sequential Circuits
【24h】

Application Specific True Critical Paths Identification in Sequential Circuits

机译:在顺序电路中的应用特定的真正关键路径识别

获取原文
获取外文期刊封面目录资料

摘要

The extreme complexity of digital systems enabled by nanometer-scale implementation technologies comes along with strengthened design requirements that are difficult to achieve with the conventional techniques. Over-designing beyond the minimal required guarantees may have negative impacts on the overall system’s cost. In this paper we focus on the task of timing-critical logic paths identification in digital systems that has many applications in design and test field, like verifying the timing constraints of designs, estimating critical delays, Simulating path delay faults and reliability analysis such as ageing. The contribution is a new scalable simulation-based hierarchical search method for application-specific online-viable true critical paths identification in sequential circuits. The approach is motivated by the concept of mixed-critical systems, but it can be applied for any type of digital system. We propose to represent the circuits hierarchically at the level of higher level submodules using t e theory of Structurally Synthesized BDDs (SSBDD). The search space is limited by the application-specific context that enables accurate results even for complex sequential circuits. Experimental results demonstrate efficiency of the proposed approach, and considerable reduction of the length of critical paths if the application-specific constraints are taken into account.
机译:通过纳米级实现技术实现的数字系统的极端复杂性随着传统技术难以实现的增强设计要求。超越最低要求的保证可能对整体系统的成本产生负面影响。在本文中,我们专注于在设计和测试领域中具有许多应用的数字系统中具有许多应用的时序关键逻辑路径识别的任务,例如验证设计的时序约束,估计临时延迟,模拟路径延迟故障和老化等可靠性分析。贡献是一种新的基于仿真的分层搜索方法,用于在顺序电路中的特定于应用程序特定于在线可行的真正关键路径识别。该方法是由混合关键系统的概念激励,但它可以应用于任何类型的数字系统。我们建议使用结构合成的BDD(SSBDD)的T E理论,在更高级别子模块的水平上层次地代表电路。搜索空间受应用的特定上下文的限制,即使是复杂的顺序电路即使是准确的结果也是如此。实验结果表明,如果考虑了应用程序特定的约束,则拟议方法的效率和显着降低关键路径的长度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号