Advertisement

Adaptive Region Based Huffman Compression Technique with Selective Code Interchanging

  • Utpal Nandi
  • Jyotsna Kumar Mandal
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 176)

Abstract

Adaptive version of loss-less Region Based Huffman compression techniques are proposed where a proposed region formation algorithm is used to divide the input file into a number of regions that adapts region size depending on the ASCII value difference of symbols. Huffman codes are obtained for entire file after formation of regions. Code interchanging between the maximum frequency element of a region and maximum frequency element of entire file is done before symbols of that region are compressed. Another variation of the technique where region wise interchanging of code is done based on an additional condition. Comparisons are made among these two compression techniques with Region Based Huffman compression technique, Size Adaptive Region Based Huffman compression technique and classical Huffman technique. The proposed techniques offer better results for most of the files.

Keywords

Data compression Huffman tree Frequency Table (FT) Symbol Code Table (SCT) compression ratio Region Based Huffman (RBH) Size Adaptive Region Based Huffman (SARBH) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Nandi, U., Mandal, J.K.: Size Adaptive Region based Huffman Compression. In: National Symposium on Emerging Trends in Computer Science (ETCS), Barrackpore, India (2012)Google Scholar
  2. 2.
    Nandi, U., Mandal, J.K.: Region based Huffman(RB H) Compression Technique with Code Interchange. Malayasian Journal of Computer Science(MJCS), Malayasia 23(2), 111–120 (2010)Google Scholar
  3. 3.
    Mandal, J.K., Kumar, A.: A Compression Technique Based on Optimality of Huffman Tree (OHT). In: 12th International Conference of IEEE on Advanced Computing and Communications, Ahmedabad, India, pp. 589–595 (2004)Google Scholar
  4. 4.
    Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530–536 (1978)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Mandal, J.K., Gangopadhayay, R.: Implementation of Two Data Compression Schemes. In: First International Workshop on Telematics, pp. 154–162. NERIST, India (1995)Google Scholar
  6. 6.
    Reglebati, H.K.: An Overview of Data Compression Techniques. IEEE Computer, 71–75 (1981)Google Scholar
  7. 7.
    Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530–536 (1978)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Welch, T.: A Technique for High-Performance Data Compression. IEEE Computer 17(6), 8–19 (1984)CrossRefGoogle Scholar
  9. 9.
    Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic Coding for Data Compression. Communications of the ACM 30(6), 520–540 (1987)CrossRefGoogle Scholar
  10. 10.
    Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337–343 (1977)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Nelson, M.: The Data Compression Book, 2nd edn. BPB Publications, India (2008)Google Scholar
  12. 12.
    Kanitkar, Y.: C project, 2nd edn. BPB Publications, India (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Dept. of Computer Sc. & Engg.Academy of TechnologyHooghlyIndia
  2. 2.Dept. of Computer Sc. & Engg.University of KalyaniNadiaIndia

Personalised recommendations