0% found this document useful (0 votes)
16 views

Abstract 19

The document discusses a VHDL implementation of the LZW compression algorithm. The LZW algorithm can compress various types of data like text, numbers, images by 40-60% using simple logic. This project implements the LZW algorithm in VHDL and verifies the simulation results, compressing 75KB/second on a 1-MIPS machine. The implementation aims to achieve higher compression percentages with less hardware resources.

Uploaded by

setsindia
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

Abstract 19

The document discusses a VHDL implementation of the LZW compression algorithm. The LZW algorithm can compress various types of data like text, numbers, images by 40-60% using simple logic. This project implements the LZW algorithm in VHDL and verifies the simulation results, compressing 75KB/second on a 1-MIPS machine. The implementation aims to achieve higher compression percentages with less hardware resources.

Uploaded by

setsindia
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

VHDL IMPLIMENTATION OF LZW COMPRESSION ALGORITHM Abstract The adaptive Lempel-Ziv-Welch general-purpose algorithm and its implementation suitable

for packet radio telephone transmission, and archival storage. While the statistical variable-length Huffman technique compresses text by 20%,the LZW technique can compress data (text, numeric, mixed, and bit-mapped images)by 40 to 60%. The adaptive LZW algorithm has very simple logic, leading to inexpensive and fast implementations. Good LXW implementations use 9- to 16-bit codes, handling most applications.A12-bit code is suitable for medium-size files. Efficiency improves with larger codes. A tight coding of the algorithm can compress 75 Kbytes in a second on a 1-MIPS machine. This project is implemented using VHDL &simulation results are verified. It encourages concurrent development in the area of data compression. The further enhancement of this project is to achieve more percentage of compression with less hardware.

You might also like