# 6.31: Capacity of a Channel

- Page ID
- 1883

Learning Objectives

- Shannon derived the maximum datarate of a source coder's output that can be transmitted through a bandlimited additive white noise channel with no error.

In addition to the Noisy Channel Coding Theorem and its converse, Shannon also derived the capacity for a bandlimited (to **W **Hz) additive white noise channel. For this case, the signal set is unrestricted, even to the point that more than one bit can be transmitted each "bit interval." Instead of constraining channel code efficiency, the revised Noisy Channel Coding Theorem states that some error-correcting code exists such that as the block length increases, error-free transmission is possible if the source coder's datarate, \[\overline{B(A)}R\] is less than capacity.

\[C=W\log_{2}(1+SNR)\; bits/s\]

This result sets the maximum datarate of the source coder's output that can be transmitted through the bandlimited channel with no error. ** ^{1}** Shannon's proof of his theorem was very clever, and did not indicate what this code might be; it has never been found. Codes such as the Hamming code work quite well in practice to keep error rates low, but they remain greater than zero. Until the "magic" code is found, more important in communication system design is the converse. It states that if your data rate exceeds capacity, errors will overwhelm you no matter what channel coding you use. For this reason, capacity calculations are made to understand the fundamental limits on transmission rates.

Exercise \(\PageIndex{1}\)

The first definition of capacity applies only for binary symmetric channels, and represents the number of bits/transmission. The second result states capacity more generally, having units of bits/second. How would you convert the first definition's result into units of bits/second?

**Solution**

To convert to bits/second, we divide the capacity stated in bits/transmission by the bit interval duration **T**.

Example \(\PageIndex{1}\):

The telephone channel has a bandwidth of 3 kHz and a signal-to-noise ratio exceeding 30 dB (at least they promise this much). The maximum data rate a modem can produce for this wireline channel and hope that errors will not become rampant is the capacity.

\[C=3\times 10^{3}\log_{2}(1+10^{3})\]

\[C=29.901\; kbps\]

Thus, the so-called 33 kbps modems operate right at the capacity limit.

Note that the data rate allowed by the capacity can exceed the bandwidth when the signal-to-noise ratio exceeds 0 dB. Our results for BPSK and FSK indicated the bandwidth they require exceeds **1/T**. What kind of signal sets might be used to achieve capacity? Modem signal sets send more than one bit/transmission using a number, one of the most popular of which is **multi-level signaling**. Here, we can transmit several bits during one transmission interval by representing bit by some signal's amplitude. For example, two bits can be sent with a signal set comprised of a sinusoid with amplitudes of **±(A) **and **±(A/2)**.

### Footnotes

**1** The bandwidth restriction arises not so much from channel properties, but from spectral regulation, especially for wireless channels.

### Contributor

- ContribEEOpenStax