| Golomb Coding |
Shopping Coding |
Website Links For Coding |
Information AboutGolomb Coding |
| CATEGORIES ABOUT GOLOMB CODING | |
| lossless compression algorithms | |
|
that is, when small values are vastly more common than large values. It uses a tunable parameter ''b'' to divide an input value into two parts: , the result of a division by ''b'', and , the remainder. The quotient is sent in Unary Coding , followed by the remainder in Truncated Binary Encoding . When Golomb coding is equivalent to unary coding. Formally, the two parts are given by the following expression, where is the number being encoded: and The final result looks like: Note that can be of a varying number of bits. The parameter b is a function of the corresponding Bernoulli Process , which is parameterized by the probability of success in a given Bernoulli Trial . and are related by these inequalities: The Golomb code for this distribution is equivalent to the Huffman Code for the same probabilities, if it were possible to compute the Huffman code. Rice coding is a special case of Golomb coding first described by Robert Rice. It is equivalent to Golomb coding where the tunable parameter is a power of two. This makes it extremely efficient for use on Computer s, since the division operation becomes a Bitshift operation and the remainder operation becomes a Bitmask operation. APPLICATIONS The FLAC Audio Codec uses Rice coding to represent linear prediction residues. Apple 's ALAC Audio Codec uses modfied Rice coding after its Adaptive FIR filter. REFERENCES
|
|
|