03 OWJ100102 WCDMA Radio Network Capacity Planning (With Comment) ISSUE 1

WCDMA Radio
Network Capacity
Planning
www.huawei.com
Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.
Foreword
WCDMA is a self-interference system
WCDMA system capacity is closely related to coverage
WCDMA network capacity has the soft capacity feature
The capacity planning of the WCDMA network is performed
under certain traffic models
Page2
Objectives
Upon completion of this course, you will be able to:
Grasp the parameters of 3G traffic model
Understand the factors that restrict the WCDMA network
capacity
Understand the methods and procedures of estimating multiservice capacity
Understand the key technologies for enhancing network
capacity
Page3
Contents
1. Traffic Model
2. Uplink capacity analysis
3. Downlink capacity analysis
4. Multi-service capacity estimation
5. Network estimation procedure
6. Capacity enhancement technologies
Page4
Contents
1. Traffic Model
1.1 Overview of traffic model
1.2 CS traffic model
1.3 PS traffic model
Page5
Service Overview
The WCDMA system supports multiple services
Variable-rate services (e.g. AMR voice)
Combined services (e.g. CS & PS)
High-speed data packet services (384k service)
Asymmetrical services (e.g. stream service )
Large-capacity and flexible service bearing
Page6
QoS Type
Real-time category
Conversational
It is necessary to maintain the time relationship
Voice service,
between the information entities in the stream.
videophone
Small time delay tolerance, requiring data rate

symmetry
Streaming
Non real-time category
Interactive
Background
Typically unidirectional services, high requirements
Streaming
on error tolerance, high requirements on data rate
multimedia
Request-response mode, data integrity must be
Web page
maintained. High requirements on error tolerance,
browse,
low requirements on time delay tolerance
network game
Data integrity should be maintained. Small delay
Background
restriction, requiring correct transmission
download of
Email
Page7
Objectives of Setting Up Traffic Model

In order to determine the system configuration, we need to
determine the capacity of the air interface first
In the data service, different transmission model will
generate different system capacities
We need to set up an expected data transmission model of
the customer so that we can plan the network properly
In order to set up a right model, the operator should provide
some statistic data as reference
Page8
Traffic Model
Traffic model is a means of researching the capacity
features of each service type and the QoS expected by the
users who are using the service from perspective of data
transmission
In the data application, the user behaviour research mainly
forecasts the service types available from the 3G, the
number of users of each service type, frequency of using
the service, and the distribution of users in different regions
Page9
The Contents of Traffic Model
Service Pattern
Traffic Model
Results
User behaviour
System Configuration
Page10
Typical Service Features Description

Typical service features include the following feature
parameters:
User type (indoor ,outdoor, vehicle)
Users average moving speed
Service Type
Uplink and downlink service rates
Spreading factor
Time delay requirements of the service
QoS requirements of the service

Page11
Contents
1. Traffic Model
Page12
CS Traffic Model
Voice service is a typical CS services. Voice data arrival
conforms to the Poisson distribution. Its time interval
conforms to the exponent distribution
Key parameters of the model
Penetration rate
BHCA Mean busy-hour call attempts
Mean call duration (s)
Activation factor
Mean rate of service (kbps)
Page13
CS Traffic Model Parameters

Mean busy-hour traffic (Erlang) per user = BHCA * mean call
duration /3600
Mean busy hour throughput per user (kbit) (G) = BHCA * mean
call duration * activation factor * mean rate
Mean busy hour throughput per user (bps) (H) = mean busy hour
throughput per user * 1000/3600
Page14
Contents
1. Traffic Model
Page15
PS Traffic Model
The most frequently used model is the packet service
session process model described in ETSI UMTS30.03
Page16
PS Traffic Model
Session
Packet Call
Packet Call
Downloading
Active
Downloading
Dormant
Dormant
Active
Packet Call
Data Burst
Data Burst
Data Burst
Page17
PS Traffic Model Parameters
Packet Call Num/Session

Packet Num/Packet Call
Traffic model
Packet Size (bytes)

Reading Time (sec)
Typical Bear Rate (kbps)
BLER
Page18
Parameter Determining
The basic parameters in the traffic model are determined in
the following ways:
Obtain numerous basic parameter sample data from the
existing network
Obtain the probability distribution of the parameters through
processing of the sample data
Take the distribution most proximate to the standard probability
as the corresponding parameter distribution through
comparison with the standard distribution function
Page19

