Skip to main content

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


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)

erfc / Q-function (Click here)

The Mathematical Foundation

The Bit Error Rate is fundamentally derived from the Conditional Probability of Error, where we integrate the Gaussian Noise PDF over the decision region:

\( P_b = \int_{\mathrm{Threshold}}^{\infty} \frac{1}{\sqrt{2\pi\sigma^2}} e^{-\frac{(x-A)^2}{2\sigma^2}} \, dx = Q\!\left(\frac{A}{\sigma}\right) \)

In digital communications, the argument $x$ inside the $Q(x)$ function represents the ratio of the signal's "safety margin" to the noise magnitude. In an AWGN channel, the noise standard deviation is defined as: $\sigma = \sqrt{N_0 / 2}$

BPSK

Distance to boundary is $\sqrt{E_b}$

$x = \frac{\sqrt{E_b}}{\sqrt{N_0/2}}$
$x = \sqrt{\frac{2E_b}{N_0}}$

BFSK

Distance to boundary is $\frac{\sqrt{E_b}}{\sqrt{2}}$

$x = \frac{\sqrt{E_b}/\sqrt{2}}{\sqrt{N_0/2}}$
$x = \sqrt{\frac{E_b}{N_0}}$

BASK

Distance to boundary is $\frac{\sqrt{E_b}}{2}$

$x = \frac{\sqrt{E_b}/2}{\sqrt{N_0/2}}$
$x = \sqrt{\frac{E_b}{2N_0}}$

Why the 0.5 factor?

In 0.5 * erfc(x), the 0.5 represents the 50% probability of transmitting a '0' vs a '1' in a random bitstream.

Eb/N0 vs SNR

While SNR is the power ratio, Eb/N0 is the energy per bit, allowing us to compare schemes with different bandwidths fairly.

Theoretical BER vs SNR for Amplitude Shift Keying (ASK)

The theoretical Bit Error Rate (BER) for binary ASK depends on how binary bits are mapped to signal amplitudes. For typical cases:

If bits are mapped to 1 and -1, the BER is:

BER = Q(√(2 × SNR))

If bits are mapped to 0 and 1, the BER becomes:

BER = Q(√(SNR / 2))

Where:

  • Q(x) is the Q-function: Q(x) = 0.5 × erfc(x / √2)
  • SNR: Signal-to-Noise Ratio
  • N₀: Noise Power Spectral Density

Understanding the Q-Function and BER for ASK

  • Bit '0' transmits noise only
  • Bit '1' transmits signal (1 + noise)
  • Receiver decision threshold is 0.5

BER is given by:

Pb = Q(0.5 / σ), where σ = √(N₀ / 2)

Using SNR = (0.5)² / N₀, we get:

BER = Q(√(SNR / 2))

ASK BER Formula Derivation

Theoretical BER vs SNR for Frequency Shift Keying (FSK)

For binary FSK, the theoretical BER is:

BER = Q(√(SNR))

BER vs SNR for FSK

The Q-function is defined as:

Q(x) = 0.5 × erfc(x / √2)

BER Formula for BFSK

Similarities Between ASK and FSK

  • Both BERs decrease as SNR increases
  • Both use the Q-function for analytical BER calculation
  • FSK generally performs better under noisy conditions

MATLAB Code for Theoretical BER vs SNR

Binary ASK (BASK)

% The code is written by SalimWireless.Com 

clc;
clear all;
close all;

SNRdB = 0:20; 
SNR = 10.^(SNRdB/10); 

BER_th = (1/2) * erfc(0.5 * sqrt(SNR));

semilogy(SNRdB, BER_th, '-rh', 'linewidth', 2.5);
grid on;
title('Theoretical Bit Error Rate vs. SNR for Binary ASK Modulation');
xlabel('SNR (dB)');
ylabel('BER');
legend('Theoretical');
axis([0 20 1e-5 1]);

Binary FSK (BFSK)

% The code is written by SalimWireless.Com 

clc;
clear;
close all;

SNRdB = 0:1:10;              
SNR = 10.^(SNRdB/10);        

BER_th = (1/2) * erfc(sqrt(SNR / 2));

disp('SNR (dB)    Theoretical BER');
disp([SNRdB', BER_th']);

