Presentation 1996/7/26
Fast Adaptive Multialphabet Arithmetic Coding
Toshihiko Okamura,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) One disadvatage of adaptive multialphabet arithmetic coding is that it runs slowly. To improve its speed, we keep the total frequency an integral power of 2 and replace division in coding to simple bit shift. To do this, the total frequency must be constant. We update the cumulative frequency at short intervals, not per input symbol, to make the above improvement effective. Experimental results show that the encoding time of our method is 20% smaller than one of usual adaptive multialphabet arithmetic coding, while its compression ratio is typically only 0.5% worse.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) arithmetic coding / cumulative frequency
Paper # IT96-31
Date of Issue

Conference Information
Committee IT
Conference Date 1996/7/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fast Adaptive Multialphabet Arithmetic Coding
Sub Title (in English)
Keyword(1) arithmetic coding
Keyword(2) cumulative frequency
1st Author's Name Toshihiko Okamura
1st Author's Affiliation C&C Res. Labs., NEC Corp.()
Date 1996/7/26
Paper # IT96-31
Volume (vol) vol.96
Number (no) 203
Page pp.pp.-
#Pages 6
Date of Issue