A multiplication-free multialphabet arithmetic code
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 37 (2) , 93-98
- https://doi.org/10.1109/26.20074
Abstract
A recursion for arithmetic codes used for data compression is described which requires no multiplication or division, even in the case of nonbinary alphabets. For this reason, such a code admits a simple and fast hardware implementation. The inputs to the code are, in addition to the symbols to be encoded, either the symbol probabilities or, more simply, the corresponding occurrence counts. Hence, the code is applicable in conjunction with stationary and nonstationary models alike. The code efficiency is typically in the range of 97-99%. >Keywords
This publication has 3 references indexed in Scilit:
- A simple general binary source code (Corresp.)IEEE Transactions on Information Theory, 1982
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Generalized Kraft Inequality and Arithmetic CodingIBM Journal of Research and Development, 1976