A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture
Authors:
- Gene Eu JanGJGene Eu Jan
- 23 October 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 14 (9) , 925-936
Abstract
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 softwareKeywords
This publication has 15 references indexed in Scilit:
- Gbit/s lossless data compression hardwareIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- A parallel architecture for data compression2002
- A single-chip lossless data compressor2002
- Unified VLSI systolic array design for LZ data compressionIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2001
- A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel DictionariesJournal of Signal Processing Systems, 2000
- Efficient VLSI for Lempel-Ziv compression in wireless data communication networksIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1998
- Area efficient VLSI architectures for Huffman codingIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1993
- High-speed VLSI designs for Lempel-Ziv-based data compressionIEEE Transactions on Circuits and Systems II: Express Briefs, 1993
- Word-based dynamic algorithms for data compressionIEE Proceedings I Communications, Speech and Vision, 1992
- Fast decoding of the Huffman codesInformation Processing Letters, 1988