Data and Computer Communications: - Spread Spectrum
Data and Computer Communications: - Spread Spectrum
Spread Spectrum
important
encoding method for wireless communications analog & digital data with analog signal spreads data over wide bandwidth makes jamming and interception harder two approaches, both in use:
distortion can hide / encrypt signals several users can share same higher bandwidth with little interference
Pseudorandom Numbers
generated
by a deterministic algorithm
not actually random but if algorithm good, results pass reasonable tests of randomness
starting
from an initial seed need to know algorithm and seed to predict sequence hence only receiver can decode signal
is broadcast over seemingly random series of frequencies receiver hops between frequencies in sync with transmitter eavesdroppers hear unintelligible blips jamming on one frequency affects only a few bits
FHSS (Transmitter)
use multiple FSK (MFSK) have frequency shifted every Tc seconds duration of signal element is Ts seconds Slow FHSS has Tc Ts Fast FHSS has Tc < Ts FHSS quite resistant to noise or jamming
bit is represented by multiple bits using a spreading code this spreads signal across a wider frequency band has performance similar to FHSS
multiplexing technique used with spread spectrum given a data signal rate D break each bit into k chips according to a fixed chipping code specific to each user resulting new channel has chip data rate kD chips per second can have multiple channels superimposed
CDMA Example
Problem
# Consider the seven-channel CDMA shown in the following figure. Enlist the user code for each channel. A positive sum is decoded (at the receiver) as 1 and a negative sum is decoded as 0. If all the channels are transmitting as shown, determine whether the receiver detects the correct bit of channel 1.
Problem
Orthogonal Sequence
Sequence is generated by Walsh Table: W1 = [+1]
W2 = W1 W1
W1 !W1
W4 = W2 W2 W2 !W2
Summary
looked