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

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

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...
Read more

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

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

Pulse Amplitude Modulation and Demodulation

📘 Overview & Theory of Pulse Amplitude Moduation (PAM) 🧮 Pulse Amplitude Demoduation 🧮 MATLAB Code for PAM 📚 Further Reading 📂 Other Topics on Pulse Amplitude Modulation ... 🧮 Simulation results for comparison of PAM, PWM, PPM, DM, and PCM 🧮 Other Pulse Modulation Techniques (e.g., PWM, PPM, DM, and PCM) 🧮 MATLAB Code for Pulse Amplitude Modulation and Demodulation of an Analog Signal (2) 🧮 MATLAB Code for Pulse Amplitude Modulation and Demodulation of Digital data  Pulse Amplitude Modulation (PAM) Sampling allow us to represent real world continuous signal, such as audio or video, in a format suitable for digital processing and storage. This sampled discrete-time signal is inherently digital. A digital signal is a discrete-time signal that is further quantized in amplitude. Pulse Amplitude modulation (PAM) is the modulation technique in which amplitude of carrier pulses is...
Read more

Frequency Bands : EHF, SHF, UHF, VHF, HF, MF, LF, VLF and Their Uses

Frequency Bands >> EHF, SHF, UHF, VHF, HF, MF, LF... Frequency Bands and Their Uses 1. Extremely High Frequency (EHF) 30 - 300 GHz Uses 5G Networks 5G millimeter wave band 6G and beyond (Experimental) RADAR 2. Super High Frequency (SHF) 3 - 30 GHz Uses Ultra-wideband (UWB) Airborne RADAR Satellite Communication Microwave Link Communication or SATCOM 3. Ultra High Frequency (UHF) 300 - 3000 MHz Uses Satellite Communication Television Surveillance Navigation aids Also, read important wireless communication terms 4....
Read more

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

FM Bandwidth and FM Band Explained

FM radio uses the frequency band from 88 MHz to 108 MHz , which is a 20 MHz-wide spectrum . This is the range of carrier frequencies available to stations. 108 MHz − 88 MHz = 20 MHz However, a single FM station occupies only about 200 kHz . This is the bandwidth of the modulated FM signal. 1. Why One FM Station Needs ~200 kHz FM uses frequency modulation . The bandwidth depends on how far the carrier swings. Carson's Rule gives the approximate FM bandwidth: B = 2 ( Δf + f m ) ...
Read more