作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (04): 228-229. doi: 10.3969/j.issn.1000-3428.2007.04.080

• 工程应用技术与实现 • 上一篇    下一篇

基于扫描森林结构的种子编码方案

罗 露,向 东   

  1. (清华大学软件学院,北京 100084)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-02-20 发布日期:2007-02-20

Seed Encoding Scheme Based on Scan Forest Architecture

LUO Lu, XIANG Dong   

  1. (School of Software, Tsinghua University, Beijing 100084)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-02-20 Published:2007-02-20

摘要: 扫描森林是一种有效的扫描结构,它能够大幅度地降低测试应用开销、测试功耗以及测试数据容量。该文针对采用扫描森林结构的待测电路提出了一种新的种子编码方案。在该方案中,伪随机测试向量覆盖电路中的易测故障,使用ATPG对剩余故障生成确定性测试向量,将其中某一测试向量对应的种子编码为LFSR扩展成该向量需要运行的时钟周期数。实验结果表明,提出的方案能大幅度地降低种子存储数据量,最大降幅达到了83.3%。

关键词: 自测试, 扫描森林, 种子编码

Abstract: Scan forest is an efficient architecture which can reduce the test application cost, test power of scan testing and test data greatly. This paper proposes a new seed encoding scheme for CUT with scan forest architecture. Under this scheme, pseudo-random patterns are initially applied to cover the easy-to-detect faults. Test patterns are generated by an ATPG for the remaining faults. For a given seed determined by a generated ATPG pattern, encodes it by the number of clock cycles the LFSR needs to run to reach it. Experimental results show this encoding reduces seed storage by up to 83.3% compared with conventional method.

Key words: Built-in self-test, Scan forest, Seed encoding