6

Week No- 16 to 18

ETAF Academy Technique College

Department of Ground Electronics
and Communication Technology
Course: Course Title: Digital
Communication
Course Code: DCOM-22A2
Contact Hours: 80 Hours (Four per week)
Pre-requisit: - Analog Communication
- Basic electronics
- Advanced electronics
Instructor:- Biniyam Ayele Belete (J.W.O) Lecturer August, 2023 1
6.1 Introduction to spread spectrum
Military RF considerations
• High-power, fixed-frequency transmitters make easy targets.
– Easy to jam
– Easy to destroy

2
6.1 Introduction to spread …………….
SPREAD SPECTRUM
• In spread spectrum (SS), we combine signals from
different sources to fit into a larger bandwidth, but our
goals are to prevent eavesdropping and jamming.
• To achieve these goals, spread spectrum techniques add
redundancy.
• A signal that occupies a bandwidth of B, is spread out to
occupy a bandwidth of Bss
• All signals are spread to occupy the same bandwidth B ss
• Signals are spread with different codes so that they can be
separated at the receivers.
• Signals can be spread in the frequency domain or in the
time domain.
3
6.1 Introduction to spread …………….

Figure. Spread spectrum

4
6.1 Introduction to spread …………….
Spread Spectrum (History)
 This dilemma was recognized prior to WWII.
 In 1942, Hedy Lamarr and pianist George Antheil patented a
“Secret Communication System”.
 Their scheme was for a frequency hopping remote control for
torpedo guidance.
First spread-spectrum patent
 By changing the transmitter frequencies in a “random” pattern, the
torpedo control signal could not be jammed.
 Lamarr proposed using 88 frequencies sequenced for control.

Frequency switching pattern 5

6.2 Pseudonoise (PN) Sequence
PN Sequence Generation

• Codes are periodic and generated by a shift register and XOR

• Maximum-length (ML) shift register sequences, m-stage shift register,
length: L = 2m – 1 bits

Output
+
m Stages connected to modulo-2 adder
Generating PN Sequences 2 1,2
3 1,3
4 1,4
Output
5 1,4
+
6 1,6
• Take m=2 =>L=3 8 1,5,6,7

• cn=[1,1,0,1,1,0, . . .], usually written as bipolar c n=[1,1,-1,1,1,-1, . . .] 6

6.3 Spread Spectrum Technology
• Problems such as capacity limits, propagation effects,
synchronization occur with wireless systems
• Spread spectrum modulation spreads out the modulated signal
bandwidth so it is much greater than the message bandwidth
• Independent code spreads signal at transmitter and dispreads
signal at receiver
• Problem of radio transmission: frequency dependent fading can
wipe out narrow band signals for duration of the interference
• Solution: spread the narrow band signal into a broad band signal
using a special code
interference
spread power signal
power signal spread
interference
detection at
receiver
7
f
6.3 Spread Spectrum Technology ………………
• Alternatives: Direct Sequence (DS/SS), Frequency
Hopping (FH/SS)
• Spread spectrum increases BW of message signal by a
factor N, Processing Gain
Bss  Bss 
Processing Gain N  10 log10  
B  B 
Effects of spreading and interference
User signal
P P
Broadband interference
Sender: Narrowband interference
i) ii)
f f
P P P

Receiver: iii) iv) v)

8
f f
6.4 Spreading Spectrum Techniques

1. Direct Sequence (DS)

2. Frequency Hopping (FH)

3. Hybrid (DS/FH)

4. Time Hopping (TH)

5. Pulse FM System (Chirp)

9
6.5 DSSS (Direct Sequence Spread Spectrum)
DSSS (Direct Sequence Spread Spectrum) I
• XOR the signal with pseudonoise (PN) sequence
(chipping sequence)
• Advantages Tb

– Reduces frequency selective user data

fading 0 1 XOR
Tc
– In cellular networks chipping
• Base stations can use the sequence
0 1 1 0 10 1 0 1 1 010 1
same frequency range =
• Several base stations can resulting
detect and recover the signal signal
0 1 1 0 10 1 1 0 0 101 0
• But, needs precise power control
10
6.5 DSSS (Direct Sequence Spread Spectrum) …………..

Processing Gain (PG) (spreading factor(SF))

Period of one
data bit PG = SF = N = Tb / Tc

Period of
one chip

11
6.5 DSSS (Direct Sequence Spread Spectrum) …………..

DSSS (Direct Sequence Spread Spectrum) II

