摘要
提出一种由异或门按照完全二叉树形状排列而成的树形向量解压缩器。该解压缩器的少数输出端需要由大部分的输入端来确定,而且该结构对其输出值的确定关系类似于扫描链中确定位的分布概率,可有效降低测试数据量。实验结果表明,对于ISCAS’89基准电路,该结构最高将测试数据量压缩了77倍。
This paper proposes a tree vector decompressor,which is a complete binary tree where a node is an XOR gate.In the proposed decompressor,its small number outputs are determined by most of its inputs.And the confirmed relationship between the structure and its outputs is similar to the distribution probability of care bits in scan chains.This method reduces test data volume.Experimental results show that the test data compression ratio is up to 77 times for the ISCAS’89 benchmark circuits.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第9期249-251,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60673085)
关键词
内建自测试
可测性设计
解压缩器
Built-in Self Test（BIST）
design for testability
decompressor