figure;
semilogy(SNRdB, BER_th, '-kh', 'LineWidth', 2);
xlabel('SNR (dB)');
ylabel('Bit Error Rate (BER)');
title('Theoretical BER vs SNR for BFSK');
grid on;

Theoretical BER vs SNR for BPSK -> (Click Here)

BER vs SNR Simulation



Comparison of ASK, FSK, and PSK Performance

Feature ASK (OOK) BFSK BPSK
Power Efficiency Low Medium High
Bandwidth Efficiency High Low High
Noise Immunity Poor (Sensitive to Amp) Good Excellent
Best Used In Fiber Optics, RFID Caller ID, Paging Deep Space, Satellite

Read More

Key Terms Explained

Eb/N0 (Energy per Bit to Noise Power Density):
The normalized SNR measure, also known as the "SNR per bit." It is the most important metric for comparing different modulation schemes regardless of bandwidth. [Read More] 
Q-Function:
The Q-function represents the tail probability of the standard normal distribution. In BER terms, it tells us the probability that noise will exceed the decision boundary. Read more
Coherent vs. Non-Coherent Detection:
Coherent detection (used in the formulas above) requires the receiver to be in phase-sync with the transmitter. Non-coherent detection is easier to build but results in a higher BER.
Impact of AWGN on BER vs SNR of FSK and PSK →

Further Reading

  1. BER vs SNR for ASK, FSK, and PSK with Online Simulator 
  2. Understanding the Q-function in BASK, BFSK, and BPSK
  3. BER for M-ary PSK and QAM
  4. Constellation Diagrams
📊 MATLAB & ONLINE SIMULATIONS (Web-Based)
🎓 GATE & UGC - NET SOLUTIONS
📡 WIRELESS & SIGNAL PROCESSING


Contact Us

Name

Email *

Message *

Popular Posts

