SPREAD SPECTRUM SYSTEM

Spread Spectrum
The spread spectrum technique was developed initially for military and intelligence requirements. The essential idea is to spread the information signal over a wider bandwidth to make jamming and interception more difficult. In our project, we will look some spread spectrum techniques and multiple access technique based on spread spectrum.

Outline

1. Concept of Spread Spectrum 2. Direct sequence Spread Spectrum 3. Generation of spreading sequences 4. Code Division Multiple Access 5. Special hardware applications

Concept of Spread Spectrum

General model of spread spectrum digital Analog signal with To increase communication system. the a relatively narrow
bandwidth of the bandwidth signal

Concept of Spread Spectrum

Input is fed into a channel encoder
Produce an analog signal with a relatively narrow bandwidth around some center frequency.

Further modulated using a sequence of digits known as a spreading code or spreading sequence.
The spreading code is generated by a pseudonoise, or pseudorandom number generator. The effect of this modulation is to increase significantly the bandwidth (spread the spectrum) of the signal to be transmitted.

At the receiver, the same digit sequence is used to demodulate the spread spectrum signal. The signal is fed into a channel decoder to recover the data.

Concept of Spread Spectrum

Properties of spread spectrum:
Gain immunity from various kinds of noise and multipath distortion Can be used for hiding and encrypting signals. Only a recipient who knows the spreading code can recover the encoded information. Several users can independently use the same higher bandwidth with very little interference (CDMA).

Outline

1. Concept of Spread Spectrum 2. Direct sequence Spread Spectrum 3. Generation of spreading sequences 4. Code Division Multiple Access 5. Special hardware applications

Direct Sequence Spread Spectrum

DSSS Using BPSK DSSS Performance

DSSS Using BPSK

Direct Sequence Spread Spectrum DSSS
Each bit in the original signal is represented by multiple bits in the transmitted signal, using a spreading code. The spreading code spreads the signal across a wider frequency band in direct proportion to the number of bits used. A 15-bit spreading code spreads the signal across a frequency band that is 15 times greater than a 1-bit spreading code.

DSSS Using BPSK

One technique with DSSS is to combine the digital information stream with the spreading code bit stream using an exclusive-OR (XOR). The XOR obeys the following rules:

0 0 0 11 0 0 1 1 1 0 1

DSSS Using BPSK

DSSS Using BPSK

A BPSK signal can be expressed as:
BPSK eBPSK s (t ) A cos(2f c t ) where s (t ) is bipolar NRZ signal 1 binary 1 s(t) 1 binary 0

To produce the DSSS signal, we multiply the above by c(t), which is the PN sequence taking on values of +1 and -1.

eDSSS As (t )c(t ) cos(2f c t )

DSSS Using BPSK

At the receiver, the incoming signal is multiplied by c(t). Because c(t)c(t)=1, the original signal is recovered:

eDSSS c(t ) As (t )c(t ) cos(2f c t )c(t ) eBPSK

Implementation of DSSS Using BPSK

Transmitter using the second interpretation:

Implementation of DSSS Using BPSK

Receiver using the second interpretation:

DSSS Using BPSK

[Example]

Direct Sequence Spread Spectrum

DSSS Using BPSK DSSS Performance

DSSS Performance
The information signal has a bit width of T, which is equivalent to a data rate of 1/T. the spectrum of the signal depending on the encoding technique, is roughly 2/T. Similarly, the spectrum of the PN signal is 2/Tc. The amount of spreading that is achieved is a direct result of the data rate of the PN stream.

DSSS Performance
>

Outline

1. Concept of Spread Spectrum 2. Direct sequence Spread Spectrum 3. Generation of spreading sequences 4. Code Division Multiple Access 5. Special hardware applications

Generation of Spreading Sequences

PN Sequences
PN Properties

LFSR implementation
M-Sequences Properties

PN Sequences
Ideal spreading sequence would be a random sequence of binary ones and zeros. It is required that transmitter and receiver must have a copy of the random bit stream. A predictable way is needed to generate the same bit stream at the transmitter and receiver and also retain the desirable properties of a random bit stream. A PN generator can meet this requirement.

PN Sequences
A PN generator will produce a periodic sequence that eventually repeats but that appears to be random. PN properties:
Randomness Unpredictability orthogonality

Generation of Spreading Sequences

PN Sequences
PN Properties

LFSR implementation
M-Sequences Properties

LFSR implementation
The circuit of the LFSR (linear feedback shift register) is implemented as follows:
The LFSR contains n bits. There are from 1 to (n-1) XOR gates.

Output of n-bit LFSR:

Is periodic with maximum period N=2n-1. All-zeros sequence is forbidden.

LFSR implementation
An actual implementation would not have the multiple circuits; instead, for Ai=0, the corresponding XOR circuit is eliminated. [Example] A 4-bit LFSR:
B3 B0 B1

Generation of Spreading Sequences

PN Sequences
PN Properties

LFSR implementation
M-Sequences Properties

M-Sequences
M-sequences have several properties that make them attractive for spread spectrum applications:
Property 1. m-sequence has a number of ones that is one greater than that of zeroes: 1110100 Property 2. If we slide a window of length n along the output sequence for N shifts (where N=2n-1), each n-tuple appears exactly once. 1 1 1 0 1 0 0 1 1 1 0 1 0 111, 110, 101, 010, 100, 001, 011

M-Sequences
Property 3. There is one run of ones of length n and one run of zeros of length n-1. Example: When n=4, N=15, 0 0 0 1 0 0 1 1 0 1 0 1 1 1 1
1 run of 1s of length 4 1 run of 0s of length 3

M-Sequences
Note that the receiver and the transmitter must be synchronized so that they can detect the PN code sequence and then recover the data correctly. Its circuit is implemented at the level of the receiver by:

Outline

1. Concept of Spread Spectrum 2. Direct sequence Spread Spectrum 3. Generation of spreading sequences 4. Code Division Multiple Access 5. Special hardware applications

Code Division Multiple Access

CDMA is multiple access scheme that allows many users to share the same bandwidth
3G (WCDMA), IS-95

Basic Principles of CDMA

Each user is assigned a unique spreading code The processing gain protects the useful signal and reduces interference between the different users

Code Division Multiple Access

CDMA for DSSS

Look at CDMA from the viewpoint of a DSSS system using BPSK.

Code Division Multiple Access

A simple example with k=6 chips/bit. It is simpler to characterize a code as a sequence of 1s and -1s.

CDMA Example

CDMA for DSSS

the unwanted signal energy remains spread over a large bandwidth and the wanted signal is concentrated in a narrow bandwidth. The bandpass filter at the demodulator can therefore recover the desired signal.

Outline

1. Concept of Spread Spectrum 2. Direct sequence Spread Spectrum 3. Generation of spreading sequences 4. Code Division Multiple Access 5. Special hardware applications

DSSS modulator

DSSS demodulator

results