WCDMA Capacity Dimensioning

July 11, 2016

Foreword

WCDMA is intrinsical Interference limited system

Coverage and capacity depend on the interference
WCDMA is a Soft Capacity system

Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix

Stochastic Knapsack: Blocking Probability

Campbells Dimensioning Process
Interference Analysis

Capacity-Coverage-Quality

Capacity

Quality

Coverage

Dependence among Capacity, Coverage and Quality

Capacity-Coverage-Quality
Capacity vs. Coverage

Cell Load Coverage Range

Cell Load Subscribers

Capacity vs. Quality

BLER Capacity
GoS Capacity

Coverage vs. Quality

Capacit
y

Interference
Quality

Coverage

BLER Coverage Range

Capacity-Coverage-Quality
Independence among Capacity, Coverage and Quality of GSM
System

Capacity: Timeslots and Carriers available and Reuse Mode

Coverage Range: transmission Power on Uplink/Downlink (Link
Balance)
Quality of Call: be ensured by network design to minimize interference

In GSM system, capacity, coverage and quality requirements can

be met by independently analysis and design
Frequency Planning is a crucial issue to GSM system

Capacity-Coverage-Quality
Dependency among Capacity, Coverage and
Quality of WCDMA System

WCDMA system is interference-limited.

Capacity vs. Coverage
Increase intended system loading will offer more
capacity while increasing intra-cell interference and
thus reduce coverage range (Application: Cell
breathing)

Capacity vs. Quality

System capacity can be achieved by relaxing quality
requirement for some connections (Application:
Reduce BLER target value by outer-loop power
control)

Interference is the dominant

concern in capacity analysis

Coverage vs. Quality

Coverage range can be expanded by relaxing quality
requirement for some connections (Application: Slow
down data speed by AMRC to accommodate large
path loss)

Capacity

Interference
Quality

Coverage

Radio Dimensioning Procedure

Network dimensioning is an iterative process

Downlink analysis checks whether NodeB power is enough to cover the users

Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix

Stochastic Knapsack: Blocking Probability

Campbells Dimensioning Process
Interference Analysis

Radio Link Budget: Purpose

Calculate the Maximum Path Loss

EIRP
Sensitivity of Receiver

Minimum Required Signal Strength

Calculate the Cell Range

Propagation Model
Maximum Path Loss
Antenna Height
Carrier Frequency

Radio Link Budget: Sketch

BS Antenna Gain

Rx&Tx Cable Loss

Pro
pag
a

tion
Los
s

Penetration Loss

Body Loss

TRX

SBS Nth NF

Ec

No
Ec Eb
1
Spreading bandwidth

x
where PG
No No PG
User data rate

Radio Link Budget: Important Parameters

EIRP
Sensitivity of Receiver
Minimum Signal Strength
Edge Coverage Probability
Propagation Model
Margin
Gain
Loss

Radio Link Budget: Margin, Gain, Loss

Margins

Interference Margin
Slow Fading Margin
Fast Fading Margin

Gains

Antenna Gain
SHO Gain

Loss

Body Loss
Cable Loss
Penetration Loss

Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix

Stochastic Knapsack: Blocking Probability

Campbells Dimensioning Process
Interference Analysis

Capacity Dimensioning: Purpose

Estimate Supported Subscribers

Cell Resource
Mixed Services
Service Traffic
Respective GoS

Estimate Site Number

Site Number (Coverage)

Site Number (Capacity)

Capacity Dimensioning: Difficulties

Cell edge is continuously moving
according to the traffic load
Mixed services: multiple data rates
Respective GoS Requirement

Capacity Dimensioning: main methods

Stochastic Knapsack

Campbells Theorem
Fractional Load

Stochastic Knapsack: What is it ?

What is Knapsack ?
What is in the Knapsack ?
Knapsack for Uplink = ?
Knapsack for Downlink = ?

Stochastic Knapsack: Where is it from ?

a Multi Service Traffic Model
Used in ATM Multiplexer Dimensioning
Simulate the Respective GoS of the
Supported Services

Stochastic Knapsack: Introduced into WCDMA

Modified to WCDMA Air Interface Dimensioning (why)
Blocking Probabilities
Shared Resource
Simulate actual Traffic Behavior
Uplink Resource: Cell Load (why)
Downlink Resource: Power (why)

Stochastic Knapsack: Resource Shared

Resource Shared

Capacity: C

Consumed Resource

services

Time

Stochastic Knapsack: Example

Users States for 2 services
Voice Call

Video Phone Call

Knapsack?
What is the user state in the
Knapsack?
Which call will be blocked?
Which call can access the Knapsack?

Video Phone

Stochastic Knapsack: Example

Users States for 2 services
n2

n1
Voice

the user state if not calls arrive?

the user state if a voice call access?
the user state if a video phone call access?

Video Phone

Stochastic Knapsack: Example

n2

C - b1

n1
Voice

Two Services Blocking Prob. for Service

1the 4 states will be blocked for voice service.
Why?

Video Phone

Stochastic Knapsack: Example

n2

C - b2

n1
Voice

Two Services Blocking Prob. for Service

2 7 states will be blocked for video phone service. Why?
the

Stochastic Knapsack: Questions

What is the advantage?

What is the disadvantage?

Campbells Theorem
Voice Call

Virtual Service

Video Phone Call

Campbells Theorem
Multi services one Virtual Service
Virtual Service Load
Virtual Service Traffic
How to Calculate? (Appendix)

One Service Calculation

Erlang B Formula

Campbells Theorem
What is the advantage?

What is the disadvantage?

Fractional Load
Traffic for each service
Traffic/BH/Sub
Supported Subscribers

Channels needed for each service

GoS requirement
Erlang B

Fractional Load for each service

single link load
channels

Cell Load for all services

accumulate all the fractional load

Consumed Resource

Fractional Load

Time

Fractional Load
What is the advantage?

What is the disadvantage?

Comparison of the Methods

Stochastic Knapsack

Complicated
actual traffic behavior
resource shared
respective GoS for each service

Campbells Theorem
only one GoS for all services
can guarantee all the GoS requirements?

resource shared
easy to calculate

Fractional Load
resource not shared
easy to calculate

Comparison of the Methods

Dimensioning Result:
only one service
the same result (why)

Fractional Load
pessimistic
more NodeB sites

Campbells Theorem
uncertain
optimistic
e.g. 2% GoS for all services

Stochastic Knapsack
reasonable

Contents

Uplink capacity analysis

Downlink capacity analysis

Uplink capacity analysis

Single CS service
Single PS service
Mixed services

Single CS service
To single CS service, the uplink total received power
in BS can be calculated as:

meet Poisson arrival, and the mean value is:

Single CS service
I0

N0

I 0W
K

I 0W vi Eb Rb (1 f )

i 1

Then

1
K

v E R (1 f )

1
So

i 1

I 0W

v E
i 1

/ I 0 (1 f )

W / Rb

Single CS service
W / Rb
vi

(1 f ) Eb / I 0
i 1
K

The number of uplink channel supported by system with

corresponding uplink loading is:

W / Rb
N S vi

1 f Eb / I 0
i 1
K

Single CS service

Defining:

N N S

Then the soft-blocking formula based on interference of uplink is

P blocking

/ N /N!
N
n
n0 /u /n!

Uplink capacity analysis

Single CS service
Single PS service
Mixed services

Single PS service
PS service model

Single PS service
Then the soft-blocking formula based on interference
of uplink is

W / Rb
Ns

1 f Eb / I 0

Single PS service
Because the blocking characteristic of PS service is
determined by the acceptable delay, according to ErlangC
formula, defining the channel number: N

N S

the probability of call with delay can be calculated as:

Pr[delayed ]

AN
N 1

A N N !(1 A / N ) ( A N / k!)
k 0

So the probability with delay exceeding t(s) of any call is:

Pr[delay t ] Pr[delayed ] e

NA
t
H

Single PS service
Mean delay is:

D Pr[delayed ]

H
NA

Mean throughput of Uplink is

S Rb A
Here:A is the supported total traffic, N is the channel
number, H is the average duration per call of the service.

