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 OverviewChapter 1 Physical Layer Overview

Chapter 2 Power PlanningChapter 2 Power PlanningChapter 2 Power PlanningChapter 2 Power Planning

Chapter 3 Scrambling Code PlanningChapter 3 Scrambling Code Planning

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

Radio Interface Protocol StructureDCNtGC

C-plane signaling U plane information

DCNtGC

Duplication avoidance

UuS boundary

L3

olol

C plane signaling U-plane information

controlRRCco

ntro

l

cont

ro

cont

ro

cont

rol

PDCPPDCP L2/PDCP

Radio Bearers

RLC L2/RLCRLC

BMC L2/BMC

Logical Channels

RLC L2/RLCRLCRLCRLC

RLCRLC

RLCRLC

Transport Channels

PHY

L2/MAC

L1

MAC


PHY L1

WCDMA Radio Interface has three kinds of channels

In terms of protocol layer, the WCDMA radio interface has three channels: Physical channel transport channel and logical channelchannels: Physical channel, transport channel and logical channel.

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

Transport channel: It is the interface of radio interface layer 2 and physical layer, and is the service provided for MAC layer by the h i l l A di t h th th i f ti t t d iphysical layer. According to whether the information transported is

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 code

d bl ) d i h (I Q) b d dand scramble) and carrier phase (I or Q) can be regarded as a dedicated channel.


Radio Interface Channel Organisation


Logical Channel

T ffi h lDedicated traffic channel (DTCH)

Traffic channelCommon traffic channel (CTCH)

Broadcast control channel (BCCH)

Paging control channel (PCCH)

Control channelDedicate control channel (DCCH)

Common control channel (CCCH)


Transport Channel

Dedicated Channel (DCH)

-DCH is an uplink or downlink channelDedicated transport

channel

B d t h l (BCH)Broadcast channel (BCH)

Forward access channel (FACH)

Paging channel (PCH) Common transportPaging channel (PCH)

Random access channel (RACH)

High-speed downlink shared channel

Common transport channel

(HS-DSCH)


Physical ChannelPhysical Channel

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 spreading d ) di ti i h th h lcode) can distinguish the channels.

Most channels consist of radio frames and time slots, and each radio frame consists of 15 time slotsframe consists of 15 time slots.

Two types of physical channel: UL and DL

Physical Channel

Frequency, Code, Phaseq y


Downlink Physical ChannelDownlink Physical Channel

Downlink Dedicated Physical Channel

(Downlink DPCH)

D li k C Ph i l Ch lDownlink Common Physical ChannelCommon Control Physical Channel (CCPCH)Synchronization Channel (SCH) Downlink

Physical Channely ( )Paging Indicator Channel (PICH)Acquisition Indicator Channel (AICH)

Physical Channel

Common Pilot Channel (CPICH)High-Speed Packet Downlink Shared Channel (HS-PDSCH)High-Speed Shared Control Channel

(HS-SCCH)


Uplink Physical Channelp y

Uplink Dedicated Physical ChannelUplink Dedicated Physical Data Channel (Uplink DPDCH)Uplink Dedicated Physical Control p yChannel (Uplink DPCCH)High-Speed Dedicated Physical Channel (HS-DPCCH) Uplink Physical

Ch lChannel

Uplink Common Physical Channel

Physical Random Access Channel (PRACH)


Channel Mapping DLL i l Transport PhysicalLogical

ChannelsTransportChannels

PhysicalChannels

S-SCHP-SCH

BCHBCCH P CCPCH

CPICHS-SCH

PCH

BCH

PCCH

BCCH P-CCPCH

S-CCPCH

FACHCCCH AICH

PICH

CTCH

DCCH HS-PDSCH

DCH

DSCH

DTCHDPDCHDPCCH


Channel Mapping UL

LogicalChannels

TransportChannels

PhysicalChannels

RACHCCCH PRACH

DCCH CPCH PCPCH

DTCH DCH DPDCHDTCHDPCCH

I branchQ branch


Function of physical channel

P CCPCH Primary Common Control Physical Channel

P-CPICH-Primary Common Pilot Channel S-CPICH-Secondary Common Pilot Channel

Synchronization& Cell broadcast channels to all UE in a cell

