快速查找最佳有理渐近分数的测试数据压缩方法  

Test Data Compression Scheme for Fast Search Best Rational Approximate Fraction

作　　者：吴海峰 詹文法 程一飞 Wu Haifeng;Zhan Wenfa;Cheng Yifei(School of Computer and Information, Anqing Normal University, Anqing 246011, China;Department of Science Research, Anqing Normal University, Anqing 246011, China)

机构地区：[1]安庆师范大学计算机与信息学院,安徽安庆246011 [2]安庆师范大学科研处,安徽安庆246011

出　　处：《系统仿真学报》2018年第6期2384-2389,共6页Journal of System Simulation

基　　金：国家自然科学基金(61540011;6130646);安徽省学术技术带头人后备人选(GXBJZD2016075;2015H053);安徽高校自然科学研究重点项目(KJ2016A427;KJ2017A351)

摘　　要：测试数据量的快速增长成为导致测试时间增加、制造成本提高的一个主要因素。为减少测试数据量,提出一种快速查找最佳有理渐近分数的编码压缩方法。不直接存储游程数据,而是将游程数据转换成浮点数,快速查找浮点数对应的最佳有理渐近分数,最终以整数分子和整数分母的形式存储游程出现的规律。该方法相容于传统的编码方法,压缩和解压协议简单,压缩效果好,硬件开销小。仿真实验结果证明了该方法的有效性和稳定性,与国内外同类方法相比具有一定优势。Rapid growth of test data volume becomes a major factor for test time and manufacturing cost increasing. To reduce test data volume, a code-based compression scheme with fast search best rational approximate fraction is presented. The run-length data is converted into floating point numbers; and the equal best rational approximate fractions of floating point numbers is searched quickly; the appearing law of run-length data in the form of integer numerator and integer denominator is stored instead of storing run-length data directly. This scheme is compatible with traditional code-based methods. It also has simple compression and decompression protocol, good compression effect and small hardware overhead. Simulation results demonstrate the effectiveness and stability of the scheme. Compared with the similar method at home and abroad, the scheme also has certain advantages.

关 键 词：测试数据压缩 最佳有理渐近分数 游程长度 浮点数 

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