Lempel–Ziv–Stac (LZS, or Stac compression or Stacker compression[1]) is a lossless data compression algorithm that uses a combination of the LZ77 sliding-window compression algorithm and fixed Huffman coding. It was originally developed by Stac Electronics for tape compression, and subsequently adapted for hard disk compression and sold as the Stacker disk compression software. It was later specified as a compression algorithm for various network protocols. LZS is specified in the Cisco IOS stack.
Standards
editLZS compression is standardized as an INCITS (previously ANSI) standard.[2]
LZS compression is specified for various Internet protocols:
Algorithm
editLZS compression and decompression uses an LZ77 type algorithm. It uses the last 2 KB of uncompressed data as a sliding-window dictionary.
An LZS compressor looks for matches between the data to be compressed and the last 2 KB of data. If it finds a match, it encodes an offset/length reference to the dictionary. If no match is found, the next data byte is encoded as a "literal" byte. The compressed data stream ends with an end-marker.
Compressed data format
editData is encoded into a stream of variable-bit-width tokens.
Literal byte
editA literal byte is encoded as a '0' bit followed by the 8 bits of the byte.
Offset/length reference
editAn offset/length reference is encoded as a '1' bit followed by the encoded offset, followed by the encoded length. One exceptional encoding is an end marker, described below.
An offset can have a minimum value of 1 and a maximum value of 2047. A value of 1 refers to the most recent byte in the history buffer, immediately preceding the next data byte to be processed. An offset is encoded as:
- If the offset is less than 128: a '1' bit followed by a 7-bit offset value.
- If the offset is greater than or equal to 128: a '0' bit followed by an 11-bit offset value.
A length is encoded as:
| Length | Bit encoding |
|---|---|
| 2 | 00 |
| 3 | 01 |
| 4 | 10 |
| 5 | 1100 |
| 6 | 1101 |
| 7 | 1110 |
| 8 to 22 | 1111 xxxx, where xxxx is length − 8 |
| 23 to 37 | 1111 1111 xxxx, where xxxx is length − 23 |
| length > 37 | (1111 repeated N times) xxxx, where
N is integer result of (length + 7) / 15, and
|
End marker
editAn end marker is encoded as the 9-bit token 110000000. Following the end marker, 0 to 7 extra '0' bits are appended as needed, to pad the stream to the next byte boundary.
Patents
editStac Electronics' spin-off Hifn has held several patents for LZS compression.[3][4] These patents lapsed due to non-payment of fees and attempts to reinstate them in 2007 failed.
In 1993–94, Stac Electronics successfully sued Microsoft for infringement of LZS patents in the DoubleSpace disk compression program included with MS-DOS 6.0.[5]
See also
editReferences
edit- ^ "Understanding Data Compression". Cisco. Retrieved 2021-05-07.
- ^ INCITS/ANSI X3.241-1994 - Data Compression Method – Adaptive Coding with Sliding Window for Information Interchange
- ^ Friend, Robert C. "Hifn's Statement about IPR claimed in draft-friend-tls-lzs-compression, RFC1967, RFC1974, RFC2118, RFC2395, and RFC3078". Retrieved 21 July 2010.
- ^ Friend, Robert. "Hifn's Statement on IPR Claimed in LZS and MPPC compression algorithms". Retrieved 21 July 2010.
- ^ Complaint for patent infringement and Demand for jury trial Archived 2007-05-09 at the Wayback Machine by Stac Electronics v Microsoft Corporation