Further enhancement of LZW++ algorithm applied to text compression and decompression

ABSTRACT Lempel-Ziv-Welch (LZW) is a general compression algorithm capable of working on almost any type of data but the researchers focused on different text file compression and decompression. It is a “dictionary”-based compression algorithm. This means that instead of tabulating character counts and building trees, LZW encodes data referencing a dictionary. The main purpose of this study is to enhance the technique of existing LZW++ Algorithm for data compression and decompression and to broaden the capability of the algorithm in doing its process into different text files. This study focuses on text compression and decompression of text file formats such as: .txt, .doc, .docx, .rtf, .html, .php, .dotm, .odt, .vbs, .ccp and .xml file only. Many assessments have been done to this study such as testing the previous application just to come up with a better version of LZW++ algorithm that in the existing system. However, after the several tests, the enhanced algorithm came up with a better version and better capability when it comes to compression and decompression. LZW++ Algorithm is used for text compression Image compression is however possible but it is not used in the algorithm. This algorithm can probably be developed and used in image compression and decompression by the same process applied. The algorithm will read three pixels and allocate each of three pixels in a dictionary so that it could be compressed. After the tests, it is concocluded that this study helped a lot in development of the algorithm. Broader capability of the algorithm to handle text files can greatly help in people who always use data compression and decompression.

5

ABSTRACT Lempel-Ziv-Welch (LZW) is a general compression algorithm capable of working on almost any type of data but the researchers focused on different text file compression and decompression. It is a dictionary-based compression algorithm. This means that instead of tabulating character counts and building trees, LZW encodes data referencing a dictionary. The main purpose of this study is to enhance the technique of existing LZW++ Algorithm for data compression and decompression and to broaden the capability of the algorithm in doing its process into different text files. This study focuses on text compression and decompression of text file formats such as: .txt, .doc, .docx, .rtf, .html, .php, .dotm, .odt, .vbs, .ccp and .xml file only. Many assessments have been done to this study such as testing the previous application just to come up with a better version of LZW++ algorithm that in the existing system. However, after the several tests, the enhanced algorithm came up with a better version and better capability when it comes to compression and decompression. LZW++ Algorithm is used for text compression Image compression is however possible but it is not used in the algorithm. This algorithm can probably be developed and used in image compression and decompression by the same process applied. The algorithm will read three pixels and allocate each of three pixels in a dictionary so that it could be compressed. After the tests, it is concocluded that this study helped a lot in development of the algorithm. Broader capability of the algorithm to handle text files can greatly help in people who always use data compression and decompression.

Filipiniana

5