1

SPREAD SPECTRUM
Unit 5
 First available patent in 1942
2

George Antheil film composer Hedy Lamarr movie actress

 WAR
3
4
5

World War II: Torpedoes could be guided by radio control, but the ra
dio transmission could also be jammed by the enemy, confusing the torp
edo
 Patent describes mechanical system for FHS
S to remotely control torpedoes
6
 Secure communication , Low probability
7
of Detection(LPD)

WAR SITE Control Room

 Why we should go for Spread Spectru
8
m?- Technical Style
We need
Anti-jamcapabilities
Secure Communications
Low probability of detection(LPD) / Low probability of Inter
cept(LPI)
Low probability of Position Fix(LPPF)
Multiple Access
 Why we should go for Spread Spectru
9
m? Marketing Style
Coverage
For Coverage, CDMA saves
wireless carriers from deploying
the 400% more cell site that
are required by GSM
Clarity
CDMA with PureVoice
provides wireline clarity
Capacity
CDMAs capacity supports at
least 400% more revenue-producing
subscribers in the same spectrum
when compared to GSM
Choice
CDMA offers the choice of simultaneous
voice, async and packet data, FAX, and
SMS.
*From Samsumgs narrowband CDMA (CDMAOne) marketing (2001)
Cost
$ $
A carrier who deploys CDMA
instead of GSM will have
a lower capital cost
Customer satisfaction
The Most solid foundation for
attracting and retaining subscriber
is based on CDMA
 Definition
10

Spread spectrum is means of transmission in which data of in

terest occupies a bandwidth in excess of the minimum bandw
idth necessary to send the data.
The spectrum spreading is accomplished before transmission
through the use of code that is independent of data sequence.
The same code is used in receiver to despread the received si
gnal so that the original data may be recovered.
 Illustration
11
12

The system is defined to be spread spectrum if it fu

lfills following requirements
Occupied bandwidth is much in excess of minimum ba
ndwidth necessary to send the information.
Spreading is accomplished by means of spreading sign
als.
At receiver, despreading is accomplished by the correl
ation of received spread signal with a synchronized re
plica of spreading signal used to spread the informatio
n
 Applications
13

GPS Satellite System

F7 F2
Cellular
F6 F1
F1 F3

F5 F4

Bluetooth
LAN/ WLAN/Internet connection
Railroads and transportation
14
 Applications-IS95(CDMA)
15
 Application-Ranging
16
17
 Generating the Spreading (Pseudo-Noi
18
se) Sequence
 PN Sequence: Example
19

When the period of PN sequence is

exactly equal to (2
m
1) then
PN sequence is called as Maximal l
ength sequence
 PN Sequence: Example
20

Output Sequence
 Properties of PN sequence
21

Randomness Properties
Balance
Forgood balance, number of Binary Ones differs from num
ber of binary Zeros by at most one digit.

Consider the sequence

0010111
Is there balance?
22

Run
A run is defined as a sequence of a single type of binar
y digits.
The appearance of alternate digit in a sequence starts
a new run.
Length of run is the number of digits in the run.
Among the runs of ones & zeros in each period, it is desirab
le that about one-half the runs of each type are of length o
f 1, about one-forth are of length 2, one eighth are of lengt
h 3, and so on.
Consider the sequence
23

000100110101111
000100110101111
Run- Total runs of Zero= 4
are of length 1= 2
are of length 2= 1
24

Correlation
25
 PSD
26

PSD
27

Correlation
Ifa period of the sequence is compared term by term
with any cyclic shift of itself, it is best if the number of
agreements differs from the number of disagreements
by not more than one count.
28

Consider the sequence

Shifted sequence is

Finding the agreements & disagreements

29
30

Consider following PN sequence & check randomn

ess properties
0000101011101100011111001101001
Balance

Run

Correlation
31

Consider following PN sequence & check randomn

ess properties
0000101011101100011111001101001
Balance- Zeros 15, Ones 16
Run- Total runs of Zero= 8
are of length 1= 4
are of length 2= 2
1/8 are of length 3= 1
Correlation
No. of agreements =15
No. of Disagreements =16

R
()
x
1
(
15
31
16
)
1

31
 Maximal Length Sequence
32

When the period is exactly equal to 2m1 then PN

sequence is called as Maximal length sequence.
Choosing a Maximal Length Sequence
 Maximal Length Sequence
33

5 Shift registers
34
 512 bit gold sequence
35

PN sequence can be c
omputed
Berlekamp Algorithm.
So use Gold Sequence.
 Summary for PN sequence
36

Generated by algorithm using initial seed

Deterministic algorithm
Not actually random
If algorithm good, results pass reasonable tests of rand
omness
Need to know algorithm and seed to predict seque
nce
 Notion of Spread Spectrum
37
 Direct Sequence
38
39
 DS-BPSK
40
 DS-BPSK Waveform
41
 Regeneration of Data
42
 Application-Ranging
43
44

DS signal is represented as

s
t
2
P
sg
(t
)cos(
w
t
)
0

Reflected Signal is

r
t s
(
tT1
T2
)
After Substitution

r
t 2
Ps
g
(t
T
1T
2
)
co
w
(
t
T
1T
2
)

r
t 2
Ps
g(
tT
1
T
2
)
cos
wt
o)

Where

w
(
T
o1
T2
)
45

Carrier is recovered from squaring circuit and PN sequence is extracted

which is delayed by time T1 & T2.

LTc
v
0R
(
gD
)
g(
t
T
1T2
)
g(
tD
)
dt
0

Rg(D) Is maximum when D=T1+T2 and small when there is difference D - ( T1+T2)

If c= velocity of light & T1=T2 , The range can be given as 1

d cD
2
1
For precise measurement d c(DTc
)
2
 PANSAT using DSSS
46

Why we need Multiple Access ?

 Waste of Bandwidth Due to Spreading ?
47

Spreading results directly in the use of a wider freq

uency band, so it doesn't spare the limited frequen
cy resource. That overuse is well compensated, ho
wever, by the possibility that many users will share
the enlarged frequency band.
 New York
48

1890
1990
 Frequency hopping spread spectrum (
49
FHSS)

Frequency hop- carrier hopes randomly from one frequency to another

 FH using 8-ary FSK
50

Data rate= 150 bits, symbol rate=50, T=1/50=20ms, tone separation 50hz
 Frequency Hoping
51

frequency

K bits of PN Seque
nce
 Frequency Hoping MFSK
52

frequency

K bits of PN
Sequence
53
54

Fast Frequency hoping means

Severalfrequency hopes per modulation symbol
Hop rate is R h an integer multiple of symbol rate R s

Slow Frequency hoping means

Severalmodulation symbols per hop
Symbol rate R is an integer multiple of hop rate R
s h
 Slow FHSS
55

Several modulation symbols per hop

 Fast FHSS
56

Several frequency hopes per modulation symbol