ASSET3g Technical Reference Guide

ASSET3g
Technical Reference Guide

Version 5.1
Copyright 2006 AIRCOM International Ltd

All rights reserved
ADVANTAGE, AIRCOM, ARRAY WIZARD, ASSET3g, CONNECT, DATASAFE,
ENTERPRISE, NEPTUNE, OPTIMA, QUALITA, RANOPT, TARGET and
WEBWIZARD are recognised trademarks of AIRCOM International.
Microsoft Word, Microsoft Office, Windows, Windows 95, Windows 98,
Windows NT, Windows XP and MS-DOS are trademarks of the Microsoft
Corporation.
Other product names are trademarks of their respective companies.
This documentation is protected by copyright and contains proprietary and
confidential information. No part of the contents of this documentation may be
disclosed, used or reproduced in any form, or by any means, without the prior
written consent of AIRCOM International.
Although AIRCOM International has collated this documentation to reflect the
features and capabilities supported in the software products, the company makes no
warranty or representation, either expressed or implied, about this documentation,
its quality or fitness for particular customer purpose. Users are solely responsible for
the proper use of ENTERPRISE software and the application of the results obtained.
An electronic version of this document exists on our website.
This Technical Reference Guide finalised on 8 March 2006.
Refer to the Online Help for more information.
This Technical Reference Guide prepared by:
AIRCOM International Ltd
Grosvenor House
65-71 London Road
Redhill
Surrey RH1 1LQ
ENGLAND
Telephone:
Support Hotline:
Fax:
Web:
+44 (0) 1737 775700

+44 (0) 1737 775777
+44 (0) 1737 775770
http://www.aircom.co.uk
Can You Improve

Our User Assistance?
Do the Help and User Reference Guides Help You?

AIRCOM is always working to improve the online Help and User Reference Guides
for our products, so that your job is easier to do.
Even if you would not normally do so, please take a look at the Help or User
Reference Guide next time you are unsure of how to do something and if you have
any comments or questions that could help us improve them, please email us on:
docs@aircom.co.uk.
We highly value your comments, suggestions, and criticisms. If you did not find the
user assistance you were looking for, needed more assistance than the online help or
user reference guides provided, or have any suggestions for future improvements to
our information, we want to know.
Specifically, consider:
Is the information accurate and complete?
Is the information helpful does it answer your question about the program ?
Are there any words that you would like to be put into the index ?
Contents
Appendix A Array Descriptions
Arrays (Simulator)
Pathloss Arrays
Pilot Coverage Arrays
Handover Arrays
Uplink Noise Arrays
Downlink Noise Arrays
Uplink Coverage Arrays
Downlink Coverage Arrays
Coverage Balance Arrays
Soft Blocking Arrays
Hard Blocking Arrays
HSDPA Arrays
All Servers Array
Arrays (5.0 Simulator)

3g Service Arrays (5.0 Simulator)
3g Carrier Arrays (5.0 Simulator)
GSM Arrays (5.0 Simulator)
2g and 2.5g (Non-Sim) Arrays

Coverage and Interference Arrays (2g + 2.5g) (Non-Sim)
1
3
3
6
7
7
8
9
10
10
11
12
14
15
15
23
27
29
29
Appendix B 2g and 2.5g Algorithms

Interference Table Algorithm
39
Interference and Connection Array Calculations
40
Worst Connection Array Calculation Method

Average Connection Array Calculation Method
Worst Interferer Array Calculation Method
Total Interference Array Calculation Method
Table of Default C/I BER Conversion Values
41
42
43
43
44
Frequency Hopping Algorithms
45
Synthesised Hopping Algorithm
46
Non-Frequency Hopping Algorithms
47
Automatic Frequency Planning (ILSA)
48
The Cost Function of the ILSA Algorithm
48
MAIO Planning Cost Function
49
GPRS and HSCSD Capacity Calculations
50
TRX Requirement - Circuit Switched Traffic and HSCSD

TRX Requirement - Circuit Switched, HSCSD and GPRS Traffic
Grade of Service and Data Rate
Channel Occupation Table
50
50
51
52
FCC Calculations
53
Frequency Calculations
54
ASSET3g Technical Reference Guide

Version 5.1
Page i
Appendix C UMTS Algorithms

Notation for UMTS
58
List of Principal Symbols for UMTS
58
UMTS Basic Formulae
60
UMTS Uplink Noise Rise
61
UMTS Uplink Load
61
UMTS Frequency Re-Use Efficiency
61
UMTS Air Interface and User Bitrates
61
UMTS Shadow Fade Modelling
62
UMTS Power Control Error Modelling
62
UMTS Service Activity Modelling
63
UMTS Activity Factor Calculation For Packet Services (Web Model)
64
UMTS Transmit/Receive Diversity Modelling
64
UMTS Terminal Speed Modelling
65
UMTS Overview of a Snapshot
65
UMTS Initialisation of Terminals

Initialisation of System Powers and Resource Usage in UMTS
UMTS Iterations
Gathering of Results in UMTS
66
66
66
68
UMTS Scenario Prioritisation
68
UMTS Connection Evaluation
69
Production of a Candidate Active Set in UMTS

UMTS Uplink Evaluation
UMTS Downlink Evaluation
69
70
72
UMTS Blocking Probability
73
Calculation of Blocking Probability in the Blocking Report for UMTS

Blocking Probability and Failure Rate for UMTS
UMTS Coverage Probability Array in the Map View
73
74
75
Appendix D CDMA2000 Algorithms
Page ii
CDMA2000 Notation
78
List of Principal Symbols for CDMA2000
78
CDMA2000 Basic Formulae
80
CDMA2000 Uplink Noise Rise
81
CDMA2000 Uplink Load
81
CDMA2000 Frequency Re-Use Efficiency
81
CDMA2000 Air Interface and User Bitrates
82
CDMA2000 Shadow Fade Modelling
82
CDMA2000 Power Control Error Modelling
83
CDMA2000 Service Activity Modelling
83

Version 5.1
CDMA2000 Activity Factor Calculation For Packet Services (Web Model)
84
CDMA2000 Transmit/Receive Diversity Modelling
85
CDMA2000 Terminal Speed Modelling
85
PN Code Assignment Algorithm for CDMA2000
86
Difficulty Factor for CDMA2000

Best PN Code to Assign for CDMA2000
Quality Factor for CDMA2000
CDMA2000 Overview of a Snapshot

CDMA2000 Initialisation of Terminals
Initialisation of System Powers and Resource Usage in CDMA2000
CDMA2000 Iterations
Gathering Of Results in CDMA2000
86
86
86
87
87
88
88
89
CDMA2000 Scenario Prioritisation
90
CDMA2000 Connection Evaluation
91
Production of a Candidate Active Set in CDMA2000

CDMA2000 Uplink Evaluation
Calculation of Equivalent Control Overhead Factors for CDMA2000

Uplink RC1 - RC2
Uplink RC3 - RC6 When Using a Supplemental Bearer
Uplink RC3 - RC6 When Not Using a Supplemental Bearer
Downlink RC1 - RC2
Downlink RC3 - RC10
CDMA2000 Blocking Probability

Calculation of Blocking Probability in the Blocking Report for CDMA2000
CDMA2000 Blocking Probability and Failure Rate
CDMA2000 Coverage Probability Array in the Map View Window
CDMA2000 Downlink Evaluation
91
92
93
94
95
96
97
98
99
99
100
101
102
Appendix E HDR Algorithms

HDR Notation
106
List of Principal Symbols for HDR
106
HDR Basic Formulae
108
HDR Uplink Noise Rise
108
HDR Uplink Load
109
HDR Frequency Re-Use Efficiency
109
HDR Air Interface and User Bitrates
109
HDR Shadow Fade Modelling
109
HDR Power Control Error Modelling
110
HDR Service Activity Modelling
111
HDR Transmit/Receive Diversity Modelling
111
HDR Terminal Speed Modelling
111
Overview of a HDR Snapshot
112
HDR Initialisation of Terminals

HDR Initialisation of System Powers
HDR Iterations
Version 5.1
112
112
113
Page iii
Gathering of Results for HDR
114
Scenario Prioritisation for HDR
115
HDR Connection Evaluation
115
HDR Uplink Evaluation

HDR Downlink Evaluation
116
117
Calculation of Uplink Equivalent Control Overhead Factor for HDR
118
HDR Coverage Probability and Blocking
119
HDR Coverage Probability Array in the Map View Window

HDR Blocking Probability and Failure Rate
About the HDR Quality of Service Algorithm
119
119
120
HDR Outline
IP Packet Transmission Time for HDR
IP Packet Queueing Delay for HDR
Throughput for HDR
120
121
122
124
Appendix F Packet Quality of Service Algorithms

Simulation Inputs for QoS Analysis
126
Preliminary Tests
126
Traffic Generator for QoS Analysis
126
Matching Generated Traffic to the Simulator's Mean Number of Served Users

WWW Traffic Model
Packet Model
About the Code Schemes for GPRS
QoS Profiles for GPRS
Time Simulator for QoS Analysis
134
System Model for QoS Analysis

Simulation Model for QoS Analysis
134
134
Results of QoS Analysis
136
Confidence Interval Half Width

Simulation Duration
Delay and Cumulative Delay Probability Distributions
Mean and Standard Deviations of the Queuing Delays
95th Percentile Delay
Mean Transmission Time
Mean Retransmission Delay
References
136
137
138
139
139
139
140
140
Glossary of Terms
Index
Page iv
127
128
129
130
131

Version 5.1
APPENDIX A
Array Descriptions
This section describes the different types of array available in ASSET3g. The ranges of
arrays available may vary according to which technology you are using, which
licences you have, and which processes you have chosen to run.
The following types of array are described:
Arrays (Simulator)
3g Service arrays (5.0 Simulator)
3g Carrier arrays (5.0 Simulator)
GSM arrays (5.0 Simulator)
Coverage/Interference arrays (2g, 2.5g and LMU) (Non-Sim)
For information on creating and displaying arrays, see Using Arrays in the ASSET3g
User Reference Guide.
In This Section
Arrays (Simulator)
Arrays (Simulator)
This is an overview of the arrays generated by the Simulator in ASSET3g.
All these arrays are produced on a per carrier basis.
Most of them have a dependency on terminal type because body loss and terminal
antenna gain are always included in the link budget.
Many of them depend on whether the terminal is considered to be indoor or outdoor.
Indoor arrays use the in-building parameters for the clutter type at each pixel (that is,
indoor loss and indoor shadow fading standard deviation). Indoor terminals are
always taken to be slow moving.

Version 5.1
Page 1
Coverage arrays can be displayed even if no snapshots have been run, but you should
note that in these circumstances the arrays represent coverage in an unloaded
network. To obtain coverage arrays for a loaded network, you must run some
snapshots. The key purpose of running snapshots is to provide measures of system
load.
Arrays for coverage tend to have a weak dependence on the number of snapshots run,
and the arrays change little after a relatively small number of snapshots have been
performed (10s of snapshots in most cases). This is because only a small number of
snapshots are needed to get an idea of the average noise rise and average DL traffic
power on each cell.
Arrays for hard or soft blocking probabilities have a strong dependence on the
number of snapshots run. This is because blocking is evaluated by reporting the
proportion of snapshots that would block further connections. For example, if only 1
snapshot has been run, then all blocking probabilities will be either 0% or 100%. If 5
snapshots have been run then all blocking probabilities will belong to the set {0%,
20%, 40%, 60%, 80%, 100%}.
Here is an example of the arrays you can generate on the Map View when using the
Simulator:
Example of the Simulator arrays appearing in the Map View Data Types
Page 2

Version 5.1
Pathloss Arrays
DL Loss
Dependencies: Terminal, Carrier, Indoor
The lowest downlink loss. Represents average values and is therefore calculated with
fades of 0dB.
Nth DL Loss
The Nth lowest downlink loss. Represents average values and is therefore calculated
with fades of 0dB.
Pilot Coverage Arrays

These arrays all provide information on pilot levels and coverage probabilities. There
are 3 types of quantity relating to the pilot (RSCP, Ec/Io, SIR) and there are arrays for
all of these.
Best DL Cell by RSCP
Dependencies: Carrier
This is the cell that provides the highest RSCP for the terminal.
Best RSCP
Dependencies: Carrier, Indoor
The highest RSCP level. Represents average values and is therefore calculated with
fades of 0dB.
Nth Best RSCP
Dependencies: Carrier, Indoor
The Nth highest RSCP level. Represents average values and is therefore calculated
with fades of 0dB.
RSCP Coverage Probability
This is the probability that the Best DL Cell (by RSCP) satisfies the RSCP requirement
specified on the terminal type. This probability depends on the standard deviation of
shadow fading for the clutter type at the pixel. If this standard deviation has been set
to zero, then there are only three possible coverage probabilities: 0% if the
requirement is not satisfied, 50% if the requirement is satisfied exactly, and 100% if
the requirement is exceeded.

Version 5.1
Page 3
RSCP Coverage OK
This is a thresholded version of the RSCP Coverage Probability array and has just 2
values (Yes/No). It has the advantage of being quicker to calculate than the RSCP
Coverage Probability array. A value of Yes means that the RSCP coverage
probability meets the coverage reliability level specified in the Sim Display Settings
tab of the Array Settings dialog box.
Number of RSCP OK
This is the number of covering cells with a satisfactory RSCP. A cell is counted as
having a satisfactory RSCP if its RSCP coverage probability meets the coverage
reliability level specified in the Sim Display Settings tab of the Array Settings dialog
box.
Pilot Ec/Io & Nth Best Pilot Ec/Io
These are the highest (and Nth highest) Ec/Io values. They represent average values
and are therefore calculated with fades of 0dB.
Pilot Ec/Io Coverage Probability
This is the probability that the Best DL Cell (by RSCP) satisfies the Ec/Io requirement
specified on the terminal type. This probability depends on the standard deviation of
shadow fading for the clutter type at the pixel. If this standard deviation has been set
to zero, then there are only three possible coverage probabilities: 0% if the
requirement is not satisfied, 50% if the requirement is satisfied exactly, and 100% if
the requirement is exceeded.
Pilot Ec/Io Coverage OK
This is a thresholded version of the Pilot Ec/Io Coverage Probability array and has
just 2 values (Yes/No). It has the advantage of being quicker to calculate than the
Pilot Ec/Io Coverage Probability array. A value of Yes means that the pilot Ec/Io
coverage probability meets the coverage reliability level specified in the Sim Display
Settings tab of the Array Settings dialog box.
Page 4

Version 5.1
Number of Pilot Ec/Io OK

This is the number of covering cells with a satisfactory pilot Ec/Io. A cell is
considered as having a satisfactory pilot Ec/Io if its pilot Ec/Io coverage probability
meets the coverage reliability level specified in the Sim Display Settings tab of the
Array Settings dialog box.
Pilot SIR
This is the best Pilot SIR value. It represents an average value and is therefore
calculated with fades of 0dB.
Pilot SIR Coverage Probability
This is the probability that the Best DL Cell (by RSCP) satisfies the pilot SIR
requirement specified on the terminal type. This probability depends on the standard
deviation of shadow fading for the clutter type at the pixel. If this standard deviation
has been set to zero, then there are only three possible coverage probabilities: 0% if
the requirement is not satisfied, 50% if the requirement is satisfied exactly, and 100%
if the requirement is exceeded.
Pilot SIR Coverage OK
This is a thresholded version of the Pilot SIR Coverage Probability array and has just 2
values (Yes/No). It has the advantage of being quicker to calculate than the Pilot SIR
Coverage Probability array. A value of Yes means that the pilot SIR coverage
Number of Pilot SIR OK
This is the number of covering cells with a satisfactory pilot SIR. A cell is considered
as having a satisfactory pilot SIR if its pilot SIR coverage probability meets the
coverage reliability level specified in the Sim Display Settings tab of the Array
Settings dialog box.

Version 5.1
Page 5
Handover Arrays
The aim of the following arrays is to provide the planner with an idea of potential
handover areas, and to indicate areas of pilot pollution. All arrays are based on mean
Pilot Ec/Io levels calculated with fades of 0dB.
Available Soft/Softer Cells
This is the number of suitable HO candidates for the Best DL Cell (by RSCP). If the
Ec/Io level of the best DL cell is below the Ec/Io requirement on the terminal type,
then no result is given. Otherwise all the other cells are checked to see if their pilot
Ec/Io levels make them suitable HO candidates.
Available Soft Cells
This is the number of suitable soft HO candidates for the Best DL Cell (by RSCP). If
the Ec/Io level of the best DL cell is below the Ec/Io requirement on the terminal
type, then no result is given. Otherwise all the other cells (on different sites to the best
cell) are checked to see if their pilot Ec/Io levels make them suitable HO candidates.
Available Softer Cells
This is the number of suitable softer HO candidates for the Best DL Cell (by RSCP). If
the Ec/Io level of the best DL cell is below the Ec/Io requirement on the terminal
type, then no result is given. Otherwise all the other cells (on the same site as the best
cell) are checked to see if their pilot Ec/Io levels make them suitable HO candidates.
Active Set Size
This is the potential size of the active set. It is related to the Available Soft/Softer Cells
array by: Active Set Size = min (1 + Available Soft/Softer Cells, Max Active Set Size).
Pilot Polluters
If the Pilot Pollution Threshold specified in the Simulation Wizard is XdB then:
For UMTS, the number of pilot polluters at a location is the number of cells that are
not in the active set, but provide an Ec/Io level within XdB of the best Ec/Io in the
active set. Therefore the pilot pollution threshold in UMTS is a relative quantity.
A typical threshold value for UMTS is 6dB.
For CDMA2000, the number of pilot polluters at a location is the number of cells that
are not in the active set, but provide an Ec/Io level higher than XdB. Therefore the
pilot pollution threshold in CDMA2000 is an absolute quantity.
A typical threshold value for CDMA2000 is -15dB.
Page 6

Version 5.1
Uplink Noise Arrays

UL Load
This is the uplink cell load of the Best DL Cell (by RSCP). Note that for OTSR cells,
there can be a different uplink load on each antenna used by the cell (just as in the
uplink simulation reports for OTSR cells).
UL FRE
This is the uplink frequency re-use efficiency of the Best DL Cell (by RSCP). Note that
for OTSR cells, there can be a different uplink FRE on each antenna used by the cell
(just as in the uplink simulation reports for OTSR cells).
Downlink Noise Arrays

DL Io
This is the total downlink power spectral density. It represents an average value and
is therefore calculated with fades of 0dB.
DL Iother/Iown
This is the ratio of downlink power received from other cells, to downlink power
received from own cell, where own cell is the Best DL Cell (by RSCP).
DL FRE
This is the downlink frequency re-use efficiency at a pixel and it is related to DL
Iother/Iown as follows:
DL FRE = 1 / ( 1 + Iother/Iown ).

Version 5.1
Page 7
Uplink Coverage Arrays

Uplink coverage arrays are available for each bearer at different speeds.
Best UL Cell
Dependencies: Terminal, Carrier, Indoor, Service, UL Bearer, Speed
This is the cell requiring the minimum uplink transmit power. For UMTS bearers, the
only real dependence is on the carrier used. However for CDMA2000 bearers, the
Best UL Cell must have an RC type that is supported by the terminal type.
UL Eb/No Margin
This is how much we exceed the uplink Eb/No requirement by on the Best UL Cell,
assuming the terminal transmits at full power.
UL Coverage Probability
This is the probability of satisfying the uplink bearer Eb/No requirement on the Best
UL Cell, assuming the terminal transmits at full power. This probability depends on
the standard deviation of shadow fading for the clutter type at the pixel. If this
standard deviation has been set to zero, then there are only three possible coverage
probabilities: 0% if the requirement is not satisfied, 50% if the requirement is satisfied
exactly, and 100% if the requirement is exceeded.
UL Coverage Probability OK
This is a thresholded version of the UL Coverage Probability array and has just 2
values (Yes/No). It has the advantage of being quicker to calculate than the UL
Coverage Probability array. A value of Yes means that the uplink coverage
Achievable UL Bearer
Dependencies: Terminal, Carrier, Indoor, Service, Speed
The purpose of this array is to provide a composite coverage plot for the uplink
bearers of a service. The array shows the highest priority uplink bearer with
acceptable uplink coverage, that is, with UL Coverage Probability meeting the
Page 8

Version 5.1
Downlink Coverage Arrays

Downlink coverage arrays are available for each bearer at different speeds.
Best DL Cell
Dependencies: Terminal, Carrier, Indoor, Service, DL Bearer, Speed
This is the cell requiring the minimum downlink transmit power. For UMTS bearers,
the only real dependence is on the carrier used, and so this array is exactly the same
as the Best DL cell by RSCP. However for CDMA2000 bearers, the Best DL Cell must
have an RC type that is supported by the terminal type.
DL Eb/No Margin
This is how much the downlink Eb/No requirement has been exceeded, assuming
that the link powers of cells in the active set are at maximum allowed levels.
DL Coverage Probability
This is the probability of satisfying the downlink bearer Eb/No requirement,
assuming that the link powers of cells in the active set are at maximum allowed levels.
This probability depends on the standard deviation of shadow fading for the clutter
type at the pixel. If this standard deviation has been set to zero, then there are only
three possible coverage probabilities: 0% if the requirement is not satisfied, 50% if the
requirement is satisfied exactly, and 100% if the requirement is exceeded.
DL Coverage Probability OK
This is a thresholded version of the DL Coverage Probability array and has just 2
values (Yes/No). It has the advantage of being quicker to calculate than the DL
Coverage Probability array. A value of Yes means that the downlink coverage
Achievable DL Bearer
The purpose of this array is to provide a composite coverage plot for the downlink
bearers of a service. The array shows the highest priority downlink bearer with
acceptable downlink coverage, that is, with DL Coverage Probability meeting the

