北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (5): 19-23.doi: 10.13190/jbupt.200705.19.niudh

• 论文 • 上一篇    下一篇

序列对递增生成的SOC测试调度算法

牛道恒,王红,杨士元   

  1. (清华大学 自动化系, 北京 100084)
  • 收稿日期:2006-12-14 修回日期:2007-03-28 出版日期:2007-10-30 发布日期:2007-10-30
  • 通讯作者: 牛道恒

Incremental Sequence Pair Generation Algorithm for SOC Test Scheduling

NIU Dao-heng, WANG Hong, YANG Shi-yuan   

  1. (Department Automation, Tsinghua University, Beijing 100084, China)
  • Received:2006-12-14 Revised:2007-03-28 Online:2007-10-30 Published:2007-10-30
  • Contact: NIU Dao-heng

摘要:

提出了一种确定性的片上系统 (SOC) 测试调度算法。在对测试环采取最优分配和平衡优化的基础上,构造包含四种序列对递增生成方法的循环迭代过程。该过程同时考虑测试访问机制的宽度、空隙面积、IP核测试面积等因素,可在较短的迭代步数得到有效的测试调度方案。对ITC’02 基准电路进行了实验。结果表明,在得到近似解的前提下,该算法较传统的模拟退火算法具有更快的运行速度。

关键词: 片上系统, 测试调度, 测试环, 测试访问机制, 序列对

Abstract:

A deterministic algorithm is proposed for System-on-Chip (SOC) test scheduling. With the optimal assignment and balance design for test wrappers, four types of incremental Sequence Pair generation methods are constructed as a cyclic iteration process. By considering the TAM width, dead space, and test area for IP cores simultaneously, the algorithm can achieve effective solutions in certain iteration steps. Experimental results on ITC’02 benchmark show that the proposed algorithm performs faster than the traditional SA method while obtaining comparable results.

Key words: system-on-chip, test scheduling, test wrapper, test access mechanism, sequence pair

中图分类号: