Algoritem LZW in njegove izboljšave

diplomsko delo

Mario Močnik (Author), Borut Žalik (Mentor), Aljaž Jeromel (Co-mentor)

Abstract

V diplomskem delu smo opazovali, kako implementacija slovarja z razpršilno tabelo vpliva na čas stiskanja algoritma Lempel–Ziv–Welch. Primerjali smo algoritem LZW z njegovimi izboljšavami nadzora slovarja. Ugotovili smo, da najboljše razmerje stiskanja dosežemo z algoritmom LZC. Algoritem SLZW, ki kombinira pristop statističnega stiskanja in stiskanja s slovarjem, pa je bil najslabši.

Keywords

algoritmi;razpršilna tabela;brezizgubno stiskanje;stiskanje s slovarjem;razmerje stiskanja;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2021
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher:	[M. Močnik]
UDC:	004.932.021:004.627(043.2)
COBISS:	87177987
Views:	367
Downloads:	87
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	The LZW algorithm and its improvements
Secondary abstract:	Various strategies for dictionary controlling of the Lempel–Ziv–Welch algorithm is considered in this diploma thesis. The dictionary implementation with an array and a hash table is used for compression time comparison. Comparing of compression efficiency using different LWZ improvements follows. LZC algorithm achieves the best compression ratio while SLZW algorithm performed the worse.
Secondary keywords:	algorithms;hash table;lossless compression;dictionary based compression;compression ratio;
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages:	VI, 26 str.
ID:	13347287