Paper
28 December 1998 Encoding of multi-alphabet sources by binary arithmetic coding
Muling Guo, Takahumi Oka, Shigeo Kato, Hiroshi Kajiwara, Naoto Kawamura
Author Affiliations +
Proceedings Volume 3653, Visual Communications and Image Processing '99; (1998) https://doi.org/10.1117/12.334610
Event: Electronic Imaging '99, 1999, San Jose, CA, United States
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Muling Guo, Takahumi Oka, Shigeo Kato, Hiroshi Kajiwara, and Naoto Kawamura "Encoding of multi-alphabet sources by binary arithmetic coding", Proc. SPIE 3653, Visual Communications and Image Processing '99, (28 December 1998); https://doi.org/10.1117/12.334610
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Computer programming

Computer simulations

Data compression

Polonium

Information technology

Lawrencium

Back to Top