Professional Documents
Culture Documents
Training Programme
Forsk 2011
Slide 2 of 79
ACP
Basic Predictions
(Best Server, Signal Level)
Neighbour Allocation
Traffic Maps
Monte-carlo
Simulations
User-defined Values
Cell Load
Conditions
UMTS/HSPA Predictions
Slide 3 of 79
Training Programme
Forsk 2011
Slide 4 of 79
Cell Parameters
Forsk 2011
Slide 5 of 79
Transmitter Parameters
Can be defined in the Transmitter Properties Dialogue
Frequency Band [General Tab]
Forsk 2011
Either calculated according to the equipment characteristics (TMA, feeder cables, BTS), or userdefined
Slide 6 of 79
Transmitter Parameters
Can be defined in the Transmitter Properties Dialogue
Diversity Parameters [Transmitter Tab]
Forsk 2011
Slide 7 of 79
Cell Parameters
A cell is defined as a carrier, with all its characteristics, on a transmitter
Corresponds to the (Tx - Carrier) pair
Main Parameters
Cell Transmit power
Forsk 2011
TCH User 2
TCH User 1
Other CCH
TCH User 3
SCH
CPICH
Slide 8 of 79
Cell Parameters
Main Parameters
Cell Transmit power
Maximum power
Total power
HSPA Support
HSPA
The power available for the HS-SCCH and HS-PDSCH of HSDPA users
TCH User 3
TCH User 2
TCH User 1
Other CCH
SCH
CPICH
MIMO Support
Forsk 2011
The MIMO technique (transmit diversity or spatial multiplexing) used by the cell when it supports
HSPA+
Slide 9 of 79
Cell Parameters
Main Parameters
AS Threshold (dB)
Maximum difference between the pilot quality of the best-server and the pilot quality of the candidate
cells
Used to determine which cells, apart from the best server, will be part of the mobile active set
Forsk 2011
Access to a dialogue where you can set both intra-technology (UMTS-UMTS) and inter-technology
(UMTS-GSM) neighbours
Slide 10 of 79
Training Programme
Forsk 2011
Slide 11 of 79
Load Conditions
Coverage Predictions
Forsk 2011
Slide 12 of 79
Available Predictions
Coverage Predictions
UMTS Dedicated Coverage Predictions
Quality Studies
Handover Study
Noise Studies
Quality Studies
Rate/Throughput Studies
Quality Studies
Rate/Throughput Studies
Point Analysis
Radio Reception Analysis at a Given Point
Forsk 2011
Slide 13 of 79
Principles of Predictions
Predictions are calculated for
Given Load Conditions
Traffic Maps
Monte-carlo
Simulations
Values User-defined
in the Cells Table
Cell Load
Conditions
UMTS/HSPA Predictions
A Non-interfering User with
Forsk 2011
A Service
A Mobility
A Terminal Type
Slide 14 of 79
Load Conditions
Values taken into consideration
in predictions for each cell
Slide 15 of 79
If no simulation is selected
Prediction based on DL power and UL
load from cells table
Forsk 2011
Slide 16 of 79
Forsk 2011
Slide 17 of 79
Forsk 2011
Slide 18 of 79
UL Load Factor
Forsk 2011
Slide 19 of 79
Display Parameter
Ec/I0
Ec/I0 Margin
Transmitter, etc
Forsk 2011
Maximum Eb/Nt
Effective Eb/Nt
Eb/Nt Margin
Required Power, etc
Maximum Eb/Nt
Effective Eb/Nt
Eb/Nt Margin
Required Power
Soft Handover Gain, etc
Unique, etc
Handover Status
Handoff Status
Number of Potential Servers
Pilot Pollution
Number of Polluters
Slide 20 of 79
Forsk 2011
Slide 21 of 79
Forsk 2011
Slide 22 of 79
Forsk 2011
Slide 23 of 79
Forsk 2011
Slide 24 of 79
Forsk 2011
Study Objective
Conditions
Display Parameter
HS-SCCH Ec/Nt
HS-SCCH Power
HS-PDSCH Ec/Nt
CPICH/HS-PDSCH CQI
MAC Rate
RLC Peak Rate
Application Throughput
etc
Slide 25 of 79
CQI
calculation
HSDPA
bearer
Selection
Look-up of RLC
peak rate
Forsk 2011
Slide 26 of 79
Forsk 2011
Slide 27 of 79
Forsk 2011
Slide 28 of 79
The RLC peak rate that the HSUPA bearer can provide
The minimum RLC throughput that the HSUPA bearer can provide
The average RLC throughput that the HSUPA bearer can provide
The application throughput that the HSUPA bearer can provide
Etc.
Forsk 2011
Slide 29 of 79
Load sharing
between
users
Calculation of the
maximum EDPDCH Ec/Nt
allowed
HSUPA
bearer
Selection
Look-up of RLC
peak rate
Forsk 2011
Slide 30 of 79
Forsk 2011
Slide 31 of 79
Inputs
DL Power Used and UL Load Factor of Cells for R99 Bearer Connection
Available HSDPA Power of Cells for HSDPA Bearer Users
UL Load Factor, UL Load Factor due to HSUPA, UL Reuse Factor and Maximum UL Load
Factor of Cells for HSUPA Bearer Users
User Description: Terminal, Service and Mobility Type
Forsk 2011
Slide 32 of 79
Active Set /
handover status
also shown in the
map-window
Pilot
availability
R99 TCH
availability in
UL and DL
Forsk 2011
Lower limit of the Active Set Best server threshold to be part of the
Active Set (depending on the mobility
(best pilot quality - Active
type)
Set threshold)
Slide 33 of 79
Training Programme
Forsk 2011
Slide 34 of 79
4. Neighbour Allocation
Definitions
Importing Neighbours
Planning Intra-technology Neighbours
Planning Inter-technology Neighbours
Displaying Neighbour Relations on the Map
Forsk 2011
Slide 35 of 79
Definitions
Reference Cell
The cell to which you are allocating neighbours
Possible Neighbours
The cells that fulfil the requirements to be neighbours
Intra-technology Neighbours
The cells defined as neighbours that use the same technology as the reference cell
E.g., UMTS-UMTS, GSM-GSM, LTE-LTE
Inter-technology Neighbours
The cells defined as neighbours that use a technology other than the reference cell
technology
E.g., UMTS-GSM, UMTS-LTE, GSM-LTE
Forsk 2011
Slide 36 of 79
Forsk 2011
Slide 37 of 79
Forsk 2011
Slide 38 of 79
Forsk 2011
Slide 39 of 79
Global value for all cells or value specified for each cell
Forsk 2011
Slide 40 of 79
Overlapping
criterion
Forsk 2011
Start allocation
Calculation options
A best server
area
(Candidate)
(Reference)
SA SB :
Area where :
Ec/Io(B) Ec/Io(A) Ec/Io
margin(A)
Minimum
Ec/Io for
A
Forsk 2011
Slide 42 of 79
Minimum
Ec/Io for
A
Forsk 2011
Slide 43 of 79
(Carrier 2 - candidate)
B
Slide 44 of 79
Allocation results
Commit selected
neighbours only
Slide 45 of 79
Forsk 2011
Slide 46 of 79
Global value for all cells or value specified for each cell
Forsk 2011
Based on distance
Based on overlapping between coverage areas
Slide 47 of 79
Calculation options
Coverage conditions
Overlapping criterion
Start allocation
Forsk 2011
UMTS
LTE
Forsk 2011
Slide 49 of 79
Allocation results
Commit selected
neighbours only
Slide 50 of 79
Forsk 2011
Slide 51 of 79
Slide 52 of 79
Forsk 2011
Slide 53 of 79
Forsk 2011
Slide 54 of 79
Forsk 2011
Slide 55 of 79
Training Programme
Forsk 2011
Slide 56 of 79
Automatic Allocation
Forsk 2011
Slide 57 of 79
General Settings
512 Scrambling Codes Available (0-511)
Management of Coordination Problems and Separations Between Scrambling Codes
Definition of Domains and Groups of Scrambling Codes
Cells table
Possibility to specify pairs of cells which cannot have the same scrambling code
Forsk 2011
Slide 58 of 79
Automatic Allocation
Allocation Criteria
First, Second and Third Order Neighbours
Additional Conditions on Ec/Io
Reuse Distance
Comparison between the inter-transmitter distance and the reuse distance (can be defined at the cell level)
Allocation Strategies
Clustered
Allocation Options
Possibility to force the largest spectrum possible
Possibility to allocate carriers identically
Forsk 2011
Slide 59 of 79
Automatic Allocation
Examples of Allocation Strategies
Conditions
Clustered
Distributed
per cell
One cluster
per site
Forsk 2011
3 clusters consisted of 8
codes :
cluster 0 : 0 to 7
cluster 1 : 8 to 15
cluster 2 : 16 to 23
maximum use of codes
Distributed
per site
Confidential Do not share without prior permission
Slide 60 of 79
Automatic Allocation
Constraints on neighbour relations
Allocation
strategy
Start allocation
Forsk 2011
Slide 61 of 79
Automatic Allocation
Allocation result
Commit scrambling
codes to cells
Forsk 2011
Slide 62 of 79
Colours given to
transmitters
Red : transmitters which
cells have the specified
scrambling code
List of transmitters
which cells have the
defined scrambling
code
Forsk 2011
Grey : other
transmitters
Slide 63 of 79
Distribution table
Forsk 2011
Slide 64 of 79
Forsk 2011
Slide 65 of 79
Training Programme
Forsk 2011
Slide 66 of 79
Simulation Creation
Simulation Results
Analysis of Simulations
Forsk 2011
Slide 67 of 79
Simulation Process
Whats a Simulation in Atoll?
Distribution of Users at a Given Moment (= Snapshot)
Purpose
Simulate the network regulation mechanisms for a user distribution
Analyse the network capacity
Forsk 2011
Slide 68 of 79
Simulation Process
Steps of the Single-technology Simulation
1. Obtaining a Realistic User Distribution
2. Modelling the Network Regulation Mechanisms
Forsk 2011
Slide 69 of 79
Simulation Process
Requirement: Traffic Maps and/or Subscriber Lists
Traffic Maps
Managed from the Traffic Maps Folder
Forsk 2011
Slide 70 of 79
Forsk 2011
According to the clutter weighting and indoor ratio (user location is the same as subscriber location if
the simulation is based on a subscriber list)
Slide 71 of 79
Regulation Mechanisms
UMTS Network
Forsk 2011
Slide 72 of 79
Simulation Creation
Forsk 2011
Slide 73 of 79
Sites Tab
Forsk 2011
Slide 74 of 79
Mobiles Tab
Forsk 2011
Slide 75 of 79
Forsk 2011
Slide 76 of 79
Forsk 2011
Slide 77 of 79
Prediction based on the results of the selected simulation (DL power, UL load factor, etc.)
Prediction based on the average results of simulations in the group (average DL power,
average UL load factor, etc.)
Forsk 2011
Slide 78 of 79
THANK YOU!