A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Frequency Shift Keying Modulation

Research Depth 108 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
656prerequisites beneath it
See this on the map →
Modulation: Amplitude, Frequency, and Phase Shift Keying→→Phase Shift Keying ModulationQuadrature Modulation and I/Q Representation
fsk modulation digital-modulation communication

Core Idea

FSK encodes binary information by switching carrier frequency between two values f1 and f0. Orthogonality between tones enables coherent demodulation using matched filters. Gaussian FSK (GFSK) smooths frequency transitions to reduce spectral width. Demodulation uses FM discriminators or frequency-selective matched filters.

Explainer

From amplitude and frequency shift keying fundamentals, you know that modulation maps digital bit values onto physical waveform parameters. Frequency Shift Keying (FSK) takes the simplest possible approach: assign each binary symbol its own carrier frequency. A "1" is transmitted as a sinusoidal burst at frequency f₁; a "0" as a burst at frequency f₀. The receiver's job is to determine which frequency is present in each symbol interval. This is conceptually close to two separate narrowband radio stations — the transmitter broadcasts on one channel or the other depending on the data.

The key design parameter is the frequency separation Δf = f₁ − f₀. Make it too small and the two tones are hard to distinguish, increasing error probability. Make it too large and the signal occupies unnecessary bandwidth. The optimal choice leverages orthogonality: two sinusoids are orthogonal over a symbol period T if their inner product (integral of product over T) is zero. For FSK, this occurs when Δf = n/(2T) for integer n. When the tones are orthogonal, a correlator (or matched filter) tuned to f₁ produces zero output when f₀ is transmitted, and vice versa — perfect separation with no inter-symbol interference from frequency overlap. The minimum orthogonality condition (n = 1, Δf = 1/2T) defines Minimum Shift Keying (MSK), which has the narrowest bandwidth while preserving coherent demodulability.

A practical problem with binary FSK is its spectral efficiency: the signal's spectrum contains sidebands from the abrupt frequency transitions at symbol boundaries, and these extend broadly. Gaussian FSK (GFSK) addresses this by pre-filtering the digital bit stream with a Gaussian pulse-shaping filter before using it to frequency-modulate the carrier. The Gaussian filter smooths the sharp transitions, so instead of a rectangular frequency pulse causing sharp spectral sidebands, the frequency sweeps smoothly between f₀ and f₁. The trade-off is mild inter-symbol interference (adjacent symbols' smooth tails overlap slightly), but the occupied bandwidth reduction is dramatic. Bluetooth Classic uses GFSK with a bandwidth-time product BT = 0.5 precisely because it achieves sufficient spectral containment in the 2.4 GHz ISM band without requiring complex equalization.

Demodulation of FSK can be coherent or non-coherent. Coherent demodulation uses matched filters or correlators synchronized to the exact phase of each carrier frequency — it extracts maximum signal energy per bit but requires carrier phase recovery. Non-coherent demodulation uses envelope detection: bandpass filters centered at f₁ and f₀ pass the respective tones, envelope detectors measure the energy in each filter, and the symbol decision follows from whichever energy is larger. Non-coherent detection is simpler to implement and tolerates phase noise, at a cost of roughly 3 dB in required SNR compared to coherent detection. In practice, non-coherent FSK is common in low-cost, low-complexity implementations like RFID and simple sensor radio links where battery life and hardware simplicity matter more than spectral efficiency.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Double Integrals: Definition and Setup → Iterated Integrals and Fubini's Theorem → Double Integrals over Rectangular Regions → Double Integrals over General Regions → Applications of Double Integrals: Area, Mass, and Moments → Center of Mass → Conservation of Linear Momentum → Elastic Collisions → Inelastic Collisions → Coefficient of Restitution → Collision Analysis and Real-World Applications → Two-Body Collisions in the Center-of-Mass Frame → Reduced Mass and Two-Body Problems → Kinematics in Two Dimensions → Projectile Motion → Circular Motion: Kinematics → Simple Harmonic Motion → Introduction to Differential Equations → Laplace Transform: Fundamentals and Properties → Laplace Transform Properties and Inverse Transform → Transfer Function, Poles, and Zeros → Frequency Response: Magnitude and Phase → Modulation: Amplitude, Frequency, and Phase Shift Keying → Frequency Shift Keying Modulation

Longest path: 109 steps · 656 total prerequisite topics

Prerequisites (1)

Leads To (2)