Enhancement Of Lempel-Ziv Coding Using A Predictive Pre-Processor Scheme for Data Compression
نویسنده
چکیده
In the implementation of lossless compression, the traditional Lempel-Ziv dictionary algorithm produces good compression performance, but at a relatively slow processing speed for use in real-time applications. This paper highlights a technique to speed up the overall compression process through introduction of a prediction pre-processor stage. A variety of predictors are applied to two variations of the Lempel-Ziv LZSS and LZARI. It is shown that the proposed two-stage scheme significantly reduces the overall processing time taken for to encode raw telemetry data, as well as improves the overall compression performance achieved. Key-Words: Neural Networks, Lempel-Ziv, Prediction, Data Compression, Optimisation, Two-stage scheme
منابع مشابه
Fast Two-Stage Lempel-Ziv Lossless Numeric Telemetry Data Compression Using a Neural Network Predictor
Lempel-Ziv (LZ) is a popular lossless data compression algorithm that produces good compression performance, but suffers from relatively slow processing speed. This paper proposes an enhanced version of the Lempel-Ziv algorithm, through incorporation of a neural pre-processor in the popular predictor-encoder implementation. It is found that in addition to the known dramatic performance increase...
متن کاملPatternmatching Image Compressionwith Predication
Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on sever...
متن کاملPattern Matching Image Compression with Predication Loop: Preliminary Experimental Results
Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on sever...
متن کاملUniversal coding of nonstationary sources
In this correspondence we investigate the performance of the Lempel–Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel–Ziv scheme to perform lossy coding.
متن کاملParallel Lempel-Ziv-Welch (PLZW) Technique for Data Compression
Data Compression is one of the most fundamental problems in computer science and information technology. Many sequential algorithms are suggested for the problem. The most well known sequential algorithm is Lempel-ZivWelch (LZW) compression technique. The limitation of sequential algorithm is that ith block can be coded only after the (i-1)th block has completed. This limitation can be overcome...
متن کامل