Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
An Introduction and Evaluation of a Lossless Fuzzy Binary AND/OR Compressor
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
2010 (English)Independent thesis Advanced level (degree of Master (Two Years))Student thesisAlternative title
En introduktion och utvärdering av ett Lossless Fuzzy binär och / eller kompressor (Swedish)
Abstract [en]

We report a new lossless data compression algorithm (LDC) for implementing predictably-fixed compression values. The fuzzy binary and-or algorithm (FBAR), primarily aims to introduce a new model for regular and superdense coding in classical and quantum information theory. Classical coding on x86 machines would not suffice techniques for maximum LDCs generating fixed values of Cr >= 2:1. However, the current model is evaluated to serve multidimensional LDCs with fixed value generations, contrasting the popular methods used in probabilistic LDCs, such as Shannon entropy. The currently introduced entropy is of ‘fuzzy binary’ in a 4D hypercube bit flag model, with a product value of at least 50% compression. We have implemented the compression and simulated the decompression phase for lossless versions of FBAR logic. We further compared our algorithm with the results obtained by other compressors. Our statistical test shows that, the presented algorithm mutably and significantly competes with other LDC algorithms on both, temporal and spatial factors of compression. The current algorithm is a steppingstone to quantum information models solving complex negative entropies, giving double-efficient LDCs > 87.5% space savings.

Abstract [sv]

Vi rapporterar en ny förlustfri komprimering algoritm (MUL) för att genomföra förutsägbart-fast komprimering värden. Den luddiga binär och-eller algoritm (FBAR), syftar bland annat att införa en ny modell för regelbunden och superdense kodning i klassiska och kvantmekaniska information teori. Klassiska kodning på x86-maskiner inte skulle räcka teknik för maximal LDC att skapa fasta värden av Cr >= 2:1. Men den nuvarande modellen utvärderas för att tjäna flerdimensionella LDC med fast värde generationer, där de populära metoder som används i probabilistiska LDC, såsom Shannon entropi. De närvarande in entropi är av "fuzzy binära" i en 4D blixtkub lite flagga modell, med en produkt värde av minst 50% komprimering. Vi har genomfört komprimering och simulerade den tryckfall fasen för förlustfri versioner av FBAR logik. Jämförde vi ytterligare vår algoritm med de resultat som andra kompressorer. Vår statistiska testet visar att den presenterade algoritmen mutably och betydligt konkurrerar med andra LDC algoritmer på båda, tidsmässiga och geografiska faktorer av kompression. Den nuvarande algoritmen är en steppingstone att kvantinformationsteknik modeller lösa komplexa negativa entropies, vilket ger dubbel-effektiva LDC> 87,5 besparingar utrymme.

Place, publisher, year, edition, pages
2010. , 77 p.
Keyword [en]
Fuzzy Binary AND/OR, data compression/decompression, pairwise bits, double efficiency
National Category
Computer Science Probability Theory and Statistics Software Engineering
Identifiers
URN: urn:nbn:se:bth-6141Local ID: oai:bth.se:arkivexD6E604432CE79795C125775C0078148AOAI: oai:DiVA.org:bth-6141DiVA: diva2:833568
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Note
+46 455 38 50 00Available from: 2015-04-22 Created: 2010-07-10 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(2743 kB)334 downloads
File information
File name FULLTEXT01.pdfFile size 2743 kBChecksum SHA-512
1d3f4be08010229b420d0466274df7902f77202f4f3c9ef9831014965d6f11864661397e97838a1eff6d35924c0b5ca1014f028535a2b6873efc2d59c2363d70
Type fulltextMimetype application/pdf

By organisation
School of Computing
Computer ScienceProbability Theory and StatisticsSoftware Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 334 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

urn-nbn

Altmetric score

urn-nbn
Total: 301 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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