P-CCPCH-Primary Common Control Physical ChannelSCH- Synchronisation Channel (Including P-SCH and S-SCH Channel)

Paging channelsS-CCPCH-Secondary Common Control Physical Channel

Node B UE

PICH-Paging Indicator Channel

PRACH-Physical Random Access Channel

Random access channels

Node B UE

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


UE Acquisition and Synchronization

Initial Cell Synchronization

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

UE Monitor Secondary SCH Code, detect Scrambling Code Group and frame

Slot Synchronization Determined

P-SCH

S SCHUE Monitor Secondary SCH Code, detect Scrambling Code Group and frame start time offset

UE determines Scrambling Code by correlating all possible codes in group

Frame Synchronization and Scrambling Code

Group Determined

S-SCH

CPICH

UE Monitors and decodes BCH data

Scrambling Code Determined

BCH data Super frame synchronization determined

P-CCPCH

UE adjust transmit timing to match timing of BS

BCH data, Super-frame synchronization determined

Cell Synchronization complete

This procedure is applied whenever a UE needs to access a cell or measure the quality of a cell, i.e. during cell


p pp q y , gselection, cell re-selection and soft handover

Physical Channel(DL) Transmission Timing


Primary Synchronization Channel (P-SCH)U d f ll h d h i tiUsed for cell search and synchronizationTwo sub channels: P-SCH and S-SCH. SCH is transmitted at the first 10% of (256 chips) of e er time slot

SSC specifies the scrambling code groups of the cell.SSC is chosen from a set of 16 different codes of length 256 there(256 chips) of every time slot.

PSC is transmitted repeatedly in each time slot.

different codes of length 256, there are altogether 64 primary scrambling code groups.

Slot #0 Slot #1 Slot #14

Primary SCH

pac pac pac

Secondary SCH acs

i,0 acsi,1 acs

i,14

256 chips2560 chips

One 10 ms SCH radio frame


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

