Tutorial 1

Direct Sequence Spread

Spectrum & CDMA

Mohd Faisal Ibrahim

Faculty of Computer and Mathematical Sciences, UiTM
UiTM,, Shah Alam

Objectives

After completing this tutorial, you will be able to:

1. Explain the direct sequence spread spectrum signals
2. Discuss how a spread spectrum works.
3. Explain how CDMA works.

1
Spread Spectrum

The term spread spectrum describes a modulation technique that makes

the sacrifice of bandwidth in order to gain signal-to-noise (S/N)
performance.
The transmitted signal is spread over a frequency much wider than the
minimum bandwidth required to send the signal.
Increasing the transmitted signal bandwidth results in an increased
probability that the received information will be correct.
Spread signals are intentionally made to be much wider-band than the
information they are carrying to make them more noise-like.
Because spread spectrum signals are noise-like, they are:
hard to detect.
hard to intercept or demodulate.
hard to jam (interfere with) than narrow-band signals.

Spread Spectrum (Continued)

Spread-spectrum signals use fast codes that run many times the information
bandwidth or data rate.
These special spreading codes are called pseudo random or pseudo noise
codes.
They are called pseudo because they are not real Gaussian noise.
The use of special pseudo-noise codes in spread-spectrum communications makes
signals appear wide-band and noise-like.
It is this very characteristic that makes spread-spectrum signals possess the quality
of low probability of intercept.
Because spread-spectrum signals are P three radio bands for transmission
under 1 Watt of power:
very wide, they transmit at a much o
902-928 MHz
w 2400-2483.5 MHz
lower spectral power density, e & 5752.5-5850 MHz
measured in watts per hertz, than r
narrow-band transmitters.

2
How Spread Spectrum Works

A DSSS transmitter converts an incoming data (bit) stream into a

symbol stream where each symbol represents s group of one or
more bits.

How Spread Spectrum Works - Transmitter

Using a Binary Phase-Shift Keying (BPSK), the DSSS transmitter modulates

or spreads code bit stream using an exclusive-OR (XOR) with a noise-like
code called pseudorandum noise (PN) sequence (also known as a chip
sequence).

NOTE: In this example we use 4 bits Chip Sequence

3
How Spread Spectrum Works - Transmitter

0000 1111 0000

0110 1001 1011
------ ------ ------ ------ ------ ------ ------ ------
0110 0110 1011

How Spread Spectrum Works - Transmitter

The multiplication operation in a DSSS transmitter artificially

increases the used bandwidth based on the length of the chip
sequence.

4
How Spread Spectrum Works - Receiver

How Spread Spectrum Works - Receiver

0110 0110 1011

0110 1001 1011
------ ------ ------ ------ ------ ------ ------ ------
0000 1111 0000

5
Direct Sequence Spread Spectrum

Direct Sequence Spread Spectrum

6
CDMA principle

Code Division Multiple Access (CDMA)

A multiplexing technique used with spread spectrum

Given a data signal rate D
Break each bit into k chips according to a fixed chipping code specific to
each user
Resulting new channel has chip data rate kD chips per second
Can have multiple channels superimposed
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>

7
CDMA Explanation

Consider A communicating with base

