A Compression Technique Based On Optimality Of LZW Code (OLZW)

Size: px
Start display at page:

Download "A Compression Technique Based On Optimality Of LZW Code (OLZW)"

Transcription

1 2012 Third International Conference on Computer and Communication Technology A Compression Technique Based On Optimality Of LZW (OLZW) Utpal Nandi Dept. of Comp. Sc. & Engg. Academy Of Technology Hooghly ,West Bengal, India nandi.3utpal@gmail.com Jyotsna Kumar Mandal Dept. of Comp. Sc. & Engg. University of Kalyani Nadia , West Bengal, India jkm.cse@gmail.com Abstract A lossless dictionary based data compression technique has been proposed in this paper which is based on the optimality of LZW code. The compression process is started with empty dictionary and if the next symbol to be encoded is already in dictionary, length of symbol code is determined by the highest symbol code in the dictionary and encoded with the code in the dictionary. Otherwise, the symbol is encoded with 8-bit ASCII code. Some of the limitations of LZW compression technique have been eliminated in the proposed compression technique. Comparisons are made between proposed technique and two different version of LZW data compression technique which shows that the proposed technique works well for small size files particularly. Keywords- Data compression; compression ratio; LZW; dictionary-based compression; OLZW I. INTRODUCTION Data compression techniques [7, 8] are deployed to reduce the number of bits used to store or transmit information which are divided into two major families; lossless [1-8] and lossy [8]. Loss-less compression consists of whose techniques guaranteed to generate an exact duplicate of the input file/stream after compress/expand cycle. But, the lossy data compression concedes a certain loss of accuracy in exchange for greatly increased compression. A dictionarybased loss-less data compression technique [1, 2, 8] is proposed in this paper based on LZW technique [1]. Initially, the dictionary is empty. Therefore, the available code values are started from 1 instead of 256 as in LZW. If the next symbol to be encoded is already in dictionary, length of symbol code is determined by the highest symbol code in the dictionary and is encoded with symbol code of the symbol in the dictionary with calculated length. But, the symbol to be encoded not in dictionary is encoded with 8-bit ASCII code. Thus, some of the weaknesses of LZW technique are overcome. The LZW coding technique and its limitations are discussed in section II. The proposed coding technique is discussed in section III in details. Results are given in section IV and conclusions are drawn in section V. II. THE LZW TECHNIQUE AND IT S LIMITATIONS The LZW coding technique was developed by Terry Welch in The method starts by initializing the dictionary to all 256 symbols in the alphabet. Therefore, the first 256 entries of the dictionary (0 to 255) are occupied before any data is input and the next free code value started from 256. The method reads symbols one by one and accumulates them into a string S. After each symbol is input and is concatenated to S, the dictionary is searched for string S. As long as the S is found in the dictionary, the process continues. At a certain point, adding the next symbol C causes the search to fail. The string S is in the dictionary but, string SC (Symbol C concatenated to S) is not. At this point, the encoder outputs the dictionary pointer that points to string S, saves string SC (which is now called phrase) in the next available dictionary entry and initializes string S to symbol C. This is now repeated for remaining symbols until end of symbol. The decoding process is also started by initializing the dictionary to all 256 symbols in the alphabet. Then, it reads its input stream (which consists of pointers to the dictionary) and uses each pointer to retrieve uncompressed symbols from its dictionary and write them on its output file/stream. It does not need to receive the dictionary from compressor. It builds its dictionary in the same way as the encoder. That is, encoder and decoder are synchronized. One version of LZW coding (LZW12) uses a fixed size 12 bit code to encode each phrase of the dictionary. But, 12 bits code size allows for a 4K phrase dictionary which is not enough for large file/stream. LZW is improved by increasing the size of the dictionary. The more powerful improved version of LZW coding (LZW15V) contains several enhancements. First, it expands the maximum code size to 15 bits. Second, it starts encoding with 9 bit codes, working its way up in bits size only as necessary. Finally, it flushes the dictionary when the dictionary is filled up with phrases. But, there are some limitations remaining in the improved version of LZW. First, in LZW technique, the dictionary is initialized to all the symbols in the alphabet at the beginning of the encoding processes. Some symbols in the dictionary may not be used during encoding of some files/streams. But, the unused symbols occupy some code values that cannot be used for other necessary phrases of dictionary. Available code values can be represented by more bits compare to code values of unused symbols. It increases the size of compressed file/stream. Another problem is that at the beginning of the encoding process, the next available code value (256) can be represented by at least 9 bits. Because, first 256 code values (0 to 255) are occupied by 256 symbols of the alphabet. These large length available codes of phrases increase the size of compressed file/stream. To overcome these /12 $ IEEE DOI /ICCCT