Typical Bearer Rate (kbps)
Bearer rate is variable in the actual transmission process
BLER
In the PS service, when calculating the data transmission time,
the retransmission caused by erroneous blocks should be
considered. Suppose the data volume of service source is N,
the air interface block error rate is BLER, the total required
data volume to be transmitted via the air interface is:
N + N * BLER + N * BLER 2 + N * BLER 3 +
+ N * BLER n =
Page20
1
*N
1 BLER
PS User Behaviour Parameters
Penetration Rate
BHSA
User behaviour
User Distribution (High, Medium, Low

end)
Page21
PS User Behaviour Parameters

Penetration Rate
The percentage of the users that activates this service to all the
users registered in the network.
BHSA
The times of single-user busy hour sessions of this service
User Distribution (High, Medium, Low end)

The users are divided into high-end, mid-end and low-end
users. Different operators and different application situations
will have different user distributions
Page22

Session traffic volumeByte Average traffic of single session
of the service
SessionTrafficVolume= ( PacketSize) * ( PacketNum/ PacketCall) * ( PacketCallNum / Session)
Data transmission time (s) The time in a single session of service

for purpose of transmitting data.
DataTransm issionTime ( s ) =
1
SessionTra fficVolume * 8 / 1000
*
BLER
TypicalRat e
Holding Times Average duration of a single session of service

HoldingTim
e = ( PackketCal
+ DataTransm
issionTime
lNum / Session
1) * Re adingTime
(s)
Page23

Active factor:
The weight of the time of service full-rate transmission among the
duration of a single session.
ActiveFact
or =
DataTransm
issionTime
HoldingTim
e
Busy hour throughput per user (Kb):

BusyHourTh
roughput
/ use
= BHSA * SessionTra
fficVolume
* 8 / 1000
PS throughput equivalent Erlang formula (Erlang)

Data _ Erlang =
( PercentageOfDiffrentUser PenetratingRate
BusyHourThroughputUnderTypicalApplicationEviroment
)
TypicalBearedRate 3600 ActiveFactor
Page24
Contents
1. Traffic Model
Page25
Uplink Interference AnalysisUplink

Interference Composition
I TOT = I own + I other + PN

I own Interference from the users of this cell
I other Interference from users of adjacent cell
PN
Noise floor of the receiver
Page26
Basic Principles
In the WCDMA system, all the cells share the same frequency,
which is beneficial to improve the system capacity. However, cofrequency multiplexing causes interference between users. This
multi-access interference restricts the capacity
The radio system capacity is decided by uplink and downlink.
When planning the capacity, we must analyze from both uplink
and downlink perspectives
Page27

Interference Composition
Receiver noise floor PN
PN = 10 log( K * T * W ) + NF
KBoltzmann constant, 1.38 10
23
J /K
TKelvin temperature, normal temperature: 290 K

WSignal bandwidth, WCDMA signal bandwidth
3.84MHz
10lg(KTW) = -108dBm/3.84MHz
NF = 3dB (typical value of macro cell BTS)

PN = 10log(K *T *W ) + NF = 105dBm/ 3.84MHz
Page28

Interference
Composition
I
own
Interference from users of this cell
Interference that every user must overcome: I total
Pj
Pj is the receiving power of the user j , V j is active factor

Under the ideal power control :
Pj =
I TOT
(Eb / No ) j
1
W 1
1+
(Eb / No ) j R j v j
Hence, Pj : I own =
Pj
I TOT
Pj
W 1
Rj vj
Pj
The interference from users of this cell is the sum of power of all the
users arriving at the receiver
Page29

Interference
Composition
I
other
:Interference from users of adjacent cell
The interference from users of adjacent cell is difficult to analyze

theoretically, because it is related to user distribution, cell layout,
and antenna direction diagram.
Adjacent cell interference factor
I other
i=
I own
When the users are distributed evenly

For omni cell, the typical value of adjacent cell interference factor is
0.55
For the 3-sector directional cell, the typical value of adjacent cell
interference factor is 0.65
Page30
Uplink Interference Analysis

