CN1897741A - Dowlink disturbant-code dynamic distribution of wireless telecommunication network - Google Patents
Dowlink disturbant-code dynamic distribution of wireless telecommunication network Download PDFInfo
- Publication number
- CN1897741A CN1897741A CNA2005100839525A CN200510083952A CN1897741A CN 1897741 A CN1897741 A CN 1897741A CN A2005100839525 A CNA2005100839525 A CN A2005100839525A CN 200510083952 A CN200510083952 A CN 200510083952A CN 1897741 A CN1897741 A CN 1897741A
- Authority
- CN
- China
- Prior art keywords
- scrambler
- district
- sub
- neighbor cell
- optional
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Images
Abstract
The method comprises: in the first, setting a scramble code set; traversing all the adjacent cells of the cells the the scramble codes are allocated for; removing the scramble code already occupied by the neighboring cells from the scramble code; allocating scramble code for the cell required to get the scramble code by using those scramble codes not being allocated.
Description
Technical field
The present invention relates to descending scrambler distribution mechanism in the third generation cordless communication network, specifically, relate to the dynamic allocation method of descending scrambler in WCDMA (Wideband Code Division Multiple Access (WCDMA)) network.
Background technology
In the WCDMA network, except the spread spectrum operation, transmission ends is carried out scrambling (sign indicating number) process simultaneously, as shown in Figure 1.Purpose is to distinguish different terminal or base station (depending on uplink or downlink transfer).Therefore scrambling is carried out on spread spectrum, can not change signal bandwidth, but the effective signal of distinguishing different.By scrambling, even adopt identical spreading code to carry out the normal detection that spread spectrum can not influence signal yet to different transmitters.
Particularly, in up link, scrambler plays a part to distinguish user terminal, and its length can be long scrambler 38400 chips (10ms) or short scrambler 256 chips (66.7us).Long scrambler is Gold code (a Gold sign indicating number), and short scrambler is chosen from S (2) the sign indicating number family of expansion because the generation mechanism of two kinds of scramblers all comprises a large amount of available scramblers, so in up link the allocation strategy of undebatable scrambler.
In down link, the effect of scrambler is to distinguish different sectors, and its length is 38400 chips, is to reuse in the cycle with a wireless frame length 10ms.Multiple descending scrambler is made of a Gold sign indicating number and its delay version.The Gold sign indicating number is that the preceding 38400 bit slice sections of the m sequence that generates of 18 generation multinomial carry out with 2 by two high repses is that the addition of mould produces.This scrambler generation mechanism can produce 218-1=262 altogether, 143 scramblers, yet not all scrambler all be used, available scrambler is divided into 512 groups, every group comprises a basic scrambler and 15 auxiliary scramblers.All 512 basic scramblers are further divided into 64 basic scrambler groups again, and every group comprises 8 basic scramblers.One of each cell allocation and unique basic scrambler.
The restricted number of descending basic scrambler is at 512, and reason is if scrambler quantity is too much, and cell search process may be too time-consuming.Scrambler must be assigned to the sector when the network planning.Because the number of scrambler is too many, scrambler distributes this loaded down with trivial details work to be finished automatically by network planning tool usually.Angle from the network planning, 512 basic scramblers should be able to practical requirement, especially can use auxiliary scrambler for the situation of beam steering, when descending scrambling code planning, needn't consider like this owing to introducing the expense that the adaptive antenna technology takies basic scrambler.Auxiliary scrambler can not need to be monitored by whole sub-district and/or used by on the common channel of monitoring before initial registration at some.In order to guarantee the orthogonality between the different down channels, an auxiliary scrambler can only be used in sub-district or sector.Say that from the overall situation optimal strategy is to guarantee that user as much as possible uses same scrambler to reduce descending interference.If must introduce auxiliary scrambler, have only the user of those inapplicable basic scramblers to use auxiliary scrambler.The destroyed serious situation of orthogonality is that all users are divided equally and use two different scramblers.
In sum, scrambler is an important parameters in the wireless communication networks system.System distributes descending scrambler unitedly and gives each sub-district, totally 512 of optional basic scramblers when the network planning.Scrambler is selected the Gold sign indicating number with good auto-correlation and their cross correlation for use.The basic principle that scrambler distributes is that neighbor cell uses different scramblers.
Sub-district discussed above i.e. " macrocellular " sub-district constitutes traditional cellular network, yet present cellular mobile telecommunication system, in order to improve network capacity, effectively solve " blind spot " and " focus " in the network, often the polynary cellular system of forming by a upper strata cellular network and several lower floor's cellular networks.Typical three layers of hierarchical cellular structure comprise macrocellular, microcellulor and Pico cell, as shown in Figure 2.Every kind of honeycomb is carried out the difference in functionality that defines already, that is: macrocellular is used to handle the business of fast moving vehicle, and its covering radius reaches 1 kilometer at least; Microcellulor is handled at a slow speed and is moved, and concentrates on the business of walking or traffic jam vehicle; Pico cell is used to cover room areas such as market and Office Area.As replenishing of wireless coverage, the characteristics of Pico cell are that covering radius is littler, generally has only 10m-30m, base station transmitting power is littler, greatly about about tens milliwatts, be provided with flexibly, easy, at present a kind of brand-new Pico cell theory even the dynamic access network of time or place that can need the user, with satisfy the user cover and capacity on demand, and need not occupying system resources at one's leisure, such picocell coverage area is less, and the user is not strong to large-scale mobility demand, as using relatively independent sub-district, can be used in a large number in the hotel, in meeting room and the family, be with a wide range of applications.
Yet at present the static allocation mechanism of scrambler still can not realize the distribution of descending scrambler during access network at random of (slightly) cellular cell in enormous quantities or mobility sub-district, can only be at the beginning of configuration each cell scrambling calmly.Therefore, how can realize in cordless communication network that descending scrambler dynamic assignment mechanism becomes problem demanding prompt solution.
Summary of the invention
Technical problem to be solved by this invention provides descending scrambler dynamic allocation method in a kind of cordless communication network.Can choose suitable code word rapidly, reliably, rationally, effectively use all available code resource, guarantee to select different scramblers between neighbor cell for use, avoid presence of intercell interference, the dynamic assignment problem of descending scrambler when realizing Pico cell sub-district and mobility district dynamic access of radio network.
For solving the problems of the technologies described above, it is as follows to the invention provides scheme:
Descending scrambler dynamic allocation method comprises the steps: in a kind of cordless communication network
Step 101: the scrambler collection is set;
Step 102: traversal will be distributed the neighbor cell of the sub-district of scrambler, concentrates from scrambler and gets rid of the scrambler that has been taken by neighbor cell;
Step 103: concentrate and select idle available scrambling code for distributing the cell allocation scrambler of scrambler from getting rid of scrambler behind the neighbor cell scrambler.
Compared with prior art, the invention has the advantages that:
Descending scrambler dynamic assignment mechanism provided by the invention by scrambler being detected and distributing, is reasonably chosen suitable code word, effectively utilizes all available sign indicating number resources, guarantees to select different scramblers between neighbor cell for use, has avoided presence of intercell interference; And meet existing codes and standards, need not change any existing processes such as Cell searching, solved in cellular cell and the mobility district dynamic access of radio network process and obtained suitable scrambler problem automatically, simultaneously, need not the overhead that network is surveyed, thereby more flexible, reliable network architecture is provided, and has promoted overall performance, capacity and the service quality of third generation wireless communication system.
Technical problem to be solved by this invention, technical scheme main points and beneficial effect will be in conjunction with the embodiments, are further described with reference to accompanying drawing.
Description of drawings
Fig. 1 is in the WCDMA network, spread spectrum and scrambling schematic diagram;
Fig. 2 is macrocellular, microcellulor, Pico cell schematic diagram;
Fig. 3 is the flow chart of the method for the invention;
Fig. 4 is the flow chart of the method for the invention embodiment.
Embodiment
As shown in Figure 3, be the flow chart of descending scrambler dynamic allocation method in the cordless communication network of the present invention.At first, scrambler collection (step 101) is set; Then, traversal will be distributed the neighbor cell of the sub-district of scrambler, concentrates from scrambler and gets rid of the scrambler (step 102) that has been taken by neighbor cell; At last, concentrate and select idle available scrambling code from getting rid of behind the neighbor cell scrambler scrambler for distributing the cell allocation scrambler (step 103) of scrambler.
Here, described traversal will be distributed the neighbor cell of the sub-district of scrambler, finds the shared scrambler of these neighbor cells can adopt descending basic scrambler acquisition methods general in the broadband CDMA system.At first Node B (Node B) determines the code character that the employed basic scrambler in sub-district is affiliated by the auxiliary synchronous code that obtains among the SCH (synchronizing channel), has 64 basic scrambler groups; Then, according to the test one by one from the scrambler group of having determined (totally 8 basic scramblers) of the information among the CPICH (Common Pilot Channel), thereby locate the employed basic scrambler in this sub-district.
As shown in Figure 4, be the flow chart of the embodiment of the method for the invention.At first, set up optional scrambler array, be provided with initial value (0,1 ..., 511) (step 401); Then, detect the scrambler of the sub-district adjacent, the shared scrambler sequence number (step 402) of deletion neighbor cell in optional scrambler array with the sub-district that will distribute; Here, the scrambler of deleting in can optional scrambler array is set to inactive elements; Next, judge whether to have traveled through all neighbor cells again, if, execution in step 404, otherwise, execution in step 402 (step 403); Judge in the optional scrambler array whether have effective element, if, execution in step 405 (step 404) then; At last, select a effective element in the optional scrambler array as the scrambler (step 405) of the sub-district that will distribute, here, can effective element of picked at random as the scrambler of the sub-district that will distribute, perhaps choose first effective element in the optional scrambler array as the scrambler of the sub-district that will distribute.If, there has not been effective element in the optional scrambler array, then the scrambler coupling is unsuccessful, carries out abnormality processing.
Consider the release of scrambler and redistribute problem, when generation is not served in the sub-district, can discharge shared Internet resources, comprise scrambler resource.When the sub-district needed once more access network, the above technical scheme of still optional usefulness was carried out reconfiguring of scrambler, need not change configuration flow.
Descending scrambler dynamic allocation method in a kind of cordless communication network of the present invention, be not restricted to listed utilization in specification and the execution mode, it can be applied to various suitable the present invention's field fully, for those skilled in the art, can easily realize additional advantage and make amendment, therefore under the situation of the spirit and scope of the universal that does not deviate from claim and equivalency range and limited, the examples shown that the present invention is not limited to specific details, representational equipment and illustrates here and describe.
Claims (10)
1, descending scrambler dynamic allocation method in a kind of cordless communication network is characterized in that comprising the steps:
Step 101: the scrambler collection is set;
Step 102: traversal will be distributed the neighbor cell of the sub-district of scrambler, concentrates from scrambler and gets rid of the scrambler that has been taken by neighbor cell;
Step 103: concentrate and select idle available scrambling code for distributing the cell allocation scrambler of scrambler from getting rid of scrambler behind the neighbor cell scrambler.
2, method according to claim 1 is characterized in that: described step 102 further comprises the steps:
Step 201: Node B is determined code character under the employed basic scrambler in sub-district by obtaining auxiliary synchronous code in the synchronizing channel;
Step 202:, locate the employed basic scrambler in this sub-district according to the test one by one from the scrambler group of having determined of the information in the Common Pilot Channel.
3, method according to claim 1 is characterized in that: described scrambler collection is the optional scrambler array of setting up in advance.
4, method according to claim 3 is characterized in that: described optional scrambler array be set to (0,1 ..., 511).
5, method according to claim 1 is characterized in that: the described scrambler of concentrating eliminating to be taken by neighbor cell from scrambler is to be set to inactive elements by the corresponding positions the optional scrambler array.
6, method according to claim 1 is characterized in that: described traversal will be distributed the neighbor cell of the sub-district of scrambler, concentrates from scrambler and gets rid of the scrambler that has been taken by neighbor cell, may further include following steps:
Judge whether to have traveled through all neighbor cells, if not, the next neighbor cell of traversal then continued.
7, method according to claim 1 is characterized in that: in the described step 102 increase following steps that take a step forward:
Judge in the optional scrambler array whether have effective element,, then concentrate and select idle available scrambling code for distributing the cell allocation scrambler of scrambler from getting rid of behind the neighbor cell scrambler scrambler if exist.
8, method according to claim 7 is characterized in that: if there is not effective element in optional scrambler array, then carry out abnormality processing.
9, method according to claim 1 is characterized in that: described step 103 is by selecting an effective element in the optional scrambler array to realize as the scrambler of the sub-district that will distribute at random.
10, method according to claim 1 is characterized in that: described step 103 is by selecting first effective element in the optional scrambler array to realize as the scrambler of the sub-district that will distribute.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100839525A CN100461931C (en) | 2005-07-15 | 2005-07-15 | Dowlink disturbant-code dynamic distribution of wireless telecommunication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100839525A CN100461931C (en) | 2005-07-15 | 2005-07-15 | Dowlink disturbant-code dynamic distribution of wireless telecommunication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1897741A true CN1897741A (en) | 2007-01-17 |
| CN100461931C CN100461931C (en) | 2009-02-11 |
Family
ID=37610071
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100839525A Expired - Fee Related CN100461931C (en) | 2005-07-15 | 2005-07-15 | Dowlink disturbant-code dynamic distribution of wireless telecommunication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100461931C (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102056344A (en) * | 2009-11-05 | 2011-05-11 | 国基电子（上海）有限公司 | Home base station and method for setting network access parameters |
| CN101351016B (en) * | 2007-07-18 | 2012-01-11 | 中兴通讯股份有限公司 | Method for allocating automatic scrambling code |
| US8744505B2 (en) | 2008-09-25 | 2014-06-03 | Huawei Technologies Co., Ltd. | Method and apparatus for physical cell identifier communication and selection |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005012359A (en) * | 2003-06-17 | 2005-01-13 | Fujitsu Ltd | Apparatus and method for searching cell of mobile station in mobile communications system |
| US20070147309A1 (en) * | 2003-12-30 | 2007-06-28 | Brouwer Frank B | Method and system for allocation of channelisation codes in a code division multiple access system |
| CN100382464C (en) * | 2004-06-10 | 2008-04-16 | 大唐移动通信设备有限公司 | TD-SCDMA system cell code word planning method and method for searching composite code word combination thereof |
-
2005
- 2005-07-15 CN CNB2005100839525A patent/CN100461931C/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101351016B (en) * | 2007-07-18 | 2012-01-11 | 中兴通讯股份有限公司 | Method for allocating automatic scrambling code |
| US8744505B2 (en) | 2008-09-25 | 2014-06-03 | Huawei Technologies Co., Ltd. | Method and apparatus for physical cell identifier communication and selection |
| US9510210B2 (en) | 2008-09-25 | 2016-11-29 | Huawei Technologies Co., Ltd. | Method and apparatus of physical cell identifier allocation |
| CN102056344A (en) * | 2009-11-05 | 2011-05-11 | 国基电子（上海）有限公司 | Home base station and method for setting network access parameters |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100461931C (en) | 2009-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8880089B2 (en) | Mobile communication system and radio resource assignment method | |
| US6163524A (en) | Code allocation in CDMA | |
| CN1150796C (en) | Method and apparatus for soft handoff in a CDMA communication system | |
| EP2219404B1 (en) | Pilot grouping and set management in multi-carrier communication systems | |
| CN1328926C (en) | Method and appts. for orthogonal code management in CDMA systems using smart antenna tech background | |
| CN1264530A (en) | Method and apparatus for selecting base stations to communicate with remote satation | |
| CN1863368A (en) | Wireless network and method for planning and optimizing network therein | |
| MXPA06010511A (en) | Method and system for allocating time slots for a common control channel. | |
| CN1118963C (en) | Method for assigning spreading codes | |
| DE60117215T2 (en) | Intelligent optimization system and method for optimizing communication performance in a cellular communication network | |
| CN100547952C (en) | N frequency point networking method | |
| EP2638636B1 (en) | Reduction of interference in mobile telecommunications systems | |
| CN1327694A (en) | Channel identifier allocation method and mobile communications system | |
| CN100461931C (en) | Dowlink disturbant-code dynamic distribution of wireless telecommunication network | |
| CN1925376B (en) | Descending main scrambling code optimum distribution method in broad band CDMA system | |
| CN100369401C (en) | Method of uplink scrambling code distribution in WCDMA system | |
| CN1886924B (en) | Method and system for allocation of channelisation codes in a CDMA system | |
| KR0142495B1 (en) | Traffic analyzing device | |
| CN100407600C (en) | Configuration method of cell code source in time-division synchronous CDMA system group network | |
| US6985738B1 (en) | Automatic implementation of channel plan change in cellular network | |
| US20050175073A1 (en) | Data transmission method and transmitter | |
| CN1707974A (en) | Cell scramble distributing method for time division-synchronous code division multiple access system | |
| CN100596348C (en) | Channelization code allocation method | |
| CN1674479B (en) | Method for distributing graded distribution type ascending scramble in wideband code division multiple access | |
| KR100575502B1 (en) | Hard handoff method between frequency in the mobile communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090211 Termination date: 20190715 |