2 limitations, a coding technique is proposed and described in section III. III. OPTIMALITY OF LZW CODES AND THE PROPOSED COMPRESSION TECHNIQUE Optimality of LZW codes can be achieved by starting the encoding process with empty dictionary. First phrase to be entered into the dictionary should has code values 1 which can be represented using only single bit. The 2 nd and 3 rd phrases to be entered into the dictionary should have code values 2 and 3 and can be represented by 2 bits. Similarly, 3 bits are required for 4 th to 7 th phrases to be entered into the dictionary and so on. This is in contrast to LZW coding where fist 256 phrases entered initially into the dictionary are represented by 8bits per phrase. Therefore, significant reduction of number of bits can be done by optimization of LZW codes. This concept is applied in the proposed technique. The proposed coding technique is started with a empty dictionary initially. Any symbol or phrase that is not used should not be in the dictionary. Therefore, the first available phrase code value is 1. The code assignment of phrase is started with code value 1 that can be represented using only one bit long. The encoding process read symbols one by one. If the next phrase to be encoded is already in dictionary, length (say, x) of phrase code is determined by the highest phrase code in the dictionary. If the highest phrase code in the dictionary is h, then the value of x is one that satisfy 2 x-1 <=h<2 x. Then, the phrase is encoded with x bits phrase code of the corresponding phrase in the dictionary. In this way, the optimization of phrases code is done. But, the symbol to be encoded not in dictionary is encoded with 8-bit ASCII code and entered into the dictionary as a new phrase with next available code value. A 1 bit flag is used to distinguish above two possibilities. The proposed technique is termed as A compression technique based on optimality of LZW code (OLZW). The advantage of the proposed technique is that it does not bring any symbol until needed and encoding of phrase code is done by optimum code length, not the fixed length code. The complete OLZW compression and decompression algorithms are shown in Fig. 1 and Fig. 2 respectively. For example, let us consider a file/stream containing the message- BPQSBPQBPQQBPQ ABPQTB (say, MSG1). The compression steps of MSG1 using OLZW technique are shown in table I. The first symbol B is input. But, B is not in dictionary. Therefore, the encoder outputs ASCII code of B with single bit flag 0 and the symbol B is kept as new phrase with code value 1 in dictionary. Similarly, the encoder outputs ASCII codes of P, Q, S with corresponding flags 0 for input P, Q, S respectively and the symbols P, Q, S are kept with code value 2, 3, 4 respectively. The next symbol B is input which is already in dictionary. Then, the next symbol (P) is input. But, the string BP is not in dictionary. The encoder outputs code of B (i.e.1) from dictionary represented by 3 bits with single bit flag 1.Then, the next symbol (P) is input. But, the string BP is not in Initially, the dictionary is empty and initialize next_code=1,s=null, Flag=0; C=first character from input file/stream; Add C to dictionary with code value as While (not end of input file/stream) do C=next character from input file/stream; If (S+C is in dictionary), then Flag=1; S=S+C; Add S+C to dictionary with code value as If (Flag=0), then S=NULL; x=find_code_length (next_code-1); Output flag with x bits code for C from dictionary; If(C is not in dictionary), then Flag=0; Add C to dictionary with code value as S=C; Flag=1; End while; If (Flag=1), then x= find_code_length (next_code-1); Output flag with x bits code for S from dictionary; End; Figure 1. OLZW compression algorithm. dictionary. The encoder outputs code of B (i.e.1) from dictionary represented by 3 bits with single bit flag 1. As the highest code value of dictionary is currently 4, the length of the code is 3 bits long. The string BP is kept in dictionary as new phrase with code value 5 and initializes string as P. The symbol P is already in dictionary. The next symbol Q is input. But, the string PQ is not in dictionary. Similarly, the encoder finds the code length as 3 bits and outputs code of P represented by 3 bits with single bit flag 1. All other symbols are encoded similarly until end of file. Finally, a special code value 0 is output for End_Of_File marker. The compressed message of MSG1 is 0B0P0Q0S1<1>1<2>1<3> 1<5>1<3>1<7>1<6>0A1<8>0T 1<0> (say, MSG2). Size of MSG1 is 20x8 bits = 160 bits. Size of MSG3 is (1x15+3x4+4x5+8x6) bits = 95 bits. The compression ratio 167

3 is {1-(95/160)}x100% = 40.62%. The decompression steps of MSG2 using OLZW technique are shown in table II. First flag is input. As flag=0, the decoder inputs 8 bits ASCII code of a symbol B and output the same. As the next three flags are also 0, decoder does the same operation. The next flag is 1. Therefore, decoder calculates code length as 3 and inputs 3 bits to obtain the code value (1). Then, the code value is translated into phrase B from dictionary and outputs phrase B. Similarly, all other codes are decoded depending on the value of flags until code value of end of file /stream is not read. Initially, the dictionary is empty and initialize next_code=1, S=NULL; Flag= First one bit from compressed file/stream. While (not end of compressed file/stream) do If (Flag=0), then C=next 8 bits from compressed file/stream; Add S+C to the dictionary with code value as Output C; If(C is not in dictionary), then Add C to dictionary with code value as End if S=NULL; P=0; x= find_code_length (next_code-1); C=next 8 bits from compressed file/stream; Y= translation of C; Output phrase Y; If (P=1), then Add (S + first character of Y) to dictionary with code value as S=Y; P=1; Flag= next one 1 bit from compressed file/stream; End while; End ; Figure 2. OLZW decompression algorithm IV. RESULTS AND COMPARISMS The comparison among LZW12, LZW15V (two version of LZW) coding and proposed OLZW coding have been made in table III. The graphical representations of compression ratios of LZW12, LZW15V and proposed OLZW coding techniques for different increasing size C source file, text files, document files and java files each of five are shown in Fig. 3, Fig. 4, Fig. 5 and Fig. 6 respectively. For all type of small files, the compression ratios are better than LZW12 and LZW15V for most of the time. Also, the compression ratios of OLZW for large size files are better than LZW12 and close to the compression ratios of LZW15V, but not so well for some time. V. CONCLUSION The proposed OLZW technique eliminates some of the problems of the LZW coding and enhances the performance of the same. The proposed technique works very well for particularly small size files most of the time than two versions of LZW (i.e. LZW12 and LZW15V). And the performances of OLZW are not so poor for large size files also. It offers better compressions for large size files than LZW12 most of the time. The compression rates of OLZW for large size files are not as well as LZW15V, but close to it. The proposed technique has a great scope of modifications to make it suitable for large size files also by populating the dictionary with combination of character of phrase instead of the phrase itself and removing phrases not used for longest period of time if the dictionary gets full. It can also be used for image compression. TABLE I. (in dict?) COMPRESSION OF MSG1 USING OLZW Flag Output (length) value Dictionary B B (N) 0 B (8) 1 B P P (N) 0 P (8) 2 P Q Q (N) 0 Q (8) 3 Q S S (N) 0 S (8) 4 S B B (Y) P BP (N) 1 1(3) 5 BP P (Y) Q PQ (N) 1 2(3) 6 PQ B QB (N) 1 3(3) 7 QB B (Y) P BP (Y) Q BPQ (N) 1 5(3) 8 BPQ Q QQ (N) 1 3(4) 9 QQ B QB P QBP (N) 1 7(4) 10 QBP P (Y) Q PQ (Y) A PQA (N) 1 6(4) 11 PQA A (N) 0 A (8) 12 A B B (Y) P BP (Y) Q BPQ (Y) T BPQT (N) 1 8(4) 13 BPQT T (N) 0 T (8) 14 T <EOF> (Y) 1 0(4) 168