1 Primary Synchronisation Channel (P-SCH)1. Primary Synchronisation Channel (P-SCH) (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 done with a single matched filter matched to the primary synchronization code which is common for all cellsdone with a single matched filter matched to the primary synchronization code which is common for all cells. The slot timing of the cell can be obtained by decoding peaks in the matched filter output


2. Secondary Synchronisation Channel (S-SCH) (FRAME SYNCH and Scrambling Code Group

Cell Synchronisationy y ( ) ( g p

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.p g p y g g p

slot number Scrambling Code 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 (frame synchronization)

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 combinations within

… 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 Group 63 9 12 10 15 13 14 9 14 15 11 11 13 12 16 10

combinations within 10ms are identified

The unique combination of SSCs identify thep

acSlot # ?

P SCH acSlot #?

acSlot #?

identify the Scrambling Code Group

……..acpP-SCH acp

16 6S-SCH

acp

11 Group 2Slot 7, 8, 9256 chips


2560 chips

Scrambling CodeScrambling 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 g yp g p

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.


Scrambling Code (SC)

Set 0

scrambling code 0

scrambling code 1

Scrambling Codes for

Set 1 ……

bli d 15

…

downlink …

Set 511

scrambling code 15

scrambling code 511×16

……

scrambling code511×16

Set 511 511×16

……

scrambling code511×16＋15

8192 Scrambling Codes

512 sets

Each set includes a primary scrambling code and15 secondary scrambling codes.


15 secondary scrambling codes.

Primary Scrambling Code Group

Group 0

PSC 0

PSC 1

Primary Scrambling Codes for

Group 0

……Group 1

PSC 1

Codes for downlink …

PSC 63*8

……

G 63

PSC 7

PSC 63*8+1

……

Group 63

……

PSC 63*8＋7

512 Primary Scrambling Codes

64 Primary Scrambling Code Groups

Each group consists of 8 Primary Scrambling Codes


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

Carries pre-defined sequence.

Fixed rate 30Kbps， SF=256

Primary CPICH (P-CPICH)U th fi d h l d C h 256 0Uses the fixed channel code -- Cch, 256, 0Scrambled by the primary scrambling codeOnly one CPICH per cellBroadcast over the entire cellUsed by UE to determine the Primary Scrambling Code Used as phase reference for most of the physical channelsUsed as measurement reference in the FDD mode (and partially in the TDD mode).

Pre-defined symbol sequence

Tslot = 2560 chips , 20 bits

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

slot p ,


1 radio frame: Tr = 10 ms

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

2560 Chips 256 Chips

Synchronisation Channel (SCH)

CP

P CPICHP-CPICH

P-CPICH

Cell scrambling code? I get it with trial &

error!

applied speading code =cell‘s primary scrambling code ⊗ C h 256 0

symbol-by-symbol correlation

cell s primary scrambling code ⊗ Cch,256,0

A spreading code is the product of the cell‘s primary 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 cell‘s primary scrambling code by trial and error (UE tries 8 SC Codes of the group identified)


primary scrambling code by trial and error (UE tries 8 SC Codes of the group identified).

P-CPICH as measurements referencef f f f C CUE has to perform a set of L1 measurements, some of them refer to the CPICH channel:

• CPICH RSCPRSCP stands for Received Signal Code Power. The UE measures the RSCP on the Primary-CPICH. The g yreference 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 antenna connector of the UEantenna connector of the UE.

• CPICH Ec/NoThe CPICH Ec/No is used to determine the „quality“ of the received signal. It gives the received energy per received chip divided by the band‘s power density The quality“ is the primary CPICH‘s signal strength inreceived chip divided by the band s power density. The „quality is the primary CPICH s signal strength in relation to the cell noise. (Please note, that transport channel quality is determined by BLER, BER, etc. )

• GSM carrier RSSI• GSM carrier RSSIThe wideband measurements are conducted on GSM BCCH carriers.


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 RSCPUTRA carrier RSSI

CPICH Ec/No

0: -241: -23 5

CPICH RSCP

0: -1151: -114

UTRA carrier RSSI

0: -1101: -1091: 23.5

2: -233: -22.5

...

1: 1142: -113

:88: -27

1: -1092: -108

:71: -39

47: -0.548: 0

Ec/No values in dB

89: -26

RSCP values in dBm

72: -3873: -37

RSSI values in dBm


Ec/No values in dB RSCP values in dBm RSSI values in dBm

Primary Common Control Physical Channel (P-CCPCH)The UE gain the cell system information (MIB SIB) which is transmitted on the physical channel P-

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

The UE gain the cell system information (MIB,SIB), which is transmitted on the physical channel PCCPCH. By reading the cell system information on the P-CCPCH, the UE learns everything about the configuration of the remaining common physical channels in the cell.

Broadcast over the entire cellCarry BCH transport channelThe PCCPCH is not transmitted during the first 256 chips of each time slot.Only data part

256 chips

PCCPCH Data18 bits

T slot = 2560 chips,20 bits

SCH

slot

Slot #0

1 radio frame: T f = 10 ms

Slot #1 Slot #i Slot #14


Primary Common Control Physical Channel (P-CCPCH)

2560 Chips 256 ChipsSynchronisation Channel (SCH)

10 ms Frame

CP

Synchronisation Channel (SCH)

P-CCPCH

Fi ll I t thChannelisation code: Cch,256,1

TPC il t

P-CCPCH

Finally, I get the cell system information

no TPC, no pilot sequence27 kbps (due to off period)

organised in MIBs and SIBs


Secondary Common Control Physical Channel (S-CCPCH)FACH d PCH b lti l d t thCarry FACH and PCH.

Two kinds of S-CCPCH: with or without TFCI UTRAN decides if a TFCI should be transmitted UE must support TFCI

FACH and PCH can be multiplexed to the same or separate SCCPCHs. If multiplexed to the same S-CCPCH, they can be mapped to the same fame.

The first S CCPCH m st ha e a spreadingbe transmitted, UE must support TFCI.Possible rates are the same as that of downlink DPCHS-CCPCH is on air ONLY when there is data to

transmit (FACH or Paging)

The first S-CCPCH must have a spreading 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)

transmit (FACH or Paging)We use SF = 64 120 Kbps (60 Ksps)

DataN bits

T slot = 2560 chips,

DataPilot

N bitsPilotN bitsTFCITFCI

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

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

1 radio frame: T f = 10 ms


Paging Indicator Channel (PICH)PICH is a fixed-rate (30kbps,SF=256) physical channel used to carry the Paging Indicators (PI).Frame structure of PICH: one frame of length 10ms consists of 300 bits of which 288 bitsFrame structure of PICH: one frame of length 10ms consists of 300 bits of which 288 bits 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. If a paging indicator in a certain frame is set to 1 it indicates that UEs associated withIf a paging indicator in a certain frame is set to 1, it indicates that UEs associated with this paging indicator should read the corresponding frame of the associated S-CCPCH.

288 bits for paging indication 12 bits (undefined)

b1b0

288 bits for paging indication 12 bits (undefined)

b287 b288 b299

One radio frame (10 ms)


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

τPICH

= 7680chips

S-CCPCH

PICH framechips

for paging indication

no transmission

b287 b288 b299b286b0 b1

# of pagingindicators per frame(Np) Paging group

Subscribers withPq indicator

paged =>

18 (16 bit )

Subscribers withPq indicatornot paged =>

{b b 15} {1 1 1} {b16 b16 15} {0 0 0}#bit too

18 (16 bits)

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}

{b16q, …,b16q+15} = {1,1,…,1} {b16q, …,b16q+15} = {0,0,…,0}less ,may be cannot detect if

have


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

Physical Random Access Channel (PRACH)The random-access transmission data consists of two parts:

One or several preambles：each preamble is of length 4096chips and consists of 256 repetitions of a signature whose length is 16 chips，16 available i llsignatures totally

10 or 20ms message partWhich signature is available and the length of message part are determined by hi h lhigher layer

M tP bl Message partPreamble

4096 chips10 ms (one radio frame)

Preamble Preamble

Message partPreamble Preamble Preamble

4096 chips 20 ms (two radio frames)


Acquisition Indicator Channel (AICH)Frame structure of AICH：two frames, 20 ms ，consists of a repeated sequence of 15 consecutive AS, each of length 20 symbols(5120 chips). Each time slot consists of two parts an Acquisition-Indicator(AI) and aEach time slot consists of two parts，an Acquisition-Indicator(AI) and a 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


Uplink Dedicated Physical Channel (DPDCH&DPCCH)

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

DPDCH i d t t d t L 2 d hi h lDPDCH carries data generated at Layer 2 and higher layer

DPCCH carries control information generated at Layer 1

E h f i 10 d i f 15 i l h i lEach frame is 10ms and consists of 15 time slots, each time slot consists of 2560 chips

The spreading factor of DPDCH is from 4 to 256The spreading factor of DPDCH is from 4 to 256

The spreading factor of DPDCH and DPCCH can be different in the same Layer 1 connectiony

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


Frame Structure of Uplink DPDCH/DPCCH

DataNdatabitsDPDCH

PilotNpilot bits

TPCNTPC bitsDPCCH

FBINFBI bits

TFCINTFCI bits

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


1 radio frame: T = 10 msf


Downlink Dedicated Physical Channel (DPDCH+DPCCH)

DCH consists of dedicated data and control information.

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

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

DPDCH and DPCCH is time multiplexedDPDCH and DPCCH is time multiplexed.


Frame Structure of Downlink DPCH

D t 2DPDCH

TFCI Pil tD t 1

DPDCH DPCCH DPCCH

TPC

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

Data2Ndata2 bits

TFCINTFCI bits

PilotNpilot bits

Data1Ndata1 bits

TPCNTPC bits


One radio frame, Tf = 10 ms


Physical Layer Data Bit Rates (R99)

Spreading factor (SF) = Chip Rate/Symbol Rate


Spreading factor (SF) = Chip Rate/Symbol Rate

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

Bear service data and layer2 overhead bits mapped from the transport channelc a e

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

DataN Data 1bits

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

Slot #0 Slot#1 Slot #2

1 subframe: Tf = 2 ms


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 used to carry downlink signalling related to HS DSCH transmissionused to carry downlink signalling related to HS-DSCH transmission

T slot= 2560 chips, 40 bits

DataN Data 1bits

Sl t #0 Sl t#1 Sl t #2Slot #0 Slot#1 Slot #2

1 subframe: Tf = 2 ms


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

HS-DPCCH carries information to acknowledge downlink transport blocks and feedback information to the system for scheduling and link adaptation of transport blockadaptation of transport block

CQI and ACK/NACK

Ph i l Ch l U li k SF 256 ith t lPhysical Channel, Uplink, SF=256, with power control

2 × T s lo t = 5 1 2 0 c h i p sT s lo 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 r a m e # 0 S u b f r a m e # i S u b f r a m e # 4

( )

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



Chapter 2 Scrambling Code PlanningChapter 2 Scrambling Code PlanningChapter 2 Scrambling Code PlanningChapter 2 Scrambling Code Planning

Chapter 3 Power PlanningChapter 3 Power Planning


Scrambling Code Planning Introduction

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 additional scrambling codes which may be used during compressed modeadditional scrambling codes which may be used during compressed mode.

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.

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

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 completed manually for small areascompleted manually for small areas.

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 ConceptThe most important rule for scrambling code planning is that the isolation between cells which are p g p gassigned 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.

DL scrambling code planning can be optimized so that cell reselections take less time. For initial cell g p g pselection, 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

The scrambling code planning strategy should account for future network expansion. Future network g p g gy pexpansion 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 g p g p p yincludes 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

R l P i

CodeGroup 1

j=PSC Groupk=PSC Set

Primary Scrambling Code are seen for Planning engineer (i 0 511)

Real Primary Scrambling Code are implemented in RNC(i=0…8176)

(i=0…511)


DL bli d (3GPP 25 213)

Scrambling Code MappingDL scrambling code (3GPP 25.213)

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 Group kth primary N = 16*8*j + 16*k where j = 0 1 63 k = 0 1 7Group , k primary scrambling code set

N = 16 8 j + 16 k, where j = 0,1,…,63, k = 0,1,…,7

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

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

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

The scrambling codes of current cell’s neighbor cells cannot be reused by neighbor cells of 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 neighboring cells are from a different. The 3GPP g gspecifications do not specify which approach is preferred, and it depends on the UE’s implementation. The difference has not been quantified in the field and in practice, is likely to be very small (Huawei recommended different scrambling code group forlikely to be very small (Huawei recommended different scrambling code group for neighbor sites)


Scrambling Code Planning Method

1. Random Code Planning – Randomly allocate the codes from any code groups to the cells. A planner must be aware of the distance g(coverage) between 2 cells using the same SC while utilizing this method.

2. Reuse Code Group Planning – Divide 64 code groups into several sets based on the scale of a network (Hierarchical Cell Structure)

f fand purpose of future expansion plan.

Reuse Code Group Planning is proposed by Huawei


Scrambling Code Planning Method1. Manual Method

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

Locate the sites on MapInfo

For each cell, roughly identify the neighboring cells This step relies heavilyneighboring cells. This step relies heavily on local knowledge, after some drive tests, we should be able to identify the neighbors more accurately.y

Plan the SC in such a way that the primary cell and it’s neighbors are from the different code group. Remember to reserve some g pcodes for future expansion.

Have some minimum distance between two cells if the SC is to be reused. E.g. 5km in gurban areas. No need to plan too tightly.

Repeat this process for the rest of the cell.


Scrambling Code Planning Method2 G U t ( A t ti S bli Pl i T l)2. Genex U-net ( Automatic Scrambling Planning Tool)

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 required to distinguish different zonesDomain constraint :this is required to distinguish different zones

Groups: it is possible to define scrambling code groups

Exceptional pairs: it is possible to define cell pairs that cannot have the same scrambling codehave the same scrambling code

Reuse distance : a minimum reuse distance is defined

Additional constraints such as Ec/No


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.

H li t f f d d / d f b d bli dHave a list of preferred codes/code groups for border scrambling code planning.


Example of Scrambling Code PlanningExample of Scrambling Code Planningp g gp g g


Example ICluster1Sector/Group A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14 A15 A16S1 0 8 16 24 32 40 48 56 64 72 80 88 96 104 112 120

Cluster5Sector/Group D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16S1 4 12 20 28 36 44 52 60 68 76 84 92 100 108 116 124S1 0 8 16 24 32 40 48 56 64 72 80 88 96 104 112 120

S2 1 9 17 25 33 41 49 57 65 73 81 89 97 105 113 121S3 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 123Cluster2Sector/Group B1 B2 B3 B4 B5 B6 B7 B8 B9 B10 B11 B12 B13 B14 B15 B16S1 128 136 144 152 160 168 176 184 192 200 208 216 224 232 240 248

S1 4 12 20 28 36 44 52 60 68 76 84 92 100 108 116 124S2 5 13 21 29 37 45 53 61 69 77 85 93 101 109 117 125S3 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 127Cluster6Sector/Group D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16S1 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 249S3 130 138 146 154 162 170 178 186 194 202 210 218 226 234 242 250S4 131 139 147 155 163 171 179 187 195 203 211 219 227 235 243 251Cluster3Sector/Group C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 C16S1 256 264 272 280 288 296 304 312 320 328 336 344 352 360 368 376

S1 132 140 148 156 164 172 180 188 196 204 212 220 228 236 244 252S2 133 141 149 157 165 173 181 189 197 205 213 221 229 237 245 253S3 134 142 150 158 166 174 182 190 198 206 214 222 230 238 246 254S4 135 143 151 159 167 175 183 191 199 207 215 223 231 239 247 255Cluster7Sector/Group D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16S1 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 377S3 258 266 274 282 290 298 306 314 322 330 338 346 354 362 370 378S4 259 267 275 283 291 299 307 315 323 331 339 347 355 363 371 379Cluster4Sector/Group D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16S1 384 392 400 408 416 424 432 440 448 456 464 472 480 488 496 504S2 385 393 401 409 417 425 433 441 449 457 465 473 481 489 497 505

S2 261 269 277 285 293 301 309 317 325 333 341 349 357 365 373 381S3 262 270 278 286 294 302 310 318 326 334 342 350 358 366 374 382S4 263 271 279 287 295 303 311 319 327 335 343 351 359 367 375 383Cluster8 (IBC)Sector/Group D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16S1 388 396 404 412 420 428 436 444 452 460 468 476 484 492 500 508S2 389 39 0 13 21 29 3 3 61 69 8 93 01 09S2 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 506S4 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 509S3 390 398 406 414 422 430 438 446 454 462 470 478 486 494 502 510S4 391 399 407 415 423 431 439 447 455 463 471 479 487 495 503 511

According to the location of it di id 12 it l i tsites, divide 12 sites or less into

a group, and then allocate a scrambling code group Cluster for each group of sitesfor each group of sites according to that the reuse distance for each cluster is the longest


longest.

Example II512 Primary DL Scrambling512 Primary DL Scrambling Codes divided into (3GPP)

64 Codes GroupsEach Code Group consists 8Each Code Group consists 8 code sets

Proposed SC planningConsidering future expansion,

b f d ia number of code groups is reserved. (not all 64 code groups will be used)264 codes will be used in this phase planning (code group 0-32)Remaining 248 codes (code group 33-63) are reserved for g p )future expansion purposeScrambling Code Utilization is 51.6%


Example II

Scrambling Code reuse inScrambling Code reuse in 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

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

SCSC GGjj kkSC SC GGjj--k k

Where Where j = Scrambling code group j = Scrambling code group ((00,,11,,22,…,,…,6363))

k =Primary scrambling codek =Primary scrambling codek =Primary scrambling code k =Primary scrambling code set (set (00,…,,…,77))


Example II11Site in 1 SC-Set

(33codes) 88Site in 1 Reuse (264codes) Scrambling Code Planning(33codes) Scrambling Code Planning Method

The network is divided into clustersE h i SC t b ild l t f•Each primary SC set builds up a cluster of

different SC group

•33 cells (11 of 3-sector sites) with different code b t d t bli dgroup but same code set, scrambling code

could be assigned and built-up a sub area

8 sub areas (code set = 0-7) are built up ( ) pa cluster of 33 x 8 = 264 cells (88 sites)

Hence

SC S 0 SC S 4

Different Scrambling code and different scrambling code group within a BS and its neighboring cells could be achieved

SC-Set 2

SC-Set 0

SC-Set 1

SC-Set 6

SC-Set 4

SC-Set 5


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

Example II –Future Expansion

Scrambling code planning for the future new sites can be done with minimum changes of existing network by g g y

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 and surrounding cellsand surrounding cells.

Thus, different code group among neighbor cells still achieve.


Example III

64 Code Groups are divided into 3 sets.

Set A: 36 groups reserved for Macro layer outdoor sites which canSet A: 36 groups reserved for Macro layer outdoor sites which can support

36 x 8codes = 288 codes = 288 cells = 96 sites for 1-time reuse36 x 8codes = 288 codes = 288 cells = 96 sites for 1-time reuse

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

18 936

SC Group

Set A Set B Set C


18 936

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

3. Deploy 8 reuse patterns.

4. Avoid allocating 2 same code groups too close and a separation of 2 g g p p

patterns is a safe margin.

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


S C Set

Example III Outdoor sites SC Plan With Future Expansion0 1 2 3 4 5 6 7

Rsv CG-0 0 1 2 3 4 5 6 7CG-1 8 9 10 11 12 13 14 15 aCG-2 16 17 18 19 20 21 22 23 bCG-3 24 25 26 27 28 29 30 31 cCG-4 32 33 34 35 36 37 38 39 aCG 5 40 41 42 43 44 45 46 47 b

S.C. SetCell

CG-5 40 41 42 43 44 45 46 47 bCG-6 48 49 50 51 52 53 54 55 cCG-7 56 57 58 59 60 61 62 63 aCG-8 64 65 66 67 68 69 70 71 bCG-9 72 73 74 75 76 77 78 79 c

CG-10 80 81 82 83 84 85 86 87 aCG-11 88 89 90 91 92 93 94 95 bCG 12 96 97 98 99 100 101 102 103 c

36 Code Groupswith 8 reuse patterns,i.e. “1” reuse pattern

CG-12 96 97 98 99 100 101 102 103 cCG-13 104 105 106 107 108 109 110 111 aCG-14 112 113 114 115 116 117 118 119 bCG-15 120 121 122 123 124 125 126 127 cCG-16 128 129 130 131 132 133 134 135 aCG-17 136 137 138 139 140 141 142 143 bCG-18 144 145 146 147 148 149 150 151 cCG 19 152 153 154 155 156 157 158 159o

Site

scan support:

36 / 3 = 12 sites

CG-19 152 153 154 155 156 157 158 159 aCG-20 160 161 162 163 164 165 166 167 bCG-21 168 169 170 171 172 173 174 175 cCG-22 176 177 178 179 180 181 182 183 aCG-23 184 185 186 187 188 189 190 191 bCG-24 192 193 194 195 196 197 198 199 cCG-25 200 201 202 203 204 205 206 207 aCG 26 208 209 210 211 212 213 214 215 b

Mac

ro

CG-26 208 209 210 211 212 213 214 215 bCG-27 216 217 218 219 220 221 222 223 cCG-28 224 225 226 227 228 229 230 231 aCG-29 232 233 234 235 236 237 238 239 bCG-30 240 241 242 243 244 245 246 247 cCG-31 248 249 250 251 252 253 254 255 aCG-32 256 257 258 259 260 261 262 263 bCG 33 264 265 266 267 268 269 270 271CG-33 264 265 266 267 268 269 270 271 cCG-34 272 273 274 275 276 277 278 279 aCG-35 280 281 282 283 284 285 286 287 bCG-36 288 289 290 291 292 293 294 295 c


8 Reuse Patterns

Example III Outdoor sites SC Plan With Future Expansion

For the convenience of mapping

the 8 reuse patterns onto thethe 8 reuse patterns onto the

network, 8 different colors are

assigned to each reuse patternassigned to each reuse pattern.

R1R2R2R3R4R5R5R6R7R8


Example III Outdoor sites SC Plan With Future Expansion

Pattern Color Times ofUsage

R1 6R1 6R2 5R3 6R4 5R5 5R6 5R7 5R8 6

The average reuseThe average reuse SC pattern for this phase is 5.375 as shown in the snapshot and tablesnapshot and table. Besides, each pattern’s times of usage is almost the same as 5 375 whichsame as 5.375 which refers to every pattern has been fully utilized.


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


This picture is the example of the reuse distance It’s obvious that the separation with 2 or 3

Example III Outdoor sites SC Plan With Future ExpansionThis picture is the example of the reuse distance. It s obvious that the separation with 2 or 3 patterns located in between.



Chapter 2 Scrambling Code PlanningChapter 2 Scrambling Code PlanningChapter 2 Scrambling Code PlanningChapter 2 Scrambling Code Planning

Chapter 3 Power PlanningChapter 3 Power Planning


WCDMA Power Planning (Downlink)

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 system stability, we do not allow the mean transmitting power of the Node B toIn order to ensure system stability, we do not allow the mean transmitting power 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 paying trafficpaying traffic.

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


WCDMA Power Planning (Downlink)

20 W totalR99+HSDPA HSDPA OnlyR99

7W HS-DSCH7W

HS-DSCHDCHs16 W 15 W

DCHs9W

2 W CCHs CCHs+DCHs(associated)2 W CCHs 3 W

2 W CPICH CPICHCPICH2 W 2 W


Downlink Common Channel Powers

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 encapsulates the BCH whereas the S-CCPCH encapsulates the PCH, the userThe P CCPCH encapsulates the BCH whereas the S CCPCH encapsulates the PCH, the user plane FACH and the control plane FACH.Other downlink common channels only exists at the physical layer

A fixed downlink transmit power is assigned to each common channel This transmit power mustA fixed downlink transmit power is assigned to each common channel. This transmit power must 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-25% f th t t l d li k t it bilit )25% of the total downlink transmit power capability)

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

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

