Spread spectrum modulation
Basant K Mohanty
Electronics and Telecommunication Department
B.K.Mohanty, EXTC, MPSTME Shirpur 1
Secure communication
For secured communication, it is desired
• To provide immunity to information from various kinds of
interfering noise (intentional or unintentional) and multipath
distortion.
• To hide and encrypt signals for unauthorized access.
• Disruption of information transmission intentionally by
intruder known as jamming.
• Several users can independently share channel with very
little interference.
How to achieve secured communication?
• Can be achieved by spreading the signal spectrum
beyond the minimum bandwidth required for
transmission.
• In other word, information can be transmitted securely at
the cost of higher channel band width.
• Spread spectrum modulation provides secure
communication.
Definition of spread spectrum modulation
• A modulation scheme to increase the bandwidth of the signal to be
transmitted
• Spectrum spreading is accomplished before the transmission using a
spreading code (spreading sequence)
• Spreading sequence is independent of the signal to be transmitted.
• The same spreading sequence is used in the receiver to de-spread the
received signal to recover the original transmitted signal
Pseudo noise sequence
• A noise like spreading code called pseudo noise (PN) sequence
which is used by spread spectrum modulation.
• PN Sequences
Generated by an algorithm using initial seed
The Sequence isn’t statistically random but will pass many test of
randomness
Unless algorithm and seed are known, the sequence is
impractical to predict
Few information about PN sequence
• PN sequence is periodic sequence of maximum period.
• Therefore, PN sequence is also called maximum length sequence.
• PN sequence is generated using linear shift register and external logic
circuits.
• PN sequence period depends on the length of the shift-register i.e.
number of flip-flops used by the shift register.
• The period or maximum length of PN sequence is given as
N=2m-1, where m=length of the shift register
PN sequence generator (m=3)
x0 x1 x2 x3
Output
D-FF D-FF D-FF
sequence
Shift-register ...0 0 1 1 1 0 1, 0 0 1 1 1 0 1...
x0=x1+x3
( of period 7)
Consider a seed value ‘100’ for the PN generator.
clk x0=x1+x3 x1 x2 x3 output
• Shift register is initialized with some
0 1 1 0 0 0 state except all zero state i.e. ‘000’.
1 1 1 1 0 0 • The initial shift register state is called
seed.
2 0 1 1 1 1
3 1 0 1 1 1 • Note: 000 is not a state of the shift-
register sequence since this result
4 0 1 0 1 1 catastrophic cyclic code i.e. once the
5 0 0 1 0 0 state 000 is entered, the shift-register
6 1 0 0 1 1 can not leave this state.
7 1 1 0 0 0 (repeat)
PN sequence property
Property 1:
Has 2m-1 ones and 2m-1-1 zeros
Example: m=3, one period of PN sequence 0011101
Number of 1’s: 4
Number of 0’s: 3
PN sequence property cond..
• Property 2:
– For a set of successive N (=2m-1) shift register states,
each m-bit state appears once, except for the all zeros
state.
Example: for m=3, shift-register states are:
{100, 110, 111, 011, 101, 010, 001}
Each 3-bit state appears once
PN sequence property
• Property 3: (run length property)
– Sequence contains one run of ones of length m
– One run of zeros of length (m-1)
– One run of ones and one run of zeros each of length (m-2)
– Two runs of ones and two runs of zeros of length (m-3)
– 2m-3 runs of ones and 2m-3 runs of zeros, length 1
Example: PN sequence for m=3 is 0011101
Runs of 0’s and 1’s: 00, 111, 0, 1
Sequence contains one run of 1’s of length m, i.e. 111
Sequence contains one run of 0’s of length m-1, i.e. 00
One run of ones and one run of zeros, length m-2: 0, and 1
PN sequence properties
• Property 4:
– The periodic autocorrelation (for a ±1) of a
sequence of length N is
1 τ 0, N, 2N, ...
R 1
N otherwise
Baseband transmission of spread
spectrum modulated signal
• Widening of bandwidth of an information bearing signal is
performed through modulation.
• Data sequence b(t) is used to modulate a wide-band PN
sequence c(t).
• Base band transmitted signal m(t) is expressed as:
m(t)=c(t)b(t)
• Multiplication of spreading sequence c(t) with information
bearing signal b(t) results each bit is chopped into number
of small time increments
Illustration of baseband modulated signal
+1
Information
bearing signal b(t) t
Tb=symbol duration of b(t)
-1
Tb
+1
Spreading
t
sequence c(t)
{0011101}
-1
Tc Tc=bit duration of PN sequence c(t),
NTc
such that Tb=NTc.
+1
Modulated
signal m(t) t
-1
Demodulation
• Received signal r(t) = m(t)+i(t)= c(t)b(t)+i(t),
where, i(t) is the additive interference.
z(t) Low-pass
1. At the receiver, the locally r(t) filter b(t)
generated PN sequence is the
exact replica of the sequence
used by the transmitter. c(t)
2. The receiver operate in perfect Schematic of baseband
synchronization with the modulation
transmitter.
z(t) = r(t)c(t) Note: Spreading sequence c(t) alternate
= {c(t)b(t)+i(t)}c(t) between the levels +1 and -1.
= c2(t)b(t)+c(t)i(t) This alteration destroyed when c(t) is squared.
= b(t) + c(t)i(t) Therefore, c2(t)=1
• Finally, the interference component c(t)i(t) is removed from the output
by passing the modulator output through a baseband low-pass filter.
Pass-band modulation:
Direct-sequence spread coherent BPSK (DS-BPSK)
• The direct-sequence spread is further modulated using
coherent BPSK for pass-band channels.
• The transmitter involves two-stage modulation (i) direct-
sequence-spread-spectrum and (ii) BPSK modulator
DS-BPSK transmitter
m(t)
Data BPSK
x(t)
sequence modulator
b(t) c(t)
PN sequence
Carrier
generator
signal
DS-BPSK receiver
z(t)
Received BPSK
signal r(t) demodulator b(t)
c(t)
Local PN sequence
generator Local
carrier
Modified DS-BPSK transmitter/receiver block diagram
• Operation of direct-sequence spread spectrum and the BPSK modulator
can be interchanged for convenience as given below:
Transmitter s(t)
Data BPSK
x(t)
sequence modulator
b(t) c(t)
PN sequence
Carrier
generator
signal
Receiver
Received u(t)
BPSK
signal r(t) b(t)
demodulator
i(t) c(t)
Local PN
interference sequence Local
generator carrier
Modified DS-BPSK receiver operation
• Received signal y(t)= x(t)+ j(t)
j(t) is the channel interference noise.
y(t)= s(t)c(t)+ j(t)
• despread signal u(t) = y(t)c(t)
= {s(t)c(t)+j(t)}c(t)
= s(t)c2(t)+j(t)c(t)
= s(t) + j(t)c(t)
Since c2(t)=1
• BPSK modulate signal s(t) is demodulated by the coherent detector to
estimate of the transmitted information b(t)
