Hybrid Algorithm for Data Compression Using Genetic and Huffman Algorithm

 
Abstract: 

Text compression plays an important role and it is an essential object to decrease storage size and increase the speed of data transmission through communication channels . In this research , a hybrid compression system is introduced which depends on the genetic algorithm for finding the best Huffman tree which give the best compression ratio, and then applying another compression method named Oring bits  on the results of the primary compression by applying the compression method, and also using a decompression algorithms for both Huffman and Oring bits. The variety in the text characters leads to the variety in the Huffman trees and finally obtaining the best possible compression . In addition, the increase in the frequencies of the text has an affect on the compression rate .Structure of proposed system   Introduction  In this section, Figure (1) illustrates the block diagram for the proposed system and its algorithms, and it has reviewed the system mechanism in compression based on some examples, where it illustrates the compression operation through building the trees and codes  and applying them .Creating the Individual & the Initial Population  First, the text is wanted to be compressed and find the best Huffman tree for it is inputted from the notepad as a file. It has used text files which are read from the proposed system depending on the text; the initial population is created, where an individual is produced and from this individual (chromosome) the other individuals of the population are found randomly.For example: 

 

Dear visitor,  For downloading the full version of the research/article click on the pdf icon above.