Arbitrarily varying channel

From Wikipedia, the free encyclopedia
Jump to: navigation, search

An arbitrarily varying channel (AVC) is a communication channel model used in coding theory, and was first introduced by Blackwell, Breiman, and Thomasian. This particular channel has unknown parameters that can change over time and these changes may not have a uniform pattern during the transmission of a codeword. \textstyle n uses of this channel can be described using a stochastic matrix \textstyle W^n: X^n \times \textstyle S^n \rightarrow Y^n, where \textstyle X is the input alphabet, \textstyle Y is the output alphabet, and \textstyle W^n (y | x, s) is the probability over a given set of states \textstyle S, that the transmitted input \textstyle x = (x_1, \ldots, x_n) leads to the received output \textstyle y = (y_1, \ldots, y_n). The state \textstyle s_i in set \textstyle S can vary arbitrarily at each time unit \textstyle i. This channel was developed as an alternative to Shannon's Binary Symmetric Channel (BSC), where the entire nature of the channel is known, to be more realistic to actual network channel situations.

Capacities and associated proofs[edit]

Capacity of deterministic AVCs[edit]

An AVC's capacity can vary depending on the certain parameters.

\textstyle R is an achievable rate for a deterministic AVC code if it is larger than \textstyle 0, and if for every positive \textstyle \varepsilon and \textstyle \delta, and very large \textstyle n, length-\textstyle n block codes exist that satisfy the following equations: \textstyle \frac{1}{n}\log N > R - \delta and \displaystyle \max_{s \in S^n} \bar{e}(s) \leq \varepsilon, where \textstyle N is the highest value in \textstyle Y and where \textstyle \bar{e}(s) is the average probability of error for a state sequence \textstyle s. The largest rate \textstyle R represents the capacity of the AVC, denoted by \textstyle c.

As you can see, the only useful situations are when the capacity of the AVC is greater than \textstyle 0, because then the channel can transmit a guaranteed amount of data \textstyle \leq c without errors. So we start out with a theorem that shows when \textstyle c is positive in a AVC and the theorems discussed afterward will narrow down the range of \textstyle c for different circumstances.

