Shannon's source coding theorem

From Wikipedia, the free encyclopedia

This article is about the theory of source coding in data compression. For the term in computer programming, see Source code.

This article does not cite any references or sources. (February 2008)
Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed.

In information theory, Shannon's source coding theorem (or noiseless coding theorem) establishes the limits to possible data compression, and the operational meaning of the Shannon entropy.

The source coding theorem shows that (in the limit, as the length of a stream of i.i.d. data tends to infinity) it is impossible to compress the data such that the code rate (average number of bits per symbol) is less than the Shannon entropy of the source, without it being virtually certain that information will be lost. However it is possible to get the code rate arbitrarily close to the Shannon entropy, with negligible probability of loss.

The source coding theorem for symbol codes places an upper and a lower bound on the minimal possible expected length of codewords as a function of the entropy of the input word (which is viewed as a random variable) and of the size of the target alphabet.

1 Statements
- 1.1 Source coding theorem
- 1.2 Source coding theorem for symbol codes
2 Proof: Source coding theorem
3 Proof: Source coding theorem for symbol codes
4 Extension to non-stationary independent sources
- 4.1 Fixed Rate lossless source coding for discrete time non-stationary independent sources
5 See also

[edit] Statements

Source coding is a mapping from (a sequence of) symbols from an information source to a sequence of alphabet symbols (usually bits) such that the source symbols can be exactly recovered from the binary bits (lossless source coding) or recovered within some distortion (lossy source coding). This is the concept behind data compression.

[edit] Source coding theorem

In information theory, the source coding theorem (Shannon 1948) informally states that:

"N i.i.d. random variables each with entropy H(X) can be compressed into more than NH(X) bits with negligible risk of information loss, as N tends to infinity; but conversely, if they are compressed into fewer than NH(X) bits it is virtually certain that information will be lost." (MacKay 2003).

[edit] Source coding theorem for symbol codes

Let $Σ 1$ , $Σ 2$ denote two finite alphabets and let $\Sigma_1^*$ and $\Sigma_2^*$ denote the set of all finite words from those alphabets (respectively).

Suppose that X is a random variable taking values in $Σ 1$ and let f be a decipherable code from $\Sigma_1^*$ to $\Sigma_2^*$ where $| Σ 2 | = a$ . Let S denote the random variable given by the wordlength f(X).

If f is optimal in the sense that it has the minimal expected wordlength for X, then

$\frac{H(X)}{\log_2 a} \leq \mathbb{E}S < \frac{H(X)}{\log_2 a} +1$

(Shannon 1948)

[edit] Proof: Source coding theorem

Given $X$ is an i.i.d. source, its time series X₁, ..., X_n is i.i.d. with entropy H(X) in the discrete-valued case and differential entropy in the continuous-valued case. The Source coding theorem states that for any $ε > 0$ for any rate larger than the entropy of the source, there is large enough $n$ and an encoder that takes $n$ i.i.d. repetition of the source, $X 1: n$ , and maps it to $n .(H (X) + ε)$ binary bits such that the source symbols $X 1: n$ are recoverable from the binary bits with probability at least $1 - ε$ .

Proof for achievablity

Fix some for any $ε > 0$ . The typical set, $A_n^\epsilon$ , is defined as follows:

$A_n^\epsilon =\; \left\{x_1^n : \left|-\frac{1}{n} \log p(X_1, X_2, ..., X_n) - H_n(X)\right|<\epsilon \right\}$

AEP shows that for large enough n, the probability that a sequence generated by the source lies in the typical set, $A_n^\epsilon$ , defined as approaches one. In particular there for large enough n, $P(A_n^\epsilon)>1-\epsilon$ (See AEP for a proof):

The definition of typical sets implies that those sequences that lie in the typical set satisfy:

$2^{-n(H(X)+\epsilon)} \leq p(x_1, x_2, ..., x_n) \leq 2^{-n(H(X)-\epsilon)}$

Note that:

The probability of a sequence from $X$ being drawn from ${A_\epsilon}^{(n)}$ is greater than $1 - ε$

