What Does the Shannon-Hartley Theorem State?

The Shannon-Hartley theorem defines the theoretical upper bound on the rate at which data can be transmitted over a noisy communication channel without error. In classical computing and information theory, it establishes how channel bandwidth and signal-to-noise ratio together limit maximum data throughput.

The Channel Capacity Formula

The theorem expresses the channel capacity \(C\), measured in bits per second, as a function of the channel bandwidth \(B\) in hertz and the signal-to-noise ratio \(\text{SNR}\):

\[C = B \log_2\left(1 + \frac{S}{N}\right)\]

In this equation, \(S\) represents the average received signal power and \(N\) represents the average noise power over the bandwidth \(B\), assuming additive white Gaussian noise (AWGN). Because \(\frac{S}{N}\) is a linear power ratio, it is often converted from decibels using \(\frac{S}{N} = 10^{\text{SNR}_{\text{dB}} / 10}\).

Key Implications for Classical Computing

The theorem reveals several fundamental trade-offs in designing classical communication systems:

  • Bandwidth vs. Power: Increasing either the bandwidth \(B\) or the signal power \(S\) increases the maximum error-free data rate \(C\), though with diminishing returns for power due to the logarithm.
  • The Error-Free Threshold: For any transmission rate \(R < C\), there exists an error-correcting code that can achieve an arbitrarily low probability of error. Conversely, if \(R > C\), error-free transmission is impossible regardless of the coding scheme used.
  • Infinite Bandwidth Limit: Even if bandwidth \(B\) approaches infinity, channel capacity does not grow without bound because noise power \(N = N_0 B\) also scales with bandwidth. In that limit, capacity approaches \(\frac{S}{N_0 \ln 2} \approx 1.44 \frac{S}{N_0}\).

Practical Relevance

In real-world classical systems—such as Wi-Fi, Ethernet, fiber-optic links, and cellular networks—the Shannon-Hartley theorem serves as a benchmark for spectral efficiency. Modern modulation and forward error correction techniques, including LDPC and polar codes, aim to push practical data rates as close to the Shannon limit \(C\) as hardware and latency constraints allow.