Wcdma Power And Scrambling Code Planning 14q47

Internal

WCDMA Power and Scrambling Code Planning www.huawei.com

HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

Chapter 1 Physical Layer Overview Chapter 2 Power Planning Chapter 3 Scrambling Code Planning


All rights reserved

Page 1

Radio Interface Protocol Structure GC

Nt

DC

Duplication avoidance Nt

GC

DC

C-plane C plane signaling

U plane information U-plane

control

L3 Radio Bearers

control control

ol contro

contro ol

RRC

UuS boundary

PD

RLC

RLC

RLC

PD

L2/PD

RLC RLC

RLC

BMC

L2/BMC

RLC

L2/RLC

RLC Logical Channels


MAC

L2/MAC

PHY

Transport Channels L1

All rights reserved

Page 2

WCDMA Radio Interface has three kinds of channels z In of protocol layer, the WCDMA radio interface has three

channels: Physical channel channel, transport channel and logical channel channel. z Logical channel: Carrying services directly. According to the

types of the carried services, it is divided into two types: Control channel and service channel channel. 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 physical h i l llayer. A According di tto whether h th th the iinformation f ti ttransported t d iis dedicated information for a or common information for all s, 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 and d scramble) bl ) and d carrier i phase h (I or Q) can b be regarded d d as a dedicated channel.


All rights reserved

Page 3

Radio Interface Channel Organisation


All rights reserved

Logical Channel Dedicated traffic channel

(DTCH)

Common traffic channel

(CTCH)

Broadcast control channel

(BCCH)

Paging control channel

(PCCH)

Dedicate control channel

(DCCH)

Common control channel

(CCCH)


All rights reserved

T ffi channel Traffic h l

Control channel

Page 5

Transport Channel Dedicated Channel

(DCH)

-DCH is an uplink or downlink channel

B d Broadcast t channel h l

(BCH)

Forward access channel

(FACH)

Paging channel

(PCH)

Random access channel

(RACH)

Dedicated transport channel

Common transport channel

High-speed downlink shared channel (HS-DSCH)


All rights reserved

Page 6

Physical Channel 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

code) d ) can di distinguish ti i h th the channels. h l z Most channels consist of radio frames and time slots, and each radio

frame consists of 15 time slots slots. z Two types of physical channel: UL and DL

Physical Channel

Frequency, q y Code, Phase


All rights reserved

Page 7

Downlink Physical Channel z Downlink Dedicated Physical Channel

> (Downlink DPCH) z Downlink D li k C Common Ph Physical i l Ch Channell

> Common Control Physical Channel (CCH) > Synchronization y Channel

((SCH))

> Paging Indicator Channel

(PICH)

> Acquisition Indicator Channel

(AICH)

> Common Pilot Channel

(ICH)

Downlink Physical Channel

> High-Speed Packet Downlink Shared Channel (HS-PDSCH) > High-Speed Shared Control Channel (HS-SCCH)


All rights reserved

Page 8

Uplink p Physical y Channel z Uplink Dedicated Physical Channel

> Uplink Dedicated Physical Data Channel (Uplink DPDCH) > Uplink p Dedicated Physical y Control Channel (Uplink DPCCH) > High-Speed Dedicated Physical Channel (HS-DPCCH)

Uplink Physical Ch Channel l

z Uplink Common Physical Channel

> Physical Random Access Channel (PRACH)


All rights reserved

Page 9

Channel Mapping DL Logical L i l Channels

Transport Channels

Physical Channels

P-SCH S-SCH ICH

BCCH

BCH

P CCH P-CCH

PCCH

PCH

S-CCH PICH

CCCH FACH

AICH

CTCH DCCH DTCH HUAWEI TECHNOLOGIES CO., LTD.

HS-PDSCH DSCH DCH All rights reserved

DPDCH DPCCH

Channel Mapping UL Logical Channels

Transport Channels

Physical Channels

CCCH

RACH

PRACH

DCCH

CH

PCH

DTCH

DCH

DPDCH I branch DPCCH Q branch


All rights reserved

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

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

Random access channels PRACH-Physical Random Access Channel

Node B

UE

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


All rights reserved

Page 12

UE Acquisition and Synchronization Initial Cell Synchronization

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

P-SCH

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

