Tree-less Huffman coding algorithm for embedded systems

The development of new technologies and the increase of information handled by small devices has lead to a variety of new storage methods which heavily depend on compression algorithms. Previously, we demonstrated the advantages of using reconfigurable computing for the efficient implementation of a Huffman coding-based compression unit [1]. In this paper we built upon our last design and propose a tree-less alternative to the traditional Huffman coding algorithm. Particularly, the generation unit is enhanced by using precise code length calculations.