Optimal-Partition Based Code Compression for Embedded Processor

摘要：

Memory is one of the most restricted resources in embedded system.Code compression techniques address this issue by reducing the code size of programs.Huffman coding is the most common used coding method.But during the process of generating symbols from instruction, an experi ence-based partition way is usually used,which may cause information redundancy. This paper presents an Optimal Partition Based Code Compression (OPCC) method.Markov tree model is used to extract correlation between bits in instruction. A clustering algorithm is proposed to cluster bits with higher correlation into symbols.Experimental results show that this method could improve the average compression ratio by 4.1%. The decoder part is validated in Altera Cyclonell FPGA.

关键词： Code compression Markov module Cluster

作者: Lei Yang Tiejun Zhang Donghui Wang Chaohuan Hou

作者单位: Uinversity of Chinese Academy of Sciences,Beijing,100190 P.R.China Institute of Acoustics,Chinese Ac Digual System Integration Lab,Institute of Acoustics,Chinese Academy of Sciences,Beijing,100190 R.Ch Digual System Integration Lab,Institute of Acoustics,Chinese Academy of Sciences,Beijing,100190 P.R.

会议类型: 国际会议

会议名称: 2009 IEEE 8th International Conference on ASIC(第八届IEEE国际专用集成电路大会)

会议地点: 长沙

会议语种:英文

页码: 87-90

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）