The Full Wiki

More info on Lempel-Ziv-Storer-Szymanski

Lempel-Ziv-Storer-Szymanski: Wikis

Advertisements

Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.

Encyclopedia

From Wikipedia, the free encyclopedia

Lempel-Ziv-Storer-Szymanski (LZSS) is a lossless data compression algorithm, a derivative of LZ77, that was created in 1982 by James Storer and Thomas Szymanski. LZSS was described in article "Data compression via textual substitution" published in Journal of the ACM (pp. 928-951).

LZSS is a dictionary encoding technique. It attempts to replace a string of symbols with a reference to a dictionary location of the same string.

The main difference between LZ77 and LZSS is that in LZ77 the dictionary reference could actually be longer than the string it was replacing. In LZSS, such references are omitted if the length is less than the "break even" point. Furthermore, LZSS uses one-bit flags to indicate whether the next chunk of data is a literal (byte) or a reference to an offset/length pair.

Contents

Example

Here is the beginning of Dr. Seuss's Green Eggs and Ham, with character numbers at the beginning of lines for convenience.

0: I am Sam
9:
10: Sam I am
19:
20: That Sam-I-am!
35: That Sam-I-am!
50: I do not like
64: that Sam-I-am!
79: 
80: Do you like green eggs and ham?
112:
113: I do not like them, Sam-I-am.
143: I do not like green eggs and ham.

This text takes 177 bytes in uncompressed form. Assuming a break even point of 2 bytes (and thus 2 byte pointer/offset pairs), and one byte newlines, this text compressed with LZSS becomes 96 bytes long:

0: I am Sam
9:
10: (6,3) (0,4)
16:
17: That(5,4)-I-am!
30: (20,15)I do not like
46: t(21,14)
49: Do you(58,5) green eggs and ham?
79: (49,14) them,(24,9).(49,14)(93,18).

Note: this does not include a few bytes (3-4) of flags indicating whether the next chunk of text is a pointer or a literal. Adding it, the text becomes just over 100 bytes long, which is much shorter than the original 177 bytes.

Implementations

Many popular archivers like PKZip, ARJ, ZOO, LHarc use LZSS rather than LZ77 as the primary compression algorithm; the encoding of literal characters and of length-distance pairs varies, with the most common option being Huffman coding. The Allegro library can encode and decode an LZSS format,[1] and the Game Boy Advance BIOS can decode a slightly different LZSS format.[2]

References

  1. ^ Hargreaves, Shawn, et al. Allegro source code: lzss.c, revision 7522. Accessed on August 3, 2008.
  2. ^ Korth, Martin. GBATEK: GBA BIOS Decompression Functions. Accessed on August 3, 2008.

See also

External links

Advertisements

Advertisements






Got something to say? Make a comment.
Your name
Your email address
Message