S SCH S-SCH

UE determines Scrambling Code by correlating all possible codes in group

ICH

Slot Synchronization Determined

Frame Synchronization and Scrambling Code Group Determined

Scrambling Code Determined UE Monitors and decodes BCH data

P-CCH

BCH data, data Super Super-frame frame synchronization determined UE adjust transmit timing to match timing of BS

Cell Synchronization complete This p procedure is applied pp whenever a UE needs to access a cell or measure the q quality y of a cell,, i.e. during g cell selection, cell re-selection and soft handover HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

Physical Channel(DL) Transmission Timing


All rights reserved

Page 14

Primary Synchronization Channel (P-SCH) z Used U d for f cellll search h and d synchronization h i ti z SSC specifies the scrambling code groups of the cell. z Two sub channels: P-SCH and S-SCH. z SSC is chosen from a set of 16 z SCH is transmitted at the first 10% of

(256 chips) of e every er time slot slot. z PSC is transmitted repeatedly in each time slot.

Slot #0

Primary SCH Secondary SCH

ac p i,0

ac s

different codes of length 256 256, there 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


All rights reserved

Page 15

Cell Synchronisation Cell synchronisation is achieved with the Synchronisation Channel (SCH). This channel divides up into two sub-channels: 1 Primary Synchronisation Channel (P-SCH) 1. (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 cells cells. The slot timing of the cell can be obtained by decoding peaks in the matched filter output


All rights reserved

Cell Synchronisation 2. Secondary y Synchronisation y Channel ((S-SCH)) ((FRAME SYNCH and Scrambling g Code Group 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 p g to the 64 p primary y scrambling g code g groups. p Scrambling Code Group Group 0 Group 1 Group 2 Group 3 Group 4 … Group 61 Group 62 Group p 63

#0 1 1 1 1 1

#1 1 1 2 2 2

#2 2 5 1 3 16

#3 8 16 15 1 6

#4 9 7 5 8 6

#5 10 3 5 6 11

slot number #6 #7 #8 15 8 10 14 16 3 12 16 6 5 2 5 15 5 12

9 9 9

10 11 12

13 12 10

10 15 15

11 12 13

15 9 14

15 13 9

Slot # ? Slot #?

Slot #?

P SCH P-SCH

a

a

a

S-SCH

16

6

11

9 13 14

16 11 15

#9 16 10 11 8 1

#10 #11 #12 #13 #14 2 7 15 7 16 5 12 14 12 10 2 16 11 15 12 4 4 6 3 7 15 12 16 11 2

12 14 11

14 10 11

13 16 13

16 15 12

z……..

256 chips

Group 2 Slot 7, 8, 9

2560 chips


All rights reserved

14 14 16

11 16 10

9 The beginning of a 10 ms frame can be determined (frame synchronization) based on sequence of SSC 9 64 different SSC combinations within 10ms are identified 9 The unique combination of SSCs identify the Scrambling Code Group

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

g or short type, yp There are 224 long g and 224 short uplink p either long scrambling codes. Uplink scrambling codes are assigned by higher layers. z 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.


All rights reserved

Page 18

Scrambling Code (SC) scrambling code 0 scrambling code 1

Set 1

……

…

…… …

Scrambling Codes for downlink

Set 0

bli code d 15 scrambling

scrambling code 511×16

Set 511

scrambling code 511×16 ……

512 sets

8192 Scrambling Codes

scrambling code 511×16＋15

Each set includes a primary scrambling code and 15 secondary scrambling codes. HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

Page 19

Primary Scrambling Code Group PSC 0 PSC 1

Group 1

……

…

……

Primary Scrambling Codes for downlink

Group 0

Group 63 G

PSC 7

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

PSC 63*8＋7 512 Primary Scrambling Codes

64 Primary Scrambling Code Groups


All rights reserved

Each group consists of 8 Primary Scrambling Codes

Page 20

Common Pilot Channel (ICH) z

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

z

Carries pre-defined sequence.

z

Fixed rate 30Kbps， SF=256

z

Primary ICH (P-ICH) > Uses U th the fifixed d channel h l code d -- Cch, C h 256, 256 0 > Scrambled by the primary scrambling code > Only one ICH per cell > Broadcast over the entire cell > Used by UE to determine the Primary Scrambling Code > Used as phase reference for most of the physical channels > Used as measurement reference in the FDD mode (and partially in the TDD mode). Pre-defined symbol sequence Tslot = 2560 chips p , 20 bits

Slot #0

Slot # i

Slot #1

Slot #14

1 radio frame: Tr = 10 ms


All rights reserved

Page 21

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

256 Chips

Synchronisation Channel (SCH)

P ICH P-ICH

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

P-ICH

symbol-by-symbol correlation applied speading code = cell‘s cell s primary scrambling code ⊗ Cch,256,0 h 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-ICH) to determine the cell‘s primary scrambling code by trial and error (UE tries 8 SC Codes of the group identified) identified).


All rights reserved

P-ICH as measurements reference UE has to perform f a set off L1 measurements, some off them refer f to the ICH C C channel: • ICH RS RS stands for Received Signal g Code Power. The UE measures the RS on the Primary-ICH. y The reference point for the measurement is the antenna connector of the UE. The ICH RS is a power measurement of the ICH. 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 UE UE.

• ICH Ec/No The ICH 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 band s power density. density The „quality quality“ is the primary ICH‘s ICH s signal strength in relation to the cell noise. (Please note, that transport channel quality is determined by BLER, BER, etc. )

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


All rights reserved

P-ICH as Measurement Reference ICH Ec/No

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

ICH RS

Received Signal Code Power (dBm)

UTRA carrier RSSI

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

ICH RS UTRA carrier RSSI

ICH Ec/No

ICH RS

UTRA carrier RSSI

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

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

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

Ec/No values in dB

RS values in dBm

RSSI values in dBm


All rights reserved

Primary Common Control Physical Channel (P-CCH) The UE gain the cell system information (MIB (MIB,SIB), SIB) which is transmitted on the physical channel PP CCH. By reading the cell system information on the P-CCH, 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 PCCH is not transmitted during the first 256 chips of each time slot.

z

Only data part 256 chips PCCH Data

SCH

18 bits T

Slot #0

Slot #1

slot

= 2560 chips,20 bits

Slot #i

Slot #14

1 radio frame: T f = 10 ms


All rights reserved

Page 25

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

256 Chips

Synchronisation Channel (SCH) P-CCH

9 Channelisation code: Cch,256,1 9 no TPC, TPC no pilot il t sequence 9 27 kbps (due to off period) 9 organised in MIBs and SIBs


Finally, Fi ll I gett the th cell system information

All rights reserved

P-CCH

Secondary Common Control Physical Channel (S-CCH) zFACH and d PCH can be b multiplexed lti l d tto th the

z Carry FACH and PCH.

same or separate SCCHs. If multiplexed to the same S-CCH, they can be mapped to the same fame.

z Two kinds of S-CCH: with or without

TFCI UTRAN decides if a TFCI should be transmitted transmitted, UE must TFCI TFCI.

z The first S-CCH S CCH must m st have ha e a spreading

factor of 256, while the spreading factor of the remaining S-CCHs can range between 256 (30 Kbps or 15 Ksps) and 4 (1920 Kbps)

z Possible rates are the same as that of

downlink DPCH z S-CCH is on air ONLY when there is data to transmit (FACH or Paging)

We use SF = 64 Æ 120 Kbps (60 Ksps)

Data

TFCI N TFCI bits

T slot = 2560 chips,

Slot #0

Pilot N Pilot bits

N Data bits

Slot #1

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

Slot #i

Slot #14

1 radio frame: T f = 10 ms


All rights reserved

Page 27

Paging Indicator Channel (PICH) z PICH is a fixed-rate (30kbps,SF=256) physical channel used to carry the Paging

Indicators (PI). z Frame 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. z N paging indicators {PI0, …, PIN-1} in each PICH frame, N=18, 36, 72, or 144. z If a paging indicator in a certain frame is set to 1, 1 it indicates that UEs associated with

this paging indicator should read the corresponding frame of the associated S-CCH. 288 bits for paging indication b0 b1

12 bits (undefined) b 287 b 288

One radio frame (10 ms)


All rights reserved

Page 28

b 299

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

τS-CCH τPICH = 7680 chips

PICH frame

for paging indication no transmission

b0

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

b1

b286

b287

b288

b299

# of paging indicators per frame (Np) Paging group

Subscribers with Pq indicator paged =>

Subscribers with Pq indicator not paged =>

18 (16 bits) bit )

