Professional Documents
Culture Documents
ZTE University
Crucial Factors for UMTS Network (CQC)
Capacity
>144 kbps
>64 kbps
Subscriber
num >12.2 kbps
increase
Optimization methods
To overcome Cell Breathing Effect caused by increased
traffic and meet different requirements for capacity and
coverage in different environment, following solutions can
be applied:
DL DL/UL:
transmission diversity (Tx Div) Add carrier
high power amplifier six sectors
UL
Tower Mounted Amplifier (TMA) Add basestation
4 Rx Div “last choice”
OTSR
Content
RAKE Receiver
Handover Control
Compressed Mode
Admission Control
Load Control
Code Resource Allocation
Multi-path characteristics of radio channel
Electromagnetic propagation:
direct radiation、reflection、diffraction and scattering
Signal attenuation:
Path loss: Loss of electromagnetic waves in large scope of the
spread reflects the trend of the received signal in the spreading。
Slow fading:Loss because of being blocked by the building and
hill in the propagation path
Fast fading:Electromagnetic signals rapidly decline in a few
dozens wavelength ranges
Description of Fast fading distribution
Rayleigh distribution:non line-of –sight(NLOS) transmission
Rician distribution:line-of –sight(LOS) transmission
Multi-Path Effects
sending signal
strength
receiving signal
0 time
RAKE Receiver
The multi-path signals contain some useful energy ,
therefore the UMTS receiver can combine these energy of
multi-path signals to improve the received signal to noise
ratio.
RAKE receiver adopts several correlation detectors to
receive the multi-path signals, and then combines the
received signal energy.
d1
d2
d3
transmitting Receiving
Rake
combination
noise
t t t
RAKE Receiving
Single
receiving
Single
receiving combining signal
receiver
Single
receiving
searcher calculate
s(t) s(t)
t t
RAKE Receiver
Handover Control
Compressed Mode
Admission Control
Load Control
Code Resource Allocation
What’s ?
Hard
Handover
Soft
Handover
Soft Handover/Softer Handover
Soft Handover
C C
A A
B B
Soft-Softer Handover
C C
A A
B B
Softer Handover
C C
A A
B B
Hard Handover
Soft
SoftHandover
Soft Handover
Handover Softer
Softer
Softer Handover
Handover
Handover
The two Node Bs Node
The two may Bs CN CN
CN
CN CN
belong to the
may Same
belong RNC
to the
same RNC
SRNC DRNC SRNC
Iur
Node B Node B
UMTS General Handover Trilogy
Measurement Control
UTRAN demands the UE to start measurement through
issuing a measurement control message.
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
UTRAN and UE execute different handover procedure
according to the handover command.
Handover Flows
(A) RNC sends measurement
control message to UE
(Measurement Control) Current (E) Quality Other
carrier has system has
Decision
good quality good
(B) UE starts measurement task quality
with the parameters included in Other carrier has good
the message, and reports quality
measurement results(
Measurement Report)
Reporting
Period report triggered handover
Base on the filtered measurement result
Event report triggered handover
Base on the event
Measurement result filtered in UE
Soft Period Event decided in RNC
Handover Handover decided in RNC
Handover algorithm
All the handover algorithms including soft handover,
hard handover and so on are implemented on the event
decision made according to the measurement reports.
Events defined in 3GPP specifications
Intra-frequency events:1A~1F
Inter-frequency events:2A~2F
Inter-RAT events:3A~3D
Note: RAT is short for “Radio Access Technology”, e.g.
UMTS&GSM
Concepts Related to Handover
Active Set:
A set of cells that have established radio links with a
certain mobile station.
User information is sent from all these cells.
Monitored Set:
A set of cells that are not in the active set but are
monitored according to the list of adjacent cells
assigned by the UTRAN.
Detected Set:
A set of cells that are neither in the active set nor in the
monitor set.
Soft handover event
Event Description
RNS
Radio Network Sub-system
RAKE Receiver
Handover Control
Compressed Mode
Admission Control
Load Control
Code Resource Allocation
Purpose of Compressed Mode
10ms
Puncturing
Lower the symbol rate of physical channel when
processing the rate matching procedure
SF halving
Employ half SF, e.g. employ SF64 to replace
SF128
High layer scheduling
Decrease the bit rate from up layer
Content
RAKE Receiver
Handover Control
Compressed Mode
Admission Control
Load Control
Code Resource Allocation
Admission Control
The admission control is employed to admit the access of
incoming call. Its general principal is based on the
availability and utilization of the system resources.
If the system has enough resources such as load margin,
code, and channel element etc. the admission control will
accept the call and allocate resources to it.
Purpose of Admission Control
When user initiates a call , the admission control should
implement admission or rejection for this service according
to the resource situation.
The admission control will sustain the system stability
firstly and try the best to satisfy the new calling service’s
QoS request, such as service rate, quality (SIR or BER),
and delay etc. basing on the radio measurement.
Admission control is the only access entry for the incoming
services, its strategy will directly effect the cell capacity
and stability, e.g. call loss rate, call drop rate.
Admission Control in Uplink
Quantity of Subscriber
Throughput
Quantity of Subscriber
The above figure illustrates the relation between ultimate user number
corresponds to different service rate and distance under equidistant
distribution condition
Admission Control Analysis
The service can be either one-direction or bi-direction
type. For bi-direction service, it is admitted only after
both uplink and downlink are admitted.
Admission control is the only access entry for the
incoming services, its strategy will directly effect the
cell capacity and stability, e.g. call loss rate, call drop
rate.
Content
RAKE Receiver
Handover Control
Compressed Mode
Admission Control
Load Control
Code Resource Allocation
Purpose of Load Control
Cell load
Serious overload threshold
Start
Normal loaded
Cell breathing is
one of the means
for load control
RAKE Receiver
Handover Control
Compressed Mode
Admission Control
Load Control
Code Resource Allocation
UMTS Code Resource
OC3, OC4
OC1, OC2
OC1, OC2
OC1 , OC2, OC3
PN1 PN1
PN3 PN4
PN2 PN2
PN5 PN6
Why Code Resource Planning?
The OVSF (Orthogonal Variable Spreading Factor) code
tree is a scarce resource and only one code tree can be
used in each cell. In order to make full use of the capacity,
and support as many connections as possible, it is
important to plan and control the usage of channel code
resource.
Downlink scrambling code allocation should be planned to
avoid the interference between neighboring cells.
The uplink scrambling codes are sufficient, but RNC
should plan the codes to use for avoiding allocating same
code to different users in inter-RNC handover scenario.
Code Resource Planning
The uplink and downlink scrambling code can be planned
easily by computer.
The uplink channelized code does not need planning, for
every UE can use the whole code tree alone.
Therefore, only the downlink channelized code is planned
with certain algorithm in RNC.
Each cell has one primary scrambling code, which
correlates with a channel code tree. All the users under
this cell share this single code tree, so the OVSF code
resource is very limited.
The downlink channelized code tree is a typical binary tree
with each layer corresponds to a certain SF ranging from
SF4 to SF512.
Generation of Channelized Code
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
OVSF Code Tree
Channelized Code Characters
Code allocation restriction :
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;
Code allocation side effect:
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
Strategy of Channelized Code Allocation
Full utilization
The fewer the blocked codes, the higher code tree
utilization rate.
Low Complexity
Short code first.
Allocate codes for common channels and physical
shared channels prior to dedicated channels.
Guarantee the code allocation for common physical
channels.
Apply certain optimized strategy to allocate codes
for downlink dedicated physical channels.
An Example of Code Allocation
SF = 4
SF = 8
SF = 16
SF = 32
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Choose one
code from
three
SF = 4
candidates
SF = 8
SF = 16
SF = 32
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
PN2
PN5