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 Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 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 2026 - Question Paper Download PDF June 202...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Coherent vs. Non-Coherent Demodulation

  For demodulation In general: 1. Synchronous (coherent) demodulation Receiver generates a local carrier/oscillator . It combines/multiplies the received signal with that carrier. Then a filter extracts the message. Received signal ↓ × Local oscillator ↓ Low-pass filter ↓ Message So yes, carrier multiplication is a common implementation of synchronous demodulation . 2. Asynchronous (non-coherent) demodulation Receiver doesn't need a phase-synchronized local carrier . It uses properties of the received signal itself to recover the information. For ASK , an envelope detector is the classic example: ASK signal ↓ Diode + RC ↓ Envelope ↓ Comparator ↓ Data Modulation Synchronous demodulation Non-coherent/asynchronous demodulation ASK/OOK Local carrier + multiplier Envelope detector AM Product detector Envelope detector FSK Coherent correlator/mixer Frequency discriminator, filters, etc. PSK Local synchronized carrier + multiplier Differential/n...

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 Demodulation More Topics 1. ASK (Ampli...

GMSK BER vs SNR (with Simulation)

  GMSK Performance: Why the BER vs. SNR Curve Matters If you’ve ever wondered why GMSK (Gaussian Minimum Shift Keying) became the backbone of the global GSM revolution, the answer lies in its unique balance of spectral efficiency and power performance. But there is no free lunch in engineering. To get that sleek, narrow spectrum, you have to pay a price in Bit Error Rate (BER) . In this guide, we break down the theoretical BER vs. SNR performance of GMSK, the "magic" of the BT product, and how to optimize your link budget for real-world conditions. What is GMSK and Why Should You Care? GMSK is a derivative of MSK (Minimum Shift Keying) that uses a Gaussian pre-modulation filter. This filter "smooths" the phase transitions, significantly reducing sideband power. The result? A constant envelope signal that allows you to use high-efficiency Class-C amplifiers without distorting the signal. This is the secr...