Multiple Subgroup Data Compression Technique Based on Huffman Coding
Piyush Kumar Shukla, Pradeep Rusiya, Deepak Agrawal, Lata Chhablani, Balwant Singh Raghuwanshi · 2009
There are so many records compression methods have been introduced to shrink the phrasing/data cargo space and communication costs. The intelligent compression method in this article is based on switching code information compression technique with the utility of adaptive Huffman coding. The programming development of the structure encodes usually occurring characters with shorter bit code and infrequently occurring appearing characters with longer bit codes, same code can be use for three symbols for numbers, alphabet, and special character. The decoding process regenerate the encoded data by expanding the encoded data back to the original data and works very much like the encoder process. Proposed method is more effective than adaptive Huffman coding because it reduce the codeword length of the characters and can be use same codeword for three different groups character. Their size of the symbol-codeword table is also reduces which transmitted with the compressed data. This process enhancing compression efficiency up to 12% more than adaptive Huffman coding which provide compression ratio up to 52.51% (+12%). The propose system is very impressive for compressing text file, which hold numbers and special symbols approximately equi-probable to alphabets like Mathpsilas Books/database files in a real time environment.