Version 5.1
Page 9
Coverage Balance Arrays

Coverage Balance
The purpose of this array is to provide a composite uplink/downlink coverage plot
for a service. The uplink is deemed to have coverage if any of the uplink bearers on
the service have UL Coverage Probability meeting the coverage reliability level
specified in the Sim Display Settings tab of the Array Settings dialog box. Similarly,
the downlink is deemed to have coverage if any of the downlink bearers on the
service have DL Coverage Probability meeting the coverage reliability level specified
in the Sim Display Settings tab of the Array Settings dialog box.
Soft Blocking Arrays

UL Soft Blocking Probability
This is the probability of uplink soft blocking on the Best UL Cell. Uplink soft
blocking occurs if an additional connection with the uplink bearer would cause the
noise rise limit to be exceeded. The uplink soft blocking probability is determined by
examining the proportion of snapshots that would block a connection with the uplink
bearer in this way. Note that for OTSR cells, the noise rise is measured on a per
antenna basis (as in the simulation reports), so the soft blocking probability depends
on the antenna that covers the pixel.
DL Soft Blocking Probability
This is the probability of downlink soft blocking on the Best DL Cell. Downlink soft
blocking occurs if an additional connection with the downlink bearer requires more
power than is available on the cell. The downlink soft blocking probability is
determined by examining the proportion of snapshots that would block a connection
with the downlink bearer in this way.
Page 10

Version 5.1
Hard Blocking Arrays

There a two types of hard blocking arrays for each uplink and downlink resource
type. The exception is the HSDPA resource type used to represent HSDPA codes. This
does not have a primary blocking array because there are no primary limits for
HSDPA codes.
Hard Blocking Probability
Dependencies: Terminal, Carrier, Indoor, Service, Bearer, Speed
This is the probability of hard blocking on the Best DL Cell because of lack of
resources. This type of blocking occurs if an additional connection with the bearer
requires more resources than are available. The blocking probability is determined by
examining the proportion of snapshots that would block a connection with the bearer
in this way.
Hard Blocking Probability Primary
Dependencies: Terminal, Carrier, Indoor, Service, Bearer, Speed
This is the probability of hard blocking on the Best DL Cell because of lack of primary
resources. This type of blocking occurs if an additional connection with the bearer
requires more primary resources than are available. The blocking probability is
determined by examining the proportion of snapshots that would block a connection
with the bearer in this way.

Version 5.1
Page 11
HSDPA Arrays
HSDPA - Best DL Cell by SINR
This is the cell that provides the highest SINR level for the terminal.
HSDPA - SINR
This is the highest SINR level. It represents an average value and is therefore
calculated with fades of 0dB.
HSDPA - DL Eb/No Margin
Dependencies: Terminal, Carrier, Indoor, Service, HSDPA Bearer, Speed
This is the extent to which the Eb/No requirement of the HSDPA bearer is exceeded.
The cell of interest is chosen by examining the SINR levels of cells that support the
HSDPA bearer, and choosing the cell with the largest level.
HSDPA - DL Coverage Probability
This is the probability of satisfying the Eb/No requirement of the HSDPA bearer. The
cell of interest is chosen by examining the SINR levels of cells that support the
HSDPA bearer, and choosing the cell with the largest level. The probability depends
on the standard deviation of shadow fading for the clutter type at the pixel. If this
standard deviation has been set to zero, then there are only three possible coverage
probabilities: 0% if the requirement is not satisfied, 50% if the requirement is satisfied
exactly, and 100% if the requirement is exceeded.
HSDPA - DL Coverage Probability OK
This is a thresholded version of the HSDPA - DL Coverage Probability array and has
just 2 values (Yes/No). It has the advantage of being quicker to calculate than the
HSDPA - DL Coverage Probability array. A value of Yes means that the coverage
HSDPA - Achievable DL Bearer
The purpose of this array is to provide a composite coverage plot for the HSDPA
bearers of a service. The array shows the highest priority HSDPA bearer with
acceptable coverage. i.e. with HSDPA - DL Coverage Probability meeting the
Page 12

Version 5.1
HSDPA - Offered Load

Dependencies: Carrier,
This is the offered HSDPA load on the Best DL Cell by SINR. Note that the offered
load is calculated for each HSDPA resource pool in the network. Therefore, if the
HSDPA resources have been pooled on a site, all HSDPA cells on that site will show
the same offered load.
HSDPA - Effective Service Rate (Unloaded)
This is the bitrate that the user experiences at a location when there is no queuing
delay on the cell. It is calculated by multiplying the bitrate of the HSDPA - Achievable
DL Bearer by its activity factor.
HSDPA - Effective Service Rate (Loaded)
This is the bitrate that the user experiences at a location when there is queuing delay
on the cell. The rate drops to zero as the HSDPA load on the cell approaches 100%.
HSDPA - Effective Cell Service Rate (Unloaded)
Dependencies: Carrier, Service
This is the total amount of data in a service session (bits) divided by the mean service
time per user on the cell (seconds), assuming there is no queuing delay.
HSDPA - Effective Cell Service Rate (Loaded)
Dependencies: Carrier, Service
This is similar to the HSDPA - Effective Cell Service Rate (Unloaded) array, except
that the mean service time per user on the cell is increased because of queuing delay.
As the offered HSDPA load on the cell approaches 100%, the queuing delay approach
infinity and the Effective Cell Service Rate (Loaded) drops to zero.

Version 5.1
Page 13
All Servers Array

This feature is not a true array, since it is sensitive to the location of your mouse
cursor. It is a more basic version of the Pixel Analyser tool (for more information on
the Pixel Analyser, see the ASSET3g User Reference Guide).
It displays information about which cells are "covering" each pixel. A set of lines is
drawn between all possible serving cells to the simulation pixel where the mouse
cursor is located. For pixels with more than one covering cell, the line thickness
increases proportionally.
This array enables you to identify distant servers so that you can optimise your
network design by lowering, moving or reducing the pilot power of problematic sites.
The covering cells are shown in order of either:
Best Servers by Pilot Strength (according to the threshold set in the Array Settings
dialog box). This will work even if you have not yet run any snapshots because it
relates to the power in the cell and path loss, not to any simulation results.
Best Servers by Ec/Io. This requires snapshots to have been run because it relates
to attempted connections. Lines are only drawn if a terminal has been served on
that pixel.
This picture shows an example of the All Servers array:
All Servers array
Page 14

Version 5.1

There are three groups of arrays that can be generated using the 5.0 Simulator:
3g Service Arrays
3g Carrier Arrays
GSM Arrays
3g Service Arrays (5.0 Simulator)

The 3g Service arrays generated using the 5.0 Simulator wizard are listed within the
Simulator heading in the Map View Data Types.
Example of the Service Arrays under the Simulator heading in the Data Types list
Best Server Array

This array enables you to view the geographical areas where each cell is the Best
Serving Cell for the selected service.
The colours are assigned automatically. However, by double-clicking the array in the
list of Data Types, you can change the Coverage Probability threshold so that only
those pixels with a coverage probability above the threshold will show a best server.
You can also change the transparency.
Coverage Probability Array

This array displays the probability of service at a pixel defined as:
As with all the arrays, you can change the display properties by double-clicking the
array in the list of Data Types. For this array, you can set up colours and percentage
categories to display different coverage probabilities.

Version 5.1
Page 15
Coverage Probability for Nth Best Server Array

This array displays the probability of a service connection with a specific covering
cell. In other words, the probability that a user accessing a specific service on a
terminal manages a successful connection to the cell. The array displays the
probability that the service connects to its Nth best server.
When you double-click the item in the list of display types, you can:
Enter the number of the server array you want displayed on the map. This number
must be less than or equal to the number of covering cells that you have specified
during the set-up of the 5.0 Simulator wizard.
Set up colours and percentage categories to display different coverage

probabilities.
Example of Coverage Probability for Nth Best Server

In this example, one of the pixels on the Map View might be served by various
surrounding cells as follows:
Terminal
Cell
32A
32A
34A
36B
35B
32A
32A
35B
36B
10
35B
This would mean that at that pixel, coverage probability for the 1st best server would
be 4/10, or 40% for cell 32A. Coverage probability for the 2nd best server would be
3/10 or 30%, for cell 35B. Coverage probability for the 3rd best server would be 2/10
or 20%, for cell 36B. Coverage probability for the 4th best server would be 1/10 or
10%, for cell 34A. There is no 5th best server in this case.
Downlink Achieved Eb/No or Eb/Io Array

This array displays the achieved Eb/No (UMTS) or Eb/Io (CDMA2000 or HDR) of a
successfully served terminal on the downlink for the selected service.
The following calculation shows how the array is defined using Eb/No for a UMTS
network:
Page 16

Version 5.1
Note : To define the downlink achieved Eb/Io, use the same equation substituting
Eb/No for Eb/Io.
item in the list of Data Types.
Downlink Frame Error Rate Array

This array displays the mean achieved FER on the downlink for the selected service.
item in the list of Data Types.
Downlink Packet Delay Array

This array assesses the total packet transmission time of each sector, places it into one
of the following categories, and colours the map accordingly:
Conversational, for example voice traffic, delay < 250ms
Interactive, for example interactive games or www browsing, 250ms
Streaming, for example ftp, audio & video traffic, 4s
Background, for example e-mail arrival notification, best effort traffic, 10s
delay < 4s
delay < 10s

delay
Mean Downlink Bitrate Array

This array displays the mean downlink bitrate for terminals at each pixel for the
selected services.
Mean Number of Soft Handover or Handoff Cells Array

This array displays the mean number of soft handover/handoff cells for terminals at
each pixel for the selected service.
Mean Number of Softer Handover or Handoff Cells Array

This array displays the mean number of softer handover/handoff cells for terminals
at each pixel for the selected service.
Mean Size of Active Set Array

This array displays the mean size of the active set, which comprises serving cells as
well as all soft and softer handover cells. This size is limited by what you have
specified in the Active Set Size box on the Cell Params tab, when a cell is selected in
the Site Database.
Mean Uplink Bitrate Array

This array displays the mean uplink bitrate for terminals at each pixel for the selected
services.

Version 5.1
Page 17
Most Probable Handover/ Handoff Type Array

This array displays for each pixel the most probable handover/handoff type, but only
on the basis that handover/handoff actually occurred at that pixel. This allows you to
check whether you are using too much radio resources. If the array shows areas with
no handover/handoff, this indicates instances of primary connection only.
You can change the colours for this array in the display properties dialog box. Also in
this dialog box, you can set the thresholds for when to show soft handover/handoff,
softer handover/handoff, or both types of handover/handoff, depending on the
probability.
No Server Array
This array (GSM only) displays the areas where there is not enough power for calls to
be transmitted.
Path Balance Array

This array displays whether the Eb/No on the uplink and downlink are above the
required thresholds at each pixel for the selected service. The array indicates the areas
where:
both uplink and downlink have failed
uplink only has failed
downlink only has failed
both uplink and downlink have succeeded
When you specify a desired coverage probability for the uplink and downlink, the
array displays the regions in which the desired coverage probability is attained.
The downlink coverage probability is defined as:
The uplink coverage probability is defined as:
You can change the colours for this array in the display properties dialog box. Also in
this dialog box, set thresholds for uplink and downlink coverage probability.
Anything under the thresholds you set will be considered to be a failed link.
Page 18

Version 5.1
Probability of Downlink Capacity Failure Array

This array displays the probability of failure due to the serving base station being
unable to meet the downlink required Eb/No (UMTS) or Eb/Io (CDMA2000 or
HDR). This is because the base station has insufficient power and tends to occur when
a cell is heavily loaded.
Probability of Downlink Channel Limit Failure Array

This array displays the probability of failure due to an insufficient number of
downlink channels being available at the serving sector-carrier (including channels on
the site and sector pools). This is displayed as a percentage.
Probability of Downlink Channels No Primary Failure Array

This array displays the probability of failure due to the downlink primary channel
limit on the serving sector-carrier being exceeded. This is displayed as a percentage.
Probability of Downlink Eb/No Range Failure Array

This array displays the probability of failure due to the serving base station not being
able to meet the downlink required Eb/No (UMTS) or Eb/Io (CDMA2000 or HDR),
caused by the transmit power exceeding the allowed power for a downlink. This
tends to occur when a mobile is too far from a site.
Probability of Downlink Resource Limit Failure Array(s)

This array displays the probability of failure due to the serving cell resource limit
being exceeded. This is displayed as the average percentage blocking for this service,
based on the maximum number of resources that you have set up on the Resource tab
in the Site Database.
Probability of Downlink Resource No Primary Failure Array(s)

This array displays the probability of failure due to insufficient primary resources
available on the downlink. This is based on the maximum number of resources that
you have set up on the Resource tab in the Site Database.
Probability of Low Control C/I Failure Array

This array (GSM only) displays the probability of failure due to interference to the
'control' (BCCH) carrier.

Version 5.1
Page 19
Probability of Low Ec/Io Failure Array

This array displays the probability of failure due to insufficient Ec/Io on the
downlink, that is:
This array will be displayed as the average percentage blocking per service.
Probability of Low Pilot SIR Failure Array

This array displays the probability of failure due to insufficient pilot SIR on the
downlink, that is:
Probability of Low Traffic C/I Failure Array

This array (GSM only) displays the probability of failure due to interference to the
'traffic' (TCH) carrier.
Probability of No Carrier Failure Array

This array displays the probability of failure due to the service on the terminal being
unable to receive the required carrier from any of the covering cells, that is:
Probability of No Cell Timeslot (TS) Available Array

This array (GSM only) displays the probability of no cell timeslots being available to
transmit.
Probability of No Terminal Timeslots (TS) Available Array

This array (GSM only) displays the probability of no terminal timeslots being
available to transmit.
Page 20

Version 5.1
Probability of Noise Rise Failure Array

This array takes account of the cell noise rise limits that you have set for the cells and
displays the probability of failure due to a cell noise rise limit being exceeded on the
uplink.
Noise Rise in dB is set per cell on the Cell Params tab in the Site Database.
Note : When a connection is attempted, a calculation is made to assert that the noise
rise limit is not broken for the primary cell AND any neighbour cells. If the noise rise
limit is broken, this is logged as a noise rise failure on the primary cell, even if the
noise rise limit was broken on another cell.
The array is defined as:
Probability of Soft Handover/Handoff Array

This array displays the probability of one or more soft handover/handoff connections
taking place at each pixel for the selected service.
This is defined as:
A strictly soft handover means that if there are multiple handover cells for a service
on a terminal, then all of the handovers are soft. If any of the handovers are softer, the
service is deemed to be in softer handover.
Probability of Softer Handover/Handoff Array

This array displays the probability of one or more softer handover/handoff
connections taking place for the selected service.
This is defined as:

Version 5.1
Page 21
Probability of Uplink Eb/No Failure for a UMTS Network Array

This array displays the probability of failure due to the user equipment being unable
to meet the uplink required Eb/No for a UMTS network. The array is defined as:
This array is displayed as the average percentage blocking for this service.
Probability of Uplink Resource Limit Failure Array(s)

This array displays the probability of failure on the uplink due to the serving cell
resource limit being exceeded. This is displayed as the average percentage blocking
for this service. It is based on the maximum number of resources that you have set up
on the Resource tab in the Site Database.
Probability of Uplink Resource No Primary Failure Array(s)

This array displays the probability of failure due to insufficient primary resources
available on the uplink. This is based on the maximum number of resources that you
have set up on the Resource tab in the Site Database.
Reason for Failure Array

This array analyses the results of all the failure arrays and displays the most probable
reason for failure (that is, the most dominant one) for each pixel. An extra condition "excessive path loss" - is also considered. If the path loss is greater than 200 dB, this is
considered too excessive to ever make a connection.
This array enables you to easily identify the primary reason for failures in the
different geographic areas.
In the display properties dialog box, you can choose to use the default colours for the
automatically assigned categories or to change the colours. You can also set up the
coverage probability threshold to ensure that failures are displayed only if the
coverage probability is below the value you enter.
Uplink Eb/Nt Failure Array

This array displays the probability of failure due to the user equipment being unable
to meet the uplink required Eb/Nt for a CDMA2000 or HDR network.
This array is displayed as the average percentage blocking for this service.
Uplink Required TX Power Array

This array displays the mean uplink required Transmit Power at each pixel for the
selected service.
Page 22

Version 5.1
3g Carrier Arrays (5.0 Simulator)

The 3g Carrier arrays generated using the 5.0 Simulator wizard are listed within the
Example of the Carrier Arrays under the Simulator heading in the Data Types list
All Servers Array

This feature is not a true array, since it is sensitive to the location of your mouse
cursor. It is a more basic version of the Pixel Analyser tool (for more information on
the Pixel Analyser, see the ASSET3g User Reference Guide).
network design by lowering, moving or reducing the pilot power of problematic sites.
Best Servers by Pilot Strength (according to the threshold set in the Array Settings
dialog box). This will work even if you have not yet run any snapshots because it
relates to the power in the cell and path loss, not to any simulation results.
Best Servers by Ec/Io. This requires snapshots to have been run because it relates
to attempted connections. Lines are only drawn if a terminal has been served on
that pixel.

Version 5.1
Page 23
This picture shows an example of the All Servers array:
All Servers array
Best Server by Pilot Array

This displays the best serving cell by pilot power for the selected carrier at each pixel.
This array is affected by the pilot strength threshold which you set in the Array
Cell/Sector Uplink Load Array

This array displays at each pixel the uplink load for the best serving cell (by pilot
power).
Note : For TD-SCDMA networks this is for the time slots given.
Cell uplink load is defined as:
Noise rise at the cell is defined as:
Page 24

Version 5.1
Downlink Packet Delay Array

This array assesses the total packet transmission time of each sector, places it into one
of the following categories, and colours the map accordingly:
Conversational, for example voice traffic, delay < 250ms
Interactive, for example interactive games or www browsing, 250ms delay < 4s
Streaming, for example ftp, audio & video traffic, 4s delay < 10s
Background, for example e-mail arrival notification, best effort traffic, 10s delay
Ec/Io for Nth Best Server Array

This array displays the strongest Ec/Io, second strongest Ec/Io, third strongest Ec/Io
and so on up to the number of covering cells chosen in the 5.0 Simulator wizard.
This array is useful in helping you determine the causes of pilot interference. For
example, if you can see that a particular cell is the second strongest pilot in a lot of
areas that are far from its own service area, then you will know that that particular
cell will be a likely pilot polluter (that is, interfering or degrading the pilot signals of
surrounding cells).
In the display properties dialog box, you can specify which of the Nth best server
arrays you want displayed.
Mean Received Power Array

This array displays the total mean received RF power over a carrier's bandwidth,
found by adding the received pilot powers, common channel powers, traffic channel
powers and background noise at any pixel. The value at each pixel is obtained by
averaging the total received powers of the terminals attempted at a pixel.
Mean Received PSD (Io) Array

This array displays the total received power on the downlink divided by the
bandwidth for the selected service, at each pixel.
Note : For TD-SCDMA networks, this is for the timeslots given.
Nth Lowest Downlink Loss Array

This array displays the lowest downlink loss in dB for the selected carrier, then the
next lowest loss, and so on until N, where N is less than or equal to the number of
serving cells you have specified in the 5.0 Simulator wizard.

Version 5.1
Page 25
Number of Pilot Polluters Array

Any cell that provides an Ec/Io level higher than the number of Pilot Pollution
threshold, but is not in the terminal's active set, is considered to be a pilot polluter for
the terminal. This array is provided as an output by the 5.0 Simulator and shows the
average number of pilot polluters on each carrier.
Pilot Coverage Array

The Pilot Coverage array displays the pilot strength in dBm for the selected carrier
and is useful when determining pilot interference. This array shows the same
information as the Pilot Strength array, but the powers can be grouped into categories
of pilot strength. For example, you may want to categorise received powers of -60 to 50 dBm to be Rural Outdoor.
Pilot Ec/Io Array

This array displays the achieved pilot Ec/Io for each pixel and is in effect, the same as
Ec/Io for the best server.
Note : The Ec/Io value includes intra-cell interference, whereas the SIR value excludes
intra-cell interference.
Pilot SIR Array

This array displays the achieved pilot SIR for each pixel.
Note : The SIR value excludes intra-cell interference, whereas the Ec/Io value includes
intra-cell interference.
Pilot Strength Array

This array displays the pilot strength in dBm for the selected carrier and is useful
when determining pilot interference.
Pilot Strength for Nth Best Server Array

The Pilot Strength for Nth Best Server array displays the strongest pilot power in dBm
for the selected carrier, then the next strongest and so on until N, where N is less than
or equal to the number of serving cells you have specified in the 5.0 Simulator wizard.
Use this array to determine the causes of pilot interference.
In the display properties dialog box, you can specify which of the Nth best server
arrays you want displayed.
Page 26

Version 5.1
GSM Arrays (5.0 Simulator)

The GSM arrays generated using the 5.0 Simulator wizard are listed within the
Example of the GSM Arrays under the Simulator heading in the Data Types list
Best Server Signal Array (GSM)

This array displays the signal strength of the best serving cell at each pixel on the Map
View. This decision is based on parameters specified in the Site Database window and
in the Array Settings dialog box.
As with all the arrays, you can change the display settings in the Map View by
double-clicking the array in the list of Data types.
All Servers (GSM) Array

This array is sensitive to the location of your mouse cursor.
network design by lowering, moving or reducing the power of problematic sites.
Best Signal Strength (according to the threshold set in the Array Settings dialog
box). This will work even if you have not yet run any snapshots because it relates
to the power in the cell and path loss, not to any simulation results.
Best Server by C/I. This requires snapshots to have been run because it relates to
attempted connections. Lines are only drawn if a terminal has been served on that
pixel.

