Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. De Agostino and J. A. Storer [1992]. “Parallel Algorithms for Optimal Compression using Dictionaries with the Prefix Property”, Proceedings IEEE Data Compression Conference, Snowbird, Utah.
E. R. Fiala and D. H. Greene [1989]. “Data Compression with Finite Windows”, Communications of the ACM 32:4, 490–505.
M. Gonzalez and J. A. Storer [1985]. “Parallel Algorithms for Data Compression”, Journal of the ACM 32:2, 344–373.
A. Hartman and M. Rodeh [1985], Optimal Parsing of Strings, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, editors), 155–167.
A. Lempel and J. Ziv [1976]. “On the Complexity of Finite Sequences”, IEEE Transactions on Information Theory 22:1, 75–81.
E. M. McCreight [1976]. “A Space-Economical Suffix Tree Construction Algorithm”, Journal of the ACM 23:2, 262–272.
V. S. Miller and M. N. Wegman [1985]. “Variations on a Theme by Lempel and Ziv”, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, editors), 131–140.
J. H. Reif and J. A. Storer [1991]. “A Parallel Architecture for High Speed Data Compression”, Journal of Parallel and Distributed Computing 13, 222–227.
J. H. Reif and J. A. Storer [1991b]. “Adaptive Lossless Data Compression over a Noisy Channel”, Proceedings Communication, Security, and Sequences Conference, Positano, Italy.
M. Rodeh, V. R. Pratt, and S. Even [1980]. “Linear Algorithms for Compression Via String Matching”, Journal of the ACM 28:1, 16–24.
J. B. Seery and J. Ziv [1977]. “A Universal Data Compression Algorithm: Description and Preliminary Results”, Technical Memorandum 77-1212-6, Bell Laboratories, Murray Hill, N.J.
J. B. Seery and J. Ziv [1978]. “Further Results on Universal Data Compression”, Technical Memorandum 78-1212-8, Bell Laboratories, Murray Hill, N.J.
J. A. Storer [1988]. Data Compression: Methods and Theory, Computer Science Press, Rockville, MI).
J. Storer [1991]. “Massively Parallel System for High Speed Data Compression”, patent pending.
J. A. Storer, J. H. Reif, and T. Markas [1990]. “A Massively Parallel VLSI Design for Data Compression using a Compact Dynamic Dictionary”, Proceedings IEEE VLSI Signal Processing Conference, San Diego, CA.
J. A. Storer and T. G. Szymanski [1978]. “The Macro Model for Data Compression”, Proceedings Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA, 928–951.
J. A. Storer and T. G. Szymanski [1982]. “Data Compression Via Textual Substitution”, Journal of the A CM 29:4, 928–951.
R.A. Wagner [1973], Common Phrases and Minimum Text Storage, Communications of the ACM 16, 148–152.
T. A. Welch [1984]. “A Technique for High-Performance Data Compression”, IEEE Computer 17:6, 8–19.
R. Zito-Wolf [1990]. “Broadcast / Reduce Architecture for High Speed Data Compression”, Proceedings Second IEEE Symposium on Parallel and Distributed Processing”, Dallas, TX, 1990, 174–181.
R. Zito-Wolf [1990b]. “A Systolic Architecture for Sliding Window Data Compression”, Proceedings IEEE VLSI Signal Processing Conference, San Diego, CA, 1990, 339–351.
J. Ziv and A. Lempel [1977]. “A Universal Algorithm for Sequential Data Compression”, IEEE Transactions on Information Theory 23:3, 337–343.
J. Ziv and A. Lempel [1978]. “Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Transactions on Information Theory 24:5, 530–536.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Storer, J.A. (1992). Massively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression. In: Storer, J.A. (eds) Image and Text Compression. The Kluwer International Series in Engineering and Computer Science, vol 176. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3596-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3596-6_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6598-3
Online ISBN: 978-1-4615-3596-6
eBook Packages: Springer Book Archive