05-compression-02-entropy coding.pptx - ICSY

Lempel - Ziv (LZ77)
}
Algorithm for compression of character sequences
(cont.)
2. Find the longest match between
• the first characters of the look ahead buffer
• and an arbitrary character sequence in the search buffer
3. Produces output
• offset + length = reference to earlier occurence
• next_character = the first character following the match in the look
ahead buffer
Prof. Dr. Paul Müller, University of Kaiserslautern
33