Version 5.1
Page 27
Average Connection Arrays (Traffic and Control)

There are two Average Connection arrays, one for Traffic, the other for Control. The
'Traffic' calculation includes all carrier layers while 'Control' only includes control
carrier layers. If a cell layer has no control carrier layer allocated then the value will be
taken from the best alternative cell layer on the same site.
For each pixel on a selected cell layer, the serving sub-cell is determined, and for each
hopping carrier group the average carrier to interference (C/I) is calculated from the
corresponding pixel in the per carrier interference array by converting total C/I to
BER and calculating the mean. The mean BER is converted back to dB and the average
value for all hopping carrier groups is presented.
For information on the algorithm used, see Average Connection Array Calculation
Method on page 42.
Note : This interference array type was designed for networks using frequency
hopping, although it also works for non-hopping networks. In a non-hopping
network, the carrier group can be considered to contain just a single carrier in the
above description.
Note : This array is not available for AMPS/TDMA networks.
Lowest Downlink Loss (GSM) Array

In this array, at each pixel, the downlink losses of covering cells that use the selected
carrier are examined, and the lowest of these losses is displayed .
This loss includes all relevant gains and losses in the downlink except those
associated with the terminal type. For example, antenna gain, feeder loss, MHA
insertion loss or Tx combiner loss are included, but terminal antenna gain and body
loss are excluded.
Nth Best Server (GSM) Array

For each pixel on the selected cell layer, ASSET3g determines which serving cell layer
will be the most likely server of a mobile in that pixel, plus the next most likely until
N. This decision is based on parameters specified in the Site Database window and in
the Array Settings dialog box.
The difference between Best Server arrays and Nth Best Server arrays is that when
creating an Nth Best Server Array, the number of layers is the same as the number of
GSM covering cells. You then choose which layer you wish to view.
Service Area (GSM) Array

Service areas enable you to view the information from the Best Server Signal array in
terms of the geographical areas where each cell is the Best Serving Cell. It uses the
same information as the Best Server Signal array, but displays it in a different way.
Page 28

Version 5.1

There are a number of different Coverage/Interference arrays that can be generated
for 2g and 2.5g, using the Array Creation wizard.
Coverage and Interference Arrays (2g + 2.5g) (Non-Sim)

The 2g and 2.5g arrays, generated using the Array Creation wizard, are listed within
the Coverage heading in the Map View Data Types.
Example of the 2g/2.5g Arrays under the Coverage heading in the Data Types list
Best Server Array

This array displays the signal strength of the best serving cell at each pixel on the Map
View. This decision is based on parameters specified in the Site Database window and
in the Array Settings dialog box.
As with all the arrays, you can change the display settings by double-clicking the
array in the list of Data Types. For details of how to modify or set up schemas for this
array, see the ASSET3g User Reference Guide.

Version 5.1
Page 29
This picture shows an example of the Best Server array:
Best Server array
Best Server (GPRS) Array

For each pixel, ASSET3g determines which serving cell layer will be the most likely
server of a mobile in that pixel. This decision is based on parameters specified in the
Site Database window and in the Array Settings dialog box.
The Best Server (GPRS) array is identical to the Best Server array, except that it will
exclude non-GPRS sub-cells from the calculation.
Best Server EDGE Arrays

Best Server (EDGE GMSK) Array
A subset of the GPRS Best Server array, which only includes EGPRS cells. The EDGE
GMSK array displays the pathloss from the server to that pixel of a signal using
Gaussian Minimum Shift Keying (GMSK) modulation.
Best Server (EDGE 8-PSK) Array
Covers the same subcells as the EDGE GSK array, but applies the APD to the subcells,
making the service area of each subcell generally smaller. If the APD is set to 0, then
both Best Server EDGE arrays will be identical. The EDGE 8-PSK array displays the
pathloss from the server to that pixel of a signal using 8-PSK modulation.
Page 30

Version 5.1
LMU Arrays
Location Measurement Units (LMUs) are used to locate a subscriber and/or their
mobile equipment. LMU arrays can indicate geographically where a mobile station
can be measured by more than three separately located base stations (through
position triangulation).
The mobile can only receive effective signals where:
1
The received signal strength at the mobile station is above the signal strength
threshold that you have set in the Array Settings dialog box.
The total C/I due to inteference from the other cells at the mobile station is above
the C/I threshold that you have set.
Therefore, you can create two separate arrays:
MS Measured Cells
MS Measured Cells (C/I)
MS Measured Cells Array

For the MS Measured Cells array, ASSET3g creates an Nth Best Server array for the
selected region based on the selected cells and settings specified in the Array Settings
dialog box (including the received signal strength threshold and the timing advance).
Note : Only the count of Best Servers are stored, and not the sub-cells.
MS Measured Cells (C/I) Array

For the MS Measured Cells (C/I) array, ASSET3g creates an Nth Best Server array for
the selected region, based on a received signal strength threshold of 160dBm, the
selected cells and the rest of the settings specified in the Array Settings dialog box.
To calculate the C/I for each potential server, ASSET3g performs the following
calculation for each pixel in the Nth best server array:
1
ASSET3g calculates the worst C/I and the total C/I.
ASSET3g then calculates and stores the worst interfering sub-cell, based on a
consideration of every other serving cell entry in the Nth Best Server array for that
pixel.
The calculations in steps 1 and 2 are based on:
Each serving cell entry in the Nth Best Server array, where the signal strength
is equal to or greater than the received signal strength threshold in the Array
Settings dialog box
Each carrier of the serving cell, where the carrier is on a control layer
ASSET3g then post-processes the array to calculate the average C/I for each pixel,
and each serving cell entry in the Nth Best Server array.
Tip : In the Map Information Window (accessed from the View menu in the Map
View), if you hover over a cell, the number of cells that could be measured by the
LMU is displayed for each array that has been calculated.

Version 5.1
Page 31
GPRS Data Rate Array

The GPRS Data Rate array shows the maximum data rate (in kbits per second) that
you can achieve at a particular pixel using GPRS technology.
Use the GPRS Data Rate array to see where in a area you will get what performance.
This type of array requires a Best Server (GPRS) array, which is generated
automatically if one does not already exist.
The GPRS Data Rate array determines coverage for cells that support GPRS and
includes the effect of Frequency Hopping and DTX. The array calculates a pixel's
average C/I value, ignoring the signal (C) from non-GPRS cells but considering
interference for all cells, both GPRS and non-GPRS.
When the average C/I value for each pixel has been determined, the array converts it
from a signal to noise ratio to a data rate per timeslot by referring to the Channel
Coding Scheme. For details, see the ASSET3g User Reference Guide. Only Channel
Coding Schemes supported by the best serving subcell are included. The data rate is
stored in the array.
You can specify the cell layer/carrier layer combinations to be considered when
calculating the GPRS data rate array by selecting the appropriate combinations in the
Interference tab of the Array Settings dialog box.
As with other arrays, you can double-click the item from the Data Types list on the
Map View to change the displayed colours and categories for the array.
GPRS Average Data Rate per Timeslot Array

The GPRS Average Data Rate per Timeslot display uses the serving cell information
from the Best Server (GPRS) array.
The Average Data Rate per Timeslot array uses the distribution of traffic (Terminal
Types/km) and the data demands of each type. It then calculates an average data
rate per timeslot for the cell. This is calculated and stored when the GPRS Data Rate
array is produced.
It uses the GPRS Data Rate array to give a data rate per timeslot (kb/s). This value is
then multiplied by the number of terminals of that type present to get the demand for
that pixel for that terminal type.
The results for each terminal type for all the pixels within a sub-cell are then divided
by the number of terminals of that type with the sub-cell. The result for each terminal
type present is then averaged to generate the average data rate per timeslot, which is
then stored on the sub-cell.
For more details on the calculations, see Grade of Service and Data Rate on page 51.
Note : If the traffic array and the GPRS Data Rate array are of different resolutions, the
GPRS Data Rate array is interpolated to get the corresponding kb/s for each traffic
array pixel.
Page 32

Version 5.1
To display this on the map, ensure Average Data Rate per Timeslot (GPRS) is selected
in the list of data types to display. The area covered by each GPRS sub-cell is
displayed on the map in the colour corresponding to its average data rate per
timeslot.
When displayed on the map, the array has different colours representing the different
service levels in a kb/s/timeslot. For example:
High (Multimedia)
>12kb/s (Red)
Medium (Web access)
7-12kb/s (Green)
Low (e-mail)
2-7kb/s (Blue)
EGPRS Data Rate Array

Use the EGPRS Data Rate array to see where in a area you will get what performance.
This type of array requires an EGPRS best server array, which is generated
automatically if one does not already exist.
The EGPRS Data Rate array is based on the following data:
EGPRS-enabled cells
EGPRS modulation/coding schemes
Frequency hopping
LA families supported by the subcells
The power drop (APD) observed with 8-PSK modulation
The EGPRS Data Rate array determines coverage for cells that support EGPRS and
includes the effect of Frequency Hopping and DTX. The array calculates a pixel's
average C/I value, ignoring the signal (C) from non-EGPRS cells but considering
interference for all cells, both EGPRS and non-EGPRS.
Note : If you are taking traffic into account for interference and the 8-PSK traffic mix of
any subcell is greater than zero, ASSET3g assumes that the percentage of the traffic is
8-PSK (which uses less power because of the APD and causes less interference).
When the average C/I value for each pixel has been determined, the array converts it
from a signal to noise ratio to a data rate per timeslot by referring to the Coding
Scheme. For details, see the ASSET3g User Reference Guide.
It works out two of these data rates, one for the best GMSK available, and one for the
best 8-PSK available, and then chooses the one that gives the best overall data rate to
store.
You can specify the cell layer/carrier layer combinations to be considered when
calculating the EGPRS data rate array by selecting the appropriate combinations in
the Interference tab of the Array Settings dialog box.

Version 5.1
Page 33
EGPRS Average Data Rate per Timeslot Array

The EGPRS Average Data Rate per Timeslot display uses the serving cell information
from the Best Server (EGPRS) array.
The Average Data Rate per Timeslot array uses the distribution of traffic (Terminal
Types/km) and the data demands of each type. It then calculates an average data
rate per timeslot for the cell. This is calculated and stored when the EGPRS Data Rate
array is produced.
It uses the EGPRS Data Rate array to give a data rate per timeslot (kb/s). This value is
then multiplied by the number of terminals of that type present to get the demand for
that pixel for that terminal type.
The results for each terminal type for all the pixels within a sub-cell are then divided
by the number of terminals of that type with the sub-cell. The result for each terminal
type present is then averaged to generate the average data rate per timeslot, which is
then stored on the sub-cell.
For more details on the calculations, see Grade of Service and Data Rate on page 51.
Note : If the traffic array and the EGPRS Data Rate array are of different resolutions,
the EGPRS Data Rate array is interpolated to get the corresponding kb/s for each
traffic array pixel.
To display this on the map, ensure Average Data Rate per Time Slot (EGPRS) is
selected in the list of data types to display. The area covered by each EGPRS sub-cell
is displayed on the map in the colour corresponding to its average data rate per
timeslot.
When displayed on the map, the array has different colours representing the different
service levels in a kb/s/timeslot. For example:
High (Multimedia)
>12kb/s (Red)
Medium (Web access)
7-12kb/s (Green)
Low (e-mail)
2-7kb/s (Blue)
GPRS Service Area Data Rate Array

The GPRS Service Area Data Rate array displays the capacity limited GPRS data rate
for each serving cell.
The data rates are displayed accordingly to chosen categories over the service area of
each server. For example, for a server whose capacity limited data rate is 6kb/s, the
service area of this server will be displayed as the appropriate category. The default
category in this case would be e-mail as according to the default scheme, the data rate
range for e-mail is 1-28 kb/s. The service area for this cell would therefore be coloured
in the colour for the category e-mail.
Page 34

Version 5.1
EGPRS Service Area Data Rates Array

The EGPRS Service Area Data Rate array displays the capacity limited EGPRS data
rate for each serving cell.
The data rates are displayed accordingly to chosen categories over the service area of
each server. For example, for a server whose capacity limited data rate is 6kb/s, the
service area of this server will be displayed as the appropriate category. The default
category in this case would be e-mail as according to the default scheme, the data rate
range for e-mail is 1-28 kb/s. The service area for this cell would therefore be coloured
in the colour for the category e-mail.
Interference Arrays
Note : When creating one of the Interference arrays, ASSET3g requires a Best Server
array in memory. If this is not the case, a Best Server array will be automatically
created. However, if you later create subsequent Interference arrays after making
changes to the network, ASSET3g does not automatically create a fresh Best Server
array.
Therefore, in cases where you suspect the Best Server array in memory has become
out of date for any reason, you should explicitly create both the Best Server array and
the required Interference array when running the Array Creation wizard. For
example:
Example of creating Best Server array and required Interference array in the Coverage/Interference wizard

Version 5.1
Page 35
Worst Connection Array

For each pixel, the serving sub-cell is determined and for each hopping carrier group
the average carrier to interference (C/I) is calculated from the corresponding pixel in
the per carrier interference array by converting total C/I to BER and calculating the
mean. The mean Bit Error Rate is converted back to dB and the hopping carrier group
with the lowest resultant C/I is presented, that is, it corresponds to the worst of the
mean connection C/I values.
For information on the algorithm used, see Worst Connection Array Calculation
Method on page 41.
Important : Worst connection arrays require a Best Server array, which is generated
automatically if one does not already exist in memory. If a best server array already
exists but its contents are out of date, you will need to recreate it by explicitly
selecting to create both the Best Server and Worst Connection arrays in the Array
Creation wizard.
above description.
Average Connection Array

For each pixel, the serving sub-cell is determined, and for each hopping carrier group
the average carrier to interference (C/I) is calculated from the corresponding pixel in
the per carrier interference array by converting total C/I to BER and calculating the
mean. The mean BER is converted back to dB and the average value for all hopping
carrier groups is presented.
For information on the algorithm used, see Average Connection Array Calculation
Method on page 42.
Important : Average Connection arrays require a Best Server array, which is generated
selecting to create both the Best Server and Average Connection arrays in the Array
Creation wizard.
above description.
Page 36

Version 5.1
Worst Interferer Array

For each pixel, the carrier with the worst carrier to interference (C/I) is determined
from the corresponding total C/I value in per carrier interference array. The result is
the worst C/I and the sub-cell from which the interference originates.
For information on the algorithm used, see Worst Interferer Array Calculation
Method on page 43.
Important : Worst Interferer arrays require a Best Server array, which is generated
selecting to create both the Best Server and Worst Interferer arrays in the Array
Creation wizard.
Note : This array does not consider frequency hopping, and so can be considered to be
an interference calculation for a non-hopping version of the frequency plan.
Total Interference Array

For each pixel, the total carrier to interference (C/I) is calculated by summing the total
C/I per carrier. This array is applicable to both fully-loaded frequency hopping and
non-hopping networks. The calculated C/I is NOT merely as experienced by any
individual subscriber, but rather it represents the total of the interference experienced
by ALL subscribers at each pixel.
For information on the algorithm used, see Total Interference Array Calculation
Method on page 43.
Important : Total Interference arrays require a Best Server array, which is generated
selecting to create both the Best Server and Total Interference arrays in the Array
Creation wizard.
About Per Carrier Interference

For all the interference calculations, ASSET3g generates an intermediate internal array
called a per carrier interference array. For each pixel in the array the serving sub-cell
is determined and for each carrier of the serving sub-cell the worst carrier to
interference (C/I) (lowest numerical value) and the total C/I is calculated taking into
consideration all co and adjacent carriers from all interfering sub-cells.
The total C/I is determined by summing the interfering signals in watts then later
converting back to dB. The result is an array such that for each pixel, a list is obtained
of serving carriers plus the worst and total C/I for each carrier.
You cannot currently visualise this intermediate array, which no longer exists when
all the other selected arrays have been created.

Version 5.1
Page 37
Total Received Power Array

This array show the sum of energy absorbed at any one point from all base stations on
a per pixel basis. For each pixel, received power is calculated in dBm from each of the
sub-cells. This value is converted to watts, summed and converted back to dBm.
When you have determined the total received power, you can use this information for
making safety decisions. You can also generate statistical reports showing this
information. Each pixel in the area of map you have selected is processed and a list is
created of sub-cells that have prediction files overlapping the area.
Note : Distributed antenna systems are treated as separate power sources.
Page 38

Version 5.1
APPENDIX B
2g and 2.5g Algorithms

In This Section
FCC Calculations

The Interference Table stores the following four values for any pair of sub-cells A and
B. These relate to the region where A is the best server.
Field Name
Description
Co-channel Traffic
The amount of traffic served by cell A that would be affected by interference if A

and B were to be assigned the same carrier.
Co-channel Area
The area served by cell A that would be affected by interference if A and B were
to be assigned the same carrier.
Adjacent Channel Traffic
The amount of traffic served by cell A that would be affected by interference if A

and B were to be assigned adjacent carriers.
Adjacent Channel Area
The area served by cell A that would be affected by interference if A and B were
to be assigned adjacent carriers.
The values for area are obtained by averaging the probability of interference over the
region where A is the best server. The average is taken over all pixels in the
appropriate coverage array.
For traffic, the value to be averaged is the probability of interference x the traffic (in
mE) at that pixel. Thus it is necessary to have a traffic raster available to make this
calculation.

Version 5.1
Page 39
The probability of interference at a given pixel is calculated using a standard

statistical technique based on a C/I signal threshold value and a standard deviation.
The assumption is that a difference in signal level between server and interferer
exactly equal to the threshold value would give rise to a 50% chance of co-channel
interference. For more information on how these values can be specified, see the
ASSET3g User Reference Guide.
By default, a -18dB offset is used for the adjacent channel interference, relative to the
co-channel interference. This means that if, for example, the co-channel C/I threshold
value is set at 9dB, a signal difference of -9dB between server and adjacent channel
interferer would give rise to a 50% chance of adjacent channel interference. The C/A
offset can be modified in the Array Settings dialog box.
All signal differences are converted into probabilities of interference. This graph
displays the spread of probabilities for both C/I and C/A based on the default
Interference Weights. Here, the C/I signal threshold value is 9 dB, using a standard
deviation of 7.78dB.
C/I and C/A weights curve
Note : An example of an Interference Table can be found, along with a description of

its File Format, in the ENTERPRISE User Reference Guide.

This table shows the different interference analyses that are possible:
Field Name
Description
Worst Connection C/Ic
Determines the co-channel C/I levels for all of the possible interfering
frequencies that may be used by the MS-BTS connection.
Each pixel presents the worst C/Ic level and frequency.
Worst Connection C/Ia
Determines the adjacent channel C/I levels for all of the possible interfering
frequencies that may be used by the MS-BTS connection.
Each pixel presents the worst C/Ia level and frequency.
Worst Connection C/(Ic+Ia)
Determines the combined co-channel/adjacent channel C/I levels for all of the
possible interfering frequencies that may be used by the MS-BTS connection.
Each pixel presents the worst C/I level and frequency.
Page 40

Version 5.1
Field Name
Description
Average Interference C/Ic
Sums the co-channel C/I levels for all possible interfering frequencies and
presents the average C/Ic level.
Average Interference C/Ia
Sums the adjacent channel C/I levels for all possible interfering frequencies
and presents the average C/Ia level.
Average Interference C/(Ic_Ia)
Sums the combined co-channel and adjacent C/I levels for all possible
interfering frequencies and presents the average C/(Ic_Ia) level.
Worst Interference C/Ic
For non-frequency hopping networks sums all of the co-channel C/I levels for
an interfering frequency.
Each pixel presents the total C/I level, server and interfering sub-cells and
interfering frequency.
Worst Interference C/Ia
For non-frequency hopping networks sums all of the adjacent channel C/I
levels for an interfering frequency.
Each pixel presents the total C/I level, server and interfering sub-cells and
interfering frequency.
Note : The worst connection and the worst interferer calculations are the same in the
case of a non-frequency hopping network.
Worst Connection Array Calculation Method

In the Worst Connection Array calculation, the connection refers to the carrier(s)
corresponding to a single call:
In the case of hopping frequencies, it corresponds to the entire group of hopping

frequencies
In the case of non-hopping frequencies, it corresponds to a single frequency
The Worst Connection Array calculates the C/I per connection, summing over all
interferers, and then selects the connection with the lowest C/I.
The algorithm for this is as follows:
Where:
For each non-hopping carrier fi in the serving sub-cell, C/I(fi) is calculated.
For the hopping frequency group in the serving sub-cell, a single C/I(FH) is
calculated.

Version 5.1
Page 41
Average Connection Array Calculation Method

The Average Connection Array calculates the C/I per connection, summing over all
interferers, and then calculates the average of those.
The algorithm for this is as follows:
(2)
Where:
is the averaged C/I for the hopping carriers.
is the number of hopping frequencies.
is the number of non-hopping frequencies.
is frequency Diversity Gain.
is the fractional loading, calculated as follows:
, where
is the number of hopping TRX.
are the non-hopping frequencies.

For each non-hopping carrier fri in the serving sub-cell, C/I(fri) is calculated.
For the hopping frequency group in the serving sub-cell, a single C/I(FH) is
calculated.
Note : The denominator in the equation above can never be zero ( and cannot both
be 0 at the same time). This is because ASSET3g does not allow you to set the total
number of TRX allocated to a sub-cell to zero, if at least one carrier layer is allocated.
Page 42

Version 5.1
Worst Interferer Array Calculation Method

