Implementation Of A New Binary Tree using Huffman Encoder
K. V. Satyanarayana1, B. Bhaskar Rao2
1K.V.Satyanarayana, ECE Department ,St.Teressa Institute of Engineering and technology. Vizianagaram India.
2B.Bhaskar Rao, HOD , ECE Department ,St.Teressa Institute of Engineering and technology. Vizianagaram, India.
Manuscript received on December 09, 2011. | Revised Manuscript received on December 25, 2011. | Manuscript published on January 05, 2012. | PP: 336-339 | Volume-1 Issue-6, January 2012. | Retrieval Number: F0339121611/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Lossless compression of a sequence of symbols is important in Information theory as well as today’s IT field. Huffman coding is lossless and is most widely used. However, Huffman coding has some limitations depending on the stream of symbols appearing in a file. In fact, Huffman coding generates a code with very few bits for a symbol that has a very high probability of occurrence and a larger number of bits for a symbol with a low probability of occurrence [1]. In this paper, we present a novel technique that subdivides the original symbol sequence into two or more subsequences. We then apply Huffman coding on each of the subsequences. This proposed scheme gives approximately 10-20% better compression in comparison with that of straightforward usage of Huffman coding.
Keywords: Huffman decoding, Table lookup.