CN101119575A - Scrambling planning method of WCDMA wireless network planning - Google Patents

Scrambling planning method of WCDMA wireless network planning Download PDF

Info

Publication number
CN101119575A
CN101119575A CNA2007100549729A CN200710054972A CN101119575A CN 101119575 A CN101119575 A CN 101119575A CN A2007100549729 A CNA2007100549729 A CN A2007100549729A CN 200710054972 A CN200710054972 A CN 200710054972A CN 101119575 A CN101119575 A CN 101119575A
Authority
CN
China
Prior art keywords
scrambler
planning
scrambling
number
scramble
Prior art date
Application number
CNA2007100549729A
Other languages
Chinese (zh)
Inventor
黄志勇
聂昌
史文祥
杨剑键
张健明
陈国利
黄三荣
马红兵
Original Assignee
中讯邮电咨询设计院
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中讯邮电咨询设计院 filed Critical 中讯邮电咨询设计院
Priority to CNA2007100549729A priority Critical patent/CN101119575A/en
Publication of CN101119575A publication Critical patent/CN101119575A/en

Links

Abstract

The invention discloses a scramble programming method in WCDMA wireless net programming, comprising the following steps: 1. confirming the object area needing scramble programming and the corresponding object base station and the object sectors; 2. setting up the bigger block number of the object area and the biggest chip number; 3. distributing the scramble of the object sectors needing programming again and eliminating the original programming scramble; 4. confirming the distributing sequencing of the subdistrict scrambles according to the adjacent subdistrict number or the near subdistrict number of each object area and combining the adjacent subdistrict number or the near subdistrict number of the distributed scrambles; 5. in order to preventing the existence of conflict scramble, adopting a scramble conflict testing method to filtrate the biggest block number of the object area and the object chip number so as to determine the chip in the substrict needing distribution firstly. The invention has the advantage of furthest preventing the existence of the conflict scramble so as to improve the reliability of the scramble programming, reduce the jamming and improve the whole use rate of system resource.

Description

Scrambling planning method in the WCDMA wireless network planning

Technical field

The present invention relates to Wideband Code Division Multiple Access (WCDMA) (WCDMA) field of wireless in the 3G mobile communication, especially relate to the scrambling planning method in the WCDMA wireless network planning.

Background technology

At present, the scrambling code planning principle in the WCDMA wireless network planning is: 1, distinguish different districts with different scrambling codes, confirm that neighbor cell does not use identical scrambler; 2, accelerate Cell searching and measurement, improve performance of handoffs; 3, save the UE battery, reduce and handle load; 4, improve the scrambler utilance, for coordinating and dilatation reservation scrambler resource.But in physical planning operation, often there is conflict in mentioned above principle and needs are compromise considers, for example, if quickening Cell searching and measurement, improving performance of handoffs often needs to use less code word number, more code character number; And to save the UE battery, reducing the processing load needs to use more code word number, less code character number again.And above-mentioned scrambling code planning principle 1 must be observed, in case because there is the conflict scrambler in neighbor cell, disturbing can be very big, has a strong impact on network performance; And reserve scrambler in the scrambling code planning principle 4 is an indispensable function of scrambling code planning, is the network capacity extension and optimization preparation.Therefore, how taking into account four principles of above-mentioned scrambling code planning, is the problem that those skilled in the art study always, but yet there are no the report of all relevant this respects.

Summary of the invention

The object of the invention is to provide the scrambling planning method in a kind of WCDMA wireless network planning, with the reliability of raising scrambling code planning, thereby reduces to disturb, and improves the whole service efficiency of system resource.

For achieving the above object, the present invention can take following technical proposals:

Scrambling planning method in the WCDMA wireless network planning of the present invention will minimize and minimize these two kinds of methods based on the scrambler group and be used for scrambling code planning simultaneously based on scrambler, comprise the steps:

The first step, definite target area and corresponding target BS and the target sector that need carry out scrambling code planning;

Second step, the target setting maximum code character number in zone and maximum code subnumber order;

The 3rd step, the scrambler of the target sector of needs planning is redistributed, removed original planning scrambler;

The 4th step, according to the adjacent number of cells of each target area or adjacent cells number, and, determine that cell scrambling distributes sequencing in conjunction with the adjacent sub-district number and the adjacent cells number that have distributed scrambler;

