A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries

Authors:
Ming-Bo Lin
Affiliations:
Department of Electronic Engineering, National Taiwan University of Science and Technology, 43, Keelung Road Section 4, Taipei, Taiwan
Venue:
Journal of VLSI Signal Processing Systems
Year:
2000

Citing 10
Cited 3

Design and analysis of dynamic Huffman codes

Journal of the ACM (JACM)
Data compression: methods and theory

Data compression: methods and theory
Data compression with finite windows

Communications of the ACM
Text compression

Text compression
Practical dictionary management for hardware data compression

Communications of the ACM
Data and image compression (4th ed.): tools and techniques

Data and image compression (4th ed.): tools and techniques
Digital Image Processing

Digital Image Processing
ALDC and Pre-Processor Extension, BLDC, Provide Ultra Fast Compression for General-Purpose and Bit-Mapped Image Data

DCC '95 Proceedings of the Conference on Data Compression
A Mathematical Theory of Communication

A Mathematical Theory of Communication
Efficient VLSI for Lempel-Ziv compression in wireless data communication networks

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

A lossless data compression and decompression algorithm and its hardware architecture

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A new architecture of a two-stage lossless data compression and decompression algorithm

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Cache aware compression for processor debug support

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.