Paper
22 October 1993 New multialphabet multiplication-free arithmetic codes
Shawmin Lei
Author Affiliations +
Proceedings Volume 2094, Visual Communications and Image Processing '93; (1993) https://doi.org/10.1117/12.157904
Event: Visual Communications and Image Processing '93, 1993, Cambridge, MA, United States
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shawmin Lei "New multialphabet multiplication-free arithmetic codes", Proc. SPIE 2094, Visual Communications and Image Processing '93, (22 October 1993); https://doi.org/10.1117/12.157904
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Promethium

Computer programming

Image stacking

Data modeling

Computer simulations

Data compression

High power microwaves

Back to Top