DocumentCode
292336
Title
A new source coding method based on LZW adopting the least recently used deletion heuristic
Author
Hayashi, Sadataka ; Kubo, Jun-ichi ; Yamazato, Takaya ; Sasase, Iwao
Author_Institution
Dept. of Electr. Eng., Keio Univ., Yokohama, Japan
Volume
1
fYear
1993
fDate
19-21 May 1993
Firstpage
190
Abstract
A new source coding method based on the Lempel-Ziv-Welch (LZW) method assigns variable-length codewords instead of LZW´s fixed-length codewords. The proposed method has a least-recently-used (LRU) deletion heuristic queuing buffer each entry of which has a different parsed string. The queuing buffer is sorted according to the move-to-front rule for each time of encoding/decoding. The proposed method yields better performance in terms of compression ratio without degradation of the characteristics of LZW
Keywords
buffer storage; data compression; data structures; heuristic programming; queueing theory; sorting; source coding; variable length codes; Lempel-Ziv-Welch method; compression ratio; least recently used deletion heuristic; move-to-front rule; performance; queuing buffer; source coding; variable-length codewords; Application software; Communication channels; Communication networks; Computer networks; Costs; Data compression; Decoding; Dictionaries; Memory; Source coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on
Conference_Location
Victoria, BC
Print_ISBN
0-7803-0971-5
Type
conf
DOI
10.1109/PACRIM.1993.407191
Filename
407191
Link To Document