{b16q, …,b b16q+15} 15} = {1,1,…,1} {1 1 1}

{b16 …,b16q+15} {b16q, b16 15} = {0 {0,0,…,0} 0 0}

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}


All rights reserved

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 of a signature whose length is 16 chips，16 available signatures i totally ll > 10 or 20ms message part > Which signature is available and the length of message part are determined by hi h llayer higher

Preamble

Preamble

Preamble P bl

4096 chips

Preamble

M Message partt

10 ms (one radio frame)

Preamble

Preamble

4096 chips


Message part 20 ms (two radio frames)

All rights reserved

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). Each time slot consists of two parts parts，an an Acquisition-Indicator(AI) and a part of duration 1024chips with no transmission. z Acquisition-Indicator AI have 16 kinds of Signature. z ICH 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


All rights reserved

Page 31

AS #0

Uplink Dedicated Physical Channel (DPDCH&DPCCH) z DPDCH and DPCCH are I/Q code multiplexed within each radio frame z DPDCH carries i d data t generated t d att L Layer 2 and d hi higher h llayer z DPCCH carries control information generated at Layer 1 z Each E h fframe iis 10 10ms and d consists i off 15 time i slots, l each h time i slot l

consists of 2560 chips z The spreading factor of DPDCH is from 4 to 256 z The spreading factor of DPDCH and DPCCH can be different in the