Uplink capacity analysis

Single CS service
Single PS service
Mixed services

mixed service
First, we assume these following variables :
the user number is X,
the number of service type is M,
the ration of other-cell to own-cell interference is f,
is the cell loading.

mixed service
The traffic of specific service can be calculated as:

Data _ Erlang ( Service Pr oportion ServicePenetration

Throughput
)
BearerRate 3600 ActivityFactor

The loading factor of one service per user can be

calculated as:

Ai

1
W / Rb
1
( Eb / N 0 )i i

mixed service
We convert all services to one virtual service and introduce
two variables C1 and C2:
M

C1 Avoice X voiceErl Adata ( i ) X dataErl

(i )
i 1

C 2 ( Avoice ) 2 X voiceErl ( Adata (i ) ) 2 X dataErl

(i )
i 1

And the loading factor of per virtual service is:

Avirtual

C2
C1

mixed service
Then the total traffic of virtual service that the cell can support
is:

VirtualErl

here

voiceErl
dataErl (i )
VirtualErl

C1
Avirtual

:traffic of voice service

:traffic of the ith type data

service
:traffic of the virtual service

mixed service
According to the preconcerted cell loading , the number
of virtual service channel N is:

N Ns

(1

f
)

A
virtual

Based on ErlangB formulary:

Then:

From VirtualErl

Pblocking

VirtualErl

N!

n0
N

n!

C1
we can get the number of users X.
Avirtual

mixed service
Then we can get the uplink data throughput rate per
carry as following formulary:
AverageThr oughputPerCarrier X Erlang i BearerRate i ActivityFactori
i

Contents

Uplink capacity analysis

Downlink capacity analysis

Downlink capacity analysis

Single CS service
Single PS service
Mixed services

Single CS service
The total received interference of a specific UE is:
M

I 0 W N 0 W P 1i P ji
j2

here, is non-orthogonal factor, P ji

is the total received power of

ith UE from jth site. Assuming the ratio of the dedicated power for
UEi to total power is:
Eb
I0

Then:

So:

E b /I 0
W/R b

i
i P 1i
M

N 0 W P 1i
P ji
j2

M P ji
j2 P 1i

RWb
N0 W
P 1i

Single CS service
Defining: NoiseRise

N 0 W P 1i

M
j2 P ji

N0W

the ratio of other-cell interference is f :

then:

E b /I 0
W/R b

1
1

M P ji
j2 P 1i

The following equation must be satisfied:

ki1 v i i c Pcongestion
c

is the power of common channels

Pcongestion is the corresponding power of RRM congestion threshold.

Single CS service
Then:

W/R

N s P congestion c E b/Ib0 f

Defining channel number:

From formula:

N N s

P blocking

/ N /N!
N
n
n0 /u /n!

Then we can get the downlink soft block traffic soft block
Erlang ,and the downlink throughput rate per carry is:
AverageThr oughputPerCarrier SoftBlockErlang BearerRate ActivityFactor

Downlink capacity analysis

Single CS service
Single PS service
Mixed services

Single PS service
The method of downlink single PS service capacity analysis is
similar with that of uplink:

N s P congestion c
Defining channel number:

and:

W/R b
E b /I 0

N N s

Single PS service
the probability of call with delay can be calculated by:
Pr[delayed ]

AN
N 1

A N !(1 A / N ) ( A N / k!)
N

k 0

So the probability with delay exceeding t(s) of any call is:

Pr[delay t ] Pr[delayed ] e

NA
t
H

Single PS service
Mean delay is:

D Pr[delayed ]

H
NA

Mean throughput of Uplink is

S Rc

Here: A is the supported total traffic, N is the channel

number, H is the average duration per call of the service.

Downlink capacity analysis

Single CS service
Single PS service
Mixed services

mixed service
First, we assume these following variables :
the user number is X,
the number of service type is M,

is the non-orthogonal factor,

the ration of other-cell to own-cell interference is f,
is the downlink cell loading.

mixed service
The traffic of specific service can be calculated as:

Data _ Erlang ( Service Pr oportion ServicePenetration

Throughput
)
BearerRate 3600 ActivityFactor

The loading factor of one service per user can be

calculated as:

1
Ai
W /R
( Eb / N 0 ) i i

mixed service
m

Defining:

C1 Avoice X voiceErl Adata (i ) X dataErl (i )

i 1

C 2 ( Avoice ) X voiceErl ( Adata (i ) ) 2 X dataErl (i )

2

i 1

And the loading factor of per virtual service is:

Avirtual

C2
C1

Then the total traffic of virtual service that the cell can support
is:

C1
VirtualErl
Avirtual

mixed service
According to the preconcerted cell loading , the number
of virtual service channel N is:
N [ Ns ] [

]
(1 c ) ( f ) Avirtual

Based on ErlangB formulary:

Then:

From VirtualErl

P blocking

/ N /N!
N
n
n0 /u /n!

VirtualErl

C1
we can get the number of users X.
Avirtual

mixed service
Then we can get the downlink data throughput rate
per carry as following formulary:
AverageThr oughputPerCarrier X Erlang i BearerRate i ActivityFactori
i

Capacity dimension input

According to the demand of traffic and terrain
characteristic, distinguish the planning region into
different areas, like as dense urban, urban, suburban,
rural and so on.
Different propagation models for areas.
Different user numbers and traffic models for each area.
The demands of QOS and GOS for each service and
area.
The carry demand for each area, one, two or more
carriers.

Capacity dimension
According to the above inputs of capacity dimension, we
can get the number of site and site configuration based
on capacity demands.
Comparing the dimension result of capacity with that of
coverage, the limited result is proposed .

Rough Dimensioning Result

a Rough Dimensioning Result
a flat and homogenous landscape
Digital database (Heights, Clutters, Vectors)

the propagation model

simple propagation laws

the actual traffic behavior

regular hexagon pattern
traffic growth expectation
uniform traffic demand
homogeneous interference

Further Simulation
Simulation Tool
Enterprise, etc

Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix:

Stochastic Knapsack: Blocking Probability

Campbells Dimensioning Process
Interference Analysis

Stochastic Knapsack: Blocking Probability

State Probability:
n

1
K a k
a2 2
aK K
1 a1
1
( n ) G( )

G( ) k
k 1 n !
n1 ! n2 !
nK !
k

a1 1 a 2 2
aK K
G( )

n2 !
nK !
n n1 !

k : the traffic of service k

nk

: the connecting users of service k

Stochastic Knapsack: Blocking Probability

Blocking Probabilities:

G( B k )
Bk ( n )
G( )
nB k

Bk : the blocking probability for service k

Bk : the blocked state for service k

Campbells Theorem

A .Erlang

A .Erlang
2

Virtual Load

Avirtual

A .Erlang
j

Virtual Traffic

Aj

Erlang virtual

Avirtual

: the load of a single user for service j

Erlang j : busy hour traffic of a single user for service j

Campbells Theorem
Virtual service channels

N UL

UL

1 f . Avirtual

N DL

c
1
M
.
1
.

DL Avirtual f

Total Traffic: using Erlang B Formula

Campbells Theorem
Supported Subscribers in the cell
Total Traffic in the Cell
Erlangvirtual

Interference Analysis
Uplink Interference Analysis

Downlink Interference Analysis

Uplink Interference Analysis

I TOT I own I other PN

Iown interference caused by users of own cell
Iother interference caused by users of other cells
PN

equivalent noise input of the receiver

Uplink Interference Analysis

Noise power of receiver: PN
PN = 10lg(KTW) NF
K: Boltzmann Constant = 1.3810-23 J/K
T: temperature in degrees Kelvin
W: Bandwidth of signal 3.84MHz for WCDMA
NF: Noise figure of receiver
And
10lg(KTW) = -108dBm/3.84MHz
NF = 3dB (typical value for Marco-cell)
PN = 10lg(KTW) + NF = -105dBm/3.84MHz

Uplink Interference Analysis

Iown : Own-cell interference

Interference should be overcome by each user: ITOT - Pj

