Title :
An efficient repetition finder for improving dynamic Huffman coding
Author :
Kuo, Chia-Hsu ; Tsay, Mu-King ; Lu, Cheng-Chang
Author_Institution :
Network Planning Lab., Chunghwa Telecom Co. Ltd., Taiwan
fDate :
11/1/1997 12:00:00 AM
Abstract :
In this paper, a new repetition finder to be used with dynamic Huffman (1952) coding is proposed to improve the compression efficiency by reducing the redundancy due to string repetitions. Compared to the repetition finder proposed by Yokoo (1991), the proposed scheme effectively increases the numbers of consecutive symbols in the repetition mode and the total number of symbols in the repetition mode. Experimental results show that the proposed method outperforms the repetition finder of Yokoo by 14-40% in compression ratios with about the same memory requirement and running time
Keywords :
Huffman codes; data compression; compression efficiency; compression ratios; consecutive symbols; dynamic Huffman coding; experimental results; memory requirement; redundancy; repetition finder; running time; string repetitions; Communications Society; Data communication; Data compression; Delay; Electronic mail; Encoding; Frequency; Huffman coding; Laboratories; Telecommunications;
Journal_Title :
Communications, IEEE Transactions on