The Worst Interferer Array calculates the C/I per frequency, summing over all
interferers, and selects the frequency with the lowest C/I. It also finds the interferer
that causes the most interference on that frequency.
Note : This array does not take into account fractional loading.
The most interfered frequency and its corresponding C/I are calculated as follows:
If
, then
If
, then
Where:
For each (non-hopping) carrier f1 in the serving sub-cell, C/I(f1) is calculated.
The worst interferer is calculated as follows:
Total Interference Array Calculation Method

The Total Interference Array calculates the C/I per frequency, summing over all
interferers, and then sums the C/I for each frequency at the serving cell.
Note : This array does not take into account fractional loading.
The total interference is calculated as follows:
Where:
For each (non-hopping) carrier fi in the serving sub-cell, C/I(fi) is calculated.

Version 5.1
Page 43
Table of Default C/I BER Conversion Values

This table shows the Default C/I BER Conversion Values in ASSET3g:
Page 44
C/I (dB)
Bit Error Rate
-10
0.5000000000
-9
0.4880000000
-8
0.4650000000
-7
0.4300000000
-6
0.3880000000
-5
0.3500000000
-4
0.3200000000
-3
0.3000000000
-2
0.2700000000
-1
0.2500000000
0.2200000000
0.2000000000
0.1700000000
0.1500000000
0.1200000000
0.1000000000
0.0900000000
0.0780000000
0.0660000000
0.0550000000
10
0.0450000000
11
0.0370000000
12
0.0300000000
13
0.0260000000
14
0.0200000000
15
0.0150000000
16
0.0120000000
17
0.0080000000
18
0.0060000000
19
0.0040000000
20
0.0020000000
21
0.0007000000
22
0.0001000000
23
0.0000070000
24
0.0000004000
25
0.0000000100

Version 5.1
C/I (dB)
Bit Error Rate
26
0.0000000001
27-45
0.0000000000

The algorithms used for frequency hopping cells are as follows:
1 is used if
, is used if
, 0 is used otherwise
Where:
C/I(i)
C/I ratio for frequency i
SSC(i)
Signal strength from frequency i for serving cell
i,j
A particular frequency
Number of interfering cells
Number of frequencies in serving cell
Number of frequencies in interfering cell K
SIC(K,i)
Signal strength from frequency i for interfering cell K
Interfering cell
L(K,j)
Load in interfering cell K on frequency j
V(K,j)
DTX factor in interfering cell K on frequency j
f (i)
Fractional loading for frequency i for interfering cell
Adjacent interference factor
Each C/I(i) is converted to a Bit Error Rate, BER(i)

Version 5.1
Page 45
This graph shows the relationship between the Probability of Bit Error and the C/I:
BERAV(serving cell) is calculated as the average BER(i) for all frequencies in the cell:
Where:
x Number of FH frequencies per TRX
mFH
Number of FH frequencies/serving cell
nTRX
Number of TRX/serving cell
BERAV(serving cell) is then converted back to dB to give C/I (FH)(serving cell).

Important : If frequency diversity gain GFDIV(m) is enabled, you also need to add a given
gain figure to the hopping C/I. For more information on this, see the ASSET3g User
Reference Guide.
Synthesised Hopping Algorithm

For synthesised hopping carrier layers, fractional loading is calculated as follows:
Where:
is the number of TRX allocated to the hopping carrier layers
is the number of hopping carriers
Page 46

Version 5.1

The calculations for non-frequency hopping are as follows:
1 is used if
, is used if
, 0 is used otherwise
P(i) = f(C/I(i))
P(i) is the Probability of interference, and is calculated from the cumulative normal
distribution of combined standard deviation of serving and interfering cell models.
and
PTOT = Average of all P(i) in the cell
This picture shows an example conversion curve:
Example C/I/Probability Curve

Version 5.1
Page 47

The frequency planner uses an Intelligent Local Search Algorithm (ILSA) to search for
an optimum or zero cost plan using the latest ideas from Combinatorial Optimisation
Theory.
The interference in the network is measured by the value in the Cost of Current Plan
field. Typically, this decreases very rapidly during the early part of the process.
Thereafter, the average rate of decrease will be less and decreases will be more
sporadic. In fact the cost is often stationary for a while before undergoing another
stage of rapid decrease.
ILSA pays special attention to areas of high cost within the network (analogous to
areas of high interference), temporarily ignoring lower cost areas. This allows ILSA to
make very rapid initial progress. For example, if ILSA is attempting to plan for a
network requiring 60 carrier allocations, with 20 available carriers, and identifies a
sub-set of 10 high cost carrier allocations, then the maximum number of new states
that ILSA needs to consider has been reduced from 3.8*1025 to 6.1*1012.
The algorithm monitors its own progress and will behave differently depending on
how quickly the cost is decreasing at a given time. This intelligent behaviour enables
it to continue finding improvements over long periods of time.
At the heart of the algorithm is a random process, so if the algorithm is run twice for a
given period of time on a particular network the end results may differ by a few
percent. Thus it may be worth running the algorithm more than once.
The Cost Function of the ILSA Algorithm

The principle behind the algorithm used in the frequency planning tool is that the
effectiveness of any particular frequency plan is measured by a single number (the
cost). The algorithm then tries to minimise the cost over the set of all possible
frequency plans. The cost function measures how much interference there is in the
network, and also allows for the different weights that you may have imposed.
For a given frequency plan the value of the cost function is given by the formula:
Page 48

Version 5.1
Where:
=
The adjacent channel interference caused on allocation i by allocation j (Units: 200*mE or 20,000*km2)
The co-channel interference caused on allocation i by allocation j (Units: 200*mE or 20,000*km2)
The frequency allocated at allocation i
Members of the set of all frequency allocations
The retune cost associated with allocation i
The fixed or forbidden carrier cost associated with allocation i
The separation costs (from equipment, neighbours, exceptions or close separations) between
allocations i and j
The handover count and intermodulation interference costs associated with allocation i
The weighting factor applicable to carrier allocation i

The cost function for MAIO planning is an aggregate of C/I and C/A separation
counts generated by per cell pair frequency combinations, based on MAIO step and
offset values, and weighted by the interference matrix. It has the following form:
Where:
are sub-cells
and
and
are traffic and area percentages

are traffic and area associated with sub-cell c
and
are interference matrix coefficients
is the C/I or C/A separation count for all TRX combinations on subcells

Version 5.1
Page 49

This section describes GPRS and HSCSD capacity calculations, as follows:
TRX Requirement -Circuit Switched, HSCSD and GPRS Traffic

The number of TS required (
) for the CS traffic load (
Grade of Services and a choice of Erlang table.
) given specified two
The number of TRX required is determined using the Channel to Transceiver Map by
increasing the number of TRX from 1 until the maps
and
is equal to or greater than
is greater than or equal to
TRX Requirement - Circuit Switched, HSCSD and GPRS Traffic

For cells where GPRS is enabled, the number of TS required from the shared traffic
channels for the GPRS (
average GPRS data rate per TS (
) traffic load (
) can be determined using the
):
The total number of TS required for CS and GPRS traffic (
) can then be
determined using the average Circuit Switched TS requirement

channel occupation efficiency (e) as follows:
and the
Where:
is total shared traffic channels required
is average (long term) number of TS required for Circuit Switched traffic (=
is average (long term) number of TS required for HSCSD traffic (=
)
)
The channel occupation efficiency (e) is determined by first calculating

(
) without dividing by e and then using the result to
look up e in the Channel Occupation table.
Page 50

Version 5.1
The number of TRX required and

are determined using the channel to
transceiver map by increasing the number of TRX from the result of the previous
section until the number of available TS for traffic (NCS allocation) is equal to or
greater than

Circuit Switched Traffic
This section presents the calculation for the blocking for the current allocation of TRX
for CS and for each HSCSD multi-slot type traffic (%). It has been assumed
throughout that CS traffic and HSCSD traffic will take precedence over GPRS traffic
and therefore the Grade of Service for CS and HSCSD will not be affected by the
GPRS load.
Calculate the blocking for the CS traffic given the traffic load (
current allocation of TRX using the selected Erlang table.
) the
HSCSD Blocking
Blocking is calculated from Erlang B or C using the number of HSCSD TS currently
allocated to the cell and the HSCSD load in timeslot Erlangs.
= HSCSD traffic load
=timeslots allocated to CS
= number of CS timeslots that may be allocated to HSCSD
Erl = Erlang B or C functions returning blocking given traffic and channels
Summary blocking is the average of the four separate blocking values weighted by
the known distribution.

Version 5.1
Page 51
GPRS Data Rate

for the current allocation of TRX is determined by first
The GPRS data rate
calculating the number of TS required for CS and HSCSD. The remaining TS are
available for GPRS. That is:
Where:
e
is the efficiency from the Channel Occupation table determined from N

is the number of TS from the Channel Carrier Map for the current allocation of TRX

A table similar to that shown below is used to relate the number of timeslots available
to the channel occupancy for GPRS capacity calculations.
The table is stored in the database and you can edit the occupancy values.
Example of Channel Occupation Table, for Illustrative Purposes Only
Page 52

Version 5.1
FCC Calculations
This section describes the algorithms used to calculate the data provided in the FCC
report.
Antenna Height AAT
The Antenna Height AAT is calculated in metres.
The calculation is:
Antenna height + Site ground height + Radial average terrain elevation
The Radial average terrain elevation is the average ground height mapped along a
radial of between 3 km and 16 km from the site. If the mapping data prevent this then
it will not be calculated and this will be flagged in the FCC report.
Note : Feature height data and clutter heights are ignored in the calculation.
The best available resolution of the map data is used for this calculation. If the best
map data is 1000 m resolution then you will receive a warning noting that the map
data is of insufficient resolution for the FCC form.
Used Antenna Height
The Used Antenna Height AAT (metre) is subject to some minimum values according
to the FCC category and, the ERP.
Category
ERP (if necessary)
Minimum
32dBu Served
N/A
Minimum of 30 metres
32dBu Unserved
ERP>=10 W
Minimum of 30 metres
ERP<=10 W
Minimum of 3 metres
N/A
Minimum of 8 metres
Gulf of Mexico
Note : You will receive a warning if the Average Radial distance exceeds 40.2 km (79.1
km for Gulf of Mexico cells).
Transmitting ERP Watts
The transmitting ERP for a cardinal radial is the radiated power in Watts taking into
account the antenna gain for the azimuth, the down tilt and the base station
powers/losses.
Note : You will receive a warning if the ERP exceeds 500W.
Used ERPS
This is the value of the transmitting ERP which is used in the calculations, it is the
Transmitting ERP subject to certain minima.
Used ERP is the maximum of:
0.1 W
Maximum ERP/500
Transmitting ERP for the radial

Version 5.1
Page 53
Area within the Service Area Boundary

This will be calculated by finding the distance to the SAB for each degree by linear
interpolation of distance as a function of angle, hence dividing the area into triangular
sectors, joining at the site. The total area is then calculated by adding up the areas of
each of the triangles.
Heron's Formula for calculation of area of scalene triangle:
A = SQR(S (S-a) (S-b) (S-c))
SQR - Square Root
a, b, c sides of the triangle
S half the perimeter of triangle, that is (a+b+c)/2
Distance to Service Area Boundary
The distance to the SAB is calculated as shown here:
For:
The distance to the SAB is:
32dBu Served
D = 2.531 x Used Antenna Height(m) ^ 0.34 x Used ERP for

Radial in Watts ^ 0.17
and
32 dBu Unserved
Gulf of Mexico
Subject to a minimum distance of 5.4 km

D = 6.895 x Used Antenna Height(m) ^ 0.30 x Used ERP for
Radial (W) ^ 0.15
There is no minimum distance for this SAB
Two frequency calculations are used when you create a Frequency Plan report.
Effective Frequency Re-use
The effective frequency re-use is an approximate indication of the quality of the
hopping network.
It can be calculated for each subcell and also the average of these calculated to give a
figure for the network as a whole.
Where:
REFF is the Effective Frequency Re-use for a subcell
NF is the total number of carriers available to hopping TRX on the subcell (note: this is
not the MA list length)
NTRX is the number of hopping TRX on the subcell
Page 54

Version 5.1
Frequency Load
The average frequency load is another approximate indication of the quality of the
hopping network.
It can be calculated for each subcell and also the average of these calculated to give a
figure for the network as a whole.
Where:
LFREQ is the Frequency Load of a subcell
LFRACTION is the Fractional Load of a subcell
LHW is the Hardware Load of a subcell
NTRX is the number of hopping TRX on the subcell
NMA is the MA list length (i.e. all carriers assigned to hopping carrier layers on the
subcell)
E is the traffic that could be carried by the timeslots of hopping TRX on the subcell, at
a user specified Grade of Service (GoS), i.e.
NCSTS is the total number of timeslots installed this value is derived from the Carrier
to Timeslot map using NTRX.

Version 5.1
Page 55
Page 56

Version 5.1
APPENDIX C
UMTS Algorithms
In This Section
Notation for UMTS
UMTS Basic Formulae
UMTS Uplink Load
UMTS Activity Factor Calculation For Packet Services (Web Model)
Note : The UMTS algorithms in this section are relevant to both the 5.0 and the 5.1
Simulator. However, this section does not include HSDPA and OTSR algorithms
(which are supported in the 5.1 Simulator only).
If you are registered for a customer web account, you can access our Knowledgebase
on the Support website. This contains a specialised document named UMTS Static
Simulations 5.1, which provides details of all the algorithms and outputs related to the
5.1 Simulator.

Version 5.1
Page 57
Notation for UMTS

This list describes the notation symbols used in this section:
A Greek subscript always indexes a carrier
indicates a sum over all carriers
An uppercase Roman subscript always indexes a cell
indicates a sum over all cells

A lowercase Roman subscript always indexes a terminal
indicates a sum over all terminals
indicates a sum over all terminals in cell J
Up and down arrows
All quantities are in standard SI units, never in dB
indicate if a quantity is uplink or downlink
( E b N o ) Kj
represents the E b No for the uplink

As an example, the quantity
between terminal j and cell K using carrier .

This table describes the list of principal symbols for UMTS:
Page 58
Symbol
Description
A , A
Uplink (downlink) adjacent carrier interference ratio. Gives fractional power leakage from
carrier
to carrier .
( E b N o ) Jj
Uplink
E b No
( E b N o ) Jj
Downlink
( E c I o ) Jj
Pilot
G j G j
Uplink (downlink) processing gain
G antenna
J
Cell antenna gain
G antenna
j
Terminal antenna gain
G mha
J
Mast head amplifier gain
Boltzmann constant
E b No
E c Io

Version 5.1
Symbol
Description
Lmha
J
Mast head amplifier (downlink) insertion loss
LJj LJj
Uplink (downlink) linkloss between cell and terminal
Lpathloss
Jj
Pathloss between cell and terminal
Lantenna
Jj
Antenna masking loss
Lcable
J
Cable (feeder) loss
Lbody
j
Terminal body loss
N thermal
j
Thermal noise at terminal
N thermal
J
Thermal noise at cell
Pj
Terminal TX power
Ppilot
J
Cell pilot channel TX power
Pcommon
J
Cell common channel TX power
Psync
J
Cell synchronisation channel TX power
Ptraffic
Jj
Downlink traffic channel TX power
Ptotal
J
Total output TX power of cell
R total
j
Total received power at terminal
R total
J
Total received power at cell
(SIR ) Jj
Pilot SIR
Temperature
Chip rate
Uplink (downlink) service activity factor
Uplink (downlink) bearer control-overhead factor
Cell orthogonality factor
Terminal noise figure
Base station noise figure
mha
J
Mast head amplifier noise figure

Version 5.1
Page 59
Symbol
Description
cable
J
Cable (feeder) noise figure ( =
Lcable
J
)
UMTS Basic Formulae

The following formulae give the basic relations between link powers and noise.
Handover gains, power control headroom, and power rise gain have been ignored.
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
Page 60

Version 5.1

Uplink noise rise (on a cell) is the total received power divided by the background
noise. The noise rise on carrier of cell J is given by:
(12)
This is expressed in dB in the Cell Uplink Report.
UMTS Uplink Load

Uplink load (on a cell) is the total received power coming from all terminals divided
by the total received power. The cell load on carrier of cell J is given by
(13)
This is expressed as a percentage in the Cell Uplink Report.

Frequency re-use efficiency (on a cell) is the total received power coming from in-cell
terminals divided by the total received power coming from all terminals. The
frequency re-use efficiency on carrier of cell J is given by
(14)
This is expressed as a percentage in the Cell Uplink Report.

For a UMTS network, the Air Interface Bitrate is used in the calculation of processing
gain. The processing gain (
the air interface bitrate.
G j G j
,
) is calculated by dividing the system chiprate by
The User Bitrate is used purely to calculate traffic (data throughput) on a cell.

Version 5.1
Page 61

