presentation-iir04-tutorial-a_systematic_approach_for_wcdma_design.pdf

Dr. Nicolas Cotanis

R&D Department, LCC Intl., [email protected]

A systematic approach for UMTS RAN Dimensioning

2A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004

Proprietary & Confidential

Topics to address

Introduction UMTS specific design inputs

Traffic layer RAN pre-design Static network simulation (design) Design optimization Network optimization

3A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Introduction UMTS specific design inputsUMTS specific design inputsUMTS specific design inputs

Traffic layerTraffic layerTraffic layer RAN preRAN preRAN pre---designdesigndesign Static network simulation (design)Static network simulation (design)Static network simulation (design) Design optimizationDesign optimizationDesign optimization Network optimizationNetwork optimizationNetwork optimization

4A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


UMTS: promises and challenges

Single traffic bearer CDMA technology is history UMTS promises

> Countless services with assorted bandwidth, QoS and traffic models

> Increased capacity from MUD, smart antennas, ST diversity, etc

> Asynchronous operation> Better multipath resolution for improving micro cell design

RN design challenges> A large set of bearers with selectable transmit formats

(OVSF.etc)> Traffic specification (one of the center pieces)> Design and optimization based on MC network simulation> New models for the new technologies

5A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


UMTS design strengths

Design strength> Management of design inputs> Diversification of the UMTS bearers

for a given service (based on mobility and propagation environment)

> Good understanding of the arrays and statistics from simulation

> 2G CDMA design experience> UMTS test-bed involvement

Identify services Traffic engineering

Traffic models Traffic environments

Create & distribute terminals

RF configuration for Node-Bs

Locate Node-Bs

System parameters

Run MAPC

Check design performance based

on arrays and statistics

Map services to UMTS bearers

A Business-plan and traffic review

B RAN design review

A

B

Design Input

RAN design

Traffic layer

RAN design

Simulation

6A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


UMTS design overview

Comprehend concepts before embarking for the design

List of services including- Mobility - Propagation CH - Coverage type - Carrier

UMTS bearers Operating point (Eb/No) optimization

Terminals (single service per terminal)

Hardwareperformance Many terminals per

service according to mobility, propagation CH, etc

Market Traffic environments - Number of terminals - Morphology weighting

Traffic layer

Traffic environ-ments.

- RF parameters per cell - Loading

Cell radius

Link Budget per service type

Deploy sites

Static simulation - Number of snapshots

Generate arrays and reports

Design optimization

- RF parameter optimization - Include new sites, etc

Design Input

Traffic layer

RAN pre-design

Network simulation and optimization

7A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


IntroductionIntroductionIntroduction UMTS specific design inputs

Traffic layer RAN preRAN preRAN pre---designdesigndesign Static network simulation (design)Static network simulation (design)Static network simulation (design) Design optimizationDesign optimizationDesign optimization Network optimizationNetwork optimizationNetwork optimization

8A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Handling traffic

Terminal = a mobile unit that exercises one of the UMTS bearers for supporting a given service and abides to a set of hardware limitations (e.g. max TX power, Ec/Io, number of fingers, etc)

Terminals are distributed for different services within the market (traffic layer)

New concepts Traffic classes Traffic modeling Orthogonality factors Service operating point Power control errors Traffic layer

RN design requires traffic models per subscriber

9A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Traffic classes PS services are characterized by

> Bit rates, Average/Percentile delays, Subscriber traffic model, etc

Based on traffic model and delay, services are classified in four classes> Conversational (C), Streaming (S)> Interactive (I), Background (B)

Not all QoS - functions implemented initially: Real time (CS) connection for C and S classes Non real time scheduled (PS) for I and B classes

Traffic class Conversational Streaming Interactive Background Fundamental characteristics

Preserve time relation between information entities of the stream Conversational pattern (stringent and low delay)

Preserve time relation between information entities of the stream

Request response pattern Preserve payload content (data integrity)

Destination is not expecting the data within a certain time Preserve payload content (data integrity)

Example of the application

Voice, video telephony, video games

Streaming media (audio and/or video)

Web browsing, network games

Background download of e-mails

10

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Traffic modeling / problem statement

