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

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

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

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

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):

Online Simulator for ASK, FSK, and PSK

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 More Topics 1. ASK (Amplitude Shift Keying) Simulat...