Intensification of Lempel-ZIV-Welch Algorithm

Abstract

There is a necessity to reduce the consumption of exclusive resources. This is achieved using data compression. The data compression is one well known technique which can reduce the file size. A plethora of data compression algorithms are available which provides compression in various ratios. LZW is one of the powerful widely used algorithms. This paper attempts to propose and apply some enhancements to LZW, hence comes out with an efficient lossless text compression scheme that can compress a given file at better compression ratio. The paper proposes three approaches which practically enhances the original algorithm. These approaches try to gain better compression ratio. In approach1, it exploits the notion of using existing string code with odd code for a newly encounter string which is reverse of existing. In approach2 it uses a choice of code length for the current compression, so avoiding the problem of dictionary overflow. In approach3 it appends some selective set of frequently encountered string patterns. So the intensified LZW method provides better compression ratio with the inclusion of the above features.