Optimized Compression and Decompression Software

This research paper offers data compression practices and matches their performance with the help of a software .In this research paper we are going to discuss the software which compare three algorithms, This is the software which we are going to compare three compression algorithms Huffman, LZW, LZM .With the help these algorithms we capable to compress text file, audio file, video file and images files. The software is basically comparing the algorithms on the basis of space complexity, time complexity of the data after compression. Technically the purpose of the data compression is to reduce duplicity in the stored and communicated data, thus increasing effective data density, Data compression is an important application in file storage and the distributed system. So if we need to increase the performance or heighten the speed so data compression is the advantage at that moment and compressed data is always suitable to reduce the cost both for storage and communication, data compression fundamentally diminishes the size of the data in terms of bits or bytes and the reduced data need lesser disk space compare to the data without compression. We have abundant ways to compress the data like text, audio, video files .Fundamentally we have two distinct characteristics for data compression and they are lossless and lossy compression. In lossless the integrity of the data is always maintained on the other hand In lossy compression data reduce by permanently eliminating certain amount of information, especially duplicate information, when a file in uncompressed, only a part of the original information is still there, Lossy compression commonly used for the audio and the video where certain amount of information is lost which is not examined by most of the users.