Traffic models must include The data flow description during a session (including the request-

response pattern of the end user), The asymmetry The bandwidth (kilobits per second) requirement.

Traffic models for 2G networks were simple(see www.lcc.com for Erlang-B calculator)

Poisson arrivals and exponential service time mE per subscriber instead of bandwidth No data flow description (only voice activity) No asymmetry

11

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


B-traffic, M/M/n models

M/M/n model for B-type traffic classes (e-mail, FTP, etc) Service class described by per user

> CH-rate R> Average packet size E{l} (exponential)> Packet arrival rate o (Poisson)> Average delay objective E{T}

The minimum required number of channels N for the objective E{T} is given by

> is the transmission efficiency due to ARQ,> n is the number of B-type traffic terminals > o = o/o is the subscriber link efficiency

( ) onlETERN ++ 1}{}{

12

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


I-traffic, simulations

The multimedia traffic model is the basic model for I-traffic Currently is not used by design tools for QoS evaluation

Probability of UL/DL active users, no. of terminals, etc I-traffic parameters

Sessions rate Pages per session Packets per page Reading time (RT) Packet size

)Usually, 3G tool has a single traffic model for all the PS type services.

13

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


I-traffic simulation diagram

Statistical Analysis

Traffic generation

Packet switching

Traffic load/sub

User traffic profile / service

QoS

Reading time

SessionPage

# CHs / service

14

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


I-traffic study case

15

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Orthogonality factor 3G: Path loss models + Propagation environments (channels) Propagation channel := power delay profile (paths) Propagation CH relevance

DL orthogonality factor ()> =1 := perfectly orthogonal. No DL inter-codes interference>

16

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Creating terminals

Service operating point 3G services may be transported over the air interface in

many different ways (bearers) Transmit format (TF)

TF controls the bearers operating point (Eb/No @ BER or BLER) The best bearer has the lowest operating point

Service mapping looks for the best bearer (Physical CH) to be used in each area of the market, or Eb/No for a given bearer

RAN design requires operating points They are not specified in the standards May be obtained from vendors or by LLS

ab e bea e co gu at oBearer configuration Downlink Service 144 kb/s Frame size 10 ms Info bits / frame 1440 Bit per radio block * 120 Tail/CRC bits per radio block 8/0 Turbo code Rate 1/3, 8 states Decoding algorithm Max-Log MAP Number of iterations 8 Unequal repetition Not used DTX 320 bits Outer interleaving (10 ms) 7264 bits DPCCH (pilot/TPC/TFCI) 16/8/8 DPCCH-DPDCH power 0 dB Spreading factor (DPDCH) 8 Spreading factor (DPCCH) 8 * A radio block is a group of bit to which a CRC word is appended.

17

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Creating terminals

Operating point variability

Less variability for voice bearers at low and medium speed

High variability for low mobility and high data rate services

33.5

44.5

55.5

66.5

7

0 10 20 30 40 50 60

Mobile speed (km/h)

E

b

/

N

o

(

d

B

)

@

B

E

R

=

1

E

-

6

VH-AVH-BPD-A

Bearer Environment Downlink Uplink 8kb/s kb/s Speech, BER = 10- 3km/hr, vehicular

500 km/hr, vehicular 8.2 dB, 15.6 dB

6.2 dB 13.6 dB

64 kb/s LCD, BER = 10-6 120 km/hr, vehicular 5.3 dB 2.8 dB 144 kb/s LCD, BER = 10-6 120 km/hr, vehicular 5.8 dB 2.55 dB 384 kb/s LCD, BER = 10-6 Outdoor to indoor 3.5 dB 0.3 dB 64 kb/s UDD, BLER of 10% 120 km/hr, vehicular 5.2 dB Mainly uplink 144 kb/s UDD, BLER of 10% 120 km/hr 5.1 dB Mainly uplink 384 kb/s UDD, BLER of 10% Outdoor to indoor, 3km/hr 3.4 dB Mainly uplink

Cell capacity9 M=15 @ 4.2 dB9 M=8 @ 6.8 dB ( )F

M += 1

18

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Terminals

Creating terminals The subscriber concept is replaced by the terminal concept UMTS bearers after mapping services to transport channels

> Propagation CH (power delay profile)> Mobility

Bearers operation point changes with propagation CH and mobility

