Download presentation
Presentation is loading. Please wait.
Published byOliver Pope Modified over 9 years ago
1
Low Power Huffman Coding for High Performance Data Transmission Chiu-Yi Chen,Yu-Ting Pai, Shanq-Jang Ruan, International Conference on, 2006. ICHIT '06, Nov. 2006, pp, 71 - 77 Presenter :Yu-Cheng Cheng
2
Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results
3
Introduction Dynamic power dissipation is the dominant fraction of average power dissipation(70%- 90%). That switching activity represents the logic transition.
4
Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results
5
Construction of Huffman Tree 0 1 0 0 0 0 0 1 1 1 1 1
6
Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results
7
Optimize interior nodes Figure 1. Calculate the switching number
8
Optimize interior nodes Figure 2. Total switching number before exchanged
9
Optimize interior nodes Figure 3. Total switching number after exchanged
10
Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results
11
The average reduction ratio is 3.81% for other files. The average reduction ratio of switching activity is 7.25%, and the best case would be up to 18.04% for executable files.
12
Experimental results Table 1. Switching number compared with the original Huffman coding
13
END
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.