Test Data Compression Scheme for Fast Search Best Rational Approximate Fraction

Authors

Haifeng Wu, 1. School of Computer and Information, Anqing Normal University, Anqing 246011, China;;
Wenfa Zhan, 2. Department of Science Research, Anqing Normal University, Anqing 246011, China;
Yifei Cheng, 1. School of Computer and Information, Anqing Normal University, Anqing 246011, China;;

Abstract

Abstract: 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.

Recommended Citation

Wu, Haifeng; Zhan, Wenfa; and Cheng, Yifei (2018) "Test Data Compression Scheme for Fast Search Best Rational Approximate Fraction," Journal of System Simulation: Vol. 30: Iss. 6, Article 48.
DOI: 10.16182/j.issn1004731x.joss.201806048
Available at: https://dc-china-simulation.researchcommons.org/journal/vol30/iss6/48

First Page

2384

Revised Date

2016-08-08

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201806048

Last Page

2389

CLC

TP391.76

Recommended Citation

Wu Haifeng, Zhan Wenfa, Cheng Yifei. Test Data Compression Scheme for Fast Search Best Rational Approximate Fraction[J]. Journal of System Simulation, 2018, 30(6): 2384-2389.

DOI

10.16182/j.issn1004731x.joss.201806048