Content deleted Content added
→Overview: replace the cryptic figure with this one that shows more |
→Applications: normalize figure style |
||
Line 149:
== Applications ==
[[
Numerous signal codecs use a Rice code for [[prediction]] residues.
Line 158 ⟶ 159:
The Golomb–Rice coder is used in the entropy coding stage of [[Rice Algorithm]] based ''lossless image codecs''. One such experiment yields a compression ratio graph given below. See other entries in this category at the bottom of this page. In those compression, the progressive space differential data yields an alternating suite of positive and negative values around 0, which are remapped to positive-only integers (by doubling the absolute value and adding one if the input is negative), and then Rice–Golomb coding is applied by varying the divisor which remains small.{{Citation needed|date=December 2008}}
▲[[Image:Golomb coded Rice Algorithm experiment Compression Ratios.png|frame|center|Golomb-coded Rice algorithm experiment compression ratios]]
In those results, the Rice coding may create very long sequences of one-bits for the quotient; for practical reasons, it is often necessary to limit the total run-length of one-bits, so a modified version of the Rice–Golomb encoding consists of replacing the long string of one-bits by encoding its length with a recursive Rice–Golomb encoding; this requires reserving some values in addition to the initial divisor ''k'' to allow the necessary distinction.
| |||