Channel capacity

Channel capacity, in electrical engineering, computer science, and information theory, is the theoretical maximum rate at which information can be reliably transmitted over a communication channel.

Following the terms of the noisy-channel coding theorem, the channel capacity of a given channel is the highest information rate (in units of information per unit time) that can be achieved with arbitrarily small error probability.^[1]^[2]

Information theory, developed by Claude E. Shannon in 1948, defines the notion of channel capacity and provides a mathematical model by which it may be computed. The key result states that the capacity of the channel, as defined above, is given by the maximum of the mutual information between the input and output of the channel, where the maximization is with respect to the input distribution.^[3]

The notion of channel capacity has been central to the development of modern wireline and wireless communication systems, with the advent of novel error correction coding mechanisms that have resulted in achieving performance very close to the limits promised by channel capacity.

Formal definition

The basic mathematical model for a communication system is the following:

\to_{Message}^{W} \begin{matrix} Encoder \\ f_{n} \end{matrix} \to_{\binom{E n c o d e d}{s e q u e n c e}}^{X^{n}} \begin{matrix} Channel \\ p (y | x) \end{matrix} \to_{\binom{R e c e i v e d}{s e q u e n c e}}^{Y^{n}} \begin{matrix} Decoder \\ g_{n} \end{matrix} \to_{\binom{E s t i m a t e d}{m e s s a g e}}^{\hat{W}}

where:

$W$ is the message to be transmitted;
$X$ is the channel input symbol ( $X^{n}$ is a sequence of $n$ symbols) taken in an alphabet $𝒳$ ;
$Y$ is the channel output symbol ( $Y^{n}$ is a sequence of $n$ symbols) taken in an alphabet $𝒴$ ;
$\hat{W}$ is the estimate of the transmitted message;
$f_{n}$ is the encoding function for a block of length $n$ ;
$p (y | x) = p_{Y | X} (y | x)$ is the noisy channel, which is modeled by a conditional probability distribution; and,
$g_{n}$ is the decoding function for a block of length $n$ .

Let $X$ and $Y$ be modeled as random variables. Furthermore, let $p_{Y | X} (y | x)$ be the conditional probability distribution function of $Y$ given $X$ , which is an inherent fixed property of the communication channel. Then the choice of the marginal distribution $p_{X} (x)$ completely determines the joint distribution $p_{X, Y} (x, y)$ due to the identity

p_{X, Y} (x, y) = p_{Y | X} (y | x) p_{X} (x)

which, in turn, induces a mutual information $I (X; Y)$ . The channel capacity is defined as

C = sup_{p_{X} (x)} I (X; Y)

where the supremum is taken over all possible choices of $p_{X} (x)$ .

Additivity of channel capacity

Channel capacity is additive over independent channels.^[4] It means that using two independent channels in a combined manner provides the same theoretical capacity as using them independently. More formally, let $p_{1}$ and $p_{2}$ be two independent channels modelled as above; $p_{1}$ having an input alphabet $𝒳_{1}$ and an output alphabet $𝒴_{1}$ . Idem for $p_{2}$ . We define the product channel $p_{1} \times p_{2}$ as $\forall (x_{1}, x_{2}) \in (𝒳_{1}, 𝒳_{2}), (y_{1}, y_{2}) \in (𝒴_{1}, 𝒴_{2}), (p_{1} \times p_{2}) ((y_{1}, y_{2}) | (x_{1}, x_{2})) = p_{1} (y_{1} | x_{1}) p_{2} (y_{2} | x_{2})$

This theorem states: $C (p_{1} \times p_{2}) = C (p_{1}) + C (p_{2})$

Proof

We first show that $C (p_{1} \times p_{2}) \geq C (p_{1}) + C (p_{2})$ .

Let $X_{1}$ and $X_{2}$ be two independent random variables. Let $Y_{1}$ be a random variable corresponding to the output of $X_{1}$ through the channel $p_{1}$ , and $Y_{2}$ for $X_{2}$ through $p_{2}$ .

By definition $C (p_{1} \times p_{2}) = sup_{p_{X_{1}, X_{2}}} (I (X_{1}, X_{2} : Y_{1}, Y_{2}))$ .

Since $X_{1}$ and $X_{2}$ are independent, as well as $p_{1}$ and $p_{2}$ , $(X_{1}, Y_{1})$ is independent of $(X_{2}, Y_{2})$ . We can apply the following property of mutual information: $I (X_{1}, X_{2} : Y_{1}, Y_{2}) = I (X_{1} : Y_{1}) + I (X_{2} : Y_{2})$

For now we only need to find a distribution $p_{X_{1}, X_{2}}$ such that $I (X_{1}, X_{2} : Y_{1}, Y_{2}) \geq I (X_{1} : Y_{1}) + I (X_{2} : Y_{2})$ . In fact, $π_{1}$ and $π_{2}$ , two probability distributions for $X_{1}$ and $X_{2}$ achieving $C (p_{1})$ and $C (p_{2})$ , suffice:

C (p_{1} \times p_{2}) \geq I (X_{1}, X_{2} : Y_{1}, Y_{2}) = I (X_{1} : Y_{1}) + I (X_{2} : Y_{2}) = C (p_{1}) + C (p_{2})

ie. $C (p_{1} \times p_{2}) \geq C (p_{1}) + C (p_{2})$

Now let us show that $C (p_{1} \times p_{2}) \leq C (p_{1}) + C (p_{2})$ .

Let $π_{12}$ be some distribution for the channel $p_{1} \times p_{2}$ defining $(X_{1}, X_{2})$ and the corresponding output $(Y_{1}, Y_{2})$ . Let $𝒳_{1}$ be the alphabet of $X_{1}$ , $𝒴_{1}$ for $Y_{1}$ , and analogously $𝒳_{2}$ and $𝒴_{2}$ .

By definition of mutual information, we have

$\begin{matrix} I (X_{1}, X_{2} : Y_{1}, Y_{2}) & = H (Y_{1}, Y_{2}) - H (Y_{1}, Y_{2} | X_{1}, X_{2}) \\ \leq H (Y_{1}) + H (Y_{2}) - H (Y_{1}, Y_{2} | X_{1}, X_{2}) \end{matrix}$

Let us rewrite the last term of entropy.

$H (Y_{1}, Y_{2} | X_{1}, X_{2}) = \sum_{(x_{1}, x_{2}) \in 𝒳_{1} \times 𝒳_{2}} ℙ (X_{1}, X_{2} = x_{1}, x_{2}) H (Y_{1}, Y_{2} | X_{1}, X_{2} = x_{1}, x_{2})$

By definition of the product channel, $ℙ (Y_{1}, Y_{2} = y_{1}, y_{2} | X_{1}, X_{2} = x_{1}, x_{2}) = ℙ (Y_{1} = y_{1} | X_{1} = x_{1}) ℙ (Y_{2} = y_{2} | X_{2} = x_{2})$ . For a given pair $(x_{1}, x_{2})$ , we can rewrite $H (Y_{1}, Y_{2} | X_{1}, X_{2} = x_{1}, x_{2})$ as:

$\begin{matrix} H (Y_{1}, Y_{2} | X_{1}, X_{2} = x_{1}, x_{2}) & = \sum_{(y_{1}, y_{2}) \in 𝒴_{1} \times 𝒴_{2}} ℙ (Y_{1}, Y_{2} = y_{1}, y_{2} | X_{1}, X_{2} = x_{1}, x_{2}) \log (ℙ (Y_{1}, Y_{2} = y_{1}, y_{2} | X_{1}, X_{2} = x_{1}, x_{2})) \\ = \sum_{(y_{1}, y_{2}) \in 𝒴_{1} \times 𝒴_{2}} ℙ (Y_{1}, Y_{2} = y_{1}, y_{2} | X_{1}, X_{2} = x_{1}, x_{2}) [\log (ℙ (Y_{1} = y_{1} | X_{1} = x_{1})) + \log (ℙ (Y_{2} = y_{2} | X_{2} = x_{2}))] \\ = H (Y_{1} | X_{1} = x_{1}) + H (Y_{2} | X_{2} = x_{2}) \end{matrix}$

By summing this equality over all $(x_{1}, x_{2})$ , we obtain $H (Y_{1}, Y_{2} | X_{1}, X_{2}) = H (Y_{1} | X_{1}) + H (Y_{2} | X_{2})$ .

We can now give an upper bound over mutual information:

$\begin{matrix} I (X_{1}, X_{2} : Y_{1}, Y_{2}) & \leq H (Y_{1}) + H (Y_{2}) - H (Y_{1} | X_{1}) - H (Y_{2} | X_{2}) \\ = I (X_{1} : Y_{1}) + I (X_{2} : Y_{2}) \end{matrix}$

This relation is preserved at the supremum. Therefore

C (p_{1} \times p_{2}) \leq C (p_{1}) + C (p_{2})

Combining the two inequalities we proved, we obtain the result of the theorem:

C (p_{1} \times p_{2}) = C (p_{1}) + C (p_{2})

Shannon capacity of a graph

If G is an undirected graph, it can be used to define a communications channel in which the symbols are the graph vertices, and two codewords may be confused with each other if their symbols in each position are equal or adjacent. The computational complexity of finding the Shannon capacity of such a channel remains open, but it can be upper bounded by another important graph invariant, the Lovász number.^[5]

Noisy-channel coding theorem

