Share Email Print

Proceedings Paper

Encoding of multi-alphabet sources by binary arithmetic coding
Author(s): Muling Guo; Takahumi Oka; Shigeo Kato; Hiroshi Kajiwara; Naoto Kawamura
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In case of encoding a multi-alphabet source, the multi- alphabet symbol sequence can be encoded directly by a multi- alphabet arithmetic encoder, or the sequence can be first converted into several binary sequences and then each binary sequence is encoded by binary arithmetic encoder, such as the L-R arithmetic coder. Arithmetic coding, however, requires arithmetic operations for each symbol and is computationally heavy. In this paper, a binary representation method using Huffman tree is introduced to reduce the number of arithmetic operations, and a new probability approximation for L-R arithmetic coding is further proposed to improve the coding efficiency when the probability of LPS (Least Probable Symbol) is near 0.5. Simulation results show that our proposed scheme has high coding efficacy and can reduce the number of coding symbols.

Paper Details

Date Published: 28 December 1998
PDF: 9 pages
Proc. SPIE 3653, Visual Communications and Image Processing '99, (28 December 1998); doi: 10.1117/12.334610
Show Author Affiliations
Muling Guo, Utsunomiya Univ. (Japan)
Takahumi Oka, Utsunomiya Univ. (Japan)
Shigeo Kato, Utsunomiya Univ. (Japan)
Hiroshi Kajiwara, Canon Inc. (Japan)
Naoto Kawamura, Canon Inc. (Japan)

Published in SPIE Proceedings Vol. 3653:
Visual Communications and Image Processing '99
Kiyoharu Aizawa; Robert L. Stevenson; Ya-Qin Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top