Skip to main content

Shannon Limit Explained: Negative SNR, Eb/No and Channel Capacity


Understanding Negative SNR and the Shannon Limit

An explanation of Signal-to-Noise Ratio (SNR), its behavior in decibels, and how Shannon's theorem defines the ultimate communication limit.

Signal-to-Noise Ratio in Shannon’s Equation

In Shannon's equation, the Signal-to-Noise Ratio (SNR) is defined as the signal power divided by the noise power:

SNR = S / N

Since both signal power and noise power are physical quantities, neither can be negative. Therefore, the SNR itself is always a positive number.

However, engineers often express SNR in decibels:

SNR(dB)

When SNR = 1, the logarithmic value becomes:

SNR(dB) = 0

When the noise power exceeds the signal power (SNR < 1), the decibel representation becomes negative.

Behavior of Shannon's Capacity Equation

Shannon’s channel capacity formula is:

C = B log₂(1 + SNR)

For SNR = 0:

log₂(1 + SNR) = 0

When SNR becomes smaller (including negative values in dB), the expression approaches zero but never becomes negative.

This means that reliable decoding of information is still possible even when the SNR expressed in dB is negative.

Spread Spectrum and Negative SNR

Negative SNR values in dB occur frequently in spread spectrum communication systems. Spread spectrum is a coding technique that spreads the signal energy across a wider bandwidth.

Although the raw SNR may appear extremely low, the coding structure allows the receiver to correctly decode the information.

However, there exists a fundamental limit defined by Shannon known as the Shannon Limit.

SNR Per Bit (Eb/No)

The most important parameter in digital communications is the signal-to-noise ratio per bit, represented as:

Eb / No

Starting from Shannon's capacity equation:

C = B log₂(1 + SNR)

Rewriting:

C/B = log₂(1 + SNR)

Using the relationship:

SNR = S / (NoB)

And defining signal power as:

S = EbC

We obtain:

z = SNR = (Eb / No) × (C / B)

Deriving the Shannon Limit

As bandwidth becomes extremely large while the data rate remains finite:

B → ∞
C/B → 0
z → 0

Using the limit:

lim (1 + z)^(1/z) = e

We obtain the minimum required energy per bit:

Eb / No = 1 / log₂(e) ≈ 0.693

Expressed in decibels:

Eb / No (dB) ≈ -1.6 dB

This value represents the Shannon Limit.

What the Shannon Limit Means

  • Reliable decoding is possible down to Eb/No ≈ −1.6 dB.
  • Below this value, error rates increase exponentially.
  • No coding scheme can outperform this theoretical limit.

Example: Spread Spectrum Processing Gain

In a spread spectrum system with a bandwidth-to-data-rate ratio of:

B / C = 100

The resulting SNR becomes:

SNR = (Eb / No) × (C / B)

In decibels:

SNR(dB) = Eb/No(dB) − 20 dB

If the system operates near the Shannon limit:

SNR ≈ -1.6 dB − 20 dB = -21.6 dB

This demonstrates how extremely low SNR values can still allow reliable communication when advanced coding techniques or spread spectrum methods are used.

Shannon's theorem proves that reliable communication is theoretically possible close to this limit, although it does not specify how to construct the optimal coding schemes needed to achieve it.


Shannon Limit and Reliable Decoding in BPSK

In BPSK communication, reliable decoding is possible even when noise power exceeds signal power. This is explained by the Shannon limit, whose theoretical minimum is approximately -1.59 dB in terms of E_b/N_0.

BPSK Constellation

BPSK uses two constellation points:

+√Eb   and   -√Eb
  

The distance between them is:

d = 2√Eb
  

Larger constellation distance improves noise immunity.

Why Decoding Works Below 0 dB

At negative E_b/N_0, constellation points overlap heavily due to noise, making individual symbols unreliable. However, modern error-correcting codes decode entire codewords rather than isolated bits.

  • Redundancy is added during encoding
  • The decoder analyzes long bit sequences
  • Statistical patterns help recover the message

Shannon Capacity

C = B log2(1 + SNR)
  

Shannon showed that reliable communication becomes theoretically possible whenever:

Eb/N0 > -1.59 dB
  

Below this limit, no coding scheme can achieve reliable decoding.

The Physics of Signal and Noise

Understanding how Power, Energy, and Bandwidth interact through the definitions of S and N.

1. Signal Power (S = EbC)

In physics, Power is defined as Energy divided by Time. In digital communications, we translate this relationship into bits and capacity.

S (Signal Power) Measured in Watts (Joules per second).
Eb (Energy per bit) The Joules assigned to a single bit.
C (Capacity) The number of bits sent per second.

If every bit requires a certain amount of energy (Eb), and you are sending a specific number of bits every second (C), the total power consumed is the product of the two:

S = Eb × C

Note: While engineers often use R (actual data rate), Shannon’s derivation uses C (theoretical maximum rate) to find the absolute limit of the channel.

2. Noise Power (N = N0B)

This equation describes how noise is distributed across a frequency range. It assumes White Noise, where noise energy is spread evenly across the spectrum.