= (1 + i )
N
1
Define
Then
Lj =
I TOT
1
W 1
1+
+ PN
1
1+
W 1
1
I TOT = I TOT (1 + i )
N
1
Page31
L j + PN

Obtain I TOT = PN
1
1 (1 + i )
Lj
Suppose that:
All the users are 12.2 kbps voice
users, the demodulation threshold
Eb/No = 5dB
Voice activation factor vj = 0.67
Adjacent cell
interference factor
i = 0.55
Page32

Load Factor
Define the uplink load factor
UL
= (1 + i )
L j = (1 + i )
When the load factor is 1,
N
1
I TOT
1
1
W 1
1+
(EbvsNo) j R j v j
is infinite, and the corresponding
capacity is called threshold capacity.
Under the above assumption, the threshold capacity is approx 96 users.
Page33
Uplink Interference AnalysisLoad

Factor and Interference
According to the above mentioned relationship, the
I
1
1
noise will rise:
NoiseRise = TOT =
=
N
1 UL
PN
1 (1 + i ) L j
1
50% Load 3dB

60% Load 4dB
75% Load 6dB
Page34

Limitation of the Current Method
The above mentioned theoretic analysis uses the following
simplifying explicitly or implicitly:
No consideration of the influence of soft handover
The users in the soft handover state generates the interference which is
slightly less than that generated by ordinary users.
No consideration of the influence of AMRC and hybrid service

AMRC reduces the voice service rate of some users, and makes them
generate less interference, and make the system support more users. (But
call quality of such users will be deteriorated)
Different services have different data rates and demodulation thresholds.
So, we should use the previous methods for analysis, but it will complicate
the calculation process.
Since the time-variable feature of the mobile transmission environment, the
demodulation threshold even for the same service is time-variable.
Page35

Limitation of the Current Method
Ideal power control assumption
The power control commands of the actual system have certain
error codes so that the power control process is not ideal, and
reduces the system capacity
Assume that the users are distributed evenly, and the

adjacent cell interference is constant
Considering the above factors, the system simulation is a
more accurate method:
Static simulation: Monte_Carlo method
Dynamic simulation
Page36
Contents
1. Traffic Model
Page37
Downlink Interference Analysis

Downlink Interference Composition

I own : Interference from other downlink DCH of this cell
I other: Interference from the downlink DCH of adjacent cell
PN : Noise floor of the receiver
Page38

Receiver noise floor PN
PN = 10 log( K * T * W ) + NF
K Boltzmann constant, = 1.38* 10
23
J /K
T Kelvin temperature, normal temperature 290 K

W Signal bandwidth, WCDMA signal bandwidth 3.84MHz
NF: Receiver noise figure
10lg(KTW) = -108dBm/3.84MHz
NF = 7dB UE typical value
PN = 10log(K * T *W ) + NF = 101dBm/ 3.84MHz
Page39

I own
:Interference from other downlink DCH of this cell

