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

Cultural Differences and Common Regional Challenges for e-Commerce in Asia-Pacific Region

Taking in consideration that the rapid growth using online services last few years becomes more necessary all over the world and on the other side since the internet revolution, it seemed important and useful for all onl...

Predicting Machine Translation Comprehension with a Neural Network

Comprehension of natural language translations is dependent upon several factors including textual variables (grammatical, spelling, and word choice errors, sentence complexity, etc.) and human variables (language fluenc...

Multipath Routing protocol: NCPR and QAMR

Mobile ad hoc network is an assembly of mobile nodes with no centralized server. Due to mobility of nodes and decentralized network it is difficult to maintain the quality of service (QoS) in routing the packets from sou...

A Case Study on Risk Management Practice in Outsourced Software Migration Projects

While there are many studies conducted on software risk during the last two decades, very few have been published on software risk management practice in IT industry. In this paper we explore industry practice in the man...

Virtual Machine Selection Algorithm Based on User Requirements in Mobile Cloud Computing Environment

The article analyzes the advantages of mobile cloud technologies and problems emerging during the use of those. The network infrastructure created based on cloudlets at the second level of mobile cloud computing with hie...

Download PDF file
  • EP ID EP649777
  • DOI 10.24297/ijct.v1i1.2602
  • Views 100
  • 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://europub.co.uk/articles/-A-649777