WCDMA Power and Scrambling Code Planning

Internal

WCDMA Power and Scrambling Code Planning www.huawei.com

HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

Chapter 1 Physical Layer Overview

Chapter 3 Scrambling Code Planning

HUAWEI TECHNOLOGIES CO CO., LT LTD.

All ri rights reserved

Page 1

Radio Interface Protocol Structure GC

Nt

DC

Duplication avoidance GC

Nt

DC

-

control

RRC l

l

r t n o c

r t n o c

UuS boundary

-

l l o o r r t t n n o o c c

L3 Radio Bearers PDCP

PDCP

L2/PDCP BMC

RLC

RLC

RLC RLC

RLC

L2/BMC

RLC Logical Channels L2/MAC

MAC

Transport Channels



Page 2

WCDMA Radio Interface has three kinds of channels z

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

.

z

Logical channel: Carrying user services directly. According to the types of the carried services, it is divided into two types: Control .

z

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 information for a user or common information for all users, it is divided into dedicated channel and common channel.

z

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 code an scram e an carr er p ase or can e regar e as a dedicated channel.



Page 3

Radio Interface Channel Organisation



Logical Channel Dedicated tr traffic ch channel

(DTCH)

Common traffic channel

(CTCH)

Broadcast co control ch channel

(BCCH)

Paging control channel

(PCCH)

Dedicate control channel

(DCCH)

Common control channel

(CCCH)



ra c c anne

Control channel

Page 5

Transport Channel Dedicated Channel

(DCH)

-DCH is an uplink or downlink channel

Dedicated transport channel

roa cas c anne Forward access channel

(FACH) (FACH)

Random ac access ch channel

(RACH)

channel

High-speed downlink shared channel (HS-DSCH)



Page 6

z

A physical channel is defined by a specific carrier frequency, code (scrambling code, spreading code) and relative phase.

z

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

z

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

z

Two types of physical channel: UL and DL Physical Channel

Frequency, Code, Phase



Page 7

wn in z

i

Downlink Dedicated Physical Channel > (Downlink

z

nn

own n

ommon

> Common >S

DPCH) ys ca

anne

Control Physical Channel (CCPCH)

nchronization Channel

> Paging

Indicator Channel

> Acquisition > Common

(PICH)

Indicator Channel

Pilot Channel

Downlink

SCH (AICH) (CPICH)

> High-Speed

Packet Downlink Shared Channel (HS-PDSCH)

> High-Speed

Shared Control Channel (HS-SCCH)



Page 8

U link Ph sical Channel z

Uplink Dedicated Physical Channel > Uplink

Dedicated Physical Data Channel (Uplink DPDCH)

> Uplink

Dedicated Physical Control Channel (Uplink DPCCH)

> High-Speed

Dedicated Physical Channel (HS-DPCCH)

z

Uplink Physical anne

Uplink Common Physical Channel > Physical

Random Access Channel (PRACH)



Page 9

Channel Mapping DL og ca Channels

Channels

Channels

P-SCH CPICH -

PCCH

PCH

S-CCPCH PICH

CCCH FACH

AICH

CTCH DCCH DTCH HUAWEI TECHNOLOGIES CO CO., LT LTD.

HS-PDSCH DSCH DCH All ri rights reserved

DPDCH DPCCH

Channel Mapping UL Logical Channels

Transport Channels

Physical Channels

CCCH

RACH

PRACH

DCCH

CPCH

PCPCH

DCH

DPDCH I branch DPCCH Q branch



Function of physical channel Synchronization& Synchronization& Cell broadcast channels to all UE in a cell P-CPICH-Primary Common Pilot Channel S-CPICH-Secondary Common Pilot Channel SCH- Synchronisation Channel (Including P-SCH and S-SCH Channel)

Paging channels S-CCPCH-Secondary Common Control Physical Channel PICH-Paging Indicator Channel

Random access channels PRACH-Physical Random Access Channel AICH-Acquisition Indicator Channel

Dedicated channels DPDCH-Dedicated Physical Data Channel DPCCH-Dedicated Physical Control Channel

High speed downlink share channels HS-SCCH-High Speed Share Control Channel HS-PDSCH-High Speed Physical Downlink Share Channel HS-DPCCH-High Speed Dedicated Physical Control Channel



Page 12

UE Acquisition and Synchronization Initial Cell Synchronization

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

P-SCH

Slot Synchronization Determined

, start time offset

Frame Synchronization and Scrambling Code Group Determined

-

UE determines Scrambling Code by correlating all possible codes in group

CPICH

Scrambling Code Determined

UE Monitors and decodes BCH data ,

P-CCPCH

-

UE adjust transmit timing to match timing of BS