N = N0 × B
  • N0 (Noise Power Spectral Density): This represents the "thickness" of the noise, measured in Watts per Hertz (W/Hz).
  • B (Bandwidth): The range of frequencies (Hertz) the signal occupies.

3. Combining for the Shannon Formula

By substituting these physical definitions into the Shannon Capacity equation, we can shift the focus from hardware-specific values (Watts and Hertz) to a universal measure of Energy Efficiency:

C = B log₂(1 + (Eb × C) / (N0 × B))

This substitution is what allows us to solve for the Shannon Limit (-1.59 dB), which dictates the minimum energy required to transmit one bit of information regardless of the bandwidth or power used.

Summary

Individual BPSK symbols may appear corrupted by noise, but the complete coded sequence still contains enough structure for accurate recovery. The power comes from:

Modulation + Error-Correcting Coding
  

Further Reading




Contact Us

Name

Email *

Message *

Popular Posts

MATLAB Code for BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc

📘 Overview 🧮 MATLAB Codes 🧮 Online Simulator for Calculating BER of M-ary PSK and QAM 🧮 QPSK vs BPSK and QAM: A Comparison of Modulation Schemes in Wireless Communication 🧮 Are QPSK and 4-PSK same? 📚 Further Reading   QPSK offers double the data rate of BPSK while maintaining a similar bit error rate at low SNR when Gray coding is used. It shares spectral efficiency with 4-QAM and can outperform 4-QAM or 16-QAM in very noisy channels. QPSK is widely used in practical wireless systems, often alongside QAM in adaptive modulation schemes [Read more...] What is the Gray Code? Gray Code: Gray code is a binary numeral system where two successive values differ in only one bit. This property is called the single-bit difference or unit distance code. It is also known as reflected binary code. Let's convert binary 111 to Gray code: Binary bits: B = 1 1 1 Apply the rule: G[0] = B[0] = 1...

FFT Butterfly Method Explained (with Simulations)

4-Point FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {x[0], x[2]} = {0, 2} Odd indices: x o = {x[1], x[3]} = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part (E): {0+2, 0-2} = {2, -2} Odd Part (O): {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W 4 k O[k] X[k + 2] = E[k] - W 4 k O[k] Twiddle Factors (N=4): W 4 0 = 1, W 4 1 = -j Final Calculations: X[0] = E[0] + W 4 0 O[0] = 2 + (1)(4) = 6 X[2] = E[0] - W 4 0 O[0] = 2 - (1)(4) = -2 X[1] = E[1] + W 4 1 O[1] = -2 + (-j)(-2) = -2 + 2j X[3] = E[1] - W 4 1 O[1] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} 8-Point FFT Using Butterfly Method Given: x[n] = {0,1,2,3,4,5,6,7} Step 1: Split into Bit-Reversed Order To perform DIT-FFT, split the 8 points into pairs of two: Group A: {x[0], x[4]} = {0, 4}...

MATLAB Code for QPSK Modulation and Demodulation

📘 Overview 🧮 MATLAB Codes 🧮 Theory 🧮 BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc 📚 Further Reading QPSK Passband Signal Generation Spectral Efficiency in QPSK   Quadrature Phase Shift Keying (QPSK) is a digital modulation scheme that conveys two bits per symbol by changing the phase of the carrier signal. Each pair of bits is mapped to one of four possible phase shifts: 0°, 90°, 180°, or 270° 00  ===> 0 degree phase shift of carrier signal 01  ===> 90 degree 11  ===> 180 degree 10  ===> 270 degree   MATLAB Script clc; clear all; close all; clc; M = 4; data = randi([0 (M-1)], 1000, 1); Phase = 0; modData=pskmod(data,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   Result data 1 0 2 2 0 2 1 . . . modData -1.0...

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 ...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Online Simulator for ASK, FSK, and PSK Signal Generation

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...

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 Calculation 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 figur...

MATLAB Code for OTFS (Orthogonal Time Frequency Space)

MATLAB Code for OTFS (Orthogonal Time Frequency Space) %% Clear workspace clc; clear; close all ; %% Step 1: OTFS Parameters N_delay = 4; % Number of delay bins (rows) N_doppler = 4; % Number of Doppler bins (columns) N_sym = N_delay * N_doppler; modOrder = 4; % QPSK SNR_dB = 20; % Noise level %% Step 2: Generate random data symbols data = randi([0 modOrder-1], N_sym, 1); txSymbols = pskmod(data, modOrder, pi/4); disp( 'Transmitted Delay-Doppler symbols:' ); disp(reshape(txSymbols, N_delay, N_doppler)); %% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT) % ISFFT: Inverse Symplectic Finite Fourier Transform % 1. Take IDFT along Doppler (columns) % 2. Take DFT along Delay (rows) ddSymbols = reshape(txSymbols, N_delay, N_doppler); % Step 3a: IDFT along columns (Doppler) tfGrid = ifft(ddSymbols, N_doppler, 2); %IFFT (accross columns) along Doppler → spreads in time (Delay → Time) %FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency) % Step 3b: DFT along ...