same Layer y 1 connection z Each DPCCH time slot consists of Pilot, TFCI, FBI, TPC


All rights reserved

Page 32

Frame Structure of Uplink DPDCH/DPCCH

Data N databits

DPDCH

DPCCH

Pilot Npilot bits

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


All rights reserved

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 z DPDCH and DPCCH is time multiplexed multiplexed.


All rights reserved

Page 34

Frame Structure of Downlink DPCH

DPCCH

DPDCH Data1 D t 1 Ndata1 bits

TPC NTPC bits

DPDCH TFCI NTFCI bits

Data2 D t 2 Ndata2 bits

DPCCH Pilott Pil 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


All rights reserved

Page 35

Physical Layer Data Bit Rates (R99)

Spreading factor (SF) = Chip Rate/Symbol Rate HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

High-Speed Physical Downlink Shared Channel (HS-PDSCH) z Bear service data and layer2 overhead bits mapped from the transport

c a e channel z SF=16, several channels can be configured to enhance data service

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

Slot #0

Slot#1

Slot #2

1 subframe: Tf = 2 ms


All rights reserved

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

used to carry downlink signalling related to HS HS-DSCH DSCH transmission

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

Sl t #0 Slot

Sl t#1 Slot#1

Sl t #2 Slot

1 subframe: T f = 2 ms


All rights reserved

Page 38

High-Speed Dedicated Physical Control Channel (HS-DPCCH ) z HS-DPCCH carries information to acknowledge downlink transport

blocks and information to the system for scheduling and link adaptation of transport block > CQI and ACK/NACK z Physical Ph i l Channel, Ch l U Uplink, li k SF SF=256, 256 with ith power control t l T

s lo t

2×T

= 2 5 6 0 c h ip s

s lo t

= 5 1 2 0 c h ip s

H A R Q -A C K

CQI

O n e H S -D P C C H s u b fra m e (2 m s )

S u b fra m e # 0

S u b fra m e # i O n e ra d io fra m e T


f

S u b fra m e # 4

= 10 ms

All rights reserved

Page 39

Chapter 1 Physical Layer Overview Chapter 2 Scrambling Code Planning Chapter 3 Power Planning


All rights reserved

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

process time will be reduced. p z Scrambling code planning may require co-ordination at 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 completed manually for small areas areas. z Genex U-Net is able to plan scrambling codes according to a specific strategy and exclude

specific scrambling codes for future expansion.


All rights reserved

Scrambling Code Planning Concept z

The most important p rule for scrambling g code p planning g is that the isolation between cells which 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 scrambling g code p planning g can be optimized p so that cell reselections take less time. For initial cell selection, if the UE does not contain any stored information about the cell, then it will need to scan the whole 64 groups. In this scenario, SC planning does not affect the UE’s performance

z

The scrambling g code p planning g strategy gy should for future network expansion. p Future network expansion could mean the inclusion of additional Node B, increased sectorization of existing Node B, or the evolution of Node B Type. Some Scrambling codes should be reserved for this purpose to minimize the impact on the original plan.

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 g code p planning g can be completed p independently p y for different RF carriers. If a radio network includes Node B which are configured with two or three RF carriers then it is recommended that the same scrambling code plan is assigned to each carrier. This reduces system complexity and helps to reduce the work associated with planning and optimizing the network

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.


All rights reserved

Scrambling Code Mapping Code Group 1

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


j=PSC Group k=PSC Set

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

All rights reserved

Page 43

Scrambling Code Mapping DL scrambling bli code d (3GPP 25 25.213) 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 scrambling code set

N = 16*8*j 16 8 j + 16*k 16 k, where j = 0 0,1,…,63, 1 63 k = 0,1,…,7 01 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]

All rights reserved

Page 44

Scrambling Code Planning Strategy z The scrambling codes for the same site are allocated in the same scrambling code group z The current cell cell’s s scrambling code cannot be reused by its neighbor cells and neighbor

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 sure each code of the neighboring g g cells are from a different. The 3GPP specifications 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 for neighbor sites)


All rights reserved

Scrambling Code Planning Method 1. Random Code Planning – Randomly allocate the codes from any code g 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. Reuse Code Group Planning – Divide 64 code groups into several sets based on the scale of a network (Hierarchical Cell Structure) and purpose off future f expansion plan.

9Reuse Code Group Planning is proposed by Huawei


All rights reserved

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 neighboring cells. cells This step relies heavily on local knowledge, after some drive tests, we should be able to identify the neighbors y more accurately. > Plan the SC in such a way that the primary cell and it’s neighbors are from the different group. p to reserve some code g codes for future expansion. > Have some minimum distance between two cells if the SC is to be reused. E.g. g 5km in urban areas. No need to plan too tightly. > Repeat this process for the rest of the cell.


All rights reserved

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

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 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 code > Reuse distance : a minimum reuse distance is defined > Additional constraints such as Ec/No


All rights reserved

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 Have H a lilistt off preferred f d codes/code d / d groups ffor b border d scrambling bli code d

planning.


All rights reserved

Example p of Scrambling g Code Planning g


All rights reserved

Example I

Cluster1 Sector/Group S1 S2 S3 S4 Cluster2 Sector/Group S1 S2 S3 S4 Cluster3 Sector/Group S1 S2 S3 S4 Cluster4 Sector/Group S1 S2 S3 S4

Cluster5 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14 A15 A16 Sector/Group 0 8 16 24 32 40 48 56 64 72 80 88 96 104 112 120 S1 1 9 17 25 33 41 49 57 65 73 81 89 97 105 113 121 S2 2 10 18 26 34 42 50 58 66 74 82 90 98 106 114 122 S3 3 11 19 27 35 43 51 59 67 75 83 91 99 107 115 123 S4 Cluster6 B1 B2 B3 B4 B5 B6 B7 B8 B9 B10 B11 B12 B13 B14 B15 B16 Sector/Group 128 136 144 152 160 168 176 184 192 200 208 216 224 232 240 248 S1 129 137 145 153 161 169 177 185 193 201 209 217 225 233 241 249 S2 130 138 146 154 162 170 178 186 194 202 210 218 226 234 242 250 S3 131 139 147 155 163 171 179 187 195 203 211 219 227 235 243 251 S4 Cluster7 C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 C16 Sector/Group 256 264 272 280 288 296 304 312 320 328 336 344 352 360 368 376 S1 257 265 273 281 289 297 305 313 321 329 337 345 353 361 369 377 S2 258 266 274 282 290 298 306 314 322 330 338 346 354 362 370 378 S3 259 267 275 283 291 299 307 315 323 331 339 347 355 363 371 379 S4 Cluster8 (IBC) D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16 Sector/Group 384 392 400 408 416 424 432 440 448 456 464 472 480 488 496 504 S1 385 393 401 409 417 425 433 441 449 457 465 473 481 489 497 505 S2 386 394 402 410 418 426 434 442 450 458 466 474 482 490 498 506 S3 387 395 403 411 419 427 435 443 451 459 467 475 483 491 499 507 S4

