Spread Spectrum Communication Systems

 
SPREAD SPECTRUM
 
 
In spread spectrum (SS), we spread a signal over a wide
bandwidth (larger than BW in traditional communication
systems)
 
-  These techniques are used for a variety of reasons, including
the establishment of secure communications, increasing
resistance to natural interference, noise and jamming
 
Direct Sequence Spread Spectrum (DSSS)
Frequency Hopping Spread Spectrum (FHSS)
Time Hopping (THSS)
Hybrid
 
Spread Spectrum systems:
Spread Spectrum systems:
 
Pseudo noise (PN) code is required in SS systems
 
Pseudo noise (PN) code symbols are called chips
Chip rate or PN code rate   R
c 
 >> R
original signal
 
T
h
e
o
r
e
t
i
c
a
l
 
J
u
s
t
i
f
i
c
a
t
i
o
n
 
Shannon and Hartely channel capacity theorem
C=B log
2
(1+S/N)
S/N is low for SS systems, so roughly
C/B ≈ 1.433  * S/N
or      N/S ≈  B/C
 
To send error-free information for a given N/S in a
channel, one need only perform the fundamental
signal-spreading operation: increase B.
 
D
r
.
 
S
a
m
a
h
 
A
.
 
M
u
s
t
a
f
a
 
Direct Sequence Spread Spectrum DSSS
 
DSSS phase-modulates the original signal with a continuous string of
pseudonoise (PN) code symbols, each of which has a much shorter
duration than an information bit.
 
DSSS example
 
G
e
n
e
r
a
l
 
M
o
d
e
l
 
o
f
 
S
p
r
e
a
d
 
S
p
e
c
t
r
u
m
S
y
s
t
e
m
 
 Receiver uses same sequence to demodulate signal
 
D
S
S
S
 
E
x
a
m
p
l
e
 
DSSS Receiver
 
D
S
S
S
 
T
r
a
n
s
m
i
t
t
e
r
 
D
S
S
S
 
U
s
i
n
g
 
B
P
S
K
 
E
x
a
m
p
l
e
 
R
F
 
b
a
n
d
w
i
d
t
h
 
o
f
 
D
S
S
S
 
 
 
 
 
 
 
Power distribution {(sinx)/x}
2  
…………..
Null-to-null bandwidth is 2R
c
90% of the power in the main-lobe
Other modulations like QPSK , MFSK …………….
 
D
r
.
 
S
a
m
a
h
 
A
.
 
M
u
s
t
a
f
a
 
G
a
i
n
s
 
Immunity from various noise and multipath
distortion
Including 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 multiple access (CDMA)
 
Process Gain, typically 10-60 dB
 
                                  G
P
 
 
D
r
.
 
S
a
m
a
h
 
A
.
 
M
u
s
t
a
f
a
 
Benefits:
Resistance to Interference and Anti-jamming Effects
 
M
o
r
e
 
b
e
n
e
f
i
t
s
 
Resistance to Interception
 
 
 
 
 
Resistance to Fading
 
 
 
Addressing
High resolution ranging
Multi access technique CDMA
 
D
r
.
 
S
a
m
a
h
 
A
.
 
M
u
s
t
a
f
a
 
C
o
d
e
 
D
i
v
i
s
i
o
n
 
M
u
l
t
i
p
l
e
 
A
c
c
e
s
s
 
(
C
D
M
A
)
 
Multiplexing Technique used with spread spectrum
It plays a critical role in building efficient, robust, and secure radio
communication systems
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>
 
C
D
M
A
 
E
x
a
m
p
l
e
 
C
D
M
A
 
E
x
p
l
a
n
a
t
i
o
n
 
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
 
C
D
M
A
 
f
o
r
 
D
S
S
S
 
n users each using different orthogonal PN
sequence
Modulate each users data stream
Using BPSK
Multiply by spreading code of user
 
C
D
M
A
 
i
n
 
a
 
D
S
S
S
 
E
n
v
i
r
o
n
m
e
n
t
 
F
r
e
q
u
e
n
c
y
 
H
o
p
p
i
n
g
 
S
p
r
e
a
d
 
S
p
e
c
t
r
u
m
(
F
H
S
S
)
 
Signal broadcast over series of frequencies
Receiver hops between frequencies in sync
with transmitter
Eavesdroppers hear unintelligible blips
Jamming on one frequency affects only a few
bits
 
B
a
s
i
c
 
