Skip to main content

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} \]

m(t) [Binary] VCO / Frequency Mod s(t) [BFSK]
Fig 1: Structural Diagram of a BFSK Modulator

In a Binary Frequency Shift Keying (BFSK) architecture, the baseband bitstream modulates a Voltage-Controlled Oscillator (VCO). The VCO functions as a frequency synthesizer where the instantaneous oscillation frequency is a function of the input voltage level.

LOW-FREQUENCY BFSK VISUALIZATION (VCO MODEL)

m(t) [Bitstream] VOLTAGE-VCO

Coherent FSK Demodulation

The coherent (synchronous) BFSK receiver functions by exploiting the orthogonality of the two signaling frequencies. The process assumes precise phase and frequency alignment through locally synthesized carrier references. The received waveform \( y(t) \) is processed via a dual-branch architecture, where each branch is tuned to one of the possible transmitted tones.

y(t) × cos(2Ï€f1t) Integrator/LPF × cos(2Ï€f2t) Integrator/LPF Decision Logic Data Out
Fig 2: Architecture of a Coherent BFSK Detector

Detailed Step-by-Step Breakdown:

  • Product Modulation (Correlation): The incoming signal is multiplied by two local carriers. If the incoming frequency matches the local carrier (e.g., \( f_1 \)), the multiplication results in a DC component (representing signal energy) and a high-frequency component (\( 2f_1 \)). If they do not match, the result consists only of high-frequency "sum and difference" tones.
  • Integration and Filtering: The Low-Pass Filter (or Integrator) acts as an energy detector. It effectively averages the signal over the bit period \( T_b \). It suppresses the high-frequency products while allowing the DC component (if present) to pass through as a "sufficient statistic."
  • Comparison and Decision: The outputs of the two branches are compared. The branch whose local frequency matches the transmitted tone will produce a high voltage level, while the "mismatched" branch produces a level near zero. A comparator chooses the maximum of the two to reconstruct the original bit.

Analytical State Analysis

The transmitted signal states are formally represented as: \( S_{1}(t) = A \cos(2\pi f_1 t) \) (Bit '1') and \( S_{2}(t) = A \cos(2\pi f_2 t) \) (Bit '0').

Case 1: Bit '1' is Received

  • Branch 1 Output: \( \int [A \cos(2\pi f_1 t) \cdot \cos(2\pi f_1 t)] dt \rightarrow \) High Value (\( A/2 \))
  • Branch 2 Output: \( \int [A \cos(2\pi f_1 t) \cdot \cos(2\pi f_2 t)] dt \rightarrow \) Zero (due to orthogonality)
  • Decision: Branch 1 > Branch 2 → Logic '1'

Case 2: Bit '0' is Received

  • Branch 1 Output: \( \int [A \cos(2\pi f_2 t) \cdot \cos(2\pi f_1 t)] dt \rightarrow \) Zero
  • Branch 2 Output: \( \int [A \cos(2\pi f_2 t) \cdot \cos(2\pi f_2 t)] dt \rightarrow \) High Value (\( A/2 \))
  • Decision: Branch 2 > Branch 1 → Logic '0'

Signal-Space (Constellation) Representation

φ1(t) φ2(t) s1 (√Eb, 0) s2 (0, √Eb) d = √2Eb
Fig 3: Signal-Space Mapping for Orthogonal BFSK

BFSK signals are mapped onto a 2D signal space using orthonormal basis functions, reflecting the dual-frequency nature of the modulation:

\[ \phi_1(t) = \sqrt{\frac{2}{T_b}} \cos(2\pi f_1 t), \quad \phi_2(t) = \sqrt{\frac{2}{T_b}} \cos(2\pi f_2 t) \]

The constellation points are located on perpendicular axes. The minimum Euclidean distance between states is: \[ d_{12} = \sqrt{2E_b} \]

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

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

Intel 8086 Transistor Count: Architecture, Specifications, and Comparison with Other Microprocessors

Intel 8086 Transistor Count: Architecture, Specifications, and Comparison with Other Microprocessors Intel 8086 Transistor Count: Complete Guide with Architecture and Processor Comparison The Intel 8086 microprocessor is one of the most important processors in computer history. Released in 1978 , it introduced the x86 architecture that still influences modern CPUs. One of the most frequently asked questions in computer architecture and microprocessor courses is: How many transistors are present in the Intel 8086? The commonly accepted answer is approximately 29,000 transistors . However, reverse-engineering studies have shown that the actual number of physical transistors is closer to 19,618 , while Intel's published figure includes programmable transistor locations used in ROM and PLA structures. Intel 8086 Transistor Count Metric Value Published transistor count ~29,000 Physical transistor count ~19,618 Release year 1978 Word ...