D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16 4 12 20 28 36 44 52 60 68 76 84 92 100 108 116 124 5 13 21 29 37 45 53 61 69 77 85 93 101 109 117 125 6 14 22 30 38 46 54 62 70 78 86 94 102 110 118 126 7 15 23 31 39 47 55 63 71 79 87 95 103 111 119 127 D1 132 133 134 135

D2 140 141 142 143

D3 148 149 150 151

D4 156 157 158 159

D5 164 165 166 167

D6 172 173 174 175

D7 180 181 182 183

D8 188 189 190 191

D9 196 197 198 199

D10 204 205 206 207

D11 212 213 214 215

D12 220 221 222 223

D13 228 229 230 231

D14 236 237 238 239

D15 244 245 246 247

D16 252 253 254 255

D1 260 261 262 263

D2 268 269 270 271

D3 276 277 278 279

D4 284 285 286 287

D5 292 293 294 295

D6 300 301 302 303

D7 308 309 310 311

D8 316 317 318 319

D9 324 325 326 327

D10 332 333 334 335

D11 340 341 342 343

D12 348 349 350 351

D13 356 357 358 359

D14 364 365 366 367

D15 372 373 374 375

D16 380 381 382 383

D1 388 389 390 391

D2 396 39 397 398 399

D3 404 405 0 406 407

D4 412 413 13 414 415

D5 420 421 21 422 423

D6 428 429 29 430 431

D7 436 437 3 438 439

D8 444 445 446 447

D9 452 453 3 454 455

D10 460 461 61 462 463

D11 468 469 69 470 471

D12 476 477 478 479

D13 484 485 8 486 487

D14 492 493 93 494 495

D15 500 501 01 502 503

D16 508 509 09 510 511

According to the location of sites, it divide di id 12 sites it or lless iinto t a group, and then allocate a scrambling code group Cluster for each group of sites according to that the reuse distance for each cluster is the longest longest. HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

Page 51

Example II z 512 Primary DL Scrambling

Codes divided into (3GPP) > 64 Codes Groups > Each Code Group consists 8 code sets z Proposed SC planning > Considering future expansion, a number b off code d groups iis 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 group g p 33-63)) are reserved for future expansion purpose > Scrambling Code Utilization is 51.6%


All rights reserved

Page 52

Example II

Scrambling Code reuse in this phase is

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


All rights reserved

Page 53

Example II- Code allocation Considering Cell search procedure, the scrambling code allocation requires:

1.

α sector : S.C G0-1

No duplicated DL scrambling code a

2.

No same code group among the neighboring cells.

β sector : S.C G2-1

γ sector : S.C G1-1

SC Gj-k Where j = Scrambling code group (0,1,2,…,63 ,…,63)) k =Primary scrambling code set ((0 0,…,7 ,…,7)


All rights reserved

Example II 11Site in 1 SC-Set (33codes)

88Site in 1 Reuse (264codes)

Scrambling Code Planning Method ¾The network is divided into clusters •Each E h primary i SC sett b builds ild up a cluster l t off different SC group •33 cells (11 of 3-sector sites) with different code group but b t same code d set, t scrambling bli code d could be assigned and built-up a sub area

¾8 sub areas ((code set = 0-7)) are built up p 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 S 0 SC-Set

SC S 4 SC-Set

SC-Set 1

SC-Set 5

SC-Set 2

SC-Set 6

SC-Set 3

SC-Set 7

All rights reserved

Page 55

Example II –Future Expansion Scrambling code planning for the future new sites can be done with minimum changes g of existing g network by y ¾ Allocating the reserved code for the new

sites ¾ Scrambling Code set used for new site is

cluster

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 and surrounding cells cells. ¾ Thus, different code group among neighbor

cells still achieve.


All rights reserved

Page 56

Example III z

64 Code Groups are divided into 3 sets.

z

Set A: 36 groups reserved for Macro layer outdoor sites which can 36 x 8codes = 288 codes = 288 cells = 96 sites for 1-time reuse

z

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

z

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

..

36

Set A 36


37

SC Group ..

54

Set B 18

All rights reserved

55

.. Set C 9

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 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 g will have a margin g of 4 sites for further added sites or cells.)) together