Hint: one service per terminal Hardware constrains (power class, body loss etc) map bearers into

terminals (according to the UMTS bearer used and power class, etc)

S e r v ic e X

U M T S B e a r e rO p t im u m = m in E b /N o

T e r m in a l

H a r d w a r e c o n s t r a in t s

M o b i l i t yP r o p a g a t io n C H

19

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


For each service Subscribers (terminals) Users (subscribers in session) Active users (UL active = TX, DL active := RX)

CS services: P(A/U)= PS services: P(A/U)=Tcom/Tsession

Traffic engineering derives the size of the users set Per subscriber service load GoS or delays

Users are distributed within the market (using clutter weighting or not)

Terminals/Users/Active users

Subscribersper service

Users

Active-users

Traffic load, QoS

Session profile

T

r

a

f

f

i

c

e

n

g

i

n

e

e

r

i

n

g

I

n

s

i

d

e

S

i

m

u

l

a

t

o

r

P(A)=P(U) P(A/U)

Traffic layer

20

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Not all the services would enjoy the same coverage within the market New coverage approaches: blanket versus island coverage

> 2g systems are targeting blanket voice coverage

The same service may be deployed with different QoS in different areas of the market (e.g. 144 kbps for web in business areas and only 64 kbps in residential areas)

Very likely markets would be divided into disjoint traffic environments Traffic environment := a specific area within the market with a distinct

composition of targeted services Usually polygons are used for locating

traffic environments or hot spots within the market

Each traffic environment will require specific RF configuration for Node-Bs

Node-Bs diversify further within the traffic layer according to the path loss model, propagation channel, loading, hB , etc

Traffic environments

High density residential

Commercial district

Business district

Residential

Traffic layer

21

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Traffic layer

Traffic layer Provides the essential information for spreading

terminals. Traffic environments (TfE)

> business district, commercial district, city core, residential, transport network,etc

Clutter weighting factors Number of terminals per TfE / route

Polygons are used for delimiting TfE or hot spots

Vectors are used for terminal distribution along routes

TfE may be further divided according to the propagation CH. type

High density residential

Commercial district

Business district

Residential

22

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Network configuration

GSM-UMTS site sharing

UMTS high data rate services may require between two and three times as many base stations as do GSM.

Pros : environmentally friendly, quick and effective way to deploy 3G-technology , cost cuts up to 40%.

Cons : could amount to a single 3G-network, undermining competition and technological innovation.

e.g. transceivers cannot be shared without sharing forecasting data Forms of infrastructure sharing

Sharing of Node-B and RNC Sharing of even the core network technology, including mobile switching

centers, IP routers, and location registriesScenario RAN design Headframe sharing (UMTS antennas) Site location and UMTS antenna height are

given Antennas sharing (dual-/tri-band antennas) As before plus UMTS antenna height,

orientation and down tilt are given Node-B equipment sharing As before plus number of channel elements

and service types to be coordinated with sharing partners

23

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


IntroductionIntroductionIntroduction UMTS specific design inputsUMTS specific design inputsUMTS specific design inputs

Traffic layerTraffic layerTraffic layer RAN pre-design Static network simulation (design)Static network simulation (design)Static network simulation (design) Design optimizationDesign optimizationDesign optimization Network optimizationNetwork optimizationNetwork optimization

24

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Key system parameters

Key System Parameters Common Pilot Channel (CPICH) power Synchronization Channel (SCH) powers

> Used by cell search (initial / target) Cell loading factor SHO thresholds and gains

W-CDMA cells are identified by DL scrambling codes W-CDMA cell search

Code and time synchronization with the scrambling code of the best server

Based on P-SCH, S-SCH* and CPICH Powers for SCH and CPICH

Tradeoff: cell capacity cell acquisition time

25

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


SCH/CPICH loading factors

Cell search performance controlled by the power used (loading factors)

SCHSCHPSCHP PP =( ) ( )hcCPiCHSCHSCHSCH IPPP ++= ( )hcCPICHSCHCPICHCPICH IPPP ++=

( ) ochcCPICHSCH IIPPG ++= Geometry factor *

* Y-P Eric Wang, T. Ottoson Cell Search Algorithms and Optimization in W-CDMA, VTC-00, Spring 2000

