Improved Adaptive Huffman Compression Algorithm

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2011, Vol 1, Issue 1

Abstract

In information age, sending the data from one end to another endneed lot of space as well as time. Data compression is atechnique to compress the information source (e.g. a data file, aspeech signal, an image, or a video signal) in possible fewnumbers of bits. One of the major factors that influence the DataCompression technique is the procedure to encode the sourcedata and space required for encoded data. There are many datacompressions methods which are used for data compression andout of which Huffman is mostly used for same. Huffmanalgorithms have two ranges static as well as adaptive. StaticHuffman algorithm is a technique that encoded the data in twopasses. In first pass it requires to calculate the frequency of eachsymbol and in second pass it constructs the Huffman tree.Adaptive Huffman algorithm is expanded on Huffman algorithmthat constructs the Huffman tree but take more space than StaticHuffman algorithm. This paper introduces a new datacompression Algorithm which is based on Huffman coding. Thisalgorithm not only reduces the number of pass but also reducethe storage space in compare to adaptive Huffman algorithm andcomparable to static.

Authors and Affiliations

Satpreet Singh, Harmandeep Singh

Keywords

Related Articles

A Simplified Analysis of an Electrical Network with Resistive and/or Reactive Elements

Typically star-delta transformation is adopted in determining the equivalent impedance between two terminals of an electrical network [2]. Shown relevantly in [1] is a simplified approach, less time-consuming to determin...

Assessing the Critical Factors for E-Learning Systems Using Fuzzy TOPSIS and Fuzzy Logic

Assessing the success of Information Systems (ISs) has been identified as one of the most critical issues in IS field. Offering more services and the ease of access is considered as a significant factor for today’s aca...

Imprementation of Sochastic Searching for Complex Processes Identification

This paper presents implementation of stochastic searching method for complex technological process identification. As the first step of control systems design is identification of a process mathematcal model. The author...

RANKING of the E-TRUST FACTORS in ELECTRONIC TRANSACTIONS in the CONTEXT of B2C E-COMMERCE (from the consumers point of view and by using Friedmans ranking method)

Today, a considerable amount of commercial transactions have appertained to the electronic transactions and electronic markets, aside from or versus the traditional markets, have attracted and collected a large number of...

Economic Production Inventory model with the associated costs of internet advertising to acquire customers residing worldwide

In recent times, we are witnessing the technological revolution which provides access to tremendous changes in all the fields including the industrial sectors. The notable benefit of the modern technology is quick accomp...

Download PDF file
  • EP ID EP649777
  • DOI 10.24297/ijct.v1i1.2602
  • Views 97
  • Downloads 0

How To Cite

Satpreet Singh, Harmandeep Singh (2011). Improved Adaptive Huffman Compression Algorithm. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 1(1), 16-22. https://www.europub.co.uk/articles/-A-649777