Scribd
Upload
34 views27 pages

Prepared By:: Live On Top

CDMA uses codes to allow multiple users to communicate simultaneously over the same frequency band. It spreads user signals across the available bandwidth through multiplication with pseudorandom codes. This allows individual signals to be recovered at the receiver through correlation with the same code. Key aspects of CDMA include processing gain, orthogonal Walsh codes to distinguish forward link signals, long and short PN codes to distinguish sectors and users, and coding processes where signals are spread and transmitted over the forward link channels.

Uploaded by

Ahmed Gamal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
34 views27 pages

Prepared By:: Live On Top

CDMA uses codes to allow multiple users to communicate simultaneously over the same frequency band. It spreads user signals across the available bandwidth through multiplication with pseudorandom codes. This allows individual signals to be recovered at the receiver through correlation with the same code. Key aspects of CDMA include processing gain, orthogonal Walsh codes to distinguish forward link signals, long and short PN codes to distinguish sectors and users, and coding processes where signals are spread and transmitted over the forward link channels.

Uploaded by

Ahmed Gamal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 27

Prepared by:

Live on Top

Course Outlines

Introduction to mobile communication


CDMA principles
Transmission problems
CDMA network architecture
CDMA network interfaces
CDMA air interface
CDMA key technologies
CDMA Traffic Cases

Multiple Access Technologies

Code

CDMA

Time
Based on codes, all users obtain traffic
channels at the same time and on the same
frequency band, for example, WCDMA and
CDMA2000

User3
User2
User1

Time

TDMA

Frequency
User 3
User 2
User 1

Time

FDMA

Traffic channels at different points of time


are allocated to different users, for example,
DAMPS and GSM

Frequency

User 1 User 2 User 3

Frequency

Traffic channels on different frequency bands are


allocated to different users,for example, AMPS and
TACS

Advantages of CDMA
Advantages of CDMA
The coverage radius is 2 times of standard
GSM.
Coverage of 1000 km2: GSM needs 200
BTS's, while CDMA requires only 50.
Under the same coverage conditions, the
number of BTS 's is greatly decreased

Simple Network Planning

CDMA: N=1
Frequency reuse

GSM: N=4
2
4
3
4

Frequency reuse

3
4

3
4

1
2

2
1

1
3

1
1

1
1

1
1

1
1

1
1

1
1

1
1

Simple project design &


convenient capacity expansion

1
1

Green Handset

Low
Lowtransmission
transmissionpower:
power:
Accurate
Accuratepower
powercontrol,
control,handoff
handoff
control,
control,voice
voiceactivation
activation

High Quality Voice(1)

Voice quality

64k
PCM

8k
present
GSM CDMA

13k 8k EVRC
CDMA CDMA

CDMA principles

CDMA principles

CDMA principles

CDMA Principals

The core idea that makes CDMA possible was first explained by Claude
Shannon, a Bell Labs research mathematician

Shannon's work relates amount of information carried, channel


bandwidth, signal-to-noise-ratio, and detection error probability

It shows the theoretical upper limit attainable

In 1948 Claude Shannon published his landmark paper on information


theory, A Mathematical Theory of Communication.

He observed that "the fundamental problem of communication is that


of reproducing at one point either exactly or approximately a message
selected at another point." His paper so clearly established the
foundations of information theory that his framework and terminology are
standard today.

CDMA Principals

SHANNONS CAPACITY EQUATION

C = Bw log2 [ 1 + S/N ]

Bw = bandwidth of the signal in Hertz


C = channel capacity in bits/second
S = signal power
N = noise power

Spread Spectrum
By a small amount of analysis in Shannon equation we can see that the:
bandwidth of the signal (Bw) is inversely proportional to the signal power
Sf

Sf

information
information

f0
The spectrum before spreading

f0

The spectrum after spreading

This result can be used to serve more than one user by the same frequency in the
same time by generating a new dimension to discriminate between the different
users and make the spreading process
So, the question is how to make the spreading process

Two Types of Spread Spectrum

Direct Sequence

narrowband input from a user is coded (spread) by a user-unique


broadband code, then transmitted
broadband signal is received; receiver knows, applies users code, recovers
users data
Direct Sequence Spread Spectrum (DSSS) CDMA IS the method used in
IS-95 commercial systems

DSSS Spreading: Time-Domain View

At Originating Site:
Input A: Users Data @ 19,200 bits/second
Input B: Walsh Code #23@ 1.2288 Mcps
Output: Spread spectrum signal

via air interface


At Destination Site:
Input A: Received spread spectrum signal
Input B: Walsh Code #23 @ 1.2288 Mcps
Output: Users Data @ 19,200 bits/second
just as originally sent

DSSS Spreading: Frequency-Domain View

The improvement of

Sf

Sf

time-domain

information

information

information rate means


that the bandwidth of

f0

f0

The spectrum before spreading

