Spread Spectrum: Wireless Networks Spring 2005

Spread Spectrum
Wireless
Spread Spectrum
Input is fed into a channel encoder
o Produces analog signal with narrow bandwidth
Signal is further modulated using sequence of digits

o Spreading code or spreading sequence
o Generated by pseudonoise, or pseudo-random number generator
Effect of modulation is to increase bandwidth of signal to be

transmitted
Wireless
Spread Spectrum
On receiving end, digit sequence is used to demodulate the
spread spectrum signal
Signal is fed into a channel decoder to recover data
Wireless
Spread Spectrum
Wireless
Spread Spectrum
What can be gained from apparent waste of spectrum?
o Immunity from various kinds of noise and multipath
distortion
o Can be used for hiding and encrypting signals
o Several users can independently use the same higher
bandwidth with very little interference
Wireless
Frequency Hoping Spread Spectrum

(FHSS)
Signal is broadcast over seemingly random series of radio

frequencies
o A number of channels allocated for the FH signal
o Width of each channel corresponds to bandwidth of input signal
Signal hops from frequency to frequency at fixed intervals

o Transmitter operates in one channel at a time
o Bits are transmitted using some encoding scheme
o At each successive interval, a new carrier frequency is selected
Wireless

Channel sequence dictated by spreading code
Receiver, hopping between frequencies in synchronization with
transmitter, picks up message
Advantages
o Eavesdroppers hear only unintelligible blips
o Attempts to jam signal on one frequency succeed only at knocking out a
few bits
Wireless
Wireless
FHSS Using MFSK

MFSK signal is translated to a new frequency every Tc seconds
by modulating the MFSK signal with the FHSS carrier signal
For data rate of R:
o duration of a bit: T = 1/R seconds
o duration of signal element: Ts = LT seconds
Tc Ts - slow-frequency-hop spread spectrum

Tc < Ts - fast-frequency-hop spread spectrum
Wireless
FHSS Performance Considerations

Large number of frequencies used
Results in a system that is quite resistant to jamming
o Jammer must jam all frequencies
o With fixed power, this reduces the jamming power in any
one frequency band
Wireless
Direct Sequence Spread Spectrum (DSSS)

Each bit in original signal is represented by multiple bits in the
transmitted signal
Spreading code spreads signal across a wider frequency band
o Spread is in direct proportion to number of bits used
One technique combines digital information stream with the

spreading code bit stream using exclusive-OR
Wireless
Direct Sequence Spread Spectrum (DSSS)
DSSS Using BPSK

Multiply BPSK signal,
sd(t) = A d(t) cos(2 fct)
by c(t) [takes values +1, -1] to get

s(t) = A d(t)c(t) cos(2 fct)
A = amplitude of signal
fc = carrier frequency
d(t) = discrete function [+1, -1]
At receiver, incoming signal multiplied by c(t)

o Since, c(t) x c(t) = 1, incoming signal is recovered
Wireless
Code-Division Multiple Access (CDMA)

Basic Principles of CDMA
o D = rate of data signal
o Break each bit into k chips
Chips are a user-specific fixed pattern
o Chip data rate of new channel = kD
Wireless
CDMA Example
If k=6 and code is a sequence of 1s and -1s
o For a 1 bit, A sends code as chip pattern
<c1, c2, c3, c4, c5, c6>
o For a 0 bit, A sends complement of code

<-c1, -c2, -c3, -c4, -c5, -c6>
Receiver knows senders code and performs electronic decode

function
Su d = d1 c1 + d 2 c 2 + d 3 c3 + d 4 c 4 + d 5 c5 + d 6 c6
o <d1, d2, d3, d4, d5, d6> = received chip pattern

o <c1, c2, c3, c4, c5, c6> = senders code
Wireless
CDMA Example
User A code = <1, 1, 1, 1, 1, 1>
o To send a 1 bit = <1, 1, 1, 1, 1, 1>
o To send a 0 bit = <1, 1, 1, 1, 1, 1>
User B code = <1, 1, 1, 1, 1, 1>

o To send a 1 bit = <1, 1, 1, 1, 1, 1>
Receiver receiving with As code

o (As code) x (received chip pattern)
User A 1 bit: 6 -> 1
User A 0 bit: -6 -> 0
User B 1 bit: 0 -> unwanted signal ignored
Wireless
CDMA for Direct Sequence Spread

Spectrum
Categories of Spreading Sequences

Spreading Sequence Categories
o PN sequences
o Orthogonal codes
For FHSS systems

o PN sequences most common
For DSSS systems not employing CDMA

o PN sequences most common
For DSSS CDMA systems

