Low power Huffman coding for high performance data transmission

In this paper, we propose a low power Huffman coding by reducing the number of switching activity during data transmitting. The low power Huffman coding consists of the following two steps: Firstly, reduce the switching activity between each symbol by changing the locations of leaves node in Huffman tree. Secondly, reconstruct the Huffman tree by properly changing interior nodes to decrease switching activities of each codeword. The experimental results show that the proposed Huffman coding algorithm can reduce switching activity up to 7.25% on average and 18.04% for the best case compared with traditional Huffman coding approach in executable files. Besides, the average power consumption reduction ratio is 3.81% for other files. As a result, the proposed algorithm is very useful for data transmissions over large self-capacitances wire.