WCDMA Scrambling code Planning

ZTE University

TD&W&PCS BSS Course Team

Objectives

At the end of this course, you will be able to:

Ø Grasp WCDMA SC principle
Ø Grasp WCDMA SC planning method
Content

Introduction to WCDMA cell scrambling

Scrambling planning principle
Cluster-Based scrambling multiplexing method
Scrambling setting principle
 Introduction to WCDMA cell scrambling

Introduction to WCDMA Cell Scrambling

n The WCDMA system adopts the CDMA technology, and

different BSs or different sectors of a BS are differentiated
by scrambling.

n The downlink scrambling code is the PN sequence

generated by an 18-bit shift register, with a total of 218 – 1
= 262,143 scrambling sequences. However, the system
only uses these scrambling sequences numbered from 0
to 24,575.
 Introduction to WCDMA cell scrambling

Introduction to WCDMA Cell Scrambling

n The 24,576 scrambling sequences are divided into three parts:

„ Common scrambling codes: k = 0,1,2,×××8,191, corresponding to
8,192 common scrambling codes, and used in normal mode.

„ Left secondary scrambling code: k + 8,192 and k = 0,1,2,×××8,191,

is the replaceable scrambling code used in compression mode in
the case of n < SF/2, with a total number of 8,192.
„ Right secondary scrambling code: k + 16,384 and k =
0,1,2,×××8,191, is the replaceable scrambling code used in
compression mode in the case of n ³ SF/2, with a total number of
8,192.
Ÿ -n is the corresponding n value in the channelization code Cch,SF,n.
 Introduction to WCDMA cell scrambling

Introduction to WCDMA Cell Scrambling

n Common scrambling codes frequently used are 8,192,

which are subdivided into primary scrambling codes (red,
512) and secondary scrambling codes (yellow, 8,192 –
512 = 7,680).
 Introduction to WCDMA cell scrambling

Introduction to WCDMA Cell Scrambling

The 8,192 scrambling sequences that are commonly used fall into 512 sets, with each set
including one primary scrambling sequence and 15 secondary scrambling sequences

following the primary one:

One set

Primary scrambling sequence No.: n=16*i i=0, ××× ,511

Scrambling No. of the corresponding secondary scrambling group: n=16*i+k k=1, ××× ,15

The primary scrambling code and 15 secondary scrambling codes of each set correspond to

each other.
 Introduction to WCDMA cell scrambling

Introduction to WCDMA Cell Scrambling

n The WCDMA downlink has a total of 512 primary

scrambling codes .

n Totally 512 codes can be divided into 64 groups, each

group contain 8 primary codes.

n P-CCPCH，P-CPICH，PICH，AICH，S_CCPCH
（carring PCH）in one cell should use the same primary
scrambling code.

n The planning of the SC will affect the cell searching

performance.
 Introduction to WCDMA cell scrambling

Cell search procedure (1)

n The cell search is typically carried out in three steps:

n Step1:Slotsynchronization
During the first step of the cell search procedure the UE
uses the SCH's primary synchronization code to acquire
slot synchronization to a cell.

n This is typically done with a single matched filter (or any

similar device) matched to the primary synchronization
code which is common to all cells. The slot timing of the
cell can be obtained by detecting peaks in the matched
filter output.
 Introduction to WCDMA cell scrambling

Cell search procedure (2)

n Step2: Frame synchronization and code-group

identification
During the second step of the cell search procedure, the
UE uses the SCH's secondary synchronization code to
find frame synchronization and identify the code group of
the cell found in the first step.
n This is done by correlating the received signal with all
possible secondary synchronization code sequences, and
identifying the maximum correlation value. Since the
cyclic shifts of the sequences are unique the code group
as well as the frame synchronization is determined.
 Introduction to WCDMA cell scrambling

Cell search procedure (2)

 Introduction to WCDMA cell scrambling

Cell search procedure (3)

n Step3: Scrambling-code identification

During the third and last step of the cell search procedure,
the UE determines the exact primary scrambling code
used by the found cell.
n The primary scrambling code is typically identified
through symbol-by-symbol correlation over the CPICH
with all codes within the code group identified in the
second step.
n After the primary scrambling code has been identified, the
Primary CCPCH can be detected and the system- and
cell specific BCH information can be read.
Introduction to WCDMA cell scrambling

Cell search procedure

Content

Introduction to WCDMA cell scrambling

Scrambling planning principle
Cluster-Based scrambling multiplexing method
Scrambling setting principle
 Scrambling planning principle

Scrambling Planning Principle

n From the viewpoint of network planning, WCDMA scrambling

planning is to distribute the primary scrambling code to the cell.

n The WCDMA downlink has a total of 512 primary scrambling

codes and one primary scrambling code is distributed to one
cell, as an identification parameter of the cell.

n When the number of cells is larger than 512, you can

repeatedly distribute a primary scrambling code to different
cells, as long as the distance between cells using the same
primary scrambling code is long enough to make the coverage
of received signals in another cell with the same primary
scrambling code lower than the threshold level.
 Scrambling planning principle

Scrambling Planning Principle

n To determine the minimum distance between BSs with

the same scrambling code is a basis and key issue of
code planning. Suppose the cell i and cell j use the same
scrambling code, the distance between two BSs is Lij,
and the coverage radiuses of the two cells are
respectively Ri and Rj (see the following figure).

Cell i

Lij Cell j

BS j
BS i

Ri Rj
 Scrambling planning principle