This section describes the shadow fade modelling that is used for UMTS.
Shadow fading is modelled in the simulator by applying random offsets to the
pathlosses experienced by each of the terminals in a snapshot. Shadow fades are lognormally distributed, and you may specify the standard deviation of shadow fading
for indoor and outdoor terminals in each clutter type. In reality, the fades between a
terminal and the cells that cover it will exhibit a degree of correlation. In particular, a
terminal is likely to have similar fades to cells that are located on the same site. In
order to model this in the simulation, you can specify two parameters in the Simulator
Wizard:
The normalised inter-site correlation coefficient (

). This is the correlation
between fades from a terminal to cells on different sites.
The normalised intra-site correlation coefficient (

between fades from a terminal to cells on the same site.
These two parameters must satisfy the constraints
For each terminal in a snapshot, a set of correlated fades to cells is generated using the
following procedure.
Note : All the random numbers mentioned below are independent and normally
distributed with zero mean and unit variance.
1
Generate a random number X.
For each site I, generate a random number
For each cell J, generate a random number
The fade (in dB) to cell J on site I is then set to:

(15).
where is the standard deviation of the shadow fading at the pixel (in dB).
The above procedure is performed whenever a terminal is initialised at the beginning
of a snapshot. Fades for different terminals are uncorrelated, even if the terminals are
located in the same pixel.

This section describes the power control error modelling for a UMTS network.
The simulator does not explicitly model the power control process, but it allows the
simulation results to exhibit certain features one would associate with imperfect
power control.
Page 62

Version 5.1
The standard deviation of power control error parameter controls the distribution of
achieved E b No values for successfully served terminals. If the standard deviation is
set to zero, the E b No values for each successfully served terminal are achieved
perfectly (ignoring quantisation and any lower limit on the link power). In a real
system this is not the case since imperfect power control produces a (log-normal)
distribution of achieved E b No values at a cell.
The simulator models imperfect power control by including a log-normal error on the
uplink and downlink transmit powers of successfully served terminals. The errors on
the uplink and downlink are uncorrelated, and are applied after all other handover
gains and margins have been considered. Terminals are never considered as having
failed to make a connection if the resulting error makes them transmit at too high or
too low a power.

The UMTS service activity affects three areas of the simulation.
Consumption of Resources
A successfully served circuit switched service will consume the same number of
resources regardless of the service activity factor. The number of resources in this case
depends only on the bearer used.
A successfully served packet switched service will consume a partial number of
resources depending on the service activity factor. For example, if a PS service is
served using a bearer that requires 2 resources and the activity factor is 1%, then 0.02
resources will be consumed.
Calculation of Throughput
The throughput of a successfully served service is calculated by multiplying the data
rate of the bearer used, by the service activity factor.
Calculation of Interference
Equations
Ptotal
= + Ppilot
+ Pcommon
+ Psync
+ j + j Ptraffic
J
J
J
J
Jj
j
(9)
(10)
(11)
all have a dependence on
Version 5.1
or
.
Page 63
UMTS Activity Factor Calculation For Packet Services

(Web Model)
Using the same notation as given in the WWW traffic model, the activity factor
formula is:
Where:
= Average packet time period (s)
= Size of a Packet (bytes)
= the Max Bit Rate the particular service supports (bit/s)
= Average session time period (s)
= Number of packet calls per session
= Reading time between packet calls (s)
= Number of packets within a packet call
= Inter arrival time between packets in a packet call (s)
= Retransmission factor (%)

You can indicate if a cell has an antenna system providing transmit or receive
diversity by ticking the appropriate check boxes in the Site Database. Transmit
(receive) diversity on a cell effectively reduces the E b No requirement on the
downlink (uplink). When defining a service, you must specify two requirements for
the downlink (uplink). One requirement is used on cells with transmit (receive)
diversity and the other is used on cells without transmit (receive) diversity.
Page 64

Version 5.1

Handover gains are speed-dependent, and so each terminal in the simulation is given
a random speed. For each terminal type and clutter type, you must specify four
parameters that determine the speed distribution. These are the mean speed (
),
the standard deviation of the speed distribution (
and the maximum speed (
), the minimum speed (
). A random speed is then given by:

(16)
where is a random number taken from a normal distribution of zero mean and unit
variance.

This section gives an overview of a UMTS snapshot.
The aim of a snapshot is to produce a plausible picture of the network at a particular
instant in time. This picture will typically consist of a set of successfully served
terminals and their states, that is the link powers and handover state, and a set of
unserved terminals and their reasons for failure. Many snapshots must be performed
and the results from them averaged in order to produce an overall picture of network
behaviour. A snapshot involves the stages outlined in the following diagram:
Initialisation of Terminals
Initialisation of System Powers and Resource Usage
Perform Iterations Until Convergence Achieved
Gathering of Results

Version 5.1
Page 65
UMTS Initialisation of Terminals

The first stage of a snapshot involves creating a geographical distribution of terminals
attempting to connect to the network.
Each pixel is allocated a random, Poisson-distributed, number of terminals, according
to the mean number of terminals specified for the pixel in the terminal-density array.
Also, during this initialisation stage, each terminal is given a set of random lognormal fades, one for each cell that covers it (that is, for each cell from which it has a
pathloss).
A random power control error is chosen for the uplink and downlink. A terminal
will use the same random values (fading, power control error, speed) for the duration
of its existence in a snapshot.
After all the terminals have been created, they are given a random ordering which
sets the sequence in which they will be considered during an iteration.
Initialisation of System Powers and Resource Usage in UMTS

Before commencing the iterative process, the system is placed in a known state,
namely the state of an unloaded network. This is simply done by setting all link
powers to zero, and making all resources available at the cells.
UMTS Iterations
An iteration involves sequentially evaluating the terminals (precisely once) to see if
they can make a connection to the network. After each terminal is evaluated, the noise
in the network (at cells and terminals) is updated before moving on to evaluate the
next terminal.
A terminal may connect to the network in a variety of different ways (connection
scenarios). For example a terminal may have several different cells or carriers that it
may use. Each of the connection scenarios for a terminal is evaluated in turn until one
that allows a successful connection is found. If no scenario can produce a successful
connection to the network, the link powers for the terminal are set to zero, and the
reasons for failure of the first scenario are recorded.
Terminals which fail to make a connection in an iteration are not removed from the
simulation, since success or failure in an iteration does not necessarily ensure the
same result in a subsequent iteration. In fact, the state (succeeded/failed) of a terminal
is determined purely by its state in the final iteration of a snapshot when convergence
has been achieved.
Page 66

Version 5.1
The following diagram illustrates how a snapshot converges with successive

iterations. Each histogram shows the distribution of achieved uplink values for
successfully served terminals. All terminals are running a service with an uplink
requirement of 6 dB.
End of
Iteration 1
<4
End of
Iteration 3
Eb/No
<4
Eb/No
Eb/No
End of
Iteration 7
End of
Iteration 5
<4
Eb/No
<4
After the first iteration, the majority of served terminals fail to meet their
requirement. This is because terminals evaluated at the beginning of the first iteration
see little or no interference and so have their TX powers set to low values. By the end
of the first iteration, the noise in the system will have increased due to interference
from the newly served terminals. Hence terminals evaluated at the beginning of the
first iteration will no longer attain their desired by the end of the first iteration. In fact,
only the last terminal served is guaranteed to achieve its desired.
Successive iterations produce increasingly accurate pictures of network noise, and a
larger proportion of the terminals meet their requirement. By the seventh iteration in
the example above, practically all the served terminals meet their requirement, and
the system noise no longer changes significantly between iterations. The iterations
have converged to produce a plausible picture of served and failed terminals in the
network. Any remaining distribution in the achieved values of served terminals is
largely due to quantisation of link powers, or from specifying a non-zero power
control error standard deviation.
Convergence Criteria for UMTS

A good practical measure of convergence is to examine how the total uplink and
downlink interference from terminals (summed over all cells) changes between
iterations. This is considerably faster than measuring the distribution of achieved
E b No values.
If the percentage change in total uplink and downlink interference changes by an
amount smaller than the specified threshold, for 15 consecutive iterations, then the
iterations are deemed to have converged. The default threshold is a 1% change.

Version 5.1
Page 67
Gathering of Results in UMTS

The final stage of a snapshot involves gathering results from the current snapshot and
combining them with the results from previous snapshots, so that average values for
the geographic output arrays and Excel reports may be calculated. The information
gathered includes cell information such as resource and power usage, information
about the states of successfully served terminals, and the reasons for failure of
terminals which failed to be served.

A UMTS Connection Scenario consists of the following pieces of information.
Carrier
Carrier load status (overloaded/underloaded). If any covering cell uses the above
carrier and exceeds its load balance threshold, then the carrier load status is set
to overloaded. Otherwise the carrier load status is set to underloaded.
Primary cell
Ec Io of primary cell
UL bearer
DL bearer
The rules for prioritising scenarios during connection evaluation are (in order of
decreasing importance):
Page 68
Underloaded (before overloaded) carriers
Higher (before lower) priority carriers (with respect to service)
Higher (before lower) Ec Io
Higher (before lower) priority DL bearers (with respect to service-carrier)
Higher (before lower) priority UL bearers (with respect to service-carrier)

Version 5.1

There are three stages to evaluating a UMTS connection scenario to see if a terminal
may be served:
Production of a candidate active set for the terminal
Uplink evaluation
Downlink evaluation
Production of a Candidate Active Set in UMTS

In order for a cell to be in the candidate active set of a terminal, it must have an
adequate number of primary or handover resources available, and the pilot Ec Io or
SIR for the cell must also be of an acceptable level. It is necessary to produce a
candidate active set before the uplink and downlink can be evaluated. A candidate
active set is produced by the following steps:
Check primary resource availability & pilot
SIR level for
candidate primary cell.
Check handover resource availability & pilot
E c I o levels for
candidate handover cells.
The connection scenario being examined sets the candidate primary cell. This cell is
checked to see if it has a sufficient number of primary resources available, and to see
if it provides an adequate pilot SIR level at the terminal. If these conditions are met,
the cell is flagged as the primary cell of the candidate active set.
The remaining covering cells are evaluated to see if they can be handover cells. Cells
with a low downlink linkloss are checked before cells with a higher downlink
linkloss. A handover cell must have a sufficient number of handover resources
available, and provide an level that is within the handover margin of the level of the
primary cell. Each cell that satisfies these requirements is flagged as a handover cell
of the candidate active set unless the active set size limit specified by the primary cell
has been reached.

Version 5.1
Page 69
UMTS Uplink Evaluation

This is the process of determining the terminal transmit power required to meet the
uplink E b No requirement. It is necessary to consider several effects here, such as
handover gains, power control headroom, and noise rise limits on cells. The uplink
evaluation carries out the following procedure:
Calculate required terminal power to meet Eb
cell in candidate active set.
N o for each
Temporarily set terminal power to the lowest possible power

that will achieve a satisfactory Eb N o value.
Calculate difference between two best
Eb N o values achieved
on cells in the candidate active set.
Calculate handover gains, power rise, and

power control headroom.
See if terminal has sufficient power to make link.
Check terminal power does not break noise rise limit on any
cells.
Apply log-normal error to uplink power, ensuring that all cell

noise-rise and terminal power limits are not broken.
For each cell in the candidate active set, the terminal transmit power required to meet
the uplink E b No is calculated. This lowest of these values is then quantised
according to the quantisation level specified for the terminal. We call the resulting
power P
base
. The terminal transmit power is temporarily set to P
base
, and the two best
E b No values on cells in the candidate active set are calculated. The difference
between these two values (in dB), together with the terminal speed, allows the
following quantities to be determined from the tables that you supply in the Services
dialog box.
Page 70

Version 5.1
Terminal Power Reduction

The terminal power reduction (
) is a gain that reduces the required
transmit power of the terminal. It is equivalent to a reduction in the uplink
requirement.
Average Power Rise

power rise
The Average Power Rise ( P

) effect is due to fast power control. Fast power
control can compensate for fading in a channel and keep the received power (from a
terminal) fairly constant in the cell providing the power control. However this
compensation for fades causes peaks in the terminal transmission power. This results
in a rise in the average interference experienced in other cells. This is modelled in the
simulator by adding an average transmit power rise to the terminal transmit power
when calculating the uplink interference caused in other cells. When calculating the
interference a terminal causes to its own cell, the average power rise is not added.
Power Control Headroom

pch
The Power Control Headroom ( H ) is also called shadow fade margin. This is an
overhead on the transmit power a terminal requires to make the uplink. It is a
function of terminal speed, and the overhead is largest for slow moving terminals.
The overhead ensures that the uplink power control is able to compensate for deep
fades at a cell border.
Soft Handover Gain against Average Power Rise

The Soft Handover Gain against Average Power Rise ( G
power rise
power rise for soft handover cells. For non-handover cells, G
) reduces the average
power rise
= 1.
Soft Handover Gain against Power Control Headroom

The Soft Handover Gain against Power Control Headroom ( G
control headroom when a terminal is in soft handover.
pch
) reduces the power
After all the above quantities have been calculated, the terminal is checked to see if it
has sufficient power to make the uplink. The actual transmit power of the terminal
(
) is given by
(17)
The uplink E b No requirement can be satisfied if

(18)
where
is the maximum possible transmit power of the terminal.

Version 5.1
Page 71
The terminal is also checked to see if it will break the noise rise limit on any of the
covering cells. When calculating the interference, the terminal power is taken as
When calculating the interference produced on other cells, the terminal power is
taken as
. If the terminal cannot meet the uplink
E b No requirement without breaking a noise rise limit, then the terminal fails to be
is finally given a random (logserved. If the uplink can be successfully achieved,
normal) adjustment to model the effect of imperfect power control.
UMTS Downlink Evaluation

This is the process of determining the cell transmit powers required to meet the
downlink E b No requirement at the terminal. It is necessary to consider the effect of
maximal ratio combining when there are multiple links. The downlink evaluation
carries out the following procedure.
Calculate difference between two best E c I o values from
cells in the candidate active set.
Read downlink Eb N o target reduction.
Calculate the lowest cell TX power ( T ) that will achieve a

satisfactory Eb N o value.
Set TX powers for cells in candidate active set to
Iterate
until
Eb/No
achieved
or not
changing
between
iterations
T.
Calculate total achieved Eb N o at terminal assuming maximal

ratio combining of links.
Increase/Decrease
T if total achieved Eb N o at terminal is

too low/high.
Apply log-normal error to all downlink powers, ensuring that

all downlink power limits and cell power limits are not broken.
Page 72

Version 5.1
The difference between the two best Ec Io values of cells in the candidate active set is
calculated. This figure, together with the terminal speed, determines the downlink
E b No target reduction in soft handover. This is found by linear interpolation of the

values that you supply in the Services dialog box.
The downlink powers for cells in the candidate active set are calculated iteratively.
The iterative procedure involves setting all downlink powers to the same (non-zero)
value T . The total E b No achieved is then calculated by summing the E b No values
for individual downlinks. If the total achieved E b No is too low (high) by a factor of
k , then T is increased (decreased) by a factor of k . This process continues until T
ceases to change between iterations, or the downlink E b No requirement is achieved.
Note : Individual downlink powers are kept within the limits that you supply
throughout the iterative procedure outlined above, so cells will never be allowed to
transmit more power than they have available.
If the downlink E b No requirement cannot be achieved, then the terminal fails to be
served, and all downlink powers are set to zero.

This section describes UMTS blocking probabilities, as follows:
Calculation of Blocking Probability in the Blocking Report
Blocking Probability and Failure Rate
Coverage Probability Array in the Map View Window
Calculation of Blocking Probability in the Blocking Report for

UMTS
The blocking probabilities for cells (shown in the blocking report) cannot be found by
simply averaging the blocking probabilities at pixels in the Map View window for the
following reasons:
Pixels with high traffic should have more influence on cell blocking probability
than pixels with low traffic.
Pixels in coverage holes should not influence cell blocking probability, even if they
contain high traffic.
A service may use some bearers more frequently than others. Frequently used
bearers should have more influence on the blocking probability than infrequently
used bearers.
Several cells may serve the traffic at a pixel.

Version 5.1
Page 73
A measure of blocking probability that is sensibly weighted is needed with respect to

these factors. Such a measure can be found by selective passive-scanning at the end of
a snapshot. This is different to the usual (global) passive-scanning that the user selects
in the simulation wizard. Global passive-scanning tests all pixels and allows all
scenarios to be evaluated, whereas selective passive-scanning only tests a subset of
pixels and scenarios at the end of each snapshot.
To determine which pixels and scenarios to check, the successfully served terminals
are taken from the previous snapshot and used to check for blocking at the end of the
current snapshot. Each terminal is placed at the location it had in the previous
snapshot, and checked to see if it can connect to the cell that previously served it,
using the previous UL and DL bearer.
This automatically ensures that the cell blocking probability is correctly weighted,
since the most likely terminal locations and connection scenarios are checked.
Blocking Probability and Failure Rate for UMTS

The blocking probability measured in the tool is more similar to a Lost Call Held
blocking probability than a Lost Call Cleared (Erlang-B) blocking probability. This is a
consequence of the way the simulator works. The simulator simply tries to serve as
much of the offered traffic as possible. The following formulae show how these
probabilities are related in a simple situation.
Note : These formulae are not used to explicitly calculate blocking probabilities in the
tool, since the probabilities in the tool are all found by sampling snapshots.
Take a system with fixed capacity
second and mean holding time
, and Poisson traffic with arrival rate
users per
seconds. The mean offered traffic is
The probability that exactly C users are offered.
.
(19)
(20)
The probability that more than C users are offered.

(21)
The probability that less than C users are offered.
Lost Call Cleared: In an LCC system, blocked users do not try again.
(22)
Lost Call Held: In an LCH system, blocked users persistently retry until connected.
(23)
Page 74

Version 5.1
It is easy to show that

to each other for low blocking probabilities.
Note : The Failure Rate (
terminals that fail.
. The two probabilities are most similar
) in the failure report is the proportion of offered

(24)
This is NOT a blocking probability and it should never be treated as one. The failure
rate can be an order of magnitude lower than both the LCC and LCH blocking
probabilities.
UMTS Coverage Probability Array in the Map View

The meaning of coverage probability shown in the Map View is dependent on
whether the (global) passive-scan terminal is being used to test every pixel at the end
of a snapshot.
When running a simulation with passive-scan disabled, the coverage probability in
the Map View is determined by the connection attempts made by the randomly
scattered terminals. It gives the proportion of offered terminals at the pixel that were
successfully served. This is not related to the blocking probability at the pixel. In fact
it is more like the complement of the failure rate given in the reports. For example,
a cell with a coverage probability of 20% at most pixels would give a failure rate of
about 80% in the report.
When running a simulation with passive-scan enabled, the coverage probability at
each pixel in the Map View is determined largely by the connection attempts of
passive-scan terminals at the end of the snapshot. In this case, the coverage
probability is simply the complement of the blocking probability at the pixel that is,
the two probabilities sum to 1.
To summarise, if want to see blocking (and its causes) in the Map View, then the
passive-scan should be enabled. If you would only like to view the reports, then the
passive-scan terminal may be disabled.
Note : The blocking probability report is always calculated using the selective passivescanning technique, which is totally independent of the global passive-scanning used
for the Map View.

Version 5.1
Page 75
Page 76

Version 5.1
APPENDIX D
CDMA2000 Algorithms
In This Section
CDMA2000 Notation
CDMA2000 Activity Factor Calculation For Packet Services (Web Model)
Calculation of Equivalent Control Overhead Factors for CDMA2000
Note : The CDMA2000 algorithms in this section are relevant to both the 5.0 and the
5.1 Simulator. However, this section does not include all the algorithms which are
supported in the 5.1 Simulator.
If you are registered for a customer web account, you can access our Knowledgebase
on the Support website. This contains a specialised document named CDMA2000
Static Simulations 5.1, which provides details of all the algorithms and outputs related
to the 5.1 Simulator.

Version 5.1
Page 77
CDMA2000 Notation
A Greek subscript always indexes a carrier.

indicates a sum over all carriers.
An uppercase Roman subscript always indexes a sector.

indicates a sum over all sectors
Eb Nt .
A lowercase Roman subscript always indexes a terminal.

indicates a sum over all terminals.
indicates a sum over all terminals in sector J.
Up and down arrows
All quantities are in standard SI units, never in dB.
indicate if a quantity is uplink or downlink.
(E
N )
b
t Kj represents the
between terminal j and sector K using carrier .
E b N t for the uplink

The following table describes the list of principal symbols for CDMA2000:
Symbol
Description
A , A
Uplink (downlink) adjacent carrier interference ratio. Gives fractional power leakage from
carrier
to carrier .
( E b N t ) Jj
Uplink
Eb Nt
( E b N t ) Jj
Downlink
( E c I o ) Jj
Pilot
G j G j
Uplink (downlink) processing gain
G antenna
J
Sector antenna gain
G antenna
j
G mha
J
Boltzmann constant
Eb Nt
E c Io
Page 78

Version 5.1
Symbol
Description
Lmha
J
Mast head amplifier (downlink) insertion loss
LJj LJj
Uplink (downlink) linkloss between sector and terminal
Lpathloss
Jj
Pathloss between sector and terminal
Lantenna
Jj
Lcable
J
Cable (feeder) loss
Lcombiner
J
TX combiner loss (downlink)
Lsplitter
J
RX splitter loss (uplink)
Lbody
j
Terminal body loss
N thermal
j
N thermal
J
Thermal noise at sector
N excess
J
Excess noise at sector
Pj
Terminal TX power
Pbroadcast
J
Downlink broadcast channel TX power
gnment
Pcommonassi
J
Downlink common-assignment channel TX power
rol
Pcommoncont
J
Downlink common-control channel TX power
rcontrol
Pcommonpowe
J
Downlink common-power-control channel TX power
ontrol
Pdedicatedc
J
Downlink dedicated-control channel TX power
Ppilot
J
Sector pilot channel TX power
Ppaging
J
Sector paging channel TX power (summed over all paging channels)
g
Pquickpagin
J
Downlink quick-paging channel TX power
Psync
J
Sector synchronisation channel TX power
Ptraffic
Jj
Downlink traffic channel TX power
Ptotal
J
Total output TX power of sector
R total
j

Version 5.1
Page 79
Symbol
Description
R total
J
Total received power at sector
Temperature
Chip rate
Uplink (downlink) service activity factor
Uplink (downlink) bearer control-overhead factor
mha
J
cable
J
Lcable
J
)

Handoff gains, power control headroom, and power rise gain have been ignored.
(1)
(2)
(3)
(4)
(5)
(6)
(7)
Page 80

Version 5.1
(8)
(9)
(10)

Uplink noise rise (on a sector) is the total received power divided by the background
noise. The noise rise on carrier of sector J is given by
(11)
This is expressed in dB in the Sector Uplink Report.

Uplink load (on a sector) is the total received power coming from all terminals
divided by the total received power. The sector load on carrier of sector J is given
by:
(12)
This is expressed as a percentage in the Sector Uplink Report.

Frequency re-use efficiency (on a sector) is the total received power coming from insector terminals divided by the total received power coming from all terminals. The
frequency re-use efficiency on carrier of sector J is given by:
(13)
This is expressed as a percentage in the Sector Uplink Report.

Version 5.1
Page 81

The Air Interface Bitrate is used in the calculation of processing gain. The processing
G j G j
gain (
bitrate.
) is calculated by dividing the system chiprate by the air interface
The User Bitrate is used purely to calculate traffic (data throughput) on a sector.

This section describes the shadow fade modelling that is used for CDMA2000.
pathlosses experienced by each of the terminals in a snapshot. Shadow fades are lognormally distributed, and you may specify the standard deviation of shadow fading
for indoor and outdoor terminals in each clutter type. In reality, the fades between a
terminal and the sectors that cover it will exhibit a degree of correlation. In particular,
a terminal is likely to have similar fades to sectors that are located on the same site. In
order to model this in the simulation, you can set two parameters in the Simulator
wizard:

between fades from a terminal to sectors on different sites.

between fades from a terminal to sectors on the same site.
These two parameters must satisfy the constraints
For each terminal in a snapshot, a set of correlated fades to sectors is generated using
the following procedure:
Note : All the random numbers mentioned are independent and normally distributed
with zero mean and unit variance.
1
Generate a random number
For each site
For each sector
The fade (in dB) to sector
, generate a random number

, generate a random number
on site
.
.
is then set to
(14)
where
is the standard deviation of the shadow fading at the pixel (in dB).
This procedure is performed whenever a terminal is initialised at the beginning of a

snapshot. Fades for different terminals are uncorrelated, even if the terminals are
Page 82

Version 5.1

This section describes the power control error modelling for a CDMA2000 network:
power control.
E b N t values for successfully served terminals. If the standard deviation is

E N t values for each successfully served terminal are achieved
set to zero, the b
achieved
system this is not the case since imperfect power control produces a (log-normal)
distribution of achieved
E b N t values at a sector.
uplink and downlink transmit powers of successfully served terminals. The errors on
the uplink and downlink are uncorrelated, and are applied after all other handoff
gains and margins have been considered. Terminals are never considered as having
failed to make a connection if the resulting error makes them transmit at too high or
too low a power.

The CDMA2000 service activity affects three areas of the simulation.
Consumption of Resources
A successfully served circuit switched service will consume the same number of
resources regardless of the service activity factor. The number of resources in this case
depends only on the bearer used.
A successfully served packet switched service will consume a partial number of
resources depending on the service activity factor. For example, if a PS service is
served using a bearer that requires 2 resources and the activity factor is 1%, then 0.02
resources will be consumed.
Calculation of Throughput
The throughput of a successfully served service is calculated by multiplying the data
rate of the bearer used, by the service activity factor.

Version 5.1
Page 83
Calculation of Interference
Equations:
(9)
(10)
and
(11)
all have a dependence on
or
CDMA2000 Activity Factor Calculation For Packet

Services (Web Model)
Using the same notation as given in the WWW traffic model, the activity factor
formula is:
Where:
= Average packet time period (s)
= Size of a Packet (bytes)
= the Max Bit Rate the particular service supports (bit/s)
= Average session time period (s)
= Number of packet calls per session
= Reading time between packet calls (s)
= Number of packets within a packet call
= Inter arrival time between packets in a packet call (s)
= Retransmission factor (%)
Page 84

Version 5.1

You can indicate if a sector has an antenna system providing transmit or receive
diversity by selecting the appropriate check boxes in the Site Database. Transmit
E b N t requirement on the
E Nt
downlink (uplink). When defining a service, you must specify two b
(receive) diversity on a sector effectively reduces the
t requirement is used on sectors

requirements for the downlink (uplink). One b
with transmit (receive) diversity and the other is used on sectors without transmit
(receive) diversity.

Handoff gains are speed dependent, and so each terminal in the simulation is given a
random speed. For each terminal type and clutter type, you specify four parameters
that determine the speed distribution. These are:
The mean speed (
The standard deviation of the speed distribution (
The minimum speed (
The maximum speed (
).
)
)
A random speed is then given by:

(15)
where
is a random number taken from a normal distribution of zero mean and
unit variance.

Version 5.1
Page 85

The PN code assignment algorithm is a two-stage process.
1
Find the most difficult sector to assign a PN code.
Find the best PN code to assign and then assign it to the sector.
The PN code calculation continues until all sectors have been assigned a PN code.
Difficulty Factor for CDMA2000

The difficulty factor, DF, for a sector is calculated as:
Where:
A is the number of adjacent sectors
is the number of adjacent sectors with codes assigned
N is the number of nearby sectors
is the number of nearby sectors with codes assigned
Nbr is the number of first and second order neighbours
s the number of first and second order neighbours with codes assigned
If the minimum code re-use distance is not selected in the parameters page then N
and NA are set to zero, the same applies to first and second order neighbours.
Best PN Code to Assign for CDMA2000

Once the most difficult sector has been found, the best PN code, that is the code with
the lowest penalty, needs to be found and assigned to that sector.
The following penalty values can be given to a PN code:
2.1e+78 if the code is not unique with respect to the neighbouring sectors
-10,000,000 if the code does not clash with neighbouring, nearby or interfering
sectors
100,000 + max interfering power, if the code clashes with nearby or interfering
sectors
Quality Factor for CDMA2000

Once the PN codes are assigned, a measure of quality is calculated. The quality does
not change if sectors within the reuse distance have the same code applied. This
information can be seen in the sectors within the minimum re-use distance column in
the report. Instead, the quality is a measure of signal to noise ratio and best server
area.
Page 86

Version 5.1
On a particular pixel, the strongest power is determined for every supported carrier
in turn. The best signal to interference ratio (SIR) is found for each of these strongest
carriers via the equation:
SIR = covering sector power / (interference + covering sector power)
Interference is the noise contribution from overlapping carriers on sectors with the
same PN code as the best carrier. A running total of SIR for all carriers on the sector is
kept along with the number of pixels on which the sectors carriers were the best
server. Quality is calculated as SIR/best server area *100 for each sector.

This section gives an overview of a CDMA2000 snapshot.
terminals and their states, that is the link powers and handoff state, and a set of
behaviour. A snapshot involves the stages outlined in the following diagram:
Initialisation of System Powers and Resource Usage
CDMA2000 Initialisation of Terminals

attempting to connect to the network. Each pixel is allocated a random, Poissondistributed, number of terminals, according to the mean number of terminals
specified for the pixel in the terminal-density array. Also during this initialisation
stage, each terminal is given a set of random log-normal fades, one for each sector that
covers it, that is it has a pathloss to it. A random Power Control Error is chosen for the
uplink and downlink. A terminal will use the same random values (fading, power
control error, activity flags and speed) for the duration of its existence in a snapshot.

Version 5.1
Page 87
Initialisation of System Powers and Resource Usage in

CDMA2000
Before commencing the iterative process, the system is placed in a known state,
powers to zero, and making all resources available at the sectors.
CDMA2000 Iterations
in the network (at sectors and terminals) is updated before moving on to evaluate the
next terminal.
scenarios). For example a terminal may have several different sectors or carriers that it
that allows a successful connection is found. If no scenario can produce a successful
connection to the network, the link powers for the terminal are set to zero, and the
Terminals that fail to make a connection in an iteration are not removed from the
has been achieved.
t values
iterations. Each histogram shows the distribution of achieved uplink b
for successfully served terminals. All terminals are running a service with an uplink
requirement of 6 dB.
End of
Iteration 1
<4
End of
Iteration 3
Eb/No
<4
Page 88
Eb/No
Eb/No
End of
Iteration 7
End of
Iteration 5
<4
Eb/No
<4

Version 5.1
After the first iteration, the majority of served terminals fail to meet their
first iteration will no longer attain their desired by the end of the first iteration. In
fact, only the last terminal served is guaranteed to achieve its desired .
Successive iterations produce increasingly accurate pictures of network noise, and a
larger proportion of the terminals meet their requirement. By the seventh iteration in
the example above, practically all the served terminals meet their requirement, and
the system noise no longer changes significantly between iterations. The iterations
have converged to produce a plausible picture of served and failed terminals in the
network. Any remaining distribution in the achieved values of served terminals is
largely due to quantisation of link powers, or from specifying a non-zero power
Convergence Criteria for CDMA2000

downlink interference from terminals (summed over all sectors) changes between
E b N t values.
Gathering Of Results in CDMA2000

gathered includes sector information such as resource and power usage, information
about the states of successfully served terminals, and the reasons for failure of
terminals that failed to be served.

Version 5.1
Page 89

A CDMA2000 Connection Scenario consists of the following pieces of information:
Carrier
Primary sector
Ec Io of primary sector
UL bearer
DL bearer
UL radio configuration (CDMA2000 only),
DL radio configuration (CDMA2000 only)
Required
(HDR only)
Page 90
Higher (before lower) priority Downlink radio configurations (with respect to

service)
Higher (before lower) Ec Io (CDMA2000 only)
Higher (before lower) required
Higher (before lower) priority DL bearers (with respect to service-carrier)
Higher (before lower) priority UL bearers (with respect to service-carrier)
(HDR only)

Version 5.1

There are three stages to evaluating a CDMA2000 connection scenario to see if a
terminal may be served:
Production of a candidate active set for the terminal
Uplink evaluation
Downlink evaluation
Production of a Candidate Active Set in CDMA2000

In order for a sector to be in the candidate active set of a terminal, it must have an
adequate number of primary or handoff resources available, and the pilot Ec Io for
the sector must also be of an acceptable level. It is necessary to produce a candidate
active set before the uplink and downlink can be evaluated. A candidate active set is
produced by the following steps:
Check primary resource availability & pilot
Ec I o level for
candidate primary sector.
Check handoff resource availability & pilot
Ec I o levels for
candidate handoff sectors.
The connection scenario being examined sets the candidate primary sector. This sector
is checked to see if it has a sufficient number of primary resources available, and to
see if it provides an adequate Ec Io level at the terminal. If these conditions are met,
the sector is flagged as the primary sector of the candidate active set.
Each of the remaining sectors that have a pathloss to the terminal are evaluated to see
if they can be handoff sectors. Sectors with low downlink linkloss are checked before
sectors with a higher downlink linkloss. A handoff sector must have a sufficient
number of handoff resources available, and provide an Ec Io level that is above the
T_DROP level specified on the primary sector. Each sector that satisfies these
requirements is flagged as a handoff sector of the candidate active set unless the
active set size limit specified by the primary sector has been reached.

Version 5.1
Page 91
CDMA2000 Uplink Evaluation

This is the process of determining the terminal transmit power required to meet the
t requirement. It is necessary to consider several effects here, such as

uplink b
handoff gains, power control headroom, and noise rise limits on sectors. The uplink
evaluation carries out the following procedure:

sector in candidate active set.
N t for each

that will achieve a satisfactory Eb N t value.
Eb N t values achieved
on sectors in the candidate active set.
Calculate soft handoff TX power reduction.
sectors.
Apply log-normal error to uplink power, ensuring that all sector

For each sector in the candidate active set, the terminal transmit power required to
t is calculated. This lowest of these values is then quantised

meet the uplink b
power
. The terminal transmit power is temporarily set to
, and the two best
E b N t values on sectors in the candidate active set are calculated. The difference
terminal power reduction (
in the Services dialog box.
Page 92
) to be determined from the tables that you set

Version 5.1

requirement.
Eb Nt
After the terminal power reduction has been calculated, the terminal is checked to see
if it has sufficient power to make the uplink. The actual transmit power of the
terminal (
) is given by:
(16)
The uplink
E b N t requirement can be satisfied if

(17)
where
covering sectors. When calculating the interference, the terminal power is taken as
t requirement without breaking a

. If the terminal cannot meet the uplink b
noise rise limit, then the terminal fails to be served. If the uplink can be successfully
is finally given a random (log-normal) adjustment to model the effect

achieved,
of imperfect power control.
Calculation of Equivalent Control Overhead Factors for

CDMA2000
This section describes CDMA2000 control overhead factor calculations, as follows:
Uplink RC1 RC2
Uplink RC3 RC6 When Using a Supplemental Bearer
Uplink RC3 RC6 When Not Using a Supplemental Bearer
Downlink RC1 RC2
Downlink RC3 RC10

Version 5.1
Page 93
Uplink RC1 - RC2

The activity factor
gives the proportion of time that the service is active. During an
inactive period, the terminal maintains an uplink using an 1/8th rate bearer (called
here the inactive bearer). The following diagram represent the powers transmitted in
the active and inactive periods.
active and inactive periods.
F1
and
are the fundamental channel powers in the
Active Fundamental
Bearer
Inactive Fundamental
Bearer
(Active
Period)
F2
1
(Inactive
Period)
The average uplink power is given by
which can be rewritten as
The ratio of transmit powers for the active and inactive fundamental bearers
is given by the ratio of their (
) requirements and processing gains as follows:
Hard-coded look-up tables give
and
. The ratio of transmit powers

is given by the ratio of their
for the active and inactive fundamental bearers

(
E b N t ) requirements and processing gains as follows:
So in equations (1) and (10), the factor
Page 94
is given by:

Version 5.1
Uplink RC3 - RC6 When Using a Supplemental Bearer

The activity factor
here the inactive bearer). The following diagram represents the powers transmitted
during active and inactive periods.
and
active period.
inactive periods and
is the supplemental channel powers in the
are the fundamental channel powers in the active and

