A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries
- 178 Downloads
In this paper, a parallel dictionary based LZW algorithm called PDLZW algorithm and its hardware architecture for compression and decompression processors are proposed. In this architecture, instead of using a unique fixed-word-width dictionary a hierarchical variable-word-width dictionary set containing several dictionaries of small address space and increasing word widths is used for both compression and decompression algorithms. The results show that the new architecture not only can be easily implemented in VLSI technology because of its high regularity but also has faster compression and decompression rate since it no longer needs to search the dictionary recursively as the conventional implementations do.
Unable to display preview. Download preview PDF.
- 1.Ming-Bo Lin, “A parallel VLSI architecture for the LZW data compression algorithm,” International Symposium on VLSI Technology, Systems, and Applications, June 3-5, 1997, Taiwan, pp. 98–101.Google Scholar
- 2.T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression, Englewood Cliffs, N.J.: Prentice-Hall, 1990.Google Scholar
- 3.Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing, Reading, Massachusetts: Addison-Welsley Publishing Company, 1992.Google Scholar
- 13.D.J. Craft, “ADLC and a pre-processor extension, BDLC, provide ultra fast compression for general-purpose and bit-mapped image data,” Proc. Data Compression Conf., 1995, p. 440.Google Scholar
- 15.Gilbert Held, Data and Image Compression: Tools and Techniques, 4th edn., New York: John Wiley & Sons, 1996.Google Scholar
- 18.J. Storer, Data Compression Methods and Theory, Rockville, MD: Computer Science Press, 1988.Google Scholar
- 19.T. Halfhill, “How safe is data compression,” BYTE, 1994, pp. 56–74.Google Scholar
- 20.J. Jiang and S. Jones, “Word-based dynamic algorithms for data compression,” IEE Proceedings-I, vol. 139, no.6, 1992, pp. 582–586.Google Scholar