80691953-wcdma-power-and-scrambling-code-planning.pdf

8/10/2019 80691953-WCDMA-Power-and-Scrambling-Code-Planning.pdf

1/84

Internal

WCDMA Power andScrambling Code Planning

www.huawei.com

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved


2/84

Chapter 1 Physical Layer OverviewChapter 1 Physical Layer Overview

Chapter 3 Scrambling Code PlanningChapter 3 Scrambling Code Planning

HUAWEI TECHNOLOGIES CO., LTD. All rights reserved Page 1


3/84

Radio Interface Protocol StructureDCNtGC

-

DCNtGC

Duplication avoidance

UuS boundary

L3ll

-

controlRRC

control

contr

contr

control

PDCP

PDCP L2/PDCP

Radio

Bearers

BMC L2/BMC

LogicalChannels

RLC

RLCRLC

RLC

RLC

RLC

Transport

Channels

L2/MACMAC



4/84

WCDMA Radio Interface has three kinds of channels

In terms of protocol layer, the WCDMA radio interface has three

, .

Logical channel: Carrying user services directly. According to the

types of the carried services, it is divided into two types: Control.

Transport channel: It is the interface of radio interface layer 2 and

physical layer, and is the service provided for MAC layer by the

p ys ca ayer. ccor ng to w et er t e n ormat on transporte s

dedicated information for a user or common information for all users, it

is divided into dedicated channel and common channel.

Physical channel: It is the ultimate embodiment of all kinds of

information when they are transmitted on radio interfaces. Each kind of

