基于双核扫描链平衡的SoC测试调度  

SoC Test Scheduling Based on Scan Chain Balance of Pair Cores

作　　者：胡瑜[1] 韩银和[1] 李华伟[1] 吕涛[1] 李晓维[1] 

机构地区：[1]中国科学院计算技术研究所信息网络室,北京100080

出　　处：《计算机辅助设计与图形学学报》2005年第10期2203-2208,共6页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(90207002;60242001);北京市科技重点项目(H020120120130);中国科学院计算技术研究所基础研究基金(20036160)

摘　　要：由于芯核的测试时间与芯核内最长扫描链的长度成正比,通过将SoC中的芯核进行成对匹配,使双芯核内最长的扫描链比两个单芯核内最长的扫描链短,从而缩短测试时间.利用粒子群优化算法和分合策略,高效地匹配芯核、设置芯核的测试顺序并分配测试总线,以获得优化的测试计划.在ITC’02基准SoC集上的实验结果表明,相对于其他基于单核扫描链平衡的测试调度技术而言,文中的测试调度技术能获得具有最短测试时间的测试计划.Since the test application time of a core is proportional tO the length of its longest scan chain, this paper presents a technique to pair-wise match the cores in SoC to balance the scan chains of pair cores. The longest scan chain of pair cores is shorter than each longest scan chain of the single core. A division and union strategy is proposed, and by using an evolutionary algorithm named particle swarm optimization, the cores are efficiently matched, then are ordered and allocated to the test access mechanism bus to get an optimal test plan. Experimental results on ITC＇02 SoC benchmarks reveal that the proposed test scheduling technique achieves the minimum test application time compared to the previous approaches that are based on the scan chain balance of single core.

关 键 词：测试调度 扫描链平衡 系统芯片 粒子群优化算法 

分 类 号：TP391.76[自动化与计算机技术—计算机应用技术]