Chapter 4

Spread Spectrum
Learning Outcome
Uponcompletion of this chapter,
student should be able to:
◦Define concepts of spread spectrum
technology and how it operates in
wireless environment
◦Describe three spread spectrum
techniques: FHSS, DSSS and CDMA.
◦Compare basic operation and
characteristic of FHSS, DSSS and
CDMA
 Outline
 Introduction of Spread
Spectrum
Frequency Hopping Spread
Spectrum (FHSS)
Direct Sequence Spread
Spectrum (DSSS)
Code Division Multiple Access
(CDMA)
Spread Spectrum
 Transmit analog or digital data using analog signal
 Spread spectrum: the frequency of the transmitted
signal is deliberately varied. This results in a much
greater bandwidth than the signal would have if its
frequency were not varied
 Increasingly important form of encoding for wireless
communication
 Spread data over wide bandwidth
 to make jamming and interception harder
 Frequency hoping (1st developed)
 Signal broadcast over seemingly random series of
frequencies
 Direct Sequence
 Each bit is represented by multiple bits in
transmitted signal
 Chipping code
Overview

In spread spectrum (SS)
• combine signals from different sources to fit into
a larger bandwidth
• objectives :
• are to prevent eavesdropping
• and jamming.
• To achieve these goals, spread spectrum
techniques add redundancy.
 Spread Spectrum Concept
 Input fed into channel encoder
 Produces narrow bandwidth analog signal around central
frequency
 Signal modulated using sequence of digits
 Spreading code/sequence
 Typically generated by pseudonoise/pseudorandom number
generator
 Increases bandwidth significantly
 Spreads spectrum
 Receiver uses same sequence to demodulate
signal
 Demodulated signal fed into channel decoder
to recover the data
General Model of Spread
Spectrum System
Benefits
 Immunity from various noise and
multipath distortion
 Application : military communication
used for its immunity to jamming
 Can hide/encrypt signals
 Only receiver who knows spreading code
can retrieve signal
 Several users can share same higher
bandwidth with little interference
 Cellular telephones
 Code division multiplexing (CDM)
 Code division multiple access (CDMA)
 Pseudorandom Numbers
Generated by algorithm using
initial valued called seed
Deterministic algorithm
Produce sequence of numbers but not
actually random
If algorithm good, results of sequences
will pass reasonable tests of randomness
Need to know algorithm and
seed to predict sequence
Only transmitter and receiver
able to decode the signal
successfully
 Frequency Hopping Spread
Spectrum (FHSS)
Signal broadcast over seemingly
random series of frequencies,
hopping from frequency to frequency
at fixed interval
Receiver hops between frequencies in
sync with transmitter
Eavesdroppers hear unintelligible blips
(repetitive pulse)
Attempt to jam the signal on one
frequency affects only knocking out a
Basic Operation
 Typically
2k carriers frequencies
forming 2k channels
 Channel spacing (between carrier
frequency and width of each channel)
corresponds with bandwidth of the input
signal
 Each channel used for fixed interval
 300 ms in IEEE 802.11
 During that interval, some number of bits
transmitted using some encoding scheme
 May be fractions of bit
Sequence of channel is dictated by
spreading code
Transmitter and receiver used same code
for synchronization
Frequency Hopping Example
Frequency Hopping Spread
Spectrum System (Transmitter)
digital to
analog
encoding
scheme

Analog
signal

• Resulting signal is
centered on some base
frequency
• PN source serves an
index into frequencies
table (spreading code)
• New carrier frequency
selected based on
successive interval (each
k PN bits)
• This frequency
modulated by initial
Frequency Hopping Spread
Spectrum System (Receiver)

• spread spectrum signal is demodulate