For G=-3dB 5% < CPICH < 10% SCH 10% 60% < P-SCH < 70% CCH < 10%

IN unitP_nodeB 43 dBm of P_nodeB 19.95 Wx_CPICH 10 % of P_nodeBx_SCH 10 % of P_nodeBx_PSCH 60 % of SCHx_CCCH 10 % of P_nodeBOUTP_CPICH 33 dBm 2.00 WP_SCH 33 dBm 2.00 WP_PSCH 30.8 dBm 1.20 WP_SSCH 29 dBm 0.80 WP_CCCH 33 dBm 2.00 WP_traffic 41.5 dBm 13.97 W

26

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Average acquisition time versus CPICH G= 3 dB, P-SCH=50%, SCH=10%

5% < CPICH < 10%

Key System Parameters

CPICH Power

96.596.27108.13155.79

31.7431.932.1844.61

1462.5

33.2910

102

103

104

0 5 10 15CPICH Loading

A

v

e

r

a

g

e

a

c

q

u

i

s

i

t

i

o

n

t

i

m

e

(

m

s

)

InitialTarget

27

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



SCH Power

Average acquisition time versus P-SCH G= 3 dB, SCH=10%, CPICH=10%

SCH 10% 60% < P-SCH < 70%

96.27

82.2374.74

69.63 67.18 68.41

31.9 31.6 31.5 31.6 31.8 32.320

30

40

50

60

70

80

90

100

110

0.45 0.55 0.65 0.75P-SCH Loading

A

v

e

r

a

g

e

a

c

q

u

i

s

i

t

i

o

n

t

i

m

e

(

m

s

)

InitialTarget

28

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Cell Loading Factor

Noise rise (I) and loading factor () are related

Per propagation or traffic environment limits for loading factors Link budget cell radius calculation Static network simulation terminals disconnection

Hints < 75% > 30% ; moderate cell breathing DL> UL

Traffic environment Loading factor (%) Noise rise MAI (dB)

Rural and highways 30-40 1.55-2.23 Urban and dens-urban

75 6

=+=

11log10log10dB

N

hcoc

PIII

29

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Number of Rake fingers The number of Rake fingers efficiency of utilizing

the incoming RF power (one finger per multipath component) Requirement changes with the environment Fixed for a given terminal The larger the number of Rake fingers in the terminal the better the

signal/noise Measurements

Typical urban (?): 4-6 fingers retrieve 80% of the Tx power for 95% of the time. The rest of the Tx power (20%) becomes interference

Dense urban (?): 10-15 fingers No agreement on the required number of fingers and

finger assignment technique Single Rake finger assignment Grouped assignment

The number of fingers in the receiver must equal the size of the active set (dimensioning tool). In the absence of manufacturer data, the active set size should range between 4 to 6.In the case of grouped assignment, the active set must equal the number of groups and not the number of individual fingers

30

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


UMTS handovers

SHO thresholds and margins UMTS RAN designs require

UL: S and So handoff margins (no thresholds) and gains DL: S/So handoff margins,gains and terminal AS size

UMTS uses relative SHO thresholds No need to tweak the parameters for different regions Relative thresholds control SHO overhead

Design tools use SHO margins instead of thresholds The minimum difference between the CPICH signal of the best

serving sector and the pilot signal of all other sectors that are considered for soft-handover communication

SHO margin from SHO gain graphs. Functions of

> multipath profile (PL) > terminal mobility and availability

of power control> BS/terminal antenna configuration> receiver algorithm

ITU pedestrian A ITU vehicular A Single radio link

Eb/No (dB) 11.3 8.5

Macro diversity Eb/No (dB) 7.3 / 8.6 6.3 / 7.7

Soft handover gain (dB) 4.0 / 2.7 2.2 / 0.8

Required Eb/No for FER=1%.CS 8 kbps bearer with full constant power

PL= 0 and 3 dB respectively

31

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Link budget LB pre-dimensioning estimates the initial network

configuration Based on many assumptions

Uniform inter-cell interference (f), Soft handover overhead and gain Constant Node-B antenna gain Uniform traffic distribution and uniform service mapping Same results for every run, etc.

