一种基于分块编码和优化排序的测试数据压缩技术  

Test data compression technology based on blocking code and optimal sort algorithm

作　　者：刘杰[1,2] 梁华国[1] 徐三子[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009 [2]阜阳师范学院物理与电子科学学院,阜阳236041

出　　处：《电子测量与仪器学报》2009年第5期85-91,共7页Journal of Electronic Measurement and Instrumentation

基　　金：国家自然科学基金(编号:60876028)资助项目;国家自然科学重点基金(编号:60633060)资助项目;博士点基金(编号:200803590006)资助项目;海外高层次人才(编号:2008Z014)资助项目

摘　　要：为了有效地降低数字集成电路测试成本,提出了一种编码压缩方案和测试排序算法。这种压缩方案就是把每一个测试模式分成固定长度的块,并根据相邻测试模式的对应块是否相容和一位相异进行编码。同时采用贪婪的排序算法对编码过程中所有测试模式进行动态排序,寻找一种最佳压缩顺序,以便进一步发挥所提方案的压缩效果。文章最后给出了该方案的解压思想和实验结果,证明了该方案能够提高数据压缩率,降低附加硬件开销,优于已知的其他测试数据压缩方案。In order to reduce the cost of testing digital ICs effectively, a test data compression scheme and a test sort algorithm are proposed. On one hand, all test modules are divided into successive fixed-length blocks and corresponding blocks between both successive test modules are analyzed so as to encode them according to whether they are compatible or one-bit-dissimilarity. On the other hand, to further heighten the compression effect of the code scheme, a greedy sort algorithm is dynamically used to sort all test modules during encoding process. Finally, the decompression circuit of this code technique and the experimental results are presented, which show that it can receive high data compression ratio with a few additional hardware cost, and is superior to other existing test data compression methods.

关 键 词：测试数据压缩 分块 相容 测试模式 

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