A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture

In this paper, we propose a new two-stage hardware architecture that combines the features of both parallel dictionary LZW (PDLZW) and an approximated adaptive Huffman (AH) algorithms. In this architecture, an ordered list instead of the tree-based structure is used in the AH algorithm for speeding up the compression data rate. The resulting architecture shows that it not only outperforms the AH algorithm at the cost of only one-fourth the hardware resource but it is also competitive to the performance of LZW algorithm (compress). In addition, both compression and decompression rates of the proposed architecture are greater than those of the AH algorithm even in the case realized by software

[1]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[2]  Andrzej Sieminski,et al.  Fast Decoding of the Huffman Codes , 1988, Inf. Process. Lett..

[3]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[4]  José Luis Núñez,et al.  Gbit/s lossless data compression hardware , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[5]  Nagarajan Ranganathan,et al.  High-speed VLSI designs for Lempel-Ziv-based data compression , 1993 .

[6]  Cheng-Wen Wu,et al.  Unified VLSI systolic array design for LZ data compression , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[8]  Ian H. Witten,et al.  Compressing and indexing documents and images , 1999 .

[9]  Ming-Bo Lin.  A Parallel VLSI Architecture For The LZW Data Compression Algorithm , 1997, Proceedings of Technical Papers. International Symposium on VLSI Technology, Systems, and Applications.

[10]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[11]  Wayne P. Burleson,et al.  Efficient VLSI for Lempel-Ziv compression in wireless data communication networks , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[12]  Michael John Sebastian Smith,et al.  Application-specific integrated circuits , 1997 .

[13]  Viktor K. Prasanna,et al.  Area efficient VLSI architectures for Huffman coding , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[14]  Roland Zito-Wolf.  A broadcast/reduce architecture for high-speed data compression , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[15]  Donald E. Knuth,et al.  Dynamic Huffman Coding , 1985, J. Algorithms.

[16]  David Harris,et al.  CMOS VLSI Design: A Circuits and Systems Perspective , 2004 .

[17]  Ian H. Witten,et al.  Managing gigabytes (2nd ed.): compressing and indexing documents and images , 1999 .

[18]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[19]  Khalid Sayood,et al.  Introduction to data compression (2nd ed.) , 2000 .

[20]  G. Blelloch.  Introduction to Data Compression * , 2022 .

[21]  Simon L. Peyton Jones,et al.  Word - based dynamic algorithms for data compression , 1992 .

[22]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[23]  N. Ranganathan,et al.  A parallel architecture for data compression , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[24]  Ming-Bo Lin.  A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries , 2000, J. VLSI Signal Process..

[25]  J. L. Chang,et al.  A single-chip lossless data compressor , 1995, 1995 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers.

[26]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .