Low Power Huffman Coding for High Performance Data Transmission Chiu-Yi Chen,Yu-Ting Pai, Shanq-Jang Ruan, International Conference on, 2006. ICHIT '06,

Slides:



Advertisements
Similar presentations
EE 4780 Huffman Coding Example. Bahadir K. Gunturk2 Huffman Coding Example Suppose X is a source producing symbols; the symbols comes from the alphabet.
Advertisements

MP3 Optimization Exploiting Processor Architecture and Using Better Algorithms Mancia Anguita Universidad de Granada J. Manuel Martinez – Lechado Vitelcom.
Introduction to Computer Science 2 Lecture 7: Extended binary trees
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Huffman Encoding Dr. Bernard Chen Ph.D. University of Central Arkansas.
Measurement Unit. Measurement Unit Outline Introduction Standard Units of Measure (1) Fractional Inch Scale (4) Fractional scale graphic organizer How.
Power Grid Sizing via Convex Programming Peng Du, Shih-Hung Weng, Xiang Hu, Chung-Kuan Cheng University of California, San Diego 1.
P449. p450 Figure 15-1 p451 Figure 15-2 p453 Figure 15-2a p453.
Compression & Huffman Codes
1 Huffman Codes. 2 Introduction Huffman codes are a very effective technique for compressing data; savings of 20% to 90% are typical, depending on the.
Chapter 14 An Overview of Query Optimization. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Figure 14.1 Typical architecture for.
Lecture 6: Huffman Code Thinh Nguyen Oregon State University.
Optimal Merging Of Runs
Original Tree:
Insert A tree starts with the dummy node D D 200 D 7 Insert D
DL Compression – Beeri/Feitelson1 Compression דחיסה Introduction Information theory Text compression IL compression.
Algorithm Design & Analysis – CS632 Group Project Group Members Bijay Nepal James Hansen-Quartey Winter
Dr. O.Bushehrian ALGORITHM DESIGN HUFFMAN CODE. Fixed length code a: 00b: 01c: 11 Given this code, if our file is ababcbbbc our encoding is
1 Lossless DNA Microarray Image Compression Source: Thirty-Seventh Asilomar Conference on Signals, Systems and Computers, Vol. 2, Nov. 2003, pp
1 Analysis of Algorithms Chapter - 08 Data Compression.
1 中華大學資訊工程學系 Ching-Hsien Hsu ( 許慶賢 ) Localization and Scheduling Techniques for Optimizing Communications on Heterogeneous.
Chapter 07 Electronic Analysis of CMOS Logic Gates
A Memory-efficient Huffman Decoding Algorithm
Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes Published in: High Performance Computing and Simulation (HPCS), 2013 International.
Introduction to Algorithms Chapter 16: Greedy Algorithms.
Huffman coding Content 1 Encoding and decoding messages Fixed-length coding Variable-length coding 2 Huffman coding.
Design of Novel Two-Level Quantizer with Extended Huffman Coding for Laplacian Source Lazar Velimirović, Miomir Stanković, Zoran Perić, Jelena Nikolić,
CS654: Digital Image Analysis Lecture 34: Different Coding Techniques.
Hanyang University Hyunok Oh Energy Optimal Bit Encoding for Flash Memory.
Huffman’s Algorithm 11/02/ Weighted 2-tree A weighted 2-tree T is an extended binary tree with n external nodes and each of the external nodes is.
Foundation of Computing Systems
1Computer Sciences Department. 2 Advanced Design and Analysis Techniques TUTORIAL 7.
SPIHT algorithm combined with Huffman encoding Wei Li, Zhen Peng Pang, Zhi Jie Liu, 2010 Third International Symposium on Intelligent Information Technology.
Lossy Compression of Packet Classifiers Author: Ori Rottenstreich, J’anos Tapolcai Publisher: 2015 IEEE International Conference on Communications Presenter:
Rate-Based Query Optimization for Streaming Information Sources Stratis D. Viglas Jeffrey F. Naughton.
Huffman Coding with Non-Sorted Frequencies Shmuel Tomi Klein Dana Shapira Bar Ilan University, Ashkelon Academic College, ISRAEL.
Experience with Software Watermarking Jens Palsberg, Sowmya Krishnaswamy, Minseok Kwon, Di Ma, Qiuyun Shao, Yi Zhang CERIAS and Department of Computer.
The Effect of Data-Reuse Transformations on Multimedia Applications for Application Specific Processors N. Vassiliadis, A. Chormoviti, N. Kavvadias, S.
CALCULATING HALF-LIFE Aim: How can we measure how much of a radioactive element decayed? DO NOW: If we start with 4.5 grams of Radon- 222 and over a period.
Developing resource consolidation frameworks for moldable virtual machines in clouds Author: Liang He, Deqing Zou, Zhang Zhang, etc Presenter: Weida Zhong.
Efficient Huffman Decoding Aggarwal, M. and Narayan, A., International Conference on Image Processing, vol. 1, pp. 936 – 939, 2000 Presenter :Yu-Cheng.
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
Information theory Data compression perspective Pasi Fränti
CSC317 Greedy algorithms; Two main properties:
EE465: Introduction to Digital Image Processing
Assignment 6: Huffman Code Generation
Madivalappagouda Patil
Title of the Paper Article Code: A-10-…
Speaker : Che-Wei Chang
Course Description Algorithms are: Recipes for solving problems.
Figures & Tables from the textbook.
Huffman Coding.
ECE 551: Digital System Design & Synthesis
Lecture 9 Greedy Strategy
Centrality Bias Measure for High Density QR Code Module Recognition
Design of benchmark circuit s5378 for reduced scan mode activity
Chapter 11 Data Compression
Huffman Coding CSE 373 Data Structures.
Review for Test1.

Figure 11-1.
Low Power Digital Design
Hung, K. -L. and Chang, C. -C. , IEE Image and Signal Processing, vol
Figure Overview.
Figure Overview.
Podcast Ch23d Title: Huffman Compression
Hung, K. -L. and Chang, C. -C. , IEE Image and Signal Processing, vol
Course Description Algorithms are: Recipes for solving problems.
Source: IEEE Transactions on Circuits and Systems,
A Robust Digital Watermarking Of Satellite Image at Third Level DWT Decomposition Source:International Conference on Computational Intelligence and Multimedia.
Presentation transcript:

Low Power Huffman Coding for High Performance Data Transmission Chiu-Yi Chen,Yu-Ting Pai, Shanq-Jang Ruan, International Conference on, ICHIT '06, Nov. 2006, pp, Presenter :Yu-Cheng Cheng

Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results

Introduction Dynamic power dissipation is the dominant fraction of average power dissipation(70%- 90%). That switching activity represents the logic transition.

Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results

Construction of Huffman Tree

Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results

Optimize interior nodes Figure 1. Calculate the switching number

Optimize interior nodes Figure 2. Total switching number before exchanged

Optimize interior nodes Figure 3. Total switching number after exchanged

Outline Introduction Construction of Huffman Tree Optimize interior nodes Experimental results

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.

Experimental results Table 1. Switching number compared with the original Huffman coding

END