loading...
A New and Efficient Field-Partition Based Code Compression and Its Pipelined Decompression System
Beijing, China August 30-September 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICICIC.2006.206First International Conference on Inn ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yuan-Long Jeang, Kun Shan University, Taiwan
Chih-Chung Tai, National Kaohsiung University of Applied Sciences, Taiwan
Yong-Zong Lin, National Kaohsiung University of Applied Sciences, Taiwan
A field partition based instruction compression/ decompression system for ARM series architecture is proposed. We could get a statistics of the appearances of each field in all instructions of a program. Depending on the statistics, we partition each instruction into three fields and compress each field using Huffman coding method. Experimental results show that our method is better than others with a 55% of average compression ratio. For decompression, single buffering, double buffering and pipeline techniques have been proposed. However, due to jump penalty, these techniques incur more delays in pipeline or have to stop and fill in the cache buffers. We proposed a Pipeline with Back-up for Flushing technique that incurs no delay and without stopping due to jump. The average performance is increased about 10% to 60%.
Citation:
Yuan-Long Jeang, Chih-Chung Tai, Yong-Zong Lin, "A New and Efficient Field-Partition Based Code Compression and Its Pipelined Decompression System," icicic, vol. 2, pp.10-13, First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.