基于平均值余量的Wrapper扫描链平衡算法  

Wrapper scan chain balance algorithm based on mean-value allowance

作　　者：俞洋[1] 陈叶富[1] 彭宇[1] 

机构地区：[1]哈尔滨工业大学自动化测试与控制系,哈尔滨150001

出　　处：《仪器仪表学报》2011年第10期2290-2296,共7页Chinese Journal of Scientific Instrument

基　　金：装备预研重点基金(9140A17040409HT01);航天支撑基金(2009-HT-HGD-03);教育部高等学校新世纪优秀人才基金(NCET-10-0062)资助项目

摘　　要：测试问题已成为SoC发展过程中的瓶颈,提出一种新的Wrapper扫描链平衡算法以期缩短IP核测试时间。算法首先计算Wrapper扫描链长度平均值,再结合特定的余量值,计算得到一个取值区间,记该区间为平均值余量;然后将IP核的内部扫描链按其长度降序排列,每次均将最长的内部扫描链添加到某条Wrapper扫描链上,直到该Wrapper扫描链长度在平均值余量所指定的区间内为止。以ITC'02 SoC Test Benchmarks内的所有测试集为对象完成的实验证明本算法能极其有效的通过扫描链平衡设计缩短IP核测试时间。Testing is considered as a bottle-neck for the development of SoC.This paper proposes a new wrapper scan chain balance algorithm for minimizing IP testing time.This algorithm calculates the mean value of wrapper scan chains firstly,then a value range is generated with a given allowance,this value range is called Mean-Value Allowance in this paper.The IP internal scan chains are sorted in descending order of the length.Every time the longest internal scan chain is successively assigned to a wrapper scan chain,until whose length is in the value range indicated by Mean-Value Allowance.Experiments on all the test sets in ITC′02 SoC Test Benchmarks approve that this algorithm effectively reduces the IP testing time through wrapper scan chain balance design.

关 键 词：SOC测试 Wrapper扫描链 平衡算法 

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