4 TABLE II. DECOMPRESSION OF MSG2 USING OLZW Flag value (length ) Output phrase value Dictionary 0 B (8) B 1 B 0 P (8) P 2 P 0 Q (8) Q 3 Q 0 S (8) S 4 S 1 1(3) B 1 2(3) P 5 BP 1 3(3) Q 6 PQ 1 5(3) BP 7 QB 1 3(3) Q 8 BPQ 1 7(4) QB 9 QQ 1 6(4) PQ 10 QBP 0 A (8) A 11 PQA 12 A 1 8(4) BPQ 0 T (8) T 1 0(4) 13 BPQT 14 T Figure 4. Compression ratios of text files TABLE III. COMPARISON OF COMPRESSION RATIOS File Name File Size in Bytes LZW12 %compression LZW15V Proposed OLZW y1.c y2.c y3.c y4.c y5.c x1.txt x2.txt x3.txt x4.txt x5.txt z1.doc z2.doc z3.doc z4.doc z5.doc j1.java j2.java j3.java j4.java j5.java Figure 5. Compression ratios of document files Figure 6. Compression ratios of java files VI. ACKNOWLEDGMENT The authors extend sincere thanks to the department of Computer Science and Engineering and PURSE Scheme of DST, Govt. of India and Academy Of Technology, Hooghly, West Bengal, India for using the infrastructure facilities for developing the technique. Figure 3. Compression ratios of C source files REFERENCES [1] M. Nelson, LZW Data Compression, in Dr. Dobb s Journal, Vol. 14, No. 10, October 1989, pp [2] J. Ziv, A. Lempel, A universal algorithm for sequential data compression, in IEEE Transactions on Information Theory, Vol. 23, No. 3, May 1977, pp

5 [3], Region based Huffman(RB H) Compression Technique with Interchange, Malayasian Journal of Computer Science(MJCS), Malayasia,Vol.23, No. 2, September 2010, pp [4], A. Kumar, A Compression Technique Based on Optimality of Huffman Tree (OHT), in Proceedings of 12 th International Conference of IEEE on Advanced Computing and Communications - ADCOM-2004, December 15-18, 2004, Ahmedabad, India, pp [5] J. Ziv, and A. Lempel, Compression of individual sequences via variable-rate coding, in IEEE Transactions on Information Theory, Vol. 24, No.5, September 1978, pp [6], and R.Gangopadhayay, Implementation of Two Data Compression Schemes, in Proc. First International Workshop on Telematics, NERIST, India, 1995, pp [7] H. K. Reglebati, An Overview of Data Compression Techniques, in IEEE Computer, April 1981,pp [8] M. Nelson, The Data Compression Book,ed. Second, India, BPB Publications, [9] Welch, Terry, A Technique for High-Performance Data Compression, in IEEE Computer, Vol. 17, No.6, June 1984, pages [10] Y. Kanitkar, C project, ed.second, India, BPB Publications,

COMPARATIVE STUDY AND ANALYSIS OF ADAPTIVE REGION BASED HUFFMAN COMPRESSION TECHNIQUES

COMPARATIVE STUDY AND ANALYSIS OF ADAPTIVE REGION BASED HUFFMAN COMPRESSION TECHNIQUES COMPARATIVE STUDY AND ANALYSIS OF ADAPTIVE REGION BASED HUFFMAN COMPRESSION TECHNIQUES Utpal Nandi 1 and Jyotsna Kumar Mandal 2 1 Dept. of Comp. Sc. & Engg., Academy Of Technology, West Bengal, India nandi.3utpal@gmail.com

More information

Data Compression. An overview of Compression. Multimedia Systems and Applications. Binary Image Compression. Binary Image Compression

Data Compression. An overview of Compression. Multimedia Systems and Applications. Binary Image Compression. Binary Image Compression An overview of Compression Multimedia Systems and Applications Data Compression Compression becomes necessary in multimedia because it requires large amounts of storage space and bandwidth Types of Compression

More information

Journal of Computer Engineering and Technology (IJCET), ISSN (Print), International Journal of Computer Engineering

Journal of Computer Engineering and Technology (IJCET), ISSN (Print), International Journal of Computer Engineering Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume

More information

EE-575 INFORMATION THEORY - SEM 092

EE-575 INFORMATION THEORY - SEM 092 EE-575 INFORMATION THEORY - SEM 092 Project Report on Lempel Ziv compression technique. Department of Electrical Engineering Prepared By: Mohammed Akber Ali Student ID # g200806120. ------------------------------------------------------------------------------------------------------------------------------------------

More information

HARDWARE IMPLEMENTATION OF LOSSLESS LZMA DATA COMPRESSION ALGORITHM

HARDWARE IMPLEMENTATION OF LOSSLESS LZMA DATA COMPRESSION ALGORITHM HARDWARE IMPLEMENTATION OF LOSSLESS LZMA DATA COMPRESSION ALGORITHM Parekar P. M. 1, Thakare S. S. 2 1,2 Department of Electronics and Telecommunication Engineering, Amravati University Government College

More information

Analysis of Parallelization Effects on Textual Data Compression

Analysis of Parallelization Effects on Textual Data Compression Analysis of Parallelization Effects on Textual Data GORAN MARTINOVIC, CASLAV LIVADA, DRAGO ZAGAR Faculty of Electrical Engineering Josip Juraj Strossmayer University of Osijek Kneza Trpimira 2b, 31000

More information

Multimedia Systems. Part 20. Mahdi Vasighi

Multimedia Systems. Part 20. Mahdi Vasighi Multimedia Systems Part 2 Mahdi Vasighi www.iasbs.ac.ir/~vasighi Department of Computer Science and Information Technology, Institute for dvanced Studies in asic Sciences, Zanjan, Iran rithmetic Coding

More information

Lempel-Ziv-Welch (LZW) Compression Algorithm

Lempel-Ziv-Welch (LZW) Compression Algorithm Lempel-Ziv-Welch (LZW) Compression lgorithm Introduction to the LZW lgorithm Example 1: Encoding using LZW Example 2: Decoding using LZW LZW: Concluding Notes Introduction to LZW s mentioned earlier, static

More information

FPGA based Data Compression using Dictionary based LZW Algorithm

FPGA based Data Compression using Dictionary based LZW Algorithm FPGA based Data Compression using Dictionary based LZW Algorithm Samish Kamble PG Student, E & TC Department, D.Y. Patil College of Engineering, Kolhapur, India Prof. S B Patil Asso.Professor, E & TC Department,

More information

Study of LZ77 and LZ78 Data Compression Techniques

Study of LZ77 and LZ78 Data Compression Techniques Study of LZ77 and LZ78 Data Compression Techniques Suman M. Choudhary, Anjali S. Patel, Sonal J. Parmar Abstract Data Compression is defined as the science and art of the representation of information

More information

