Skip to main content

Constellation Diagram of FSK in Detail


 

Binary bits '0' and '1' can be mapped to 'j' and '1' to '1', respectively, for Baseband Binary Frequency Shift Keying (BFSK). Signals are in phase here. These bits can be mapped into baseband representation for a number of uses, including power spectral density (PSD) calculations. For passband BFSK transmission, we can modulate signal 'j' with a lower carrier frequency and signal '1' with a higher carrier frequency while transmitting over a wireless channel.

Let's assume we are transmitting carrier signal fc1 for the transmission of binary bit '1' and carrier signal fc2 for the transmission of binary bit '0'.

Simulator for 2-FSK Constellation Diagram

Simulator for 2-FSK Constellation Diagram

Energy per bit (Eb):

For transmission of binary ‘1’

Starting from the passband signal \( s_1(t)=A_c\cos(2\pi f_1 t) \) over \(0\le t\le T_b\):

\[ E_b \;=\; \int_{0}^{T_b}\!\big(A_c\cos 2\pi f_1 t\big)^2\,dt \;=\; \int_{0}^{T_b}\!\frac{A_c^2}{2}\,dt \;+\; \int_{0}^{T_b}\!\frac{A_c^2}{2}\cos(4\pi f_1 t)\,dt \] \[ \;=\; \int_{0}^{T_b}\!\frac{A_c^2}{2}\,dt \;+\; 0 \quad \text{(second term averages to 0 over a full cycle)} \;=\; \frac{A_c^2}{2}\,T_b . \]

For transmission of binary ‘0’

Similarly for \( s_2(t)=A_c\cos(2\pi f_2 t) \):

\[ E_b \;=\; \int_{0}^{T_b}\!\big(A_c\cos 2\pi f_2 t\big)^2\,dt \;=\; \int_{0}^{T_b}\!\frac{A_c^2}{2}\,dt \;+\; \int_{0}^{T_b}\!\frac{A_c^2}{2}\cos(4\pi f_2 t)\,dt \] \[ \;=\; \int_{0}^{T_b}\!\frac{A_c^2}{2}\,dt \;+\; 0 \;=\; \frac{A_c^2}{2}\,T_b . \]

Amplitude in terms of \(E_b\)

\[ A_c \;=\; \sqrt{\frac{2E_b}{T_b}} \;. \]

Constellation Diagram of FSK

In Binary FSK (BFSK), two orthogonal signals represent binary symbols:
\( s_1(t) = \sqrt{\frac{2E_b}{T_b}} \cos(2\pi f_1 t), \quad 0 \leq t \leq T_b \)
\( s_2(t) = \sqrt{\frac{2E_b}{T_b}} \cos(2\pi f_2 t), \quad 0 \leq t \leq T_b \)

Symbol 0: \( f_1 \)
Symbol 1: \( f_2 \)

The points lie on orthogonal axes because \( s_1(t) \) and \( s_2(t) \) are orthogonal signals.







Fig 1: Constellation Diagram of FSK

 In the above figure values are in terms of the normalized functions. √(2/Tb).cos2Пf1t and √(2/Tb).cos2Пf2t are orthogonal functions in the interval (0, Tb). And the distance between signaling points, d12 = √(2Eb)
By interpreting these functions as vectors, the phase angle between the resulting vectors will be 90 degrees.   

Using more frequency shifts to display multiple symbols or bits of digital data is known as high-order frequency shift keying (FSK). Every frequency in FSK corresponds to a distinct symbol or collection of bits. Higher data rates are possible with high-order FSK schemes, but they may also be more vulnerable to channel impairments and noise. 

 

Also read about

  1.  Constellation Diagram of ASK in detail
  2. Constellation Diagram of PSK in detail
  3. Baseband ASK, FSK, and PSK
  4. Theoretical BER vs SNR for binary ASK, FSK, and PSK

BER vs SNR from Constellation Diagram of FSK

The Bit Error Rate (BER) versus Signal-to-Noise Ratio (SNR) can be derived from the Euclidean distance between constellation points. Once the minimum distance between the symbols is known, the probability of making an incorrect decision in an Additive White Gaussian Noise (AWGN) channel can be computed using the Q-function.

The Q-function gives the probability that Gaussian noise exceeds the decision threshold, causing the received symbol to cross into the neighboring decision region and resulting in an incorrect bit detection.

Example: Coherent Orthogonal FSK

For coherent orthogonal Frequency Shift Keying (FSK), the theoretical BER is

BER = Q(√(Eb / N0))

The Euclidean distance between the two orthogonal signal points is

d = √(2Eb)

Substituting this distance into the general AWGN error probability formula gives

BER = Q(d / √(2N0))

= Q(√(2Eb) / √(2N0))

= Q(√(Eb / N0))

Why is BER approximately 0.15 at 0 dB?

At an SNR of 0 dB,

Eb / N0 = 100/10 = 1

Therefore,

BER = Q(√1)

= Q(1)

Using the standard Gaussian Q-function table,

Q(1) ≈ 0.1587

Thus, at an SNR of 0 dB, the theoretical BER for coherent orthogonal FSK is approximately

BER ≈ 0.1587 ≈ 0.15

This matches the theoretical BER curve for coherent orthogonal FSK in an AWGN channel.

Note: If you instead use the expression Q(√(2Eb/N0)), the BER at 0 dB becomes Q(√2) = Q(1.4142) ≈ 0.0786, which corresponds to coherent BPSK (and QPSK), not coherent orthogonal FSK.

Read More: Learn how the Q-function is used to derive theoretical BER curves for various digital modulation schemes in AWGN channels.



Contact Us

Name

Email *

Message *

Popular Posts

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

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

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

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

Alamouti Scheme for 2x2 MIMO in MATLAB

📘 Overview & Theory 🧮 MATLAB Code for Alamouti Scheme 🧮 MATLAB Code for BER vs. SNR for Alamouti Scheme 🧮 Alamouti Scheme Simulator 🧮 Alamouti Scheme Transmission Table 📚 Further Reading    Read about the Alamouti Scheme first MATLAB Code for Alamouti's Precoding Matrix for 2 X 2 MIMO % Clear any existing data and figures clc; clear; close all; % Define system parameters transmitAntennas = 2; % Number of antennas at the transmitter receiveAntennas = 2; % Number of antennas at the receiver symbolCount = 1000000; % Number of symbols to transmit SNR_dB = 15; % Signal-to-Noise Ratio in decibels % Generate random binary data for transmission rng(10); % Set seed for reproducibility transmitData = randi([0, 1], transmitAntennas, symbolCount); % Perform Binary Phase Shift Keying (BPSK) modulation modulatedSymbols = 1 - 2 * transmitData; % Define Alamouti's Precoding Matrix precodingMatrix = [1 1; -1i 1i]; % Encode and transmit dat...

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

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