Name
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%. > |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1109/26.20074 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Arithmetic,Hardware,Encoding,Very large scale integration,Codes,Communications Society,Context modeling,Statistics,Probability | Self-synchronizing code,Constant-weight code,Computer science,Systematic code,Polynomial code,Algorithm,Arithmetic,Cyclic code,Universal code,Prefix code,Variable-length code | Journal |
Volume | Issue | ISSN |
37 | 2 | 0090-6778 |
Citations | PageRank | References |
28 | 10.33 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jorma Rissanen | 1 | 1665 | 798.14 |
| K. M. Mohiuddin | 2 | 39 | 12.23 |