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

More documents

Recommendations

Info

Lempel - Ziv (LZ77) } Example: Pos 1 2 3 4 5 6 7 8 9 10 Char A A B C B B A B C A Step Pos Match Char Output 1 1 - A 2 2 A B 3 4 - C 4 5 B B 5 7 ABC A Prof. Dr. Paul Müller, University of Kaiserslautern 34
Lempel - Ziv (LZ77) } Remarks - the search and the look ahead buffer have a limited size • the number of bits needed to encode pointers and length information depends on the buffers’ size • worst case: character sequences are longer than one of the buffers • typical size is 4 - 64 KB - sometimes other representations than the triple are used • next_char only if necessary (i.e. no match found) • enabling dynamic change of buffer sizes Prof. Dr. Paul Müller, University of Kaiserslautern 35
Page 1 and 2: Entropy Coding } different probabil
Page 3 and 4: The Braille Prof. Dr. Paul Müller,
Page 5 and 6: Morse Code Example: Letter statisti
Page 7 and 8: Huffman Coding } Idea: Use short bi
Page 9 and 10: Huffman Coding Symbol Count P2 205
Page 11 and 12: Huffman Coding Symbol Count Huffman
Page 13 and 14: Adaptive Huffman Coding } Problem -
Page 15 and 16: Adaptive Huffman Coding } Example n
Page 17 and 18: Adaptive Huffman Coding } A was inc
Page 19 and 20: Adaptive Huffman Coding } n+4-th Hu
Page 21 and 22: Huffman Coding Evaluation } Limitat
Page 23 and 24: Arithmetic Coding } arithmetic codi
Page 25 and 26: Arithmetic Coding } Example I - Fou
Page 27 and 28: Arithmetic Coding } Example I (cont
Page 29 and 30: Arithmetic Coding Example II (cont.
Page 31 and 32: Arithmetic Coding } Remarks - if th
Page 33: Lempel - Ziv (LZ77) } Algorithm for
Page 37 and 38: Lempel - Ziv - Welch (LZ78) } LZ78:

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

Create successful ePaper yourself

Delete template?

Save as template?