Systolic implementations of a move-to-front text compressor

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 highspeed 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.