3.

Deploy 8 reuse patterns.

4.

Avoid allocating g 2 same code g groups p too close and a separation p of 2 patterns is a safe margin.

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


All rights reserved

Example III Outdoor sites SC Plan With Future Expansion

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

Macro o Sites

Rsv

CG-0 CG-1 CG-2 CG-3 CG-4 CG 5 CG-5 CG-6 CG-7 CG-8 CG-9 CG-10 CG-11 CG 12 CG-12 CG-13 CG-14 CG-15 CG-16 CG-17 CG-18 CG 19 CG-19 CG-20 CG-21 CG-22 CG-23 CG-24 CG-25 CG 26 CG-26 CG-27 CG-28 CG-29 CG-30 CG-31 CG-32 CG 33 CG-33 CG-34 CG-35 CG-36

0 0 8 16 24 32 40 48 56 64 72 80 88 96 104 112 120 128 136 144 152 160 168 176 184 192 200 208 216 224 232 240 248 256 264 272 280 288

1 1 9 17 25 33 41 49 57 65 73 81 89 97 105 113 121 129 137 145 153 161 169 177 185 193 201 209 217 225 233 241 249 257 265 273 281 289

2 2 10 18 26 34 42 50 58 66 74 82 90 98 106 114 122 130 138 146 154 162 170 178 186 194 202 210 218 226 234 242 250 258 266 274 282 290

S C Set S.C. 3 4 3 4 11 12 19 20 27 28 35 36 43 44 51 52 59 60 67 68 75 76 83 84 91 92 99 100 107 108 115 116 123 124 131 132 139 140 147 148 155 156 163 164 171 172 179 180 187 188 195 196 203 204 211 212 219 220 227 228 235 236 243 244 251 252 259 260 267 268 275 276 283 284 291 292

5 5 13 21 29 37 45 53 61 69 77 85 93 101 109 117 125 133 141 149 157 165 173 181 189 197 205 213 221 229 237 245 253 261 269 277 285 293

8 Reuse Patterns HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

6 6 14 22 30 38 46 54 62 70 78 86 94 102 110 118 126 134 142 150 158 166 174 182 190 198 206 214 222 230 238 246 254 262 270 278 286 294

7 7 15 23 31 39 47 55 63 71 79 87 95 103 111 119 127 135 143 151 159 167 175 183 191 199 207 215 223 231 239 247 255 263 271 279 287 295

Cell a b c a b c a b c a b c a b c a b c a b c a b c a b c a b c a b c a b c

Example III Outdoor sites SC Plan With Future Expansion For the convenience of mapping the 8 reuse patterns onto the network, 8 different colors are assigned to each reuse pattern pattern. R1 R2 R3 R4 R5 R6 R7 R8


All rights reserved

Example III Outdoor sites SC Plan With Future Expansion

Pattern R1 R2 R3 R4 R5 R6 R7 R8

Color

Times of Usage 6 5 6 5 5 5 5 6

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


All rights reserved

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


All rights reserved

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


All rights reserved

Chapter 1 Physical Layer Overview Chapter 2 Scrambling Code Planning Chapter 3 Power Planning


All rights reserved

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 s

z

In 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

z

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

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


All rights reserved

WCDMA Power Planning (Downlink) 20 W total R99

R99+HSDPA

7W 16 W

HS-DSCH

15 W HS-DSCH

DCHs

9W

DCHs

2W

CCHs

2W

CCHs

2W

ICH

2W

ICH


HSDPA Only

All rights reserved

3W 2W

CCHs+DCHs (associated)

ICH

Downlink Common Channel Powers z

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

z

The P-CCH P CCH encapsulates the BCH whereas the S-CCH S CCH encapsulates the PCH, the plane FACH and the control plane FACH.Other downlink common channels only exists at the physical layer

z

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

z

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

z

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

z

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

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 channel h l power HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

Downlink Common Channel Powers

10% Cell Power Max


All rights reserved

Downlink Common Channel Power 9 During network planning stage, Uplink service, downlink service and P P-ICH ICH link budgets should be generated and agreed on a per project basis. 9 Power allocation of ICH depends 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 required 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-ICH power 9 Increases to the default common channel powers can be accepted as long as the operator is made aware of the implications upon the total downlink transmit power. 9 Decreases to the default common channel powers should be avoided unless there is sufficient justification from field trials