Link budgets are used for calculating the service radius for each cell type and supported terminal

Based on the per services coverage objective (blanket or island -where available-) cell type radii are determined

Typical Cell Ranges Outdoor, In-car @ 95% Indoor @ 80%Bearer Urban Sub-urban Urban Sub-urban12.2 kb/s Speech 1.98 km 3.34 km 1.02 km 2.55 km64 kb/s 1.61 km 2.71 km 0.93 km 1.56 km144 kb/s 1.42 km 2.39 km 0.62 km 1.04 km384 kb/s 1.24 km 2.10 km 0.53 km 0.90 km

) In the UMTS RAN design process; the link budget is used to estimate the calculation area for each site/cell and not the actual cell radius. Thus, LB inaccuracies resulting from so many assumptions are tolerable.

Terminal Coverage radius (km) 12.2 kbps speech 1.98 64 kbps 1.61 144 kbps 1.42 Cell 1.42

32

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Link Budget

Link Budget Model

Nt

PTx,k LBODY EIRPTx,kGTx

mLN

Lpen GRx

MAPLk

LRx

mTPC

SkgSS

(Eb/No)k

IcellgSO

Matched

PRx,k

LTx

Only when the transmitter is a handheld

Nw

Receiver end

BearerCoverage

Transmitter end

Path loss model

Cell radius k

EIRP calculation

PRx,k calculation

Pk

NF NF

33

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Traffic layerTraffic layerTraffic layer RAN preRAN preRAN pre---designdesigndesign Static network simulation (design) Design optimizationDesign optimizationDesign optimization Network optimizationNetwork optimizationNetwork optimization

34

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


The SNS concept W-CDMA RAN design tools based on the static network

simulation (SNS) concept. Snapshots of the RAN status at different instances in time Monte Carlo (MC) trials per snapshot for spatial distribution of

terminals* Multiple access power control (MAPC) algorithms for assigning the

amount of UL/DL power required by each radio link (RL)> Connect or disconnect active terminals

SNS resolves assumptions Estimates F-factor distribution SHO overhead and gain,etc Uses antenna radiation pattern Spatially distributes terminals Output changes according to

terminal distribution

fF

hc

ocII +=+= 1

11

1

35

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


SNS output

Arrays (plots): radio network attributes associated to each bin (e.g., CPICH coverage,Ec/It, effective service coverage, best server, SHO including active set, etc

Statistics (databases), the status** of each Node-B or terminal in the working area

CPICH best server

SHO gain

36

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Static Network Simulation

SNS flowchart

Estimating the status of a CDMA radio network outside the history context

MAPC := an iterative algorithm that finds out the best server and the active set (AS) for each active terminal and, based on the type of service, provisions the minimum UL/DL transmit power for supporting the radio link

Randomly place terminals and

assign services

Initial Best Server(PL based)

For each active terminal doInitial UL/DL PowerControl

Best Server(Ec/It based)

Convergence ?NoYes

Ready

For each active terminal doUL/DL Power Control

The status of a CDMA radio network is represented by the set of terminals and services that are connected through the air interface.

37

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Randomize terminals

Monte Carlo trials for distributing terminals within the working area)One service per terminal pa := Active (Tx or RX) state probability for

service* nt := Number of k-type terminals in the

working area na := Average number of active terminals


assign services




Convergence ?NoYes

Ready


AtA pnn =

The number of terminals within a pixel follows a Poisson distribution with a mean value proportional with the corresponding pixel area.

Path losses from a given Node-B to terminals within the same bin may be different due to the randomness inflicted by the shadowing

38

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Initial Best Server and AS

The best server and the active set for each terminal are initially calculated based on path loss (PL)

Initial Node-B noise


assign services




Convergence ?NoYes

Ready


39

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



MAPC For each terminal, MAPC finds the best server and

the AS, and assigns the minimum UL/DL transmit power for providing the required service at that instance

Initial UL/DL power control for each active terminal Initial Ec/It

UL/DL Tx power per radio link based on Terminal sensitivity including average power raise (PRx,k) SHO gain

MAPC stops when convergence its reached or when exceeding a maximum number of iterations

Usable snapshot when MAPC converges Different convergence criteria

UL/DL criteria combined in a single indicator e.g. UL criterion


