Frequency Hopping Explained (with Online Simulator)

Telecommunications & Engineering

Why Frequency Hopping is the Secret Weapon of CDMA: The Math Behind Bulletproof Wireless

Ever wonder why your Bluetooth headphones don't cut out when the microwave starts, or how military radios stay "invisible" to enemies? The answer lies in Frequency Hopping CDMA (FH-CDMA).

#CDMA

#WirelessSecurity

#EngineeringMath

The "Invisible" Signal: What is FH-CDMA?

In standard radio, you transmit on one fixed frequency. In Frequency Hopping Spread Spectrum (FHSS), the carrier jumps—or "hops"—between many frequencies at incredible speeds. When combined with Code Division Multiple Access (CDMA), it creates a system where only a receiver with the "secret code" can follow the conversation.

Think of it like this: Imagine trying to follow a conversation where the speakers teleport to a different room every 10 seconds. Unless you have the teleportation schedule (the PN code), all you hear is silence.

The Mathematical Blueprint

How does this work on paper? Let’s look at the actual physics of the transmitted signal.

Equation 1: The Transmitted Signal x(t) = s(t) ⋅ cos(2π f_k t + φ_k)

Where:

• s(t): Your original data (voice or text).
• f_k: The "Hop Frequency" determined by a Pseudo-Noise code.
• φ_k: The phase of the hop.

The magic happens in how f_k is chosen. It isn't random; it follows a deterministic pattern:

Equation 2: The Hopping Logic f_k = f_c + c_k ⋅ Δf

Where c_k is the integer value provided by the PN Code at time interval k.

Processing Gain: Why Jamming Fails

The primary reason engineers choose CDMA with Frequency Hopping is Processing Gain (G_p). This is a measure of how much the signal is spread over the spectrum, making it incredibly resistant to interference.

Equation 3: The Efficiency Metric G_p ≈ B_ss / B_i ≈ M

In FH-CDMA, the gain is roughly equal to M (the number of available frequency slots). If a system has 79 hops (like Bluetooth), the signal is effectively 79 times more robust than a single-frequency signal!

Real-World Applications

• Bluetooth: Uses FH-CDMA to avoid interference from Wi-Fi signals in the 2.4GHz band.
• Military Comms: Prevents "Low Probability of Intercept" (LPI), making it hard for enemies to find or jam the signal.
• E-Passports: Some secure RFID systems use these principles to prevent unauthorized data skimming.

FH-CDMA Interactive Lab

Mastering Frequency Hopping Spread Spectrum (FHSS) through Visualization

The Mathematical Foundation

Unlike standard CDMA which spreads via a chip code, FH-CDMA changes the carrier frequency ($f_c$) rapidly. The frequency at any time $k$ is defined by: f_k = f_base + (PN_k × Δf)

Where PN_k is the Pseudo-Noise sequence value (the shared secret). The "Processing Gain" comes from the fact that the signal occupies a huge bandwidth over time, making it hard to jam: G_p ≈ Number of Hopping Channels

Fast vs Slow Hopping: If we hop multiple times for one bit, it's Fast Hopping (Highly Secure). If we send multiple bits on one hop, it's Slow Hopping (Power Efficient).

Control Tower

Data Bits (0 or 1)

Hopping Rate Slow (1 bit per hop) Fast (2 hops per bit)

Jammer Intensity

Time-Frequency Spectrogram (The Waterfall)

User Signal Jammer/Noise Collision (Hit)

8 GHz7 GHz6 GHz5 GHz4 GHz

Time →

Receiver Output (Correlator)

Note: Even with jammers, FH-CDMA works because the Error Correction or majority logic can ignore "hits" on specific frequencies.

Internal Logic & Mathematical Flow

The simulator operates on a Time-Frequency Grid. Unlike standard CDMA which uses code-multiplication in the time domain, FH-CDMA uses the code to shift the frequency axis. Here is how the engine processes your data:

1. Time Slot Discretization

The total transmission time is divided into Hop Intervals ($T_h$). Depending on your setting, the simulator calculates how many hops are needed per bit.

N_hops = Bit_Length × Hopping_Rate

If Hopping_Rate > 1, it is Fast Hopping; if < 1, it is Slow Hopping.

2. Frequency Synthesis (The PN Sequence)

For every time slot $k$, the simulator looks up a value from the Pseudo-Noise (PN) Sequence. This sequence is the "Shared Secret" between the sender and receiver.

f_k = f_base + [ PN(k) mod M ] ⋅ Δf

f_k: Current carrier frequency

M: Total number of channels (8 in simulator)

PN(k): Code value at step k

Δf: Channel spacing

3. Channel Modeling (Summation & Interference)

The simulator creates the composite signal $Y(t)$ by summing the User Signal and the random Jammer interference at each specific frequency $f$.

Y(f, t) = S(f_k, t) + ∑ J(f_random, t)

A "Collision" (Hit) occurs if the User Frequency exactly matches a Jammer Frequency: f_k = f_jammer.

4. Despreading & Processing Gain

The receiver "de-hops" the signal by multiplying the received energy with its own local PN-timed frequency. The Processing Gain ($G_p$) determines the probability of successfully avoiding the jammer.

G_p = 10 ⋅ log₁₀( B_ss / B_i ) ≈ 10 ⋅ log₁₀( M )

In our simulator, with 8 channels, the Processing Gain is ≈ 9 dB. This means the signal is roughly 8 times harder to jam than a single fixed-frequency signal.

5. Majority Logic Decoding

For Fast Hopping, the simulator uses majority logic. If a bit is sent over 3 hops and 1 hop is jammed (a "Hit"), the receiver still correctly decodes the bit because 2 out of 3 hops were clear.

Bit_out = Mode( Received_Samples_{per_bit} )

Step-by-Step: Hopping the Bit String "10011"

In FH-CDMA, bits aren't just 1s and 0s; they are passengers on a carrier frequency that changes according to a "Secret Schedule" (the PN Code).

Input String: 10011

PN Sequence (Schedule): [3, 7, 1, 4, 0, 6]

Scenario A: Slow Hopping (1 Bit per Hop)

One frequency jump for every one bit of data.

Time	Bit	PN Code	Final Result
T1	1	3	Sent on 3 GHz
T2	0	7	Sent on 7 GHz
T3	0	1	Sent on 1 GHz
T4	1	4	Sent on 4 GHz
T5	1	0	Sent on 0 GHz

Note: If a jammer blocks 7GHz, only T2 (the first 0) is lost.

Scenario B: Fast Hopping (2 Hops per Bit)

Two frequency jumps for every one bit (Increases security).

Time	Bit	PN Code	Final Result
T1	1	3	1 (Part A) on 3 GHz
T2		7	1 (Part B) on 7 GHz
T3	0	1	0 (Part A) on 1 GHz
T4		4	0 (Part B) on 4 GHz

With Fast Hopping, even if a jammer hits 7GHz, the receiver still gets the first half of the "1" on 3GHz. It uses Majority Logic to reconstruct the data perfectly.

Return to Signal Processing Main Page →

Online Simulations Main Page →