Cell Synchronization complete This ro This roced cedur uree is a lie lied d wh when eneve everr a UE ne need edss to ac acce cess ss a ce cell ll or me meas asur uree th thee ua ualit lit of a ce cell ll i.e i.e.. du durin rin ce cell ll selection, cell re-selection and soft handover



Physical Channel(DL) Cha nnel(DL) Transmission Transmission Timing



Page 14

Primary Synchronization Channel (P-SCH) z z z z

se or ce searc an sync ron zat on Two sub channels: P-SCH and S-SCH. SCH is transmitted at the first 10% of v y . PSC is transmitted repeatedly in each time slot.

Slot #0

Primary SCH Secondary SCH

ac p i,0

ac s

z z

SSC specifies the scrambling code groups of the cell. SSC is chosen from a set of 16 , are altogether 64 primary scrambling code groups.

Slot #1

Slot #14

ac p

ac p

ac s

i,14

i,1

acs

256 chips 2560 chips One 10 ms SCH radio frame



Page 15

Cell Synchronisation Cell synchronisation is achieved with the Synchronisation Channel (SCH). (SCH). This channel divides up 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



Cell Synchronisation 2. Secondar S nchronisation Channel S-SCH FRA FRAME ME SYNCH SYNCH and and Scra Scrambl mblin in Cod Code e Grou Grou 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 tot al of 64 different sequences of 15 SSCs, corresponding to the 64 primary scrambling code groups. Scrambling Code Group

slot number #0

#1 #1

#2 #2

#3 #3

#4 #4

#5 #5

#6 #6

#7 #7

#8 #8

#9 #9

Group 0

1

1

2

8

9

10

15

8

10

16

2

7

15

7

16

Group 1

1

1

5

16 16

7

3

14

16

3

10

5

12

14

12

10

Group 2

1

2

1

15 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

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

9

The beginning of a 10 ms frame can be determined (frame synchronization) based on sequence of SSC

9

64 different SSC

#10 #11 #12 #13 #14

…

10ms are identified 9

The unique combination of SSCs Scrambling Code Group

Slot # ? Slot #? -

p

S-SCH

16

p

6

Slot #? p

11

256 chips

……..

Group 2 Slot 7, 8, 9

2560 chips



Scrambling Code z

Scrambling code: Gold sequence.

z

Scrambling code period: 10ms (38400 chips).

z

The code used for scrambling of the uplink DPCCH/DPDCH may be of either lon or short t

e, There are 224 lon and 224 short u link

scrambling codes. Uplink scrambling codes are assigned by higher layers. z

For downlink downlink physi physical cal channels channels,, a total of 218-1 = 262,143 scrambling codes can be generated. Only scrambl scrambling ing codes codes 0, 1, …, 8191 are being being used.

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



Page 18

Scrambling Code (SC) scrambling code 0 Set 0

Scrambling Codes for downlink

scrambling code 1 ……

Set 1 …

…

scram

ng co e

scrambling code scrambling code 511 511 16 ……

512 sets

8192 Scrambling Codes

scrambling code 511 511 16 15

Each set includ includes es a prima primary ry scrambling scrambling code code and 15 secondar scramblin codes. HUAWEI TE TECHNOLOGIES CO CO., LTD.


Page 19

Primary Scrambling Code Group PSC 0

Primary Scrambling downlink

Grou 0

PSC 1

Group 1

……

…

roup

… …

PSC 7

PSC 63*8 PSC 63*8+1 ……

PSC 63*8 512 512 Prim Primar ary y Scrambling Codes

64 Primary Primary Scramblin Scrambling g Code Groups



7

Each group consists of 8 Primary Scrambling Codes

Page 20

Common Pilot Channel (CPICH) z

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

z

Carries pre-defined sequence.

z

Fixed rate 30Kbps ， SF=256

z

Primary CPICH (P-CPICH) >

Uses the fixed channel channel code -- Cch, 256, 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 channels

>

Used as measurement reference in the FDD mode (and partially in the TDD mode). Pre-defined symbol sequence T

Slot #0

= 2560 chi s , 20 bits

Slot Slot # i

Slot #1

Slot #14

1 radio frame: Tr = 10 ms



Page 21

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

256 Chips

Synchronisation Synchronisat ion Channel (SCH) CP

-

Cell scrambling code? I get it with trial & error!

P-CPICH

symbol-by-symbol symbol-by -symbol correlation applied speading code = ‘

c ,

,

A spreading code is the product of the cell‘s primary scrambling code and the channelisation code. The t he cell‘s channelisation code is fixed: Cch,256,0,UE uses the spread received signal (P-CPICH) to determine the .