assign services




Convergence ?NoYes

Ready


40

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



The hypothetical terminal Does not disturb the system

> It does not contribute to the intercell and intracell interference> It does not consume channel resources

At the end of selected snapshots, the HT visits all the empty pixels (without terminals) for determining

> Best server> Mean size of active set> UL/DL required TX power, etc> The most probable handover type> Mean number of soft handover cells

The sector (site) related information required for UL/DL TX power computation (as the intracell and intercell interference, PA power etc.) are derived from statistics based on previous SNS snaphots.

Improper use of the hypothetical terminal may distort the SNS arrays and statistics (see Design Optimization).The HT examines UL/DL service powers only. For example, the handover status display at a certain pixel may indicate 3-way soft-handover however, a subscriber, which falls into this pixel, may or may not be in 3 way handover depending upon channel element availability

41

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Options SNS options copy the operation of a UMTS RAN

Carriers CPICH power allocation Disconnecting terminals

If optional RF-CH are availablea) randomly assigning MSs within the entire network b) randomly moving MSs from overloaded cells c) moving only high transmit power MSs from overloaded cells

CPICH power allocation optionsa) fix within the networkb) adjustable for each cell based on UL-interference levelc) cell selectable.

Exceeding Node-B total/RL transmit powera) randomly disconnectb) disconnect the highest power linksc) disconnect the smallest power links

42

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Traffic layerTraffic layerTraffic layer RAN preRAN preRAN pre---designdesigndesign Static network simulation (design)Static network simulation (design)Static network simulation (design) Design optimization Network optimizationNetwork optimizationNetwork optimization

43

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Design optimization

Questions after RAN design completion

Overall (network) performance Do the networks sites and sectors capture the projected

traffic? What is the throughput per Node-B? How many terminals of each service type are captured by

each sector in the network? RF performance

What are the principal reasons for failure to connect? What is the percentage of RLs in SHO? What is the average downlink transmit power per service type

required?

44

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Design optimization

Per service/Per carrier arrays

Per service arrays describe the service performance Basically each bin denotes a probability They may refer to many carriers

Per carrier arrays describe the RF performance Are very similar with those used for 2G CDMA designs

45

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Design optimization

Per service arrays

Coverage probability per service Best server by coverage probability Coverage probability by service for the Nth best server Path balance SHO arrays Reason for failure by service UL request TX power

zProbability of CH limit failurezDL/UL EbNozLow EcIozNo primary CHzNoise rise limitzNo carrier

46

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Design optimization

Service coverage probability

Application: shows the coverage probability for every pixel in the simulation area (effective service coverage)

Input: - Colors: Ranges for pS,B (%) Description

Comments: based solely on HTs in bins where ATs have not been

spread

BSR

BSCBS

NNP ,

,, =

Service coverage probability (SCP) Best server by coverage probability CP for the Nth best server Path Balance Reason for failure (by service) Probability of channel limit failure Probability of Downlink Eb/No failure Probability of Uplink Eb/No failure Probability of Low Ec/Io failure Probability of no carrier failure Probability of Noise Rise Failure Uplink request Tx power Soft handover arrays Second order service arrays

47

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Design optimization / Carriers

Per carrier arrays (RF)

Without simulation Best server by pilot Pilot strength Pilot strength for the Nth best server

After simulation Pilot Ec/Io Ec/Io for the Nth best server Mean Io Mean received power Cell UL load

Pilot strength Pilot strength for the Nth best server Best server by pilot Pilot Ec/Io Ec/Io for the Nth best server All servers Cell UL load Mean Io Mean received power

48

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Traffic layerTraffic layerTraffic layer RAN preRAN preRAN pre---designdesigndesign Static network simulation (design)Static network simulation (design)Static network simulation (design) Design optimizationDesign optimizationDesign optimization Network optimization

49

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


UMTS network optimization

Measurements required for UMTS network optimization Delay profile (usually before design) Cell search time Frame error rate and radio propagation MS transmission power DHO Uplink capacity

50

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Delay profiles

Wide band channel measurements

The link quality decreases when the number of multipath are larger then the number of fingers

Optimization: Antenna down tilt or bettersectorization

51

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Cell search time

