Data Communication Components · Computer Networks

Spread Spectrum

Watch lectures
SVGVector Architecture Diagram (SVG)
COMPUTER NETWORKS · Module 1★ High PrioritySpread SpectrumIT Sem 6 · Code 100602 · FHSS, DSSS, CDMA, processing gainMNEMONICSpread: Bss much greater than B via a shared PN code. FHSS hops, DSSS multiplies by chips.CDMA uses orthogonal codes: d = (S . C) / N. Bluetooth = FHSS, 802.11b / GPS = DSSS.Core BreakdownIdeaSignal bandwidth is deliberately spread far beyond the minimum needed (Bss >> B).A pseudo-noise (PN) code spreads at the sender; the same code de-spreads.BenefitsResists jamming and noise; low probability of intercept (below the noise floor).Lets many users share one band: code division multiple access.FHSSCarrier hops among many frequencies in a PN order; receiver hops in step.Slow hop: several bits per hop. Fast hop: several hops per bit.DSSSEach bit is multiplied by a fast chip code (Rc much greater than Rb).Barker +1 -1 +1 +1 -1 +1 +1 +1 -1 -1 -1 spreads 1-2 Mbps over 22 MHz.CDMAOrthogonal chip codes: Ci . Cj = 0 for i not equal j, Ci . Ci = N.Channel carries S = sum d_k x C_k; receiver finds d_i = (S . C_i) / N.GainProcessing gain Gp = 10 log10(Bss / B) dB: more spread, better noise rejection.Bluetooth: 1600 hops/s over 79 channels of 1 MHz in the 2.4 GHz ISM band.Diagram: FHSS, DSSS and CDMAFHSS: frequency vs time12345ftDSSS: Barker chips+-++-+++----+--+---+++bit 1: codebit 0: invertedCA=[+1 +1 +1 +1] CB=[+1 -1 +1 -1]A=1, B=0: S=[0 +2 0 +2]S.CA/4=+1 S.CB/4=-1Both bits recovered⚠️ Exam Traps & Viva Favorites① What is a PN sequence?A deterministic bit pattern that looks random tooutsiders but repeats exactly and is known to bothsender and receiver (from an LFSR).② FHSS vs DSSS?FHSS hops the carrier over frequencies (Bluetooth).DSSS multiplies bits by a chip code and fills thewhole band all the time (802.11b, GPS, CDMA).③ CDMA decoding example?CA = [+1 +1 +1 +1], CB = [+1 -1 +1 -1]. A sends 1,B sends 0: S = [0 +2 0 +2]. S.CA/4 = +1 andS.CB/4 = -1, so each bit is recovered.Tip: Gp = 10 log10(Bss / B)Master Revision Table(learn it row by row!)ParameterFHSS (hopping)DSSS (direct sequence)SpreadingCarrier hops among frequenciesData multiplied by a high-rate chip codeBandwidth useNarrow slice, hops over wide bandWhole wide band, continuouslyCore hardwareFrequency synthesizer + PN generatorCorrelator / matched filter + PN generatorStandardBluetooth (IEEE 802.15.1)Wi-Fi 802.11b, GPS, 3G CDMA (IS-95, UMTS)MultipathGood, frequency diversityExcellent, RAKE receiverKey ratioHop rate / bit rate (slow or fast)Chip rate / bit rate = spreading factorQUICK FACTSOrthogonal: CA . CB = 1 - 1 + 1 - 1 = 0 · self product CA . CA = N = 4Bit 1 = +1, bit 0 = -1, silence = 0 · Walsh codes give the orthogonal sequencesBluetooth hops 1600 times per second · 802.11b Barker code is 11 chips longVERIFIED★ Golden rule: spread with a secret code,recover only with the same code.

Spread Spectrum Concepts: FHSS, DSSS, and CDMA


1. Fundamentals of Spread Spectrum

Spread Spectrum is a transmission technique where the bandwidth of the transmitted signal (BssB_{ss}) is intentionally expanded to occupy a much wider frequency spectrum than the minimum bandwidth (BB) required by the original information signal:

Bss≫BB_{ss} \gg B

The spreading is achieved by combining the original data with an independent, pseudo-random bit pattern called a Pseudo-Noise (PN) Code Sequence. At the receiver, the identical synchronized PN code is used to de-spread and recover the original data.