P-CPICH as measurements reference UE has to perform perform a set of L1 measurements, measurements, some of them refer to the CPICH channel: channel: • CPICH RSCP Rece ceiv ived ed Si nal nal Code Code Pow Power er. The UE measures RSCP stands for Re measures the the RSCP on the Primar Primar -CPICH. -CPICH. The The reference point for the measurement is the antenna ant enna 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 th e 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 t he received wide band power, which includes thermal noise and receiver generated noise. The reference point for the measurements is the .

• CPICH Ec/No The CPICH Ec/No is used to determine deter mine 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.



P-CPICH as Measurement Reference CPICH Ec/No

Received energy per chip divided by the power density in the band (dBm)

CPICH RSCP

Received Signal Code Power (dBm)

UTRA carrier RSSI

Total Received wide w ide band power, including thermal noise and noise generated in the receiver CPICH Ec/No =

CPICH RSCP UTRA carrier RSSI

CPICH Ec/No

CPICH RSCP

UTRA carrier RSSI

0: -24 - . 2: -23 3: -22.5 ... 47: -0.5 48: 0

0: -115 2: -113 : 88: -27 89: -26

0: -110 2: -108 : 71: -39 72: -38 73: -37



Primary Common Control Physical Channel (P-CCPCH) , , CCPCH. By reading the cell system information on the P-CCPCH, P-CCPCH, the UE learns everything about the configuration of the remaining common physical channels in the cell. z

Fixed rate, fixed OVSF code（30kbps，Cch256,1）

z

Broadcast over the entire cell

z

Carry BCH transport channel

z

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

z

Only data part 256 chips PCCPCH Data

SCH

18 bits T

Slot #0

Slot #1

= 2560 chips,20 bits

Slot #i 1 radio frame: T


Slot #14

f

= 10 ms


Page 25

Primary Common Control Physical Channel (P-CCPCH) 10 ms Frame 2560 Chips

256 Chips

CP P-CCPCH

9

Channelisation code: Cch,256,1 no , no p ot se sequ quen ence ce 9 27 kbps (due to off period) 9 organised in MIBs and SIBs


na y, ge e cell system information


P-CCPCH

Secondary Common Control Physical Channel (S-CCPCH) z

Carry FACH and PCH.

z

Two kinds of S-CCPCH: with or without TFCI UTRAN decides if a TFCI should , .

z an can e mu p exe o e same or separate SCCPCHs. If multiplexed to the same S-CCPCH, they can be mapped m apped to the same fame.

e rs mus ave a sprea ng factor of 256, while the spreading factor of the remaining S-CCPCHs can range between 256 (30 Kbps or 15 Ksps) and 4 (1920 Kbps) z

Possible rates are the same as that of downlink DPCH t here is data to z S-CCPCH is on air ONLY when there z

We use SF = 64

Data

TFCI N TFCI bits

Pilot N Pilot bits

N Data bits T slot = 2560 chips,

Slot #0

120 Kbps (60 Ksps)

Slot #1

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

Slot #i

Slot #14

1 radio frame: T f = 10 ms



Page 27

Paging Indicator Channel (PICH) z

PICH is a fixed-rate (30kbps,SF=256) physical channel channel used to carry the Paging Indicators (PI). are used to carry paging indicators and the remaining 12 bits are not defined.

z

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 undefined b0 b1

b 287 b 288

One radio frame (10 ms)



Page 28

b 299

S-CCPCH and its associated PICH S-CCPCH frame, associated with PICH frame

-

PICH

= 7680 PICH frame

for paging indication no transmission

b0

b1

b286

# of paging indicators per frame (Np) Paging group

#bit too less ,may be cannot detect if have fading

Subscribers with Pq indicator paged =>

s

16q,

…,

16q+

=

, ,…,

b287

b288

b299

Subscribers with Pq indicator not paged => q, …,

q+

=

, ,…,

32 (8 bits)

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

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

72 (4 bits)

{b4q, …, b4q+3} = {1,1,…,1}

{b4q, …, b4q+3} = {0,0,…,0}

144 (2 bits)

{b2q, b2q+1} = {1,1}

{b2q, b2q+1} = {0,0}



Physical Random Access Channel (PRACH) z

The random-access transmission data consists of two parts: >

One or several preambles ：each preamble is of length 4096chips and consists of 256 repetitions repetitions of a signature whose length length is 16 chips ，16 available s gnatures to tota y

>

10 or 20ms message part

>

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

Preamble

Preamble

ream e

4096 chips

Preamble

essage part

10 ms (one radio frame)

Preamble

Preamble

4096 chips


Message part 20 ms (two radio frames)


Page 30

Acquisition Indicator Channel (AICH) z

Frame structure of AICH：two 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.

z

