Skip to main content

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

Understanding Negative SNR and the Shannon Limit

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.

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

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

📘 Overview of Energy per Bit (Eb / N0) 🧮 Online Simulator for constellation diagrams of ASK, FSK, and PSK 🧮 Theory behind Constellation Diagrams of ASK, FSK, and PSK 🧮 MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 📚 Further Reading 📂 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 🧮 Simulator for constellation diagrams of m-ary PSK 🧮 Simulator for constellation diagrams of m-ary QAM 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 phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...

Fading : Slow & Fast and Large & Small Scale Fading (with MATLAB Code + Simulator)

📘 Overview 📘 LARGE SCALE FADING 📘 SMALL SCALE FADING 📘 SLOW FADING 📘 FAST FADING 🧮 MATLAB Codes 📚 Further Reading LARGE SCALE FADING The term 'Large scale fading' is used to describe variations in received signal power over a long distance, usually just considering shadowing.  Assume that a transmitter (say, a cell tower) and a receiver  (say, your smartphone) are in constant communication. Take into account the fact that you are in a moving vehicle. An obstacle, such as a tall building, comes between your cell tower and your vehicle's line of sight (LOS) path. Then you'll notice a decline in the power of your received signal on the spectrogram. Large-scale fading is the term for this type of phenomenon. SMALL SCALE FADING  Small scale fading is a term that describes rapid fluctuations in the received signal power on a small time scale. This includes multipath propagation effects as well as movement-induced Doppler fr...

Theoretical BER vs SNR for BPSK

Theoretical Bit Error Rate (BER) vs Signal-to-Noise Ratio (SNR) for BPSK in AWGN Channel Let’s simplify the explanation for the theoretical Bit Error Rate (BER) versus Signal-to-Noise Ratio (SNR) for Binary Phase Shift Keying (BPSK) in an Additive White Gaussian Noise (AWGN) channel. Key Points Fig. 1: Constellation Diagrams of BASK, BFSK, and BPSK [↗] BPSK Modulation Transmits one of two signals: +√Eb or −√Eb , where Eb is the energy per bit. These signals represent binary 0 and 1 . AWGN Channel The channel adds Gaussian noise with zero mean and variance N₀/2 (where N₀ is the noise power spectral density). Receiver Decision The receiver decides if the received signal is closer to +√Eb (for bit 0) or −√Eb (for bit 1) . Bit Error Rat...

Understanding the Q-function in BASK, BFSK, and BPSK

Understanding the Q-function in BASK, BFSK, and BPSK 1. Definition of the Q-function The Q-function is the tail probability of the standard normal distribution: Q(x) = (1 / √(2Ï€)) ∫ x ∞ e -t²/2 dt What is Q(1)? Q(1) ≈ 0.1587 This means there is about a 15.87% chance that a Gaussian random variable exceeds 1 standard deviation above the mean. What is Q(2)? Q(2) ≈ 0.0228 This means there is only a 2.28% chance that a Gaussian value exceeds 2 standard deviations above the mean. Difference Between Q(1) and Q(2) Even though the argument changes from 1 to 2 (a small increase), the probability drops drastically: Q(1) = 0.1587 → errors fairly likely Q(2) = 0.0228 → errors much rarer This shows how fast the tail of the Gaussian distribution decays. It’s also why BER drops drama...

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

📘 Overview of BER and SNR 🧮 Online Simulator for BER calculation of m-ary QAM and m-ary PSK 🧮 MATLAB Code for BER calculation of M-ary QAM, M-ary PSK, QPSK, BPSK, ... 📚 Further Reading 📂 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 🧮 Online Simulator for Constellation Diagram of m-ary QAM 🧮 Online Simulator for Constellation Diagram of m-ary PSK 🧮 MATLAB Code for BER calculation of ASK, FSK, and PSK 🧮 MATLAB Code for BER calculation of Alamouti Scheme 🧮 Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received (after the demodulation process) compared to the total number of bits sent in a communication process. BER = (number of bits received in error) / (total number of tran...

Pulse Shaping using Raised Cosine Filter (with MATLAB + Simulator)

  MATLAB Code for Raised Cosine Filter Pulse Shaping clc; clear; close all ; %% ===================================================== %% PARAMETERS %% ===================================================== N = 64; % Number of OFDM subcarriers cpLen = 16; % Cyclic prefix length modOrder = 4; % QPSK oversample = 8; % Oversampling factor span = 10; % RRC filter span in symbols rolloff = 0.25; % RRC roll-off factor %% ===================================================== %% Generate Baseband OFDM Symbols %% ===================================================== data = randi([0 modOrder-1], N, 1); % Random bits txSymbols = pskmod(data, modOrder, pi/4); % QPSK modulation % IFFT to get OFDM symbol tx_ofdm = ifft(txSymbols, N); % Add cyclic prefix tx_cp = [tx_ofdm(end-cpLen+1:end); tx_ofdm]; %% ===================================================== %% Oversample the Baseband Signal %% ===============================================...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   Start Simulator for binary ASK Modulation Message Bits (e.g. 1,0,1,0) Carrier Frequency (Hz) Sampling Frequency (Hz) Run Simulation Simulator for binary FSK Modulation Input Bits (e.g. 1,0,1,0) Freq for '1' (Hz) Freq for '0' (Hz) Sampling Rate (Hz) Visualize FSK Signal Simulator for BPSK Modulation ...

Envelope Detector Online Simulator

General Envelope Detector Simulator Modulation Type: AM (with carrier) PAM Message Frequency (fm): Hz Carrier Frequency (fc): Hz Carrier Amplitude (Ac): Modulation Index (m = Am / Ac): Envelope Detection and Amplitude-Based Modulations Envelope detectors are fundamental for amplitude-based modulations because they exploit the fact that the instantaneous amplitude of the carrier encodes the message signal . 1. Why Envelope Detection Works In amplitude modulation (AM), the modulated signal has the form: s(t) = [A_c + m(t)] cos(2Ï€ f_c t) A_c is the carrier amplitude m(t) is the message signal f_c is the carrier frequency The envelope of this waveform is: Envelope = |A_c + m(t)| . An envelope detector (e.g., a diode + RC circuit) follows the peaks of the ca...