- 2070 Asar (CS II) · 2+4 marks
Information and entropy; capacity as bandwidth → ∞
Short answer
Information of a symbol with probability p is log2(1/p) bits; entropy is the average. As bandwidth tends to infinity, channel capacity tends to the finite limit C = 1.44 S/N0 bits/s.
Define Information and Entropy. Calculate the upper limit of the channel capacity as the bandwidth of the channel B tends to infinity.
Information and entropy
- Information: the amount of information in a message of probability is bits. Less likely messages carry more information; a certain message carries none.
- Entropy: the average information per symbol of a source:
Upper limit of channel capacity as
Shannon–Hartley: for an AWGN channel with signal power and noise PSD (so ),
Let , so :
When , , and the standard limit gives
Capacity stays finite because the noise power grows in proportion to the bandwidth. At this limit the energy per bit satisfies (−1.6 dB), the Shannon limit.
Answer: bits/s.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Entropy and information rate; Shannon limit as bandwidth → ∞ · Communication Systems, chapter 6
- Duobinary error; entropy; capacity as B → ∞ · Communication Systems, chapter 6
- Shannon-Hartley theorem; capacity limit 1.44S/N₀ · Communication Systems, chapter 6 · asked 2×
- Entropy and information rate of 6-level PCM signal · Communication Systems, chapter 6
- Symbol rate, entropy and information rate (6 symbols per 10 μs) · Communication Systems, chapter 6
- Message vs information; entropy · Communication Systems, chapter 6
- Entropy, information and channel capacity · Data Communication, chapter 8
- Define information and entropy · Data Communication, chapter 8 · asked 3×
- Entropy and information rate, 5 outcomes · Data Communication, chapter 8
- Entropy, information gain and ID3 tree · Data Mining, chapter 3