杨刚, 颜学龙. IP测试壳的量子蚁群优化[J]. 微电子学与计算机, 2015, 32(10): 155-158. DOI: 10.19304/j.cnki.issn1000-7180.2015.10.033
引用本文: 杨刚, 颜学龙. IP测试壳的量子蚁群优化[J]. 微电子学与计算机, 2015, 32(10): 155-158. DOI: 10.19304/j.cnki.issn1000-7180.2015.10.033
YANG Gang, YAN Xue-long. IP Test Wrapper Scheduling Based on Quantum Ant Colony Algorithm[J]. Microelectronics & Computer, 2015, 32(10): 155-158. DOI: 10.19304/j.cnki.issn1000-7180.2015.10.033
Citation: YANG Gang, YAN Xue-long. IP Test Wrapper Scheduling Based on Quantum Ant Colony Algorithm[J]. Microelectronics & Computer, 2015, 32(10): 155-158. DOI: 10.19304/j.cnki.issn1000-7180.2015.10.033

IP测试壳的量子蚁群优化

IP Test Wrapper Scheduling Based on Quantum Ant Colony Algorithm

  • 摘要: 针对片上系统(SoC)的IP核扫描链分配问题,提出量子蚁群算法对SoC测试壳(Wrapper)进行优化,以有效地解决陷入局部最优解的问题,快速地寻找扫描链的最佳分配方式,从而缩短最长扫描链,减少单个IP核的测试时间.以ITC'02 Test benchmarks中的典型IP核为实验对象,实验结果表明量子蚁群算法能有效快速地解决IP测试壳的优化问题.

     

    Abstract: 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 ITC'02 Test benchmarks is adopted, and the experimental results show that the quantum ant colony optimization algorithm can effectively and fastly solve the problem of the scheme.

     

/

返回文章
返回