diplomsko delo
Robert Šircelj (Author), Borut Žalik (Mentor)

Abstract

V diplomski nalogi predstavimo in implementiramo algoritme za stiskanje podatkov brez izgub po metodah Shannon-Fano, Huffman in Huffman s prilagajanjem. Učinkovitost algoritmov testiramo na različnih vrstah datotek ter jih med seboj primerjamo glede na razmerje stiskanja ter čas kodiranja in dekodiranja. Ugotovili smo, da v razmerju stiskanja med metodami ni bistvenih razlik.

Keywords

algoritmi stiskanja podatkov;Shannon-Fanojev algoritem;Huffmanov algoritem;Huffmanov algoritem s prilagajanjem;primerjava algoritmov;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: R. Šircelj
UDC: 004.627.021(043.2)
COBISS: 20130838 Link will open in a new window
Views: 1218
Downloads: 192
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: COMPARISON OF SHANNON-FANO, HUFFMAN, AND ADAPTIVE HUFFMAN COMPRESSION ALGORITHM METHODS
Secondary abstract: In this thesis, Shannon-Fano, Huffman, and adaptive Huffman lossless compression algorithms are presented and implemented. The efficiency of the algorithms was tested using various file types. The compression ratio, encoding and decoding time were compared. We found that there are no significant differences in compression ratio results between these methods.
Secondary keywords: data compression algorithms;Shannon-Fano algorithm;Huffman algorithm;adaptive Huffman algorithm;algorithm comparison;
URN: URN:SI:UM:
Type (COBISS): Undergraduate thesis
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informatika
Pages: VIII, 33 f.
ID: 9161542