Acquisition-Indicator Acquisition-Indicator AI have 16 kinds of Signature.

z

CPICH is the phase reference of AICH. AI part a0 a1 a2

AS #14

AS #0

AS #1

Unused part a30 a31 a32 a33

a38 a39

AS #i

AS #14

20 ms



Page 31

AS # 0

Uplink Dedicated Physical Channel (DPDCH&DPCCH) z z

DPDCH and DPCCH are I/Q code multiplexed within each radio frame carr es a a genera e a

ayer

an

g er ayer

z

DPCCH carries control information generated at Layer 1

z

ac rame s ms an cons sts o consists of 2560 chips

z

The spreading factor of DPDCH and DPCCH can be different in the same same L La a er 1 conn connec ecti tion on

z

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


t me s ots, eac t me s ot


Page 32

Frame Structure of Uplink DPDCH/DPCCH

Data N databits

DPDCH

Pilot Npilot bits

DPCCH

TFCI NTFCI bits

FBI NFBI bits

TPC NTPC bits

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

Slot #0

Slot #1

Slot #i

Slot #14

1 radio frame: Tf = 10 ms



Page 33

Downlink Dedicated Physical Channel (DPDCH+DPCCH) z

DCH consists of dedicated data and control information.

z

Control information includes：Pilot、TPC、TFCI(optional).

z

The spreading factor of DCH can be from 512 to 4,and can be changed during connection .



Page 34

Frame Structure of Downlink DPCH

DPCCH

DPDCH aa Ndata1 bits

NTPC bits

DPDCH NTFCI bits

aa Ndata2 bits

DPCCH o Npilot bits

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

Slot #0

Slot #1

Slot #i

Slot #14

One radio frame, Tf = 10 ms



Page 35

Physical Layer Data Bit Rates (R99)



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

Bear service data and layer2 overhead bits mapped from the transport channel

z

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

Data N Data 1 bits k

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

Slot #0

Slot#1

Slot #2

1 subframe: Tf = 2 ms



Page 37

High-Speed Shared Control Channel (HS-SCCH) z

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)

z

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

Data N Data 1bits T slot = 2560 2560 chips, chips, 40 bits

o

o

o

1 subframe: T f = 2 ms



Page 38

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

HS-DPCCH carries information to acknowledge downlink transport blocks and feedback information to the system for scheduling and link > CQI

and ACK/NACK

ys ca ca

z

T

slot

anne ,

p n ,

= 2 5 6 0 c h ip s

=

,w 2×T

power con ro slot

H A R Q -A C K

= 5 1 2 0 c h ip s CQI

O n e H S -D P C C H su b fra m e

S u b f ra m e # 0

2 ms

S u b f ra m e # i O n e r a d i o f ra m e T


f

S u b fra m e # 4

= 10 ms


Page 39


Chapter 3 Power Planning



Page 40

Scrambling Code Planning Introduction z

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

z

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 mode scrambling codes.

z

If we plan the Scrambling Codes efficiently, then the cell search and syncronization rocess time will be reduced.

z

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

z

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

z

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 .

z

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 z

The most im orta ortant nt rul rule e for scr scrambl amblin in code lan lannin nin is that the iso isolat lation ion betw between een cel cells ls whi which ch are assigned the same scrambling code should be sufficiently great to ensure that a UE never simultaneously receives the same scrambling code from more than a single cell.

z

DL scrambl scramblin in code code lannin lannin can be o timized timized so tha thatt cell cell reselec reselectio tions ns take less less time. time. For initia initiall cell 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 UE’s performance

z

The The scra scramb mbli lin n code code lann lannin in stra strate te

shou should ld acco accoun untt for for futu future re netw networ ork k ex ansi ansion on.. Futu Future re netw networ ork k

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 to minimize the impact on the original plan. z

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

z

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 t hree 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

z

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 Code Group 1

Primary Scrambling Code are seen for Planning engineer = …


=PSC Group k=PSC Set

ea r mary Scrambling Code are implemented in RNC(i=0…8176)


Page 43

Scrambling Code Mapping 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 jth Scrambling Code , th 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]


Page 44

, ,…,

Scrambling Code Planning Strategy z

The scrambling codes for the same site are allocated in the same scrambling code group ’ cells of other cells which belong to active set;

z

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

z

The scrambling code planning can be done to minimize the number of code groups used OR to make make sure sure each each code code of the the nei nei hbori hborin n cells cells are from from a d diff iffere erent nt.. The 3GPP specifications do not specify which approach is preferred, and it depends on the UE’s implementation. implementation. The difference has not been quantified in the field and in practice, is neighbor sites)



