Professional Documents
Culture Documents
Name :
E-mail :
WCDMA Product Planning Dept.
ZTE Marketing System
Modification records
Edition
Date
Writer/Modifier
V3.00
2007-04
Shen junjie
V3.10
2007-08-17
Approver
Remark
Update
Agenda
AMPS
Others
TDMA
IS-136
PDC
Market
Driven
Broadband Service
CDMA
IS95
Voice Service
Market
Driven
Digital Technology
NMT
GSM
Analog Technology
TACS
Third
Third
Generation
Generation
(2000)
(2000)
Wideband
Wideband
Multimedia
Multimedia
Second
Second
Generation
Generation
(90s)
(90s)
Digital
Digital
UMTS
WCDMA
CDMA
2000
TDSCDMA
Background of 3G
The
network
Thenetwork
supported
by
supportedby
IMT-2000
called
IMT-2000isiscalled
3G.
3G.
different networks
The international standardIMT-2000
Target of IMT-2000
coverage
Easy evolution to 2G
UWC-136
WCDMA
TD-SCDMA
IMT-DS
CDMA DS
IMT-TD
CDMA TDD
UMTS FDD
UMTS TDD
CDMA 2000
UWC-136
E-DECT
IMT-MC
CDMA MC
IMT-SC
IMT-2000
TDMA SC
IMT-FT
IMT-2000
FDMA/TDM
A
IS-136
DECT
3G Technology Evolution
WCDMA
CN based on MAP
3G
CDMA2000
CN based on ANSI41
Standard
TD-SCDMA
CN based on MAP
CDMA
CDMAis
is the
the Mainstream
Mainstream Technology
Technology of
of 3G
3G
TD-SCDMA
TD-SCDMA
R4
2005
2005
WCDMA
R4
CDMA
1X
HSDPA
Phase1
R5
HSUPA
Phase1
HSDPA
Phase2
R6
EV-DO A
BCMCS
EV-DO 0
TD-SCDMA
TD-SCDMA
Enhanced
Enhanced
R5/6
HSUPA
Phase2
MBMS
AIE
Phase 2
3GPP2
3GPP2 4G
4G
WiMAX
WiMAX
802.16e
802.16e
802.16d
802.16d
2005
3GPP
3GPP 4G
4G
FDD/TDD
FDD/TDD
AIE
Phase1
NDO
WiMAX
WiMAX
2004
LTE
LTE
2006
2007
2008
After 2009
10
R6
R5
Commercial Release
2001.6+ following CR
R4
R99
2000.3
2001.3
2002.6
11
Characteristics of WCDMA
stations
Multiple switching technology
Multiple transport rate
Advanced radio resource management algorithm
12
R4
OMC Billing
Server
HLR
MMS
C
GMLC
PS
MSC
server
RNS
R99
R99 CN
CN smoothly
smoothly evolves
evolves from
from
GSM/GPRS
network
GSM/GPRS network
SCP
GMLC
OMC Billing
Server
HLR
MMS
C
GMLC
GMSC
server
CS
BSS
OMC Billing
Server
HLR
MMS
C
SCP
SCP
R5
BSS
CS
PS
PS
RNS
R4
R4 CN
CN separate
separate the
the Control
Control Plane
Plane
from
from Bearer
Bearer Plane
Plane in
in CS
CS Domain
Domain
BSS
RNS
R5
R5 CN
CN Introduces
Introduces
IMS
IMS
RAN
RAN Adopts
Adopts IP
IP
CDMA2000
5M
1.25/5/10/15/20 MHz
Chip rate
3.84M
N*1.2288Mcps N=1,3,6,9,12
Spreading way
DS-CDMA
Duplex mode
FDD/TDD
FDD
Frame size
10ms
Carrier spacing
Interleave
Intra-cutting inter-cutting
Intra-cutting
Scrambling
Walsh+Gold sequence
Walsh+M sequence
Modulation mode
QPSK/BPSK
QPSK/BPSK
Power control
Synchronization/Asynchronous
synchronization
Base station
synchronization
14
TD-SCDMA
Carrier spacing
5M
1.6M
Chip rate
3.84M
1.28M
Spreading way
DS-CDMA, SF=1,2,4,8,16
DS-CDMA, SF=1,2,4,8,16
Duplex mode
TDD
TDD
Modulation mode
QPSK/BPSK
QPSK
Number of timeslot
15
Capacity
16
56
48
Capacity
220.8kbps
281.6kbps
3.31Mbps
1.971Mbps
Spectrum Utilization
0.662Mbps/MHz
1.232Mbps
15
Agenda
17
scattering
Signal attenuation:
Slow fading Loss because of being blocked by the building and hill in the
propagation path
18
Interference
dithering
0
delay
Sending signal
Accepting signal
fading
0dB
2 3
Sending signal
Accepting signal
Sending signal
-25dB
Accepting signal
Sending signal
Accepting signal
Frequency
Frequencyoff-set
off-setcaused
causedby
bythe
themovement
movementof
ofmobile
mobile
that
thatis
isDoppler
Dopplereffect
effect
19
Multi-Path Effects
sending signal
strength
receiving signal
0
time
20
21
Multiple Access
Frequency
Frequency division
division multiple
multiple
access
access technology
technology
FDMA
Channels
Channelsin
indifferent
differentfrequency
frequencyare
are
allocated
to
different
users,
e.g.
allocated to different users, e.g.
TACS
TACS
AMPS
AMPS
Power
Time
Time division
division multiple
multiple access
access
technology
technology
TDMA
channels
channelsin
indifferent
differenttime
timeare
areallocated
allocatedto
to
different
users,
e.g.
GSM
DAMPS
Code
Code division
division multiple
multiple access
access
technology
technology
Users
Usersdistinguished
distinguishedby
byscramble
scramblecode,
code,e.g.
e.g.
CDMA
CDMA
Tim
e
eq
Fr
y
nc
e
u
Power
Tim
e
Fre
cy
en
u
q
CDMA
Power
Tim
e
y
nc
e
u
eq
Fr
22
23
frequency of signal.
Theoretical Basis: Shannon theory C=Wlog2(1+S/N)
Wideband
Signal
Slow
Information
Sent
Slow
Information
Recovered
TX
Fast
Spreading
Sequence
RX
Fast
Spreading
Sequence
24
Sf
Sf
signal
signal
f0
f0
Before spreading
After spreading
Sf
Sf
White noise
signal
White noise
signal
f0
Before despreading
signal
interference
f0
After despreading
White noise
25
Spreading Mode
26
27
28
-2
Turbo coding
BER<10-6
29
Channel coding
30
31
disadvantage
e.g.
x1 x6 x11 x16 x21
Data input
A = (x1 x2 x3 x4 x5 x25)
x2 x7
x22
x3 x8
x23
x4 x9
x24
x5 x10
x25
Data output
A= (x1 x6 x11 x16 x25)
32
33
process.
advantage
Improve SNR
34
Diversity Categories
Space diversity
Also called antenna diversity, if the distance between the antennae is greater
than half of the wavelength, the signals from different antenna are not related.
Time diversity
The signal repeats over Channel Coherent time interval, so that the environment
is independent.
Frequency diversity
Polarization Diversity
35
Agenda
37
Spreading of WCDMA
Chip after
Spreadin
g
Data bit
OVSF Code
Scramble Code
Symbol
Symbol rate
rate SF
SF == 3.84Mcps
3.84Mcps
WCDMA
WCDMA
SF
SF of
of uplink
uplink channeliezd
channeliezd code
code
4~256
4~256
SF
SF of
of downlink
downlink channelized
channelized code:4~512
code:4~512
OVSF:
OVSF: Orthogonal
Orthogonal Variable
Variable Spreading
Spreading Factor
Factor
38
serial
DL physical channel 1
parallel
transfer
I+jQ
Sdl,n
Cch,SF,m
G1
j
DL physical channel 2 serial
parallel
transfer
I+jQ
Sdl,n
Cch,SF,m
G2
S-SCH
Gp
Gp
Re(T)
T
P-SCH
Real part
and
Imaginary part
separate Im(T)
cos(wt)
Pulse
shaping
Pulse
shaping
-sin(wt)
39
Cd,1
DPDCH3
Cd,3
Cd,5
DPDCH5
cc
I+jQ
DPDCH2
Cd,2
DPDCH4
Cd,4
Cd,6
Cc
DPDCH6
DPCCH
cc
Q
j
Re(S)
Sdpch,n
Real part
and
Imaginary part
separate Im(S)
cos(wt)
Pulse
shaping
Pulse
shaping
-sin(wt)
40
Despreading of WCDMA
Method of despreading
Input signal
Ts
(*)dt
0
41
Symbol
Data =
010010
1
-1
Chip
Spreading code =
1 -1 -1 1 -1 1 1 -1
( SF = 8 )
Spreading
1
-1
Spread signal
= Data code
Despreading
Spreading code
Data =
Spread signal
code
1
-1
1
-1
1
-1
42
Spreading Gain
R: signal rate
PG=10lg(Wc/R), dB units
jamming
43
44
Convolutional Code
Input
D
Output 0
G0 = 557 (octal)
Output 1
G1 = 663 (octal)
Output 2
G2 = 711 (octal)
45
Easy decode
Short delay
Generally use the Viterbi Algorithm
Channel bit error rate is 10 3 magnitude
Suitable to realtime service
46
Turbo Code
Used in Data service channel
Code Rate is 1/3
Can be implemented in the transmission for large block and long delay
services
Turbo coding structure is based on two or more weak error control code
combinations. The information bits are interleaved in the two Encoder, and
generate two information flow. At last, this information can be multiplexed
and punctured
input
Encoder 1
Interleaver
Multiplex
output
Encoder 2
47
Complex decoding
48
49
Intra-frame interleave
Inter-frame interleave
50
51
Interleave
52
Agenda
Capacity of WCDMA
UL c
apac
ity in
limit terferenc
ed
e
DL c
apac
ity p
ow e
r lim
it
ed
54
Power Rise
Meeting Room
talk with dialects
voice tone
listen clearly
voice tone rise
voice climb
can not listen for each other
Noise outside the room
55
Power Rise
56
57
Soft Capacity
Different
service has
different
capacity
Different service
combination and
proportion has
different capacity
Trade
Trade off
off between
between System
System capacity
capacity and
and service
service quality
quality
58
ty
ali
Qu
Co
ve
r ag
e
Capacity
All
All the
the WCDMA
WCDMAtechnologies
technologies adopted
adopted is
is try
try to
to achieve
achieve
the
the most
most optimal
optimal balance
balance of
of the
the three
three factors
factors
59
Category
Admission Control
Admitting a connection base on the load and the admission threshold of planned
capacity
Radio Resource
Management RRM
Load Control
Monitoring system load and adjusting the ongoing services to avoid overload
OVSF Code
The Allocation of codes impacts the maximum number of simultaneous connections.
RAKE Receiver
Smart Antenna
Reducing interference, saving power and expanding coverage through tracking the
user with beam forming antenna array.
MUD
Key Technology
Service Attribute
Wireless environment such as interferences, UE position and mobility etc. can influent
Wireless Propagation
Environment
Wireless Environment
60
Agenda
62
Power Control
commercial network
CDMA
CDMAis
is aa typical
typical self-interference
self-interference system,
system, thus
thus the
the chief
chief
principle
principle is
is that
that any
any potential
potential surplus
surplus transmitted
transmitted power
power for
for
service
service must
must be
be controlled.
controlled.
63
Near-Far Effect
Power
Power
Each
Each terminal
terminal is
is an
an
interference
interference source
source to
to the
the
others.
others. The
The Near-far
Near-far effect
effect
will
will impact
impact the
the capacity
capacity
tremendously
tremendously
Power
Power control
control will
will reduce
reduce
the
the cross
cross interference
interference
significantly
significantly and
and improve
improve
the
the total
total capacity
capacity
64
Multi-Access Interference
Output
Frequency
Time
Codes
Synchronization
Time
Multi-Access Interference Sketch Map
65
66
The downlink Open Loop Power Control is using P-CPICH signal which
is measured by UE to estimate the initial TCP and the following factors
will also be considered, such as service QoS and data rate, Eb/No
requirements of establishing service, current downlink total
Transmitted Power and interference from neighbor cell etc..
68
1500Hz
1500Hz
Inner loop
TPC instruction
Set SIRtar
NodeB
Try
Try to
to get
get the
the equal
equal receiving
receiving
Eb
Eb (Energy
(Energy per
per bit)
bit) of
of each
each
UE
UE at
at Node
Node B
B
UE
Each
Each radio
radio link
link has
has
its
its own
own control
control
circle
circle
69
The receiver compares the SIR value of received signal with target SIR, and then
sends back TPC instruction. According to the instruction, the sender will decide
to increase/decrease the transmitted power, The adjusted
rang=TPC_cmdTPC_STEP_SIZE
Inner loop power control is not required for the following channels
70
Measure
Measure BLER
BLER
of
of TRCH
TRCH
Get
Get data
data flow
flow
with
with stable
stable BLER
BLER
Measure receiving
BLER and compare to
target BLER
Inner loop
Outer Loop
Set BLERtar
TPC instruction
Set SIRtar
10-100Hz
RNC
NodeB
UE
71
The algorithm is implemented as following: Employ the inner loop power control to keep SIR close
to target SIR; Measure the quality of service, e.g. through CRCI report, and tune the target SIR with
pre-defined step; Therefore keep the call in good quality event in changing wireless propagation
environment.
Input parameters include target BLER, CRC indicator and SIR Error, output parameter is SIR Target.
Open loop power control algorithm is implemented in two ways: FER period report triggered; FER
event report triggered.
The uplink open loop power control algorithm is executed in the RNC while the downlink one is
executed in the UE.
72
73
74
Handover Types
Soft Handover
Hard Handover
75
Handover Demonstration
Hard
Handover
Soft
Handover
76
C
A
C
A
B
C
C
A
C
A
C
A
77
Measurement Control
Handover decision
UTRAN makes the decision based on the measurement reports from UE. The
implementation of handover decision is various for different vendors. It impacts
on the system performance critically.
Handover execution
78
Handover Flows
(A) RNC sends
measurement control
message to UE (Measurement
Control)
(B) UE starts measurement
task with the parameters
included in the message,
and reports measurement
results Measurement
Report
(C) RNC stores the
measurement results
according to frequencies and
cells
(D) RNC Estimates the
quality of each carrier
(including intra-frequency
and inter-frequency)
Current
carrier has
good quality
(E) Quality
Decision
Other carrier has
good quality
(F) maintain
the active set
and monitored
set
(G) Allocate
resource in target
cell of the virtual
active set, prepare
to execute handover
Other
system
has good
quality
(H) Allocate
resource in target
cell, prepare to
execute handover
79
Measuring
80
Filtering
Fn=(1-a)Fn-1 a*Mn
Variants definition
Fn filtered measurement result
Fn-1 last filtered measurement result
Mn latest Ec/I0 or RSCP measurement result received from physical
layer;
a = 1/2(k/2), k means the Filter coefficient, which is included in the
Measurement Control message. It is decided by the UTRAN.
F0 is initialized by the first measurement result M1.
81
Reporting
Period
UE
Event decided in RNC
Handover decided in RNC
Event
Handover algorithm
83
Active Set: A set of cells that have established radio links with a certain
Monitored Set: A set of cells that are not in the active set but are monitored
Detected Set: A set of cells that are neither in the active set nor in the
monitor set
84
Pilot
Ec/Io
time
Event 1A
Event 1C
Event 1B
add cell2 replace cell1 with cell 3 remove cell3
85
RNS Relocation
Core Network
Core Network
Iu
Service
RNS
Iu
Target
RNS
Iur
Target
RNS
Service
RNS
RNS
Radio Network Sub-system
86
Hard Handover
of other frequency.
frequency measurement.
87
88
89
Compressed Mode
10ms
1 frame10ms
90
Puncturing
Lower the symbol rate of physical channel when processing the rate
matching procedure
SF halving
91
92
Admission Control
and channel element etc. the admission control will accept the call
and allocate resources to it.
93
for the new users, new RAB and new RL (for example handover)
according to the current resource situation. The admission control
will sustain the system stability firstly and try the best to satisfy
the new calling service QoS request, such as service rate, quality
(SIR or BER), and delay etc., basing on the radio measurement.
94
Itotal_old+I >Ithreshold
Access
Threshold
Interference capacity
Service priority
Reserved capacity for
handover
Iown-cell
The current RTWP (Received
Total Wide Power) value of cell,
which is reported by Node B
Iother-cell
~
N0
95
number conditions
Different ultimate throughputs
Ptotal_old+P>=Pthreshold
Access
Threshold
The
The above
above figure
figure illustrates
illustrates the
the relation
relation between
between ultimate
ultimate user
user
number
number corresponds
corresponds to
to different
different service
service rate
rate and
and distance
distance
under
under equidistant
equidistant distribution
distribution condition
condition
98
services, its strategy will directly effect the cell capacity and
stability, e.g. call loss rate, call drop rate.
99
100
Increasing of
transmitted power
will increase the
system load
Load control
101
Start
Light load
Decision
Over load
Normal load
1. Handover in and
access are allowed
2. Transmitted code
power (TCP) increasing
is allowed
3. RAB service rate
upgrade is allowed
1. Handover in
and access are
allowed
2. TCP
increasing is
allowed
102
Triggers
Admission control triggers when rejecting the high priority services access due
to insufficient load capacity in uplink.
Release calls.
103
Triggers
TCP (Transmitted Carrier Power) value from measurement report exceeds the
downlink overload threshold;
Admission control triggers when denying the high priority services access due
to insufficient load capacity in downlink.
104
Cell Breathing
Cell breathing is
one of the means
for load control
The
The purpose
purpose of
of cell
cell breathing
breathing is
is to
to share
share the
the load
load of
of hothotspot
spot cell
cell with
with the
the light
light loaded
loaded neighbor
neighbor cells,
cells, therefore
therefore to
to
improve
improve the
the utilization
utilization of
of system
system capacity.
capacity.
105
106
to use the codes for avoiding allocating same code to different users in
inter-RNC handover scenario.
107
The uplink scrambling code and downlink scrambling code can be planned easily,
and uplink channel code does not need planning, therefore, only the downlink channel
code is planned with certain algorithm in RNC.
Each cell has one primary scrambling code, which correlates with a channel code
tree. The downlink channel code tree is a typical binary tree with each layer
corresponds to a certain SF ranging from SF4 to SF512.
108
Cch,4,0 =(1,1,1,1)
Cch,2,0 = (1,1)
Cch,4,1 = (1,1,-1,-1)
Cch,1,0 = (1)
Cch,4,2 = (1,-1,1,-1)
Cch,2,1 = (1,-1)
Cch,4,3 = (1,-1,-1,1)
SF = 1
SF = 2
SF = 4
109
110
The code to be allocated must fulfill the condition that its ancestor
nodes including from father node to root node and offspring nodes in
the sub tree are not allocated;
The allocated node will block its ancestor nodes and offspring nodes,
thus the blocked nodes will not be available for allocation until being
unblocked .
SF=8
SF=16
SF=32
111
Full utilization
Low Complexity
The fewer the blocked codes, the higher the code tree utilization rate.
Allocate codes for common channels and physical shared channels prior
to dedicated channels.
112
SF = 4
SF = 8
SF = 16
SF = 32
0
16
17
18
19
20
21
22
23
24
10
11
12
13
14
15
25
26
27
28
29
30
31
SF = 4
Choose one
code from
three
candidates
SF = 8
SF = 16
SF = 32
113
Agenda
115
RAKE Receiver
The multi-path signals contain some useful energy , therefore the
d1
d2
d3
RAKE
RAKE Receiver
Receiver can
can effectively
effectively overcome
overcome the
the multi-path
multi-path
interference,
interference, consequently
consequently improve
improve the
the receiving
receiving performance.
performance.
116
RAKE Receiver
Single path
receiving circuit
Single path
receiving circuit
Receiver
Combiner
Combined
Signal
Single path
receiving circuit
Calculate signal
strength and
delay
Multi-path search
engine
s(t)
s(t)
t
117
118
Multi-User Detection
collecting the useful information of all users and adopting certain signal
processing method.
119
The CDMA receiver is based on the principal of RAKE receiving, and the interference
The true optimal receiver adopts join-detection technology to detect all the received
elimination can reduce the multi-access interference, thereby improve the capacity.
MUD can eliminate the near-far effect.
The near optimal MUD receiver and interference eliminated receiver are actually
applied instead of the true optimal MUD receiver because of the implementation
complexity.
120
Synchronize
Matched Filter 1
r(t)
Synchronize
Matched Filter 2
Z1 i
Z2 i
Synchronize
Matched Filter k
Zk i
b1 i
Viterbi
Algorithm
Implementation
b2 i
bk i
121
Bit Decision
Matched Filter 1
r(t)
Matched Filter 2
Matched Filter k
Linear
Transform
ation
R1
Bit Decision
Bit Decision
b1
b2
bk
122
Summary
Power Control
Handover Control
Admission Control
Load Control
Code Allocation
RAKE Receiver
MUD
123