MermaidDiagram
Rendering diagram…

Core Motivations & Advantages:

  1. Immunity to Jamming & Noise: Narrowband jamming signals only corrupt a tiny fraction of the spread spectrum energy and are suppressed during de-spreading.
  2. Low Probability of Intercept (LPI): The signal power is diluted over such a wide band that it appears below the background thermal noise floor to eavesdroppers.
  3. Multiple Access: Multiple users can transmit across the same frequency spectrum at the same time without interfering, using orthogonal PN codes (Code Division Multiple Access - CDMA).

2. Frequency Hopping Spread Spectrum (FHSS)

In FHSS, the transmitter modulates data onto a carrier frequency that hops rapidly among many different frequencies across a wide band according to a pseudo-random sequence.

SVGVector Architecture Diagram (SVG)
Frequency Time f4 f3 f2 f1 Hop 1 Hop 2 Hop 3 Hop 4 Hop 5

Architecture and Working:

  • A Pseudorandom Code Generator produces a sequence of pseudo-random bits.
  • A Frequency Synthesizer uses these bits to generate a carrier frequency that changes at regular intervals.
  • The receiver has an identical PN generator synchronized with the transmitter so it hops to the exact same frequencies at the exact same time.

Slow Hopping vs. Fast Hopping:

  • Slow Hopping: The carrier frequency remains constant for multiple data bits (Hop Rate<Bit Rate\text{Hop Rate} < \text{Bit Rate}).
  • Fast Hopping: The carrier frequency changes multiple times during the transmission of a single data bit (Hop Rate>Bit Rate\text{Hop Rate} > \text{Bit Rate}).
  • Standard Application: Bluetooth utilizes FHSS, hopping 1,600 times per second1{,}600\text{ times per second} across 79 channels (1 MHz1\text{ MHz} wide each) in the 2.4 GHz2.4\text{ GHz} ISM band to avoid Wi-Fi and microwave oven interference.

3. Direct Sequence Spread Spectrum (DSSS)

In DSSS, each original data bit is multiplied directly by a higher-rate pseudo-random binary sequence called a Chipping Code (each bit in the spreading sequence is called a Chip).

SVGVector Architecture Diagram (SVG)
Data Bit: Chipping Code (11-bit Barker) Transmitted (XOR result) Data Bit 1 Data Bit 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 1 0 0 1 1 0 + - + + - + - - + + - + - + + - + - - + + - 1 0 1 1 0 1 0 0 1 1 0 0 1 0 0 1 0 1 1 0 0 1 Data bit 1: transmitted signal is the same as the chipping code Data bit 0: transmitted signal is the inverted chipping code
  • Chipping Rate: The chip rate (RcR_c) is much faster than the data bit rate (RbR_b). The ratio RcRb\frac{R_c}{R_b} defines the Spreading Factor (Processing Gain):
Processing Gain (Gp)=10log⁡10(BssB) dB\text{Processing Gain } (G_p) = 10 \log_{10}\left(\frac{B_{ss}}{B}\right)\text{ dB}
  • Barker Sequence (IEEE 802.11b):
    • Wi-Fi standard 802.11b uses an 11-chip Barker sequence: +1, -1, +1, +1, -1, +1, +1, +1, -1, -1, -1.
    • Spreads a 1 Mbps1\text{ Mbps} or 2 Mbps2\text{ Mbps} signal over a 22 MHz22\text{ MHz} wide RF channel.
  • De-spreading at Receiver:
    • The receiver multiplies the received signal by the identical synchronized Barker sequence.
    • Mathematical auto-correlation concentrates the dispersed data energy back into a narrow peak while spreading out any unwanted interference.

4. Code Division Multiple Access (CDMA) & Walsh Codes

CDMA allows multiple transmitters to send information simultaneously over a single communication channel using Orthogonal Chip Codes (Walsh Sequences).

Mathematical Principles of CDMA:

  • Represent bit 0 as −1-1 and bit 1 as +1+1. Silent (idle) is 00.
  • Each station kk is assigned an orthogonal chip sequence CkC_k of length NN satisfying:
Ci⋅Cj=0(for ieqj — Orthogonal)C_i \cdot C_j = 0 \quad (\text{for } i eq j \text{ — Orthogonal})
Ci⋅Ci=N(Self Inner Product)C_i \cdot C_i = N \quad (\text{Self Inner Product})
  • When stations transmit simultaneously, their signals add linearly on the medium:
S=∑k=1ndk⋅CkS = \sum_{k=1}^{n} d_k \cdot C_k
  • To extract the data of station ii, the receiver computes the normalized dot product:
di=S⋅CiNd_i = \frac{S \cdot C_i}{N}

Solved Numerical Example:

Let two stations A and B have 4-chip orthogonal codes:

  • CA=[+1,+1,+1,+1]C_A = [+1, +1, +1, +1]
  • CB=[+1,−1,+1,−1]C_B = [+1, -1, +1, -1]
  1. Check Orthogonality:
CA⋅CB=(1)(1)+(1)(−1)+(1)(1)+(1)(−1)=1−1+1−1=0✓C_A \cdot C_B = (1)(1) + (1)(-1) + (1)(1) + (1)(-1) = 1 - 1 + 1 - 1 = 0 \quad \checkmark
  1. Encoding:
    • Station A wants to send data bit 1 →dA=+1\rightarrow d_A = +1.
SA=(+1)×[+1,+1,+1,+1]=[+1,+1,+1,+1]S_A = (+1) \times [+1, +1, +1, +1] = [+1, +1, +1, +1]
  • Station B wants to send data bit 0 →dB=−1\rightarrow d_B = -1.
SB=(−1)×[+1,−1,+1,−1]=[−1,+1,−1,+1]S_B = (-1) \times [+1, -1, +1, -1] = [-1, +1, -1, +1]
  1. Combined Channel Signal:
S=SA+SB=[0,+2,0,+2]S = S_A + S_B = [0, +2, 0, +2]
  1. Receiver Decoding for Station A:
S⋅CA=(0×1)+(2×1)+(0×1)+(2×1)=4S \cdot C_A = (0 \times 1) + (2 \times 1) + (0 \times 1) + (2 \times 1) = 4
dA=44=+1  ⟹  Data Bit 1✓d_A = \frac{4}{4} = +1 \implies \text{Data Bit } 1 \quad \checkmark
  1. Receiver Decoding for Station B:
S⋅CB=(0×1)+(2×−1)+(0×1)+(2×−1)=−4S \cdot C_B = (0 \times 1) + (2 \times -1) + (0 \times 1) + (2 \times -1) = -4
dB=−44=−1  ⟹  Data Bit 0✓d_B = \frac{-4}{4} = -1 \implies \text{Data Bit } 0 \quad \checkmark

5. Comparison: FHSS vs. DSSS

Parameter FHSS (Frequency Hopping) DSSS (Direct Sequence)
Spreading Mechanism Rapidly shifting carrier frequency Multiplying data bits by high-rate chip sequence
Bandwidth Occupation Narrow instant slice, hops across wide band Occupies entire wide bandwidth continuously
Hardware Core Frequency Synthesizer & PN generator Correlator / Matched Filter & PN generator
Primary Standard Bluetooth (IEEE 802.15.1) Wi-Fi 802.11b, GPS, 3G CDMA (IS-95, UMTS)
Resistance to Multipath Good (frequency diversity) Excellent (Rake receiver isolates multipath delays)

Frequently Asked Questions

QWhat is a Pseudo-Noise (PN) sequence?

A deterministic binary sequence generated by a mathematical algorithm (e.g., Linear Feedback Shift Registers) that appears random to unauthorized observers but repeats deterministically and is known to both transmitter and receiver.

QState two benefits of Spread Spectrum in commercial and military systems.
  • Immunity against intentional hostile jamming and ambient radio interference.
  • Enabling multiple access (CDMA) on identical frequencies with orthogonal codes without collision.
QWhat is Processing Gain?

The ratio of the spread spectrum signal bandwidth to the original baseband information bandwidth (Gp=Bss/BG_p = B_{ss} / B). Higher processing gain yields higher noise rejection.

QDifferentiate FHSS and DSSS.

FHSS hops the carrier rapidly across many frequencies in a pseudo-random order (used by Bluetooth). DSSS multiplies each data bit by a fast chipping code so the signal occupies the whole band continuously (used by 802.11b and CDMA).

Budget AppAndroid App

Pocketly on Android

Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.

← All Computer Networks modules