A VLSI architecture for cellular automata based parallel data compression

Authors:
S. Bhattacharjee;J. Bhattacharya;U. Raghavendra;D. Saha;P. Pal Chaudhuri
Affiliations:
-;-;-;-;-
Venue:
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Year:
1996

Citing 12
Cited 0

Data compression: methods and theory

Data compression: methods and theory
Text compression

Text compression
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Cellular automata based synthesis of easily and fully testable FSMs

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Computer Networks

Computer Networks
Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation

IEEE Transactions on Computers
Design of CAECC - Cellular Automata Based Error Correcting Code

IEEE Transactions on Computers
CA-Based Byte Error-Correcting Code

IEEE Transactions on Computers
An efficient data compression hardware based on cellular automata

DCC '95 Proceedings of the Conference on Data Compression
Cellular Automata

Cellular Automata
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
A Technique for High-Performance Data Compression

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

Analytical study of three neighbourhood two state per cell Cellular Automata (CA) behaviour is a comparatively recent phenomenon. A wide variety of applications have been developed utilizing the elegant structure of group CA. In this paper some of the characterizations of the state transition behaviour of non-group CA are reported. These results are subsequently utilized to develop an efficient parallel scheme for data compression. The experimental results confirms its superiority in terms of compression ratio over UNIX Compress and GZIP packages.