Base knows As code
Assume communication already synchronized
A wants to send a 1
Send chip pattern <1,-1,-1,1,-1,1>
As code
A wants to send 0
Send chip[ pattern <-1,1,1,-1,1,-1>
Complement of As code
Decoder ignores other sources when using As code to decode
Orthogonal codes

CDMA Explanation

Sender A NOTE: Rather than represent

binary data with 1 and 0, it is
0 = -1
1 = +1
sends Ad = 1, key Ak = 100101 (+1 -1 -1 +1 -1 +1) more convenient for our purpose
to use + 1 and - 1 to represent the
sending signal As = Ad * Ak = (+1, -1, -1, +1, -1, +1) two binary digits.

Transmit Ad (data bit = 1) 1 1 1 1 1 1

Receiver Codeword Ak 1 -1 -1 1 -1 1
Sending Signal As (Multiplication) 1 -1 -1 1 -1 1 =0

Sender A
sends Ad = 0, key Ak = 010111 (-1 +1 -1 +1 +1 +1)
sending signal As = Ad * Ak = (+1, -1, +1, -1, -1, -1)

Transmit Ad (data bit = 0) -1 -1 -1 -1 -1 -1

Receiver Codeword Ak -1 1 -1 1 1 1
Sending Signal As (Multiplication) 1 -1 1 -1 -1 -1 = -2

NOTE: Receiver Codeword = Chip Pattern

8
CDMA Example 1

Sender A
sends Ad = 1, key Ak = 010011 (-1 1 -1 -1 1 1)
sending signal As = Ad * Ak = (-1, +1, -1, -1, +1, +1)

Transmit Ad (data bit = 1) 1 1 1 1 1 1

Receiver Codeword Ak -1 1 -1 -1 1 1
Sending Signal As (Multiplication) -1 1 -1 -1 1 1 =0

Sender B
sends Bd = 0, key Bk = 110101 (1 1 -1 1 -1 1)
sending signal Bs = Bd * Bk = (-1, -1, +1, -1, +1, -1)

Transmit Bd (data bit = 0) -1 -1 -1 -1 -1 -1

Receiver Codeword Bk 1 1 -1 1 -1 1
Sending Signal Bs (Multiplication) -1 -1 1 -1 1 -1 = -2

CDMA Example 1 (Continued)

Both signals superimpose in space

interference neglected (noise etc.)
As + Bs = (-2, 0, 0, -2, +2, 0)

Signal As -1 1 -1 -1 1 1
Signal Bs -1 -1 1 -1 1 -1
As + Bs -2 0 0 -2 2 0

9
CDMA Example 1 (Continued)

Receiver wants to receive signal from sender A

apply key Ak bitwise (inner product)
Ae = (-2, 0, 0, -2, +2, 0) Ak = 2 + 0 + 0 + 2 + 2 + 0 = 6
result greater than 0, therefore, original bit was 1

Receiver Codeword Ak -1 1 -1 -1 1 1
Ae (As + Bs) -2 0 0 -2 2 0
Receiving Signal As (Multiplication) 2 0 0 2 2 0 =6

CDMA Example 1 (Continued)

Receiver wants to receive signal from sender B

apply key Ak bitwise (inner product)
Be = (-2, 0, 0, -2, +2, 0) Bk = -2 + 0 + 0 - 2 - 2 + 0 = -6
result less than 0, therefore, original bit was 0

Receiver Codeword Bk 1 1 -1 1 -1 1
Ae (As + Bs) -2 0 0 -2 2 0
Receiving Signal As (Multiplication) -2 0 0 -2 -2 0 = -6

10
CDMA on signal level I

Real systems use much longer keys resulting in a larger

distance between single code words in code space

CDMA on signal level II

11
CDMA on signal level III

CDMA on signal level IV

12
CDMA on signal level V

Assumptions
orthogonality of keys
neglectance of noise
no differences in signal level => precise power control

Past Year Question

JAN 2013 (PART B)

A CDMA receiver gets the following chips: (+1 -1 +3 -1 +1 +3 -
1 -1). Assuming the chip sequence defined as follows:
A: (-1 1 -1 -1 -1 -1 1 -1)
B: (-1 1 -1 1 1 1 -1 -1)
C: (-1 -1 1 -1 1 1 1 -1)
D: (-1 -1 -1 1 1 -1 1 1)
Which stations are transmitting and what bit was sent by each
transmitting station? Show your calculation.

13
Past Year Question

JUL 2013 (PART B)

Suppose that A, C, and D are simultaneously transmitting bits
0, 1, 0, respectively, using a CDMA system with the chip
sequences of:
A: (-1 1 -1 -1 -1 -1)
B: (-1 1 -1 1 1 1)
C: (-1 -1 1 -1 1 1)
D: (-1 -1 -1 1 1 -1)
What is the resulting Chip sequence? Show your calculation.

Thank You

14