- 2076 Chaitra (CS II) · 4+6 marks
Entropy and information rate; Shannon limit as bandwidth → ∞
Short answer
Entropy H is the average information per symbol in bits/symbol. For a source emitting r symbols per second, information rate R = r H bits/s. As bandwidth B → ∞, Shannon capacity approaches C∞ = (S/N0) log2 e ≈ 1.44 S/N0 bits/s, with a required Eb/N0 of at least -1.6 dB.
State and derive the relation between entropy and information rate. Derive the expression which shows the limit of Shannon's channel capacity theorem when bandwidth tends to infinity.
Relation between entropy and information rate
Entropy is the average information per symbol, in bits/symbol. Information rate is the average information produced per second, in bits/s.
Derivation: let a discrete memoryless source emit symbols per second from an alphabet with probabilities .
- In a long time seconds the source emits symbols.
- Symbol occurs about times, and each occurrence carries bits.
- Total information in seconds:
- Information per second:
where is the symbol rate (symbols/s) and the entropy (bits/symbol). Example: symbols/s and bits/symbol give bits/s. For equally likely symbols, .
Limit of Shannon capacity when
Shannon–Hartley theorem for an AWGN channel (noise PSD , noise power ):
Rewrite with , so :
As , , and :
Meaning:
- Capacity does not become infinite when bandwidth becomes infinite, because noise power also increases. It approaches a finite limit set by .
- At this limit, with energy per bit :
This is the Shannon limit: no coding scheme can give reliable transmission with below −1.6 dB.
C
| ...................... 1.44 S/N0
| ..'
| .'
| .'
| /
+--------------------------------> B
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Information and entropy; capacity as bandwidth → ∞ · Communication Systems, chapter 6
- Shannon-Hartley theorem; capacity limit 1.44S/N₀ · Communication Systems, chapter 6 · asked 2×
- Shannon channel capacity theorem and its limitations · Communication Systems, chapter 6 · asked 2×
- Shannon channel capacity theorem and its implication · Communication Systems, chapter 6
- Duobinary error; entropy; capacity as B → ∞ · Communication Systems, chapter 6
- Entropy and information rate of 6-level PCM signal · Communication Systems, chapter 6
- Entropy, information and channel capacity · Data Communication, chapter 8
- Shannon-Hartley channel capacity theorem · Data Communication, chapter 1 · asked 3×
- Entropy and information rate, 5 outcomes · Data Communication, chapter 8
- State Nyquist and Shannon capacity formulae · Data Communication, chapter 1 · asked 2×