using same sequence of PN-derived
frequencies
• Demodulated using FSK or BFSK to
produce output data
equency Hopping Spread Spectrum (FHS

• FHSS is signal broadcast over seemingly

random series of frequencies, hopping
from frequency to frequency at fix interval
Frequency selection in FHSS
 FHSS cycles

• the pattern repeat after 8 hopping frequencies

• intruder only can intercept if knows the PN
sequence
• the scheme has antijamming effect
• the malicious sender may be able to send
 Bandwidth sharing

• FHSS similar to FDM

• In FDM, each station uses 1/M of the bandwidth,
but the allocation is fixed
• in FHSS, each station uses 1/M of bandwidth but
the allocation changes hop to hop
Slow and Fast FHSS
Common modulation technique
conjunction with FHSS is multiple FSK
(MFSK)
MFSK signal is translated to new
frequency shifted every Tc seconds
For data rate R, duration of bits is T= 1/R
and duration of a signal element is Ts =
LT seconds
 Slow FHSS has T  T
c s
 Fast FHSS has T < T
c s
Generally fast FHSS gives improved
performance in noise (or jamming)
Slow Frequency Hop Spread
Spectrum Using MFSK (M=4, k=2)

• M = 4 , means 4 different frequencies are used to

encode the data input k=2 bits at a time
MFSK bandwidth, Wd = Mfd
fi = fc + (2i – 1 –M)fd • FHSS scheme 2k =4, 4 carrier frequencies with 4
fc = denotes the carrier frequency
channel
fd = denotes the difference frequency • FHSS bandwidth, Ws = 2kWd
M = number of different signal elements = • Duration of two signal elements or 4 bits, Tc = 2Ts
2L
L = number of bit per signal element = 4T
Fast Frequency Hop Spread
Spectrum Using MFSK (M=4, k=2)

• M = 4 , means 4 different frequencies are used to

encode the data input k=2 bits at a time
MFSK bandwidth, Wd = Mfd
• FHSS scheme 2k =4, 4 carrier frequencies with 4
channel
• FHSS bandwidth, Ws = 2kWd
• Duration of two signal elements or 4 bits, Ts = 2Tc
= 4T
FHSS Performance
Considerations
Typicallylarge number of
frequencies used (<K)
 Improved resistance to jamming –
jammer need to jam all 2k
frequencies
 Direct Sequence Spread
Spectrum (DSSS)
 Each bit represented by multiple bits
using spreading code
 Spreading code spreads signal across
wider frequency band
 In proportion to number of bits used
 10 bit spreading code spreads signal across 10
times bandwidth of 1 bit code
 One method with DSSS:
 Combine digital information stream input with
spreading code bit stream using exclusive OR
(XOR)
 Input bit 1 inverts spreading code bit
 Input zero bit doesn’t alter spreading code bit
 Data rate equal to original spreading code
 Performance similar to FHSS
Direct Sequence Spread Spectrum

• this technique also expands the

bandwidth of the original signal
• in DSSS, using a spreading code to
replace each data bit with n bits
• each bit will be represented by
multiple bits (n bits)
DSSS example
Direct Sequence Spread
Spectrum Example
Direct Sequence Spread
Spectrum Transmitter
Direct Sequence Spread
Spectrum Receiver
Direct Sequence Spread
Spectrum Using BPSK Example
Approximate Spectrum of
DSSS Signal
Code Division Multiple Access
(CDMA)
 Multiplexing Technique used with spread
spectrum
 Start with data signal rate D
 Called bit data rate
 Breakeach bit into k chips according to fixed
pattern specific to each user
 User’s code
 New channel has chip data rate kD chips per
second
 E.g. k=6, three users (A,B,C) communicating
with base receiver R
 Code for A = <1,-1,-1,1,-1,1>
 Code for B = <1,1,-1,-1,1,1>
 Code for C = <1,1,-1,1,1,-1>
Features of CDMA

The following features are unique

to CDMA technology:
◦ Universal frequency reuse
◦ Fast and accurate power control
◦ Rake receiver
◦ Different types of handoff
CDMA Example
 CDMA Explanation
 Consider A communicating with base
 Base knows A’s code
 Assume communication already synchronized
 A wants to send a 1
 Send chip pattern <1,-1,-1,1,-1,1>
 A’s code
 A wants to send 0
 Send chip[ pattern <-1,1,1,-1,1,-1>
 Complement of A’s code
 Decoder ignores other sources when using
A’s code to decode
Orthogonal codes
CDMA Example
 CDMA for DSSS

n users each using different orthogonal PN

sequence
 At transmitter, each users will transmit modulate
data stream
 Using BPSK to produce a signal with a bandwidth of Ws
(FHSS bandwidth) then multiply by spreading code of user
 Signal plus noise reach at receiver’s antenna
 At receiver, suppose attempt to recover data of
user 1
 Incoming signal multiplied by the spreading code then
demodulated
CDMA in a DSSS Environment
Seven Channel CDMA Encoding
and Decoding
Review
Questions
1. Describe FHSS.
2. Describe DSSS.
3. What are benefits of
implementing spread spectrum
in communication?
4. What are advantages of the
CDMA?
5. Discuss slow and fast FHSS.
6. Give example application of
CDMA and DSSS.
 Review
Questions
Ten Top advantages of using CDMA
Voice Activities Cycles. CDMA is the only access that takes advantage
of the nature of human conversation. In CDMA all the users are sharing
one radio channel with less interference in a single CDMA radio channel.
So, the mutual interference is reduced by 65%; and thus, the channel
capacity is increased about three times.
No Hard Handoff. In CDMA, every cell uses the same radio, the only
difference is the code sequences. As a result there is no handoff from
one frequency to another while moving between cells.
No Guard Time in CDMA. TDMA requires the use of guard time
between time slots. Of course, the guard time does occupy the time
period for certain bits. This "waste" of bits does not exists in CDMA,
because guard time is not needed in CDMA technique.
Less Fading. Less fading is observed in the wide-band signal while
propagating in a mobile ratio environment.
Capacity Advantage. Within certain parameters, CDMA can have four
times the TDMA capacity; and twenty times the FDMA capacity per
channel/cell.
No frequency management or assignment needed. In both TDMA
and FDMA the frequency management is always a critical task. Since
there is only one channel in CDMA, no frequency management is
needed.
Soft Capacity. Since all CDMA traffic channels share a single CDMA
radio channel, we can always add one additional user -- of course the
voice quality is there by slightly degraded.
Coexistence. Both systems, analog and CDMA can operate in two
Lecture End

Next Chapter
on
Local Area Network
Overview