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.

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


Contact Us

Name

Email *

Message *

Popular Posts

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

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. ๐Ÿ“˜ Overview ๐Ÿงฎ Encoding ๐Ÿงฉ Decoding ๐Ÿ“š Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

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

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

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 Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

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

Online Simulator for Frequency Modulatiuon and Demodulation

FM Modulation Simulator Frequency Modulation (FM) In Frequency Modulation, the frequency of the carrier signal varies in accordance with the message signal's amplitude. s FM (t) = A c cos(ฯ‰ c t + k f ∫m(t)dt) where ฯ‰ = 2ฯ€f & k f = Frequency Sensitivity Modulation index, ฮฒ = (k f * A m ) / f m Change the parameter values to see the effect. Message Freq (Hz) 1 Carrier Freq (Hz) Message Amplitude (Am) Kf (sensitivity): 50 Perform FM Demodulation ๐Ÿงช Experiment for Students: ...