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

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

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

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

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ī€)) ∫ₓ∞ e^(-t² / 2) dt The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...

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 →

Gaussian minimum shift keying (GMSK)

📘 Overview & Theory 🧮 Simulator for GMSK 🧮 MSK and GMSK: Understanding the Relationship 🧮 MATLAB Code for GMSK 📚 Simulation Results for GMSK 📚 Q & A and Summary 📚 Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: θ(t) = 2Ī€h ∫ 0 t m filtered (Ī„) dĪ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...

Design of CMOS XOR/XNOR Gates

Design of CMOS XOR/XNOR Gates The semiconductor industry has experienced rapid integration of multimedia applications into mobile electronics, leading to very high integration density in CMOS VLSI. As operating frequencies increase, power consumption, speed, silicon area, and reliability become critical considerations. The XOR-XNOR circuits are fundamental building blocks in arithmetic circuits (Full Adders, Multipliers), compressors, comparators, parity checkers, code converters, error-detecting/correcting codes, and phase detectors. Their performance directly impacts the complex circuits they are used in. Design goals include full output voltage swing, low power consumption, reduced transistor count, minimal delay, and simultaneous non-skewed outputs. Static Logic (Static CMOS) Stat...