Open AccessProceedings Article
A simple lossless preprocessing algorithm for hardware implementation of Deflate data compression
Alireza Yazdanpanah,Mahmoud Reza Hashemi +1 more
- 17 May 2011
- pp 1-5
9
TL;DR: A preprocessing algorithm has been proposed to improve the compression ratio of the Deflate algorithm and the relatively low computational complexity of the proposed scheme makes it suitable for hardware implementations.
read more
Abstract: Summary from only given. As more electronic devices enter our daily life, the demand for more data storage space grows with it at an unprecedented pace. This necessitates a more efficient use of storage space, and real time data compression is one solution. Deflate is one of the most popular methods among lossless data compression algorithms. This algorithm has a high performance and is used in many popular applications. In this paper, a preprocessing algorithm has been proposed to improve the compression ratio of the Deflate algorithm. The relatively low computational complexity of the proposed scheme makes it suitable for hardware implementations. Simulation results indicate that the proposed preprocessing improves compression ratio by 3.39%, in average. Furthermore, it can be used with any existing hardware or software implementation of Deflate.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Implementation of Huffman algorithm and study for optimization
Nidhi Dhawale
- 03 Sep 2015
TL;DR: The vital factors that have to be focused on for achieving optimization in the codes generated by traditional Huffman encoders are evaluated and discussed in this paper.
17
Patent
Dictionary encoding and decoding of screen content
Bin Li,Xu Jizheng,Feng Wu +2 more
- 04 Mar 2014
TL;DR: In this article, pixel values can be predicted from previous pixel values (e.g., stored in a dictionary) that are identified by an offset and a length, which are then encoded using hash matching of pixel values.
14
Big data compression processing and verification based on Hive for smart substation
Zhijian Qu,Ge Chen +1 more
TL;DR: Experimental results show that the compression ratio and query time of RCFile storage format are better than those of TextFile and SequenceFile, and results prove that the proposed data compression processing method has a significant theoretical and practical value for big data processing of smart substation.
Sobel edge detection technique implementation for image steganography analysis
Smitha Gl,Baburaj E +1 more
TL;DR: This paper is proposing the latest Steganography algorithm-Edge Adaptive based on Least-Significant-bit Matched Revisited (EALSBMR) approach with the help of Sobel edge detection, which uses image-processing technique to detect edges and also comparison is developed based on MATLAB software.
8
Research of SIP Compression Based on SigComp
TL;DR: Experiments show that the improved Deflate algorithm can compress the SIP message greatly and reduce the bandwidth requirements signally, so it is highly valued in IMS (IP Multimedia Subsystem), PTT (Push To Talk) and other wireless real-time SIP applications.
4
References
A universal algorithm for sequential data compression
Jacob Ziv,A. Lempel +1 more
TL;DR: The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable- to-block codes designed to match a completely specified source.
A Block-sorting Lossless Data Compression Algorithm
Michael Burrows,David Wheeler +1 more
- 01 Jan 1994
TL;DR: A block-sorting, lossless data compression algorithm, and the implementation of that algorithm and the performance of the implementation with widely available data compressors running on the same hardware are compared.
Data Compression Using Adaptive Coding and Partial String Matching
John G. Cleary,Ian H. Witten +1 more
TL;DR: This paper describes how the conflict can be resolved with partial string matching, and reports experimental results which show that mixed-case English text can be coded in as little as 2.2 bits/ character with no prior knowledge of the source.
1.4K
ZLIB Compressed Data Format Specification version 3.3
P. Deutsch,J.-L. Gailly +1 more
- 01 May 1996
TL;DR: This specification defines a lossless compressed data format that can be produced or consumed, even for an arbitrarily long sequentially presented input data stream, using only an a priori bounded amount of intermediate storage.
510
The entropy of English using PPM-based models
William J. Teahan,John G. Cleary +1 more
- 31 Mar 1996
TL;DR: The importance of training text for PPM is demonstrated, showing that its performance can be improved by "adjusting" the alphabet used, and the results based on these improvements are given.