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

Q-function in BER vs SNR Calculation

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 Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

RMS Delay Spread, Excess Delay Spread and Multi-path ...(with MATLAB + Simulator)

📘 Overview of Delay Spread and Multi-path 🧮 Excess Delay spread 🧮 Power delay Profile 🧮 RMS Delay Spread 📚 Further Reading 📂 Other Topics on RMS Delay Spread, Excess Delay ... 🧮 Multipath Components or MPCs 🧮 Online Simulator for Calculating RMS Delay Spread 🧮 Why is there significant multipath in the case of very high frequencies? 🧮 Why RMS Delay Spread is essential for wireless communication? 🧮 Why the Power Delay Profile is essential? 🧮 MATLAB Codes for Calculating Different Types of delay Spreads Delay Spread, Excess Delay Spread, and Multipath (MPCs) The fundamental distinction between wireless and wired connections is that in wireless connections signal reaches at receiver thru multipath signal propagation rather than directed transmission like co-axial cable. Wireless Communication has no set communication path between the transmitter and the receiver. The line...

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

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

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

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