This document provides an overview of CDMA (Code Division Multiple Access) technology. It is divided into 5 sections that cover: 1) how CDMA works using spreading codes, 2) how CDMA systems function on the forward and reverse links, 3) call processing procedures in CDMA networks, 4) data transmission over CDMA, and 5) an introduction to the Lucent BSS CDMA infrastructure components. The document uses diagrams and explanations to illustrate key CDMA concepts such as spreading codes, processing gain, orthogonal sequences, and network architecture.

1. WELCOME TO CDMA OVERVEIW
INTRODUCTION TO CDMA RADIO INTERFACE
CDMA

2. SECTION 1
CODE DIVISION MULTIPLE ACCESS
Section Introduction
•The CDMA frequency band
•Frequency Allocation in CDMA
•Understanding the DSSS
•Codes and their functions in CDMA
•Generation of Codes
•Spreading And Despreading with Codes

3. SECTION 2
HOW CDMA WORKS
LET US PUT EVERYTHING TOGETHER
Section Introduction
•Forward link Architecture
•Reverse Link Architecture
•Logical Channels on Forward Link
•Logical Channels on Reverse Link

4. SECTION 3
CALL PROCESSING IN CDMA
Section Introduction
•Mobile Initialization
•Mobile Registration
•Handoff Types
•Rake Receiver
•Power Control
•Vocoding

5. SECTION 4
INTRODUCTION TO DATA IN CDMA
Section Introduction
•DATA Layers
•Data and Quality
•FCH and SCH
•Dormant Mode
•MAC and RLP
•SARA

6. SECTION 5
INTRODUCTION TO LUCENT BSS
Section Introduction
•Lucent Cellular Network Architecture
•Application Processors
•OMP-Fx
•Modcell Components (3.0& 4.0)

9. “Shalom” “Guten Tag”
“Hello”
Û
“Time division”
“Frequency division!”
“CHAOS”
“Buenos Dias”
“Bonjour”
The SYMPHONY!

10. GSM Vs CDMA
FREQUENCY REUSE IN CDMA & TDMA
F 5
F 6 F 4
F 7 F 3
TYPICAL TDMA SYSTEM
EACH CELL USES DIFFERENT
FREQUENCY
THE PATTERN IS REPEATED
FOR THE NEXT SET OF CELL
SITES
F 1
F 1 F 1
F 1
F 1
F 1
F 1
TYPICAL CDMA SYSTEM
EACH CELL USES SAME
FREQUENCY
F 1
F 2

11. Frequency Reuse
7 cell re-use pattern
f7
f7
f2
f2
f6
f6
f1
f5 f3
f4
f1
f5 f3
f4

12. f1
f1
FREQUENCY REUSE IN in CDMA
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1 f1

13. Spread Spectrum Concept
In GSM small time slots of the spectrum (200 kHz) are used by different users as channels.
User 1
User 2
User 3
User 4
User n
Code 1
Code 2
Code 3
Code 4
Code n
1800 MHz 1850 MHz 1910 MHz 1930 MHz 1990 MHz 2000 MHz
Mobile Tx Cell Tx
Spread spectrum uses much larger slice (1.25 MHz) of the available bandwidth.
Same slice is used for all user with no time multiplexing but each user is
assigns with a different code to uniquely identify them.

14. CDMA Cellular Spectrum
846.5
MHz
825
MHz
824
MHz
835
MHz
845
MHz
849
MHz
A’’ A B A’ B’ Reverse link
891.5
MHz
870
MHz
869
MHz
880
MHz
890
MHz
894
MHz
A’’ A B A’ B’ Forward link
2 - 7

15. 850 (Cellular) CDMA Channel Frequencies
Band
Channel
Number
Sub-
Block
Modular Cell
Transmit/Mobile
Receive Frequencies
Modular Cell
Receive/Mobile Transmit
Frequencies
850 TX (MHz) 850 RX (MHz)
A’’ 1019 A” 869.88 824.88
37 A3 871.11 826.11
78 872.34 827.34
119 A2 873.57 828.57
160 874.80 829.80
201 876.03 831.02
242 A1 877.26 832.26
283
(Primary) 878.49 833.49
A
691 A’ 890.73 845.73
A’ (Secondary)
384 881.52 836.52
(Primary) B1 882.75 837.75
425
466 883.98 838.98
507 885.21 846.21
548 B2
B
589
630
886.44 841.44
887.67 842.67
B3 888.90 843.90
B’ 777 B’ 893.31 848.31
(Secondary)

16. DIRECT SEQUENCE SPREAD SPECTRUM
A System is said to be using DSSS if it follows the two basic rules mentioned
•The Bandwidth of the Carrier frequency must be much larger than the
Bandwidth of the baseband Signals to be transmitted.
•The same codes that are used for coding the signal must also be used for
decoding the signals.

