检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张念[1] 梁华国[1] 祝沈财[1] 叶益群[1]
机构地区:[1]合肥工业大学计算机与信息学院,安徽合肥230009
出 处:《合肥工业大学学报(自然科学版)》2008年第8期1176-1180,共5页Journal of Hefei University of Technology:Natural Science
基 金:国家自然科学基金资助项目(90407008);国家自然科学基金资助项目(60633060);安徽省自然科学基金资助项目(050420103)
摘 要:文章提出了一种基于分组共享种子和位翻转的测试数据压缩方法。该方法根据测试集生成的特点,将确定位处于相同位置的测试向量分为一类,并将每类确定位不同处无关位化,合并得到每类的首模式,这就减少了首模式确定位的个数;同时每类中向量共享一个种子,减少了编码种子个数,提高种子的利用率,达到压缩测试数据的目的;解压时通过记录与LFSR重新播种展开序列确定位不同处的地址信息和翻转信号还原即可。实验表明,该方法与基于部分向量切分的LFSR重新播种方法和混合码相比,在压缩效率上具有明显的优势。A new method of test data compression based on grouping of share seeds and bit-flipping is proposed. The test set is classified according to the rule that the special bits between the vectors are in the same position on the basis of characteristics generated by the test set. The bit in the position where the special bits are different in the same group is changed to the bit without position. Then the first pattern is gained by the combination. So the number of special bits is reduced. At the same time, as one group shares one seed, the number of the seeds is also reduced, and the efficiency of seeds is improved. In decompression, by the address and signal of flipping of the position that is different on the list using LFSR, the original test can be obtained. The experiment indicates that the scheme has prominent advantages compared with the hybrid code and the method which is LFSR reseeding based on syncopation of some test patterns.
分 类 号:TP391.76[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222