Lossless Data Compression and Decompression using Huffman Algorithm

First Review
Project guide, Project of, MR. DHANASEKER Amanda Maricia Raphael

Abstract

Data compression has a wide application in computer software and communication systems. compression includes lossless and lossy. In this project lossless data compression is done using Huffman algorithm. And its Hardware implementation is done using VHDL language.

Objective...
A Hardware implementation of Losseless data compression and decompression using VHDL Language

Existing model..
Shannon-Fano Coding First sort all the symbols in nonincreasing frequency order. Then split this list into two such that probability of one list is half When the split is done, prefix all the codes in the first list with 0 and the second list with 1.

Disadvantages of Existing model...

not always possible to be sure, because we confuse how to split the list. do not always give the optimal code

Proposed model
A Hardware implementation of Losseless data compression and decompression using Huffman coding with the help of VHDL Language.

Lossless Data Compression

Lossless compression techniques reconstruct the original data from the compressed file without any loss of data i.e. the information does not change or loose during the compression and decompression of data.

Also called reversible compression coz the original message is reconstructed by the decompression process [

Huffman coding
Proposed by David A. Huffman Used for the Construction of Minimum Redundancy Codes.

It is a lossless data compression algorithm based on variable-length code table. The higher probability of symbol occurrence, the shorter code word length will be used and length of a whole message shorter

Huffman Algorithm
The Huffman algorithm works by creating a binary tree. The length of the binary tree depends on the number of symbols. A node of tree can be either a leaf node or an internal node.

Process of creating a binary tree

Step 1: List the source symbols in descending order of their probabilities of occurrence. Step 2: Form a compound symbol with the two symbols.

The combination of the two symbols forms a branch in the tree.

This step is repeated using two symbols with the lowest possibility from the new set of symbols until all the original symbols have been combined into a single compound symbol. Step 3: A tree is formed, with the top and bottom stems going from the compound symbol to the symbols which form it, labeled with 0 and 1

Example
msg- ABRACADABAR

symbol A B R C D sum

occurence 5 2 2 1 1 11

probability 5/11 2/11 2/11 1/11 1/11

codeword 0 10 110 1110 1111

calculation..
Avg search length Avg L = Li * P (i) =5/11*1+2/11*3+2/11*2+1/11*4+1 /11*4=23/11 = 2.090 Space required to store the original message=11*8=88 bits Space required to store the decoded message=23 bits

Literature Survey...
1. Data Compression Scheme Of
Dynamic Huffman code for Different Languages By Shivani Pathak ,Smita Singh
This paper paper examines lossless data compression on languages and compares the performance based on huffman coding

2.Implementation and Verification of

Huffman Coding System by Shiliang Lu, Qiyun Zhang, and Cheng Li In this paper, we discuss the hardware
implementation of the Huffman coding using VHDL language.

3.A NEW LOSSLESS METHOD OF IMAGE

COMPRESSION AND DECOMPRESSION USING HUFFMAN CODING TECHNIQUES 1JAGADISH H. PUJAR, 2LOHIT In this paper we proposed the Lossless method of image compression and decompression using a simple coding technique called Huffman coding. This technique is simple in implementation and utilizes less memory. A software algorithm has been developed and implemented to compress and decompress the given image using Huffman coding techniques in a MATLAB platform.

4.LOSSLESS HUFFMAN CODING

TECHNIQUE FOR IMAGE COMPRESSION AND RECONSTRUCTION USING BINARY TREES 1Mridul Kumar Mathur, 2Seema Loonker, 3Dr. Dheeraj Saxena In this paper we have converted an image into an array using Delphi image control tool. to implement Huffman coding method that removes redundant codes from the image and compresses

Reference
[1] T. Bell, J. G. Clearly and I. H. Witten, Text
Compression. Prentice Hall Reference Series, 1990. [2] D. A. Huffman, A Method for the Construction of Minimum Redundancy Codes, Proceedings of the Institute of Radio Engineers, n. 40, pp. 1098-1101, 1952. [3] C. E. Shannon, C. E. A Mathematical Theory of Communication, Bell Syst. Tech. J., pp. 379-423, 1948. [4] S. H. Sun and S.J. Lee. A JPEG Chip for Image Compression and Decompression, Journal of VLSI Signal Processing, Kluwer Academic Publishers, pp. 43 60, August 2003.

Queries????