基于测试数据分组合并的索引编码压缩方案  

Index Coding Compression Scheme Based on Test Data Partition Merging

作　　者：李建新[1,2] 梁华国[1] 陶珏辉[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009 [2]宿州学院计算机科学与技术系,宿州234000

出　　处：《计算机工程》2010年第11期265-267,共3页Computer Engineering

基　　金：国家自然科学基金资助重点项目(60633060);国家自然科学基金资助项目(60876028);教育部博士点基金资助项目(200803590006);安徽省海外高层次人才基金资助项目(2008Z014);宿州学院硕士科研启动基金资助项目(2009YSS12)

摘　　要：为降低集成电路的测试数据量,提出一种分组合并的索引编码压缩方案。该方案将原始测试集以固定宽度分组,根据相关性对每组测试字段进行群划分,选取若干较大的群,分别合并为标准字段存入解压结构的ROM中以备索引,并对测试字段进行索引编码。给出解压过程及实验结果,通过与其他编码方案的比较,证明该方案可行有效,且硬件开销较小。In order to reduce the volume of IC test data, an index coding compression scheme based on test data partition merging is proposed. According to the scheme, the original test set is divided into blocks with fixed width, each block is divided into several groups according to relevance among test fields, several larger groups are picked out and merged into standard fields respectively, the standard fields are stored in the ROM of decompression structure for indexing, the test fields are encoded according to index. It describes the decompression process and provides experimental results. Compared with other scheme, it shows that the scheme is more feasible and effective, and the hardware cost is smaller.

关 键 词：分组合并 群划分 索引编码 

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