提出一种类似于字典索引的编码压缩方法,将与参考数据块相容的测试数据块用"1"标记来压缩测试数据,解压体系结构只需要一个有限状态机和一个与数据块等长的循环扫描移位寄存器.与在Golomb码和FDR码中所需要的与测试向量等长的循环扫描移位寄存器相比,该方法的硬件开销较小.实验结果表明,该方法可以有效地压缩测试数据,且效果优于Golomb码和FDR码.
This paper proposes an encoding compression method, which is similar to a dictionary index. To compress test data, the data blocks which are compatible with the reference data blocks are marked by "1" in the proposed method. Its decompression architecture requires only a finite state machine and a cyclical scan register whose length is the same as that of the data block. Compared to the length of the cyclical scan register required in Golomb and FDR codes, which is equal to the length of the test vector, hardware cost in the proposed method is less than that in Golomb and FDR codes. Experimental results show that our method can efficiently compress test data and outperform Golomb codes and FDR codes.