Skip to main content

Shannon’s Theorem vs. Shannon-Hartley Theorem: Full Comparison


Information Theory vs. Physical Reality

Distinguishing Shannon's Noisy-Channel Coding Theorem from the Shannon-Hartley Formula.

In the pantheon of communication engineering, Claude Shannon’s 1948 paper, "A Mathematical Theory of Communication," serves as the bedrock. However, students and engineers often conflate his general theorem on error-free communication with the specific formula used to calculate bandwidth capacity. To understand modern telecommunications, one must distinguish between the Existence Proof and the Physical Bound.

A. Shannon's Noisy-Channel Coding Theorem

The Fundamental Existence Proof

This theorem is the universal law of reliability. It states that for any communication channel, there exists a capacity $C$ such that if the information rate $R$ is less than $C$, then an error-correcting code exists that allows the probability of error to approach zero ($P_e \to 0$).

The General Mutual Information Capacity:

C = maxP(x) I(X; Y)

Key Mathematical Implications:

  • Entropy and Mutual Information: $I(X; Y) = H(X) - H(X|Y)$. This defines capacity as the maximum reduction in uncertainty about the transmitter $X$ given the received signal $Y$.
  • The $P_e$ Threshold: If $R > C$, the probability of error is bounded away from zero; reliable communication is impossible regardless of coding complexity.
  • Non-Constructive: The theorem proves a code exists but does not define the algorithm to build it.

B. The Shannon-Hartley Theorem

The Physical Channel Limit

This is a specific application of the general theorem. It applies the concept of capacity to a continuous-time analog channel subject to Additive White Gaussian Noise (AWGN).

The AWGN Capacity Formula:

C = B log2(1 + S/N)

Key Mathematical Implications:

  • Logarithmic Scaling: Doubling the Signal Power ($S$) does not double the capacity; it only increases it logarithmically.
  • Linear Bandwidth Scaling: Doubling the Bandwidth ($B$) provides a linear increase in capacity (assuming $S/N$ remains constant).
  • The Gaussian Assumption: This formula assumes noise follows a normal distribution, which represents the "worst-case" interference for a given power.

Comparative Analysis

Feature Shannon’s Coding Theorem Shannon-Hartley Theorem
Scope Abstract / Information Logic Physical / Electromagnetic
Channel Type Any (Discrete or Continuous) AWGN (Analog Band-limited)
Variables Probability Distributions ($P(x)$) Watts, Hertz, Joules
Operational Goal Reliability (Error Correction) Efficiency (Spectral Bounds)

The Mathematical Bridge: Spectral Efficiency

To bridge these two concepts, we analyze Spectral Efficiency ($\eta$), measured in bits per second per Hertz (bps/Hz).

The relationship between the Shannon-Hartley bound and energy efficiency is expressed by:

ฮท = C / B = log2(1 + S/N)

By substituting $S/N = (E_b/N_0) \cdot (R/B)$, and setting $R = C$ (at the limit):

Eb/N0 = (2ฮท - 1) / ฮท

Physical Interpretation:

This equation allows us to visualize the trade-off between power and bandwidth. As bandwidth $B \to \infty$ (and thus $\eta \to 0$), we apply L'Hรดpital's rule to the expression above, which yields the Ultimate Shannon Limit:

Eb/N0 = ln(2) ≈ -1.59 dB

"Shannon's Theorem promises us that perfect communication is possible; the Shannon-Hartley Theorem defines the boundaries of the universe in which we must build it."

Contact Us

Name

Email *

Message *

Popular Posts

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions ๐Ÿ“‹ Exam Pattern ๐Ÿ’ก Preparation Tips ❓ FAQs ๐Ÿ“Š Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) ๐Ÿ“ฅ Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading ๐Ÿ“‚ View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

UGC NET Electronic Science June 2025 Question Paper with Answer Key & Detailed Solutions

