首页> 外文期刊>IEEE transactions on very large scale integration (VLSI) systems >Design of reconfigurable access wrappers for embedded core based SoC test
【24h】

Design of reconfigurable access wrappers for embedded core based SoC test

机译:基于嵌入式内核的SoC测试的可重新配置访问包装的设计

获取原文
获取原文并翻译 | 示例
       

摘要

Testing of embedded core based system-on-chip (SoC) ICs is a well known problem, and the upcoming IEEE P1500 Standard on Embedded Core Test (SECT) standard proposes DFT solutions to alleviate it. One of the proposals is to provide every core in the SoC with test access wrappers. Previous approaches to the problem of wrapper design have proposed static core wrappers, which are designed for a fixed test access mechanism (TAM) width. We present the first report of a design of reconfigurable core wrappers which allow for a dynamic change in the width of the TAM executing the core test. Analysis of the corresponding scheduling problem indicates that good approximate schedules can be achieved without significant computational effort. Specifically, we derive a O(N/sub C//sup 2/B) time algorithm which can compute near optimal SoC test schedules, where N/sub C/ is the number of cores and B is the number of top level TAMs. Experimental results on benchmark SoCs are presented which improve upon integer programming based methods, not only in the quality of the schedule, but also significantly reduce the computation time.
机译:基于嵌入式核心的片上系统(SoC)IC的测试是一个众所周知的问题,即将发布的IEEE P1500嵌入式核心测试标准(SECT)标准提出了DFT解决方案来缓解这一问题。提议之一是为SoC中的每个内核提供测试访问包装。解决包装设计问题的先前方法已经提出了静态核心包装,其设计用于固定的测试访问机制(TAM)宽度。我们提出了可重配置核心包装设计的第一份报告,该设计允许动态更改执行核心测试的TAM的宽度。对相应调度问题的分析表明,无需大量的计算工作即可获得良好的近似调度。具体来说,我们推导了一种O(N / sub C // sup 2 / B)时间算法,该算法可以计算接近最佳的SoC测试计划,其中N / sub C /是内核数,B是顶级TAM数。提出了基准SoC的实验结果,这些结果改进了基于整数编程的方法,不仅改善了调度质量,而且显着减少了计算时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号