检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:詹文法 陶鹏程 ZHAN Wenfa;TAO Pengcheng(School of Computer and Information,Anqing Normal University,Anqing 246003,China;Key Laboratory of Intelligent Sensing and Computing in Anhui Province,Anqing 246003,China)
机构地区:[1]安庆师范大学计算机与信息学院,安庆246003 [2]安徽省高校智能感知与计算重点实验室,安庆246003
出 处:《清华大学学报(自然科学版)》2020年第10期837-844,共8页Journal of Tsinghua University(Science and Technology)
基 金:国家自然科学基金资助项目(61306046,61640421);安徽高校协同创新项目(GXXT-2019-030)。
摘 要:针对集成电路所需测试数据量庞大、测试成本过高的问题,该文提出了最小游程切换点标记编码压缩方法,将原始测试数据压缩,达到减少测试成本的目的。该方法将测试集按若干向量分组编码,利用组内向量游程切换范围的重叠关系合并游程切换点,可以将组内所有测试向量的游程位置用一个向量表示出来,突破了传统编码压缩要用编码字后缀表示游程长度的限制,相较于传统编码压缩,极大地缩短了编码字。该方法解压规则简单,硬件开销小, ISCAS 89标准电路实验结果表明:该方案压缩效果优于其他几类编码压缩方案,可为测试数据量过大提供有效解决方法。Integrated circuit testing produces huge quantities of test data in expensive tests. This paper describes use of the minimum run-changing point mark coding compression method to compress the original test data to reduce the test costs. The method encodes the test set into several vectors and uses the overlapping relationships between the vector run range in each group to merge the run-length switching points. The run position in all the test vectors in the group can be represented by a vector which simplifies traditional coding compression. The method breaks through the limitation of using the suffix of the code word to express the length of the run, and greatly shortens the code word compared to conventional code compression. The method has simple decompression rules and low hardware overhead. Tests with the ISCAS 89 standard circuit experiment show that this compression scheme is more effective than other types of coding compression schemes.
分 类 号:TP391.76[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.10.21