Compressão de Código usando Huffman e Padrão de Blocos baseado em Dicionário
(Code Compression using Huffman and Dictionary-based Pattern Blocks)
Wanderson Roger Azevedo Dias (email@example.com)1, Edward David Moreno (firstname.lastname@example.org)2
1IFS - Instituto Federal de Sergipe2UFS - Universidade Federal de Sergipe
This paper appears in: Revista IEEE América Latina
Publication Date: July 2015
Volume: 13, Issue: 7
This paper presents a new code compression method where we merge the Huffman algorithm with the formation of patterns of blocks, which are found into the dictionary. 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 34.5% and 7% improvement in code compression when compared to the Huffman traditional method.
Code Compression, Embedded Systems, Huffman, Dictionary-based Pattern Blocks, MiBench
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (450)]