The first
algorithm to use the
Lempel-Ziv {substitutional compression} schemes, propos
ed in 1977. LZ77 compression keeps track of the last n bytes of data seen, and when a phrase is encounter
ed that has already been seen, it outputs a pair of values corresponding to the position of the phrase in the previously-seen buffer of data, and the length of the phrase. In effect the compressor moves a fix
ed-size "window" over the data (generally referr
ed to as a "sliding window"), with the position part of the (position, length) pair referring to the position of the phrase within the window. The most commonly us
ed algorithms are deriv
ed from the
LZSS scheme describ
ed by James Storer and Thomas Szymanski in 1982. In this the compressor maintains a window of size N bytes and a "lookahead buffer", the contents of which it tries to find a match for in the window: while (lookAheadBuffer not empty) { get a pointer (position, match) to the longest match in the window for the lookahead buffer if (length > MINIMUM_MATCH_LENGTH) { output a (position, length) pair shift the window length characters along } else { output the first character in the lookahead buffer shift the window 1 character along } } Decompression is simple and fast: whenever a (POSITION, LENGTH) pair is encounter
ed, go to that POSITION in the window and copy LENGTH bytes to the output. Sliding-window-bas
ed schemes can be simplifi
ed by numbering the input text characters mod N, in effect creating a circular buffer. The sliding window approach automatically creates the
LRU effect which must be done explicitly in
LZ78 schemes. Variants of this method apply additional compression to the output of the LZSS compressor, which include a simple variable-length code (
LZB), dynamic
Huffman coding (
LZH), and
Shannon-Fano coding (
ZIP 1.x), all of which result in a certain degree of improvement over the basic scheme, especially when the data are rather random and the LZSS compressor has little effect. An algorithm was develop
ed which combines the ideas behind LZ77 and LZ78 to produce a hybrid call
ed LZFG. LZFG uses the standard sliding window, but stores the data in a modifi
ed trie data structure and produces as output the position of the text in the trie. Since LZFG only inserts complete *phrases* into the dictionary, it should run faster than other LZ77-bas
ed compressors. All popular archivers (
arj,
lha,
zip,
zoo) are variations on LZ77. [comp.compression
FAQ]. (1995-04-07)
In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ archive ] [ arj ] [ as ] [ AT ] [ at ] [ au ] [ B ] [ b ] [ ba ] [ base ] [ be ] [ bi ] [ br ] [ bs ] [ buffer ] [ by ] [ byte ] [ C ] [ ca ] [ ch ] [ char ] [ character ] [ ci ] [ circular buffer ] [ ck ] [ cl ] [ co ] [ code ] [ com ] [ complete ] [ compress ] [ compression ] [ con ] [ cr ] [ cu ] [ D ] [ data ] [ data structure ] [ dd ] [ de ] [ degree ] [ ding ] [ do ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ eg ] [ eh ] [ er ] [ era ] [ es ] [ et ] [ FAQ ] [ fas ] [ fi ] [ file ] [ fix ] [ fm ] [ fo ] [ for ] [ fr ] [ G ] [ ge ] [ gen ] [ gr ] [ gt ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ input ] [ int ] [ IO ] [ io ] [ IP ] [ ir ] [ is ] [ IT ] [ it ] [ J ] [ ke ] [ ki ] [ la ] [ ld ] [ Lex ] [ lha ] [ li ] [ lr ] [ LRU ] [ ls ] [ lt ] [ lu ] [ ly ] [ M ] [ ma ] [ man ] [ method ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ ng ] [ nl ] [ nn ] [ no ] [ np ] [ ns ] [ nu ] [ O ] [ om ] [ op ] [ OS ] [ OSI ] [ output ] [ pa ] [ pe ] [ ph ] [ pl ] [ ply ] [ point ] [ pointer ] [ pop ] [ POS ] [ pr ] [ pt ] [ py ] [ Q ] [ query ] [ random ] [ rc ] [ re ] [ ro ] [ roach ] [ ru ] [ run ] [ S ] [ sc ] [ se ] [ sh ] [ SI ] [ si ] [ sit ] [ sk ] [ sl ] [ so ] [ spec ] [ st ] [ standard ] [ store ] [ struct ] [ su ] [ T ] [ tc ] [ text ] [ th ] [ Thomas ] [ to ] [ tp ] [ tr ] [ track ] [ tt ] [ um ] [ us ] [ V ] [ va ] [ value ] [ var ] [ variable ] [ ve ] [ vi ] [ while ] [ win ] [ yt ] [ Z ] [ zip ] [ zoo ]