The 5th step, for avoiding conflict the existence of scrambler, take the scrambling conflict detection method, the maximum code character number in target area, target maximum code subnumber are screened, determine at first to distribute the numeral of sub-district.

Described scrambler minimizes the scrambling code planning method: neighbor cell is adopted different main scrambler groups but mutually on the same group in the main scrambler of biasing carry out scrambling code planning, so both can guarantee better orthogonality, can improve the search speed of scrambler again; The search of scrambler biasing in the group that is equal to main Serving cell earlier so just is similar to 64 multiplexingly, and this 64 multiplexing modes still are the comparison affluence for plot planning; After 64 multiplexing the using up of this biasing by the time, plan another 64 multiplexing cell set with the different scrambling codes group of another biasing again, all use up up to 512 scramblers and repeat this process again;

Described scrambler group minimizes and is meant: neighbor cell adopts identical main scrambler group as far as possible, but the main scrambler of biasing carries out scrambling code planning in the different groups, if after 8 scramblers of a scrambler group use up, use the scrambler of next scrambler group again, to improve Cell searching speed.

Described scrambling conflict detection method is to be with the scrambling code planning area dividing: all sub-districts in adjacent sub-district, adjacent cells, the set distance range; If have scrambling conflict in above-mentioned sub-district, identify and give certain weight for the conflict scrambler, represent conflict situations, combining target code character number and object code subnumber regenerate weighted value again, and the scrambler that regenerates the minimum of weight is distributed to Target cell.

The invention has the advantages that and to minimize and be used for scrambling code planning simultaneously based on scrambler based on these two kinds of methods of scrambler group minimization method, and avoiding adopting conflict scrambler detection method aspect the adjacent sub-district existence conflict scrambler, even can be with conflict scrambler extended detection range to the wider adjacent cells in neighbour sub-district, or the sub-district in a certain distance range, the existence of scrambler to the full extent avoids conflict, thereby improve the reliability of scrambling code planning, reduce to disturb, improve the whole service efficiency of system resource.

Description of drawings

Fig. 1 is the flow chart of scrambling code planning.

Fig. 2 is the target BS and the target sector distribution map in the specific planning of expression map zone.

Fig. 3 is the expansion Lin Ji that expression obtains each sector to be allocated, draws the schematic diagram of the BS2 sector 3 of distribution coefficient maximum.

Fig. 4 is that the scrambler of expression target sector minimizes program results figure.

Fig. 5 is that the scrambler group of expression target sector minimizes program results figure.

Embodiment

As shown in the figure, the present invention is with one group of WCDMA base station (BS in the selected slip gauge partition territory i, wherein i is 1 ~ 4, each base station hypothesis is divided into three sectors: BS i-1; BS i-2; BS i-3) planning scrambler process is a representative illustration, sets forth the scrambling planning method in the WCDMA wireless network planning of the present invention.

The first step, determine to carry out target area and the corresponding target BS and the target sector of scrambling code planning, and initialization is carried out in the sector;

Second step, the target setting maximum code character number in zone and maximum code subnumber order;

The 3rd step, the scrambler of the target sector of needs planning is redistributed, removed original planning scrambler;

The 4th step, according to the adjacent number of cells of each target area or adjacent cells number, and, determine that cell scrambling distributes sequencing in conjunction with the adjacent sub-district number and the adjacent cells number that have distributed scrambler;

Obtain the adjacent collection of each expansion for the treatment of the branch sector: the selection according to the user obtains different parts, comprises adjacent sub-district (neighbor), sub-district (nearby) in the adjacent cell (adjacent), multiplex distance, same base station cell (nodeB); Traversal is treated the branch sector, calculates the distribution coefficient that each treats the branch sector, obtains the sector of distribution coefficient maximum.

The adjacent sub-district number of having distributed of concentrating of the number+expansion of the adjacent collection of distribution coefficient=expansion sub-district

The distribution coefficient maximum of BS2 sector 3 in the example, so should distribute at first, the distribution coefficient minimum of BS4 sector 2 should be distributed at last.

The 5th step, for avoiding conflict the existence of scrambler, take the scrambling conflict detection method, the maximum code character number in target area, target maximum code subnumber are screened, determine at first to distribute the numeral of sub-district.

Wherein, A, B, C are the scrambling conflict coefficient value under the different condition, A>>B>>C.Because for the influence of conflict, from C to A, three kinds of situations are severe gradually.The scrambler of adjacent sub-district is multiplexing to be not allow situation about taking place; Cover multiplexing should the avoiding as much as possible of cell scrambling in overlay cells or the multiplex distance; Scrambler under all the other situations is multiplexing then to be normal.

