Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Combinatorial Pattern Matching

CPM 2001: Combinatorial Pattern Matching pp 18–30Cite as

Parallel Lempel Ziv Coding (Extended Abstract)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2089))

Abstract

We explore the possibility of using multiple processors to improve the encoding and decoding tasks of Lempel Ziv schemes. A new layout of the processors is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. Experimental results show an improvement in compression and time over standard methods.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Agostino S., Storer J.A., Near Optimal Compression with Respect to a Static Dictionary on a Practical Massively Parallel Architecture, IEEE Computer Society Press (1995) 172–181.

    Google Scholar 

  2. De Agostino S., Storer J.A., Parallel Algorithms for Optimal Compression using Dictionaries with the Prefix Property, IEEE Computer Society Press (1992) 52–61.

    Google Scholar 

  3. Gonzalez Smith M.E., Storer J.A., Parallel Algorithms for Data Compression, Journal of the ACM32(2) (1985) 344–373.

    Article  MathSciNet  MATH  Google Scholar 

  4. Hirschberg D.S., Stauffer L.M., Parsing Algorithms for Dictionary Compression on the PRAM, IEEE Computer Society Press (1994) 136–145.

    Google Scholar 

  5. Howard P.G., Vitter J.S., Parallel lossless image compression using Huffman and arithmetic coding, Proc. Data Compression Conference DCC-92, Snowbird, Utah (1992) 299–308.

    Google Scholar 

  6. Iwata K., Morii M., Uyematsu T., Okamoto E., A simple parallel algorithm for the Ziv-Lempel encoding, IEICE Trans. FundamentalsE81-A (1998) 709–712.

    Google Scholar 

  7. Klein S.T., Wiseman Y., Parallel Huffman decoding, Proc. Data Compression Conference DCC-2000, Snowbird, Utah (2000) 383–392.

    Google Scholar 

  8. Lawrencece L.L., Przytycka T.M., Constructing Huffman Trees in Parallel, SIAM Journal of Computing24(6) (1995) 1163–1169.

    Article  Google Scholar 

  9. Storer J.A., Szymanski, T.G., Data compression via textual substitution, J. ACM29 (1982) 928–951.

    Article  MathSciNet  MATH  Google Scholar 

  10. Welch T.A., A technique for high-performance data compression, IEEE Computer17 (June 1984) 8–19.

    Article  Google Scholar 

  11. Whiting D.L., George G.A., Ivey G.E., Data Compression Apparatus and Method, U.S. Patent 5,126,739 (1992).

    Google Scholar 

  12. Williams R.N., An extremely fast Ziv-Lempel data compression algorithm, Proc. Data Compression Conference DCC-91, Snowbird, Utah (1991) 362–371.

    Google Scholar 

  13. Ziv J., Lempel A., A universal algorithm for sequential data compression, IEEE Trans. on Inf. Th.IT-23 (1977) 337–343.

    Article  MathSciNet  Google Scholar 

  14. Ziv J., Lempel A., Compression of individual sequences via variable-rate coding, IEEE Trans. on Inf. Th. IT-24 (1978) 530–536.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math. & CS, Bar Ilan University, Ramat-Gan, 52900, Israel

    Shmuel Tomi Klein

  2. Dept. of Math. & CS, Bar Ilan University Jerusalem College of Technology, Jerusalem

    Yair Wiseman

Authors
  1. Shmuel Tomi Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yair Wiseman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar-Ilan University, 52900, Ramat-Gan, Israel, Atlanta, Georgia, 30332-0280, USA

    Amihood Amir

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tomi Klein, S., Wiseman, Y. (2001). Parallel Lempel Ziv Coding (Extended Abstract). In: Amir, A. (eds) Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science, vol 2089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48194-X_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-48194-X_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42271-6

  • Online ISBN: 978-3-540-48194-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation