A NOVEL MULTIDICTIONARY BASED TEXT COMPRESSION

The amount of digital contents grows at a faster speed as a result does the demand for communicate them. On the other hand, the amount of storage and bandwidth increases at a slower rate. Thus powerful and efficient compression methods are required. The repetition of words and phrases cause the reordered text much more compressible than the original text. On the whole system is fast and achieves close to the best result on the test files. In this study a novel fast dictionary based text compression technique MBRH (Multidictionary with burrows wheeler transforms, Run length coding and Huffman coding) is proposed for the purpose of obtaining improved performance on various document sizes. MBRH algorithm comprises of two stages, the first stage is concerned with the conversion of input text into dictionary based compression .The second stage deals mainly with reduction of the redundancy in multidictionary based compression by using BWT, RLE and Huffman coding. Bib test files of input size of 111, 261 bytes achieves compression ratio of 0.192, bit rate of 1.538 and high speed using MBRH algorithm. The algorithm has attained a good compression ratio, reduction of bit rate and the increase in execution speed.

[1]  Weifeng Sun,et al.  A dictionary-based multi-corpora text compression system , 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

[2]  V. K. Govindan,et al.  Compression scheme for faster and secure data transmission over networks , 2005, International Conference on Mobile Business (ICMB'05).

[3]  David Salomon,et al.  Data Compression: The Complete Reference , 2006 .

[4]  Hussein Al-Bahadili,et al.  A bit-level text compression scheme based on the ACW algorithm , 2010, Int. J. Autom. Comput..

[5]  A. Carus,et al.  Fast Text Compression Using Multiple Static Dictionaries , 2010 .

[6]  Jürgen Abel,et al.  Universal text preprocessing for data compression , 2005, IEEE Transactions on Computers.

[7]  Weifeng Sun,et al.  Dictionary-based fast transform for text compression , 2003, Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing.

[8]  Nur A. Touba,et al.  Test data compression using dictionaries with selective entries and fixed-length indices , 2003, TODE.

[9]  Y. Venkataramani,et al.  LSB Based Audio Steganography Based On Text Compression , 2012 .

[10]  M. Oguzhan Külekci On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression , 2012, Comput. Secur..

[11]  S. Bhadade Umesh,et al.  Lossless Text Compression using Dictionaries , 2011 .

[12]  Jirapond Tadrat,et al.  An Experiment Study on Text Transformation for Compression Using Stoplists and Frequent Words , 2008, Fifth International Conference on Information Technology: New Generations (itng 2008).

[13]  G. Blelloch Introduction to Data Compression * , 2022 .

[14]  Joaquín Adiego,et al.  Natural Language Compression on Edge-Guided text preprocessing , 2011, Inf. Sci..