Shannon Channel Capacity Theorem
Also known as: channel capacity, information theory bound
Shannon's channel capacity theorem, published in 1948, establishes the maximum rate at which information can be reliably transmitted over a noisy channel. Expressed as C = B log2(1 + S/N) for additive white Gaussian noise (AWGN), it is a fundamental bound in information theory and communications engineering. Shannon proved that reliable communication is possible at any rate below capacity, and impossible above it. This theorem underpins the design of all modern communication systems and motivates coding theory, modulation, and signal processing techniques.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Shannon capacity is used to set design targets and benchmark system performance. Before designing a communication system, compute capacity to understand the ultimate theoretical limit. When evaluating a system, compare actual throughput to capacity to quantify efficiency. Capacity also guides resource allocation: power control, bandwidth allocation, coding rate selection. Use capacity analysis to justify investment in advanced technologies (MIMO, beamforming) by quantifying potential gains.
Strengths & limitations
- Provides a fundamental limit independent of specific code/modulation design
- Elegant closed-form formula for AWGN channels
- Extends to fading, interference, multi-user channels via information-theoretic generalizations
- Motivates entire field of coding theory (turbo, LDPC, polar codes all approach capacity)
- Invariant across technologies: capacity formula is valid for optical, RF, acoustic channels
- Allows trade-off analysis: explores gains from bandwidth expansion, power increase, or diversity
- AWGN capacity formula assumes infinite codeword length; practical finite-length codes are suboptimal
- Fading capacity requires full channel state information at transmitter for optimal power allocation (water-pouring)
- Formula assumes Gaussian input; some channels benefit from non-Gaussian modulation (rare)
- Capacity does not account for latency, complexity, or energy constraints; practical systems prioritize these
- Multi-user capacity is vastly more complex; interference channels have no closed-form capacity
Frequently asked
What is the relationship between Shannon capacity and spectral efficiency?
Spectral efficiency (bits per second per Hertz) is constrained by capacity divided by bandwidth: η ≤ C/B. For AWGN, η ≤ log2(1 + S/N). If system bandwidth is B and power is P, spectral efficiency is η = C/B. As SNR increases, spectral efficiency increases logarithmically; there is no hard limit but diminishing returns.
How does feedback affect capacity?
For memoryless AWGN channel, Shannon proved capacity is unchanged by feedback: information-theoretically, feedback cannot increase capacity. However, feedback enables adaptive coding (adjust rate based on CSI), which can improve practical performance. For channels with memory or feedback delay, capacity can increase.
What is water-pouring and why is it optimal for fading channels?
Water-pouring is an optimal power allocation strategy for fading channels: allocate more power when the channel is good (high gain) and less when bad (low gain). Mathematically, power P(h) = max(0, λ - N0 / |h|^2), where λ is a Lagrange multiplier set to satisfy total power constraint. This maximizes ergodic capacity.
Can capacity be exceeded with clever coding?
No. Shannon's noisy channel coding theorem is a fundamental limit: if transmission rate exceeds capacity, the probability of error cannot be made arbitrarily small, regardless of code complexity or decoding algorithm. The theorem states that achieving rate R < C with arbitrary error probability ε > 0 requires blocklength exponential in 1/ε.
Sources
- Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423. DOI: 10.1002/j.1538-7305.1948.tb01338.x ↗
- Cover, T. M., & Thomas, J. A. (1991). Elements of Information Theory. John Wiley & Sons. link ↗
How to cite this page
ScholarGate. (2026, June 3). Shannon Channel Capacity Theorem. ScholarGate. https://scholargate.app/en/telecommunications/shannon-capacity
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- LDPC CodesTelecommunications↔ compare
- MIMOTelecommunications↔ compare
- OFDMTelecommunications↔ compare
- Polar CodesTelecommunications↔ compare
- Turbo CodeTelecommunications↔ compare