1 / 10

Lempel-Ziv

Lempel-Ziv. Premier algorithme de type dictionnaire Dictionnaire construit dynamiquement à la lecture de la source Se sert de la redondance de facteurs | le | roi | boit | ce | que | boit | le | roi | | le | roi | boit | ce | que | 3 | 2 | 1 |.

yorick
Download Presentation

Lempel-Ziv

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lempel-Ziv • Premier algorithme de type dictionnaire • Dictionnaire construit dynamiquement à la lecture de la source • Se sert de la redondance de facteurs | le | roi | boit | ce | que | boit | le | roi | | le | roi | boit | ce | que | 3 | 2 | 1 |

  2. Lz77(1)Deux fenêtres coulissantes parcourent le fichier source.

  3. Lz77(2)

  4. Lz77(3)

  5. Lz78(1) Le dictionnaire : • n’a pas de taille limite • se construit sous forme d’arbre

  6. Lz78(2) Chaîne = ‘aabbaa’  L = {} Code = ‘’

  7. Lz78(3) Chaîne = ‘aabbaa’  L = {a} Code = (0,a)

  8. Lz78(4) Chaîne = ‘aabbaa’  L = {a, ab} Code = (0,a) (1,b)

  9. Lz78(5) Chaîne = ‘aabbaa’  L = {a, ab, b} Code = (0,a) (1,b) (0,b)

  10. Lz78(6) Chaîne = ‘aabbaa’  L = {a, ab, b, aa} Code = (0,a) (1,b) (0,b) (1,a)

More Related