The downlink users are identified with the mutually orthogonal OVSF
codes. In the static propagation conditions without multi-path, no mutual
interference exists.
In case of multi-path propagation, certain energy will be detected by the
RAKE receiver, and become interference signals. We define the
orthogonal factor
to describe this phenomenon.
( I own ) j = (1
PT
PL j
In the formula, PT is a total transmitting power of BTS, which includes the

dedicated channel transmitting power andNthe common channel transmitting
power
PT = PCCH +
Pj
1
Page40

I other : Interference from the downlink DCH of adjacent cell
The transmitting signal of the adjacent cell BTS will cause
interference to the users in the current cell. Since the
scrambling codes of users are different, such interference is
non-orthogonal
Assume the service is distributed evenly, the transmitting
power of all BTSs will be equal. k,j In the system, there are K
adjacent cell BTSs, where path loss from the number k BTS
to the user j is PLk,j. Hence we obtain:
(I other ) j = PT
K
1
1
PLk , j
Page41

= (1
PT
+ PT
PL j
K
1
1
+ PN
PLk , j
Suppose the power control is desired, we obtain
Pj
PL j W 1
(EbvsNo ) j =
(ITOT ) j R j v j
Then
Pj = (EbvsNo ) j
Rj
W
v j (I TOT ) j PL j
Page42

Because
PT = PCCH +
Pj
Then
PT = PCCH +
(EbvsNo ) j
= PCCH +
(EbvsNo ) j
= PCCH +
N
1
(EbvsNo ) j
Rj
W
Rj
W
Rj
W
v j (I TOT ) j PL j
v j PL j
vj
(1
(1
j
)P
PT
+ PT
PL j
+ PT
K
1
PL j
PLk , j
Page43
1
+ PN
PLk , j
+ PN PL j

Resolve PT to obtain
PCCH + PN
(EbvsNo ) j
PT =
1
N
1
(1
Rj
W
+ i j ) (EbvsNo ) j
v j PL j
Rj
W
vj
where ij is the adjacent cell interference factor of the user,

defined as:
ij =
PL j
PLk , j
Page44

According to the above analysis, we can define the downlink load factor:
DL
N
1
(1
+ i j ) (EbvsNo ) j
Rj
W
vj
When the downlink load factor is 100%, the transmitting power of the BTS is
infinite, and the corresponding capacity is called threshold capacity.
As different from the theoretic calculation of uplink capacity, a j and i j in
the downlink capacity formula are variable related to user position. Namely,
the downlink capacity is related to the spatial distribution of the users, and
can only be determined through system simulation.
Page45

Simulation Result
Page46

Simulation Result Analysis
When the transmitting power of the BTS is 43dBm (20W), the
supported maximum number of users is approx 114.
In order to ensure system stability, we do not allow the mean
transmitting power of the BTS to be more than 80% of the
maximum transmitting power, namely, 42dBm. This way, the
supported number of users is 111.
Page47
Contents
1. Traffic Model
Page48
Contents
4.1 Network capacity restriction factors
4.2 Typical capacity design methods
Page49
Capacity Restriction Factors

The WCDMA network capacity restriction factors in the
radio network part include the following:
Uplink interference
Downlink power
Downlink channel code resources (OVSF)
Channel element (CE)
Iub interface transmission resources
Page50
Downlink Transmit Power

The downlink transmit power has two parts:
one part is used for common channel, and
the other part for dedicated (traffic) channel.
N
PT = PCCH +
Pj
1
The transmit power is allocated
by the cell
to each user varies with service
demodulation threshold, propagation path
loss and the interference received by the
user
The downlink transmit power of the cell is

shared by all the users in the cell
We generally use the simulation method to
analyze the downlink interference.
Page51
Downlink Channel Code Resources

The WCDMA network use the codes
whose SF is 4~512. The smaller the
SF is, the higher the supported data
rate will be.
In the code tree, the allocable codes
should meet the following conditions:
No codes on the path from this
code to the root node of code tree
are allocated
C4,0
C2,0
1 1
C1,0
1 1 1 1
C4,1
1 1 -1 -1
C4,2
C2,1
1 -1
1 -1 1 -1
C4,3
1 -1 -1 1
SF = 1
SF = 2
No codes in the sub-tree whose

root node is this code are allocated
Try to reserve the code words
whose SF is small, so as to
improve the utilization efficiency
Page52
SF = 4
Downlink Channel Code Resources

Following is an example of code resources allocation
SF
16
32
64
128
0
256
512
C( 256, 0) : PCPI CH 2
C( 256, 1) : PCCPCH 3
C( 256, 2) : AI CH 6
C( 256, 3) : PI CH 10
C( 64, 1) : SCCPCH 8
C( 64, 2) : SCCPCH 9
Page53
Channel Element (CE)

The Channel element the quantitative data that measures the
resources logically occupied for service processing
The resource occupied by the service processing is mainly related
to the spreading factor of this service. The smaller the SF is, the
greater the data traffic will be, and more resources will be occupied
The SF of typical services are:
AMR12.2kbps
SF=128
CS64kbps
SF=32
PS64kbps
SF=32
PS144kbps
SF=16
PS384kbps
SF=8
Page54
Channel element (CE)

If we define the resources required for processing AMR 12.2kbps
services as a channel processing unit, the number of channel
processing units occupied by other services is:
AMR12.2kbps
CS64kbps
CS144kbps
CS384kbps
16
PS64kbps
PS144kbps
PS384kbps
16
Page55
Iub Interface Capacity

The contents transmitted on the
Iub interface include:
The user data encapsulated in
the AAL2 format (common
channel and dedicated channel)
Signaling data encapsulated in
the AAL5 format
BTS operation & maintenance
data
Page56
Iub Interface Capacity

Factors to be considered when estimating the interface
capacity:
Frame coding efficiency. Through segmentation and
encapsulation of the application data at each layer, the data
quantity at the bottom layer will be increased to different
extents compared with the application data at the upper
layers
Traffic. More users will generate more data traffic
Maintenance efficiency. Certain bandwidth is required in the
background maintenance for BTS data transmission
Page57
Contents
4.1 Network capacity restriction factors
4.2 Typical capacity design methods
Page58
Erlang-B Formula (I)

Erlang-B formula is used for
estimating the peak traffic that
meets certain call loss rate when
the average traffic (Erlang) is given
Erlang-B formula is only used for
Circuit switched services
Single service
The WCDMA system provides CS

and PS domain multi-services
Page59
Erlang-B Formula (II)

The prerequisite of the Erlang-B is the requests of
resources take on a Poisson distribution, namely, its
variance is equal to its mean value
If, when a service establishes a link, the service requires
the resources which are more than the unit resources, the
resource request is no longer equal to its mean value, and
the Erlang-B formula is not applicable in this case
Comparison of multi-service capacity estimation methods :
Post Erlang-B
Equivalent Erlangs
Campbells Theorem
Page60
Post Erlang-B
By summing up the capacities
required for different services,
we obtain the capacities
required for the combined
services
No consideration of the
resource efficiency of different
services
Page61
Post Erlang-B (II)

Consider that two services share resources
Service 1: 1 unit resource/connection.12 Erlang
Service 2: 3 unit resources/connection.6 Erlang
Calculate capacity required for each service

Service 1: 12 Erlangs require 19 connections (19 unit
resources), meeting the 2% blocking rate
Service 2: 6 Erlangs require 12 connections (equivalent to the
36 unit resources of service 1), meeting the 2% blocking rate
Total 55 unit resources
Page62
Post Erlang-B (III)

Consider that two services use the same resources
Calculate capacity required for each service

Service 1: 12 Erlangs require 19 connections, meeting the 2%
blocking rate
Service 2: 6 Erlangs require 12 connections, meeting the 2%
blocking rate
Total 31 unit resources
However, the reasonable results should be: 18 Erlangs

require 26 connections for meeting the 2% blocking rate
Post Erlang-B overestimates

the capacity requirements!
Page63
Equivalent Erlangs (I)

By converting the bandwidth
from one service to another
service, combine different
services and then calculate the
required capacity
Selecting different services as
the measurement benchmark
will lead to different capacity
requirements
Page64
Equivalent Erlangs (II)

If using service 1 as measurement benchmark, the two services

are equivalent to 30 Erlangs in total
30 Erlangs require 39 connections (39 unit resources), meeting the 2%
blocking rate
If using service 2 as measurement benchmark, the two services

are equivalent to 10 Erlangs in total
10 Erlangs require 17 connections (equivalent to 51 unit resources of service
1), meeting the 2% blocking rate
The predication results
are not unique!
Page65
Campbells Theorem (I)

The Campbell theorem sets up a combined distribution
c =
Here:
(C
Capacity
ai)
OfferedTra
ffic =
Erlangs
ai
Erlangs
ai
ai is service amplitude, namely, the channel resources
required for a single link of the service.
is the mean value, v is the variance.
Page66
Campbells Theorem (II)

The system mean value is
v=
Erlangs a i = 12 12 + 6 3 2 = 66
The system variance is
Erlangsai =112+ 36 = 30
The capacity factor c is 1
c=
66
30
= 2.2
Page67
Campbells Theorem (III)

Combined traffic is:
30
OfferedTraffic = =
= 13.63
c 2.2
The number of connections for meeting the blocking rate of 2% is 21

For the target services that meet the same GoS, the capacity
required is (calculated on the basis of the unit resource of service 1)
Goal is service 1: C1 = (2.221) +1 =47
Goal is service 2: C2 = (2.221) +3 =49
For different services, the same GoS requires different capacities.

For the given capacity, the GoS of different services will differ slightly.
Page68
The comparison of the different

capacity method
Post Erlang-B
Service 1 (1 unit resource/connection, 12Erl) and service 2 (3 unit
resources / connection, 6Erl), requiring 55 unit resources in total
Equivalent Erlangs
Calculated according to benchmark of service 1 (1 unit
resource/connection, 12Erl), a total of 39 unit resources are required
Calculated according to benchmark of service 2 (3 unit
resources/connection, 6Erl), a total of 51 unit resources are required
Campbells Theorem
In the same conditions, 47~49 unit resources are required in total.
Page69
Summary of This Chapter

This chapter deals with the three methods of estimating the
multi-service capacity
The detailed process of using the Campbell theorem to
calculate the capacity is described
Page70
Contents
1. Traffic Model
Page71
Network estimation procedure

User density
Assumption of cell
load and carrier
number
Cell
radius
Cell
area
Number of user per

cell
Balance between capacity
Comparedimension
Yes
and coverage dimension ?
Uplink capacity dimension ,

downlink capacity
dimension
No
Service message
Adjustment of cell
load and carrier
number
Page72
over
Contents
1. Traffic Model
Page73
Transmission Diversity TxDiv

Txdiv has two types in
WCDMA system:
Open loop TxDiv
Closed loop TxDiv
TxDiv could improve downlink

capacity
Need additional amplifier
Need equipment support
Dont need additional antenna
Page74

Gain of TxDiv
The gain is obtained due to additional amplifier
Pure gain is obtained due to TxDiv technology
Page75

Gain of TxDiv
The gain is obtained due to
additional amplifier
Pure gain is obtained due to
TxDiv technology
TxDiv should reduce downlink
power
TxDiv should reduce
requirement of Eb/N0
Usually ,closed loop TxDiv
would obtain more gain than
open loop TxDiv
Page76

Transmission diversity can enhance the downlink capacity
and coverage
Conclusion of capacity enhancement of transmission
diversity
STTD mode: Capacity increase of 17 ~ 24%
TxAA(1) mode: Capacity increase of 16 ~ 23%
TxAA(2) mode: Capacity increase of 31 ~ 37%
Page77
Sectorization
In the dense urban areas and the normal urban areas with high
traffic, increasing sectors of the BTS is a method of improving the
capacity
6-sectors BTS generally use the antenna whose horizontal lobe is
33
The capacity of a 6-sector BTS is 1.67 times that of a 3-sector
BTS
The capacity of a 3-sector BTS is 2.77 times that of a omni- BTS
Page78
Thank you
www.huawei.com

03 OWJ100102 WCDMA Radio Network Capacity Planning (With Comment) ISSUE 1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

03 OWJ100102 WCDMA Radio Network Capacity Planning (With Comment) ISSUE 1

Uploaded by

Copyright:

Available Formats

WCDMA Radio

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

It is necessary to maintain the time relationship

between the information entities in the stream.

Small time delay tolerance, requiring data rate

Non real-time category

Typically unidirectional services, high requirements

on error tolerance, high requirements on data rate

Request-response mode, data integrity must be

maintained. High requirements on error tolerance,

low requirements on time delay tolerance

Data integrity should be maintained. Small delay

restriction, requiring correct transmission

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Objectives of Setting Up Traffic Model

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

The Contents of Traffic Model

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Typical Service Features Description

QoS requirements of the service

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

CS Traffic Model Parameters

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

PS Traffic Model Parameters

Packet Call Num/Session

Packet Size (bytes)

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

PS Traffic Model Parameters

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

PS User Behaviour Parameters

User Distribution (High, Medium, Low

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

PS User Behaviour Parameters

User Distribution (High, Medium, Low end)

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

PS Traffic Model Parameters

Data transmission time (s) The time in a single session of service

Holding Times Average duration of a single session of service

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

PS Traffic Model Parameters

Busy hour throughput per user (Kb):

PS throughput equivalent Erlang formula (Erlang)

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Uplink Interference AnalysisUplink

I TOT = I own + I other + PN

Noise floor of the receiver

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Uplink Interference AnalysisUplink

TKelvin temperature, normal temperature: 290 K

NF = 3dB (typical value of macro cell BTS)

Copyright 2006 Huawei Technologies Co., Ltd. All rights reserved.

Uplink Interference AnalysisUplink