is the uplink pilot power.
S1
Active Supplemental Bearer
F1
Active Fundamental Bearer

Bearer
F2
Active Fundamental
Bearer
P
Pilot
1
(Inactive
Period)
(Active
Period)
The average uplink power is given by:
Which can be rewritten as:
So in equations (1) and (10), the factor is given by:

Version 5.1
Page 95
Uplink RC3 - RC6 When Not Using a Supplemental Bearer

The activity factor
and
active period.
inactive periods and
F1

is the uplink pilot power:

Bearer
F2
Active Fundamental
Bearer
P
Pilot
1
(Inactive
Period)
(Active
Period)
which can be rewritten as:

Page 96
and
.
is given by:

Version 5.1
Downlink RC1 - RC2

The activity factor
inactive period, the terminal maintains a downlink using an 1/8th rate bearer (called
here the inactive bearer). The following diagram represents the powers transmitted in
the active and inactive periods.
active and inactive periods.
F1
and
are the fundamental channel powers in the

Inactive Fundamental Bearer
(Active Period)
F2
1-
(Inactive Period)
The average downlink power is given by:
The ratio of transmit powers for the active and inactive fundamental bearers
) requirements and processing gains as follows:

Version 5.1
is given by:
Page 97
Downlink RC3 - RC10

The activity factor
inactive period, the terminal maintains a downlink using an 1/8th rate bearer (called
active period.
and
inactive periods periods.
S1
Active Supplemental Bearer
F1
(Active Period)
Inactive Fundamental Bearer
F2
1-
(Inactive Period)
The ratio of fundamental powers to the power of the active supplemental bearer
and
processing gains as follows:
Page 98
) requirements and
is given by:

Version 5.1

This section describes CDMA2000 blocking probabilities, as follows:
Calculation of Blocking Probability in the Blocking Report
Blocking Probability and Failure Rate
Coverage Probability Array in the Map View Window
Calculation of Blocking Probability in the Blocking Report for

CDMA2000
The blocking probabilities for cells (shown in the blocking report) cannot be found by
simply averaging the blocking probabilities at pixels in the Map View window for the
following reasons:
Pixels with high traffic should have more influence on cell blocking probability
than pixels with low traffic.
Pixels in coverage holes should not influence cell blocking probability, even if they
contain high traffic.
A service may use some bearers more frequently than others. Frequently used
bearers should have more influence on the blocking probability than infrequently
used bearers.
Several cells may serve the traffic at a pixel.
We need a measure of blocking probability that is sensibly weighted with respect to

all the above factors. We can find such a measure by selective passive-scanning at the
end of a snapshot. This is different to the usual (global) passive-scanning that the user
selects in the simulation wizard. Global passive-scanning tests all pixels and allows all
scenarios to be evaluated, whereas selective passive-scanning only tests a subset of
pixels and scenarios at the end of each snapshot.
To determine which pixels and scenarios to check, we take the successfully served
terminals from the previous snapshot and use them to check for blocking at the end of
the current snapshot. Each terminal is placed at the location it had in the previous
snapshot, and checked to see if it can connect to the cell that previously served it,
using the previous UL and DL bearer.
This automatically ensures that the cell blocking probability is correctly weighted,
since the most likely terminal locations and connection scenarios are checked.

Version 5.1
Page 99
CDMA2000 Blocking Probability and Failure Rate

The blocking probability measured in the tool is more similar to a Lost Call Held
tool, since the probabilities in the tool are all found by sampling snapshots.
, and Poisson traffic with arrival rate
users per
seconds. The mean offered traffic is
The probability that exactly C users are offered.
.
(18)
(19)
The probability that more than C users are offered.

(20)
The probability that less than C users are offered.
(21)
(22)

Note : The Failure Rate (
terminals that fail.
) in the failure report is the proportion of offered

(23)
This is NOT a blocking probability and it should never be treated as one. The failure
probabilities.
Page 100

Version 5.1
CDMA2000 Coverage Probability Array in the Map View

Window
The meaning of coverage probability shown in the Map View window is dependent
on whether the (global) passive-scan terminal is being used to test every pixel at the
end of a snapshot.
the Map View window is determined by the connection attempts made by the
randomly scattered terminals. It simply gives the proportion of offered terminals at
the pixel that were successfully served. This is not simply related to the blocking
probability at the pixel. In fact it is more like the complement of the failure rate
given in the reports. For example, a cell with a coverage probability of 20% at most
pixels would give a failure rate of about 80% in the report.
each pixel in the Map View window is determined largely by the connection attempts
of passive-scan terminals at the end of the snapshot. In this case, the coverage
probability is simply the complement of the blocking probability at the pixel that is,
To summarise, if you are interested in seeing blocking (and its causes) in the Map
View window, then the passive-scan should be enabled. If you are only interested in
reports, then the passive-scan terminal may be disabled.
Note : The blocking probability report is always calculated using the selective passivescanning technique, which is totally independent of the global passive-scanning used
for the Map View window.

Version 5.1
Page 101

This is the process of determining the sector transmit powers required to meet the
t requirement at the terminal. It is necessary to consider the effect of

downlink b
maximal ratio combining when there are multiple links. The downlink evaluation
follows the following procedure:
Calculate difference between two best E b Nt values from

sectors in the candidate active set.
Read downlink Eb N t target reduction.
Calculate the lowest cell TX power ( T ) that will achieve a

satisfactory Eb N t value.
Set TX powers for cells in candidate active set to T .
Iterate
until
Eb/Nt
achieved
or not
changing
between
iterations
Calculate total achieved Eb N t at terminal assuming maximal

ratio combining of links.
Increase/Decrease
T if total achieved Eb N t at terminal is

too low/high.
Apply log-normal error to all downlink powers, ensuring that

all downlink power limits and sector power limits are not broken.
The difference between the two best Ec Io values of sectors in the candidate active set
is calculated. This figure, together with the terminal speed, determines the downlink
E b N t target reduction in soft handoff. This is found by linear interpolation of the

values that you supply in the Services dialog box.
Page 102

Version 5.1
The downlink powers for sectors in the candidate active set are calculated iteratively.
The iterative procedure involves setting all downlink powers to the same (non-zero)
E b N t is then calculated by summing the E b N t

E N t is too low (high) by a
values for individual downlinks. If the total achieved b
value
. The total achieved
factor of
, then
is increased (decreased) by a factor of
. This process continues
until ceases to change between iterations, or the downlink

achieved.
E b N t requirement is
Note : Individual downlink powers are kept within the limits that you supply
throughout the iterative procedure, so sectors will never be allowed to transmit more
power than they have available.
t requirement can not be achieved, then the terminal fails to be

If the downlink b
served, and all downlink powers are set to zero.

Version 5.1
Page 103
Page 104

Version 5.1
APPENDIX E
HDR Algorithms
In This Section
HDR Notation
HDR Basic Formulae
HDR Uplink Load
Calculation of Uplink Equivalent Control Overhead Factor for HDR

Version 5.1
Page 105
HDR Notation
A Greek subscript always indexes a carrier.

indicates a sum over all carriers.
An uppercase Roman subscript always indexes a cell.

indicates a sum over all cells.
A lower case Roman subscript always indexes a terminal.

indicates a sum over all terminals.
indicates a sum over all terminals in cell J.
Up and down arrows
All quantities are in standard SI units, never in dB.
indicate if a quantity is uplink or downlink.
(E
N )
b
t Kj represents the
between terminal j and cell K using carrier .
E b N t for the uplink

The following table describes the list of principal symbols for HDR:
Symbol
A , A
Page 106
Description
Uplink (downlink) adjacent carrier interference ratio. Gives fractional power leakage from carrier
carrier .
( E b N t ) Jj
Uplink
( I or I oc ) Jj
Pilot
G j
Uplink processing gain
G antenna
J
Cell antenna gain
G antenna
j
G mha
J
Boltzmann constant
Lmha
J
Mast head amplifier (downlink) insertion loss.
Eb Nt
(I or I oc )

Version 5.1
to
Symbol
Description
LJj LJj
Uplink (downlink) linkloss between cell and terminal
Lpathloss
Jj
Pathloss between cell and terminal
Lantenna
Jj
Lcable
J
Cable (feeder) loss
Lcombiner
J
TX combiner loss (downlink)
Lsplitter
J
RX splitter loss (uplink)
Lbody
j
Terminal body loss
N thermal
j
N thermal
J
Thermal noise at cell
N excess
J
Excess noise at cell
Pj
Terminal TX power
Prated
J
Cell rated power
R total
j
R total
J
Total received power at cell
Temperature
Chip rate
Uplink service activity factor
Uplink equivalent control-overhead factor
mha
J
cable
J

Version 5.1
Lcable
J
).
Page 107
HDR Basic Formulae

Handoff gains, power control headroom, and power rise gain have been ignored:
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)

Uplink noise rise (on a cell) is the total received power divided by the background
noise. The noise rise on carrier of cell J is given by:
(9)
This is expressed in dB in the Cell Uplink report.
Page 108

Version 5.1
HDR Uplink Load

Uplink load (on a cell) is the total received power coming from all terminals divided
by the total received power. The cell load on carrier of cell J is given by:
(10)
This is expressed as a percentage in the Cell Uplink report.

Frequency re-use efficiency (on a cell) is the total received power coming from in-cell
terminals divided by the total received power coming from all terminals. The
frequency re-use efficiency on carrier of cell J is given by:
(11)
This expressed as a percentage in the Cell Uplink report.

The Air Interface Bitrate of an uplink bearer is used in the calculation of the uplink
processing gain. The uplink processing gain ( j ) is calculated by dividing the system
chiprate by the air interface bitrate of the uplink bearer.
The User Bitrate of the uplink bearer is used purely to calculate traffic (data
throughput) on a cell.

pathlosses experienced by each of the terminals in a snapshot. Shadow fades are lognormally distributed, and you may specify they standard deviation of shadow fading
for indoor and outdoor terminals in each clutter type. In reality, the fade between a
terminal is likely to have similar fades to cells that are located on the same site. In
order to model this in the simulation, you can specify two parameters in the Simulator
wizard:

between fades from a terminal to cells on different sites.

between fades from a terminal to cells on the same site.

Version 5.1
Page 109
The two parameters must satisfy the constraints
For each terminal in a snapshot, a set of correlated fades to cells is generated using the
following procedure:
Note : All the random numbers mentioned in the following procedure are independent
and normally distributed with zero mean and unit variance.
1
Generate a random number X.
For each cell site I, generate a random number
For each cell J, generate a random number
The fade (in dB) to cell J on site I is then set to:
(12)
where
is the standard deviation of the shadow fading in the pixel (in dB).
This procedure is performed whenever a terminal is initialised at the beginning of

a snapshot. Fades for different terminals are uncorrelated, even if the terminals are

power control.
achieved
E b N t values for successfully served terminals. If the standard deviation is

E b N t values for each successfully served terminal are achieved
set ot zero, the

system this is not the case values since imperfect power control produces a (lognormal) distribution of achieved
E b N t values at a cell.
uplink and transmit powers of successfully served terminals. The errors on the uplink
are applied after all other handoff gains have been considered. Terminals are never
considered as having failed to make a connection if the resulting error makes them
transmit at too high or too low a power.
Page 110

Version 5.1

Service activity affects calculation of uplink interference. Equations 10 and 11 have a
dependence on the uplink activity factor

You can indicate if a cell has an antenna system providing transmit/receive diversity
by selecting the appropriate check boxes on the Antennas tab of the Site Templates
and Site Database dialog boxes.
E b N t requirement on the uplink. When defining an

E N t requirements. One E b N t
uplink bearer, you should specify two b
Receive diversity reduces the
requirement is used on cells with receive diversity and the other is used on cells
without receive diversity. Transmit diversity is not modelled in a HDR simulation,
since downlink traffic powers are not calculated.