$\left| {A_\epsilon}^{(n)} \right| \leq 2^{n(H(X)+\epsilon)}$ since the probability of the whole set ${A_\epsilon}^{(n)}$ is at most one.

$\left| {A_\epsilon}^{(n)} \right| \geq (1-\epsilon)2^{n(H(X)-\epsilon)}$ . For the proof, use the upper bound on the probability of each term in typical set and the lower bound on the probability of the whole set ${A_\epsilon}^{(n)}$ .

Since $\left| {A_\epsilon}^{(n)} \right| \leq 2^{n(H(X)+\epsilon)}, n.(H(X)+\epsilon)\;$ bits are enough to point to any string in this set.

The encoding algorithm: The encoder checks if the input sequence lies within the typical set; if yes, it outputs the index of the input sequence within the typical set; if not, the encoder outputs an arbitrary $n .(H (X) + ε)$ digit number. As long as the input sequence lies within the typical set (with probability at least $1 - ε$ ), the encoder doesn't make any error. So, the probability of error of the encoder is bounded above by $ε$

Proof for converse The converse is proved by showing that any set of size smaller than $A_n^\epsilon$ (in the sense of exponent) would cover a set of probability bounded away from 1.

[edit] Proof: Source coding theorem for symbol codes

Let $s i$ denote the wordlength of each possible $x i$ ( $i=1,\ldots,n$ ). Define $q_i = a^{-s_i}/C$ , where C is chosen so that $\sum q_i = 1$ .

Then

$\begin{matrix} H(X) &=& - \sum_{i=1}^n p_i \log_2 p_i \\ && \\ &\leq& - \sum_{i=1}^n p_i \log_2 q_i \\ && \\ &=& - \sum_{i=1}^n p_i \log_2 a^{-s_i} + \sum_{i=1}^n p_i \log_2 C \\ && \\ &=& - \sum_{i=1}^n p_i \log_2 a^{-s_i} + \log_2 C \\ && \\ &\leq& - \sum_{i=1}^n - s_i p_i \log_2 a \\ && \\ &\leq& \mathbb{E}S \log_2 a \\ \end{matrix}$

where the second line follows from Gibbs' inequality and the fifth line follows from Kraft's inequality: $C = \sum_{i=1}^n a^{-s_i} \leq 1$ so $\log C \leq 0$ .

For the second inequality we may set

$s_i = \lceil - \log_a p_i \rceil$

so that

$- \log_a p_i \leq s_i < -\log_a p_i + 1$

and so

$a^{-s_i} \leq p_i$

and

$\sum a^{-s_i} \leq \sum p_i = 1$

and so by Kraft's inequality there exists a prefix-free code having those wordlengths. Thus the minimal S satisfies

$\begin{matrix} \mathbb{E}S & = & \sum p_i s_i \\ && \\ & < & \sum p_i \left( -\log_a p_i +1 \right) \\ && \\ & = & \sum - p_i \frac{\log_2 p_i}{\log_2 a} +1 \\ && \\ & = & \frac{H(X)}{\log_2 a} +1 \\ \end{matrix}$

[edit] Extension to non-stationary independent sources

[edit] Fixed Rate lossless source coding for discrete time non-stationary independent sources

Define typical set $A_n^\epsilon$ as:

$A_n^\epsilon =\; \{x_1^n : \left|-\frac{1}{n} \log p(X_1, X_2, ..., X_n) - \bar{H_n}(X)\right|<\epsilon \}$

Then, for given $δ > 0$ , for n large enough, $\Pr(A_n^\epsilon)> 1-\delta$ . Now we just encode the sequences in the typical set, and usual methods in source coding show that the cardinality of this set is smaller than $2^{n(\bar{H_n}(X)+\epsilon)}$ . Thus, on an average, $\bar{H_n}(X)+\epsilon$ bits suffice for encoding with probability greater than $1 - δ$ , where $\epsilon\; \mbox{ and }\; \delta$ can be made arbitrarily small, by making n larger.