Parallel Lossless Data Compression: A Particle Dynamic Approach

Authors:
Dianxun Shuai
Affiliations:
East China University of Science and Technology, Shanghai, China 200237
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Year:
2008

Citing 8
Cited 0

Random sequence generation by cellular automata

Advances in Applied Mathematics
Minimal cost one-dimensional linear hybrid cellular automata of degree through 500

Journal of Electronic Testing: Theory and Applications
Quantitative analysis for linear hybrid cellular automata and LFSR as built-in self-test generators for sequential faults

Journal of Electronic Testing: Theory and Applications
Lossless Image Compression Using Integer to Integer Wavelet Transforms

ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Synthesis of one-dimensional linear hybrid cellular automata

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An image multiresolution representation for lossless and lossy compression

IEEE Transactions on Image Processing
Efficient general-purpose image compression with binary tree predictive coding

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new generalized particle model (GPM) to generate the prediction coding for lossless data compression. Local rules for particle movement in GPM, parallel algorithm and its implementation structure to generate the desired predictive coding are discussed. The proposed GPM approach has advantages in terms of encoding speed, parallelism, scalability, simplicity, and easy hardware implementation over other sequential lossless compression methods.