--- title: "Implications and limitations of Shannon-Hartley theorem" subject: "Communication Systems" chapter: 6 key: "semester_6/communication_systems:shannon-hartley-implications-limits" source: https://www.bctengineer.com/q/semester_6/communication_systems/shannon-hartley-implications-limits site: BCT Engineering --- # Implications and limitations of Shannon-Hartley theorem Communication Systems · Chapter 6: Baseband Digital Data Transmission - Asked in: 2076 Asoj (CS II), 8 marks - Video: [Channel Capacity by Shannon-Hartley | Basics, Proof & Maximum Bandwidth Condition](https://www.youtube.com/watch?v=3ekWsXeZ8TM) — Engineering Funda - Answer checked by Claude Opus 5.5 (high effort) on 2026-10-14 - Page: https://www.bctengineer.com/q/semester_6/communication_systems/shannon-hartley-implications-limits - Whole chapter: https://www.bctengineer.com/md/semester_6/communication_systems/chapter-6 ## Question Discuss with examples, the implications and limitations of Shannon Hartley Channel capacity theorem. ## Short answer Capacity C = B log2(1+S/N) sets an upper error-free rate for AWGN channels. It implies a bandwidth–SNR trade-off, limit examples such as 30.9 kbps for 3.1 kHz at 30 dB, and the asymptotic limit 1.44 S/N0 requiring Eb/N0 ≥ -1.6 dB. Limitations: assumes only AWGN, is non-constructive, needs infinite delay, and Gaussian signaling. ## Answer **Shannon–Hartley theorem:** the capacity of a channel of bandwidth $B$ Hz, disturbed by additive white Gaussian noise, with average signal power $S$ and noise power $N = N_0B$, is $$ C = B\log_2\left(1+\frac{S}{N}\right)\ \text{bits/s} $$ If the information rate $R \le C$, there exists a coding scheme giving an arbitrarily small error probability; if $R > C$, errors cannot be made small. #### Implications 1. **Upper bound on rate:** it gives the maximum error-free rate of any channel, a benchmark for real systems. Example: telephone line, $B = 3.1$ kHz, $S/N = 30$ dB (1000): $$ C = 3100\log_2(1001) = 30\ 898\ \text{bits/s} \approx 30.9\ \text{kbps} $$ This is why voice-band modems stopped near 33.6 kbps. 2. **Bandwidth–SNR trade-off:** the same capacity can be obtained with large bandwidth and low SNR, or small bandwidth and high SNR. To keep 30.9 kbps in half the bandwidth (1550 Hz) we need $S/N = 2^{30898/1550} - 1 \approx 1.0\times10^6$ (60 dB), much more power. Wideband systems (spread spectrum, FM, UWB) use bandwidth to save power. 3. **Noise does not forbid error-free communication;** it only limits the rate. Good channel coding (turbo, LDPC) approaches the limit. 4. **Bandwidth limit:** as $B \to \infty$, $C \to 1.44\,S/N_0$, and reliable transmission needs $E_b/N_0 \ge -1.6$ dB (Shannon limit). 5. **Bandwidth efficiency plane:** $C/B = \log_2(1 + S/N)$ separates possible from impossible regions for choosing modulation (e.g. 64-QAM needs high SNR). #### Limitations 1. It assumes **AWGN** only; it does not directly apply to impulse noise, interference, fading and multipath channels. 2. It is an **existence theorem**: it does not tell how to build the code or modulator that reaches capacity. 3. Reaching capacity needs very long code words, so **infinite delay and complexity**; practical systems operate below $C$. 4. It assumes a Gaussian-distributed signal, average power constraint and a linear, band-limited channel; practical signals use finite constellations (e.g. 16-QAM), which reach less. 5. Increasing bandwidth gives only a limited gain (capacity saturates at $1.44\,S/N_0$), and increasing SNR gives only a logarithmic gain: doubling $S/N$ at high SNR adds only about $B$ bits/s. **Example of the logarithmic limitation:** with $B = 3.1$ kHz, raising $S/N$ from 1000 to 2000 increases $C$ from 30.9 kbps to only about 34.0 kbps. ## Check yourself The answer's key points as multiple-choice questions, with the correct option and why. 1. According to the Shannon-Hartley theorem, what happens if R <= C? A. Error-free transmission is impossible B. A coding scheme exists with arbitrarily small error probability C. Errors are exactly zero with any code D. Bandwidth must be doubled Answer: B. For R <= C there exists a code giving arbitrarily small error; for R > C errors cannot be made small. (Key point: Theorem statement) 2. To keep the same capacity with half the bandwidth, what must happen? A. S/N can stay the same B. S/N must increase greatly (about 60 dB in the example) C. S/N can fall D. Nothing, capacity is independent of B Answer: B. C = B log2(1+S/N): halving B needs S/N of about 10^6 to keep 30.9 kbps. (Key point: Bandwidth-SNR trade-off) 3. Which is a limitation of the theorem? A. It gives the exact code to reach capacity B. It is an existence result needing very long codes, so practical systems operate below C C. It applies to all fading channels D. It needs zero noise Answer: B. It does not say how to build the code; approaching C needs infinite delay and complexity, and it assumes AWGN. (Key point: Existence theorem limitation) 4. At high SNR, doubling S/N increases capacity by about: A. Double B. B bits/s C. Zero D. B squared bits/s Answer: B. C grows with log2(S/N), so doubling S/N adds log2(2) x B = B bits/s. (Key point: Logarithmic SNR gain) ## Related in Communication Systems - [Shannon channel capacity theorem and its limitations](https://www.bctengineer.com/question.md?key=semester_6%2Fcommunication_systems%3Ashannon-capacity-limitations) — Communication Systems, chapter 6, asked 2× - [Shannon-Hartley theorem; capacity limit 1.44S/N₀](https://www.bctengineer.com/question.md?key=semester_6%2Fcommunication_systems%3Ashannon-hartley-1-44) — Communication Systems, chapter 6, asked 2× - [Shannon-Hartley theorem; energy/power of e^(−2t)u(t)](https://www.bctengineer.com/question.md?key=semester_6%2Fcommunication_systems%3Ashannon-hartley-energy-e2t) — Communication Systems, chapter 1 - [Shannon channel capacity theorem and its implication](https://www.bctengineer.com/question.md?key=semester_6%2Fcommunication_systems%3Ashannon-capacity-implication) — Communication Systems, chapter 6 - [Nyquist channel capacity theorem](https://www.bctengineer.com/question.md?key=semester_6%2Fcommunication_systems%3Anyquist-channel-capacity) — Communication Systems, chapter 6 ## Related in other subjects - [Shannon-Hartley channel capacity theorem](https://www.bctengineer.com/question.md?key=semester_5%2Fdata_communication%3Ashannon-hartley-theorem) — Data Communication, chapter 1, asked 3× - [State Nyquist and Shannon capacity formulae](https://www.bctengineer.com/question.md?key=semester_5%2Fdata_communication%3Anyquist-shannon-capacity-formula) — Data Communication, chapter 1, asked 2×