MSs always monitor neighboring CPICH during communication for the purpose of DHO control. MSs have to complete this

process as fast as possible. The ration between CPICH

power and MAI controls the cell search time

52

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Frame error rate and radio propagation

Measurements of RSSI, SIR, FER and total available path number

53

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


MS transmission power

UMTS supports SIR based fast TPC to solve the near/far problem. MSs transmission

power gives an indication of the TPC efficiency on reducing MAI and increasing network capacity

Optimization: TPC step size, rate, etc

54

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


DHO

The number of connection cells/sectors in the service area are measured

Optimization: Thadd and Thdel parameters

55

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Uplink capacity

Measurements on the uplink interference level The lower the MAI the

higher the uplink UMTS capacity

Optimization: MUD, smart antennas, etc

56

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004



Traffic layerTraffic layerTraffic layer RAN preRAN preRAN pre---designdesigndesign Static network simulation (design)Static network simulation (design)Static network simulation (design) Design optimizationDesign optimizationDesign optimization Network optimizationNetwork optimizationNetwork optimization UMTS overlay

57

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Design optimization

Objectives

UMTS overlay = deploying UMTS on top of an existent GSM network securing all the benefits of a synergetic network.

Overlay design = Constrains on UMTS design Benefits of overlay

Reducing deployment costs through co-location/co-sitting

Controlling the NB interference (avoiding near-far effects)

Resource sharing; coverage extension, capacity sharing, service distribution

Issues to address UMTS network evolution, Coverage, Co-location, Interference and noise, Inter-system handover, Mobility management, Traffic load sharing, etc

58

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Launch architecture Integrated CN

upgrades and uses the MSC and routing elements of the legacy GSM/GPRS network

Careful deployed for preserving the capacity and performance of the GSM/GPRS revenue-earning network

BTS

BSS BTS

GERAN

RNC Node B

UTRAN

Node B

SGSN

GPRSVLR

MSC

VLR

Gb

A

Iu-ps

Iu-cs

2G and 3G CS-elements

2G and 3G PS-elements

BTS

BSS BTS

GERAN

RNC Node B

UTRAN

Node B

SGSN

GPRSVLR

MSC

VLR

Gb

A

SGSN

GPRSVLR

MSC

VLR

Iu-ps

Iu-cs

2G CS- elements

2G PS- elements

3G CS- elements

3G PS- elements

Segregated CN uses a new network of switching

and routing elements to support UMTS

59

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


UMTS overlay deployment Two major phases

radio coverage service availability.

Inspect technical/real estate issues for co-location Multi-band antennas?

WCDMA site and antenna allocation Inter-system interference analysis Link budget analysis per service

GSM-WCDMA traffic load distribution

Combined GSM/WCDMA analysis

WCDMA design

Objective reached

Review: site configuration,

traffic, design objectives

Far from objective

Design performance?

Review GSM network coverage Select candidate sites (Spectrum carving if required)

60

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Coverage analysis Utilization of existing 2G-sites (co-location) needs checking for

Holes in the 2G-coverage (for basic services as voice) Increased intra-system interference for WCDMA should be avoided..

Unit GSM900/ speech GSM1800/

speech WCDMA/

speech WCDMA/ 144 kbps

WCDMA/ 384 kbps

Mobile Tx power dBm 33 30 21 21 21 Receiver sensitivity 1 dBm -110 -110 -124 -117 -113 Interference margin 2 dB 1 0 2 2 2 Fast fading margin 3 dB 2 2 2 2 2 BS antenna gain 4 dBi 16 18 18 18 18 Body loss 5 dB 3 3 3 MS antenna gain 6 dBi 0 0 0 2 2 Relative path loss gain with frequency 7 dB 11 1

MAPL dB 164 154 156 154 150 1 GSM sensitivity includes receive antenna diversity. WCDMA

sensitivity is calculated based on the equation