OPTIMIZATION OF LZW (LEMPEL-ZIV-WELCH) ALGORITHM TO REDUCE TIME COMPLEXITY FOR DICTIONARY CREATION IN ENCODING AND DECODING

OPTIMIZATION OF LZW (LEMPEL-ZIV-WELCH) ALGORITHM TO REDUCE TIME COMPLEXITY FOR DICTIONARY CREATION IN ENCODING AND DECODING Asian Journal Of Computer Science And Information Technology 2: 5 (2012) 114 118. Contents lists available at www.innovativejournal.in Asian Journal of Computer Science and Information Technology Journal

More information

Information Technology Department, PCCOE-Pimpri Chinchwad, College of Engineering, Pune, Maharashtra, India 2

Information Technology Department, PCCOE-Pimpri Chinchwad, College of Engineering, Pune, Maharashtra, India 2 Volume 5, Issue 5, May 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Adaptive Huffman

More information

International Journal of Advanced Research in Computer Science and Software Engineering

International Journal of Advanced Research in Computer Science and Software Engineering ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhanced LZW (Lempel-Ziv-Welch) Algorithm by Binary Search with

More information

A New Compression Method Strictly for English Textual Data

A New Compression Method Strictly for English Textual Data A New Compression Method Strictly for English Textual Data Sabina Priyadarshini Department of Computer Science and Engineering Birla Institute of Technology Abstract - Data compression is a requirement

More information

Data Compression. Media Signal Processing, Presentation 2. Presented By: Jahanzeb Farooq Michael Osadebey

Data Compression. Media Signal Processing, Presentation 2. Presented By: Jahanzeb Farooq Michael Osadebey Data Compression Media Signal Processing, Presentation 2 Presented By: Jahanzeb Farooq Michael Osadebey What is Data Compression? Definition -Reducing the amount of data required to represent a source

More information

Image Compression for Mobile Devices using Prediction and Direct Coding Approach

Image Compression for Mobile Devices using Prediction and Direct Coding Approach Image Compression for Mobile Devices using Prediction and Direct Coding Approach Joshua Rajah Devadason M.E. scholar, CIT Coimbatore, India Mr. T. Ramraj Assistant Professor, CIT Coimbatore, India Abstract

More information

Category: Informational May DEFLATE Compressed Data Format Specification version 1.3

Category: Informational May DEFLATE Compressed Data Format Specification version 1.3 Network Working Group P. Deutsch Request for Comments: 1951 Aladdin Enterprises Category: Informational May 1996 DEFLATE Compressed Data Format Specification version 1.3 Status of This Memo This memo provides

More information

Comparative Study of Dictionary based Compression Algorithms on Text Data

Comparative Study of Dictionary based Compression Algorithms on Text Data 88 Comparative Study of Dictionary based Compression Algorithms on Text Data Amit Jain Kamaljit I. Lakhtaria Sir Padampat Singhania University, Udaipur (Raj.) 323601 India Abstract: With increasing amount

More information

THE RELATIVE EFFICIENCY OF DATA COMPRESSION BY LZW AND LZSS

THE RELATIVE EFFICIENCY OF DATA COMPRESSION BY LZW AND LZSS THE RELATIVE EFFICIENCY OF DATA COMPRESSION BY LZW AND LZSS Yair Wiseman 1* * 1 Computer Science Department, Bar-Ilan University, Ramat-Gan 52900, Israel Email: wiseman@cs.huji.ac.il, http://www.cs.biu.ac.il/~wiseman

More information

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY Rashmi Gadbail,, 2013; Volume 1(8): 783-791 INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK EFFECTIVE XML DATABASE COMPRESSION

More information

Textual Data Compression Speedup by Parallelization

Textual Data Compression Speedup by Parallelization Textual Data Compression Speedup by Parallelization GORAN MARTINOVIC, CASLAV LIVADA, DRAGO ZAGAR Faculty of Electrical Engineering Josip Juraj Strossmayer University of Osijek Kneza Trpimira 2b, 31000

More information

An Efficient Implementation of LZW Compression in the FPGA

An Efficient Implementation of LZW Compression in the FPGA An Efficient Implementation of LZW Compression in the FPGA Xin Zhou, Yasuaki Ito and Koji Nakano Department of Information Engineering, Hiroshima University Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527

More information

Keywords Data compression, Lossless data compression technique, Huffman Coding, Arithmetic coding etc.

Keywords Data compression, Lossless data compression technique, Huffman Coding, Arithmetic coding etc. Volume 6, Issue 2, February 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Comparative

More information

Encoding. A thesis submitted to the Graduate School of University of Cincinnati in

Encoding. A thesis submitted to the Graduate School of University of Cincinnati in Lossless Data Compression for Security Purposes Using Huffman Encoding A thesis submitted to the Graduate School of University of Cincinnati in a partial fulfillment of requirements for the degree of Master

More information

Image coding and compression

Image coding and compression Image coding and compression Robin Strand Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University Today Information and Data Redundancy Image Quality Compression Coding

More information

Ch. 2: Compression Basics Multimedia Systems

Ch. 2: Compression Basics Multimedia Systems Ch. 2: Compression Basics Multimedia Systems Prof. Ben Lee School of Electrical Engineering and Computer Science Oregon State University Outline Why compression? Classification Entropy and Information

More information

LZW Compression. Ramana Kumar Kundella. Indiana State University December 13, 2014

LZW Compression. Ramana Kumar Kundella. Indiana State University December 13, 2014 LZW Compression Ramana Kumar Kundella Indiana State University rkundella@sycamores.indstate.edu December 13, 2014 Abstract LZW is one of the well-known lossless compression methods. Since it has several

More information

SSIM based image quality assessment for vector quantization based lossy image compression using LZW coding

SSIM based image quality assessment for vector quantization based lossy image compression using LZW coding Available online at www.ganpatuniversity.ac.in University Journal of Research ISSN (Online) 0000 0000, ISSN (Print) 0000 0000 SSIM based image quality assessment for vector quantization based lossy image

More information

An Advanced Text Encryption & Compression System Based on ASCII Values & Arithmetic Encoding to Improve Data Security

An Advanced Text Encryption & Compression System Based on ASCII Values & Arithmetic Encoding to Improve Data Security Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 10, October 2014,

More information

Design and Implementation of FPGA- based Systolic Array for LZ Data Compression

