scholarly journals A Novel Decode-Aware Compression Technique for Improved Compression and Decompression

Author(s):  
J. Suresh Babu ◽  
K. Tirumala Rao ◽  
P. Srinivas

With compressed bit streams, more configuration information can be stored using the same memory. The access delay is also reduced, because less bits need to be transferred through the memory interface. To measure the efficiency of bit stream compression, compression ratio (CR) is widely used as a metric. it is a major challenge to develop an efficient compression technique that can significantly reduce the bit stream size without sacrificing the decompression performance. Our approach combines the advantages of previous compression techniques with good compression ratio and those with fast decompression. This paper makes three important contributions. First, it performs smart placement of compressed bit streams to enable fast decompression of variable-length coding. Next, it selects bitmask-based compression parameters suitable for bit stream compression. Finally, it efficiently combines run length encoding and bitmask-based compression to obtain better compression and faster decompression.

Author(s):  
Nassir H. Salman ◽  
Enas Kh. Hassan

Medical image compression is considered one of the most important research fields nowadays in biomedical applications. The majority of medical images must be compressed without loss because each pixel information is of great value. With the widespread use of applications concerning medical imaging in the health-care context and the increased significance in telemedicine technologies, it has become crucial to minimize both the storage and bandwidth requirements needed for archiving and transmission of medical imaging data, rather by employing means of lossless image compression algorithms. Furthermore, providing high resolution and image quality preservation of the processed image data has become of great benefit. The proposed system introduces a lossless image compression technique based on Run Length Encoding (RLE) that encodes the original magnetic resonance imaging (MRI) image into actual values and their numbers of occurrence. The actual image data values are separated from their runs and they are stored in a vector array. Lempel–Ziv–Welch (LZW) is used to provide further compression that is applied to values array only. Finally the Variable Length Coding (VLC) will be applied to code the values and runs arrays for the precise amount of bits adaptively into a binary file. These bit streams are reconstructed using inverse LZW of the values array and inverse RLE to reconstruct the input image. The obtained compression gain is enhanced by 25% after applying LZW to the values array.


Author(s):  
Hikka Sartika ◽  
Taronisokhi Zebua

Storage space required by an application is one of the problems on smartphones. This problem can result in a waste of storage space because not all smartphones have a very large storage capacity. One application that has a large file size is the RPUL application and this application is widely accessed by students and the general public. Large file size is what often causes this application can not run effectively on smartphones. One solution that can be used to solve this problem is to compress the application file, so that the size of the storage space needed in the smartphone is much smaller. This study describes how the application of the elias gamma code algorithm as one of the compression technique algorithms to compress the RPUL application database file. This is done so that the RPUL application can run effectively on a smartphone after it is installed. Based on trials conducted on 64 bit of text as samples in this research it was found that compression based on the elias gamma code algorithm is able to compress text from a database file with a ratio of compression is 2 bits, compression ratio is 50% with a redundancy is 50%. Keywords: Compression, RPUL, Smartphone, Elias Gamma Code


Author(s):  
Winda Winda ◽  
Taronisokhi Zebua

The size of the data that is owned by an application today is very influential on the amount of space in the memory needed one of which is a mobile-based application. One mobile application that is widely used by students and the public at this time is the Complete Natural Knowledge Summary (Rangkuman Pengetahuan Alam Lengkap or RPAL) application. The RPAL application requires a large amount of material storage space in the mobile memory after it has been installed, so it can cause this application to be ineffective (slow). Compression of data can be used as a solution to reduce the size of the data so as to minimize the need for space in memory. The levestein algorithm is a compression technique algorithm that can be used to compress material stored in the RPAL application database, so that the database size is small. This study describes how to compress the RPAL application database records, so as to minimize the space needed on memory. Based on tests conducted on 128 characters of data (200 bits), the compression results obtained of 136 bits (17 characters) with a compression ratio is 68% and redundancy is 32%.Keywords: compression, levestein, aplication, RPAL, text, database, mobile


2009 ◽  
Vol 31 (10) ◽  
pp. 1826-1834 ◽  
Author(s):  
Wen-Fa ZHAN ◽  
Hua-Guo LIANG ◽  
Feng SHI ◽  
Zheng-Feng HUANG

Sign in / Sign up

Export Citation Format

Share Document