Scrambling Code Planning Method 1. Ra Rand ndom om Code Code Pl Plan anni nin ng – Randomly allocate the codes from any code groups to the cells. A planner must be aware of the distance (coverage) between 2 cells using the same SC while utilizing this method. 2. Reus Reuse e Cod Code e Gro Group up Pl Plan anni ning ng – – Divide 64 code groups into several sets based on the scale of a network (Hierarchical Cell Structure) and purpose of future expansion plan.

Reuse Code Group Planning is Planning is proposed by Huawei



Scrambling Code Planning Method 1. Manual Method z

When number of site is not much, the manual method can be used e.g. on MapInfo or homemade 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 mo re ac accu cura rate tell .

>

Plan the SC in such a way that the primary cell and it’s neighbors are from the different code cod e rou . Rem Rememb ember er to res reserv erve e som some e codes for future expansion.

>

Have some minimum distance between two cells ifif the SC cells SC is to be reus reused. ed. E. E. . 5km in in urban areas. No need to plan too tightly.

>

Repeat this process for the rest of the cell.



Scrambling Code Planning Method . z

enex

-net

utomat c cram

ng

ann 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 constr tra aint :th thiis is re uire red d to distin uish diffe ferrent zones

>

Groups: it is possible to define scrambling code groups

>

Exceptional pairs: itit 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 z

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

z

To avoid this, there needs to be prior agreement between responsible persons on the allowable scrambling codes used near the border.

z

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

z

ave a s o pre erre co es co e groups o orr or er scram planning.



ng co e

Exam le of Scramblin Code Plannin



Example I

Cluster1 S ec ector/Group S2 S3 S4 Cluster2 S ec ector/Group S1 S2 S3 S4 Cluster3 S ec ec to tor/ Gr Group S1 S2 S3 S4 Cluster4 S ec ec to tor/ Gr Group S1 S2 S3 S4

A1

A2

A3

A4

A5

A6

A7

A8

Cluster5 A9 A10 A11 A12 A13 A14 A15 A16 S ec ect or or/ Gr Group

1 2 3

9 10 11

17 17 18 18 19 19

25 25 26 26 27 27

33 33 34 35

41 41 42 43

49 49 50 51

57 57 58 58 59 59

65 65 66 66 67 67

73 73 74 74 75 75

81 81 82 83

89 89 90 91

B1 128 129 130 131

B2 13 136 13 137 13 138 13 139

B3 14 144 14 145 14 146 14 147

B4 15 152 15 153 15 154 15 155

B5 16 160 16 161 16 162 16 163

B6 16 168 16 169 17 170 17 171

B7 17 176 17 177 17 178 17 179

B8 18 184 18 185 18 186 18 187

B9 19 192 19 193 19 194 19 195

B10 20 200 20 201 20 202 20 203

B11 20 208 20 209 21 210 21 211

B 12 21 216 21 217 21 218 21 219

C1 256 257 258 259

C2 26 264 26 265 26 266 26 267

C3 27 272 27 273 27 274 27 275

C4 28 280 28 281 28 282 28 283

C5 28 288 28 289 29 290 29 291

C6 29 296 29 297 29 298 29 299

C7 30 304 30 305 30 306 30 307

C8 31 312 31 313 31 314 31 315

C9 32 320 32 321 32 322 32 323

C10 32 328 32 329 33 330 33 331

C11 33 336 33 337 33 338 33 339

C12 34 344 34 345 34 346 34 347

D1 384 385 386 387

D2 39 392 39 393 39 394 39 395

D3 40 400 40 401 40 402 40 403

D4 40 408 40 409 41 410 41 411

D5 41 416 41 417 41 418 41 419

D6 42 424 42 425 42 426 42 427

D7 43 432 43 433 43 434 43 435

D8 44 440 44 441 44 442 44 443

D9 44 448 44 449 45 450 45 451

D10 45 456 45 457 45 458 45 459

D11 46 464 46 465 46 466 46 467

D12 47 472 47 473 47 474 47 475

97 9 7 105 113 121 S2 98 106 114 122 S3 99 107 115 123 S4 Cluster6 B13 B14 B15 B16 S ec ect or or/ Gr Group 22 224 23 232 24 240 24 248 S1 22 225 23 233 24 241 24 249 S2 22 226 23 234 24 242 25 250 S3 22 227 23 235 24 243 25 251 S4 Cluster7 C13 C14 C15 C16 S ec ect or or/ Gr Group 35 352 36 360 36 368 37 376 S1 35 353 36 361 36 369 37 377 S2 35 354 36 362 37 370 37 378 S3 35 355 36 363 37 371 37 379 S4 Cluster8 (IBC) D13 D14 D15 D16 S ec ect or or/ Gr Group 48 480 48 488 49 496 50 504 S1 48 481 48 489 49 497 50 505 S2 48 482 49 490 49 498 50 506 S3 48 483 49 491 49 499 50 507 S4

