Re-Optimization Algorithm for SoC Wrapper-Chain Balance Using Mean-Value Approximation  

作　　者：牛道恒 王红 杨士元 成本茂 靳洋 

机构地区：[1]Department of Automation,Tsinghua University

出　　处：《Tsinghua Science and Technology》2007年第S1期61-66,共6页清华大学学报（自然科学版（英文版）

基　　金：the National Key Basic Research and Development (973) Program of China(No. 2005CB321604);the National Natural Science Foundation of China (No. 60633060).

摘　　要：Balanced wrapper scan chains are desirable for system-on-chip (SoC) testing because they minimize the time required to transport the test data. A new heuristic algorithm is proposed based on mean- value approximation and implement fast re-optimization as a subsequence of an earlier best-fit-decrease (BFD) method. The mean length of each scan chain was introduced as an approximation target to balance different scan chains and hence saved testing time. Experimental results present both for assumed arbitrary cores and cores from ITC’02 benchmark and show the effectiveness of the algorithm. The proposed algorithm can provide more balanced wrapper design efficiently for the test scheduling stage.Balanced wrapper scan chains are desirable for system-on-chip (SoC) testing because they minimize the time required to transport the test data. A new heuristic algorithm is proposed based on mean- value approximation and implement fast re-optimization as a subsequence of an earlier best-fit-decrease (BFD) method. The mean length of each scan chain was introduced as an approximation target to balance different scan chains and hence saved testing time. Experimental results present both for assumed arbitrary cores and cores from ITC’02 benchmark and show the effectiveness of the algorithm. The proposed algorithm can provide more balanced wrapper design efficiently for the test scheduling stage.

关 键 词：SYSTEM-ON-CHIP WRAPPER scan chain BALANCE re-optimization 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]