According to the scrambling conflict coefficient, but minimized scrambler group number, when available scrambler is arranged in the minimized scrambler number, distribute this scrambler; Do not divide timing when having, distribute the scrambler of having given other uncorrelated sub-districts with scrambler; When there not being when not using scrambler and having given the scrambler of other uncorrelated sub-districts, distributing the scrambler of expanding multiplexing less sub-district in the adjacent collection (except that adjacent sub-district); Do not use scrambler and the multiplexing scrambler of expanding adjacent collection (except that adjacent sub-district) to divide timing when having, distribute the scrambler of adjacent sub-district.

Scrambler minimizes in the program results, and biasing all is 2 in the group of each sector, but the main scrambler group number difference of sector.

The scrambler group minimizes in the program results, and the main scrambler group number of sector is 42 and 21, but biasing is different in the group of each sector.

Claims (3)

1. the scrambling planning method in the WCDMA wireless network planning is characterized in that: will minimize and minimize these two kinds of methods based on the scrambler group based on scrambler and be used for scrambling code planning simultaneously, and comprise the steps:
The first step, definite target area and corresponding target BS and the target sector that need carry out scrambling code planning;
Second step, the target setting maximum code character number in zone and maximum code subnumber order;
The 3rd step, the scrambler of the target sector of needs planning is redistributed, removed original planning scrambler;
The 4th step, according to the adjacent number of cells of each target area or adjacent cells number, and, determine that cell scrambling distributes sequencing in conjunction with the adjacent sub-district number and the adjacent cells number that have distributed scrambler;
The 5th step, for avoiding conflict the existence of scrambler, take the scrambling conflict detection method, the maximum code character number in target area, target maximum code subnumber are screened, determine at first to distribute the numeral of sub-district.
2. according to the scrambling planning method in the described WCDMA wireless network planning of claim 1, it is characterized in that: described scrambler minimizes the scrambling code planning method and is: neighbor cell is adopted different main scrambler groups but mutually on the same group in the main scrambler of biasing carry out scrambling code planning, so both better orthogonality can be guaranteed, and the search speed of scrambler can be improved again; The search of scrambler biasing in the group that is equal to main Serving cell earlier so just is similar to 64 multiplexingly, and this 64 multiplexing modes still are the comparison affluence for plot planning; After 64 multiplexing the using up of this biasing by the time, plan another 64 multiplexing cell set with the different scrambling codes group of another biasing again, all use up up to 512 scramblers and repeat this process again;
Described scrambler group minimizes and is meant: neighbor cell adopts identical main scrambler group as far as possible, but the main scrambler of biasing carries out scrambling code planning in the different groups, if after 8 scramblers of a scrambler group use up, use the scrambler of next scrambler group again, to improve Cell searching speed.
3. according to the scrambling planning method in the described WCDMA wireless network planning of claim 1, it is characterized in that: described scrambling conflict detection method is to be with the scrambling code planning area dividing: all sub-districts in adjacent sub-district, adjacent cells, the set distance range; If have scrambling conflict in above-mentioned sub-district, identify and give certain weight for the conflict scrambler, represent conflict situations, combining target code character number and object code subnumber regenerate weighted value again, and the scrambler that regenerates the minimum of weight is distributed to Target cell.
CNA2007100549729A 2007-08-16 2007-08-16 Scrambling planning method of WCDMA wireless network planning CN101119575A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2007100549729A CN101119575A (en) 2007-08-16 2007-08-16 Scrambling planning method of WCDMA wireless network planning

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2007100549729A CN101119575A (en) 2007-08-16 2007-08-16 Scrambling planning method of WCDMA wireless network planning

Publications (1)

Publication Number Publication Date
CN101119575A true CN101119575A (en) 2008-02-06

Family

ID=39055458

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2007100549729A CN101119575A (en) 2007-08-16 2007-08-16 Scrambling planning method of WCDMA wireless network planning

Country Status (1)

