Quote: improvements to Lempel-Ziv data compression; takes advantage of multiple matches, short matches, and blocked I/O; smaller and faster

Quotation Skeleton

We observed a few drawbacks in the original … There may be many matches in the sliding … one of the matches … The proposed algorithm uses some the unused redundancy. … [p. 278] matches with lengths less than mL_n(x) may … [first] … [p. 279] One more enhancement … is to speed up the compression by using … [p. 280] the time taken for compression and decompression … [our ILZ algorithm] … If the input is a text file, we … in the range of 5 to 10 percent … [the original Lempel and Ziv algorithm]. [Image file compression is about the same]. … For swap files we get a compression [about 90%], which is a ten percent improvement over the previous algorithm. …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: data compression algorithms (53 items)