Modifying Bit-Level Data Compression Scheme based on Adaptive Hamming Code Data Compression Algorithm

2019 ◽  
Author(s):  
Harwin C. Mendoza ◽  
Ariel M. Sison ◽  
Ruji P. Medina
Keyword(s):  
Data Compression ◽  
Compression Algorithm ◽  
Hamming Code ◽  
Compression Scheme ◽  
Level Data

A Codec Architecture for the Compression of Short Data Blocks

2017 ◽  
Vol 27 (02) ◽  
pp. 1850019 ◽  
Author(s):  
Jürgen Freudenberger ◽  
Mohammed Rajab ◽  
Daniel Rohweder ◽  
Malek Safieh
Keyword(s):  
Data Compression ◽  
Storage Systems ◽  
Compression Algorithm ◽  
Huffman Coding ◽  
Compression Scheme ◽  
Data Encoding ◽  
Block Level ◽  
Lossless Data Compression ◽  
Block Sizes

This work proposes a lossless data compression algorithm for short data blocks. The proposed compression scheme combines a modified move-to-front algorithm with Huffman coding. This algorithm is applicable in storage systems where the data compression is performed on block level with short block sizes, in particular, in non-volatile memories. For block sizes in the range of 1[Formula: see text]kB, it provides a compression gain comparable to the Lempel–Ziv–Welch algorithm. Moreover, encoder and decoder architectures are proposed that have low memory requirements and provide fast data encoding and decoding.

A Test Data Compression Scheme Based on Mixed Fixed and Variable Length Coding

2009 ◽  
Vol 31 (10) ◽  
pp. 1826-1834 ◽  
Author(s):  
Wen-Fa ZHAN ◽  
Hua-Guo LIANG ◽  
Feng SHI ◽  
Zheng-Feng HUANG
Keyword(s):  
Data Compression ◽  
Test Data ◽  
Variable Length ◽  
Test Data Compression ◽  
Compression Scheme ◽  
Variable Length Coding

scholarly journals An Approach to Efficient Dictionary Utilization and Improved Data Compression Technique for LZW Algorithm

2020 ◽  
Vol 10 (2) ◽  
pp. 224-229
Keyword(s):  
Data Compression ◽  
Conventional Method ◽  
Large Data ◽  
Compression Algorithm ◽  
Case Scenario ◽  
Compression Technique ◽  
Data Set ◽  
New Methods ◽  
Lzw Algorithm ◽  
The Way

This paper proposes an improved data compression technique compared to existing Lempel-Ziv-Welch (LZW) algorithm. LZW is a dictionary-updation based compression technique which stores elements from the data in the form of codes and uses them when those strings recur again. When the dictionary gets full, every element in the dictionary are removed in order to update dictionary with new entry. Therefore, the conventional method doesn’t consider frequently used strings and removes all the entry. This method is not an effective compression when the data to be compressed are large and when there are more frequently occurring string. This paper presents two new methods which are an improvement for the existing LZW compression algorithm. In this method, when the dictionary gets full, the elements that haven’t been used earlier are removed rather than removing every element of the dictionary which happens in the existing LZW algorithm. This is achieved by adding a flag to every element of the dictionary. Whenever an element is used the flag is set high. Thus, when the dictionary gets full, the dictionary entries where the flag was set high are kept and others are discarded. In the first method, the entries are discarded abruptly, whereas in the second method the unused elements are removed once at a time. Therefore, the second method gives enough time for the nascent elements of the dictionary. These techniques all fetch similar results when data set is small. This happens due to the fact that difference in the way they handle the dictionary when it’s full. Thus these improvements fetch better results only when a relatively large data is used. When all the three techniques' models were used to compare a data set with yields best case scenario, the compression ratios of conventional LZW is small compared to improved LZW method-1 and which in turn is small compared to improved LZW method-2.

Sign in / Sign up

Export Citation Format

Share Document