摘要
提出了一种新的基于游程编码的测试数据压缩/解压缩的算法:共前缀码编码(SPCS),它在传统游程使用较短的代码字来代替较长的游程的基础上,进一步探讨游程之间的相关性,使用一位来代替具有与前一游程相同前缀的后一游程的前缀,使需要多位才能表示的代码字的前缀用一位就可以表示,进一步提高了压缩率。相比类似的编码测试数据压缩方案,具有压缩率高、解压控制过程容易实现的突出特点。理论分析和对ISCAS-85和ISCAS-89部分标准电路硬故障集的实验结果证明了本方案的有效性。
A new scheme of test data compression/decompression, namely sharing-prefixed code scheme （SPCS） was proposed based on run length. It further explored the relationship between two immediate runs on the basis of the traditional characteristic of run length coding which used shorter codeword to represent longer symbol （run-length）. This scheme used 1 bit to represent the whole prefix of the later run of two immediate runs whose prefixes were the same. Compared with other schemes, this scheme has some characteristics, such as high compression ratio, easy control and implementation. Theoretical analysis and experimental results for the hard fault set of ISCAS-85 and ISCAS-89 benchmark circuits show that the proposed scheme is a very efficient compression method.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2008年第21期5979-5983,共5页
Journal of System Simulation
基金
国家自然科学基金重大研究计划(90407008)
国家973计划项目(2005CB321605)
国家自然科学基金重点项目(60633060)
安徽省自然科学基金(050420103)
安徽省高校青年教师基金(2006jql212)
关键词
测试数据压缩
游程编码
硬故障集
压缩/解压
test data compression
run length coding
hard fault set
compression/decompression