The noisy-channel coding theorem states that for any error probability ε > 0 and for any transmission rate R less than the channel capacity C, there is an encoding and decoding scheme transmitting data at rate R whose error probability is less than ε, for a sufficiently large block length. Also, for any rate greater than the channel capacity, the probability of error at the receiver goes to 0.5 as the block length goes to infinity.

Example application

An application of the channel capacity concept to an additive white Gaussian noise (AWGN) channel with B Hz bandwidth and signal-to-noise ratio S/N is the Shannon–Hartley theorem:

C = B \log_{2} (1 + \frac{S}{N})

C is measured in bits per second if the logarithm is taken in base 2, or nats per second if the natural logarithm is used, assuming B is in hertz; the signal and noise powers S and N are expressed in a linear power unit (like watts or volts²). Since S/N figures are often cited in dB, a conversion may be needed. For example, a signal-to-noise ratio of 30 dB corresponds to a linear power ratio of $1 0^{30 / 10} = 1 0^{3} = 1000$ .

Channel capacity estimation

To determine the channel capacity, it is necessary to find the capacity-achieving distribution $p_{X} (x)$ and evaluate the mutual information $I (X; Y)$ . Research has mostly focused on studying additive noise channels under certain power constraints and noise distributions, as analytical methods are not feasible in the majority of other scenarios. Hence, alternative approaches such as, investigation on the input support,^[6] relaxations^[7] and capacity bounds,^[8] have been proposed in the literature.

The capacity of a discrete memoryless channel can be computed using the Blahut-Arimoto algorithm.

Deep learning can be used to estimate the channel capacity. In fact, the channel capacity and the capacity-achieving distribution of any discrete-time continuous memoryless vector channel can be obtained using CORTICAL,^[9] a cooperative framework inspired by generative adversarial networks. CORTICAL consists of two cooperative networks: a generator with the objective of learning to sample from the capacity-achieving input distribution, and a discriminator with the objective to learn to distinguish between paired and unpaired channel input-output samples and estimates $I (X; Y)$ .

Channel capacity in wireless communications

This section^[10] focuses on the single-antenna, point-to-point scenario. For channel capacity in systems with multiple antennas, see the article on MIMO.

Bandlimited AWGN channel

If the average received power is $\bar{P}$ [W], the total bandwidth is $W$ in Hertz, and the noise power spectral density is $N_{0}$ [W/Hz], the AWGN channel capacity is

C_{AWGN} = W \log_{2} (1 + \frac{\bar{P}}{N_{0} W})

[bits/s],

where $\frac{\bar{P}}{N_{0} W}$ is the received signal-to-noise ratio (SNR). This result is known as the Shannon–Hartley theorem.^[11]

When the SNR is large (SNR ≫ 0 dB), the capacity $C \approx W \log_{2} \frac{\bar{P}}{N_{0} W}$ is logarithmic in power and approximately linear in bandwidth. This is called the bandwidth-limited regime.

When the SNR is small (SNR ≪ 0 dB), the capacity $C \approx \frac{\bar{P}}{N_{0} \ln 2}$ is linear in power but insensitive to bandwidth. This is called the power-limited regime.

The bandwidth-limited regime and power-limited regime are illustrated in the figure.

Frequency-selective AWGN channel

The capacity of the frequency-selective channel is given by so-called water filling power allocation,

C_{N_{c}} = \sum_{n = 0}^{N_{c} - 1} \log_{2} (1 + \frac{P_{n}^{*} | {\bar{h}}_{n} |^{2}}{N_{0}}),

where $P_{n}^{*} = max {(\frac{1}{λ} - \frac{N_{0}}{| {\bar{h}}_{n} |^{2}}), 0}$ and $| {\bar{h}}_{n} |^{2}$ is the gain of subchannel $n$ , with $λ$ chosen to meet the power constraint.

Slow-fading channel

In a slow-fading channel, where the coherence time is greater than the latency requirement, there is no definite capacity as the maximum rate of reliable communications supported by the channel, $\log_{2} (1 + | h |^{2} S N R)$ , depends on the random channel gain $| h |^{2}$ , which is unknown to the transmitter. If the transmitter encodes data at rate $R$ [bits/s/Hz], there is a non-zero probability that the decoding error probability cannot be made arbitrarily small,

p_{o u t} = ℙ (\log (1 + | h |^{2} S N R) < R)

,

in which case the system is said to be in outage. With a non-zero probability that the channel is in deep fade, the capacity of the slow-fading channel in strict sense is zero. However, it is possible to determine the largest value of $R$ such that the outage probability $p_{o u t}$ is less than $ϵ$ . This value is known as the $ϵ$ -outage capacity.

Fast-fading channel

In a fast-fading channel, where the latency requirement is greater than the coherence time and the codeword length spans many coherence periods, one can average over many independent channel fades by coding over a large number of coherence time intervals. Thus, it is possible to achieve a reliable rate of communication of $𝔼 (\log_{2} (1 + | h |^{2} S N R))$ [bits/s/Hz] and it is meaningful to speak of this value as the capacity of the fast-fading channel.