Design and Implementation of FPGA- based Systolic Array for LZ Data Compression Design and Implementation of FPGA- based Systolic Array for LZ Data Compression Mohamed A. Abd El ghany Electronics Dept. German University in Cairo Cairo, Egypt E-mail: mohamed.abdel-ghany@guc.edu.eg

More information

An Improved Reversible Data-Hiding Scheme for LZW Codes

An Improved Reversible Data-Hiding Scheme for LZW Codes International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2016) An Improved Reversible Data-Hiding Scheme for LZW Codes Wenqiang Zhao a, Bailong Yang b, Shizhong

More information

A Research Paper on Lossless Data Compression Techniques

A Research Paper on Lossless Data Compression Techniques IJIRST International Journal for Innovative Research in Science & Technology Volume 4 Issue 1 June 2017 ISSN (online): 2349-6010 A Research Paper on Lossless Data Compression Techniques Prof. Dipti Mathpal

More information

WIRE/WIRELESS SENSOR NETWORKS USING K-RLE ALGORITHM FOR A LOW POWER DATA COMPRESSION

WIRE/WIRELESS SENSOR NETWORKS USING K-RLE ALGORITHM FOR A LOW POWER DATA COMPRESSION WIRE/WIRELESS SENSOR NETWORKS USING K-RLE ALGORITHM FOR A LOW POWER DATA COMPRESSION V.KRISHNAN1, MR. R.TRINADH 2 1 M. Tech Student, 2 M. Tech., Assistant Professor, Dept. Of E.C.E, SIR C.R. Reddy college

More information

DEFLATE COMPRESSION ALGORITHM

DEFLATE COMPRESSION ALGORITHM DEFLATE COMPRESSION ALGORITHM Savan Oswal 1, Anjali Singh 2, Kirthi Kumari 3 B.E Student, Department of Information Technology, KJ'S Trinity College Of Engineering and Research, Pune, India 1,2.3 Abstract

More information

Design and Implementation of Lossless Data Compression Coprocessor using FPGA

Design and Implementation of Lossless Data Compression Coprocessor using FPGA Design and Implementation of Lossless Data Compression Coprocessor using FPGA Udaya Kumar H PG Student(VLSI Design and Embedded Systems) SIET, Tumkur Karnataka, India Madhu B C Assistant Prof., Dept. of

More information

Optimized Compression and Decompression Software

Optimized Compression and Decompression Software 2015 IJSRSET Volume 1 Issue 3 Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Engineering and Technology Optimized Compression and Decompression Software Mohd Shafaat Hussain, Manoj Yadav

More information

Comparative data compression techniques and multi-compression results

Comparative data compression techniques and multi-compression results IOP Conference Series: Materials Science and Engineering OPEN ACCESS Comparative data compression techniques and multi-compression results To cite this article: M R Hasan et al 2013 IOP Conf. Ser.: Mater.

More information

Dictionary Based Compression for Images

Dictionary Based Compression for Images Dictionary Based Compression for Images Bruno Carpentieri Abstract Lempel-Ziv methods were original introduced to compress one-dimensional data (text, object codes, etc.) but recently they have been successfully

More information

Simple variant of coding with a variable number of symbols and fixlength codewords.

Simple variant of coding with a variable number of symbols and fixlength codewords. Dictionary coding Simple variant of coding with a variable number of symbols and fixlength codewords. Create a dictionary containing 2 b different symbol sequences and code them with codewords of length

More information

Implementation of Robust Compression Technique using LZ77 Algorithm on Tensilica s Xtensa Processor