Transmitter Spread spectrum
Signal y(t)=m(t)c(t) transmit
user data signal
X modulator
m(t)
chipping radio
sequence, c(t) carrier

Receiver correlator
sampled
received products data
sums
signal
demodulator X integrator decision
radio
carrier
Chipping sequence,
12
c(t)
6.5 DSSS (Direct Sequence Spread Spectrum) …………..
Direct Sequence Spread Spectrum

13
6.5 DSSS (Direct Sequence Spread Spectrum) …………..
Direct Sequence Spread Spectrum Transmitter

Direct Sequence Spread Spectrum Receiver

Source: [Link] 14
6.5 DSSS (Direct Sequence Spread Spectrum) …………..
Direct Sequence Spread Spectrum Using BPSK Example

15
6.5 DSSS (Direct Sequence Spread Spectrum) …………..
DS/SS Comments
• Secure and Jamming Resistant
– Both receiver and transmitter must know c(t)
– Since PSD is low, hard to tell if signal present
– Since wide response, tough to jam everything
• Multiple access
– If ci(t) is orthogonal to cj(t), then users do not interfere
• Near/Far problem
– Users must be received with the same power

16
6.6 FHSS (Frequency Hopping Spread Spectrum)
FH/SS (Frequency Hopping Spread Spectrum) I
• Discrete changes of carrier frequency
– Sequence of frequency changes determined via PN
sequence
• Two versions
– Fast Hopping: several frequencies per user bit (FFH)
– Slow Hopping: several user bits per frequency (SFH)
• Advantages
– Frequency selective fading and interference limited to
short period
– Uses only small portion of spectrum at any time
• Disadvantages
– Not as robust as DS/SS
– Simpler to detect 17
6.6 FHSS (Frequency Hopping Spread Spectrum) ……..

FHSS (Frequency Hopping Spread Spectrum) II

narrowband Spread transmit

Transmitter
signal signal
user data
modulator modulator

frequency hopping
synthesizer sequence

Receiver
received data
signal demodulator demodulator

hopping frequency
sequence synthesizer
18
6.6 FHSS (Frequency Hopping Spread Spectrum) ……..
Slow MFSK FHSS

19
6.6 FHSS (Frequency Hopping Spread Spectrum) ……..
Fast MFSK FHSS

20
6.6 FHSS (Frequency Hopping Spread Spectrum) ……..
Frequency Hopping SS

21
Source: [Link]
6.7 TIME HOPPING SYSTEMS

• A time hopping system is a spread spectrum system in which the

period and duty cycle of a pulsed RF carrier are varied in a
pseudorandom manner under the control of a coded sequence
• Time hopped spread spectrum systems have found no commercial
application to date. However, the arrival of cheap random access
memory (RAM) and fast micro-controller chips make time
hopping a viable alternative spread spectrum technique for the
future.
• Time hopping is a system in which burst signal are initiated at
pseudo random rate. In this the transmitter is switched ON and
OFF by a code sequence. The main difference between a
frequency hopping and time hopping system is that in the former
the transmitted frequency changes at each code chip time in the
later the frequency changes occurs only at zero/ one transitions in
the code sequence. 22
6.7 TIME HOPPING SYSTEMS ………………….

TRANSMISSION OF THSS
Storage Modulator
Device
S (t)

Time slot
PN code
Activator
Generator
Clock

23
6.7 TIME HOPPING SYSTEMS ………………….

THSS RECEIVER
On-off
switches Demodulator

PN code Bit timing

Generator

Clock VCO Storage

24
6.7 TIME HOPPING SYSTEMS ………………….

THSS (contd)
• Advantages
– Has a high bandwidth efficiency as compared
to FH and DSSS.
– Its implementation is simpler than that of FHSS
– Near-far problem can be avoided in a
coordinated system
• Disadvantages
– Has a very long acquisition time.
– Also requires error correction
25
6.8 Hybrid System
Hybrid System: DS/(F)FH

26
6.9 PN Synchronization
• Synchronization uncertainty
– Time uncertainty
• Distance between Tx-Rx (propagation delay)
• Relative clock shifts
• Different phase between Tx-Rx (carrier, PN
sequence)
– Frequency uncertainty
• Two steps:
1. Acquisition (coarse alignment)
2. Tracking (fine alignment)
27
6.9 PN Synchronization …………….
Acquisition Phase
• Received signal and the locally generated PN sequence are
correlated with a coarse time step to produce a measure of
similarity between the two.
Acquisition Phase (2)

• If not exceeded, sequence is advanced by Tc/2 and repeat

