A universal double window sliding dictionary data compression algorithm

Compression of data is to minimise its representation which manifests in many applications such as storage and transmission. This proposed algorithm is an extension of the class of the substitutional encoders, typified by the Sliding Window technique (LZSS) of the Lempel-Ziv family of algorithms. This paper is concerned with the development of a universal lossless compression algorithm which allows adaptation to the variation in the source and yet is insensitive to the parameters bounded by the Lempel-Ziv Sliding Window encoder design, within a finite window context. This article includes a comparison on the analysis between the proposed Double Window Algorithm and its predecessor, the Lempel-Ziv Sliding Window Dictionary (LZSS).