References

↑ Saleem Bhatti. "Channel capacity". Lecture notes for M.Sc. Data Communication Networks and Distributed Systems D51 -- Basic Communications and Networks. Archived from the original on 2007-08-21.
↑ Jim Lesurf. "Signals look like noise!". Information and Measurement, 2nd ed.
↑ Thomas M. Cover, Joy A. Thomas (2006). Elements of Information Theory. John Wiley & Sons, New York. ISBN 9781118585771.
↑ Cover, Thomas M.; Thomas, Joy A. (2006). "Chapter 7: Channel Capacity". Elements of Information Theory (Second ed.). Wiley-Interscience. pp. 206–207. ISBN 978-0-471-24195-9.
↑ Lovász, László (1979), "On the Shannon Capacity of a Graph", IEEE Transactions on Information Theory, IT-25 (1): 1–7, doi:10.1109/tit.1979.1055985.
↑ Smith, Joel G. (1971). "The information capacity of amplitude- and variance-constrained sclar gaussian channels". Information and Control. 18 (3): 203–219. doi:10.1016/S0019-9958(71)90346-9.
↑ Huang, J.; Meyn, S.P. (2005). "Characterization and Computation of Optimal Distributions for Channel Coding". IEEE Transactions on Information Theory. 51 (7): 2336–2351. doi:10.1109/TIT.2005.850108. ISSN 0018-9448. S2CID 2560689.
↑ McKellips, A.L. (2004). "Simple tight bounds on capacity for the peak-limited discrete-time channel". International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. IEEE. p. 348. doi:10.1109/ISIT.2004.1365385. ISBN 978-0-7803-8280-0. S2CID 41462226.
↑ Letizia, Nunzio A.; Tonello, Andrea M.; Poor, H. Vincent (2023). "Cooperative Channel Capacity Learning". IEEE Communications Letters. 27 (8): 1984–1988. arXiv:2305.13493. doi:10.1109/LCOMM.2023.3282307. ISSN 1089-7798.
↑ David Tse, Pramod Viswanath (2005), Fundamentals of Wireless Communication, Cambridge University Press, UK, ISBN 9780521845274
↑ The Handbook of Electrical Engineering. Research & Education Association. 1996. p. D-149. ISBN 9780878919819.

External links

"Transmission rate of a channel", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
AWGN Channel Capacity with various constraints on the channel input (interactive demonstration)

[1] Saleem Bhatti. "Channel capacity". Lecture notes for M.Sc. Data Communication Networks and Distributed Systems D51 -- Basic Communications and Networks. Archived from the original on 2007-08-21.

[2] Jim Lesurf. "Signals look like noise!". Information and Measurement, 2nd ed.

[3] Thomas M. Cover, Joy A. Thomas (2006). Elements of Information Theory. John Wiley & Sons, New York. ISBN 9781118585771.

[4] Cover, Thomas M.; Thomas, Joy A. (2006). "Chapter 7: Channel Capacity". Elements of Information Theory (Second ed.). Wiley-Interscience. pp. 206–207. ISBN 978-0-471-24195-9.

[5] Lovász, László (1979), "On the Shannon Capacity of a Graph", IEEE Transactions on Information Theory, IT-25 (1): 1–7, doi:10.1109/tit.1979.1055985.

[6] Smith, Joel G. (1971). "The information capacity of amplitude- and variance-constrained sclar gaussian channels". Information and Control. 18 (3): 203–219. doi:10.1016/S0019-9958(71)90346-9.

[7] Huang, J.; Meyn, S.P. (2005). "Characterization and Computation of Optimal Distributions for Channel Coding". IEEE Transactions on Information Theory. 51 (7): 2336–2351. doi:10.1109/TIT.2005.850108. ISSN 0018-9448. S2CID 2560689.

[8] McKellips, A.L. (2004). "Simple tight bounds on capacity for the peak-limited discrete-time channel". International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. IEEE. p. 348. doi:10.1109/ISIT.2004.1365385. ISBN 978-0-7803-8280-0. S2CID 41462226.

[9] Letizia, Nunzio A.; Tonello, Andrea M.; Poor, H. Vincent (2023). "Cooperative Channel Capacity Learning". IEEE Communications Letters. 27 (8): 1984–1988. arXiv:2305.13493. doi:10.1109/LCOMM.2023.3282307. ISSN 1089-7798.

[10] David Tse, Pramod Viswanath (2005), Fundamentals of Wireless Communication, Cambridge University Press, UK, ISBN 9780521845274

[11] The Handbook of Electrical Engineering. Research & Education Association. 1996. p. D-149. ISBN 9780878919819.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]