MATLAB Code for MUSIC

  MATLAB Code clc; clear; close all ; %% Step 1: Define Parameters M = 8; % Number of array sensors d = 0.5; % Sensor spacing (lambda/2) K = 2; % Number of signals N = 200; % Number of snapshots theta = [-20 30]; % True signal angles (degrees) SNR = 10; % Signal-to-noise ratio (dB) fprintf( 'Step 1: Parameters Initialized\n' ); %% Step 2: Generate Signal Sources t = 1:N; s1 = exp(1j*2*pi*0.05*t); s2 = exp(1j*2*pi*0.1*t); S = [s1; s2]; figure; plot(real(S(1,:))) title( 'Signal 1 (Real Part)' ) xlabel( 'Samples' ) ylabel( 'Amplitude' ) figure; plot(real(S(2,:))) title( 'Signal 2 (Real Part)' ) xlabel( 'Samples' ) ylabel( 'Amplitude' ) fprintf( 'Step 2: Source Signals Generated\n' ); %% Step 3: Construct Steering Matrix A = zeros(M,K); for k = 1:K A(:,k) = exp(-1j*2*pi*d*(0:M-1)'*sin(theta(k)*pi/180)); end fprintf( 'Step 3: Steering Matr...
Read more

MATLAB code for BER vs SNR for M-QAM, M-PSK, QPSK, BPSK (with Simulation)

🧮 MATLAB Code for BPSK, M-ary PSK, and M-ary QAM Together 🧮 MATLAB Code for M-ary QAM 🧮 MATLAB Code for M-ary PSK 📚 Further Reading MATLAB Script for BER vs. SNR for M-QAM, M-PSK, QPSK, BPSK % Written by Salim Wireless clc; clear; close all; snr_db = -5:2:25; psk_orders = [2, 4, 8, 16, 32]; qam_orders = [4, 16, 64, 256]; ber_psk_results = zeros(length(psk_orders), length(snr_db)); ber_qam_results = zeros(length(qam_orders), length(snr_db)); for i = 1:length(psk_orders) ber_psk_results(i, :) = berawgn(snr_db, 'psk', psk_orders(i), 'nondiff'); end for i = 1:length(qam_orders) ber_qam_results(i, :) = berawgn(snr_db, 'qam', qam_orders(i)); end figure; semilogy(snr_db, ber_psk_results(1, :), 'o-', 'LineWidth', 1.5, 'DisplayName', 'BPSK'); hold on; for i = 2:length(psk_orders) semilogy(snr_db, ber_psk_results(i, :), 'o-', 'DisplayName', sprintf('%d-PSK', psk_or...
Read more

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

PSD Calculation with FFT: MATLAB Tutorial for Signal Analysis

  Implementation Steps 1. FFT Computes the Frequency Content of a Signal FFT converts a time-domain signal to the frequency domain. If: The signal is sampled at rate $f_s$ You compute an $N_{\text{FFT}}$-point FFT Then each FFT bin corresponds to a frequency resolution of: $$\Delta f = \frac{f_s}{N_{\text{FFT}}}$$ So the FFT gives you accurate frequency content, assuming the signal is stationary and adequately sampled (Nyquist criterion met).  2. Magnitude Squared Gives Power (Not Amplitude) $$P[k] = |X[k]|^2$$ This gives power at each frequency bin, not just amplitude. It represents how much energy is present at each frequency. It's a key step for PSD.  3. Normalization Makes the PSD Physically Meaningful The equation: $$\text{PSD}[k] = \frac{|X[k]|^2}{N_{\text{FFT}} \cdot f_s \cdot U}$$ is derived from first principles and ensures that the u...
Read more

Direction of Arrival (DoA) Online Simulator (using MUSIC)

Interactive DOA Simulator X-axis XY angle (deg): 45 XZ angle (deg): 30 Noise: 0.05 Y-axis XY angle (deg): 60 YZ angle (deg): 45 Noise: 0.05 Z-axis XZ angle (deg): 60 YZ angle (deg): 30 Noise: 0.05 Estimated DOA (deg): 0 Simulation Workflow and Mathematical Background This simulator demonstrates Direction of Arrival (DOA) estimation using three-axis sensor signals (X, Y, Z), Maximal Ratio Combining (MRC) , and the MUSIC algorithm . It allows interactive control of signal angles and noise for teaching purposes. 1. Signal Generation A pure sinewave signal of frequency f is projected onto three axes using user-defined angles in different planes: X-axis: θ XY , θ XZ Y-axis: θ XY , θ YZ Z-axis: θ XZ , θ YZ Mathematically, for each time sample t : x(t) = s(t) * cos(θ_xy_x) * cos(θ_xz_x) + n_x(t) y(t) = s(t) * sin(θ_xy_y) * cos(θ_yz_y) + n_y(t) z(t) = s(t) * sin(θ_xz_z) * sin(θ_yz_z) + n_z(t) wh...
Read more

Power Spectral Density Calculation Using FFT in MATLAB

📘 📘 Overview 🧮 🧮 Steps to calculate 💻 🧮 MATLAB Codes 📚 📚 Further Reading Power spectral density (PSD) tells us how the power of a signal is distributed across different frequency components, whereas Fourier Magnitude gives you the amplitude (or strength) of each frequency component in the signal. Steps to calculate the PSD of a signal Firstly, calculate the fast Fourier transform (FFT) of a signal. Then, calculate the Fourier magnitude (absolute value) of the signal. Square the Fourier magnitude to get the power spectrum. To calculate the Power Spectral Density (PSD), divide the squared magnitude by the product of the sampling frequency (fs) and the total number of samples (N). Formula: PSD = |FFT|^2 / (fs * N) Sampling frequency (fs): The rate at which the continuous-time signal is sampled (in Hz). ...
Read more

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

MUSIC Algorithm Explained (with MATLAB + Simulator)

Practical Implementation of the MUSIC Algorithm The focus is on how the algorithm works computationally , not just theory, and it explains the denominator (a H E n E n H a) mathematically and intuitively. 1. Introduction The MUSIC (Multiple Signal Classification) algorithm is a high-resolution method used in signal processing and array processing to estimate the Direction of Arrival (DOA) of signals received by a sensor array. Unlike classical beamforming methods, MUSIC uses eigenvector decomposition of the covariance matrix to separate the signal subspace and noise subspace , allowing it to achieve much higher angular resolution. In practical implementations, MUSIC works by: Simulating or collecting array signals Computing the covariance matrix Performing eigenvalue decomposition Separating signal and noise subspaces Scanning possible angles using a steering vector Constructing a pseudo-spectrum where peaks indicate signal directions 2. Signal Mo...
Read more