Home / UGC NET PYQ / June 2025 Solved UGC NET Electronic Science June 2025 Question Paper with Answer Key and Full Explanations ๐Ÿ“ฅ Download Question Paper (PDF) 2025 2024 2023 2022 2021 2020 Explanations 1.  Answer: Option (3) For forming a p-type semiconductor, the dopant must be a trivalent impurity (three valence electrons) so that it creates acceptor levels and holes become the majority carriers. Among the given elements, boron (B) is a group-III element (trivalent). Arsenic (As) and phosphorus (P) are group-V (pentavalent) donors that produce n-type material, and germanium (Ge) is a group-IV element usually used as the semiconductor, not as an acceptor dopant. Hence, doping an intrinsic semiconductor with B produces a p-type semiconductor. 2.  Answer: Option (4) The ohmic resistance of a JFET at zero gate bias is given by the standard relation: R DS(on) = V P / I DSS ...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. ๐Ÿ“˜ Theory ๐Ÿงฎ Simulators ๐Ÿ’ป MATLAB Code ๐Ÿ“š Resources BER Definition SNR Formula BER Calculator MATLAB Comparison ๐Ÿ“‚ Explore M-ary QAM, PSK, and QPSK Topics ▼ ๐Ÿงฎ Constellation Simulator: M-ary QAM ๐Ÿงฎ Constellation Simulator: M-ary PSK ๐Ÿงฎ BER calculation for ASK, FSK, and PSK ๐Ÿงฎ Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

Online Simulator for ASK, FSK, and PSK

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. ๐Ÿ“ก ASK Simulator ๐Ÿ“ถ FSK Simulator ๐ŸŽš️ BPSK Simulator ๐Ÿ“š More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics 1. ASK (Amplitude Shift Keying) Simulat...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. ๐Ÿ“˜ Overview ๐Ÿงฎ Simulator ⚖️ Theory Q-function ๐Ÿ“š Resources ๐Ÿ“‚ Other Topics: M-ary PSK & QAM Diagrams ▼ ๐Ÿงฎ Simulator for M-ary PSK Constellation ๐Ÿงฎ Simulator for M-ary QAM Constellation BASK (Binary ASK) Modulation Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1. BFSK (Binary FSK) Modulation Transmits one of two signals: +√Eb​ (On the y-axis, the phas...

UGC NET Electronic Science December 2024 Question Paper with Answer Key & Detailed Solutions

Home / UGC NET PYQ / June 2025 Solved UGC NET Electronic Science December 2024 Question Paper with Answer Key and Full Explanations ๐Ÿ“ฅ Download Question Paper (PDF) 2025 2024 2023 2022 2021 2020 Q.1 Answer: Option (3) Q.2 Answer: Option (3) Solution 1. JMP SHORT LABEL Intrasegment (within the same code segment). Direct jump. ❌ Not intersegment indirect. 2. JMP 5000H:2000H Intersegment (far jump because both CS and IP are specified). Direct jump (address is explicitly given). ❌ Not indirect. 3. JMP [2000H] The destination address is taken from memory location 2000H. This is indirect. In 8086, a far indirect jump can use a memory operand containing both IP and CS (depending on operand size), making it an intersegment indirect jump. ✅ Correct answer. 4. JMP [BX] Indirect jump through memory addressed by BX. Usually intrasegment (near indirect jump). ❌ Not in...

MATLAB Code for ASK, FSK, and PSK (with Online Simulator)

MATLAB Code for ASK, FSK, and PSK Comprehensive implementation of digital modulation and demodulation techniques with simulation results. ๐Ÿ“˜ Theory ๐Ÿ“ก ASK Code ๐Ÿ“ถ FSK Code ๐ŸŽš️ PSK Code ๐Ÿ•น️ Simulator ๐Ÿ“š Further Reading Amplitude Shift Frequency Shift Phase Shift Live Simulator ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation COPY % The code is written by SalimWireless.Com clc; clear all; close all; % Parameters Tb = 1; fc = 10; N_bits = 10; Fs = 100 * fc; Ts = 1/Fs; samples_per_bit = Fs * Tb; rng(10); binar...

Theoretical BER vs SNR for binary ASK, FSK, and PSK (with MATLAB Code + Simulator)

๐Ÿ“˜ Overview & Theory ๐Ÿงฎ MATLAB Codes ๐Ÿงฎ Q-function ๐Ÿ“š Further Reading Bit Error Rate (BER) Equations In ASK, noise directly affects the signal amplitude, making it the most vulnerable since the data is carried in amplitude changes. In FSK, data is represented by frequency variations, and because noise typically impacts amplitude more than frequency, FSK is more robust than ASK. In PSK, data is encoded in the signal phase, and BPSK specifically uses 180-degree phase shifts, creating the greatest separation between signal points and therefore achieving the lowest bit error rate (BER) for the same power level. BER formulas for ASK, FSK, and PSK modulation schemes. ASK BER = 0.5 × erfc(0.5 × √SNR) FSK BER = 0.5 × erfc(√(SNR / 2)) PSK BER = 0.5 × erfc(√SNR) ...