Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Foreword
Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix
Capacity-Coverage-Quality
Capacity
Quality
Coverage
Capacity-Coverage-Quality
Capacity vs. Coverage
BLER Capacity
GoS Capacity
Interference
Quality
Coverage
Capacity-Coverage-Quality
Independence among Capacity, Coverage and Quality of GSM
System
Capacity-Coverage-Quality
Dependency among Capacity, Coverage and
Quality of WCDMA System
Capacity
Interference
Quality
Coverage
Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix
EIRP
Sensitivity of Receiver
Propagation Model
Maximum Path Loss
Antenna Height
Carrier Frequency
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
EIRP
Sensitivity of Receiver
Minimum Signal Strength
Edge Coverage Probability
Propagation Model
Margin
Gain
Loss
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
Cell Resource
Mixed Services
Service Traffic
Respective GoS
Campbells Theorem
Fractional Load
Capacity: C
Consumed Resource
services
Time
Knapsack?
What is the user state in the
Knapsack?
Which call will be blocked?
Which call can access the Knapsack?
Video Phone
n1
Voice
Video Phone
C - b1
n1
Voice
Video Phone
C - b2
n1
Voice
Campbells Theorem
Voice Call
Virtual Service
Campbells Theorem
Multi services one Virtual Service
Virtual Service Load
Virtual Service Traffic
How to Calculate? (Appendix)
Campbells Theorem
What is the advantage?
Fractional Load
Traffic for each service
Traffic/BH/Sub
Supported Subscribers
Consumed Resource
Fractional Load
Time
Fractional Load
What is the advantage?
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
Fractional Load
pessimistic
more NodeB sites
Campbells Theorem
uncertain
optimistic
e.g. 2% GoS for all services
Stochastic Knapsack
reasonable
Contents
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:
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
W / Rb
N S vi
1 f Eb / I 0
i 1
K
Single CS service
Defining:
N N S
P blocking
/ N /N!
N
n
n0 /u /n!
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
Pr[delayed ]
AN
N 1
A N N !(1 A / N ) ( A N / k!)
k 0
Pr[delay t ] Pr[delayed ] e
NA
t
H
Single PS service
Mean delay is:
D Pr[delayed ]
H
NA
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.
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:
Throughput
)
BearerRate 3600 ActivityFactor
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
(i )
i 1
(i )
i 1
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
mixed service
According to the preconcerted cell loading , the number
of virtual service channel N is:
N Ns
(1
f
)
A
virtual
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
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
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
E b /I 0
W/R b
1
1
M P ji
j2 P 1i
ki1 v i i c Pcongestion
c
Single CS service
Then:
W/R
N s P congestion c E b/Ib0 f
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
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
NA
t
H
Single PS service
Mean delay is:
D Pr[delayed ]
H
NA
S Rc
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,
mixed service
The traffic of specific service can be calculated as:
Throughput
)
BearerRate 3600 ActivityFactor
1
Ai
W /R
( Eb / N 0 ) i i
mixed service
m
Defining:
i 1
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
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
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 .
Further Simulation
Simulation Tool
Enterprise, etc
Outline
Radio Dimensioning Procedure
Radio Link Budget
Capacity Dimensioning
Appendix:
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 !
G( B k )
Bk ( n )
G( )
nB k
Campbells Theorem
A .Erlang
A .Erlang
2
Virtual Load
Avirtual
A .Erlang
j
Virtual Traffic
Aj
Erlang virtual
Avirtual
Campbells Theorem
Virtual service channels
N UL
UL
1 f . Avirtual
N DL
c
1
M
.
1
.
DL Avirtual f
Campbells Theorem
Supported Subscribers in the cell
Total Traffic in the Cell
Erlangvirtual
Interference Analysis
Uplink Interference Analysis
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
I own Pj
1
I other
i
I own
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
I TOT I TOT 1 i L j PN
1
I TOT PN
1
N
1 1 i L j
1
UL 1 i L j 1 i
1
1
1
W 1
EbNo j R j v j
PN
1
N
1 Lj
1 UL
Interference Analysis
I own ( j ) 1 j
PL j
PT PCCH PDCH ( j )
1
1
I other ( j ) PT
1 PLk , j
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
PT PCCH PDCH ( j )
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
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
PL j
PLk , j
ij
DL
PCCH
PT
PMAX PMAX
PDCH ( j )
j
PMAX