Handoff gains are speed dependent and so each terminal in the simulation is given a
random speed. For each terminal type and clutter type, you must specify four
parameters that determine the speed distribution. These are:
the mean speed (
the standard deviation of the speed distribution (
the minimum speed (
the maximum speed (
)
)
A random speed is the given by:

(13)
where
is a random number taken from a normal distribution of zero mean and
unit variance.

Version 5.1
Page 111

terminals and their state, that is the link powers and handoff state, and a set of
behaviour.
A snapshot involves the following stages:
Initialisation of System Power
HDR Initialisation of Terminals

attempting to connect to the network. Each pixel is allocated a random, Poissiondistributed, number of terminals, according to the mean number of terminals
specified for the pixel in the terminal-density array. Also during this initialisation
stage, each terminal is given a set of random log-normal fades, one for each cell that
covers it, that is it has a pathloss to it. A random power control error is chosen for the
uplink. A terminal will use the same random values (fading, power control error,
speed) for the duration of its existence in a snapshot.
HDR Initialisation of System Powers

Before commencing the iterative process, they system is placed in a known state,
powers to zero.
Page 112

Version 5.1
HDR Iterations
in the network is updated before moving on to evaluate the next terminal.
scenarios). For example, a terminal may have several different cells or carriers that it
that allows a successful connection if found. If no scenario can produce a successful
connection to the network, the link powers for the terminal are set to zero and the
Terminals which fail to make a connection in an iteration are not removed from the
has been achieved.
t values for
iterations. Each histogram shows the distribution achieved uplink b
successfully served terminals. All terminals are running a service with an uplink
E b N t requirement of 6 dB.

Version 5.1
Page 113
t
After the first iteration, the majority of served terminals fail to meet their b
t by the end of the first

first iteration will no longer attain their desired b
iteration. In fact, only the last terminal served is guaranteed to achieve its desired
Eb Nt .
Successive iterations produce increasingly accurate pictures of network noise and a
E b N t requirement. By the seventh

E N t requirement and the
iteration practically all the served terminals meet their b
larger proportion of the terminals meet their
system noise no longer changes significantly between iterations. The iteration have
converged to produce a plausible picture of served and failed terminals in the
network. Any remaining distribution in the achieved F values of served terminals is
largely due to quantisation of link powers or from specifying a non-zero power
Convergence Criteria for HDR

downlink interference from terminals (summed over all sectors) changes between
E b N t values.
Gathering of Results for HDR

gathered includes cell information such as resource and power usage, information
about the states of successfully served terminals and the reasons for failure of
terminals which failed to be served.
Page 114

Version 5.1

A connection scenario consists of the following pieces of information:
Carrier
Primary cell
Uplink bearer
Required
Higher (before lower) required
Higher (before lower) priority uplink bearers (with respect to service-carrier)

There are two stages to evaluating a connection scenario to see if a terminal may be
served:
Uplink evaluation
Downlink evaluation

Version 5.1
Page 115
HDR Uplink Evaluation

The following diagram shows the process of determining the terminal transmit power
required to meet the uplink
E b N t requirement:

cell in candidate active set.
N t for each

that will achieve a satisfactory Eb N t value.
Eb N t values achieved
on cells in the candidate active set.
Calculate soft(er) handoff TX power reduction.
cells.
Apply log-normal error to uplink power, ensuring that all cell

For each cell in the candidate active set, the terminal transmit power required to meet
t is calculated. The lowest of these values is then quantised

the uplink b
power
. The terminal transmit power is temporarily set to
and the two best
E b N t values on cells in the candidate active set are calculated. The difference
terminal power reduction (
) to be determined from the supplied
information in the Services dialog box.

requirement.
Page 116
Eb Nt

Version 5.1
After the terminal power reduction has been calculated, the terminal is checked to see
if it has sufficient power to make the uplink. The actual transmit power of the
terminal (
) is given by:
(14)
The uplink
E b N t requirement can be satisfied if:

(15)
where
covering cells. When calculating the interference, the terminal power is taken as
t requirement without breaking a noise

If the terminal cannot meet the uplink b
rise limit, then the terminal fails to be served. If the uplink can be successfully
achieved
is finally given a random (log-normal) adjustment to model the effect
of imperfect power control.
HDR Downlink Evaluation

In order to be served, the cell must provide an adequate
The
level for the terminal.
level determines the downlink bitrate that can be achieved by the
terminal. The mapping between
and the downlink bitrate must be specified in
the HDR Downlink Parameters dialog box. If the

level for the terminal is
lower than all the values specified in the table then the terminal will fail to be served.

Version 5.1
Page 117
Calculation of Uplink Equivalent Control Overhead

Factor for HDR
The following diagram represents the powers transmitted during active and inactive
periods:
The activity factor

inactive period, the terminal is assumed the transmit no power.
There is an uplink pilot channel whose strength is related to the uplink traffic channel
power.
T is the traffic channel power in the active period. P is the uplink pilot power in the
active period.
This can be written in the form:
is the control overhead factor. The term

is the effective
where
activity factor that appears in the calculation of uplink noise (equation 8). See
equation 8.
In dBm, P can be calculated from T using the following formula:
P_dBm = T_dBm dataOffsetNom_dB dB dataOffsetRate_dB
DataOffsetRate_dB depends on the air interface bitrate of the bearer:
9600
dataOffsetRate_dB = dataOffset9k6dB 3.75
19200
38400
76800
53600
The tool provides default values of dataOffsetNom_dB and dataOffsetRate_dB that

make (P_dBm = T_dBm) for all bearers.
Page 118

Version 5.1

This section describes HDR coverage and blocking probabilities.
HDR Coverage Probability Array in the Map View Window

The meaning of coverage probability shown in the Map View window is dependent
on whether the (global) passive scan terminal is being used to test every pixel at the
end of a snapshot.
each pixel in the Map View window is determined largely by the connection attempts
of passive-scan terminals at the end of the snapshot. In this case, the coverage
probability is simply the complement of the blocking probability at the pixel, that is
the Map View window is determined by the connection attempts made by the
randomly scattered terminals. It simply gives the proportion of offered terminals at
the pixel that were successfully served. This is not simply related to a blocking
probability. Instead, it complements the failure rate.
To summarise, if you want to view the blocking probability and its causes in the Map
View window, the passive-scan should be enabled. However, if you would prefer to
view the report in Excel only then the passive-scan terminal should be disabled.
HDR Blocking Probability and Failure Rate

The blocking probability evaluated in the tool is more similar to a Lost Call Held
tool, since probabilities in the tool are all found by sampling snapshots.
, and poisson traffic with arrival rate

second. The mean offered traffic is
users per
.
(16)
(17)
(18)
(19)

Version 5.1
Page 119
(20)

The Failure Rate (
) is the proportion of offered terminals that fail.

(21)
This is not a blocking probability and it should never be treated as one. The failure
probabilities.

This section describes the HDR Packet Quality of Service (QoS) algorithm used in
ASSET3g and explains the packet QoS reports generated by simulations.
The following QoS figures are calculated:
Mean Internet Protocol (IP) packet arrival rate
Mean IP packet transmission time
Mean IP packet delays caused by queuing at the packet scheduler
Mean total IP packet transmission delay
Mean gross user throughput
Mean gross sector throughput
Mean net sector throughput
Mean percentage of packets timed out
HDR Outline
The HDR forward link is a time division multiple access (TDMA) link with 16 slots
per frame. There are 600 time-slots per second so each time slot is approximately
1.66ms and the frame-length is 26.66ms. Each slot is divided into two with a pilot
burst in the first half and a physical layer packet in the second half.
The link layer forms physical-layer packets from the original data packet. To do this
the data is encoded (using turbo codes), block interleaved and repeated. The codingrate and repetition-rate depend on the data-rate. The output is a number of symbols.
Page 120

Version 5.1
Physical layer packets are spread across a number of time slots, spaced out at four-slot
intervals. The number of slots reserved for transmission is dependent on the HDR
downlink parameter. For example, four slots would be reserved for a data-rate of
307.2kbps. If the first slot used was slot N, then the reserved slots would be N+4, N+8
and N+12.
There is a probability that an acknowledgement (ACK) will be received before all the
reserved slots are transmitted. If this occurs, the remaining reserved slots are released
and made available for other packet calls. The probability of an ACK being received
increases with each slot transmitted.
There is also a probability that the physical layer packet will not have been
successfully transmitted even when all the reserved slots are used. In this case the
physical layer packet is re-transmitted, reserving the same number of slots as
previously. The probability that the entire physical layer packet is not successfully
received is defined by the packet erasure rate (PER).
IP Packet Transmission Time for HDR

HDR QoS outputs are generated for each sector, on both a per service and per carrier
basis. At the end of each snapshot in the Simulator, a list of connected terminals
(internal to the simulator) is used as input to the HDR QoS calculation.
Each terminal is assigned a HDR downlink parameter from the terminals Ior/Ioc.
This value of Ior/Ioc is used to calculate the terminals achievable Eb/Nt, defined as:
Eb/Nt = Ior/Ioc (dB) +10 log10(traffic chips per bit).
The Eb/Nt is then used to select the packet erasure rate from the HDR downlink
parameter. The IP packet transmission time depends on the number of physical layer
packets required to transmit the IP packet and the number of slots across which these
physical layer packets are spread.
Determining the number of slots used for transmission is a two-stage process
The number of physical layer packets required to transmit the IP packet is

calculated using:
No. physical layer packets = IP packet size /available bits per physical layer
packet.
The number of slots used for each physical layer packet is determined. This
depends on the number of reserved slots and the probability of receiving an
acknowledgement, which is calculated for each reserved slot. The probability that
an ACK will be received for a particular slot, p(ack)n, is:
where
m gradient of the curve Eb/Nt vs (1-PER)
N maximum number of reserved slots.

Version 5.1
Page 121
A uniformly distributed random number is drawn. If this is greater than p(ack) then
the physical layer packet is said to be successfully transmitted. If the random number
drawn is less that the probability of receiving an acknowledgement in the last
reserved slot then the entire physical layer packet is retransmitted.
The average IP packet transmission time,
, can then be calculated using:
where
Slots- sum of all the slots used for transmission.
IP Packet Queueing Delay for HDR

It is assumed that the packet scheduler maintains a queue for each sector under its
control. All the packets awaiting transmission are stored in the queue in order of
arrival, that is the oldest packet is at the front.
The average length of each scheduler queue, and hence the average queuing delay, W,
can be estimated using Erlangs delayed call formula, from Queueing Modelling
Fundamentals, Ng Chee Hock, John Wiley and Sons, pp. 113 117:
Where the symbols have the following meanings:
m maximum number of servers
- average arrival rate (no. connected terminals/IP packet inter-arrival time)
-average departure rate (1/average transmission time)*m
Hence the queueing delay depends on the IP packet arrival rate, departure rate and
the number of servers.
Each frame of 16 time-slots is sub-divided into sub-frames of four slots to account for
the physical layer packets being spaced four slots apart. Therefore there is a
maximum limit of four servers available. If only one service is running on a carrier
then all four servers are available, if two services are running then two servers are
available and if four services are running then one server is available to each service.
This imposes a limit of four services per carrier.
A means of limiting queue length is needed to prevent the queue from tending to
infinity. You can set a limit on either the average queue length or the average waiting
time for a packet in the queue.
Page 122

Version 5.1
The number of items in the queue, Nq, is given by:
where the probability of delay, P(d) is defined as
and Po is
The number of servers available to a service on a carrier will vary depending on the
number of services on that carrier. By using the above equations and the relation:
the following polynomials are obtained

m=1
m=2
m=4
Where W is the maximum permitted waiting time in the queue. These equations are
solved for the maximum arrival rate which can be handled,
maximum waiting time.
, without exceeding the
The percentage of traffic blocked, %Tblocked, is
where
is the actual arrival rate.

Version 5.1
Page 123
Throughput for HDR

Mean gross user throughput,
, is the average physical layer packet
throughput per user and is calculated using:
where
is the number of available bits per physical layer packet
is the number of physical layer packets per user
is the average IP packet transmit time
, is the average maximum
The mean gross sector throughput,
throughput that could be achieved considering the available signal quality and is
calculated by:
where
is the average number of slots required for transmission
Mean net sector throughput,
the sector and is calculated by:
, is the actual throughput that is handled by
where
is the percentage of packets timed out
is the size of the IP packet in bits
Page 124

Version 5.1
APPENDIX F
Packet Quality of Service

Algorithms
This section details the Packet Quality of Service algorithms used in ASSET3g, and
therefore explains the associated reports generated by the QoS analysis.
The packet QoS analysis feature is a downlink cell level simulation, with 10 ms (single
radio frame) resolution. It is a trace-driven queuing simulation, the packet
transmission delays through a cell are modelled by a queuing system, which has a
time-series of packet traffic offered to it. It is based on the www traffic model and
multiple, prioritised services can be specified.
The simulation is run for a calculated period of time, then the results are presented on
the summary page of the QoS Analysis wizard as a spread sheet and graphs. The
results can be saved as an Excel workbook containing graphs and spreadsheets, or the
raw the raw data saved in text or comma separated variable (csv) format. The graphs
include the cumulative delay distributions of the packet services on each cell,
enabling you to view percentile delays.
The Excel workbook contains the following data per service, per carrier and, per cell:
Mean and standard deviations of the queuing delays
95th percentile delay
Confidence interval half width
Mean transmission time
Mean retransmission delay
Total transmission delay ( mean queuing delay+mean transmission time+mean

retransmission delay
Graphs for each cell and carrier giving the cumulative queuing delay probability
distributions
In This Section
References
Version 5.1
Page 125

Most of the packet QoS analysis parameters are input when you configure the
network design, ready for the simulation. The site/cell, carrier, terminal type and
service type parameters are configured at this stage, and the QoS analysis uses these
parameters later to deduce:
The number of queues to model
The parameters of the traffic streams to generate
Priorities of the service types, before the time simulation
You then need to run at least two snapshots of the simulation, although at least 100
snapshots are recommended to produce statistically valid inputs to the QoS analysis.
The simulation calculates the mean blocking probability for each packet service type,
on each carrier, on each cell in the simulation in the simulation and the mean number
of terminals connected to each cell, per carrier, per service, and per bitrate. The mean
blocking probability and mean number of terminals are then used as inputs to the
QoS analysis.
Preliminary Tests
Some conclusions can be deduced from the input data without running the simulation
at all. These are:
100% blocking on any service will result in delays building up to infinity
Zero traffic on all services will result in zero delays
Zero blocking on all services will result in zero delays
These results are immediately updated on the summary page of the QoS Analysis
dialog box.

This section describes the traffic generation processes:
Page 126
Matching Generated Traffic to the Simulator's Mean Number of Served Users
WWW Traffic Model
Packet Model

Version 5.1
Matching Generated Traffic to the Simulator's Mean Number of

Served Users
The Simulator calculates the number of users which can be served for each service, by
each cell and carrier in every snapshot. The mean is then calculated over the total
number of snapshots run in the simulation. This figure is the starting point for the
QoS analysis; it provides the mean number of users for each packet service in each cell
and carrier in the simulation. The traffic generator generates a time series of packet
sessions for each service in a cell and carrier, which matches the mean number of
users over time, as shown in the following diagram:
The red line represents the mean number of users input from the simulation. The
orange blocks represent the number of users varying over time. The blue blocks
represent the holding times of the packet sessions produced by the traffic generator.
Littles theorem gives us the relation between the arrival rate of packet sessions, the
mean number of users in the cell and their mean session holding time. Let
= mean session arrival rate

T = mean session holding time
= mean number of users in the cell
Littles result says that:
N = .T

Version 5.1
Page 127
The traffic generator therefore generates sessions with mean arrival rate calculated
from the mean number of users in the cell, and the mean session holding time, which
is determined using the WWW traffic model.
WWW Traffic Model

The WWW traffic model is used to generate the activity of each packet session. The
following diagram shows a typical WWW browsing (packet service) session, which
consists of a sequence of packet calls. The user initiates a packet call when
downloading a WWW document and during a packet call, several packets may be
generated. After the document has completely arrived, the user requires reading time
to study the information.
The following diagram shows packets from a source, which may be at either end of
the link, but not both ends simultaneously.
The model requires the generation of six random variables:
Page 128
Session arrival process - The arrival of session set-ups to the network is modelled
as a Poisson process. For each service there is a separate process.
Number of packet calls per session, Npc - A geometrically distributed, that is a

discrete representation of the exponential distribution random variable is used,
with a mean number of packet calls of 5.
Reading time between packet calls, Dpc - A geometrically distributed, that is a

discrete representation of the exponential distribution, random variable is used,
with a mean reading time of 4 to 12 s.
Number of packets per packet call, Nd - A geometrically distributed, that is a

discrete representation of the exponential distribution, random variable is used,
with a mean number of packets of 25.
Version 5.1
Size of packet, Sd A Poisson distributed random variable is used, with a mean

size of 480 Bytes.
Inter arrival time between packets, Dd - A geometrically distributed, that is a ( that is, a
discrete representation of the exponential distribution) random variable is used.
The session holding time is modelled implicitly by the number of events during the
session.
Using the WWW traffic model, the mean holding time of a packet session T is given
by:
T = (N pc 1)D pc + N pc ( N d 1)Dd
Packet Model
The traffic generator uses the session arrival and WWW models to produce a list of
packets for each service type, for each cell, for each carrier, lasting the duration of the
simulation. Each packet is stamped with its arrival time at the cell, and also keeps a
record of when it gets transmitted (its departure time), and its randomly generated
size. The packet service type lists are then merged and sorted in arrival time order, to
produce a single list of packets offered to the cell carrier:
In the diagram, the data contained in the packet boxes is the arrival time, the
departure time and the packet size. Initially, the packets departure time is set to be
the same as its arrival time. The departure time is updated each time step the packet is
queued, until it is successfully transmitted.
A histogram of the generated traffic is displayed for each service on each cell and
carrier in the graphs tab of the QoS Analysis dialog box.

Version 5.1
Page 129

The peak throughput and block size in GPRS is determined by the coding scheme
and, in EGPRS, by the coding and modulation scheme, as shown in the following
table:
System
Scheme
GPRS
CS - 1
EGPRS
Link Adaption
Family
Modulation
Peak Rate per Slot Blocks Per

(kb/s)
20 ms
RLC Block
Size (bits)
GMSK
9.05
181
CS - 2
13.4
268
CS - 3
15.6
312
CS - 4
21.4
428
8.8
176
MCS - 1
GMSK
MCS - 2
11.2
224
MCS - 3
14.8
296
MCS - 4
17.6
352
MCS - 5
MCS - 6
29.6
MCS - 7
44.8
MCS - 8
54.5
1090
MCS - 9
59.2
1184
8 - PSK
22.4
448
592
896
In order to calculate the block size, the coding scheme allocated to each connection
needs to be input from the simulation (a mean number of MS connections per coding
scheme, per bearer, per service type, per sub-cell array will be required as input).
The block size can be inferred directly from the GPRS coding schemes, however, the
following mapping is used to calculate the block size for the first transmission attempt
for the link adaptation families:
A 592 bits
B 448 bits
C 352 bits
There are no default BLER versus C/I curves for MCS 7, 8 and 9. In the
retransmission model, the lower bitrates of the link adaptation families are used.
Page 130

Version 5.1

GPRS defines several different QoS Profiles which consist of four components:
Precedence class
Delay class
Reliability class
Throughput class
Precedence Class
Traffic is given a precedence of 1 (premium), 2 (standard) or 3 (best effort), with a
precedence of 1 being highest. This precedence is similar to the service type priorities
set in the QoS Analysis wizard in ASSET3g, however the number of priorities needs
to be restricted to three and different service types can have equal priorities. The
precedence class is used to prioritise the queues. For more information, see
Simulation Model on page 134.
Delay Class
GPRS has four different traffic classes. The following table shows that parameters that
specifies their QoS requirements:
Traffic Class
Medium
Application
Data Rate (kbit/s)
One-way Delay
Conversational
Audio
Telephony
4-25
<150ms
Data
Telnet
<8
<250ms
Audio
Streaming (HQ)
32-128
<10s
Video
On-way
32-384
<10
Data
FTP
<10s
Audio
Voice messaging
4-13
<1s
Data
Web browsing
<4s/page
Streaming
Interactive
For background traffic, only bit integrity is required.

3g service types have traffic classes and are used in the packet service types dialog
box in 3g to set default www parameters and delay targets. In the ASSET3g QoS
Analysis the achieved 95th percentile delay per service type, per carrier, per cell is
compared with the target 95th percentile delay.
Traffic class is used to prioritise the queues. For more information, see Simulation
Model on page 134.

Version 5.1
Page 131
Reliability Class
Applications can request different reliability classes, depending on their ability to
handle corrupt and duplicated blocks. The following table shows the reliability
classes that can be selected:
Reliability Class
Lost Block Probability
10
10
10
Reliability is only considered in terms of the retransmission delay formula used in

ASSET3g. This uses the block error rate (BLER) to analytically calculate the
retransmission delay for packet services. A different approach is proposed for GPRS.
The BLER can be calculated using the Average Data Throughput per Timeslot vs
Average Connection C/I curves. The formula is:
where:
Throughput(C/I) = throughput in kb/s read off the throughput per timeslot graph for
the C/I achieved by the link
PeakDataRatePerSlot = peak rate per slot for the given coding scheme (the
asymptote of the throughput per timeslot graph
BLER(C/I) = block error rate for the C/I achieved by the link
The mean BLER over all the connections made per service type, per sub-cell is
required as an input from the simulation, and is reported in the QoS Analysis
spreadsheet. Block errors also have implications for the retransmission model. For
more information, see Mean Retransmission Delay on page 140.
Page 132

Version 5.1
Throughput Class
Applications can request different mean and peak throughputs, in order to request
the desired throughput for bursty IP traffic. Peak throughput applies to short
intervals where the transfer rate is at a maximum. Mean throughput describes the
data transfer rate over an extended period of time, which could involve many idle
periods.
Peak throughput class
Peak throughput (kb/s)
Mean throughput class
Mean throughput
(bytes per hour)
100
16
200
32
500
64
1 000
128
2 000
256
5 000
512*
1024*
17
20 000 000
2048*
18
50 000 000
*Data rate only reachable 31

with UMTS or EDGE
Best Effort
In GPRS, the peak throughput is determined by the peak data rate per slot achievable
by the coding scheme, and the number of timeslots for which the MS is enabled. The
peak throughput is calculated as follows:
PeakThroug hput = PeakDataRa tePerSlot * BlocksPerF rame * MaxNumberO fSlots

The coding scheme is identified by the bearer allocated to the connection during the
simulation and the maximum number of timeslots enabled on the MS will be a
parameter set on the terminal type. It is therefore possible to do a preliminary check
prior to running the GPRS QoS analysis to determine the peak throughput achievable
for each service type on each sub-cell. The peak throughput is reported in the QoS
Analysis spreadsheet.
The mean throughput is logged as successful transmissions are made from the queue
in the QoS analysis, and are reported in the QoS Analysis spreadsheet.

Version 5.1
Page 133

This section describes the time simulation processes and assumptions:
System Model
Simulation Model
System Model for QoS Analysis

The call admission manager monitors the system's available capacity and
accommodates new packet transmission requests, at the same time ensuring the QoS
of existing connections. This may be situated at the BSC in a 2g network or the RNC
in a 3g network.
The steps of a connection admission procedure are:
A new packet transmission request is received by the call admission manager
The capacity of the destination cell is monitored
The system either accepts or blocks the new connection
If the QoS of an existing connection is degraded, it is dropped
Simulation Model for QoS Analysis

The simulation models the connection admission procedure by making the following
assumptions:
The call admission manager monitors the cell capacity in every radio frame, that is
every 10ms
The cell capacity for each service type is generated using the blocking probability
input from the simulation
The blocking decision is prioritised to accept new connections in the priority order
of their services
The dropping of existing connections is not modelled
The cell capacity for each service is determined in each frame by generating a
uniformly distributed random number for each packet held in a queue. If the random
number is greater than the blocking probability, the packet starts transmission in that
frame. If the random number is less than of equal to the blocking probability, the
packet is delayed in the queue until the next frame.
If the packet call mode is selected instead of the packet mode, connection admission
decisions are taken on a packet call, instead of an individual packet basis.
Page 134

Version 5.1
The service prioritisation is modelled in the simulator. All the packets awaiting
transmission through a cell are stored in a set of queues, one for each service type. A
diagram of the queuing model which would be used for three packet services being
transmitted through a cell is shown here:
The rule is then applied that if admissions for each service are considered in priority
order, and that if any higher priority packets remain queued, no lower priority
packets are admitted.
By the end of the simulation, the simulator will have produced a list of transmitted
packets, each stamped with its arrival and departure times from the cell.
A histogram of the queue length throughout the simulation is displayed for each
service on each cell and carrier in the graphs tab of the QoS Analysis dialog box.
Packet QoS Session Timeout Calculation for CDMA2000

The main limitation on capacity on CDMA systems is the forward link PA power
available. The simulator provides us with data on the total available transmit power
on the sector carrier (minus noise contributions) and the average transmit power
required per sector, service , carrier or bearer for each user.
When a terminal is connected and active, and there is no data to transmit, it uses a
fundamental and supplemental channel. For example, in between packets it uses a
1/8th rate fundamental channel. This means that a terminal is still consuming
transmit power between packet calls. The session timeout parameter was added to
prevent all the available power being consumed by terminals transmitting at 1/8th
rate, which would mean that no packet data could be transmitted. The session
timeout parameter is employed to kill any sessions which have been active for longer
than the session timeout, thus freeing up transmit power and allowing packets or
packet calls to be transmitted.
Version 5.1
Page 135

This section describes the analysis results:
Simulation Duration

The performance measure of the simulation is the mean delay of the first service on
the cell. An estimate of the length of time for which a queue simulation should be run
has been obtained by setting up a simulation for an M/M/1 queue, for which
analytical results for the mean delay can be obtained, and experimentally
determining how long the simulation should be run to obtain results of a given
accuracy. To get an accuracy of 10% at a 95% confidence level, the following
procedure has been recommended:
1
Set the basic run length to ensure at least 1000 2000 packet admission requests are
made to the cell for each service.
Repeat the run (replicate) 5 times and calculate the confidence interval half width
H5.
If the confidence interval is less than 10% of the mean delay, , the desired
accuracy has been obtained.
The confidence interval half width H5 is calculated by repeating runs, using a

different random number stream for each run (3). Suppose we make k runs
(replications), each generating m sample values of the packet delay, Y.
Let Y1, Y2, Y3,, Yk be the mean values of the k runs. The mean values are
independent, since a different random number stream was used for each run and, for
a sufficiently large m, it will be approximately normally distributed. The confidence
interval half width Hi is then calculated from the sample mean
, and variance .
Yi
i =1 k
k
Y=
(Yi Y )2
2 =
i =1
Hi =
Page 136
(k 1)
2.
m

Version 5.1
Simulation Duration
This is calculated for each cell and carrier. The value depends on the parameters that
you have set for the services supported by that cell, and carrier, and the mean number
of users of those services input from the simulation. Using the same notation as the
www traffic model section, plus the following definitions:
N req
= required number of packets
S req
= number of sessions required to generate
Treq
= time until the
S req
N req
packets
session arrives
D = recommended simulation duration

Each session contains
S req =
N pc .N d
packets, so
N req
N pc .N d
(1)
The session arrivals are modelled as a Poisson process, and so the expected time until
the
S req
Treq =
session arrives is:
S req
(2)
Substituting Little's law and equation (1) and (2),
Treq =
N req .T
N pc .N d .N
Adding the duration of the
S req
session itself, the simulation duration is:
N req
D=
+ 1.T
N . N .N
pc
d

Version 5.1
Page 137

Graphs of the delay probabilities and the cumulative delay probabilities are produced
for each service, on each cell and carrier. The delay probability graphs are the most
easily understood. It will be apparent that the highest priority service should have a
delay distribution, which peaks before the next highest priority service, and so on.
However, the cumulative delay probability graphs are more useful, because you can
read any percentile delay from them.
The data for these graphs will be collected by maintaining counts during the
simulation. For example, when a packet which has been queued for 4 frames is finally
transmitted, the count in the 4 frame bin will be incremented. If there are N bins, each
bin represents a delay of F frames, and c is the count in a bin at the end of the
simulation, their state can be represented by the following table:
Bin
Delay
Count
0.F
C0
1.F
C1
2.F
C2
...
...
...
n.F
Cn
...
...
...
N.F
CN
Total number of packets transmitted during the simulation:

N
TP = ci
i =0
Delay probability of n.F frames:
P ( n) =
cn
TP
Cumulative delay probability of n.F frames:

n
CP (n) =
Page 138
c
i =0
TP

Version 5.1

The following are the mean and standard deviations of the queuing delays:
N
Mean delay
D = F . n.P (n)
n =0
=
Standard deviation
(F .n D ) .P(n)
N
n =0

The 95th percentile is calculated from the cumulative delay graph, and compared
with the target 95th percentile delay, that you originally set in the Packet Service
dialog box. If the delay calculated from the graph is greater than the target, a QoS
target failed message is generated, listing the services which have failed on a
particular cell and carrier. If the delay is less than the target, a QoS target achieved
message is displayed in the QoS Analysis summary page.

This is calculated using a running mean of the transmission time of each packet
transmitted by the simulation. The packet transmission time is calculated from the
mean packet size Sd (Bytes), (a Poisson distributed random variable, with the mean
size set in the Packet Service dialog box), and the service bitrate b (kbs-1)
).
Transmission time:
Ttrans =
8.S d
1000.b

Version 5.1
Page 139

Error detection and correction across the air interface is handled by the Radio Link
Control (RLC) sublayer, and is described in UMTS Standard TS 25.301. Packets are
segmented by the RLC into equal sized blocks for transmission across the air
interface. The block size and bearer rate determine the number of blocks which are
transmitted per radio frame. The RLC then transmits the blocks, detects dropped or
corrupted blocks and guarantees their delivery by retransmission. The retransmission
protocol can be configured to provide different levels of QoS. The retransmission
protocol which is modelled in the calculation of the retransmission delay is Stop-andWait ARQ (Automatic Repeat reQuest). This has the following features:
One block is received and handled at a time
The receiver acknowledges each correctly received block
If a block is corrupted, the receiver discards it and sends no acknowledgement
The sender uses a timer to determine whether or not to retransmit
The sender keeps a copy of each transmitted block until its acknowledgement has
been received
Finally, the blocks are put back into order and reassembled into packets by the
RLC at the receiver
In order to calculate the average retransmission delay, the block error rate (BLER) at
which the system will operate is required as an input. A typical value of 10% is set as
the default. You also need to set the re-transmission timeout in units of radio
frames. The BLER can then be used to calculate the increase in traffic through the link
caused by retransmission, and the mean or median retransmission delay:
BLER
+ 1seconds
Mean retransmis sion delay = 0.01. rt
(1 BLER )
References
The following are documents that have been referred to throughout this chapter:
Page 140
Selection procedures for the choice of radio transmission technologies of the

UMTS TR 101 112 v3.2.0, p.34
Quality of Service for Multimedia CDMA, N. Dimitriou, R. Tafazolli, G. Sfikas,

IEEE Communications Magazine, July 2000
Simulating Computer Systems, M.H. MacDougall, MIT Press, p.114
Introduction to Mathematical Statistics, R.V. Hogg and A.T. Craig, CollierMacmillan Ltd, p.193

Version 5.1
Glossary of Terms
16QAM
Quadrature Amplitude Modulation. A modulation technique that modulates both the
amplitude and phase. There are several QAM levels. QAM with a level of 16 is
equivalent to 4 bits per Hertz.
8PSK
Eight Phase Shift Keying. A modulation technique encoding 3 bits to each symbol.
A
AICH
Acquisition Indicator Channel (UMTS). A fixed rate physical channel with a
spreading factor of 256 equating to 32Kbps. It is used to carry acquisition indicators
which correspond to signatures.
AMPS
Analogue Mobile Phone System. The US analogue cellular standard.
AMR
Adaptive Multi Rate. A codec (coder/decoder) offering a wide range of data rates. In
GSM, this can lower the bitrate per timeslot as interference increases, thus enabling
more error correction to be applied.
B
BCCH
Broadcast Control channel. This is a logical channel used for signalling purposes.
BER
Bit Error Rate. The ratio of number of errored bits to the total number of bits received.

Version 5.1
Page 141
BSC
Base Station Controller. A piece of equipment that controls one or more BTS (Base
Station Transceivers).
BSIC
Base Station Identity Code. A combination of colour codes (NCC and BCC) used in
GSM that provide extra identity information to help a mobile to distinguish
individual transmitters. This allows handovers between cells, even if both cells are
using the same frequency channel.
BTS
Base Transceiver Station.
C
C/A
Carrier to Adjacent interference ratio.
C/I
Carrier to interference ratio.
CCCH
Common Control Channels (UMTS). These include P-CCPCH, S-CCPCH, P-SCH, SSCH, AICH, PICH.
CDMA
Code Division Multiple Access. The use of different codes to allow terminals to access
the same frequency spectrum simultaneously.
CDMA2000
CDMA2000 is a 3g mobile telecommunications standard. It offers backward
compatibility with IS-95, and the two systems may be run together in the same
bandwidth. A defining feature of the CDMA2000 standard is the support for different
services such as Voice, Internet and Video.
CI-RTT
Cell Identity - Round Trip Time. Related to location based services (UMTS).
CI+TA+RX
Cell Identity + Timing Advance + Received Power. Related to location based services
(GSM).
Page 142

Version 5.1
D
DTX
Discontinuous transmission. Interference reduction technique, associated with a voice
activity factor (0-1).
E
ECSD
Enhanced Circuit-Switched Data. Technique similar to HSCSD, using EDGE to
achieve higher data rates.
EDGE
Enhanced Data rates for GSM Evolution. Method of achieving higher data rates in
GSM by using 8PSK modulation.
EGPRS
Enhanced General Packet Switched Services. Technique similar to GPRS, using EDGE
to achieve higher data rates.
EiRP
Effective (isotropic) Radiated Power, referenced to an isotropic antenna. The
relationship between EiRP and ERP is: EiRP = ERP + 2.14
ERP
Effective Radiated Power, referenced to a dipole antenna. The relationship between
ERP and EiRP is: ERP = EiRP - 2.14
F
FCC
Federal Communications Commission. Statutory regulatory body for mobile
communications in the U.S.A.
FDD
Frequency Division Duplex. A full-duplex technique that consumes more spectrum
than TDD, but does not require synchronisation between base stations.
FDMA
Frequency Division Multiple Access. A technique used in analogue AMPS cellular
systems, in which each user is designated a different frequency.

Version 5.1
Page 143
G
GPRS
General Packet Radio Service. This is a non-voice service, which allows you to send
and receive data across a mobile telephone network via GSM telephones.The typical
data transmission rate is 20-30 Kbps, and there is continuous connection to the
network.
GSM
Global System for Mobile Communications. A global 2g wireless digital
communications standard covering cellular telephony, two-way radio and paging,
and short messaging. It is a TDM system, operating on 3 frequency bands - GSM 900
(900 MHz), DCS 1800 (1.8 GHz) and PCS 1900 (1.9 GHz).
H
HDR
High Data Rate (HDR) is a development of IS-95B. HDR is also known as 1xEV-DO,
depending on which country it is being used. HDR is now defined by a standard, IS856. The reverse link uses CDMA in much the same manner as IS-95/CDMA2000.
HSCSD
High-Speed Circuit-Switched Data. A high-speed technology that allows data to be
sent and retrieved over GSM networks at a rate of 14.4 (1 timeslot), 28.8 (2 timeslots),
or 57.6 Kbps (4 timeslots).
HSDPA
High Speed Downlink Packet Access. Represents an evolution of the WCDMA radio
interface for data services, using methods similar to the EDGE evolution of the GSM
radio interface. The higher data rates are achieved by Adaptive Modulation and
Coding.
M
MSC
Mobile Switching Centre. In a cellular network, this is a switch or exchange that
interworks with location databases.
Page 144

Version 5.1
O
OTSR
Omni Transmit Sector Receive. A configuration technique for a NodeB that can be
used at the initial deployment of a UMTS network, when capacity is not a crucial
factor. The method uses a single transmitter on the downlink, shared between the
antennas of the cells by the use of a power splitter.
P
P-CCPCH
Primary Common Control Power Channel peak dedicated power (UMTS). It is turned
off for the first 256 chips and is used to carry the Broadcast Channel, which conveys
the basic network information required by the terminal for connection.
P-SCH
Primary Synchronisation Control Channel peak dedicated power (UMTS). It is only
transmitted for the first 256 chips of every slot.
PCH
The Paging Channel (PCH) is a downlink transport channel, and is always
transmitted over the entire cell. The transmission of the PCH is associated with the
transmission of physical-layer generated Paging Indicators, to support efficient sleepmode procedures.
PCS
Personal Communication Services. A digital standard that operates in the 1.8 GHz to
2 GHz band, giving smaller areas of coverage than cellular networks.
PICH
Paging Indicator Channel (UMTS). A fixed rate physical channel with a spreading
factor of 256, used to carry the paging indicators. The PICH is always associated with
an S-CCPCH to which a PCH transport channel is mapped.
PLMN
Public Land Mobile Network.

Version 5.1
Page 145
Q
QoS
Quality of Service. A performance requirement that is defined prior to the
transmission of data. Depending on the network type, it can be measured in terms of
bit error rate, cell loss ratio, cell transfer delay and so on.
QPSK
Quadrature Phase Shift Keying. A modulation technique using orthogonal carriers to
gain the maximum information from the channel.
R
RNC
Radio Network Controller.
RSCP
Received Signal Code Power.
S
S-CCPCH
Secondary Common Control Power Channel peak dedicated power (UMTS). Because
it conveys paging and control information, at least one S-CCPCH is needed per cell
and has to be transmitted at full power to be received at the cell edges.
S-SCH
Secondary Synchronisation Control Channel dedicated peak power (UMTS). It is only
transmitted for the first 256 chips of every slot.
SGSN
Serving GPRS Support Node. A piece of equipment that monitors an MS and
performs security functions and access control. It can also be used in a UMTS network
to connect an RNC over the Iu-PS interface.
SIR
Signal to Interference Ratio. This measurement excludes intra-cell interference
(whereas the Ec/Io value includes intra-cell interference).
Page 146

Version 5.1
T
TACS
Total Access Communications System. The analogue cellular standard in the UK and
(some) Europe.
TCH
Traffic channel. This is a logical channel used to transport data.
TD-SCDMA
Time Division-Synchronous Code Division Multiple Access. Combines an advanced
TDMA/TDD system with an adaptive CDMA component operating in synchronous
mode.
TDD
Time Division Duplex. A half-duplex technique that consumes less spectrum than
FDD, but requires very tight timing co-ordination between base stations.
TDMA
Time Division Multiple Access. In this technique, multiple users can be carried along
one channel, each one using a different timeslot.
TETRA
Trans European Trunked Radio Access, or Terrestrial Trunked Radio. A digital
cellular land mobile radio system used in Europe.
TRX
Transmitter/Receiver module. GSM term for a single carrier card within a BTS.
U
UMTS
Universal Mobile Telecommunications System. A 3g mobile telecommunications
standard, which can deliver broadband data at speeds of 2Mbps. A defining feature of
the UMTS standard is the support for different services such as Voice, Internet and
Video.

Version 5.1
Page 147
Page 148

Version 5.1
I
Interference
arrays 29, 35, 36, 37
Index
L
LMUs
arrays 31
M
Measured Cells (LMU) arrays 31
A
Algorithms
CDMA2000 77
FCC calculations 53
Frequency hopping 45
Frequency Re-use and Load 54
GPRS and HSCSD capacity 50
HDR 105
ILSA cost function 48
Interference arrays 40
Interference Tables 39
MAIO planning cost function 49
Non-Frequency hopping 47
Packet QoS 125
UMTS 57
Arrays
GPRS 30, 32
LMU 31
measured cells 31
types available 1
P
Packet Switched QoS algorithms 125
Pilot Coverage arrays 24, 26
Q
QoS
algorithms 125
S
Serving Cell arrays 15, 24, 27, 28, 29, 30
Snapshots
algorithm 65
T
TETRA
algorithms 39
B
Best Server arrays 15, 24, 27, 28, 29, 30
UMTS
algorithms 57
CDMA2000
algorithms 77
E
EGPRS
arrays 33, 34, 35
G
GPRS
algorithms 39
arrays 32, 34
GSM
algorithms 39
H
HDR
algorithms 105
HSCSD
algorithms 39

Version 5.1
Page i
Page ii

Version 5.1

ASSET3g Technical Reference Guide

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

ASSET3g Technical Reference Guide

Uploaded by

Copyright:

Available Formats

ASSET3g

Technical Reference Guide

Copyright 2006 AIRCOM International Ltd

+44 (0) 1737 775700

Can You Improve

Do the Help and User Reference Guides Help You?

Is the information accurate and complete?

Arrays (5.0 Simulator)

2g and 2.5g (Non-Sim) Arrays

Appendix B 2g and 2.5g Algorithms

Interference and Connection Array Calculations

Worst Connection Array Calculation Method

Frequency Hopping Algorithms

Synthesised Hopping Algorithm

Non-Frequency Hopping Algorithms

Automatic Frequency Planning (ILSA)

The Cost Function of the ILSA Algorithm

MAIO Planning Cost Function

GPRS and HSCSD Capacity Calculations

TRX Requirement - Circuit Switched Traffic and HSCSD

ASSET3g Technical Reference Guide

Appendix C UMTS Algorithms

List of Principal Symbols for UMTS

UMTS Basic Formulae

UMTS Uplink Noise Rise

UMTS Uplink Load

UMTS Frequency Re-Use Efficiency

UMTS Air Interface and User Bitrates

UMTS Shadow Fade Modelling

UMTS Power Control Error Modelling

UMTS Service Activity Modelling

UMTS Activity Factor Calculation For Packet Services (Web Model)

UMTS Transmit/Receive Diversity Modelling

UMTS Terminal Speed Modelling

UMTS Overview of a Snapshot

UMTS Initialisation of Terminals

UMTS Scenario Prioritisation

UMTS Connection Evaluation

Production of a Candidate Active Set in UMTS

UMTS Blocking Probability

Calculation of Blocking Probability in the Blocking Report for UMTS

Appendix D CDMA2000 Algorithms

List of Principal Symbols for CDMA2000

CDMA2000 Basic Formulae

CDMA2000 Uplink Noise Rise

CDMA2000 Uplink Load

CDMA2000 Frequency Re-Use Efficiency

CDMA2000 Air Interface and User Bitrates

CDMA2000 Shadow Fade Modelling

CDMA2000 Power Control Error Modelling

CDMA2000 Service Activity Modelling

ASSET3g Technical Reference Guide

CDMA2000 Activity Factor Calculation For Packet Services (Web Model)

CDMA2000 Transmit/Receive Diversity Modelling

CDMA2000 Terminal Speed Modelling

PN Code Assignment Algorithm for CDMA2000

Difficulty Factor for CDMA2000

CDMA2000 Overview of a Snapshot

CDMA2000 Scenario Prioritisation

CDMA2000 Connection Evaluation

Production of a Candidate Active Set in CDMA2000

Calculation of Equivalent Control Overhead Factors for CDMA2000

CDMA2000 Blocking Probability

CDMA2000 Downlink Evaluation