采用循环移位和优化编码的测试压缩方法  

Test Compression Approach of Adopting Cyclic Shift and Optimal Coding

作　　者：刘杰[1,2] 梁华国[3] 蒋翠云[4] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009 [2]阜阳师范学院物理与电子科学学院,安徽阜阳236037 [3]合肥工业大学电子科学与应用物理学院,合肥230009 [4]合肥工业大学数学学院,合肥230009

出　　处：《计算机研究与发展》2012年第4期873-879,共7页Journal of Computer Research and Development

基　　金：国家自然科学基金重点项目(60633060);国家自然科学基金项目(60876028);教育部高等学校博士学科点专项科研基金项目(200803590006);安徽省海外高层次人才基金项目(2008Z014);安徽省高校省级自然科学研究基金项目(KJ2010B428;KJ2010A280)

摘　　要：日益增加的集成电路测试成本变得越来越难以接受,因而提出了一种简单而有效的解决方案.该方案把循环移位技术应用到测试数据压缩中,比起一般的移位技术,该方案更能有效地利用测试集中无关位.结合异或逻辑运算,所提方案累积无关位,进一步提高测试向量与其参考向量的相容性和反向相容性.在编码过程中对各种可能移位状态进行统计,建立Huffman树,找出最优化编码形式,因而可以增加短码字的利用率,减少长码字的使用频次.通过给出的分析和实验,说明了所提方案在附加硬件成本很低的情况下既能够提高测试数据压缩率,又能够减少测试时间,优于已发表的游程编码方案和其他同类型的编码压缩技术.It is more difficult to accept the increasing test cost for ICs,and hence a simple and high effective solution scheme is proposed in this paper.Cyclic shift technique is applied to test data compression,which can make use of don＇t bits in test set more effectively than general shift techniques.Combining with XOR logic,the proposed scheme cumulates don＇t bits and further increase compatibility and inverse compatibility between test vector and its reference vector.According to the statistics of shift state possible occurring,Huffman tree is built and the most optimal code form is found in coding process,so that the utilization ratios of short code words are increased and the use frequencies of long codes are decreased.The presented analysis and experiment results show that the proposed scheme can increase test data compression ratios and decrease test time with very low additional hardware overhead,and is superior to other existing run-length code schemes and similar blocking code ones.

关 键 词：编码压缩 测试向量 相容 循环移位 HUFFMAN编码 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]