o PN sequences
o Orthogonal codes
Wireless
PN Sequences
PN generator produces periodic sequence that appears to be
random
PN Sequences
o Generated by an algorithm using initial seed
o Sequence isnt statistically random but will pass many test of
randomness
o Sequences referred to as pseudorandom numbers or pseudonoise
sequences
o Unless algorithm and seed are known, the sequence is impractical to
predict
Wireless
Important PN Properties
Randomness
o Uniform distribution
Balance property
Run property
o Independence
o Correlation property
Unpredictability
Wireless
Linear Feedback Shift Register

Implementation
Wireless
Properties of M-Sequences
Property 1:
o Has 2n-1 ones and 2n-1-1 zeros
Property 2:
o For a window of length n slid along output for N (=2n-1) shifts, each
n-tuple appears once, except for the all zeros sequence
Property 3:
o
o
o
o
o
Sequence contains one run of ones, length n

One run of zeros, length n-1
One run of ones and one run of zeros, length n-2
Two runs of ones and two runs of zeros, length n-3
2n-3 runs of ones and 2n-3 runs of zeros, length 1
Wireless
Properties of M-Sequences
Property 4:
o The periodic autocorrelation of a 1 m-sequence is
= 0, N, 2N, ...
1
R( ) = 1
otherwise
Wireless
Definitions
Correlation
o The concept of determining how much similarity one set of data has
with another
o Range between 1 and 1
1 The second sequence matches the first sequence
0 There is no relation at all between the two sequences
-1 The two sequences are mirror images
Cross correlation
o The comparison between two sequences from different sources rather
than a shifted copy of a sequence with itself
Wireless
Advantages of Cross Correlation

The cross correlation between an m-sequence and noise is low
o This property is useful to the receiver in filtering out noise
The cross correlation between two different m-sequences is

low
o This property is useful for CDMA applications
o Enables a receiver to discriminate among spread spectrum signals
generated by different m-sequences
Wireless
Gold Sequences
Gold sequences constructed by the XOR of two m-sequences
with the same clocking
Codes have well-defined cross correlation properties
Only simple circuitry needed to generate large number of
unique codes
In following example (Figure 7.16a) two shift registers
generate the two m-sequences and these are then bitwise
XORed
Wireless
Gold Sequences
Wireless
Orthogonal Codes
Orthogonal codes
o All pairwise cross correlations are zero
o Fixed- and variable-length codes used in CDMA systems
o For CDMA application, each mobile user uses one sequence in the set
as a spreading code
Provides zero cross correlation among all users
Types
o Walsh codes
o Variable-Length Orthogonal codes
Wireless
Walsh Codes
Set of Walsh codes of length n consists of the n rows of
an n n Walsh matrix:
o W1 = (0)
2n
W
n
=
W
n
Wn
Wn
n = dimension of the matrix
o Every row is orthogonal to every other row and to the logical

not of every other row
o
Requires
tight synchronization
Cross correlation between different shifts of Walsh sequences is

not zero
Wireless
Typical Multiple Spreading Approach

Spread data rate by an orthogonal code
(channelization code)
o Provides mutual orthogonality among all users in the same
cell
Further spread result by a PN sequence (scrambling

code)
o Provides mutual randomness (low cross correlation)
between users in different cells
Wireless

Spread Spectrum: Wireless Networks Spring 2005

Uploaded by

Copyright:

Available Formats

Spread Spectrum: Wireless Networks Spring 2005

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Spread Spectrum: Wireless Networks Spring 2005

Uploaded by

Copyright:

Available Formats

Spread Spectrum

Signal is further modulated using sequence of digits

Effect of modulation is to increase bandwidth of signal to be

Frequency Hoping Spread Spectrum

Signal is broadcast over seemingly random series of radio

Signal hops from frequency to frequency at fixed intervals

Frequency Hoping Spread Spectrum

Frequency Hoping Spread Spectrum

FHSS Using MFSK

Tc Ts - slow-frequency-hop spread spectrum

FHSS Performance Considerations

Direct Sequence Spread Spectrum (DSSS)

One technique combines digital information stream with the

Direct Sequence Spread Spectrum (DSSS)

DSSS Using BPSK

by c(t) [takes values +1, -1] to get

At receiver, incoming signal multiplied by c(t)

Code-Division Multiple Access (CDMA)

o Chip data rate of new channel = kD

o For a 0 bit, A sends complement of code

Receiver knows senders code and performs electronic decode

o <d1, d2, d3, d4, d5, d6> = received chip pattern

User B code = <1, 1, 1, 1, 1, 1>

Receiver receiving with As code

CDMA for Direct Sequence Spread

Categories of Spreading Sequences

For FHSS systems

For DSSS systems not employing CDMA

For DSSS CDMA systems

Linear Feedback Shift Register

Sequence contains one run of ones, length n

Advantages of Cross Correlation

The cross correlation between two different m-sequences is

n = dimension of the matrix

o Every row is orthogonal to every other row and to the logical

Cross correlation between different shifts of Walsh sequences is

Typical Multiple Spreading Approach

Further spread result by a PN sequence (scrambling

You might also like