DocumentCode
1812869
Title
A two-level N-ary tree based sequential data compression algorithm
Author
Shen, Guobin ; Luxi Yang ; Mao, Yimin
Author_Institution
Dept. of Radio Eng., Southeast Univ., Nanjing, China
Volume
1
fYear
1996
fDate
14-18 Oct 1996
Firstpage
702
Abstract
A universal structure, based on a two-level N-ary tree and suited for modifying all existing LZ algorithms, is proposed. Using this structure can largely limit matching scope and save time accordingly. It is applied to a typical LZ algorithm (LZW) and the results show that it does improve the encoding and decoding speed by about 40% in most cases
Keywords
data compression; encoding; sequential codes; sequential decoding; tree data structures; LZ algorithms; Lempel-Ziv algorithms; decoding speed; encoding speed; sequential data compression algorithm; two-level N-ary tree; Buildings; Data compression; Decoding; Dictionaries; Digital signal processing; Encoding; Jacobian matrices; Performance analysis; Runtime; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing, 1996., 3rd International Conference on
Conference_Location
Beijing
Print_ISBN
0-7803-2912-0
Type
conf
DOI
10.1109/ICSIGP.1996.567360
Filename
567360
Link To Document