All rights reserved

Downlink Common Channels z

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

Downlink common channels

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

ICH

0 dB

100%

20W 2.0

P-SCH

-5 dB

10%

0.06 W

S-SCH

-5 dB

10%

0.06 W

P-CCH

-2 dB

90%

1.1 W

PICH

-7 dB

100%¹

0.4 W

AICH

-6 dB

100%¹

0.5 W

S-CCH

1 dB²

10%³

0.25 W

Almost 50% is for ICH

Total Common channels Power

4.4 W

Remaining power for traffic channels

20-4.4 = 15.6 W

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

All rights reserved

Downlink Dedicated Channel Powers (R99-Bearer)


All rights reserved

Downlink Dedicated Channel Powers (R-99 Bearer)


All rights reserved

HSDPA Power Resource Allocation •

•

•

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

Common channel power

o

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

o

DPCH power (associated

HSPDA power allocation ll ti schemes: h 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 Total Power

•The Node B detects the R99 power load for DPCH every 2ms TTI to determine the available power for HSDPA. In this way, the cell load is more stable.

Power for HSDPA

Power for DPCH Power for CCH Flexible scheme


Time

All rights reserved

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 g in RNC by y 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


All rights reserved

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 HS-PDSCH PDSCH and HS-SCCH 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%)


All rights reserved

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(hsdpa) = P(total) - P(margin) - P(non-hsdpa)

with … P(t t l) : maximum P(total) i d downlink li k ttransmission i i power ffor th the cellll th thatt iis configured fi d iin RNC 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


All rights reserved

Power Resource available for HSDPA P(total) : 20W / 40W / 60W depending on power license The P(non-hsdpa) : ICH + Common Channel + CS Data + R99 Data For ICH 10% of the total power and for common channels about 15% is being allocated P(margin) : Is by default set to 0 (parameter HSPAPOWER) – no extra power is being reserved for R99 Power control

BOTTOM LINE : P(CS) (CS) + P(R99) ( ) + P(hsdpa) ( ) = P(total) ( ) – 10% % (C (ICH) C ) – 15% % (C (Common C Channels))

75% of Total Power can be allocated for CS / R99 and HSDPA Services HUAWEI TECHNOLOGIES CO., LTD.

All rights reserved

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

For each HS-PDSCH, SF=16

For each HS-SCCH, SF=128 Each cell is assigned up to 4 HSHS SCCH (limited by UE capability)

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


All rights reserved

Associated Channel - DPCH There is another dedicated physical channel named DPCH (R99) for each

¾

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

H S -P D S C H

H S -S C C H

DPCH

UE

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

All rights reserved

H S -D P C C H

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.

z

HS-SCCH Power: Allocated depending on CQI

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

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.63 0.2 25 23 0.32 0.2 23 23 02 0.2 02 0.2


All rights reserved

HSDPA DL Channel Power Control

PHSDPA(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 Power for HS-PDSCH HS PDSCH Available Code for HS-PDSCH


All rights reserved

HSDPA Power Distribution to Single s > 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. ¾The scheduling ¾Th h d li algorithm l ith distributes di t ib t power tto th the HS-SCCH HS SCCH off the th 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


All rights reserved

Thank You www.huawei.com

Wcdma Power And Scrambling Code Planning 14q47

Overview 5o1f4z

More details 6z3438

Related Documents c2h70

Wcdma Power And Scrambling Code Planning 14q47

Huawei Wcdma Primary Scrambling Code Planning 6y1z1g

3- Scrambling Code Planning.pdf 5y5b36

2-scrambling Code Plannscrambling Code Planning Guidelinesing Guidelines.pdf 2c711j

Power System Planning-intro 3h194h

More Documents from "Aamir Shehzad" 5l1210

Wcdma Power And Scrambling Code Planning 14q47

Max Weber's Theory Of Bureaucracy 3l1q68

Health Care Conditions In Pakistan 6v2967

Parts Of Reports:three Components Of Formal Reports 735718

Current Affairs Notes For Css (officers Academy Lahore) 674m3a

The Scope Of Industrial Marketing: Industrial Marketing Is Different 133929