基于动态覆盖率提高门槛值的种子计算方法  

A Seed-Calculation Method on Dynamic Coverage Improvement Threshold

作　　者：谈恩民[1] 钱文武[1] 刘建军[1] 

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

出　　处：《微电子学与计算机》2008年第8期164-167,共4页Microelectronics & Computer

摘　　要：为了向可重复播种的LFSR结构提供种子,提出一种基于动态覆盖率提高门槛值(Dynamic Coverage Im-provement Threshold,DCIT)的种子计算方法.使用该方法计算得到的种子进行重复播种,能够截断对提高故障覆盖率效率低的测试码序列.每个种子可以得到长度固定的伪随机测试序列.以ISCAS85基准电路实验结果表明,该方案能够在不降低故障覆盖率的前提下,减少测试矢量长度、缩短测试时间和降低测试功耗.This paper presents a new approach which can supplies the seeds for the linear feedback shift register （LFSR） reseeding on the dynamic coverage improvement threshold （DCIT）. The method is simple and effective, After reseeding with the seeds which are calculated by this way, the ineffective pseudo-random test vector sequence will be truncated. Every seed produces the same length pseudo-random test patterns. The experiments on ISCAS85 benchmark circuits demonstrate that the scheme can reduce the test patterns length, shorten the test time and decline the test power consumption.

关 键 词：动态CIT 线性反馈移位寄存的器 种子 故障覆盖率 

分 类 号：TN4[电子电信—微电子学与固体电子学]