D1

D2

D3

D4

D5

D6

D7

D8

D9 D10 D1 D11 D12 D1 D13 D1 D14 D15 D1 D16

5 6 7

13 14 15

21 22 23

29 30 31

37 38 39

45 46 47

53 54 55

61 62 63

69 70 71

77 78 79

85 86 87

93 101 109 117 125 94 102 110 118 126 95 103 111 119 127

D1 132 133 134 135

D2 14 140 14 141 14 142 14 143

D3 14 148 14 149 15 150 15 151

D4 15 156 15 157 15 158 15 159

D5 16 164 16 165 16 166 16 167

D6 17 172 17 173 17 174 17 175

D7 18 180 18 181 18 182 18 183

D8 18 188 18 189 19 190 19 191

D9 19 196 19 197 19 198 19 199

D10 20 204 20 205 20 206 20 207

D1 D11 21 212 21 213 21 214 21 215

D12 22 220 22 221 22 222 22 223

D1 D13 22 228 22 229 23 230 23 231

D1 D14 23 236 23 237 23 238 23 239

D15 24 244 24 245 24 246 24 247

D1 D16 25 252 25 253 25 254 25 255

D1 260 261 262 263

D2 26 268 26 269 27 270 27 271

D3 27 276 27 277 27 278 27 279

D4 28 284 28 285 28 286 28 287

D5 29 292 29 293 29 294 29 295

D6 30 300 30 301 30 302 30 303

D7 30 308 30 309 31 310 31 311

D8 31 316 31 317 31 318 31 319

D9 32 324 32 325 32 326 32 327

D10 33 332 33 333 33 334 33 335

D1 D11 34 340 34 341 34 342 34 343

D12 34 348 34 349 35 350 35 351

D1 D13 35 356 35 357 35 358 35 359

D1 D14 36 364 36 365 36 366 36 367

D15 37 372 37 373 37 374 37 375

D1 D16 38 380 38 381 38 382 38 383

D1 388 389 390 391

D2 39 396 39 397 39 398 39 399

D3 40 404 40 405 40 406 40 407

D4 41 412 41 413 41 414 41 415

D5 42 420 42 421 42 422 42 423

D6 42 428 42 429 43 430 43 431

D7 43 436 43 437 43 438 43 439

D8 44 444 44 445 44 446 44 447

D9 45 452 45 453 45 454 45 455

D10 46 460 46 461 46 462 46 463

D1 D11 46 468 46 469 47 470 47 471

D12 47 476 47 477 47 478 47 479

D1 D13 48 484 48 485 48 486 48 487

D1 D14 49 492 49 493 49 494 49 495

D15 50 500 50 501 50 502 50 503

D1 D16 50 508 50 509 51 510 51 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 . HUAWEI TECHNOLOGIES CO CO., LT LTD.


Page 51

Example II Codes divided into (3GPP) > 64 Codes Groups

z



code sets Proposed SC planning > Considering future expansion, a num er o co e groups s reserved. (not all 64 code groups will be used) > 264 codes will be used in this phase planning (code group 032) > Remaining 248 codes (code rou rou 33 33-6 -63 3 are rese reserv rved ed for for future expansion purpose > Scrambling Code Utilization is 51.6%

Page 52

Example II

this phase is

264 codes i.e. 8 codes (from code set 0-7) in each 33 code groups (code group 0-32)



Page 53

Exampl Exa mple e II- Cod Code e allocat allocation ion Considering Cell search procedure, the scrambling code allocation requires:

1.

No duplic licated DL sc scrambling code

2.

No same code group among the neighboring cells.

α sector : S.C G0-1

a

β sector : S.C G2-1

γ sector : S.C G1-1

-

Where j = Scrambling code group (0, (0 0,1 ,1 1,,2 ,2 2,…, ,…,63 ,…,63)) set ((0 0,…,7 0,…, ,…,7) 7)



Example II 11Site in 1 SC-Set

88Site in 1 Reuse (264codes)

Method ¾The

network is divided into clusters

• ac pr mary se different SC group

u

s up a c us er o

•33 cells (11 of 3-sector sites) with different code group u sa same co e se , sc s cram ng co e could be assigned and built-up a sub area ¾8

sub area areas s code set = 0-7 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

Numerical value is SC Code Group No#.


SC-Set 0

SC-Set 4

SC-Set 1

SC-Set 5

SC-Set 2

SC-Set 6

SC-Set 3

SC-Set 7


Page 55

Example II –Future –Future Expansion 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.

¾

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.

cluster



Page 56

Example III z

64 Code Groups are divided into 3 sets. support -

z

sites which can support Set B: 18 groups for future expansion sites which 18 x 8codes = 144 codes = 144 cells = 48 sites for 1-time reuse

z

cells which can Set C: 9 groups for In-building, Micro and tested cells which support 9 x 8codes = 72 codes = 72 cells = 24 sites for 1-time reuse 1

..

36

Set A


37

SC Group ..

54

Set B


55

.. Set C

63

Example III Outdoor sites SC Plan With Future Expansion z

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 to ethe etherr will will hav have e a mar mar in of of 4 site sites s for for furt furthe herr adde added d site sites s or cel cells ls..

3.

Deploy 8 reuse patterns.

4.

Avoi Avoid d allo alloca cati tin n 2 same same code code rou rou s too too clos close e an and d a se arat aratio ion n 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)