The spectrum after spreading

spectrum-domain
information is spread.

Sf

Sf

information
information

Interference noise

f0

The spectrum before despreading


information

pulse interference

The Y-coordinate is energy density.

Interference noise

f0

The spectrum after despreading


White noise

Spread Spectrum

Processing Gain (CDMA Spreading Gain)

Processing gain is the ratio of a spreading rate to a data rate.


Consider a user with a 9600 bps vocoder talking on a CDMA signal
1,228,800 Hz wide.
So, the processing gain is 1,228,800/9600 = 128.
The processing gain in IS-95 system is 128, about 21dB.
The processing gain is calculated as follows:
10 x log10128 = 21db

Spread Spectrum
Principle of Using Multiple Codes
Using several multiple codes improves the system because they are independent

ORIGINATING SITE
X+A

DESTINATION

Spread-Spectrum Chip Streams


X+A+B

X+A+B+C

X+A+B

X+A

Input
Data

Recovered
Data

Spreading Spreading Spreading


Sequence Sequence Sequence

Spreading Spreading Spreading


Sequence Sequence Sequence

Advantages of Spread Spectrum

Give the ability of multiple access

Avoid interference arising from jamming signal or multi-path effects.

Covert operation:Difficult to detect

Achieve Privacy: Difficult to demodulate, (Noise like signal.)

Impossible to Eavesdrops on the signal expect using the same code

Definitions

Forward link: the direction from a base station to a mobile station


Reverse link: the direction from a mobile station to a base station

CDMA CHANNEL
CDMA
Reverse
Channel 1.25 MHz

CDMA
Forward
Channel 1.25 MHz

45 or 80 MHz

CDMA channel: Code Channels are characterized (made unique) by


mathematical codes (stream of 1s and 0s)

Walsh Code

64 Sequences, each 64 chips long

Each Walsh Code is Orthogonal to all other Walsh Codes

In forward direction, each symbol is spread with Walsh code


Walsh code is used to distinguish the user in forward link
For IS95A/B, in the reverse, every 6 symbols correspond to one Walsh
code.
For example, if the symbol input is 110011,the output after spreading is
W5164 (110011=51).
For CDMA2000, in the reverse, Walsh function is used to define the type
of channel

A chip is a binary digit (0 or 1)

This means that it is possible to recognize and therefore


extract a particular Walsh code from a mixture of other
Walsh codes which are filtered out in the process

Walsh Code

How to generate Walsh code?

Walsh code

W 2n=

Wn Wn
Wn Wn

W 1=0
W 2=

0
0
W 4=
0
0

0
1
0
1

0
0
1
1

0
1
1
0

Its simple to generate the codes, or theyre small enough to use from ROM

W m represents ith (row) Walsh function of length m.


i

For example, W

4
2

is 0101 in the Matrix W4

Walsh Code

Two same-length binary strings are orthogonal if the result of XORing them has
the same number of 0s as 1s

M- sequence

In CDMA system, user information is encrypted by means of scrambling. The


scramble code used here is M-sequence.
Shown in the figure is an M-sequence generator made up of a shifting register
sequence with certain feed bake.
The period of the output sequence is 2N-1 (N being the number of shifting
registers). That is to say, the shifting register sequence resumes to the initial
status when every 2N-1 pieces of codes are output.

Short code

The short code is a binary M-sequence with 15 shift register.

Short code is PN sequence with period of 215 - 1 chips

Sequence with different time offsets are used to distinguish


different sectors

Minimum PN sequence offset used is 64 chips, that is to say, 512 PN offsets are
available to identify the CDMA sectors (215 /64=512).

the two sequences scramble the information on the I and Q phase channels

PNc
PNb
PNa

Long code

The long code is a PN sequence with a period of 242-1 chips


Each mobile station uses a unique User Long Code Sequence generated by:

Each clock pulse drives the Long Code State Register to its next state

The output bits are the Long Code, but shifted to the users unique offset
Generated at 1.2288 Mcps, this sequence requires 41 days, 10 hours, 12 minutes and 19.4
seconds to complete.

Long Code State Register makes long code at system reference timing, to
the 42-bit
A Mask Register holds a user-specific unique pattern of bits (32-bit
ESN+10-bit for operator)
State register and Mask register contents are added in the Summer
Summer contents are modulo-2 added to produce just a single bit output

Coding Process on CDMA Forward Channels

Pilot

Walsh 0

Paging

Walsh 1

BTS

Walsh 6

BTS

PN OFFSET 116

Walsh 11
Walsh 19
Walsh 20
Sync

Walsh 32

PN OFFSET

ANALOG
PN OFFSET 372

SUM/MUX

Walsh 37

PN
372

Walsh 41
Walsh 42

x
BTS

PN OFFSET 226

Walsh 55

Walsh 56
Walsh 60

BTS

PN OFFSET 510

WALSH
19

You might also like