Country Link
CN (1) CN101119575A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102204313A (en) * 2011-05-19 2011-09-28 华为技术有限公司 Resource multiplex method and device & swithcing method and device thereof
CN101594679B (en) * 2008-05-26 2011-12-28 中兴通讯股份有限公司 Method for allocating scrambling codes in self-adapting mode for a WCDMA network
US8744505B2 (en) 2008-09-25 2014-06-03 Huawei Technologies Co., Ltd. Method and apparatus for physical cell identifier communication and selection
CN107197503A (en) * 2008-11-07 2017-09-22 高通股份有限公司 The optimization to main scrambler and list of frequency is transmitted in wireless communications

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594679B (en) * 2008-05-26 2011-12-28 中兴通讯股份有限公司 Method for allocating scrambling codes in self-adapting mode for a WCDMA network
US9510210B2 (en) 2008-09-25 2016-11-29 Huawei Technologies Co., Ltd. Method and apparatus of physical cell identifier allocation
US8744505B2 (en) 2008-09-25 2014-06-03 Huawei Technologies Co., Ltd. Method and apparatus for physical cell identifier communication and selection
CN107197503A (en) * 2008-11-07 2017-09-22 高通股份有限公司 The optimization to main scrambler and list of frequency is transmitted in wireless communications
CN107197503B (en) * 2008-11-07 2020-05-12 高通股份有限公司 Method and apparatus for optimized transmission of primary scrambling codes and frequency lists in wireless communications
WO2011144045A3 (en) * 2011-05-19 2012-04-26 华为技术有限公司 Method and device for resources multiplexing, method and device for handover
CN102204313B (en) * 2011-05-19 2013-12-04 华为技术有限公司 Resource multiplex method and device & swithcing method and device thereof
CN102204313A (en) * 2011-05-19 2011-09-28 华为技术有限公司 Resource multiplex method and device & swithcing method and device thereof
WO2011144045A2 (en) * 2011-05-19 2011-11-24 华为技术有限公司 Method and device for resources multiplexing, method and device for handover

Similar Documents

Publication Publication Date Title
US20180160366A1 (en) Generating downlink frame and searching for cell
KR101257066B1 (en) Method for Resource Partition, Assignment, Transmission and Reception for Inter-Cell Interference Migration in Downlink of OFDM Cellular Systems
CN103283165B (en) The method of the Cell searching in the channel of synchronous interference restriction
ES2402572T3 (en) Procedure and apparatus for searching a cell
RU2129761C1 (en) Method for frequency allocation between base stations of mobile communication network
EP2063542B1 (en) Data creation device, data creation method, base station, mobile station, synchronization detection method, sector identification method, information detection method, and mobile communication system
CN1188966C (en) Synchronization and cell search method and apparatus for wireless communications
TWI474729B (en) Methods and apparatus for efficient spectral usage in extensible carrier deployments
EP1665820B1 (en) Interference management for soft handoff and broadcast services in a wireless frequency hopping communication system
Dasilva et al. Multicarrier orthogonal CDMA signals for quasi-synchronous communication systems
CN103068032B (en) Secondary synchronization sequences for cell group detection in cellular communications system
EP1303928B1 (en) Adaptive uplink/downlink timeslot assignment in a hybrid wireless time division multiple access/code division multiple access communication system
US9241276B2 (en) Method for adaptive formation of cell clusters for cellular wireless networks with coordinated transmission and reception
CN101822118B (en) For single carrier and the method and apparatus of OFDM sub-block transmissions
EP2219404B1 (en) Pilot grouping and set management in multi-carrier communication systems
US7593420B2 (en) Method for allocating resources in a multicarrier system and transmission apparatus using the same
EP2547009B1 (en) Method and device for stations to share and determine cell identity of stations during cooperative communication
KR100779092B1 (en) Cell search method, forward link frame transmissin method, apparatus using the same and forward link frame structure
TW548996B (en) Method and apparatus for code assignment in a spread spectrum wireless communication system
KR20050113441A (en) Apparatus and method for transmitting /receiving cell identification code in mobile communication system
US20070064666A1 (en) Method of allocating resources and method of receiving the allocated resources in a communication system
KR20020004841A (en) Distributed channel assignment method
AU2006266325B2 (en) Systems and methods for making channel assignments to reduce interference and increase capacity of wireless networks
CN101409884B (en) Method for optimizing network frequency based on measurement report
US8265028B2 (en) Distributed allocation of physical cell identifiers

Legal Events

Date Code Title Description
PB01 Publication
C06 Publication
SE01 Entry into force of request for substantive examination
C10 Entry into substantive examination
RJ01 Rejection of invention patent application after publication

Open date: 20080206

C12 Rejection of a patent application after its publication