A data compression technique based on reversed leading bits coding and Huffman coding

In this paper, a new test data compression technique is proposed. The compression is achieved by reversed leading bits coding together with Huffman coding (RLBC-HC). RLBC-HC fills the don´t-care bit with the value of the bit before it at first. Then the test data is divided into codeword segments for pattern matching to generate corresponding symbols. With a proper number of patterns, the number of different symbols and the hardware complexity can be well balanced. Finally, Huffman coding is adopted upon those symbols to achieve high compression ratio. Experimental results demonstrate that the RLBC-HC technique can achieve better compression ratio on average over the other compression schemes.