A hardware implementation of a run length encoding compression algorithm with parallel inputs

2008 ◽  
Author(s):  
J. Trein ◽  
A.T. Schwarzbacher ◽  
B. Hoppe ◽  
K.-H. Noffz
Keyword(s):  
Hardware Implementation ◽  
Compression Algorithm ◽  
Run Length

scholarly journals CRUSH: A New Lossless Compression Algorithm

2018 ◽  
Vol 12 (11) ◽  
pp. 387
Author(s):  
Evon Abu-Taieh ◽  
Issam AlHadid
Keyword(s):  
Data Structures ◽  
Time Complexity ◽  
Lossless Compression ◽  
Haar Wavelet ◽  
Compression Algorithm ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Compression Algorithms ◽  
Run Length

Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon–Fano code, Huffman coding, Run Length Encoding, Arithmetic Coding, Lempel-Ziv-Welch (LZW), Run Length Encoding (RLE), Burrows-Wheeler Transform.Move-to-Front (MTF) Transform, Haar, wavelet tree, Delta Encoding, Rice &Golomb Coding, Tunstall coding, DEFLATE algorithm, Run-Length Golomb-Rice (RLGR).

scholarly journals CRUSH: A New Lossless Compression Algorithm

2018 ◽  
Vol 12 (11) ◽  
pp. 406
Author(s):  
Evon Abu-Taieh ◽  
Issam AlHadid
Keyword(s):  
Data Structures ◽  
Time Complexity ◽  
Lossless Compression ◽  
Haar Wavelet ◽  
Compression Algorithm ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Compression Algorithms ◽  
Run Length

Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon–Fano code, Huffman coding, Run Length Encoding, Arithmetic Coding, Lempel-Ziv-Welch (LZW), Run Length Encoding (RLE), Burrows-Wheeler Transform.Move-to-Front (MTF) Transform, Haar, wavelet tree, Delta Encoding, Rice &Golomb Coding, Tunstall coding, DEFLATE algorithm, Run-Length Golomb-Rice (RLGR).

scholarly journals Analisis Dan Implementasi Algoritma Kriptografi Playfair Chiper Dan Algoritma Kompresi Run Length Encoding Dalam Pengamanan Dan Kompresi Data Teks

2018 ◽  
Vol 1 (1) ◽  
pp. 069-077
Author(s):  
Ananda Dwi Putri ◽  
Dian Rachmawati ◽  
Heriyance Heriyance
Keyword(s):  
Data Transmission ◽  
Data Security ◽  
Execution Time ◽  
Compression Algorithm ◽  
Algorithmic Complexity ◽  
Information Compression ◽  
Compression Process ◽  
Run Length ◽  
Cryptographic Algorithm

Komunikasi dan bertukar informasi secara jarak jauh sudah sangat mudah dan praktis. Kemudahan ini menuntut peningkatan keamanan terhadap kerahasiaan data yang dikirim. Kriptografi adalah salah satu cara yang digunakan untuk menjaga kerahasian dari sebuah pesan, dimana pesan disamarkan menjadi sandi. Selain keamanan data yang perlu diperhatikan juga adalah kecepatan dalam pengiriman data tersebut. Kecepatan pengiriman ini tergantung dari ukuran informasi tersebut. Kompresi adalah proses pengubahan sekumpulan data menjadi bentuk kode dengan tujuan untuk menghemat kebutuhan tempat penyimpanan dan waktu untuk transmisi data. Dalam penelitian ini penulis mengkombinasi algoritma kriptografi Playfair Cipher dengan algoritma kompresi Run Length Encoding, serta menganalisa kedua algoritma menggunakan kompleksitas algoritma. waktu eksekusi pesan dengan 16 karakter adalah 0.54423 sekon, waktu eksekusi pesan dengan 78 karakter adalah 1.14617 sekon, dan waktu eksekusi pesan dengan 189 karakter adalah 1.51715 sekon. Hasil pengujian proses kompresi string Homogen dengan kompresi rasio rata-rata sebesar 33.83% dan sring Heterogen dengan kompresi rasio rata-rata sebesar 15,54%. Dapat disimpulkan jumlah karakter pada pesan berbanding lurus terhadap waktu. Communication and exchanging information remotely are very easy and practical. This convenience requires increased security against the confidentiality of the data sent. Cryptography is one way used to maintain the confidentiality of a message, where the message is disguised as a password. In addition to data security, the speed in sending the data also needs to be considered. This speed of delivery depends on the size of the information. Compression is the process of converting a set of data into a code form with the aim of saving storage needs and time for data transmission. In this study, the researcher combined the Playfair Cipher cryptographic algorithm with the Run Length Encoding compression algorithm and analyzed both algorithms using algorithmic complexity. Message execution time with 16 characters was 0.54423 seconds. Message execution time with 78 characters was 1.14617 seconds, and message execution time with 189 characters was 1.51715 seconds. The result test was an average of 33.83% for the Homogeneous string compression process with compression ratios, and 15.54% for the Heterogeneous string with compression ratios. It could be concluded that the number of characters in the message was directly proportional to time. 

Sign in / Sign up

Export Citation Format

Share Document