correlation process.
28
6.10 Applications of Spread Spectrum

• Cell phones
– IS-95 (DS/SS)
– GSM

• Global Positioning System (GPS)

• Wireless LANs
– 802.11b
29
6.11 Performance of DS/SS Systems
• Pseudonoise (PN) codes
– Spread signal at the transmitter
– Despread signal at the receiver
• Ideal PN sequences should be
– Orthogonal (no interference)
– Random (security)
– Autocorrelation similar to white noise
(high at t=0 and low for t not equal 0)

30
6.12 Detection of DS/SS PSK
Detecting DS/SS PSK Signals
transmitter
Spread spectrum
Signal y(t)=m(t)c(t) transmit
Bipolar, NRZ signal
m(t) X X

PN
sequence, c(t) sqrt(2)cos (wct + q)

receiver
received z(t) w(t) data
signal
X X LPF integrator decision
x(t)

sqrt(2)cos (wct + q) c(t)

31
6.12 Detection of DS/SS PSK …………….
Optimum Detection of DS/SS PSK
• Recall, bipolar signaling (PSK) and white noise
give the optimum error probability
 2 Eb 
Pb Q 
  
 
• Not effected by spreading
– Wideband noise not affected by spreading
– Narrowband noise reduced by spreading

32
6.12 Detection of DS/SS PSK …………….

Signal Spectra
Bss  Bss  Tb
Processing Gain N  10 log10  
B  B  Tc
• Effective noise power is channel noise power
plus jamming (NB) signal power divided by N
Tb

Tc

33
6.13 Multiple Access Performance
• Assume K users in the same frequency band,
• Interested in user 1, other users interfere

4 6

1
3 2

34
6.14 Code Division Multiple Access (CDMA)
• Multiplexing Technique used with spread spectrum
• Start with data signal rate D
– Called bit data rate
• Break each 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>
35
6.14 Code Division Multiple Access (CDMA) …………….
CDMA Example

36
6.14 Code Division Multiple Access (CDMA) …………….
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

37
6.14 Code Division Multiple Access (CDMA) …………….
CDMA for DSSS
• n users each using different orthogonal PN
sequence
• Modulate each users data stream
– Using BPSK
• Multiply by spreading code of user

38
6.14 Code Division Multiple Access (CDMA) …………….
CDMA in a DSSS Environment

39
6.14 Code Division Multiple Access (CDMA) …………….
Seven Channel CDMA Encoding
and Decoding

40
6.15 Near/Far Problem (I)
• Performance estimates derived using assumption
that all users have same power level
• Reverse link (mobile to base) makes this
unrealistic since mobiles are moving
• Adjust power levels constantly to keep equal

k 1

41
6.16 Multipath Propagation

42
6.16 Multipath Propagation …………….
RAKE Receiver

• Received signal sampled at the rate 1/Ts> 2/Tc for detection and synchronization
• Fed to all M RAKE fingers. Interpolation/decimation unit provides a data stream
on chiprate 1/Tc
• Correlation with the complex conjugate of the spreading sequence and weighted
(maximum-ratio criterion)summation over one symbol 43
6.16 Multipath Propagation …………….

RAKE Receiver ………..

• RAKE Receiver has to estimate:
– Multipath delays
– Phase of multipath components
– Amplitude of multipath components
– Number of multipath components
• Main challenge is receiver
synchronization in fading channels
44
6.16 Multipath Propagation …………….

Practical Example: Bluetooth

• 2.4 GHz – 2.4835 GHz Operating Range
• 79 Different Radio Channels
• Hops 1600 times per second for
data/voice links
• Hops 3200 times per second for page and
inquiry scanning
• 1 Mbps = Rb for Bluetooth Ver 1.1/1.2
• 3 Mbps = Rb for Bluetooth Ver 2.1
• Gaussian Frequency Shift Keying (GFSK)45
6.17 Military spread spectrum
Military spread spectrum examples
• HAVEQUICK is a frequency-hopping system used in aircraft
radios to provide anti-jamming.
• Every radio is synchronized by a timing signal (usually GPS) and
steps through a pre-determined set of frequencies which is loaded
into the radio daily.

ARC-210 HAVEQUICK
capable radio

46
6.17 Military spread spectrum …………….
Military spread spectrum examples ……..
• SINCGARS is a VHF-FM frequency-hopping system used by
the Army, Navy, and USMC.
• SINCGARS operates on any or all of the 2,320 frequencies
between 30 and 87.975 MHz in 25 kHz increments.

47
Thank you!!
Thank You 48