Typical set

In information theory, the typical set is a set of sequences whose probability is close to two raised to the negative power of the entropy of their source distribution. That this set has total probability close to one is a consequence of the asymptotic equipartition property (AEP) which is a kind of law of large numbers. The notion of typicality is only concerned with the probability of a sequence and not the actual sequence itself.

This has great use in compression theory as it provides a theoretical means for compressing data, allowing us to represent any sequence Xⁿ using nH(X) bits on average, and, hence, justifying the use of entropy as a measure of information from a source.

The AEP can also be proven for a large class of stationary ergodic processes, allowing typical set to be defined in more general cases.

(Weakly) typical sequences (weak typicality, entropy typicality)

If a sequence x₁, ..., x_n is drawn from an i.i.d. distribution X defined over a finite alphabet ${\mathcal {X}}$ , then the typical set, A_ε⁽ⁿ⁾ $\in {\mathcal {X}}$ ⁽ⁿ⁾ is defined as those sequences which satisfy:

2^{{-n[H(X)+\varepsilon ]}}\leqslant p(x_{1},x_{2},\dots ,x_{n})\leqslant 2^{{-n[H(X)-\varepsilon ]}}

Where

H(X)=-\sum _{{y\in {\mathcal {X}}}}p(y)\log _{2}p(y)

is the information entropy of X. The probability above need only be within a factor of 2^nε.

It has the following properties if n is sufficiently large, $\varepsilon >0$ can be chosen arbitrarily small so that:

The probability of a sequence from X being drawn from A_ε⁽ⁿ⁾ is greater than 1 − ε, i.e. $Pr[x^{{(n)}}\in A_{\epsilon }^{{(n)}}]\geq 1-\epsilon$
$\left|{A_{\varepsilon }}^{{(n)}}\right|\leqslant 2^{{n(H(X)+\varepsilon )}}$
$\left|{A_{\varepsilon }}^{{(n)}}\right|\geqslant (1-\varepsilon )2^{{n(H(X)-\varepsilon )}}$
Most sequences are not typical. If the distribution over ${\mathcal {X}}$ is not uniform, then the fraction of sequences that are typical is

{\frac {|A_{\epsilon }^{(n)}|}{|{\mathcal {X}}^{(n)}|}}\equiv {\frac {2^{nH(X)}}{2^{n\log _{2}|{\mathcal {X}}|}}}=2^{-n(\log _{2}|{\mathcal {X}}|-H(X))}\rightarrow 0

as n becomes very large, since

H(X)<\log _{2}|{\mathcal {X}}|,

where

|\mathcal{X}|

is the cardinality of

{\mathcal {X}}

For a general stochastic process {X(t)} with AEP, the (weakly) typical set can be defined similarly with p(x₁, x₂, ..., x_n) replaced by p(x₀^τ) (i.e. the probability of the sample limited to the time interval [0, τ]), n being the degree of freedom of the process in the time interval and H(X) being the entropy rate. If the process is continuous-valued, differential entropy is used instead.

Counter-intuitively, most likely sequence is often not a member of the typical set. For example, suppose that X is an i.i.d Bernoulli random variable with p(0)=0.1 and p(1)=0.9. In n independent trials, since p(1)>p(0), the most likely sequence of outcome is the sequence of all 1's, (1,1,...,1). Here the entropy of X is H(X)=0.469, while $-{\frac {1}{n}}\log _{2}p(x^{(n)}=(1,1,\ldots ,1))=-{\frac {1}{n}}\log _{2}(0.9^{n})=0.152$

So this sequence is not in the typical set because its average logarithmic probability cannot come arbitrarily close to the entropy of the random variable X no matter how large we take the value of n. For Bernoulli random variables, the typical set consists of sequences with average numbers of 0s and 1s in n independent trials. For this example, if n=10, then the typical set consist of all sequences that has a single 0 in the entire sequence. In case p(0)=p(1)=0.5, then every possible binary sequences belong to the typical set.

Strongly typical sequences (strong typicality, letter typicality)

If a sequence x₁, ..., x_n is drawn from some specified joint distribution defined over a finite or an infinite alphabet ${\mathcal {X}}$ , then the strongly typical set, A_ε,strong⁽ⁿ⁾ $\in {\mathcal {X}}$ is defined as the set of sequences which satisfy