Pj : desired signal power from user j received by NodeB

With perfect power control:

EbNo j

I TOT

W 1

Pj R j v j

Pj can be estimated by
Pj

Pj

I TOT
1
W 1
1

EbNo j R j v j

Own-cell interference: totally received power from all users

of own cell:
N

I own Pj
1

Uplink Interference Analysis

Iother : Other-cell interference

Difficult to analyze theoretically, and depends on user

distribution, cell position, antenna patterns and so on

Definition of i, the ratio of other-cell to own-cell

interference

I other
i
I own

Uplink Interference Analysis

N

I TOT I own I other PN (1 i ) I own PN 1 i Pj PN

1

1 i
1

I TOT
PN
1
W 1
1

EbNo j R j v j

Define:

Lj

1
1

1
W 1

EbNo j R j v j

The total interference can be estimated:

N

I TOT I TOT 1 i L j PN
1

Uplink Interference Analysis

Then:

I TOT PN

1
N

1 1 i L j
1

Defining uplink load factor:

N

UL 1 i L j 1 i

1
1

1
W 1

EbNo j R j v j

ITOT reaches infinity while load factor equals 1

Uplink Interference Analysis

Noise Figure defined as follows:
I TOT
NoiseRise

PN

1
N

1 Lj

1 UL

50% load 3dB

60% load 4dB
75% load 6dB

Interference Analysis

Uplink Interference Analysis

Downlink Interference Analysis

Downlink Interference Analysis

I TOT I own I other PN

Iown: Interference from BS of own cell
Iother: Interference form BSs of other cells
PN: Equivalent noise input of the receiver

Downlink Interference Analysis

Iown : Own-cell interference

Individual channel distinguished by orthogonal OVSF code. The

orthogonality between channels can be achieved in static propagation
environment without multipath. Then there is no interference over each
other in downlink.
In multipath environment, not all paths of signal transmitted for a
channel can be applied by RAKE and some energy adds to
interference. It can be modeled by the introduction of orthogonal
factor :
P

I own ( j ) 1 j

PL j

in the formula above, PT is the total power transmitted by BS,

including power of common
channels and dedicated channels
N

PT PCCH PDCH ( j )
1

Downlink Interference Analysis

Iother : Other-cell interference

Signals transmitted by BSs of other cells can cause

interference over the target cell. Due to different
scrambling codes, these signals are not orthogonal with
those of the target cell.

Assuming uniformly distributed service and equal

powers transmitted by all BSs, if there are K of other
cells and the path loss from Kth BS to user j is PLk,j,
then:
K

1
I other ( j ) PT
1 PLk , j

Downlink Interference Analysis

I TOT I own I other PN
K
PT
1
1 j
PT
PN
PL j
1 PLk , j

With perfect power control, there is

PDCH ( j ) / PL j W 1
EbNo( j )

I TOT ( j )
Rj v j
The required transmission power of DCH for user j is

PDCH ( j ) EbNo j

Rj
W

v j I TOT ( j ) PL j

Downlink Interference Analysis

Since

PT PCCH PDCH ( j )
1

Total transmission power can be estimated as follows:

Rj

PT PCCH EbNo( j ) v j I TOT ( j ) PL j

W
1

N
K

Rj

PT
1
PCCH EbNo( j ) v j PL j 1 j
PT
PN
W
PL j
1
1 PLk , j

N
K PL

Rj
j
PCCH EbNo( j ) v j 1 j PT PT
PN PL j
W
1
1 PLk , j

Downlink Interference Analysis

PT can be resolved as follows:
N

Rj

PCCH PN EbNo( j ) v j PL j
W
1

PT
N
Rj

1 1 j i j EbNo( j ) v j
W
1

ij is the ratio of other-cell to own-cell interference for

user j. and it is defined as follows:
K

PL j

PLk , j

ij

Downlink Interference Analysis

Downlink load factor

defined in common as the ratio of total transmission

power to maximal transmission power of the BS.

DL

PCCH
PT

PMAX PMAX

PDCH ( j )
j

PMAX

The ratio of PCCH to PMAX is about 20%.