Scrambling Planning Principle

Lij must be big enough, to make the signal power of a remote BS far less than that of the main BS. In addition,
the signal level of the remote BS should be lower than the noise level. To meet the above requirements, the

following inequation should be tenable:

10 log( Lij - max( Ri , R j ))a - 10 log(max( Ri , R j ))a > D passloss

Where, Lij is the minimum reuse distance, a is the path loss coefficient, and D passloss is the pass
loss difference. 10log(Lij-max(Ri,Rj))a indicates the minimum pass loss of the remote BS signal

and 10log(max(Ri,Rj))a indicates the maximum pass loss of the main BS signal.

pathloss
Lij = max(Ri + R j ).(1 + 10 10a
)
Content

Introduction to WCDMA cell scrambling

Scrambling planning principle
Cluster-Based scrambling multiplexing method
Scrambling setting principle
 Cluster-Based scrambling multiplexing method

Cluster-Based Scrambling Multiplexing Method

n Under the precondition that the scrambling reuse distance is

satisfied, the same scrambling code can be reuse at different
BSs. Generally, a group of BSs using different scrambling
codes within the reuse distance is called a cluster, and the
scrambling code is multiplexed in cluster mode, as shown in the
following figure:
 Cluster-Based scrambling multiplexing method

Cluster-Based Scrambling Multiplexing Method

n According to scrambling planning principles, the following

table gives recommended scrambling multiplexing
distance values under four typical wireless transmission
environments:

Wireless Transmission Environment Scrambling Multiplexing Distance

Dense urban area 4 km

Common urban area 8.12 km

Suburb 18 km

Rural area 75 km
Content

Introduction to WCDMA cell scrambling

Scrambling planning principle
Cluster-Based scrambling multiplexing method
Scrambling setting principle
 Scrambling setting principle

Scrambling Setting Principle

n Downlink scrambling planning is to distribute 512 groups of

primary scrambling codes to sectors. Scrambling planning
should be built on the final result of network planning, and
observe the following principles:
„ To reuse the same scrambling code, the reuse BSs should have
an adequate physical distance between them.
„ Scrambling planning should take the features of stepwise network
construction into full consideration, and reserve a certain number
of scrambling codes, to satisfy demands of indoor distributed
systems and network capacity expansion.
„ It is necessary to reserve a certain number of scrambling codes
for border BS coordination.
„ Scrambling codes of adjacent cells had better belong to different
scrambling sets.
 Scrambling setting principle

Scrambling Setting Principle

Ø To multiplex the same scrambling code, the multiplexing BSs should have
an adequate physical distance.

Area Scrambling BS Radius (km) Maximum BS Maximum Number of

Multiplexing Number in a Scrambling Codes in Use (Take
Distance (km) Cluster the 3-Sector BS as an Example)

Dense urban area 4 0.3 to 0.6 61 183

Common urban 8.12 0.6 to 1.2 61 183

area

Suburb 18 1.2 to 3 75 225

Rural area 75 5 to 10 75 225

Note: For a 3-sector BS, two sectors within the scrambling reuse distance may have no joint
coverage scope due to the sector coverage direction, so one scrambling code can be reuse.
Therefore, in the case of three sectors, the actual number of distributed scrambling codes

within the scrambling reuse distance can be smaller than the total sector number.
 Scrambling setting principle

Scrambling Setting Principle

n Scrambling planning should take the features of stepwise network

construction into full consideration, and reserve a certain number of
scrambling codes, to satisfy demands of indoor distributed systems
and network capacity expansion.
n The maximum number of scrambling codes used in an area is
calculated according to the minimum radius of the macro cell BS in the
area. The actual number of distributed scrambling codes is calculated
according to the number of macro cell BSs in the planning area. The
scrambling code not in use can be reserved for follow-up capacity
expansion. For the micro cell and indoor distributed system, the
isolation between BSs, especially between different indoor distributed
systems, is good. Therefore, the scrambling reuse rate is very high,
and 100 scrambling codes can be reserved for distribution.
 Scrambling setting principle

Scrambling Setting Principle

n It is necessary to reserve a certain number of scrambling codes

for border BS coordination.
„ Generally, a big WCDMA network is divided into several subnets,
which are planned by different planners. If you do not know the
scrambling distribution schemes of other subnets, it is easy to
distribute the one scrambling code to two subnet border BSs. In
addition, the interference occurs because the distance between
two BSs with the same scrambling code cannot satisfy the reuse
distance required for the same scrambling code. To avoid the
above case, a certain number of scrambling codes must be
reserved for border BS coordination. The number of reserved
scrambling codes is that distributable in one cluster (see the
following table). However, the actual number of scrambling codes
in use can be smaller than the number of reserved scrambling
codes.
 Scrambling setting principle

Scrambling Setting Principle

The recommended scrambling distribution scheme is as follows:

Common Scrambling Distribution for Micro Cells and Border BS

Scrambling Indoor Distributed Systems Scrambling
Distribution Distribution

Recommended value 0 to 224 225 to 324 325 to 511

 Scrambling setting principle

Scrambling Setting Principle

n Scrambling codes of adjacent cells had better belong to

different scrambling sets.
„ When two adjacent cells use scrambling codes in one
scrambling group, they has the same secondary
synchronous code word combination. If the signal strength
of the two cells is close to each other, it may be difficult for
the terminal to distinguish them. Therefore, the scrambling
codes of two adjacent cells had better belong to different
scrambling groups.