\left|{\frac {N(x_{i})}{n}}-p(x_{i})\right|<{\frac {\varepsilon }{\|{\mathcal {X}}\|}}.

where ${N(x_{i})}$ is the number of occurrences of a specific symbol in the sequence.

It can be shown that strongly typical sequences are also weakly typical (with a different constant ε), and hence the name. The two forms, however, are not equivalent. Strong typicality is often easier to work with in proving theorems for memoryless channels. However, as is apparent from the definition, this form of typicality is only defined for random variables having finite support.

Jointly typical sequences

Two sequences $x^{n}$ and $y^n$ are jointly ε-typical if the pair $(x^{n},y^{n})$ is ε-typical with respect to the joint distribution $p(x^{n},y^{n})=\prod _{{i=1}}^{n}p(x_{i},y_{i})$ and both $x^{n}$ and $y^n$ are ε-typical with respect to their marginal distributions $p(x^{n})$ and $p(y^{n})$ . The set of all such pairs of sequences $(x^{n},y^{n})$ is denoted by $A_{{\varepsilon }}^{n}(X,Y)$ . Jointly ε-typical n-tuple sequences are defined similarly.

Let ${\tilde {X}}^{n}$ and ${\tilde {Y}}^{n}$ be two independent sequences of random variables with the same marginal distributions $p(x^{n})$ and $p(y^{n})$ . Then for any ε>0, for sufficiently large n, jointly typical sequences satisfy the following properties:

$P\left[(X^{n},Y^{n})\in A_{{\varepsilon }}^{n}(X,Y)\right]\geqslant 1-\epsilon$
$\left|A_{{\varepsilon }}^{n}(X,Y)\right|\leqslant 2^{{n(H(X,Y)+\epsilon )}}$
$\left|A_{{\varepsilon }}^{n}(X,Y)\right|\geqslant (1-\epsilon )2^{{n(H(X,Y)-\epsilon )}}$
$P\left[({\tilde {X}}^{n},{\tilde {Y}}^{n})\in A_{{\varepsilon }}^{n}(X,Y)\right]\leqslant 2^{{-n(I(X;Y)-3\epsilon )}}$
$P\left[({\tilde {X}}^{n},{\tilde {Y}}^{n})\in A_{{\varepsilon }}^{n}(X,Y)\right]\geqslant (1-\epsilon )2^{{-n(I(X;Y)+3\epsilon )}}$

Applications of typicality

Typical set encoding

In information theory, typical set encoding encodes only the typical set of a stochastic source with fixed length block codes. Asymptotically, it is, by the AEP, lossless and achieves the minimum rate equal to the entropy rate of the source.

Typical set decoding

In information theory, typical set decoding is used in conjunction with random coding to estimate the transmitted message as the one with a codeword that is jointly ε-typical with the observation. i.e.

{\hat {w}}=w\iff (\exists w)((x_{1}^{n}(w),y_{1}^{n})\in A_{{\varepsilon }}^{n}(X,Y))

where ${\hat {w}},x_{1}^{n}(w),y_{1}^{n}$ are the message estimate, codeword of message $w$ and the observation respectively. $A_{{\varepsilon }}^{n}(X,Y)$ is defined with respect to the joint distribution $p(x_{1}^{n})p(y_{1}^{n}|x_{1}^{n})$ where $p(y_{1}^{n}|x_{1}^{n})$ is the transition probability that characterizes the channel statistics, and $p(x_{1}^{n})$ is some input distribution used to generate the codewords in the random codebook.

Universal channel code

References

C. E. Shannon, "A Mathematical Theory of Communication", Bell System Technical Journal, vol. 27, pp. 379–423, 623-656, July, October, 1948
Cover, Thomas M. (2006). "Chapter 3: Asymptotic Equipartition Property, Chapter 5: Data Compression, Chapter 8: Channel Capacity". Elements of Information Theory. John Wiley & Sons. ISBN 0-471-24195-4.
David J. C. MacKay. Information Theory, Inference, and Learning Algorithms Cambridge: Cambridge University Press, 2003. ISBN 0-521-64298-1

This article is issued from Wikipedia - version of the 12/5/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.