Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
En studie i komprimeringsalgoritmer
Blekinge Institute of Technology, School of Engineering, Department of Interaction and System Design.
2005 (English)Independent thesis Advanced level (degree of Master (One Year))Student thesisAlternative title
A study in compression algorithms (Swedish)
Abstract [en]

Compression algorithms can be used everywhere. For example, when you look at a DVD movie a lossy algorithm is used, both for picture and sound. If you want to do a backup of your data, you might be using a lossless algorithm. This thesis will explain how many of the more common lossless compression algorithms work. During the work of this thesis I also developed a new lossless compression algorithm. I compared this new algorithm to the more common algorithms by testing it on five different types of files. The result that I got was that the new algorithm was comparable to the other algorithms when comparing the compression ratio, and in some cases it also performed better than the others.

Abstract [sv]

Komprimeringsalgoritmer kan användas överallt. T ex, när du tittar på en DVD-film så används en förstörande algoritm, både för bild och ljud. Om du vill göra en säkerhetskopia av din data, så kanske du använder en icke förstörande algoritm. Denna avhandling kommer att förklara hur många av de mer vanliga icke förstörande algoritmer fungerar. Under arbetets gång så utvecklade jag också en ny icke förstörande algoritm. Jag jämförde denna nya algoritm med de mer vanliga algoritmerna genom att jämföra algoritmerna med varandra på fem olika typer av filer. Resultatet som jag kom fram till var att den nya algoritmen var jämförbar med de andra algoritmerna när man jämförde komprimeringsförhållandet, och i vissa fall så presterade den bättre än de andra.

Place, publisher, year, edition, pages
2005. , 58 p.
Keyword [en]
compression algorithms, probability, dictionary, BCCBT
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-2971Local ID: oai:bth.se:arkivex2EE7A9DB9510296DC1256FAA0053702FOAI: oai:DiVA.org:bth-2971DiVA: diva2:830266
Uppsok
Technology
Supervisors
Available from: 2015-04-22 Created: 2005-02-16 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(393 kB)16 downloads
File information
File name FULLTEXT01.pdfFile size 393 kBChecksum SHA-512
5179e1692ef7f3e16363d4c4f79cb9b3b46c9d35727961ced08e04b5c2bb61a3cb4fd57dbebc92d3884925c943e9e44e3f825e8a7abdcb87ddcbc13667166797
Type fulltextMimetype application/pdf

By organisation
Department of Interaction and System Design
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 16 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 24 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf