ΔRLE: Lossless data compression algorithm using delta transformation and optimized bit-level run-length encoding

Lossless data compression algorithms can use statistical redundancy to represent data using a fewer number of bits in comparison to the original uncompressed data. Run-Length Encoding (RLE) is one of the simplest lossless compression algorithms in terms of understanding its principles and software i...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Information and Organizational Sciences Vol. 45; no. 1; pp. 329 - 349
Main Authors: Madoš, Branislav, Bilanová, Zuzana, Hurtuk, Ján
Format: Journal Article Paper
Language:English
Published: Varazdin Faculty of organization and informatics, University of Zagreb 01.01.2021
Fakultet organizacije i informatike, Sveučilište u Zagrebu
Sveuciliste u Zagrebu, Fakultet Organizacije i Informatike
Fakultet organizacije i informatike Sveučilišta u Zagrebu
University of Zagreb, Faculty of organization and informatics
Subjects:
Algorithms
bit-level run-length encoding
Compression ratio
Data compression
ICT Information and Communications Technologies
lossless data compression
Lossless equipment
Principles
Redundancy
RLE
run-length encoding
runlength encoding
data compression
bitlevel runlength encoding
RLE
lossless data compression
ISSN:1846-3312, 1846-9418
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Lossless data compression algorithms can use statistical redundancy to represent data using a fewer number of bits in comparison to the original uncompressed data. Run-Length Encoding (RLE) is one of the simplest lossless compression algorithms in terms of understanding its principles and software implementation, as well as in terms of temporal and spatial complexity. If this principle is applied to individual bits of original uncompressed data without respecting the byte boundaries, this approach is referred to as bit-level Run-Length Encoding. Lightweight algorithm for lossless data compression proposed in this paper optimizes bit-level RLE data compression, uses special encoding of repeating data blocks, and, if necessary, combines it with delta data transformation or representation of data in its original form intending to increase compression efficiency compared to a conventional bit-level RLE approach. The advantage of the algorithm proposed in this paper is in its low time and memory consumption which are basic features of RLE, along with the simultaneous increase of compression ratio, compared to the classical bit-level RLE approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
263770
ISSN:1846-3312
1846-9418
DOI:10.31341/jios.45.1.15