DocumentCode :
3384323
Title :
Speeding up arithmetic coding using greedy re-normalization
Author :
Jia, Yunwei ; Yang, En-Hui ; He, Da-Ke ; Chan, Steven
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fYear :
2003
fDate :
25-27 March 2003
Firstpage :
432
Abstract :
Summary form only given. A novel method that significantly reduces the computational complexity of the re-normalization step of arithmetic coding is described. Called greedy re-normalization, the method involves a reduction to both the number of re-normalizations required to encode and the number of operations within each re-normalization. To reduce the number of re-normalizations in the encoding sequence, the method adopts a dynamic re-normalization criterion. Experimental results show that the proposed greedy re-normalization method indeed improved the speed of arithmetic coding.
Keywords :
arithmetic codes; computational complexity; arithmetic coding; computational complexity; dynamic renormalization criterion; encoding sequence; greedy renormalization; Computational complexity; Data compression; Digital arithmetic; Electronic mail; Encoding; Helium; Information systems; Probability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 2003. Proceedings. DCC 2003
ISSN :
1068-0314
Print_ISBN :
0-7695-1896-6
Type :
conf
DOI :
10.1109/DCC.2003.1194051
Filename :
1194051
Link To Document :
بازگشت