Example III Outdoor sites SC Plan With Future Expansion . . 0

1

2

3

4

5

6

7

CG-0

0

1

2

3

4

5

6

7

CG-1 CG-2 CG-3

8 16 24

9 17 25

10 18 26

11 19 27

12 20 28

13 21 29

14 22 30

15 23 31

a b c

CG-4 CG-6

32

33

34

35

36

37

38

39

a

48

49

50

51

52

53

54

55

c

CG-7 CG-8 CG-9

56 64 72

57 65 73

58 66 74

59 67 75

60 68 76

61 69 77

62 70 78

63 71 79

a b c

CG-10 CG-11 -

80 80 88 88

81 89

82 90

83 91

84 92

85 93

86 94

87 95

a b

CG-13 CG-14 CG-15

104 112 120

105 113 121

106 114 122

107 115 123

108 116 124

109 117 125

110 118 126

111 119 127

a b c

s e t i S

CG-16 CG-17 CG-18

128 136 144

129 137 145

130 138 146

131 139 147

132 140 148

133 141 149

134 142 150

135 143 151

a b c

r c a M

CG-20 CG-21

160 168

161 169

162 170

163 171

164 172

165 173

166 174

167 175

a b c

CG-22 CG-23 CG-24

176 184 192

177 185 193

178 186 194

179 187 195

180 188 196

181 189 197

182 190 198

183 191 199

a b c

CG-25 CG-27

200

201

202

203

204

205

206

207

a

216

217

218

219

220

221

222

223

c

CG-28 CG-29 CG-30

224 232 240

225 233 241

226 234 242

227 235 243

228 236 244

229 237 245

230 238 246

231 239 247

a b c

CG-31 CG-32 -

248 256

249 257

250 258

251 259

252 260

253 261

254 262

255 263

a b c

CG-34 CG-35 CG-36

272 280 288

273 281 289

274 282 290

275 283 291

276 284 292

277 285 293

278 286 294

279 287 295

a b c

Rsv Rsv

36 Code Groups with 8 reuse patterns, i.e. “1” reuse pattern can support: 36 / 3 = 12 sites

8 Reuse Patterns HUAWEI TECHNOLOGIES CO CO., LT LTD.


Cell

Example III Outdoor sites SC Plan With Future Expansion For the convenience of mapping

network, 8 different colors are . R1 R3 R4 R6 R7 R8



Example III Outdoor sites SC Plan With Future Expansion

Pattern Pattern

R2 R3 R4 R5 R6 R7 R8

Color olor

Times of Usage 5 6 5 5 5 5 6

SC pattern for this phase is 5.375 as shown in the . Besides, each pattern’s times of usage is almost the . refers to every pattern has been fully utilized.



Example III Outdoor sites SC Plan With Future Expansion 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.

Revised SC Plan

Original SC Plan



Example III Outdoor sites SC Plan With Future Expansion . ’ patterns located in between.




Chapter 3 Power Planning



Page 64

WCDMA Power Planning (Downlink) z

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

z

In order to ensure s stem stabilit we do not allow the mean transmittin be more than 80% of the maximum transmitting power

z

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

z

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

z

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 the downlink is distributed between the common channels



ower of the Node B to

WCDMA Power Planning (Downlink) 20 W total R99

R99+HSDPA

HSDPA Only

HS-DSCH

16 W

15 W HS-DSCH

DCHs

9W

DCHs

2W

CCHs

2W

CCHs

2W

CPICH

2W

CPICH



3W 2W

CCHs+DCHs (associated)

CPICH

Downlink Common Channel Powers z

The downlink common channels include the CPICH,P-SCH,S-SCH,P-CCPCH,S-CCPCH CPICH,P-SCH,S-SCH,P-CCPCH,S-CCPCH,PICH ,PICH and AICH. There may be more than one S-CCPCH