O
p
e
r
a
t
i
o
n
 
Typically 2
k
 carriers frequencies forming 2
k
channels
Channel spacing corresponds with bandwidth
of input
Each channel used for fixed interval
Ex. 300 ms in IEEE 802.11
 
F
r
e
q
u
e
n
c
y
 
H
o
p
p
i
n
g
 
E
x
a
m
p
l
e
 
Frequency hopping spread spectrum (FHSS)
 
Frequency selection in FHSS
 
FHSS cycles
 
Bandwidth sharing
Slide Note
Embed
Share

Spread spectrum techniques involve spreading a signal over a wide bandwidth for various reasons, such as secure communication, resistance to interference, noise, and jamming. This summary introduces Direct Sequence Spread Spectrum (DSSS), Frequency Hopping Spread Spectrum (FHSS), Time Hopping, and hybrid systems. Pseudo noise (PN) code, Shannon and Hartely channel capacity theorem, and the use of PN code symbols are discussed with illustrations of DSSS phases, a general model of spread spectrum systems, and RF bandwidth characteristics. Practical examples and explanations of DSSS implementation are provided for better understanding.

  • Spread Spectrum
  • Direct Sequence Spread Spectrum
  • Frequency Hopping Spread Spectrum
  • Pseudo Noise Code
  • Communication Systems

Uploaded on Jul 22, 2024 | 1 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

E N D

Presentation Transcript


  1. SPREAD SPECTRUM In spread spectrum (SS), we spread a signal over a wide bandwidth (larger than BW in traditional communication systems) - These techniques are used for a variety of reasons, including the establishment of secure communications, increasing resistance to natural interference, noise and jamming Spread Spectrum systems: Direct Sequence Spread Spectrum (DSSS) Frequency Hopping Spread Spectrum (FHSS) Time Hopping (THSS) Hybrid

  2. Pseudo noise (PN) code is required in SS systems Pseudo noise (PN) code symbols are called chips Chip rate or PN code rate Rc >> Roriginal signal

  3. Theoretical Justification Shannon and Hartely channel capacity theorem C=B log2(1+S/N) S/N is low for SS systems, so roughly C/B 1.433 * S/N or N/S B/C To send error-free information for a given N/S in a channel, one need only perform the fundamental signal-spreading operation: increase B. Dr. Samah A. Mustafa

  4. Direct Sequence Spread Spectrum DSSS DSSS phase-modulates the original signal with a continuous string of pseudonoise (PN) code symbols, each of which has a much shorter duration than an information bit.

  5. DSSS example

  6. General Model of Spread Spectrum System Receiver uses same sequence to demodulate signal

  7. DSSS Example

  8. DSSS Transmitter DSSS Receiver

  9. DSSS Using BPSK Example

  10. RF bandwidth of DSSS Power distribution {(sinx)/x}2 .. Null-to-null bandwidth is 2Rc 90% of the power in the main-lobe Other modulations like QPSK , MFSK . Dr. Samah A. Mustafa

  11. Gains Immunity from various noise and multipath distortion Including 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 multiple access (CDMA)

  12. Process Gain, typically 10-60 dB GP Benefits: Resistance to Interference and Anti-jamming Effects Dr. Samah A. Mustafa

  13. More benefits Resistance to Interception Resistance to Fading Addressing High resolution ranging Multi access technique CDMA Dr. Samah A. Mustafa

  14. Code Division Multiple Access (CDMA) Multiplexing Technique used with spread spectrum It plays a critical role in building efficient, robust, and secure radio communication systems 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>

  15. CDMA Example

  16. 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

  17. CDMA for DSSS n users each using different orthogonal PN sequence Modulate each users data stream Using BPSK Multiply by spreading code of user

  18. CDMA in a DSSS Environment

  19. Frequency Hopping Spread Spectrum (FHSS) Signal broadcast over series of frequencies Receiver hops between frequencies in sync with transmitter Eavesdroppers hear unintelligible blips Jamming on one frequency affects only a few bits

  20. Basic Operation Typically 2k carriers frequencies forming 2k channels Channel spacing corresponds with bandwidth of input Each channel used for fixed interval Ex. 300 ms in IEEE 802.11

  21. Frequency Hopping Example

  22. Frequency hopping spread spectrum (FHSS)

  23. Frequency selection in FHSS

  24. FHSS cycles

  25. Bandwidth sharing

Related


More Related Content

giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#giItT1WQy@!-/#