The common channel powers define the upper limit for the CPICH Ec/No (typically -3 dB)The common channel powers define the upper limit for the CPICH Ec/No (typically -3 dB)

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 h l


channel power

Downlink Common Channel Powers

10% Cell Power Max


Downlink Common Channel PowerDuring network planning stage, Uplink service, downlink service and P CPICH link budgetsdownlink service and P-CPICH link budgets should be generated and agreed on a per project basis.

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

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 required demodulation Threshold (Eb/No) atrequired demodulation Threshold (Eb/No) at 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 operator is made aware of the implicationsoperator is made aware of the implications upon the total downlink transmit power.

Decreases to the default common channel powers should be avoided unless there is


powers should be avoided unless there is sufficient justification from field trials

The average power allocation is depends on the activity of the common channels

Downlink Common Channels The average power allocation is depends on the activity of the common channels

Downlink common channels

Relative to CPICH Activity Average Power allocation with 20W max Power

CPICH 0 dB 100% 2 0 WCPICH 0 dB 100% 2.0 W

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 channels Power

4.4 W

Almost 50% is for CPICH

channels PowerRemaining power for traffic channels

20-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)


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 Common channel powero Common channel power

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

o DPCH power (associated

HSPDA ll ti h• HSPDA power allocation schemes:

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.

Full usage of power

Power for HSDPA

Full usage of powerTotal Power

•The Node B detects the R99 power load for DPCH every 2ms TTI to determine the

Power for DPCH

Power for HSDPA for DPCH every 2ms TTI to determine the available power for HSDPA. In this way, the cell load is more stable.

Flexible scheme

Power for CCH

Power for DPCH

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 OMg y

• 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 Remaining power can be allocated to HS-PDSCH and HS-SCCHo Remaining power 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 HSDPAWith dynamical power allocation, Node B estimates the power available for the entire HSDPA channel per 2ms TTI as:

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

with …P(t t l) i d li k t i i f th ll th t i fi d i RNCP(total) : maximum downlink transmission power for the cell that is configured in RNC

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

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

The P(non-hsdpa) :

Power Resource available for HSDPA

The P(non-hsdpa) :

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 :

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

75% of Total Power can be allocated for CS / R99 and75% of Total Power can be allocated for CS / R99 and HSDPA Services


HSDPA Physical Channels (HS-PDSCH / HS-SCCH)y ( )

For each HS-PDSCH, SF=16

For each HS-SCCH, SF=128

Each cell is assigned up to 4 HS-Each cell is assigned up to 4 HSSCCH (limited by UE capability)

For each HS-DPCCH, SF=256

Each H has one HS-DPCCH.


Associated Channel - DPCHThere 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.

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

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

CQIPower 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.212 to 14 28 23 0.63 0.215 to 24 25 23 0.32 0.225 to 30 23 23 0 2 0 225 to 30 23 23 0.2 0.2


HSDPA DL Channel Power Control

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:

CQIAmount of Data to be transmittedAvailable Power for HS PDSCHAvailable Power for HS-PDSCHAvailable Code for HS-PDSCH


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

Th h d li l ith di t ib t t th HS SCCH f thThe scheduling algorithm distributes power to the HS-SCCH of the 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


Thank YouThank You

www.huawei.com

WCDMA Power and Scrambling Code Planning

Documents

Transcript of WCDMA Power and Scrambling Code Planning