dBdB EbNoSFkTBF + )(log10 10 , where bandwidth B=3.84 MHz, spreading gain SF=B/(data rate), and F=4dB is the WCDMA base station noise figure.

2 An interference margin of 1 dB was used for GSM because of the small amout of spectrum in GSM 900 that does not allow large reuse factors. For a loading of =37%, the noise raise is

dB2)1(log10 10 =

3 The reduced fast fading margin comes from including the macro diversity gain

4 Three sector configuration are assumed for both GSM and WCDMA

5 Data terminals have not to stay close to the users had 6 Antenna gain for data terminals is 2 dBi 7 Represent variations in the path loss attenuation with frequency

versus the UMTS Region 1 band

61

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Intersystem interference WCDMA interference Interference from 2G systems

Mobile Rx Mobile Tx

Mobile Rx Mobile Tx

Mobile Rx Mobile Tx

900 880 920 940 960 980

960 935 915 890

GSM

PCN(EU)17501700 1800 1850 1900 1950

1710 1785 1805 1880

18001750 1850 1900 1950 2000

1850 1910 1930 1990

PCS(US)

Frequency (MHz)

Frequency (MHz)

Frequency (MHz)

Unit Region 1 Region 2

Up-link (MS transmit, base receive)

MHz 1920 - 1980 1850 1910

Down-link (MS receive, base transmit)

MHz 2110 2170 1930 - 1990

62

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


2G interference and background noise Interference mechanisms from adjacent 2G bands

ACI for up-links ACI, intermodulation, and wide band noise in the down-link

WCDMA-2G coordination Background noise measurements

Identifying co-location issues (as imperfect spectrum clearance or leakage from adjacent bandwidth)

Estimating the sensitivity reduction due to background noise rise from heavy motor traffic (~ 1.9 dB in urban environments)

2G WCDMA 2G2G 2G

Operator 3 Operator 1 Operator 2

2G WCDMA2G 2G


WCDMA2G 2G


WCDMA

A

B

C

63

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Reduction in coverage and capacity Coverage and capacity reductions investigated through

Monte Carlo simulations A denser WCDMA network will be more resistant to 2G interference Guard bands of approximately 1MHz should eliminate 2G interference

issues (applicable for non-coordinated 2G systems) If the legacy 2G-network is made of micro cells and the WCDMA cells are

large ( 1.5 km) guard bands cannot alleviate capacity reductions.

WCDMA-2G collocation has a double advantage: it reduces deployment costs and builds coordination for minimizing 2G Interference risks

64

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Conclusions

3G designs rely on preliminary steps

Overlay designs require Extra preliminary steps Design tools for investigating GSM-UMTS synergy

3G Design Tool

Traffic data w/ QoS control

Configuration Key Network Parameters

Service mapping

SNS

LLS

3G-Traffic

WBsounding

65

A

s

y

s

t

e

m

a

t

i

c

a

p

p

r

o

a

c

h

f

o

r

U

M

T

S

R

A

N

D

i

m

e

n

s

i

o

n

i

n

g

D

r

.

N

i

c

o

l

a

s

C

o

t

a

n

i

s

September 20, 2004


Thank you for attending!

A systematic approach for UMTS RAN DimensioningTopics to addressUMTS: promises and challengesUMTS design strengthsUMTS design overviewHandling trafficTraffic classesTraffic modeling / problem statementB-traffic, M/M/n modelsI-traffic, simulationsI-traffic simulation diagramI-traffic study caseOrthogonality factorService operating pointOperating point variabilityCreating terminalsTerminals/Users/Active usersTraffic environmentsTraffic layerGSM-UMTS site sharingKey system parametersSCH/CPICH loading factorsCPICH PowerSCH PowerCell Loading FactorNumber of Rake fingersSHO thresholds and marginsLink budgetLink Budget ModelThe SNS conceptSNS outputSNS flowchartRandomize terminalsInitial Best Server and ASMAPCThe hypothetical terminalOptionsQuestions after RAN design completionPer service/Per carrier arraysPer service arraysService coverage probabilityPer carrier arrays (RF)UMTS network optimizationDelay profilesCell search timeFrame error rate and radio propagationMS transmission powerDHOUplink capacityObjectivesLaunch architectureUMTS overlay deploymentCoverage analysisIntersystem interference2G interference and background noiseReduction in coverage and capacityConclusionsThank you for attending!

presentation-iir04-tutorial-a_systematic_approach_for_wcdma_design.pdf

Documents

design network simulation

design input traffic

center pieces design

traffic specification

history umts

proprietary confidentialtopics

countless services

statisticsmap services