DOI: 10.1109/date.2004.1269210
View full text
|
|
Share

Abstract: We propose a new variable-sized-block method for VLIW code compression. Code compression traditionally works on fixed-sized blocks and its efficiency is limited by the small block size. Branch blocks -instructions between two consecutive possible branch targets -provide larger blocks for code compression. We propose LZW-based algorithms to compress branch blocks. Our approach is fully adaptive and generates coding table on-the-fly during compression and decompression. When encountering a branch target, the co…

expand abstract