channel which uses dedicated carrier frequency, code (spreading codean scram e an carr er p ase or can e regar e as a

dedicated channel.



5/84

Radio Interface Channel Organisation



6/84

Logical Channel

Dedicated traffic channel (DTCH)

ra c c anneCommon traffic channel (CTCH)

Broadcast control channel (BCCH)

Paging control channel (PCCH)

Control channelDedicate control channel (DCCH)

Common control channel (CCCH)



7/84

Transport Channel

Dedicated Channel (DCH)

-DCH is an uplink or downlink channel

Dedicated transport

channel

roa cas c anne

Forward access channel (FACH)

Random access channel (RACH)

High-speed downlink shared channel

channel

(HS-DSCH)



8/84

A physical channel is defined by a specific carrier frequency, code

(scrambling code, spreading code) and relative phase.

In UMTS system, the different code (scrambling code or spreadingco e can s ngu s e c anne s.

Most channels consist of radio frames and time slots, and each radio

.

Two types of physical channel: UL and DL

Physical Channel

Frequency, Code, Phase



9/84

Downlink Dedicated Physical Channel

(Downlink DPCH)

own n ommon ys ca anne

Common Control Physical Channel (CCPCH)

S nchronization Channel SCHDownlink

Paging Indicator Channel (PICH)

Acquisition Indicator Channel (AICH)

Common Pilot Channel (CPICH)

High-Speed Packet Downlink Shared

Channel (HS-PDSCH)

High-Speed Shared Control Channel(HS-SCCH)



10/84

U link Ph sical Channel

Uplink Dedicated Physical Channel

Uplink Dedicated Physical DataChannel (Uplink DPDCH)

Uplink Dedicated Physical ControlChannel (Uplink DPCCH)

High-Speed Dedicated Physical Channel(HS-DPCCH) Uplink Physical

anne

Uplink Common Physical Channel

Physical Random Access Channel(PRACH)



11/84

Channel Mapping DL

og caChannels Channels Channels

-

P-SCH

CPICH

PCHPCCH

-

S-CCPCH

FACHCCCH

AICHPICH

CTCH

DCCH HS-PDSCH

DCH

DSCH

DTCH

DPDCH

DPCCH



12/84

Channel Mapping UL

LogicalChannels

TransportChannels

Physical

Channels

RACHCCCH PRACH

DCCH CPCH PCPCH

DCH DPDCH

DPCCH

I branch

Q branch



13/84

Function of physical channel

P-CPICH-Primary Common Pilot Channel

S-CPICH-Secondary Common Pilot Channel

Synchronization& Cell broadcast channels to all UE in a cell

- -

SCH- Synchronisation Channel (Including P-SCH and S-SCH Channel)

Paging channels

S-CCPCH-Secondary Common Control Physical Channel

PICH-Paging Indicator Channel

PRACH-Physical Random Access Channel

Random access channels

DPDCH-Dedicated Physical Data Channel

Dedicated channels

AICH-Acquisition Indicator Channel

DPCCH-Dedicated Physical Control Channel

HS-SCCH-High Speed Share Control Channel

High speed downlink share channels

HS-DPCCH-High Speed Dedicated Physical Control Channel

HS-PDSCH-High Speed Physical Downlink Share Channel



14/84

UE Acquisition and Synchronization

Initial Cell Synchronization

UE Monitor Primary SCH Code, detect peak in matched filter output

Slot Synchronization Determined

P-SCH

,start time offset

UE determines Scrambling Code by correlating all possible codes in group

Frame Synchronization and

Scrambling Code

Group Determined

-

CPICH

UE Monitors and decodes BCH data

Scrambling Code Determined

P-CCPCH

UE adjust transmit timing to match timing of BS

, -

Cell Synchronization complete

This rocedure is a lied whenever a UE needs to access a cell or measure the ualit of a cell i.e. durin cell


selection, cell re-selection and soft handover


15/84

Physical Channel(DL) Transmission Timing



16/84

Primary Synchronization Channel (P-SCH)

se or ce searc an sync ron za on Two sub channels: P-SCH and S-SCH.

SCH is transmitted at the first 10% of

SSC specifies the scrambling codegroups of the cell.

SSC is chosen from a set of 16

v y .

PSC is transmitted repeatedly in each

time slot.

,are altogether 64 primary scramblingcode groups.

Slot #0 Slot #1 Slot #14

Primary

SCHpac pac pac

Secondary

SCHacs

i,0acs

i,1 acsi,14

256 chips2560 chips

One 10 ms SCH radio frame



17/84

Cell Synchronisation

Cell synchronisation is achieved with the Synchronisation Channel (SCH). This channel dividesup into two sub-channels:

-.

(SLOT and CHIP SYNCHRONIZATION)A Primary Synchronisation Code (PSC) is transmitted the first 256 chips of a time slot. This is the case in

every UMTS cell. If the UE detects the PSC, it has performed TS and chip synchronisation. This is typically.

The slot timing of the cell can be obtained by decoding peaks in the matched filter output



18/84

2. Secondar S nchronisat ion Channel S-SCH (FRAME SYNCH and Scrambl ing Code Group

Cell Synchronisation

DETECTION)The S-SCH also uses only the first 10% of a timeslot. There are 16 different SSCs, which are organised in a

10 ms frame (15 timeslots), giving us a sequence of 15 SSCs. There is a total of 64 different sequences of 15

SSCs, corresponding to the 64 primary scrambling code groups.

slot numberScramblingCode Group #0 #1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14

Group 0 1 1 2 8 9 10 15 8 10 16 2 7 15 7 16

The beginning of a 10

ms frame can be

determined (framesynchronization)

Group 1 1 1 5 16 7 3 14 16 3 10 5 12 14 12 10

Group 2 1 2 1 15 5 5 12 16 6 11 2 16 11 15 12

Group 3 1 2 3 1 8 6 5 2 5 8 4 4 6 3 7

Group 4 1 2 16 6 6 11 15 5 12 1 15 12 16 11 2

based on sequence of

SSC

64 different SSC

Group 61 9 10 13 10 11 15 15 9 16 12 14 13 16 14 11

Group 62 9 11 12 15 12 9 13 13 11 14 10 16 15 14 16

Grou 63 9 12 10 15 13 14 9 14 15 11 11 13 12 16 10

10ms are identi fied

The unique

combination of SSCs

Slot # ? Slot #? Slot #?

Scrambling Code

Group

..p- p

16 6S-SCH

p

11 Group 2

Slot 7, 8, 9256 chips


2560 chips


19/84

Scrambling Code

Scrambling code: Gold sequence.

Scrambling code period: 10ms (38400 chips).

The code used for scrambling of the uplink DPCCH/DPDCH may be of

either long or short type, There are 224 long and 224 short uplink

scrambling codes. Uplink scrambling codes are assigned by higher

layers.

For downlink physical channels, a total of 218-1 = 262,143 scrambling

codes can be generated.

Only scrambling codes 0, 1, , 8191 are being used.

Note: RNP engineer should plan the scrambling codes for each cell.



20/84

Scrambling Code (SC)

Set 0

scrambling code 0

scrambling code 1

Scrambling

Codes for

Set 1

downlink

scram ng co e

scrambling code

scrambling code

51116

scrambling code

5111615

8192 Scrambling

Codes

512 sets

Each set includes a primary scrambling code and

15 secondar scramblin codes.



21/84

Primary Scrambling Code Group

Grou 0

PSC 0

PSC 1

Primary

Scrambling

Group 1

downlink

PSC 63*8

PSC 7

PSC 63*8+1

Group 63

PSC 63*87

512 Primary

Scrambling Codes

64 Primary Scrambling

Code Groups

Each group consists of 8

Primary Scrambling Codes



22/84

Common Pilot Channel (CPICH)

Divides up into a mandatory Primary Common Pilot Channel (P-CPICH) and optionalSecondary CPICH (S-CPICH).

Carries pre-defined sequence.

Fixed rate 30Kbps SF=256

Primary CPICH (P-CPICH) Uses the fixed channel code -- Cch, 256, 0

Scrambled by the primary scrambling code

Only one CPICH per cell

Broadcast over the entire cell

Used by UE to determine the Primary Scrambling Code

Used as phase reference for most of the physical channels

Used as measurement reference in the FDD mode (and partially in the TDD mode).

Pre-defined symbol sequence

T = 2560 chi s , 20 bits

Slot #0 Slot #1 Slot # i Slot #14


1 radio frame: Tr = 10 ms


23/84

Primary Common Pilot Channel (P-CPICH)10 ms Frame

2560 Chips 256 Chips

Synchronisation Channel (SCH)

CP

-

P-CPICH

Cell scrambling

code? I get it

with trial &

error!

applied speading code =

symbol-by-symbol correlation

c , ,

A spreading code is the product of the cellsprimary scrambling code and the channelisation code. The

channelisation code is fixed: Cch,256,0,UE uses the spread received signal (P-CPICH) to determine the cells


.


24/84

P-CPICH as measurements reference

UE has to perform a set of L1 measurements, some of them refer to the CPICH channel:

CPICH RSCPRSCP stands for Received Si nal Code Power. The UE measures the RSCP on the Primar -CPICH. The

reference point for the measurement is the antenna connector of the UE. The CPICH RSCP is a power

measurement of the CPICH. The received code power may be high, but it does not yet indicate the quality of

the received signal, which depends on the overall noise level.

UTRA carrier RSSI.RSSI stands for Received Signal Strength Indicator. The UE measures the received wide band power,

which includes thermal noise and receiver generated noise. The reference point for the measurements is the

.

CPICH Ec/NoThe CPICH Ec/No is used to determine the quality of the received signal. It gives the received energy per

.

relation to the cell noise. (Please note, that transport channel quality is determined by BLER, BER, etc. )

The wideband measurements are conducted on GSM BCCH carriers.



25/84

P-CPICH as Measurement Reference

Received Signal Code Power (dBm)CPICH RSCP

Received energy per chip divided by the power density in the band (dBm)CPICH Ec/No

Total Received wide band power, including thermal noise and noise

generated in the receiver

UTRA carrier

RSSI

CPICH Ec/No =CPICH RSCP

UTRA carrier RSSI

CPICH Ec/No

0: -24

-

CPICH RSCP

0: -115

-

UTRA carrier RSSI

0: -110

-.

2: -23

3: -22.5

...

2: -113

:

88: -27

2: -108

:

71: -3947: -0.5

48: 0

89: -26 72: -38

73: -37



26/84

Primary Common Control Physical Channel (P-CCPCH)-

Fixed rate, fixed OVSF code30kbpsCch256,1

, ,

CCPCH. By reading the cell system information on the P-CCPCH, the UE learns everything about theconfiguration of the remaining common physical channels in the cell.

Broadcast over the entire cell

Carry BCH transport channel

The PCCPCH is not transmitted during the first 256 chips of each time slot.

Only data part

256 chips

PCCPCH Data

18 bits

T = 2560 chips,20 bits

SCH

Slot #0

1 radio frame: Tf

= 10 ms

Slot #1 Slot #i Slot #14



27/84

Primary Common Control Physical Channel (P-CCPCH)

2560 Chips 256 Chips

10 ms Frame

CP

P-CCPCH

Channelisation code: Cch,256,1

P-CCPCH

na y, ge e

cell system

information

no , no p o sequence

27 kbps (due to off period)

organised in MIBs and SIBs



28/84

Secondary Common Control Physical Channel (S-CCPCH)

Carry FACH and PCH.

Two kinds of S-CCPCH: with or without

TFCI UTRAN decides if a TFCI should

an can e mu p exe o e

same or separate SCCPCHs. If multiplexed tothe same S-CCPCH, they can be mapped to thesame fame.

, .

Possible rates are the same as that of

downlink DPCH

S-CCPCH is on air ONLY when there is data to

e rs - mus ave a sprea ngfactor of 256, while the spreading factor of theremaining S-CCPCHs can range between 256

(30 Kbps or 15 Ksps) and 4 (1920 Kbps)

We use SF = 64 120 Kbps (60 Ksps)

Data

N bits

T slot = 2560 chips,

DataPilotN bitsPilotN bits

TFCITFCI

20*2 k bits (k=0..6)

Slot #0 Slot #1 Slot #i Slot #14

1 radio frame: Tf

= 10 ms



29/84

Paging Indicator Channel (PICH)

PICH is a fixed-rate (30kbps,SF=256) physical channel used to carry the PagingIndicators (PI).

are used to carry paging indicators and the remaining 12 bits are not defined.

N paging indicators {PI0, , PIN-1} in each PICH frame, N=18, 36, 72, or 144.

,this paging indicator should read the corresponding frame of the associated S-CCPCH.

12 bits undef ined

b 1b0

b287 b288 b299

One radio f rame (10 ms)


S CCPCH d it i t d PICH


30/84

S-CCPCH and its associated PICHS-CCPCH frame,

-associated wi th PICH frame

PICH

= 7680

-

PICH frame

for paging indication

no transmission

b287 b288 b299b286b0 b1

# of paging

indicators per frame

(Np) Paging group

Subscribers with

Pq indicator

paged =>

Subscribers with

Pq indicator

not paged =>

#bit too s

32 (8 bits)

72 (4 bits) {b4q, , b4q+3} = {1,1,,1} {b4q, , b4q+3} = {0,0,,0}

{b8q, , b8q+7} = {1,1,,1} {b8q, , b8q+7} = {0,0,,0}

16q, , 16q+ = , ,, q, , q+ = , ,,less ,may

be cannot

detect if

have


{b2q, b2q+1} = {1,1} {b2q, b2q+1} = {0,0}144 (2 bits)fading


31/84

Physical Random Access Channel (PRACH)

The random-access transmission data consists of two parts: One or several preambleseach preamble is of length 4096chips and consists

of 256 repetitions of a signature whose length is 16 chips16 availables gnatures tota y

10 or 20ms message part

Which signature is available and the length of message part are determined byg er ayer

Message part

Preamble

4096 chips10 ms (one radio frame)

Preamble ream e

Message partPreamble Preamble

Preamble

4096 chips 20 ms (two radio f rames)



32/84

Acquisition Indicator Channel (AICH)

Frame structure of AICHtwo frames, 20 ms consists of a repeated

sequence of 15 consecutive AS, each of length 20 symbols(5120 chips).

-

part of duration 1024chips with no transmission.

Acquisition-Indicator AI have 16 kinds of Signature.

CPICH is the phase reference of AICH.

AI part Unused part

a1 a2a0 a31 a32a30 a33 a38 a39

AS #14 AS #0 AS #1 AS #i AS #14 AS #0

20 ms



33/84

Uplink Dedicated Physical Channel (DPDCH&DPCCH)

DPDCH and DPCCH are I/Q code multiplexed within each radio frame

carr es a a genera e a ayer an g er ayer

DPCCH carries control information generated at Layer 1

Each frame is 10ms and consists of 15 time slots, each time slot

consists of 2560 chips

The spreading factor of DPDCH and DPCCH can be different in the

same La er 1 connection

Each DPCCH time slot consists of Pilot, TFCI, FBI, TPC



34/84

Frame Structure of Uplink DPDCH/DPCCH

DataNdatabitsDPDCH

PilotNpilotbits

TPCNTPCbits

DPCCHFBI

NFBIbitsTFCI

NTFCIbits

Tslot = 2560 chips, 10 *2k bits (k=0..6)


1 radio frame: T = 10 msf



35/84

Downlink Dedicated Physical Channel (DPDCH+DPCCH)

DCH consists of dedicated data and control information.

Control information includesPilotTPCTFCI(optional).

The spreading factor of DCH can be from 512 to 4,and can be

changed during connection

.



36/84

Frame Structure of Downlink DPCH

DPDCHDPDCH DPCCH DPCCH

Tslot = 2560 chips, 10*2kbits (k=0..7)

a a

Ndata2bitsNTFCIbits

o

Npilotbitsa a

Ndata1bits NTPCbits


One radio frame, Tf = 10 ms



37/84

Physical Layer Data Bit Rates (R99)



38/84

High-Speed Physical Downlink Shared Channel (HS-PDSCH)

Bear service data and layer2 overhead bits mapped from the transport

channel

SF=16, several channels can be configured to enhance data service

Data

N Data 1bits

T slot = 2560 chips, M*10*2kbits (k=4)

Slot #0 Slot#1 Slot #2

1 subframe: Tf = 2 ms



39/84

High-Speed Shared Control Channel (HS-SCCH)

Carries physical layer signalling to a single UE ,such as modulation

scheme (1 bit) ,channelization code set (7 bit), transport Block size

(6bit),HARQ process number (3bit), redundancy version (3bit), new

data indicator (1bit), Ue identity (16bit)

HS-SCCH is a fixed rate (60 kbps, SF=128) downlink physical channel

-

T slot= 2560 chips, 40 bits

Data

N Data 1bits

o o o

1 subframe: T f = 2 ms



40/84

High-Speed Dedicated Physical Control Channel (HS-DPCCH )

HS-DPCCH carries information to acknowledge downlink transportblocks and feedback information to the system for scheduling and link

CQI and ACK/NACK

ys ca anne , p n , = , w power con ro

2 T s l o t = 5 1 2 0 c h i p sT s l o t = 2 5 6 0 c h i p s

H A R Q - A C K C Q I

O n e H S - D P C C H s u b f r a m e 2 m s

S u b f ra m e # 0 S u b f ra m e # i S u b f r a m e # 4

O n e r a d i o f ra m e T f = 1 0 m s



41/84


Chapter 3 Power PlanningChapter 3 Power Planning


Scrambling Code Planning Introduction


42/84

Scrambling Code Planning Introduction

3GPP TS25.213 specifies that there are 512 downlink primary scrambling codes. Eachprimary scrambling code has 15 associated secondary scrambling codes. There are also

.

Each cell within the radio network plan must be assigned a primary scrambling code. There

is no need for planners to assign secondary scrambling codes nor the compressed modescrambling codes.

If we plan the Scrambling Codes efficiently, then the cell search and syncronization

rocess time will be reduced.

Scrambling code planning may require co-ordination at international borders.

Scrambling code planning can be completed independently for each RF carrier.

Scrambling code planning can be completed using either an automatic function in radio

network planning tool (Genex U-Net) or a home-made tool e.g. mapbasic. It can also be

.

Genex U-Net is able to plan scrambling codes according to a specific strategy and exclude

specific scrambling codes for future expansion.


Scrambling Code Planning Concept


43/84

Scrambling Code Planning Concept The most im ortant rule for scramblin code lannin is that the isolation between cells which are

assigned the same scrambling code should be sufficiently great to ensure that a UE neversimultaneously receives the same scrambling code from more than a single cell.

DL scramblin code lannin can be o timized so that cell reselections take less time. For initial cell

selection, if the UE does not contain any stored information about the cell, then it will need to scan the

whole 64 groups. In this scenario, SC planning does not affect the UEs performance

The scramblin code lannin strate should account for future network ex ansion. Future network

expansion could mean the inclusion of additional Node B, increased sectorization of existing Node B,

or the evolution of Node B Type. Some Scrambling codes should be reserved for this purpose to

minimize the impact on the original plan.

Additional rules for scrambling code planning are required at locations close to international borders

where there may be another 3G operator using the same RF carrier

Scrambling code planning can be completed independently for different RF carriers. If a radio network

includes Node B which are configured with two or three RF carriers then it is recommended that the

same scrambling code plan is assigned to each carrier. This reduces system complexity and helps to

reduce the work associated with planning and optimizing the network

Scrambling code planning should be completed in conjunction with neighbor list planning. Scrambling

code audits should be completed in combination with neighbor list audits. Checks should be made to

ensure that no cells are neighbored to two or more cells which have neighbor lists including the same


scrambling code for different target cells.

Scrambling Code Mapping


44/84

g pp g

Code

Group 1=PSC Group

k=PSC Set

Primary

Scrambling

Code are seen

for Planning

engineer

ea r mary

Scrambling Code

are implemented

in

RNC(i=08176)=




45/84


scram ng co e .

Primary Scrambling Code N = 16 * i , where i = 0,1,,511

Secondary Scrambling Code N = 16*I + k , where i = 0,1,,511, k = 1,2,,15

The jthScrambling Codeth * * *,

scrambling code set, , ,, , , ,,

Scrambling Code Group

Group 0 ( j = 0 ) N = 0, 16, 32, 48, , 112 [ 8 codes]

Group 1 ( j = 1 ) N = 128, 144, 160, , 240 [ 8 codes]

Group 63 ( j = 63 ) N = 8064, 8080, 8096, , 8176 [ 8 codes]


Scrambling Code Planning Strategy


46/84

Scrambling Code Planning Strategy

The scrambling codes for the same site are allocated in the same scrambling code group

cells of other cells which belong to active set;

The scrambling codes of current cells neighbor cells cannot be reused by neighbor cellsof other cells which belong to active set;

The scrambling code planning can be done to minimize the number of code groups used

OR to make sure each code of the nei hborin cells are from a different. The 3GPP

specifications do not specify which approach is preferred, and it depends on the UEs

implementation. The difference has not been quantified in the field and in practice, is

neighbor sites)



47/84

Scrambling Code Planning Method


48/84

1. Manual Method

When number of site is not much, the manualmethod can be used e.g. on MapInfo or home-

made tools

Locate the sites on MapInfo

For each cell, roughly identify the

.

on local knowledge, after some drive tests,

we should be able to identify the neighbors

more accuratel .

Plan the SC in such a way that the primarycell and its neighbors are from the different

code rou . Remember to reserve some

codes for future expansion.

Have some minimum distance between two

cells if the SC is to be reused. E. . 5km inurban areas. No need to plan too tightly.

Repeat this process for the rest of the cell.


Scrambling Code Planning Method


49/84

g g

. enex -ne u oma c cram ng ann ng oo

An automatic scrambling code planning tool is available in U-Net. The

code allocation is based on each cell existing neighborhood.

The following constraints are applied when running the automatic

planning algorithm:

Domain constraint :this is re uired to distin uish different zones

Groups: it is possible to define scrambling code groups

Exceptional pairs: it is possible to define cell pairs that cannot

ave e same scram ng co e

Reuse distance : a minimum reuse distance is defined

Additional constraints such as Ec/No


Border Scrambling Code Planning


50/84

Border Scrambling Code Planning

The same scrambling code might be assigned at the border areas degrading

system performance.

To avoid this, there needs to be prior agreement between responsible

persons on the allowable scrambling codes used near the border.

Make sure there is enough re-use distance for the used codes on both sides

of the border.

ave a s o pre erre co es co e groups or or er scram ng co e

planning.



51/84

Exam le of Scramblin Code PlanninExam le of Scramblin Code Plannin


Example ICluster1 Cluster5


52/84

Cluster1

Sector/Group A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14 A15 A16

Cluster5

Sector/Group D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16

S2 1 9 17 25 33 41 49 57 65 73 81 89 97 105 113 121

S3 2 10 18 26 34 42 50 58 66 74 82 90 98 106 114 122S4 3 11 19 27 35 43 51 59 67 75 83 91 99 107 115 123

Cluster2

Sector/Group B1 B2 B3 B4 B5 B6 B7 B8 B9 B10 B11 B12 B13 B14 B15 B16

S1 128 136 144 152 160 168 176 184 192 200 208 216 224 232 240 248

S2 5 13 21 29 37 45 53 61 69 77 85 93 101 109 117 125

S3 6 14 22 30 38 46 54 62 70 78 86 94 102 110 118 126S4 7 15 23 31 39 47 55 63 71 79 87 95 103 111 119 127

Cluster6


S1 132 140 148 156 164 172 180 188 196 204 212 220 228 236 244 252

S2 129 137 145 153 161 169 177 185 193 201 209 217 225 233 241 249

S3 130 138 146 154 162 170 178 186 194 202 210 218 226 234 242 250

S4 131 139 147 155 163 171 179 187 195 203 211 219 227 235 243 251

Cluster3

Sector/Group C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 C16

S1 256 264 272 280 288 296 304 312 320 328 336 344 352 360 368 376

S2 133 141 149 157 165 173 181 189 197 205 213 221 229 237 245 253

S3 134 142 150 158 166 174 182 190 198 206 214 222 230 238 246 254

S4 135 143 151 159 167 175 183 191 199 207 215 223 231 239 247 255

Cluster7


S1 260 268 276 284 292 300 308 316 324 332 340 348 356 364 372 380

S2 257 265 273 281 289 297 305 313 321 329 337 345 353 361 369 377

S3 258 266 274 282 290 298 306 314 322 330 338 346 354 362 370 378

S4 259 267 275 283 291 299 307 315 323 331 339 347 355 363 371 379

Cluster4


S1 384 392 400 408 416 424 432 440 448 456 464 472 480 488 496 504

S2 261 269 277 285 293 301 309 317 325 333 341 349 357 365 373 381

S3 262 270 278 286 294 302 310 318 326 334 342 350 358 366 374 382

S4 263 271 279 287 295 303 311 319 327 335 343 351 359 367 375 383

Cluster8 (IBC)


S1 388 396 404 412 420 428 436 444 452 460 468 476 484 492 500 508

S2 385 393 401 409 417 425 433 441 449 457 465 473 481 489 497 505

S3 386 394 402 410 418 426 434 442 450 458 466 474 482 490 498 506

S4 387 395 403 411 419 427 435 443 451 459 467 475 483 491 499 507

S2 389 397 405 413 421 429 437 445 453 461 469 477 485 493 501 509

S3 390 398 406 414 422 430 438 446 454 462 470 478 486 494 502 510

S4 391 399 407 415 423 431 439 447 455 463 471 479 487 495 503 511

According to the location of

s es, v e s es or ess n o

a group, and then allocate a

scrambling code group Cluster

according to that the reuse

distance for each cluster is the


.

Example II


53/84

Codes divided into (3GPP) 64 Codes Groups

code sets

Proposed SC planning

Considering future expansion,a num er o co e groups sreserved. (not all 64 codegroups will be used)

264 codes will be used in thisphase planning (code group 0-

32) Remaining 248 codes (code

rou 33-63 are reserved forfuture expansion purpose

Scrambling Code Utilization is51.6%


Example II


54/84

this phase is

264 codesi.e. 8 codes (from code set 0-7) in

each 33 code groups (code group

0-32)


Example II- Code allocation


55/84

Considering Cell search procedure, the

scrambling code allocation requires: sector : S.C G0-1

1. No duplicated DL scrambling code

2. No same code group among the

neighboring cells.

sector : S.C G2-1a

sector : S.C G1-1

--

WhereWhere j = Scrambling code groupj = Scrambling code group

((00,,11,,22,,,,6363))

==set (set (00,,,,77))


Example II11Site in 1 SC-Set


56/84

11Site in 1 SC-Set88Site in 1 Reuse (264codes)

MethodThe network is divided into clusters ac pr mary se u s up a c us er o

different SC group

33 cells (11 of 3-sector sites) with different codegroup u same co e se , scram ng co e

could be assigned and built-up a sub area

8 sub areas code set = 0-7 are built u

a cluster of 33 x 8 = 264 cells (88 sites)

Hence

Different Scrambling code and different

scrambling code group within a BS and its

neighboring cells could be achieved

SC-Set 2

- et

SC-Set 1

SC-Set 6

- et

SC-Set 5


Numerical value is SC Code Group No#. SC-Set 3 SC-Set 7

Example II Future Expansion


57/84

Scrambling code planning for the future

new sites can be done with minimum

changes of existing network by

Allocating the reserved code for the new

sites

Scrambling Code set used for new site is

set same as the sub area to which it

belongs.cluster

Code group to be selected for the new site

should be considered with other new sites

.

Thus, different code group among neighbor

cells still achieve.


Example III


58/84

Example III

64 Code Groups are divided into 3 sets.

support

-

Set B: 18 groups for future expansion sites which can support

18 x 8codes = 144 codes = 144 cells = 48 sites for 1-time reuse

Set C: 9 groups for In-building, Micro and tested cells which can

support

9 x 8codes = 72 codes = 72 cells = 24 sites for 1-time reuse

1 .. 36 37 .. 54 55 .. 63

SC Group

Set A Set B Set C


Example III Outdoor sites SC Plan With Future Expansion


59/84

p p

Planning Strategies:

1. Reuse patterns allocation based on the defined clusters.

2. One reuse pattern can support 12 sites (36 groups) which means

2 reuse patterns in average are allocated for one particular cluster.

(Because each cluster has around 20 sites in average, 2 reuse patterns

together will have a margin of 4 sites for further added sites or cells.)

3. Deploy 8 reuse patterns.

4. Avoid allocatin 2 same code rou s too close and a se aration of 2

patterns is a safe margin.

5. Grou in 8 sites instead of 10 sites for 1 reuse attern in the dense urban area(further expansion concern for this phase)




60/84

0 1 2 3 4 5 6 7

Rsv CG-0 0 1 2 3 4 5 6 7

CG-1 8 9 10 11 12 13 14 15 a

CG-2 16 17 18 19 20 21 22 23 b

CG-3 24 25 26 27 28 29 30 31 c

CG-4 32 33 34 35 36 37 38 39 a

. .

Cell

-

CG-6 48 49 50 51 52 53 54 55 c

CG-7 56 57 58 59 60 61 62 63 a

CG-8 64 65 66 67 68 69 70 71 b

CG-9 72 73 74 75 76 77 78 79 c

CG-10 80 81 82 83 84 85 86 87 a

CG-11 88 89 90 91 92 93 94 95 b

36 Code Groups

with 8 reuse patterns,

i.e. 1 reuse pattern

-

CG-13 104 105 106 107 108 109 110 111 a

CG-14 112 113 114 115 116 117 118 119 b

CG-15 120 121 122 123 124 125 126 127 c

CG-16 128 129 130 131 132 133 134 135 a

CG-17 136 137 138 139 140 141 142 143 b

CG-18 144 145 146 147 148 149 150 151 co

Sites

can support:

36 / 3 = 12 sites

- a

CG-20 160 161 162 163 164 165 166 167 b

CG-21 168 169 170 171 172 173 174 175 c

CG-22 176 177 178 179 180 181 182 183 aCG-23 184 185 186 187 188 189 190 191 b

CG-24 192 193 194 195 196 197 198 199 c

CG-25 200 201 202 203 204 205 206 207 a

Macr

-

CG-27 216 217 218 219 220 221 222 223 c

CG-28 224 225 226 227 228 229 230 231 a

CG-29 232 233 234 235 236 237 238 239 b

CG-30 240 241 242 243 244 245 246 247 c

CG-31 248 249 250 251 252 253 254 255 a

CG-32 256 257 258 259 260 261 262 263 b

- cCG-34 272 273 274 275 276 277 278 279 a

CG-35 280 281 282 283 284 285 286 287 b

CG-36 288 289 290 291 292 293 294 295 c


8 Reuse Patterns



61/84

For the convenience of mapping

network, 8 different colors are

.

R1

R3R4

R6

R7

R8




62/84

Pattern Color Times of

Usage

R2 5

R3 6

R4 5

R5 5R6 5

R7 5

R8 6

SC pattern for this

phase is 5.375 asshown in the

.

Besides, each

patterns times of

usage is almost the

.refers to every pattern

has been fully utilized.




63/84

Following 2 graphs are the comparison of SC plan in the red circled dense urban areas

(Cluster KL12 & KL13) based on the reuse pattern of 10 sites and 8 sites respectively.

Original SC Plan Revised SC Plan




64/84

.

patterns located in between.



65/84


Chapter 3 Power PlanningChapter 3 Power Planning


WCDMA Power Planning (Downlink)


66/84

In a WCDMA system, the capacity on downlink is limited by Node B power which is the common

shared resource between the different services and users

In order to ensure s stem stabilit we do not allow the mean transmittin ower of the Node B to

be more than 80% of the maximum transmitting power

Part of power used for the control channel transmission reduces the overall network capacity for

.

The coverage of control channels must be large compared to the traffic channels in order for the

mobile station to decode other base stations before entering the soft/softer handover zone

The broadcast channel including the cell information has to be decoded before the mobile enters

the coverage area of the cell, as a consequence it is necessary to plan how the power in thedownlink is distributed between the common channels


WCDMA Power Planning (Downlink)

20 W t t l


67/84

20 W total

R99+HSDPA HSDPA OnlyR99

HS-DSCH

HS-DSCHDCHs16 W 15 W

DCHs9W

2 W CCHsCCHs+DCHs

(associated)2 W CCHs 3 W

2 W CPICH CPICHCPICH2 W 2 W


Downlink Common Channel Powers


68/84

The downlink common channels include the CPICH,P-SCH,S-SCH,P-CCPCH,S-CCPCH,PICH

and AICH. There may be more than one S-CCPCH

The P-CCPCH enca sulates the BCH whereas the S-CCPCH enca sulates the PCH the user

plane FACH and the control plane FACH.Other downlink common channels only exists at the

physical layer

.

be sufficient for the common channels to be received reliably across the entire cell.

The common channels consume a significant quantity of downlink transmit power (typically 20-

o e o a own n ransm power capa y

The activity of the common channels must be taken into account when computing their averagepower

The timing of the common channels must be taken into account when computing their peak

power

-

The transmit power assigned to the PICH has the potential to be tuned according to the number

of paging indicators per radio frame but this has relatively little impact upon the total common


c anne power

Downlink Common Channel Powers


69/84

10% Cell Power Max


Downlink Common Channel Power During network planning stage, Uplink service,

-


70/84

should be generated and agreed on a per

project basis.

Power allocation of CPICH de ends on the

result of Link Budget which typically about 10%

of the total downlink transmit power capability.

Common channel power calculations should becompleted and presented to the operator on a

per project basis. Power allocation of other

Downlink Common Channels depends on the

receiver and channel bit rate. The simulation

and field test result indicate the suitable power

allocation for each common channels which

relative to P-CPICH power

Increases to the default common channel

powers can be accepted as long as the

upon the total downlink transmit power.

Decreases to the default common channel

owers should be avoided unless there is


sufficient justification from field trials

Downlink Common Channels


71/84

Downlink commonchannels

Relative to CPICH Activity Average Power allocationwith 20W max Power

.

P-SCH -5 dB 10% 0.06 W

S-SCH -5 dB 10% 0.06 W

P-CCPCH -2 dB 90% 1.1 W

PICH -7 dB 100% 0.4 W

AICH -6 dB 100% 0.5 WAlmost 50%

S-CCPCH 1 dB 10% 0.25 W

Total Common 4.4 W

is for CPICH

Remaining power for

traffic channels20-4.4 = 15.6 W


Worst case; Depends on the FACH bit rate; Depends on PCH and FACH traffic

Downlink Dedicated Channel Powers (R99-Bearer)


72/84


Downlink Dedicated Channel Powers (R-99 Bearer)


73/84


HSDPA Power Resource Allocation The total Transmit HSDPA DL power resource per cell is divided into three parts


74/84

o HSDPA physical channel power (HS-PDSCH and HS-SCCH).

o DPCH power (associated

power a oca on sc emes:

o Static Allocation

o Dynamic Allocation

In order to achieve high HSDPA performance, is dynamically allocated between DPCH and HSDPA physical

channel. HS-PDSCH transmit power is usually bigger than the DPCH channel to keep a proper transmit power.

Total Power

The Node B detects the R99 power load

available power for HSDPA. In this way,

the cell load is more stable.

Flexible scheme

Power for CCH

Time


HSDPA Static Power Allocation

Maximum transmission power for HS-PDSCH and HS-SCCH is configured in RNC


75/84

o Transmission power shall not exceed that configured in RNC

o Can be reconfigured in RNC by OM

Associated DPCH channel will use all of the cell power except for power reserved for HSDPA

and common channel. Different DPCH channel power is allocated by inner and outer power

control


HSDPA Dynamic Power Allocation

HS-PDSCH/HS-SCCH share the cell power with R99 channels


76/84

o R99 channel has higher priority

o Remainin ower can be allocated to HS-PDSCH and HS-SCCH

o Cell power is fully utilized

Dynamic power allocation is realized in Node B

To avoid the DPCH channels power rise, we should keep the power margin while

allocating HSDPA power (the recommended value is 10%)


Power Resource available for HSDPA

With dynamical power allocation, Node B estimates the power available


77/84

t dy a ca po e a ocat o , ode est ates t e po e a a ab e

for the entire HSDPA channel per 2ms TTI as:

P(hsdpa) = P(total) - P(margin) - P(non-hsdpa)

with

o a : max mum own n ransm ss on power or e ce a s con gure n

The P(non-hsdpa) : total transmitted carrier power of all codes not used for HS-PDSCH and HS-SCCH.

P(margin) : configurable value which is used for the case of power increase caused by R99 power

control in each 2ms TTI


Power Resource available for HSDPA


78/84

P(total) : 20W / 40W / 60W depending on power license

-

CPICH + Common Channel + CS Data + R99 Data

For CPICH 10% of the total power and for common channels about 15% is being allocated

P(margin) :

Is by default set to 0 (parameter HSPAPOWER) no extra power is being reserved for R99 Power

control

BOTTOM LINE :

P(CS) + P(R99) + P(hsdpa) = P(total) 10% (CPICH) 15% (Common Channels)

HSDPA Services


HSDPA Ph sical Channels HS-PDSCH / HS-SCCH


79/84

For each HS-PDSCH, SF=16

For each HS-SCCH, SF=128

Each cell is assi ned u to 4 HS-

SCCH (limited by UE capability)

For each HS-DPCCH, SF=256

Each H has one HS-DPCCH.


Associated Channel - DPCH


80/84

There is another dedicated physical channel named DPCH (R99) for eachHSDPA user. It is used for signaling transport and power control.

DPCH is reference channel for other channels (HS-SCCH and HS-DPCCH) in

power control.

N o d e B

H S -P D S C H H S -S C C H D P C H H S -D P C C H

U E

Required DL

Resources

for HSDPA


Channel

HSDPA DL Channel Power Control


81/84

PHSDPA(HSDPA total transmit power) PHS-PDSCH + PHS-SCCH

The HSDPA resource distribution mode (static or dynamic) determines the total

transmission power of the DL HSDPA channel.

HS-SCCH Power: Allocated depending on CQI

CQI

Power HS-SCCH

Max[dBm]

Power HS-SCCH

Min[dBm]

Power HS-SCCH

Max[W]

Power HS-SCCH

Max[W]

1 to 8 33 23 2 0.2

9 to 11 30 23 1 0.2

12 to 14 28 23 0.63 0.2

15 to 24 25 23 0.32 0.2

. .


HSDPA DL Channel Power Control


82/84

PHSDPA(HSDPA total transmit power) PHS-PDSCH + PHS-SCCH

HS-PDSCH Power:

The transmit power is adjusted by Node B according to the following factors:

CQI

Amount of Data to be transmitted

-

Available Code for HS-PDSCH


HSDPA Power Distribution to Single Users


83/84

The NodeB distributes the available DL HSDPA power to the HS-SCCH andthe HS-PDSCH based on the scheduling algorithm.

The scheduling algori thm ranks the HSDPA UEs in the cell based

on their priorities, channel quality, waiting t ime, data flow and so

on.

e sc e u ng a gor m s r u es power o e - o e

queue with the highest priority, Then the scheduling algorithm distributespower for the HS-PDSCH based on the data flow of the queue.

If there is any power left, the scheduling algorithm repeats step 2) for the

queue with the second highest priority, until the total power of the DL

HSDPA is used up



84/84

www.huawei.com

80691953-wcdma-power-and-scrambling-code-planning.pdf

Documents