IP测试壳的量子蚁群优化  

IP Test Wrapper Scheduling Based on Quantum Ant Colony Algorithm

作　　者：杨刚[1] 颜学龙[1] 

机构地区：[1]桂林电子科技大学电子工程与自动化学院,广西桂林541004

出　　处：《微电子学与计算机》2015年第10期155-158,共4页Microelectronics & Computer

基　　金：广西自动检测技术与仪器重点实验室主任基金项目(YQ14105)

摘　　要：针对片上系统(SoC)的IP核扫描链分配问题,提出量子蚁群算法对SoC测试壳(Wrapper)进行优化,以有效地解决陷入局部最优解的问题,快速地寻找扫描链的最佳分配方式,从而缩短最长扫描链,减少单个IP核的测试时间.以ITC'02Test benchmarks中的典型IP核为实验对象,实验结果表明量子蚁群算法能有效快速地解决IP测试壳的优化问题.To cope with the problem of scan chain distribution of system-on-chip （SoC） IP core, this paper proposes quantum ant colony algorithm as an optimization scheme, which can effectively solve the problems that the results easily fall into local optimal solution, and quickly find the best distribution of scan chain, thereby shortening the longest scan chain, reducing test time for a single IP core. Typical IP core of ITC02 Test benchmarks is adopted, and the experimental results show that the quantum ant colony optimization algorithm can effectively and lastly solve the problem of the scheme.

关 键 词：扫描链 量子蚁群算法 测试壳 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]