Massively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression
Textual substitution is a powerful and practical method of lossless data compression, where repeated substrings are replaced by pointers into a dynamically changing dictionary of strings. They are often called dictionary methods or “LZ” methods after the important work of Lempel and Ziv. With many applications, high speed hardware that can perform compression or decompression in real time is essential. We present massively parallel approaches for real-time textual substitution.
KeywordsDictionary Entry Systolic Array Input Stream Input Alphabet Broadcast Tree
Unable to display preview. Download preview PDF.
- S. De Agostino and J. A. Storer . “Parallel Algorithms for Optimal Compression using Dictionaries with the Prefix Property”, Proceedings IEEE Data Compression Conference, Snowbird, Utah.Google Scholar
- A. Hartman and M. Rodeh , Optimal Parsing of Strings, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, editors), 155–167.Google Scholar
- V. S. Miller and M. N. Wegman . “Variations on a Theme by Lempel and Ziv”, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, editors), 131–140.Google Scholar
- J. H. Reif and J. A. Storer [1991b]. “Adaptive Lossless Data Compression over a Noisy Channel”, Proceedings Communication, Security, and Sequences Conference, Positano, Italy.Google Scholar
- J. B. Seery and J. Ziv . “A Universal Data Compression Algorithm: Description and Preliminary Results”, Technical Memorandum 77-1212-6, Bell Laboratories, Murray Hill, N.J.Google Scholar
- J. B. Seery and J. Ziv . “Further Results on Universal Data Compression”, Technical Memorandum 78-1212-8, Bell Laboratories, Murray Hill, N.J.Google Scholar
- J. A. Storer . Data Compression: Methods and Theory, Computer Science Press, Rockville, MI).Google Scholar
- J. Storer . “Massively Parallel System for High Speed Data Compression”, patent pending.Google Scholar
- J. A. Storer, J. H. Reif, and T. Markas . “A Massively Parallel VLSI Design for Data Compression using a Compact Dynamic Dictionary”, Proceedings IEEE VLSI Signal Processing Conference, San Diego, CA.Google Scholar
- J. A. Storer and T. G. Szymanski . “The Macro Model for Data Compression”, Proceedings Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA, 928–951.Google Scholar
- R. Zito-Wolf . “Broadcast / Reduce Architecture for High Speed Data Compression”, Proceedings Second IEEE Symposium on Parallel and Distributed Processing”, Dallas, TX, 1990, 174–181.Google Scholar
- R. Zito-Wolf [1990b]. “A Systolic Architecture for Sliding Window Data Compression”, Proceedings IEEE VLSI Signal Processing Conference, San Diego, CA, 1990, 339–351.Google Scholar