17. PROCESSING GAIN

19. The Processing Gain and Capacity Relation
# USERS PROCESING GAIN (dB)
1 21 dB
2 18 dB
3 15 dB
8 12 dB
16 9 dB
32 6 dB
CDMA Spreading Gain
Consider a user with a 9600
bps Vocoder talking on a
CDMA signal 1,228,800 Hz wide.
The processing gain is
1228800/9600=128,
which is 21 db.
What happens if additional
users are added?
S/N = G/N
2 Users S/N = ___1___ = 128
1/128
3 Users S/N = ___1___ = 64
2/128
5 Users S/N = ____1___ = 32
4/128
9 Users S/N = ___1___ = 16
8/128
17 Users S/N = ____1____ = 8
16/128
Capacity Quality Related

20. CDMA’s Nested Spreading Sequences

21. “Shipping and Receiving” via CDMA

22. DSSS Spreading /Despreading
C1*C1 = 1, C2*C2 = 1…. Cn*Cn = 1 BUT C1*C2 = 0…C1*Cn =
0
U1 = 0110010101001000
*
C1 ( 100110….10110010)
= U1C1 ( 100110………………………0000)
U1C1 ( 100110………………………00000)
*
=
C1 ( 100110….10110010)
U1 = 0110010101001000
UnCn
U4C4
U3C3
U2C2
U2C2*C1 = 0, U2*C2*C2 = U2
U3C3*C1 = 0, U3C3*C3 = U3
U4C4*C1 = 0, U4C4*C4 = U4
UnCn*C1 = 0, UnCn*Cn = Un

23. The Three CDMA Spreading Techniques

24. Orthogonal Sequences
• Definition:
Orthogonal functions have zero correlation. Two binary sequences
are orthogonal if the process of “XORing” them results in an equal
number of 1’s and 0’s. EExxaammppllee::
00000000
((XOR) 00110011
------------
00110011
• GGeenneerraattiioonn SSeeqquueennccee::
- Seed
0 0
- Repeat: right & below 0 1
- Invert: diagonally
0 0
0 1
0 0
0 1
0 0
0 1
1 1
1 0

25. 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 6 6 6 6
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 0 0 0
0 1 0 1
0 0 1 1
0 1 1 0
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 ……... 0 1 2 3
0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 ………6 6 6 6
Walsh Codes

26. ORTHOGONALITY OF WALSH CODES

27. Orthogonal Spreading
11
01100110100110011001100101100110100110010110011001100110100110001100110100110011001100101100110100110010110011001100110100110011
WWaallsshh FFuunnccttiioonn ##5599
11000011110000110011110000111100001111000011110011000011110000110011110000111100110000111100001111000011110000110011110000111100
PPaatttteerrnn ttoo bbee TTrraannssmmiitttteedd

28. Orthogonal Spreading
00
00 11 11 00
00
00 11 11 00
11
00 11 11 00
11
00 11 11 00
11
00 11 11 00
11 00 00 11 00 11 11 00 00 11 11 00 11 00 00 11 11 00 00 11
++11
--11
UUsseerr DDaattaa
OOrrtthhooggoonnaall
SSeeqquueennccee
TTxx DDaattaa
++11
--11

29. Decoding Using a Correct Code
11 00 00 11 00 11 11 00 00 11 11 00 11 00 00 11 11 00 00 11
00 11 11 00
00
00 11 11 00
00
00 11 11 00
11
00 11 11 00
11
00 11 11 00
11
CCoorrrreecctt
FFuunnccttiioonn
++11
--11
RRxx DDaattaa
11 11 11 11 00 00 00 00 00 00 00 00 11 11 11 11 11 11 11 11

30. Decoding Using a Incorrect Code
11 00 00 11 00 11 11 00 00 11 11 00 11 00 00 11 11 00 00 11
00 11 00 11
??
00 11 00 11
??
00 11 00 11
??
00 11 00 11
??
00 11 00 11
??
RRxx DDaattaa
IInnccoorrrreecctt
FFuunnccttiioonn
11 11 00 00 00 00 11 11 00 00 11 11 11 11 00 00 11 11 00 00

31. Example: Spreading
++11
--11
++11
--11
++11
--11
++11
--33
SSpprreeaadd WWaavveeffoorrmm RReepprreesseennttaattiioonn ooff
UUsseerr AA’’ss ssiiggnnaall
SSpprreeaadd WWaavveeffoorrmm RReepprreesseennttaattiioonn ooff
UUsseerr BB’’ss ssiiggnnaall
SSpprreeaadd WWaavveeffoorrmm RReepprreesseennttaattiioonn ooff
UUsseerr CC’’ss ssiiggnnaall
AAnnaalloogg SSiiggnnaall FFoorrmmeedd bbyy tthhee SSuummmmaattiioonn
ooff tthhee TThhrreeee SSpprreeaadd SSiiggnnaallss
AA==0000
WWaallsshh CCooddee ffoorr
AA == 00110011
BB==1100
WWaallsshh CCooddee ffoorr
BB == 00001111
CC==1111
WWaallsshh CCooddee ffoorr
CC == 00000000

32. Despreading
RReecceeiivveedd CCoommppoossiittee SSiiggnnaall
WWaallsshh CCooddee ffoorr UUsseerr AA == 00110011
PPrroodduucctt
++11
--33
++11
--11
++33
--11
AAAAvvvveeeerrrraaaaggggeeee====((((5555----1111))))////4444====1111 AAAAvvvveeeerrrraaaaggggeeee====((((5555----1111))))////4444====1111
““““0000”””” ““““0000””””

33. Pseudorandom Noise (PN) Codes
Two Short Codes (215 = 32,768)
Termed “I” and “Q” codes (different taps )
Used for Quadrature Spreading
Unique offsets serve as identifiers for a Cell or a Sector
Repeat every 26.67 msec (at a clock rate of 1.2288Mcps)
One Long Code (242= 4400 Billion)
Used for spreading and scrambling
Repeats every 41 days (at a clock rraattee ooff 11.22228888MMccppss))

34. PN Code Generation
1 1 0
Out
• Seed Register with 001
• Output will be a 7-digit sequence that repeats
continually : 1001011

35. PN Code Generation

36. Masking
Masking will cause the generator to produce the same sequence, but
offset in time

37. MMaasskk
000011
001100
001111
110000
110011
111100
111111
Lookup Table for PN Offsets
OOffffsseett ((iinn cchhiippss))
77
66
44
55
11
33
22
TTrraannssmmiitttteedd
SSeeqquueennccee
11000011001111
00001100111111
11001111110000
00110011111100
11110000110011
00111111000011
11111100001100

38. Quadrature Spreading
0 1 1 0 1 1 1 0 0 1 0 1 1 1 1 0 1 1 1 1 0 1 1 1 0 1
To Baseband
Filter
I
Q
1 0 1 1 0 0 0 0 1 0 1 1 0
0 1 0 0 0 1 1 1 0 1 0 1 1
Symbols Spread by
Walsh Chips
0 1 1 0 1 1 1 0 0 1 0 1 1
0 1 1 0 1 1 1 0 0 1 0 1 1
0 0 1 0 1 0 0 1 0 0 0 0 0
Offset I PN Code
Offset Q PN Code

39. QPSK MODULATION USING PN-SHORT CODE

40. 100101001100111010111001010100
100101001100111010111001010100
1001010011001110101110010
Offset in
increments
of 64 chips
• Quick and Easy Cell Acquisition
• Reuse Walsh Codes
#1
#2
#3
PN Offset – Cell Identification

42. CDMA AIR INTERFACE ARCHTECTURE

43. FORWARD REVERSE LINK CODES

44. Coherent / Non-Coherent Detection

45. SECTION 2
HOW CDMA WORKS
LET US PUT EVERYTHING TOGETHER
Section Introduction
•Forward link Architecture
•Reverse Link Architecture
•Logical Channels on Forward Link
•Logical Channels on Reverse Link

46. The CDMA Physical Layer

47. Terminology:
Bit, Symbol and Chip
IInnffoorrmmaattiioonn
AA//DD
IInnffoorrmmaattiioonn BBiittss
FFEECC
CCooddee
SSyymmbboollss
MMuuxx
CCooddee
GGeenneerraattoorr SSpprreeaaddeerr
++
CChhiippss CChhiippss
PPSSKK
aadddd cchheecckk bbiittss

48. CDMA FORWARD LINK ARCHITECTURE

49. CDMA REVERSE LINK ARCHITECTURE

50. AIR INTERFACE
Control Channels
Downlink Uplink
Pilot Sync Paging Access

51. AIR INTERFACE
TRAFFIC CHANNELS
SPEECH or DATA ASSOCIATED SIGNALLING
1 1/2 1/4 1/8 Blank
Burst
Dim
Burst
Power
Control

52. FORWARD LINK CHANNELS IN CDMA-2000

53. Forward Traffic Code Channel

54. Pilot Channel
I Pilot PN sequence
1.2288 Mcps
BB
BB
All 0’s
Walsh W0
1.2288 Mcps
To QPSK
Modulator
Q Pilot PN sequence
1.2288 Mcps
26.67 ms frame period, repeated 75 times a second.
Pilot channels are kept at 4-6 dB higher then rest of the channels

55. Sync Channel - W
64
32
Needed to achieve code synchronization and
timing information.
Sync Channel Message includes :
• System Identification
• Network Identification
• Supported protocol revision levels
• Pilot PN sequence offset index
• Long code state
• System time
• Leap seconds
• Offset local time
• Daylight savings time indicator
• Page channel data rate

56. S
O
M
Sync Channel Frames
31 Information Bits
32 bits / 26.67 ms
I Pilot PN sequence
Convolutional encoder not zeroed out after each frame
No CRC bits at frame level, SOM (Start Of Message)
BB
BB
Sync Channel
Message Walsh W32
1.2288 Mcps
1.2288
Mcps
Q Pilot PN sequence
1.2288 Mcps
To QPSK
Modulator
Convolutional
Encoder
Rate=1/2, K=9
Symbol
1.2 2.4
Repetition
Kbps
Ksps
Block
Inter-19.2
leaver
Ksps
19.2
Ksps

57. 64
1-7
Page Channel - W
 Base station communicates with the mobiles during
Idle Mode.
 Page channel message includes :
• System and access parameters
• Neighbor list
• Channel list
• Page
• Order
• Channel Assignment
• Data Burst
• Authentication challenge
• SSD (Shared Secret Data) update
• Feature notification
• Null

58. I Pilot PN
1.2288 Mcps
BB
To QPSK
Modulator
BB
Paging Channel
Message
Walsh W1-7
1.2288
Mcps
Q Pilot PN
1.2288 Mcps
Convolutional
Encoder
Rate=1/2, K=9
Symbol
4.8/ 9.6/
Repetition
9.6
19.2
Kbps
Ksps
Block
Inter-19.2
leaver
Ksps
19.2
Ksps
Long Code
Decimator
Long Code
Generator
1.2288
Mcps
64:1
Long-code Mask
for
Paging Channel
Paging Channel

59. I Pilot PN
1.2288 Mcps
BB
To QPSK
Modulator
Power Control
Bits (800bps)
Walsh Wn
1.2288
Mcps
Q Pilot PN
1.2288 Mcps
Convolutional
Encoder
Rate=1/2, K=9
Symbol
Repetition
Block
Inter-leaver
19.2
Ksps
Long-code 64:1
Mask
Decimator
Long Code
Generator
1.2288
Mcps
Mux
24:1
Decimator
BB
Forward Traffic Channel

60. Reverse Link Code Channels

61. Reverse Link Code Channels
RF
Transmit/Receive
Up/Down Converter
Searcher
Four Fingers
Demodulation
Processor
Deinterleaver
Viterbi
Decoder
P/N
Sequence
Generator
Rx Data
Packets
Antenna

62. REVERSE LINK CHANNELS IN CDMA-2000

63. Reverse Link Walsh Code

64. Walsh Code Administration
 Walsh Codes have to be Orthogonal
• Walsh codes on the same “row” are Non-
Orthogonal
Reserved Walsh Codes
• F-PICH W64
0
• F-SYNC W32
64
• F-PCH W1
64
• F-TDPICH W16
128
• F-QPCH W30
128
- 2nd and 3rd F-QPCH W48
128 and W112
128
- Non-provisioned F-QPCH Walsh codes is
available for traffic
Walsh Functions Lengths

65. Access Channel
Mobile communications with base station during Idle
Mode
Access channel message includes :
• Registration
• Order
• Data Burst
• Origination
• Page response
• Authentication challenge response

66. Access Channel Frames
Long-code 1.2288 Mcps
Mask
88 Information Bits
8 Tail
Bits
20 ms
To QPSK
Modulator
• Tail Bits Zero Convolutional Encoder, No CRC Bits At Frame Level
• Preamble Comprised of Zero Filled Frames
BB
BB
Access Channel
Message
1.2288
Mcps
I Pilot PN
1.2288 Mcps
Q Pilot PN
1.2288 Mcps
Convolutional
Encoder
Rate=1/3, K=9
Symbol
4.8/ 14.4
Repetition
9.6
Ksps
Kbps
Block
Inter-28.8
leaver
Ksps
64-ary
Orthogonal
Modulator
Long Code
Generator

67. BB
To QPSK
Modulator
BB
1.2288
Mcps
I Pilot PN
1.2288 Mcps
Q Pilot PN
1.2288 Mcps
Convolutional
Encoder
Rate=1/3, K=9
Reverse Traffic Channel
Symbol
RS1/ Repetition
RS2
Block
Inter-28.8
leaver
Ksps
64-ary
Orthogonal
Modulator
Data
Burst
Randomizer
Long Code
Generator
28.8
Ksps
1.2288
4.8
Ksps
Long-code Mcps
Mask

69. Reverse Channel
All MS transmit on same frequency but with different PN
codes to create different logical channels. Some channels
marked for Access are used for signaling and control.
Access Channel 1
PNA A ccess Channel 2
PNB Access Channel n
PNX Traffic Channel 1
PNH Traffic Channel 2
PNI Traffic Channel 3
PNJ Traffic Channel m-1
PNY Traffic Channel m
PNZ

70. SECTION 3
CALL PROCESSING IN CDMA
Section Introduction
•Mobile Initialization
•Mobile Registration
•Handoff Types
•Rake Receiver
•Power Control
•Vocoding

71. Overview of Call Processing

72. MOBILE TRANSITION INTO DIFFERENT STATES
Power - up
Mobile
Initialization
State
Mobile
Idle
State
Mobile
System
Access
State
Mobile
Traffic
Channel
State
Mobile Idle
Handoff or enable
to receive Paging
Channel.
Receives acknowledgement to an
Access Channel transmission other
than Origination or Page response I.e.
registration acknowledgement.
Mobile has fully
acquired system
timing.
Receives Paging
Channel Message :
Originates a cell Registration
Directed to a
Traffic
Channel
Ends use of
Traffic Channel

73. Signaling Services Layer

74. MOBILE TRANSITION INTO THE IDLE
STATE
MOBILE SWITCHED
ON
SCAN PN OFFSET 1- 512
MEASURE PILOT SIGNAL
STRENGTH
SELECT BEST SIGNAL PN
OFF SET PILOT
READ SYNCH
CHANNEL
NO
SID/NID
O.K
YES
READ PAGIING CHANNEL MOBILE IS NOW IN IDLE MODE

75. SYSTEM DETERMINATION SUBSTATE

76. MOBILE- PILOT CHANNEL ACQUISITION
NO
SUBSTATE
1.SCAN ALL PILOTS

77. Sync Channel Acquisition Substate

78. Go to Paging Channel, Get Configured

79. Mobile Idle State
Mobile
Initialization State
Page
Channel Monitor
Pilot search
Sub state
Mobile
System Access
State
Idle Handoff complete
Idle Handoff
Sub state
Mobile unable to
receive Paging
Channel
Mobile receives
Acknowledgement to
an Access transmission
other than Origination
or Page Response.
• Call Termination
• Call Origination
• Registration
Another pilot stronger
than current pilot
Mobile has fully
acquired system
timing

80. Idle State
 System Parameters Message
 Neighbor List
 Access Parameters Message
 CDMA Channel List Message
 Global service Redirection Message

81. Slotted Mode Quick Paging Channel
 Objective
• To extend the battery life of a mobile in slotted mode by
reducing the time the mobile spends monitoring paging channels.
 Slotted Mode
• Paging channel divided into slots and slot cycles.Mobile
monitors specific slot in a slot cycle.
 F-QPCH Functionality
• Paging or configuration change indicators is sent out on the F-QPCH
100ms prior to the message on the F-PCH.
• If the mobile cannot detect an indicator to be “OFF”, the
mobile will read the F-PCH slot immediately following the F-QPCH
slot.

82. F-PCH F-QPCH Structure

83. Access Channel Protocol
 Used when mobile contact base station
• Quickly
•Avoid Interference
 Two protocols
• Message or order response access
• Request access
 Trial – and - error

84. Access Procedure

85. Access Handoff Features
Mobile (MS) searching for pilots Active-,
Neighbors-,Remaining State
Origination
No
MS perform access attempt.Up to
6 strongest pilots ind.
Active pilot in msg capsule
Access
Handoff
Mobile Traffic
Channel State
BS sends general
Page to MS
Access Entry
Handoff
Channel Assignment into
Soft Handoff (CAMSHO)
Yes

86. The Traffic Channel State
From Mobile System
Access State
Traffic
Channel
Initialization
Sub state
MS call termination MS
receives an Acknowledge
Order on forward traffic
Waiting for
Order
Sub state
Conversation
Sub state
Waiting for
Mobile
Answer
Sub state
Release
Sub state
To Mobile
Initialization State
MS cell
origination MS
receives an
Acknowledge
Order on
forward Traffic
Channel
MS user
disconnects or
MS receives
Release Order
MS receives an
Alert Order
MS receives
Release Order
MS user
Answers
call
channel
MS receives
Release Order

87. Traffic Channel Assignment Algorithm
Access seizure received on carrier
frequency Fk
Calculate downlink loading for F1,
F2,…Fk….,Fn normalized
on max_power
Subtract tca_weight from downlink
Loading for Fk
Select RF carrier frequency with
Available traffic channel elements,
available packet pipe capacity, and
minimum downlink loading.
Example:
tca _weight = 20
F1 : 30%
F2 : 45% (originating carrier)
F2 vs. F1 : (45-20=25) vs. 30
Traffic Channel assigned to F2
Called Cross Carrier Frequency
Traffic Channel Assignment when
selected RF carrier frequency = Fk

88. Traffic Channel Associated Signaling
 When on a traffic channel, associated signaling is used for
communication of messages between mobile and base
station.
 In addition to certain messages transmitted in Idle Mode,
other messages are send on the traffic channel :
• Handoff direction
• In-traffic system parameters
• Neighbor list update
• Mobile station registered
• Pilot strength measurement
• Power measurement report
• Handoff completion

89. Conversation Substate
 Messages being sent on the traffic channel
 Continuous confirmation of the traffic channel
 Locating handoff candidates
 Performing handoffs
 Power control
 Overload control
 Other call activities

90. The Traffic Channel State
1 1 2 80 bits 88 bits 12 bits 8 bits
MM
TT
TM
Primary
Signaling or
CRC Tail
1
0
00
Traffic
Secondary Traffic
Rate ½ Primary +
Signaling
1 1 2 40 bits 128 bits 12 bits 8 bits
MM
1
TT
0
TM
01
Primary
Traffic
CRC Tail
Rate 1/4 Primary +
Signaling Signaling or
Secondary Traffic
1 1 2 16 bits 152 bits 12 bits 8 bits
MM
1
TT
0
TM
10
Primary
Traffic
CRC Tail
Rate 1/8 Primary +
Signaling Signaling or
Secondary Traffic
1 1 2 168 bits 12 bits 8 bits
MM
1
TT
0
TM
11
CRC Tail
Blank and Burst
Signaling Traffic
MM = Mixed Mode
0 = Primary Only
1= Primary + Signaling or
Secondary
TT = Traffic Type
0 = Signaling
1 = Secondary
TM = Traffic Mode
00 = 80/88
01 = 40/128
10 =16/152
11= 168

91. Overview of Registration
•NAME
•MIN
•ESN
•Location
•Desired Slot Cycle
•Station Class Mark
•Billing Information

92. Types of Registration
 Power Up
 Power Down
 Timer Based
 Distance Based
 Zone Based
 Parameter Change
 Ordered
 Implicit
 Traffic Channel

93. CDMA2000 Handoff Related to Call Processing
States
Idle Handoff
Access Entry Handoff **
Dormant Handoff
Dormant Handoff
Access Probe Handoff
Access Handoff
Idle State
Request or
Response to send
on Access
Channel
Update Overhead
Information
System Substate
Access
States Allowed
Handoff
Types
Mobile
States
Page Response or
Origination or
Order/Message
Response Substate
Channel Assignment
Message or Extended
Channel Assignment
Message Received
Mobile Station
Control on the
Traffic Channel
State
Dormant Handoff
Soft Handoff
Softer Handoff
Soft Handoff
Softer Handoff
Hard Handoff
Dormant
Handoff
**Access Entry Handoff
allowed after receiving a
message requiring a
response or
acknowledgment

94. Idle Handoffs
A
B
Pilot_B
Pilot_A + 3
dB Must
Handoff

95. Access Handoffs
TIA/EIA-95
Improvements
Perform Idle Handoff
here if required
Tx strength of several
neighbors
Perform Idle Handoff between
probes if necessary
Perform Idle Handoff between
probes if necessary
Access Handoff
Channel Assignment into Soft
Handoff
Receipt of Page or
Subscriber dials #
Update Overhead Information
Begin Access Attempt
(TX of 1st Probe)
Continuous Access
Attempt(TX of 2nd Probe)
Continuous Access Attempt
(TX of 3rd Probe)
Probe is Acknowledged
Channel Assignment Message
IDLE
STATE
ACCESS
STATE

96. Soft Handoffs

97. Why Inter- Frequency Handoff ?
F1/F2/F3
F1/F2
F1(Common Carrier)
 Carrier is discontinuing – border carrier
 Current carrier is blocked – handoff escalation
F1/F2/F3
Traffic
Cell
F1/F2/F3
Traffic
Cell
F1/F2/F3
Traffic
Cell
F1/F2/F3
Traffic
Cell
F1/F2
Traffic
F3 Border
Cell
F1/F2
Traffic
F3 Border
Cell
F1/F2
Traffic
Cell
F1/F2
Traffic
Cell
F1Traffic
F2 Border
Cell
F1
Traffic
Cell
F1Traffic
F2 Border
Cell
F1
Traffic
Cell

98. Traffic Channel Handoffs

99. Traffic Channel Handoffs
MSC
Speech Handler
Base Station
Rake Receiver
Traffic
Frames

100. Traffic Channel Handoffs

101. Semi-Soft vs. Hard Handoff

103. IS-95B Soft Handoff Algorithm
 Excessive handoff may degrade system
capacity
 IS-95B Soft Handoff Algorithm
• Reduce soft handoff activity
• Filter out unnecessary handoffs
• Reduce number of soft handoff legs
• Improve forward link capacity
Ec/Io
PS1

104. The Pilot Searching Process

105. The Pilot Searching Process

106. The Pilot Searching Process

107. The Pilot Searching Process

108. Handoff Signaling

109. Handoff Signaling

110. Why Power Control ?
 Objectives
• Maintain QOS
• Maximize capacity
• Minimize interference
Power Control Algorithms
• Forward Link Power Control (FLPC,FPC)
- a.k.a Downlink Power Control
• Reverse Link Power Control (RPLC,RPC)
- a.k.a.Uplink Power Control

111. Power Control Is Required ?
 Near-far Problem
 Path Loss
 Fading
 Performance Objectives

112. Power Control
Mobile Tx Power (dBm) =
OPEN LOOP
k-Mobile Receive Power (dBm)
+ Parameters
+ Access robe Corrections (dB)
+ CLOSED LOOP Corrections (dB)

113. Reverse Link Power Control
 Two separate algorithms
 Reverse Open Loop (Autonomous Control)
• Performed in the mobile
• Adjust for pathloss
- Output power based on received signal strength
- Tx power = - [Mean Received Signal Strength] + correction_factors
Reverse Closed Loop (Base Station Directed Control)
•Base station directs mobile to adjust power
•Controls frame error rate of signal received at the serving base station
•Consists of an inner loop and an outer loop

114. Reverse Link Closed Loop Power Control
 Base station sends power control bits
• 800 controls per second (800 Hz)
 Closed Outer Loop (at base station)
• Calculates Ec/Io set point (for R-PICH)
- Based on R-FCH frame error rate
 Closed Inner Loop (at base station)
•Compare Ec/Io set point with measured Ec/Io
- Send power control bits (up/down) to mobile
 Mobile Adjust its power
•Based on power control bits from base station
•Step size of is adjustable

115. Forward Link Power Control
 Reverse Link Closed Lop process is adopted
 Mobile sends power control bits on R-PICH
• 800 control per second (800 Hz)
• Based on Eb/Nt and FER objectives
Base station received power control bits
• Variable power step size controlled by the base station

116. The Rake Receiver

117. Multipath

118. Multipath
Correlator 1
Correlator 2
Correlator 3
Searcher
Correlator
COMBINER

119. Variable Rate Vocoding Multiplexing

120. Coding Compressing
8000 samples/ s.  64 kbps
Optimally reconstructed human voice
Coding compression  14.4 kbps Decoding decompression
Silence
Silence

121. Variable Rate Vocoder
VVooccooddeerr DDaattaa RRaatteess
RRaattee SSeett 11:: 99660000bbppss TTXX RRaattee
VVooccooddeerr RRaattee
88555500
44000000
22000000
880000
TTxx RRaattee
99660000
44880000
22440000
11220000
FFuullll
HHaallff
QQuuaarrtteerr
EEiigghhtthh
VVooccooddeerr DDaattaa RRaatteess
RRaattee SSeett 22:: 1144..44KKbbppss TTXX RRaattee
VVooccooddeerr RRaattee
1133330000
66220000
22770000
11000000
TTxx RRaattee
1144440000
77220000
33660000
11880000
FFuullll
HHaallff
QQuuaarrtteerr
EEiigghhtthh

122. Variable Rate Vocoder
Eight
Rate
Quarter
Rate
Half
Rate
Half
Rate
Full
Rate
24 bits 48 bits 96 bits 96bits 192 bits
20 msec 20 msec 20 msec 20 msec 20 msec

123. Rate Sets
1 171 bits 12 bit CRC 8 Tail bits
Rate Set 1
Mode Bit
Full Rate
Half Rate 80 bits 8 bit CRC 8 Tail bits
Quarter Rate 40 bits 8 Tail bits
Eighth Rate 16 bits 8 Tail bits

124. Multiplexing
1 1 2 80 bits 88 bits 12 bits 8 bits
MM
TT
TM
Primary
Signaling or
CRC Tail
1
0
00
Traffic
Secondary Traffic
Rate ½ Primary +
Signaling
1 1 2 40 bits 128 bits 12 bits 8 bits
MM
1
TT
0
TM
01
Primary
Traffic
CRC Tail
Rate 1/4 Primary +
Signaling Signaling or
Secondary Traffic
1 1 2 16 bits 152 bits 12 bits 8 bits
MM
1
TT
0
TM
10
Primary
Traffic
CRC Tail
Rate 1/8 Primary +
Signaling Signaling or
Secondary Traffic
1 1 2 168 bits 12 bits 8 bits
MM
1
TT
0
TM
11
CRC Tail
Blank and Burst
Signaling Traffic
MM = Mixed Mode
0 = Primary Only
1= Primary + Signaling or
Secondary
TT = Traffic Type
0 = Signaling
1 = Secondary
TM = Traffic Mode
00 = 80/88
01 = 40/128
10 =16/152
11= 168

125. Multiplexing
1 124 bits 10 bits 8 bits
MM
Primary Traffic CRC Tail
= 0
7200 bps Primary
Traffic Only
1 3 54 bits 67 bits 10 bits 8 bits
MM
= 1
FM=
000
Primary Traffic Signaling Traffic CRC Tail
7200 bps Dim and
Burst with rate 1/4
Primary and Signaling
Traffic
1 3 20 bits 242 bits 10 bits 8 bits
MM
= 1
Primary Traffic Signaling Traffic CRC Tail
7200 bps Dim and
Burst with rate 1/8
Primary and Signaling
Traffic
FM=
001
1 3 121 bits 10 bits 8 bits
MM
= 1
Signaling Traffic CRC Tail
7200 bps Blank and
Burst with Signaling
Traffic FM=
010

126. Muliplexing
1 54 bits 10 bits 8 bits
MM
= 0
Primary Traffic CRC Tail
3600 bps Primary
Traffic only
1 2 20 bits 32 bits 8 bits 8 bits
MM
= 1
Primary Traffic Signaling Traffic CRC Tail
3600 bps Dim and
Burst with rate 1/8
Primary and Signaling
Traffic FM=
000
1 2 52 bits 8 bits 8 bits
MM
= 1
Primary Traffic CRC Tail
3600 bps Blank and
Burst with Signaling
Traffic FM=
01

127. SECTION 4
INTRODUCTION TO DATA IN CDMA
Section Introduction
•DATA Layers
•Data and Quality
•FCH and SCH
•Dormant Mode
•MAC and RLP
•SARA

128. MAC and LAC Protocol Layers

129. Protocol Layers

130. Quality of Servi ce Function

131. Radio Link P rotocol

132. Packet Data Traffic
 Packet data is bursts of data followed by periods of
inactivity
 Resources from instantaneously inactive users are
reassigned
 Inherently a best – effort system
• The system makes the best effort to provide an adequate service to multiple users
consistent with scheduling policies and user priorities.

133. Statistical Gain

134. Queuing Delay

135. 3G-1X Airlink Overview
Fundamental Channel - 9.6 Kbps
Supplemental Channel - 19.2 - 153.6 Kbps
. . .
Supplemental channels
Inactivity
Timer
Inactivity
Timer Session End
PPP Disconnect
Data Call
Reconnections
time
Fundamental
Channel
Burst Burst Dormant Burst Data Call
Origination
Data Call Data Call Data Call
Data Session

136. 3G1X Call

137. Supplemental Air Recourse Allocation
• SARA determines data rate and burst duration of SCH
- Goal is to maximize throughput based on QoS objectives
• First maximum data rate is determined
- Channel elements, Walsh codes, packet pipes etc.
• Then data rate and burst duration
- Maximum data rate and RF conditions.

138. Supplemental Channels -
Configuration
• No SCH
- Voice and low speed data
• Dedicated SCH
- High speed packet or circuit data for one user per SCH at a
time
• Shared SCH
- High speed packet data for multiple users on one or more
SCHs

139. Shared Supplemental Channel

140. Dedicated Supplemental Channel

141. Accumulative Interference

142. Data Call With Supplemental Channel

143. Turbo encoder
-“Two convolution encoders operating in parallel”
Input: turbo interleave
Output:concatenated, repetition and puncturing
-More robust than convolution codes
- Add additional delay to the traffic data
Complex Scrambling

144. CDMA Capacity

145. Coverage
(Eb/Io) = (Eb/Io) + Margin
received required
Strong coding enables
operation at lower Eb/Io.
Soft Handoff enables
CDMA to provide
acceptable level of service
with smaller margin.

146. Radio Frequency Impairments
Total impairment = Thermal noise NO
+ Co – channel interference from
mobiles served by the same
physical antenna face
+ Co – channel interference from
mobiles served by nearby
physical antenna faces
NT
Thermal noise = NO
Total impairment = NT

147. Reverse Link Pole Capacity

148. Example 3G-1X Reverse Link Budget Voice

149. Link Budget Impact of 3G-1X Data
• Traffic channel activity of SCH is assumed to be 1.0
• Data device is expected to be away from the user’s
head – body loss is 0dB
• Different data rates and corresponding Eb/Nt
Data rate FER Eb/Nt
19.2kbps 2% 3.4dB
38.4kbps 3% 2.6dB
76.8kbps 5% 1.8dB
153.6kbps 10% 1.0dB
• Turbo Codes

150. Example 3G-1X Reverse Link Budget-Data________