Share Email Print

Proceedings Paper

New multialphabet multiplication-free arithmetic codes
Author(s): Shawmin Lei
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Arithmetic coding is a powerful lossless data compression technique that has attracted much attention in recent years. It provides more flexibility and better efficiency than the celebrated Huffman coding does. However, the multiplications needed in its encoding and decoding algorithms are very undesirable. Rissanen and Mohiuddin have proposed a simple scheme to avoid the multiplications. We found that the performance of their proposed scheme might degrade significantly in some cases. In this paper, we propose a multiplication-free multialphabet arithmetic code which can be shown to have only minor performance degradation in all cases. In our proposed scheme, each multiplication is replaced by a single shift-and-add. We prove, by both theoretical analysis and simulation results, that the degradation of the proposed multiplication-free scheme is always several times smaller than that of the Rissanen-Mohiuddin's scheme.

Paper Details

Date Published: 22 October 1993
PDF: 10 pages
Proc. SPIE 2094, Visual Communications and Image Processing '93, (22 October 1993); doi: 10.1117/12.157904
Show Author Affiliations
Shawmin Lei, Bell Communications Research (United States)

Published in SPIE Proceedings Vol. 2094:
Visual Communications and Image Processing '93
Barry G. Haskell; Hsueh-Ming Hang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?