Code compression using Multi-Level Dictionary
Wanderson Roger Azevedo Días, Edward David Moreno · 2013
This paper presents a new code compression method in which we merge the Huffman algorithm with the formation of patterns of blocks and three dictionaries. We seek two consecutive blocks in two levels, one of them into compressed code and the other related to uncompressed code. We have used simulation with SimpleScalar and programs from MiBench. Our proposal has achieved a compression rate of 32.6% and 31.9%, respectively, for ARM and MIPS processor.