摘要
提出一个基于重复播种的新颖的BIST方案 ,该方案使用侦测随机向量难测故障的测试向量作为种子 ,并利用种子产生过程中剩余的随意位进行存储压缩 ;通过最小化种子的测试序列以减少测试施加时间 实验表明 ,该方案需要外加硬件少 ,测试施加时间较短 ,故障覆盖率高 ,近似等于所依赖的ATPG工具的故障覆盖率 在扼要回顾常见的确定性BIST方案的基础上 ,着重介绍了文中的压缩存储硬件的方法。
This paper presents a novel build in self test (BIST) approach by reseeding an LFSR It adopts test patterns used to detect random pattern resistant faults as its seeds Don't care bits in those seeds, which are remained during the process of test pattern generation by an automatic test pattern generator (ATPG) tool, are utilized to reduce the size of storage of a seed array Experimental results show that the proposed approach is able to achieve higher fault coverage, which is approximately equal to the one of an ATPG on which the approach depends, and needs less additional hardware overhead for synthesis, and consumes less time for test pattern application After a brief review of those typical deterministic BIST schemes, this paper mainly introduces its scheme of storage compression, synthesis methodology, and experimental results
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2003年第6期662-666,672,共6页
Journal of Computer-Aided Design & Computer Graphics
基金
国家自然科学基金 ( 60 173 0 42 )资助
