Systolic implementations of a move-to-front text compressor

Authors:
Clark D. Thomborson;Belle W.-Y. Wei
Affiliations:
Computer Science Department, University of Minnesota, 10 University Drive, Duluth, Minnesota;Department of Electrical Engineering, San Jose State University, 1 Washington Square, San Jose, California
Venue:
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Year:
1991

Citing 8
Cited 0

Parallel algorithms for data compression

Journal of the ACM (JACM)
A locally adaptive data compression scheme

Communications of the ACM
Interval and recency rank source coding: two on-line adaptive variable-length schemes

IEEE Transactions on Information Theory
Data compression

ACM Computing Surveys (CSUR)
Application of splay trees to data compression

Communications of the ACM
Data compression with finite windows

Communications of the ACM
Arithmetic coding for data compression

Communications of the ACM
Technical correspondence

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give systolic implementations for three variants of the move-to-front coding algorithm discussed in recent journal articles by Ryabko, Elias, and Bentley, Sleator, Tarjan, and Wei. Our intent is to make a simple high-speed text-compression system for both data transmission and data storage devices. Comparing our implementations with previously-proposed software and hardware devices for these applications, we conclude that our implementations should operate at much higher bandwidth than any known high-compression algorithm, and at higher bandwidth and comparable compression to the Lempel-Ziv-Welch and Smith-Storer hardware.