Before stating Theorem 1, a few definitions need to be addressed:

  • An AVC is symmetric if \displaystyle \sum_{s \in S}W(y|x, s)U(s|x') = \sum_{s \in S}W(y|x', s)U(s|x) for every \textstyle (x, x', y,s), where \textstyle x,x'\in X, \textstyle y \in Y, and \textstyle U(s|x) is a channel function \textstyle U: X \rightarrow S.
  • \textstyle X_r, \textstyle S_r, and \textstyle Y_r are all random variables in sets \textstyle X, \textstyle S, and \textstyle Y respectively.
  • \textstyle P_{X_r}(x) is equal to the probability that the random variable \textstyle X_r is equal to \textstyle x.
  • \textstyle P_{S_r}(s) is equal to the probability that the random variable \textstyle S_r is equal to \textstyle s.
  • \textstyle P_{X_{r}S_{r}Y_{r}} is the combined probability mass function (pmf) of \textstyle P_{X_r}(x), \textstyle P_{S_r}(s), and \textstyle W(y|x,s). \textstyle P_{X_{r}S_{r}Y_{r}} is defined formally as \textstyle P_{X_{r}S_{r}Y_{r}}(x,s,y) = P_{X_r}(x)P_{S_r}(s)W(y|x,s).
  • \textstyle H(X_r) is the entropy of \textstyle X_r.
  • \textstyle H(X_r|Y_r) is equal to the average probability that \textstyle X_r will be a certain value based on all the values \textstyle Y_r could possibly be equal to.
  • \textstyle I(X_r \land Y_r) is the mutual information of \textstyle X_r and \textstyle Y_r, and is equal to \textstyle H(X_r) - H(X_r|Y_r).
  • \displaystyle I(P) = \min_{Y_r} I(X_r \land Y_r), where the minimum is over all random variables \textstyle Y_r such that \textstyle X_r, \textstyle S_r, and \textstyle Y_r are distributed in the form of \textstyle P_{X_{r}S_{r}Y_{r}}.

Theorem 1: \textstyle c > 0 if and only if the AVC is not symmetric. If \textstyle c > 0, then \displaystyle c = \max_P I(P).

Proof of 1st part for symmetry: If we can prove that \textstyle I(P) is positive when the AVC is not symmetric, and then prove that \textstyle c = \max_P I(P), we will be able to prove Theorem 1. Assume \textstyle I(P) were equal to \textstyle 0. From the definition of \textstyle I(P), this would make \textstyle X_r and \textstyle Y_r independent random variables, for some \textstyle S_r, because this would mean that neither random variable's entropy would rely on the other random variable's value. By using equation \textstyle P_{X_{r}S_{r}Y_{r}}, (and remembering \textstyle P_{X_r} = P,) we can get,

\displaystyle P_{Y_r}(y) = \sum_{x\in X} \sum_{s\in S} P(x)P_{S_r}(s)W(y|x,s)
\textstyle \equiv (since \textstyle X_r and \textstyle Y_r are independent random variables, \textstyle W(y|x, s) = W'(y|s) for some \textstyle W')
\displaystyle P_{Y_r}(y) = \sum_{x\in X} \sum_{s\in S} P(x)P_{S_r}(s)W'(y|s)
\textstyle \equiv (because only \textstyle P(x) depends on \textstyle x now\textstyle )
\displaystyle P_{Y_r}(y) = \sum_{s\in S} P_{S_r}(s)W'(y|s) \left[\sum_{x\in X} P(x)\right]
\textstyle \equiv (because \displaystyle \sum_{x\in X} P(x) = 1)
\displaystyle P_{Y_r}(y) = \sum_{s\in S} P_{S_r}(s)W'(y|s)

So now we have a probability distribution on \textstyle Y_r that is independent of \textstyle X_r. So now the definition of a symmetric AVC can be rewritten as follows: \displaystyle \sum_{s \in S}W'(y|s)P_{S_r}(s) = \sum_{s \in S}W'(y|s)P_{S_r}(s) since \textstyle U(s|x) and \textstyle W(y|x, s) are both functions based on \textstyle x, they have been replaced with functions based on \textstyle s and \textstyle y only. As you can see, both sides are now equal to the \textstyle P_{Y_r}(y) we calculated earlier, so the AVC is indeed symmetric when \textstyle I(P) is equal to \textstyle 0. Therefore \textstyle I(P) can only be positive if the AVC is not symmetric.

Proof of second part for capacity: See the paper "The capacity of the arbitrarily varying channel revisited: positivity, constraints," referenced below for full proof.

Capacity of AVCs with input and state constraints[edit]

The next theorem will deal with the capacity for AVCs with input and/or state constraints. These constraints help to decrease the very large range of possibilities for transmission and error on an AVC, making it a bit easier to see how the AVC behaves.

Before we go on to Theorem 2, we need to define a few definitions and lemmas:

For such AVCs, there exists:

- An input constraint \textstyle \Gamma based on the equation \displaystyle g(x) = \frac{1}{n}\sum_{i=1}^n g(x_i), where \textstyle x \in X and \textstyle x = (x_1,\dots,x_n).
- A state constraint \textstyle \Lambda, based on the equation \displaystyle l(s) = \frac{1}{n}\sum_{i=1}^n l(s_i), where \textstyle s \in X and \textstyle s = (s_1,\dots,s_n).
- \displaystyle \Lambda_0(P) = \min \sum_{x \in X, s \in S}P(x)l(s)
- \textstyle I(P, \Lambda) is very similar to \textstyle I(P) equation mentioned previously, \displaystyle I(P, \Lambda) = \min_{Y_r} I(X_r \land Y_r), but now any state \textstyle s or \textstyle S_r in the equation must follow the \textstyle l(s) \leq \Lambda state restriction.

Assume \textstyle g(x) is a given non-negative-valued function on \textstyle X and \textstyle l(s) is a given non-negative-valued function on \textstyle S and that the minimum values for both is \textstyle 0. In the literature I have read on this subject, the exact definitions of both \textstyle g(x) and \textstyle l(s) (for one variable \textstyle x_i,) is never described formally. The usefulness of the input constraint \textstyle \Gamma and the state constraint \textstyle \Lambda will be based on these equations.

For AVCs with input and/or state constraints, the rate \textstyle R is now limited to codewords of format \textstyle x_1,\dots,x_N that satisfy \textstyle g(x_i) \leq \Gamma, and now the state \textstyle s is limited to all states that satisfy \textstyle l(s) \leq \Lambda. The largest rate is still considered the capacity of the AVC, and is now denoted as \textstyle c(\Gamma, \Lambda).

Lemma 1: Any codes where \textstyle \Lambda is greater than \textstyle \Lambda_0(P) cannot be considered "good" codes, because those kinds of codes have a maximum average probability of error greater than or equal to \textstyle \frac{N-1}{2N} - \frac{1}{n}\frac{l_{max}^2}{n(\Lambda - \Lambda_0(P))^2}, where \textstyle l_{max} is the maximum value of \textstyle l(s). This isn't a good maximum average error probability because it is fairly large, \textstyle \frac{N-1}{2N} is close to \textstyle \frac{1}{2}, and the other part of the equation will be very small since the \textstyle (\Lambda - \Lambda_0(P)) value is squared, and \textstyle \Lambda is set to be larger than \textstyle \Lambda_0(P). Therefore it would be very unlikely to receive a codeword without error. This is why the \textstyle \Lambda_0(P) condition is present in Theorem 2.

Theorem 2: Given a positive \textstyle \Lambda and arbitrarily small \textstyle \alpha > 0, \textstyle \beta > 0, \textstyle \delta > 0, for any block length \textstyle n \geq n_0 and for any type \textstyle P with conditions \textstyle \Lambda_0(P) \geq \Lambda + \alpha and \displaystyle \min_{x \in X}P(x) \geq \beta, and where \textstyle P_{X_r} = P, there exists a code with codewords \textstyle x_1,\dots,x_N, each of type \textstyle P, that satisfy the following equations: \textstyle \frac{1}{n}\log N > I(P,\Lambda) - \delta, \displaystyle \max_{l(s) \leq \Lambda} \bar{e}(s) \leq \exp(-n\gamma), and where positive \textstyle n_0 and \textstyle \gamma depend only on \textstyle \alpha, \textstyle \beta, \textstyle \delta, and the given AVC.

Proof of Theorem 2: See the paper "The capacity of the arbitrarily varying channel revisited: positivity, constraints," referenced below for full proof.

Capacity of randomized AVCs[edit]

The next theorem will be for AVCs with randomized code. For such AVCs the code is a random variable with values from a family of length-n block codes, and these codes are not allowed to depend/rely on the actual value of the codeword. These codes have the same maximum and average error probability value for any channel because of its random nature. These types of codes also help to make certain properties of the AVC more clear.

Before we go on to Theorem 3, we need to define a couple important terms first:

\displaystyle W_{\zeta}(y|x) = \sum_{s \in S} W(y|x, s)P_{S_r}(s)
\textstyle I(P, \zeta) is very similar to the \textstyle I(P) equation mentioned previously, \displaystyle I(P, \zeta) = \min_{Y_r} I(X_r \land Y_r), but now the pmf \textstyle P_{S_r}(s) is added to the equation, making the minimum of \textstyle I(P, \zeta) based a new form of \textstyle P_{X_{r}S_{r}Y_{r}}, where \textstyle W_{\zeta}(y|x) replaces \textstyle W(y|x, s).

Theorem 3: The capacity for randomized codes of the AVC is \displaystyle c = max_P I(P, \zeta).

Proof of Theorem 3: See paper "The Capacities of Certain Channel Classes Under Random Coding" referenced below for full proof.

See also[edit]

References[edit]