Implementation of Robust Compression Technique using LZ77 Algorithm on Tensilica s Xtensa Processor 2016 International Conference on Information Technology Implementation of Robust Compression Technique using LZ77 Algorithm on Tensilica s Xtensa Processor Vasanthi D R and Anusha R M.Tech (VLSI Design

More information

ITCT Lecture 8.2: Dictionary Codes and Lempel-Ziv Coding

ITCT Lecture 8.2: Dictionary Codes and Lempel-Ziv Coding ITCT Lecture 8.2: Dictionary Codes and Lempel-Ziv Coding Huffman codes require us to have a fairly reasonable idea of how source symbol probabilities are distributed. There are a number of applications

More information

A Novel Image Compression Technique using Simple Arithmetic Addition

A Novel Image Compression Technique using Simple Arithmetic Addition Proc. of Int. Conf. on Recent Trends in Information, Telecommunication and Computing, ITC A Novel Image Compression Technique using Simple Arithmetic Addition Nadeem Akhtar, Gufran Siddiqui and Salman

More information

EE67I Multimedia Communication Systems Lecture 4

EE67I Multimedia Communication Systems Lecture 4 EE67I Multimedia Communication Systems Lecture 4 Lossless Compression Basics of Information Theory Compression is either lossless, in which no information is lost, or lossy in which information is lost.

More information

An Asymmetric, Semi-adaptive Text Compression Algorithm

An Asymmetric, Semi-adaptive Text Compression Algorithm An Asymmetric, Semi-adaptive Text Compression Algorithm Harry Plantinga Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 planting@cs.pitt.edu Abstract A new heuristic for text

More information

A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to Enhance the Information Security

A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to Enhance the Information Security A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to Enhance the Information Security Manas Paul 1 and Jyotsna Kumar Mandal 2 1 Dept. of Comp. Application, JIS College of Engineering,

More information

IMAGE COMPRESSION TECHNIQUES

IMAGE COMPRESSION TECHNIQUES IMAGE COMPRESSION TECHNIQUES A.VASANTHAKUMARI, M.Sc., M.Phil., ASSISTANT PROFESSOR OF COMPUTER SCIENCE, JOSEPH ARTS AND SCIENCE COLLEGE, TIRUNAVALUR, VILLUPURAM (DT), TAMIL NADU, INDIA ABSTRACT A picture

More information

Network Working Group Request for Comments: January IP Payload Compression Using ITU-T V.44 Packet Method

Network Working Group Request for Comments: January IP Payload Compression Using ITU-T V.44 Packet Method Network Working Group Request for Comments: 3051 Category: Informational J. Heath J. Border Hughes Network Systems January 2001 IP Payload Compression Using ITU-T V.44 Packet Method Status of this Memo

More information

Lossless Compression Algorithms

Lossless Compression Algorithms Multimedia Data Compression Part I Chapter 7 Lossless Compression Algorithms 1 Chapter 7 Lossless Compression Algorithms 1. Introduction 2. Basics of Information Theory 3. Lossless Compression Algorithms

More information

15 Data Compression 2014/9/21. Objectives After studying this chapter, the student should be able to: 15-1 LOSSLESS COMPRESSION

15 Data Compression 2014/9/21. Objectives After studying this chapter, the student should be able to: 15-1 LOSSLESS COMPRESSION 15 Data Compression Data compression implies sending or storing a smaller number of bits. Although many methods are used for this purpose, in general these methods can be divided into two broad categories:

More information

Engineering Mathematics II Lecture 16 Compression

Engineering Mathematics II Lecture 16 Compression 010.141 Engineering Mathematics II Lecture 16 Compression Bob McKay School of Computer Science and Engineering College of Engineering Seoul National University 1 Lossless Compression Outline Huffman &

More information

Department of electronics and telecommunication, J.D.I.E.T.Yavatmal, India 2

Department of electronics and telecommunication, J.D.I.E.T.Yavatmal, India 2 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY LOSSLESS METHOD OF IMAGE COMPRESSION USING HUFFMAN CODING TECHNIQUES Trupti S Bobade *, Anushri S. sastikar 1 Department of electronics

More information

SIGNAL COMPRESSION Lecture Lempel-Ziv Coding

SIGNAL COMPRESSION Lecture Lempel-Ziv Coding SIGNAL COMPRESSION Lecture 5 11.9.2007 Lempel-Ziv Coding Dictionary methods Ziv-Lempel 77 The gzip variant of Ziv-Lempel 77 Ziv-Lempel 78 The LZW variant of Ziv-Lempel 78 Asymptotic optimality of Ziv-Lempel

More information

Lempel-Ziv-Welch Compression

Lempel-Ziv-Welch Compression Lempel-Ziv-Welch Compression Brad Karp UCL Computer Science CS 3007 6 th February 2018 (lecture notes derived from material from Hari Balakrishnan, Katrina LaCurts, and Terry Welch) 1 The Compression Problem

More information

Noise Reduction in Data Communication Using Compression Technique

Noise Reduction in Data Communication Using Compression Technique Digital Technologies, 2016, Vol. 2, No. 1, 9-13 Available online at http://pubs.sciepub.com/dt/2/1/2 Science and Education Publishing DOI:10.12691/dt-2-1-2 Noise Reduction in Data Communication Using Compression

More information

A novel lossless data compression scheme based on the error correcting Hamming codes

A novel lossless data compression scheme based on the error correcting Hamming codes Computers and Mathematics with Applications 56 (2008) 143 150 www.elsevier.com/locate/camwa A novel lossless data compression scheme based on the error correcting Hamming codes Hussein Al-Bahadili Department

More information

AN ANALYTICAL STUDY OF LOSSY COMPRESSION TECHINIQUES ON CONTINUOUS TONE GRAPHICAL IMAGES

AN ANALYTICAL STUDY OF LOSSY COMPRESSION TECHINIQUES ON CONTINUOUS TONE GRAPHICAL IMAGES AN ANALYTICAL STUDY OF LOSSY COMPRESSION TECHINIQUES ON CONTINUOUS TONE GRAPHICAL IMAGES Dr.S.Narayanan Computer Centre, Alagappa University, Karaikudi-South (India) ABSTRACT The programs using complex

More information

Visualizing Lempel-Ziv-Welch

Visualizing Lempel-Ziv-Welch Visualizing Lempel-Ziv-Welch The following slides assume you have read and (more or less) understood the description of the LZW algorithm in the 6.02 notes. The intent here is to help consolidate your

More information

Digital Image Processing

Digital Image Processing Lecture 9+10 Image Compression Lecturer: Ha Dai Duong Faculty of Information Technology 1. Introduction Image compression To Solve the problem of reduncing the amount of data required to represent a digital

More information

LOSSLESS DATA COMPRESSION AND DECOMPRESSION ALGORITHM AND ITS HARDWARE ARCHITECTURE

LOSSLESS DATA COMPRESSION AND DECOMPRESSION ALGORITHM AND ITS HARDWARE ARCHITECTURE LOSSLESS DATA COMPRESSION AND DECOMPRESSION ALGORITHM AND ITS HARDWARE ARCHITECTURE V V V SAGAR 1 1JTO MPLS NOC BSNL BANGALORE ---------------------------------------------------------------------***----------------------------------------------------------------------

More information

So, what is data compression, and why do we need it?

So, what is data compression, and why do we need it? In the last decade we have been witnessing a revolution in the way we communicate 2 The major contributors in this revolution are: Internet; The explosive development of mobile communications; and The

More information

Optimization of Bit Rate in Medical Image Compression

Optimization of Bit Rate in Medical Image Compression Optimization of Bit Rate in Medical Image Compression Dr.J.Subash Chandra Bose 1, Mrs.Yamini.J 2, P.Pushparaj 3, P.Naveenkumar 4, Arunkumar.M 5, J.Vinothkumar 6 Professor and Head, Department of CSE, Professional

More information

Modeling Delta Encoding of Compressed Files

Modeling Delta Encoding of Compressed Files Modeling Delta Encoding of Compressed Files EXTENDED ABSTRACT S.T. Klein, T.C. Serebro, and D. Shapira 1 Dept of CS Bar Ilan University Ramat Gan, Israel tomi@cs.biu.ac.il 2 Dept of CS Bar Ilan University

More information

Ch. 2: Compression Basics Multimedia Systems

Ch. 2: Compression Basics Multimedia Systems Ch. 2: Compression Basics Multimedia Systems Prof. Thinh Nguyen (Based on Prof. Ben Lee s Slides) Oregon State University School of Electrical Engineering and Computer Science Outline Why compression?

More information

Network Working Group Request for Comments: December 1998

Network Working Group Request for Comments: December 1998 Network Working Group Request for Comments: 2395 Category: Informational R. Friend R. Monsour Hi/fn, Inc. December 1998 IP Payload Compression Using LZS Status of this Memo This memo provides information

More information

Improving LZW Image Compression

Improving LZW Image Compression European Journal of Scientific Research ISSN 1450-216X Vol.44 No.3 (2010), pp.502-509 EuroJournals Publishing, Inc. 2010 http://www.eurojournals.com/ejsr.htm Improving LZW Image Compression Sawsan A. Abu

More information

A NOVEL APPROACH FOR A HIGH PERFORMANCE LOSSLESS CACHE COMPRESSION ALGORITHM

A NOVEL APPROACH FOR A HIGH PERFORMANCE LOSSLESS CACHE COMPRESSION ALGORITHM A NOVEL APPROACH FOR A HIGH PERFORMANCE LOSSLESS CACHE COMPRESSION ALGORITHM K. Janaki 1, K. Indhumathi 2, P. Vijayakumar 3 and K. Ashok Kumar 4 1 Department of Electronics and Communication Engineering,

More information

An On-line Variable Length Binary. Institute for Systems Research and. Institute for Advanced Computer Studies. University of Maryland

An On-line Variable Length Binary. Institute for Systems Research and. Institute for Advanced Computer Studies. University of Maryland An On-line Variable Length inary Encoding Tinku Acharya Joseph F. Ja Ja Institute for Systems Research and Institute for Advanced Computer Studies University of Maryland College Park, MD 242 facharya,

More information

Digital Communication Prof. Bikash Kumar Dey Department of Electrical Engineering Indian Institute of Technology, Bombay

Digital Communication Prof. Bikash Kumar Dey Department of Electrical Engineering Indian Institute of Technology, Bombay Digital Communication Prof. Bikash Kumar Dey Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 29 Source Coding (Part-4) We have already had 3 classes on source coding

More information

A Comparative Study of Entropy Encoding Techniques for Lossless Text Data Compression

A Comparative Study of Entropy Encoding Techniques for Lossless Text Data Compression A Comparative Study of Entropy Encoding Techniques for Lossless Text Data Compression P. RATNA TEJASWI 1 P. DEEPTHI 2 V.PALLAVI 3 D. GOLDIE VAL DIVYA 4 Abstract: Data compression is the art of reducing

More information

COMPRESSION OF SMALL TEXT FILES

COMPRESSION OF SMALL TEXT FILES COMPRESSION OF SMALL TEXT FILES Jan Platoš, Václav Snášel Department of Computer Science VŠB Technical University of Ostrava, Czech Republic jan.platos.fei@vsb.cz, vaclav.snasel@vsb.cz Eyas El-Qawasmeh

More information

Improving the Performance of Spatial Reusability Aware Routing in Multi-Hop Wireless Networks

Improving the Performance of Spatial Reusability Aware Routing in Multi-Hop Wireless Networks IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 08, Issue 6 (June. 2018), V (III) PP 48-53 www.iosrjen.org Improving the Performance of Spatial Reusability Aware Routing

More information

A Technique for High Ratio LZW Compression

A Technique for High Ratio LZW Compression A Technique for High Ratio LZW Compression Michael J. Knieser Francis G. Wolff Chris A. Papachristou Daniel J. Weyer David R. McIntyre Indiana University Purdue University Indianapolis Case Western Reserve

More information

A Compression Method for PML Document based on Internet of Things

A Compression Method for PML Document based on Internet of Things Oriental Journal of Computer Science & Technology Vol. 4(1), 159-164 (2011) A Compression Method for PML Document based on Internet of Things JAMAL MOHAMMAD AQIB Research Scholars of Singhania University,

More information

Dictionary techniques

Dictionary techniques Dictionary techniques The final concept that we will mention in this chapter is about dictionary techniques. Many modern compression algorithms rely on the modified versions of various dictionary techniques.

More information

JPEG. Table of Contents. Page 1 of 4

JPEG. Table of Contents. Page 1 of 4 Page 1 of 4 JPEG JPEG is an acronym for "Joint Photographic Experts Group". The JPEG standard is an international standard for colour image compression. JPEG is particularly important for multimedia applications

More information

A QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo

A QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo A QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo Integrated Media Systems Center and Department of Electrical Engineering University

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Image Compression Caution: The PDF version of this presentation will appear to have errors due to heavy use of animations Material in this presentation is largely based on/derived

More information

An Analytical Review of Lossy Image Compression using n-tv Method

An Analytical Review of Lossy Image Compression using n-tv Method An Analytical Review of Lossy Image Compression using n-tv Method Dr. Anjali Mathur 1 Department of Mathematics Jodhpur Institute of Engineering & Technology Jodhpur, India itesh Agarwal Dr. Sandeep Mathur

More information

A Fast Block sorting Algorithm for lossless Data Compression

A Fast Block sorting Algorithm for lossless Data Compression A Fast Block sorting Algorithm for lossless Data Compression DI Michael Schindler Vienna University of Technology Karlsplatz 13/1861, A 1040 Wien, Austria, Europe michael@eiunix.tuwien.ac.at if.at is transformed

More information

A Comprehensive Review of Data Compression Techniques

A Comprehensive Review of Data Compression Techniques Volume-6, Issue-2, March-April 2016 International Journal of Engineering and Management Research Page Number: 684-688 A Comprehensive Review of Data Compression Techniques Palwinder Singh 1, Amarbir Singh

More information

MODELING DELTA ENCODING OF COMPRESSED FILES. and. and

MODELING DELTA ENCODING OF COMPRESSED FILES. and. and International Journal of Foundations of Computer Science c World Scientific Publishing Company MODELING DELTA ENCODING OF COMPRESSED FILES SHMUEL T. KLEIN Department of Computer Science, Bar-Ilan University

More information

A Comparative Study Of Text Compression Algorithms

A Comparative Study Of Text Compression Algorithms International Journal of Wisdom Based Computing, Vol. 1 (3), December 2011 68 A Comparative Study Of Text Compression Algorithms Senthil Shanmugasundaram Department of Computer Science, Vidyasagar College

More information

Runlength Compression Techniques for FPGA Configurations

Runlength Compression Techniques for FPGA Configurations Runlength Compression Techniques for FPGA Configurations Scott Hauck, William D. Wilson Department of Electrical and Computer Engineering Northwestern University Evanston, IL 60208-3118 USA {hauck, wdw510}@ece.nwu.edu

More information

IMAGE COMPRESSION USING HYBRID QUANTIZATION METHOD IN JPEG

IMAGE COMPRESSION USING HYBRID QUANTIZATION METHOD IN JPEG IMAGE COMPRESSION USING HYBRID QUANTIZATION METHOD IN JPEG MANGESH JADHAV a, SNEHA GHANEKAR b, JIGAR JAIN c a 13/A Krishi Housing Society, Gokhale Nagar, Pune 411016,Maharashtra, India. (mail2mangeshjadhav@gmail.com)

More information

Overview. Last Lecture. This Lecture. Next Lecture. Data Transmission. Data Compression Source: Lecture notes

Overview. Last Lecture. This Lecture. Next Lecture. Data Transmission. Data Compression Source: Lecture notes Overview Last Lecture Data Transmission This Lecture Data Compression Source: Lecture notes Next Lecture Data Integrity 1 Source : Sections 10.1, 10.3 Lecture 4 Data Compression 1 Data Compression Decreases

More information

7: Image Compression

7: Image Compression 7: Image Compression Mark Handley Image Compression GIF (Graphics Interchange Format) PNG (Portable Network Graphics) MNG (Multiple-image Network Graphics) JPEG (Join Picture Expert Group) 1 GIF (Graphics

More information

Lossless Audio Coding based on Burrows Wheeler Transform and Run Length Encoding Algorithm

Lossless Audio Coding based on Burrows Wheeler Transform and Run Length Encoding Algorithm Lossless Audio Coding based on Burrows Wheeler Transform and Run Length Encoding Algorithm Pratibha Warkade 1, Agya Mishra 2 M.E. Scholar, Dept. of Electronics and Telecommunication Engineering, Jabalpur

More information

Data Compression 신찬수

Data Compression 신찬수 Data Compression 신찬수 Data compression Reducing the size of the representation without affecting the information itself. Lossless compression vs. lossy compression text file image file movie file compression

More information

Fundamentals of Multimedia. Lecture 5 Lossless Data Compression Variable Length Coding

Fundamentals of Multimedia. Lecture 5 Lossless Data Compression Variable Length Coding Fundamentals of Multimedia Lecture 5 Lossless Data Compression Variable Length Coding Mahmoud El-Gayyar elgayyar@ci.suez.edu.eg Mahmoud El-Gayyar / Fundamentals of Multimedia 1 Data Compression Compression

More information

Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Lecture 10 (Chapter 7) ZHU Yongxin, Winson

Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Lecture 10 (Chapter 7) ZHU Yongxin, Winson Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Lecture 10 (Chapter 7) ZHU Yongxin, Winson zhuyongxin@sjtu.edu.cn 2 Lossless Compression Algorithms 7.1 Introduction 7.2 Basics of Information

More information

Image Compression. cs2: Computational Thinking for Scientists.

Image Compression. cs2: Computational Thinking for Scientists. Image Compression cs2: Computational Thinking for Scientists Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs2 koc@cs.ucsb.edu The course was developed with input from: Ömer Eǧecioǧlu (Computer Science), Maribel

More information

RLE - Run Length Encoding

RLE - Run Length Encoding RLE - Run Length Encoding Student IONUŢ SILVIU NICULESCU Student CĂTĂLIN BOJA Student ALEXANDRU STANCIU Student IONUŢ BULUMACU Faculty of Economic Cybernetics, Statistics and Informatics, Academy of Economic

More information

A Comparison between English and. Arabic Text Compression

A Comparison between English and. Arabic Text Compression Contemporary Engineering Sciences, Vol. 6, 2013, no. 3, 111-119 HIKARI Ltd, www.m-hikari.com A Comparison between English and Arabic Text Compression Ziad M. Alasmer, Bilal M. Zahran, Belal A. Ayyoub,

More information

Implementation and Optimization of LZW Compression Algorithm Based on Bridge Vibration Data

Implementation and Optimization of LZW Compression Algorithm Based on Bridge Vibration Data Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 1570 1574 Advanced in Control Engineeringand Information Science Implementation and Optimization of LZW Compression Algorithm Based

More information

Text Data Compression and Decompression Using Modified Deflate Algorithm

Text Data Compression and Decompression Using Modified Deflate Algorithm Text Data Compression and Decompression Using Modified Deflate Algorithm R. Karthik, V. Ramesh, M. Siva B.E. Department of Computer Science and Engineering, SBM COLLEGE OF ENGINEERING AND TECHNOLOGY, Dindigul-624005.

More information

REVIEW ON IMAGE COMPRESSION TECHNIQUES AND ADVANTAGES OF IMAGE COMPRESSION

REVIEW ON IMAGE COMPRESSION TECHNIQUES AND ADVANTAGES OF IMAGE COMPRESSION REVIEW ON IMAGE COMPRESSION TECHNIQUES AND ABSTRACT ADVANTAGES OF IMAGE COMPRESSION Amanpreet Kaur 1, Dr. Jagroop Singh 2 1 Ph. D Scholar, Deptt. of Computer Applications, IK Gujral Punjab Technical University,

More information

Lossless compression II

Lossless compression II Lossless II D 44 R 52 B 81 C 84 D 86 R 82 A 85 A 87 A 83 R 88 A 8A B 89 A 8B Symbol Probability Range a 0.2 [0.0, 0.2) e 0.3 [0.2, 0.5) i 0.1 [0.5, 0.6) o 0.2 [0.6, 0.8) u 0.1 [0.8, 0.9)! 0.1 [0.9, 1.0)

More information

Implementation of LZW Data Lossless Compression Algorithm Based on VB Yuan Qinghui 1, a,*, Nie Xiujun 1, b and Yuan Qingfei 2,c

Implementation of LZW Data Lossless Compression Algorithm Based on VB Yuan Qinghui 1, a,*, Nie Xiujun 1, b and Yuan Qingfei 2,c Implementation of LZW Data Lossless Compression Algorithm Based on VB Yuan Qinghui 1, a,*, Nie Xiujun 1, b and Yuan Qingfei 2,c 1 Binzhou Polytechnic, Binzhou, Shandong Province China,256603 2 China Offshore

More information

Comparison of Text Data Compression Using Run Length Encoding, Arithmetic Encoding, Punctured Elias Code and Goldbach Code

Comparison of Text Data Compression Using Run Length Encoding, Arithmetic Encoding, Punctured Elias Code and Goldbach Code Comparison of Text Data Compression Using Run Length Encoding, Arithmetic Encoding, Punctured Elias Code and Goldbach Code Kenang Eko Prasetyo 1, Tito Waluyo Purboyo 2, Randy Erfa Saputra 3 Computer Engineering,

More information

LIPT-Derived Transform Methods Used in Lossless Compression of Text Files

LIPT-Derived Transform Methods Used in Lossless Compression of Text Files ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 14, Number 2, 2011, 149 158 LIPT-Derived Transform Methods Used in Lossless Compression of Text Files Radu RĂDESCU Politehnica University of

More information