z

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 downlink common channels only exists at the physical layer . be sufficient for the common channels to be received reliably across the entire cell.

z

The common channels consume a significant quantity of downlink transmit power (typically 20o t e tota own n transm t power capa ty

z

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

z

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

z

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 HUAWEI TECHNOLOGIES CO CO., LT LTD.


Downlink Common Channel Powers

10% Cell Power Max



Downlink Common Channel Power 9

During network planning stage, Uplink service, should be generated and agreed on a per project basis.

9

Power allocation of CPICH de ends on the result of Link Budget which typically about 10% of the total downlink transmit power capability.

9

Common channel power calculations should be completed 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

9

Increases to the default common channel powers can be accepted as long as the upon the total downlink transmit power.

9

Decreases to the default common channel owe ow ers sh shou ould ld be av avo oid ided ed un unle less ss th ther ere e is sufficient justification from field trials



Downlink Common Channels Downlink common channels

Rela Re lati tive ve to CP CPIC ICH H Ac Acti tivi vity ty

Ave vera rage ge Powe Powerr allo alloca cati tion on with 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 W

S-CCPCH

1 dB² dB²

10%³ 10%³

0.25 W

Almost Almo st 50 50% % is for CPICH

Total Common

4.4 W

Remaining power for traffic channels

20-4.4 = 15.6 W

¹ Worst Worst case; ² Depends on the FACH FACH bit rate; ³ Depends on PCH and FACH traffic HUAWEI TECHNOLOGIES CO CO., LT LTD.


Downlink Downlin k Dedicated Channel Powers (R99-Bearer)



Downlink Dedicated Channel Powers (R-99 Bearer)



HSDPA Power Resource Allocation •

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

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.

Power for CCH Flexible scheme


Time


HSDPA Static Power Allocation •

Maximum transmission power for HS-PDSCH and HS-SCCH is configured in RNC 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 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 channel’s power rise, we should keep the power margin while allocating HSDPA power (the recommended value is 10%)



Power Resource available for HSDPA z

With dynamical power allocation, Node B estimates the power available for the entire HSDPA channel per 2ms TTI as:

P(hsdp P(h sdpa) a) = P(tota P(total) l) - P( P(mar margin gin)) - P( P(non non-hs -hsdpa dpa))

with … tota : max mum own n transm ss on power or t e ce t at s con gure

n

The P(non-hsdpa) : total transmitted carrier power of all codes not used for HS-PDSCH and HSSCCH. P(margin) : configurable value which is used for the case of power increase caused by R99 power control in each 2ms TTI



P w rR

ur

v il bl f r HSDPA

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

CPICH + Common Channel + CS Data + R99 Data For CPICH 10% of the total t otal 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(R99) + P(hsdpa) P(hsdpa) = P(total) P(total) – 10% (CPICH) (CPICH) – 15% (Common (Common Channels) Channels)

HSDPA Services



HSDPA HSD PA Ph sic sical al Ch Chann annels els HSHS-PDS PDSCH CH / HSHS-SCC SCCH H

For each HS-PDSCH, SF=16

For each HS-SCCH, SF=128 Each cell is assi ned u to 4 HSSCCH (limited (limited by UE UE capability) capability)

For each HS-DPCCH, SF=256 Each H has one HS-DPCCH.



Associ Ass ociate ated d Chann Channel el - DP DPCH CH There is another dedicated physical channel named DPCH (R99) for each

¾

HSDPA 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. Node B

H S -P D S C H

H S -S C C H

D PCH

UE

Required DL Resources for HSDPA Channel HUAWEI TECHNOLOGIES CO CO., LT LTD.


H S -D P C C H

HSDPA DL Channel Power Control

PHSDPA HSDPA((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. z

HS-SCCH Power: Allocated depending on CQI

CQI 1 to 8 9 to 11 12 to 14 15 to 24

Power HS-SCCH Power HS-SCCH Power HS-SCCH Power HS-SCCH Max[dBm] Min[dBm] Max[W] Max[W] 33 23 2 0 .2 30 23 1 0 .2 28 23 0 .6 3 0 .2 25 23 0 .3 2 0 .2 . .



HSDPA DL Channel Power Control

PHSDPA HSDPA((HSDPA total transmit power)

＝

PHS-PDSCH + PHS-SCCH

HS-PDSCH Power: z

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 HSDP A Power Distribution to Single Users > The

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

¾ The

scheduling algorithm ranks the HSDPA UEs in the cell based on their priorities, channel quality, waiting time, data flow and so on. e sc e u ng a gor m s r u es es power o e o e queue with the highest priority, Then the scheduling algorithm distributes power 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



www.huawei.com

WCDMA Power and Scrambling Code Planning

Recommend Documents