CN101047424A - Method for distributing base disturbance code in time-division-synchronous CDMA system - Google Patents

Method for distributing base disturbance code in time-division-synchronous CDMA system Download PDF

Info

Publication number
CN101047424A
CN101047424A CNA2006100668367A CN200610066836A CN101047424A CN 101047424 A CN101047424 A CN 101047424A CN A2006100668367 A CNA2006100668367 A CN A2006100668367A CN 200610066836 A CN200610066836 A CN 200610066836A CN 101047424 A CN101047424 A CN 101047424A
Authority
CN
China
Prior art keywords
sub
district
scrambler
basic scrambler
basic
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.)
Pending
Application number
CNA2006100668367A
Other languages
Chinese (zh)
Inventor
毛磊
冯心睿
毕海
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Datang Mobile Communications Equipment Co Ltd
Original Assignee
Datang Mobile Communications Equipment Co Ltd
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 Datang Mobile Communications Equipment Co Ltd filed Critical Datang Mobile Communications Equipment Co Ltd
Priority to CNA2006100668367A priority Critical patent/CN101047424A/en
Publication of CN101047424A publication Critical patent/CN101047424A/en
Pending legal-status Critical Current

Links

Images

Abstract

A method for distributing base scramble code in TD-SCDMA system includes obtaining base scramble code combination table in according with composite code correlation condition according to plan requirement, confirming base scramble code for two adjacent cells, distributing base scramble code for cell adjacent to cell with confirmed base scramble code through diffusion mode under constraint of said base scramble code combination table, repeating this distribution step till all cells are distributed with base scramble code.

Description

The implementation method of allocation base scrambler in the time-division-synchronization code multi-address division system
Technical field
The present invention relates to Time Division-Synchronous Code Division Multiple Access (TD-SCDMA) technical field, be meant the implementation method of allocation base scrambler in the time-division-synchronization code multi-address division system especially.
Background technology
The 3rd third-generation mobile communication system has extensively adopted the access mode based on CDMA, and its essential characteristic is exactly to distinguish different users with different code words.In order to realize the beehive net structure, different cdma systems has all defined different separately code words and has used and allocative decision.
Wherein, the employed code word of TD-SCDMA system can be divided into by type: downlink frequency pilot code, ascending pilot frequency sign indicating number, cell scrambling, mid-(midamble) sign indicating number and orthogonal variable spreading factor sign indicating number (OVSF).The corresponding relation of downlink frequency pilot code, ascending pilot frequency sign indicating number, scrambler and basic midamble intersymbol is referring to table 1.
Relevant code word
Downlink frequency pilot code sequence number (SYNC_DL ID) Ascending pilot frequency sign indicating number sequence number (SYNC_UL ID) Scrambler sequence number (Scrambling CodeID) Basic midamble sequence number (Basic Midamble Code ID)
0 0~7 (000~111) 0 0
1 1
2 2
3 3
1 8~15 (000~111) 4 4
5 5
6 6
7 7
……
31 248~255 (000~111) 124 124
125 125
126 126
127 127
Table 1
As shown in table 1, downlink frequency pilot code one has 32, is used to distinguish different sub-districts, and ascending pilot frequency sign indicating number one has 256.The ascending pilot frequency sign indicating number is used in random access procedure by subscriber equipment (UE), and the employed downlink frequency pilot code of the ascending pilot frequency sign indicating number of each sub-district and sub-district has certain corresponding relation, corresponding 8 the ascending pilot frequency sign indicating numbers of downlink frequency pilot code.The quantity of scrambler and basic midamble sign indicating number all is 128, each sub-district is after downlink frequency pilot code is determined, can from 4 scramblers of each downlink frequency pilot code correspondence, select a scrambler as this sub-district, so also just determined simultaneously corresponding basic midamble sign indicating number, the midamble sign indicating number of different channels is to be produced according to certain skew by basic midamble sign indicating number in the sub-district.The OVSF spreading code is used for distinguishing the different channel of same signal source, and the midamble sign indicating number is used for each channel and carries out channel estimating.
Yet, because the scrambler limited length that the TD-SCDMA system adopts, only be 16 chips (chip), the maximum spreading factor of being supported of TD-SCDMA system also is 16 chip simultaneously, like this, just not necessarily has good cross correlation between the compound key that combines by scrambler and OVSF spreading code, in some cases, the situation that compound key between neighbor cell can occur overlapping fully, if the subscriber signal strength ratio of the different districts of arrival this moment receiver is more approaching, then these two users' signal will be difficult to be distinguished, and will cause relevant code track not work like this, thereby cause the loss of capacity.
Under the constraints of the represented various code word corresponding relations of table 1, the actual requirement that scrambler distributes is exactly to divide timing to guarantee not have between the neighbor cell scrambler and the downlink frequency pilot code of repetition at sign indicating number.For reaching this purpose, though the existing patent that has proposed a lot of district code word distribution methods of being correlated with, but still two subscriber signals that can not guarantee neighbor cell are when having certain delay inequality, correlation between the spreading code and to the influence of demodulation performance is disturbed minimum in the system in the time of can not guaranteeing to have the time division duplexing-CDMA mobile communication system identical networking of less spreading factor effectively.
At application number is " 200410048703.8 ", denomination of invention is in the patent application of " the cell scrambling distribution method of many minutes location systems of a kind of time-division-synchronization code ", the synthetic code word combination equivalence that 128 scramblers of TD-SCDMA system are formed is the synthetic code word combination of 12 scrambler formation wherein, thereby make that 128 scramblers can equivalence be the version of 12 scramblers, claim that at this these 12 scramblers are basic scrambler.Because 128 scramblers can equivalence be 12 basic scramblers, therefore when carrying out scrambling code planning, answer emphasis that basic scrambler is planned.Thus, the TD-SCDMA system deteriorates to carrying out the problem that basic scrambler distributes in each sub-district for the planning problem of each cell allocation scrambler in 128 scramblers.
Though prior art has provided the acquisition mode of basic scrambler, how not provide the allocation base scrambler, to guarantee to make the compound key correlation of any adjacent two sub-districts all to satisfy the requirement of planning.
Summary of the invention
In view of this, the object of the present invention is to provide the implementation method of allocation base scrambler in a kind of time-division-synchronization code multi-address division system, make the compound key correlation of any adjacent two sub-districts all satisfy the requirement of planning.
For achieving the above object, technical scheme of the present invention is achieved in that
The implementation method of allocation base scrambler in a kind of time-division-synchronization code multi-address division system, this method may further comprise the steps:
A, obtain to meet the basic scrambler combination table of compound key related condition according to planning requirement; Whenever walking to of described basic scrambler combination table comprises the basic scrambler that meets the correlation requirement more than two less;
The sub-district of b, a basic scrambler to be allocated of selection is distributed to this first sub-district as first sub-district with the first maximum basic scrambler of occurrence number in the described basic scrambler combination table of step a;
C, select the sub-district adjacent, will be positioned at same delegation with the first basic scrambler in the described basic scrambler combination table of step a, and distribute to this second sub-district except that the second maximum basic scrambler of occurrence number of distributing to first sub-district as second sub-district with first sub-district;
D, under the constraint of basic scrambler combination table, the mode by diffusion be and the adjacent cell allocation base scrambler in definite basic scrambler sub-district to repeat this step, till being all cell allocation base scramblers.
Preferably, the described mode by diffusion of steps d for the process of the cell allocation base scrambler adjacent with the sub-district of determining basic scrambler is:
According to the basic scrambler that two neighbor cells have distributed, search basic scrambler combination table, be another cell allocation base scrambler simultaneously adjacent with these two neighbor cells.
Preferably, described is that another cell allocation base scrambler simultaneously adjacent with these two neighbor cells may further comprise the steps:
D1, basis have been distributed to the basic scrambler of first sub-district and second sub-district and have been searched basic scrambler combination table, to be positioned at the 3rd basic scrambler of delegation with the first basic scrambler and the second basic scrambler and distribute to the 3rd sub-district, described the 3rd sub-district is simultaneously adjacent with second sub-district with first sub-district;
D2, basis have been distributed to the basic scrambler of first sub-district and the 3rd sub-district and have been searched basic scrambler combination table, will be positioned at the 4th basic scrambler of delegation with the first basic scrambler and the 3rd basic scrambler and distribute to the 4th sub-district; Described the 4th sub-district is simultaneously adjacent with the 3rd sub-district with first sub-district; By that analogy, all allocation base scrambler, execution in step d3 afterwards up to all sub-districts of an adjacent circle with first sub-district;
D3, choose adjacent with first sub-district one the circle in a sub-district as the first current sub-district, sub-district adjacent with current first sub-district that will be except that steps d 1 described first sub-district is as the 3rd sub-district, repeated execution of steps d2, all allocation base scrambler, execution in step d4 afterwards up to all sub-districts of an adjacent circle with this current first sub-district; And in the assigning process of this step, the neighbor cell of allocation base scrambler is directly skipped;
D4, repeated execution of steps d3 is till being all cell allocation base scramblers.
Preferably, described is that another cell allocation base scrambler simultaneously adjacent with these two neighbor cells may further comprise the steps:
D01, basis have been distributed to the basic scrambler of first sub-district and second sub-district and have been searched basic scrambler combination table, to be positioned at the 3rd basic scrambler of delegation with the first basic scrambler and the second basic scrambler and distribute to the 3rd sub-district, described the 3rd sub-district is simultaneously adjacent with second sub-district with first sub-district;
D02, basis have been distributed to the basic scrambler of second sub-district and the 3rd sub-district and have been searched basic scrambler combination table, to be positioned at the 4th basic scrambler of delegation with the second basic scrambler and the 3rd basic scrambler and distribute to the 4th sub-district, described the 4th sub-district is simultaneously adjacent with the 3rd sub-district with second sub-district;
D03, basis have been distributed to the basic scrambler of second sub-district and the 4th sub-district and have been searched basic scrambler combination table, to be positioned at the 5th basic scrambler of delegation with the second basic scrambler and the 4th basic scrambler and distribute to the 5th sub-district, described the 5th sub-district is simultaneously adjacent with the 4th sub-district with second sub-district; Perhaps,
Search basic scrambler combination table according to the basic scrambler of distributing to the 3rd sub-district and the 4th sub-district, to be positioned at the 5th basic scrambler of delegation with the 3rd basic scrambler and the 4th basic scrambler and distribute to the 5th sub-district, described the 5th sub-district is simultaneously adjacent with the 4th sub-district with the 3rd sub-district;
By that analogy, till being all cell allocation base scramblers.
Preferably, the described mode by diffusion of steps d for the process of the cell allocation base scrambler adjacent with the sub-district of determining basic scrambler is:
According to the basic scrambler that the cluster sub-district of determining basic scrambler is distributed, search basic scrambler combination table, will be positioned at other basic scramblers except that distributing to this bunch sub-district with this cluster base scrambler with delegation, distribute to another bunch sub-district adjacent with this bunch sub-district;
Repeat above-mentioned steps, till being all cell allocation base scramblers;
Real cell number in another bunch sub-district that the number of actual sub-district is adjacent with this bunch sub-district in the cluster sub-district of described definite basic scrambler determines that according to actual needs both are identical or different;
The number sum of the number of the basic scrambler that the number of the basic scrambler of delegation is distributed more than or equal to the cluster sub-district of determining basic scrambler in the described basic scrambler combination table and the needed basic scrambler in another bunch sub-district to be allocated.
Preferably, when a plurality of candidates base scrambler that meets the demands is arranged in the basic scrambler combination table, select any one basic scrambler wherein, perhaps, be chosen in the more basic scrambler of occurrence number in the basic scrambler combination table, as the basic scrambler of current area.
Preferably, this method further comprises: for described current area is made a mark, be the sub-district of selecting basic scrambler from a plurality of candidate's base scramblers that meet the demands to show this current sub-district;
When can not find the basic scrambler that meets the demands in the process of distributing in the back, return back to markd sub-district, change the basic scrambler that another one meets the demands for this sub-district, re-execute subsequent operation again.
Preferably, when not having the candidate's base scrambler that meets the demands in the basic scrambler combination table, further comprise: relax the compound key related condition, for sub-district to be allocated or cluster cell selecting satisfy basic scrambler after softening terms, the basic scrambler after this is softened terms is positioned at described basic scrambler combination table.
Preferably, the described yard related condition that relaxes includes but not limited to correlation under the identical time delay is amplified, or the time delay number that compares when calculating correlation reduces.
Preferably, do not exist the candidate base scrambler that meets the demands to be in the described basic scrambler combination table, when searching another or cluster base scrambler according to the basic scrambler that has distributed, the described basic scrambler that has distributed is not in the same delegation of basic scrambler combination table.
Key of the present invention is, obtain to meet the basic scrambler combination table of compound key related condition according to planning requirement, afterwards, determine the basic scrambler of two adjacent sub-districts, then under the constraint of basic scrambler combination table, mode by diffusion be and the adjacent cell allocation base scrambler in definite basic scrambler sub-district to repeat this allocation step, till being all cell allocation base scramblers.Use the present invention, make the compound key correlation of any adjacent two sub-districts all satisfy the requirement of planning, optimizedly accomplished that basic scrambler distributes, thereby better improved systematic function, and can finish planning fast by tabling look-up.
Description of drawings
Fig. 1 uses the schematic flow sheet that the present invention realizes thinking;
Fig. 2 is the cellular cell structural representation.
Embodiment
Below in conjunction with drawings and the specific embodiments, the present invention is described in further detail again.
Core of the present invention realizes thinking as shown in Figure 1:
Step 101, acquisition meets the basic scrambler combination table of compound key related condition according to planning requirement, and whenever walking to of this base scrambler combination table comprises the basic scrambler that meets the correlation requirement more than two less.
Step 102 is determined the basic scrambler of two adjacent sub-districts.
Step 103, under the constraint of basic scrambler combination table, the mode by diffusion be and the adjacent cell allocation base scrambler in definite basic scrambler sub-district to repeat this allocation step, till being all cell allocation base scramblers.
Describe below in conjunction with specific embodiment.
Embodiment one:
The applicant propose in please number be " 200610057869.5 ", denomination of invention is in the patent application of " scrambling code distribution method that reduces the CDMA mobile communication systems co-channel interference ", having added conditions such as time delay analyzes basic scrambler, obtained scrambler group maximum correlation combination table (table 2), this application is divided into four classes with 66 groups of base scrambler groups according to the maximum correlation of scrambler group, be respectively 0.625,0.75,0.875 and 1.And further the ordering of the compound key maximum correlation average in this four classes scrambler group is obtained compound key maximum correlation average combination table (table 3), drawing basic scrambler group (7,12) is optimum scrambler group, is (1,2) secondly, (1,5) ... etc. basic scrambler group.
Figure A20061006683600101
Table 2 scrambler group maximum correlation combination table
Table 3 compound key maximum correlation average combination table
By maximum related value in the examination table 2 is 0.625 scrambler group, can find that 3 basic scrambler two two correlation maximums are 8 groups only smaller or equal to 0.625 combination, sees Table 4,
Base scrambler 1 Base scrambler 2 Base scrambler 3
1 2 6
1 2 7
1 5 7
1 5 11
1 6 9
1 7 10
1 7 12
1 8 11
Table 4 two two correlation maximums are all smaller or equal to 8 kinds of combinations of 0.625
Referring to table 4, in each row between the compound key of 3 basic scrambler correspondences two two correlation maximums all smaller or equal to 0.625.Analytical table 4 can find that No. 1 basic scrambler occurs 8 times, and No. 7 basic scrambler occurs 4 times, and 2,5,6, No. 11 basic scrambler occurs 2 times, and 8,9,10, No. 12 basic scrambler occurs 1 time.
Be combined as the basic scrambling code distribution method that example explanation the present invention provides with two two correlation maximums smaller or equal to 0.625 8 kinds below, certainly require under the situation different at physical planning with simulated conditions, the basic scrambler combination table that satisfies planning requirement that obtains is also different, just as example, be not limited in this table herein.
Step 1, the requirement according to planning obtains qualified basic scrambler combination table, as table 4.
Step 2, with a sub-district is first sub-district, this sub-district also can be called as center cell, selects a basic scrambler to distribute to this sub-district in basic scrambler combination table, and the strategy of selection is: the basic scrambler that occurrence number is maximum in the basic scrambler combination table is distributed to this first sub-district.
Step 3 selects adjacent sub-district, one and first sub-district as second sub-district, will be positioned at same delegation with the first basic scrambler in the described basic scrambler combination table, and removes the second maximum basic scrambler of occurrence number of distributing to first sub-district and distribute to this second sub-district.
Step 4 is a benchmark with the center cell, to an adjacent circle sub-district of center cell, in certain sequence as clockwise or counterclockwise carry out basic scrambling code planning.Specific as follows:
Search basic scrambler combination table according to the basic scrambler of distributing to first sub-district and second sub-district, will be positioned at the 3rd basic scrambler of delegation with the first basic scrambler and the second basic scrambler and distribute to the 3rd sub-district, the 3rd sub-district is simultaneously adjacent with second sub-district with first sub-district.
For example, referring to Fig. 2 and table 4, the hexagon among Fig. 2 is represented each cellular cell, and for sake of convenience, each sub-district is distinguished with numeral, as is numbered 1 sub-district, is numbered 2 sub-district ...Like this, at first No. 1 basic scrambler is distributed to center cell and is 1 the sub-district of being numbered among Fig. 2, it also is above-mentioned first sub-district, then No. 7 basic scramblers are distributed to and be numbered 2 sub-district, also be above-mentioned second sub-district, afterwards according to searching the i.e. table 4 of basic scrambler combination table, as can be known simultaneously with satisfy that correlation requires for No. 1, No. 7 what promptly be positioned at same row is 2,5,10, No. 12 basic scramblers, referring to the dash area in the table 4, can distribute to one of them the 3rd sub-district this moment.If No. 5 basic scramblers have been distributed to the 3rd sub-district herein, promptly the 3rd what be assigned with basic scrambler is to be numbered 3 sub-district.
Afterwards, search basic scrambler combination table, will be positioned at the 4th basic scrambler of delegation with the first basic scrambler and the 3rd basic scrambler and distribute to the 4th sub-district according to the basic scrambler of distributing to first sub-district and the 3rd sub-district; The 4th sub-district is simultaneously adjacent with the 3rd sub-district with first sub-district; Referring to Fig. 2 and table 4, if No. 11 basic scramblers have been distributed to the 4th sub-district herein, promptly the 4th what be assigned with basic scrambler is to be numbered 4 sub-district.
By that analogy, allocation base scrambler all up to all sub-districts of an adjacent circle with first sub-district.
Step 5, a sub-district of choosing in the adjacent circle with first sub-district is current center cell as the first current sub-district, to be that an adjacent sub-district of center cell is as the 3rd current sub-district except that first sub-district described first sub-district of step 3 with current, repeated execution of steps 4, up to all sub-districts of this current adjacent figure in first sub-district allocation base scrambler all; In the assigning process of this step, the neighbor cell of allocation base scrambler is directly skipped.
For example,, suppose to choose that to be numbered 7 sub-district be that the first current sub-district is a center cell, choose and be numbered 2 sub-district, like this, just can carry out subsequent operation according to step 4 as the 3rd current sub-district referring to Fig. 2 and table 4.
Step 6, repeated execution of steps 5 is up to being all sub-districts that need plan all till the allocation base scrambler.
Embodiment two:
First three step is identical with the execution mode of embodiment one.
Step 1, the requirement according to planning obtains qualified basic scrambler combination table, as table 4.
Step 2 is first sub-district with a sub-district, selects a basic scrambler to distribute to this sub-district in basic scrambler combination table, and the strategy of selection is: the basic scrambler that occurrence number is maximum in the basic scrambler combination table is distributed to this first sub-district.
Step 3 selects adjacent sub-district, one and first sub-district as second sub-district, will be positioned at same delegation with the first basic scrambler in the described basic scrambler combination table, and removes the second maximum basic scrambler of occurrence number of distributing to first sub-district and distribute to this second sub-district.
Step 4 according to adjacent two sub-districts of determining basic scramblers, is determined another and this all adjacent sub-district, two sub-districts.No longer include the notion of center cell this moment.Be specially:
At first, search basic scrambler combination table according to the basic scrambler of distributing to first sub-district and second sub-district, to be positioned at the 3rd basic scrambler of delegation with the first basic scrambler and the second basic scrambler and distribute to the 3rd sub-district, the 3rd sub-district is simultaneously adjacent with second sub-district with first sub-district;
For example, referring to Fig. 2 and table 4, at first No. 1 basic scrambler is distributed to center cell and is 1 the sub-district of being numbered among Fig. 2, also being above-mentioned first sub-district, then No. 7 basic scramblers being distributed to and be numbered 2 sub-district, also is above-mentioned second sub-district, afterwards according to searching the i.e. table 4 of basic scrambler combination table, as can be known simultaneously with satisfy that correlation requires for No. 1, No. 7 what promptly be positioned at same row is 2,5,10, No. 12 basic scramblers, referring to the dash area in the table 4, can distribute to one of them the 3rd sub-district this moment.If No. 5 basic scramblers have been distributed to the 3rd sub-district herein, promptly the 3rd what be assigned with basic scrambler is to be numbered 3 sub-district.
Secondly, search basic scrambler combination table according to the basic scrambler of distributing to second sub-district and the 3rd sub-district, to be positioned at the 4th basic scrambler of delegation with the second basic scrambler and the 3rd basic scrambler and distribute to the 4th sub-district, the 4th sub-district is simultaneously adjacent with the 3rd sub-district with second sub-district.Referring to Fig. 2 and table 4, if No. 11 basic scramblers have been distributed to the 10th sub-district herein, promptly the 4th what be assigned with basic scrambler is to be numbered 10 sub-district.
Afterwards, search basic scrambler combination table according to the basic scrambler of distributing to second sub-district and the 4th sub-district, to be positioned at the 5th basic scrambler of delegation with the second basic scrambler and the 4th basic scrambler and distribute to the 5th sub-district, the 5th sub-district is simultaneously adjacent with the 4th sub-district with second sub-district; Perhaps, search basic scrambler combination table according to the basic scrambler of distributing to the 3rd sub-district and the 4th sub-district, to be positioned at the 5th basic scrambler of delegation with the 3rd basic scrambler and the 4th basic scrambler and distribute to the 5th sub-district, the 5th sub-district is simultaneously adjacent with the 4th sub-district with the 3rd sub-district.Referring to Fig. 2 and table 4, that is to say that the 5th what be assigned with basic scrambler may be to be numbered 9 sub-district, also may be to be numbered 11 sub-district.
By that analogy, till being all cell allocation base scramblers.
Though the juche idea of above-mentioned two embodiment all is: the basic scrambler that has distributed according to two neighbor cells, search basic scrambler combination table, be another cell allocation base scrambler simultaneously adjacent with these two neighbor cells, but it is slightly different in the specific implementation, embodiment one is an outside expansion of enclosing, up to being all sub-districts that need plan all till the allocation base scrambler; A notion of enclose not among the embodiment two, as long as but know two adjacent sub-districts basic scrambler separately, can determine the basic scrambler of another sub-district adjacent with this two adjacent sub-district while.
Embodiment three:
First three step is identical with the execution mode of embodiment one.
Step 1, the requirement according to planning obtains qualified basic scrambler combination table, as table 4.
Step 2 is first sub-district with a sub-district, selects a basic scrambler to distribute to this sub-district in basic scrambler combination table, and the strategy of selection is: the basic scrambler that occurrence number is maximum in the basic scrambler combination table is distributed to this first sub-district.
Step 3 selects adjacent sub-district, one and first sub-district as second sub-district, will be positioned at same delegation with the first basic scrambler in the described basic scrambler combination table, and removes the second maximum basic scrambler of occurrence number of distributing to first sub-district and distribute to this second sub-district.
Step 4, basis have been determined the basic scrambler that the cluster sub-district of basic scrambler is distributed, search basic scrambler combination table, to be positioned at other basic scramblers except that distributing to this bunch sub-district with this cluster base scrambler, distribute to another bunch sub-district adjacent with this bunch sub-district with delegation; Repeat this step, till being all cell allocation base scramblers.
In this example, determined that the real cell number in sub-district number actual in the cluster sub-district of basic scrambler another bunch sub-district adjacent with this bunch sub-district all is definite according to actual needs, both can be identical or different, for example, referring to Fig. 2, can be by being numbered 2, the basic scrambler of 3 these cluster sub-districts, determine to be numbered 10, the basic scrambler of 11 these another bunch sub-districts, perhaps, by being numbered 2, the basic scrambler of 3 these cluster sub-districts, determine to be numbered 9,10,11, the basic scrambler of 12 these another bunch sub-districts, again or, along with the increase of the sub-district of determining basic scrambler, can be by being numbered 3,4, the basic scrambler of 5 these cluster sub-districts, determine to be numbered 12, the basic scrambler of 13 these another bunch sub-districts, or the like.In a word, concrete implementation is very flexible, can determine according to actual needs.
And, in this example in the basic scrambler combination table number of the basic scrambler of delegation be greater than the number of the basic scrambler that the cluster sub-district that equals to determine basic scrambler is distributed and the number sum of the needed basic scrambler in another bunch sub-district to be allocated.
Embodiment three with the identical point of embodiment one, two is: the outside allocation base scrambler of mode that all passes through diffusion; Difference is: embodiment three is that the distribution of cluster cluster distributes promptly for simultaneously a plurality of sub-districts simultaneously, rather than distribution one by one.The obvious efficient of this method of salary distribution is very high, but the disposable power that is distributed into is relatively low.
Certainly, the execution mode of embodiment three both can together use with embodiment one or two mode, also can use separately.
Among above-mentioned all embodiment, first sub-district of being mentioned, second sub-district ... or the like, only be to distinguish different sub-districts for sake of convenience, its not necessarily be exactly among Fig. 2 numbering not necessarily one to one, for example, first sub-district can be to be numbered 1 sub-district among Fig. 2, also can not be.
Have again, among above-mentioned all embodiment, the first basic scrambler of being mentioned, the second basic scrambler ... or the like, its implication only refers to that the basic scrambler of distributing to described first sub-district is called as the first basic scrambler, and the basic scrambler of distributing to described second sub-district is called as the second basic scrambler ... be not that each basic scrambler is different fully, for example, the first basic scrambler might be identical with the concrete numerical value of the tenth basic scrambler, neither say the position of each basic scrambler each row in basic scrambler combination table.And, according to definition of the present invention, though basic scrambler has only 12, should will pentadecyl scrambler, nouns such as pentacontyl scrambler appear.
In addition, what time need explanation in addition:
When searching basic scrambler combination table, the situation of a plurality of candidate's base scramblers that meet the demands might appear having in the basic scrambler combination table, at this moment, can select any one basic scrambler wherein, also can be chosen in the more basic scrambler of occurrence number in the basic scrambler combination table, can from the identical basic scrambler of this occurrence number, choose one wantonly if number of times is identical, as the basic scrambler of current sub-district to be allocated.On this basis, can further make a mark for this current sub-district, be to choose from a plurality of candidate's base scramblers that meet the demands with the basic scrambler that shows this current sub-district.Like this, in the process of Fen Peiing,, can return back to markd sub-district in the back, for this sub-district changing the basic scrambler that another one meets the demands, and then re-execute subsequent step if can not find the basic scrambler that meets the demands.
Have again, because the sub-district is irregular distribution in the actual environment, thereby may there be the situation that does not have the candidate's base scrambler that meets the demands in the basic scrambler combination table, can relax the compound key related condition this moment, for sub-district to be allocated or cluster cell selecting satisfy basic scrambler after softening terms, basic scrambler after this is softened terms is positioned at described basic scrambler combination table, makes like this can revert to as soon as possible in follow-up implementation to find the candidate's base scrambler that meets the demands from basic scrambler combination table.The above-mentioned yard related condition that relaxes includes but not limited to correlation under the identical time delay is amplified, or the time delay number that compares when calculating correlation reduces.
Do not exist the candidate base scrambler that meets the demands to be in the described basic scrambler combination table, when searching another or cluster base scrambler according to the basic scrambler that has distributed, the described basic scrambler that has distributed is not in the same delegation of basic scrambler combination table.
Use method of the present invention and be in the system behind all cell allocation base scramblers, can make the compound key correlation of any adjacent two sub-districts all satisfy the requirement of planning.And, the follow-up code word planning that can continue to finish the TD-SCDMA system according to the step that comprises in the TD-SCDMA systematic codeword planing method that has the proposition of patent or additive method now.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.All any modifications of being done within the spirit and principles in the present invention, be equal to replacement, improvement etc., all be included in protection scope of the present invention.

Claims (10)

1, the implementation method of allocation base scrambler in a kind of time-division-synchronization code multi-address division system is characterized in that this method may further comprise the steps:
A, obtain to meet the basic scrambler combination table of compound key related condition according to planning requirement; Whenever walking to of described basic scrambler combination table comprises the basic scrambler that meets the correlation requirement more than two less;
The sub-district of b, a basic scrambler to be allocated of selection is distributed to this first sub-district as first sub-district with the first maximum basic scrambler of occurrence number in the described basic scrambler combination table of step a;
C, select the sub-district adjacent, will be positioned at same delegation with the first basic scrambler in the described basic scrambler combination table of step a, and distribute to this second sub-district except that the second maximum basic scrambler of occurrence number of distributing to first sub-district as second sub-district with first sub-district;
D, under the constraint of basic scrambler combination table, the mode by diffusion be and the adjacent cell allocation base scrambler in definite basic scrambler sub-district to repeat this step, till being all cell allocation base scramblers.
2, method according to claim 1 is characterized in that, the described mode by diffusion of steps d for the process of the cell allocation base scrambler adjacent with the sub-district of determining basic scrambler is:
According to the basic scrambler that two neighbor cells have distributed, search basic scrambler combination table, be another cell allocation base scrambler simultaneously adjacent with these two neighbor cells.
3, method according to claim 2 is characterized in that, described is that another cell allocation base scrambler simultaneously adjacent with these two neighbor cells may further comprise the steps:
D1, basis have been distributed to the basic scrambler of first sub-district and second sub-district and have been searched basic scrambler combination table, to be positioned at the 3rd basic scrambler of delegation with the first basic scrambler and the second basic scrambler and distribute to the 3rd sub-district, described the 3rd sub-district is simultaneously adjacent with second sub-district with first sub-district;
D2, basis have been distributed to the basic scrambler of first sub-district and the 3rd sub-district and have been searched basic scrambler combination table, will be positioned at the 4th basic scrambler of delegation with the first basic scrambler and the 3rd basic scrambler and distribute to the 4th sub-district; Described the 4th sub-district is simultaneously adjacent with the 3rd sub-district with first sub-district; By that analogy, all allocation base scrambler, execution in step d3 afterwards up to all sub-districts of an adjacent circle with first sub-district;
D3, choose adjacent with first sub-district one the circle in a sub-district as the first current sub-district, sub-district adjacent with current first sub-district that will be except that steps d 1 described first sub-district is as the 3rd sub-district, repeated execution of steps d2, all allocation base scrambler, execution in step d4 afterwards up to all sub-districts of an adjacent circle with this current first sub-district; And in the assigning process of this step, the neighbor cell of allocation base scrambler is directly skipped;
D4, repeated execution of steps d3 is till being all cell allocation base scramblers.
4, method according to claim 2 is characterized in that, described is that another cell allocation base scrambler simultaneously adjacent with these two neighbor cells may further comprise the steps:
D01, basis have been distributed to the basic scrambler of first sub-district and second sub-district and have been searched basic scrambler combination table, to be positioned at the 3rd basic scrambler of delegation with the first basic scrambler and the second basic scrambler and distribute to the 3rd sub-district, described the 3rd sub-district is simultaneously adjacent with second sub-district with first sub-district;
D02, basis have been distributed to the basic scrambler of second sub-district and the 3rd sub-district and have been searched basic scrambler combination table, to be positioned at the 4th basic scrambler of delegation with the second basic scrambler and the 3rd basic scrambler and distribute to the 4th sub-district, described the 4th sub-district is simultaneously adjacent with the 3rd sub-district with second sub-district;
D03, basis have been distributed to the basic scrambler of second sub-district and the 4th sub-district and have been searched basic scrambler combination table, to be positioned at the 5th basic scrambler of delegation with the second basic scrambler and the 4th basic scrambler and distribute to the 5th sub-district, described the 5th sub-district is simultaneously adjacent with the 4th sub-district with second sub-district; Perhaps,
Search basic scrambler combination table according to the basic scrambler of distributing to the 3rd sub-district and the 4th sub-district, to be positioned at the 5th basic scrambler of delegation with the 3rd basic scrambler and the 4th basic scrambler and distribute to the 5th sub-district, described the 5th sub-district is simultaneously adjacent with the 4th sub-district with the 3rd sub-district;
By that analogy, till being all cell allocation base scramblers.
5, method according to claim 1 is characterized in that, the described mode by diffusion of steps d for the process of the cell allocation base scrambler adjacent with the sub-district of determining basic scrambler is:
According to the basic scrambler that the cluster sub-district of determining basic scrambler is distributed, search basic scrambler combination table, will be positioned at other basic scramblers except that distributing to this bunch sub-district with this cluster base scrambler with delegation, distribute to another bunch sub-district adjacent with this bunch sub-district;
Repeat above-mentioned steps, till being all cell allocation base scramblers;
Real cell number in another bunch sub-district that the number of actual sub-district is adjacent with this bunch sub-district in the cluster sub-district of described definite basic scrambler determines that according to actual needs both are identical or different;
The number sum of the number of the basic scrambler that the number of the basic scrambler of delegation is distributed more than or equal to the cluster sub-district of determining basic scrambler in the described basic scrambler combination table and the needed basic scrambler in another bunch sub-district to be allocated.
6, according to claim 3,4 or 5 described methods, it is characterized in that, when a plurality of candidates base scrambler that meets the demands is arranged in the basic scrambler combination table, select any one basic scrambler wherein, perhaps, be chosen in the more basic scrambler of occurrence number in the basic scrambler combination table, as the basic scrambler of current area.
7, method according to claim 6 is characterized in that, this method further comprises: for described current area is made a mark, be the sub-district of selecting basic scrambler from a plurality of candidate's base scramblers that meet the demands to show this current sub-district;
When can not find the basic scrambler that meets the demands in the process of distributing in the back, return back to markd sub-district, change the basic scrambler that another one meets the demands for this sub-district, re-execute subsequent operation again.
8, method according to claim 7, it is characterized in that, when not having the candidate's base scrambler that meets the demands in the basic scrambler combination table, further comprise: relax the compound key related condition, for sub-district to be allocated or cluster cell selecting satisfy basic scrambler after softening terms, the basic scrambler after this is softened terms is positioned at described basic scrambler combination table.
9, method according to claim 8 is characterized in that, the described yard related condition that relaxes includes but not limited to correlation under the identical time delay is amplified, or the time delay number that compares when calculating correlation reduces.
10, method according to claim 8, it is characterized in that, do not exist the candidate base scrambler that meets the demands to be in the described basic scrambler combination table, when searching another or cluster base scrambler according to the basic scrambler that has distributed, the described basic scrambler that has distributed is not in the same delegation of basic scrambler combination table.
CNA2006100668367A 2006-03-29 2006-03-29 Method for distributing base disturbance code in time-division-synchronous CDMA system Pending CN101047424A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2006100668367A CN101047424A (en) 2006-03-29 2006-03-29 Method for distributing base disturbance code in time-division-synchronous CDMA system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2006100668367A CN101047424A (en) 2006-03-29 2006-03-29 Method for distributing base disturbance code in time-division-synchronous CDMA system

Publications (1)

Publication Number Publication Date
CN101047424A true CN101047424A (en) 2007-10-03

Family

ID=38771697

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2006100668367A Pending CN101047424A (en) 2006-03-29 2006-03-29 Method for distributing base disturbance code in time-division-synchronous CDMA system

Country Status (1)

Country Link
CN (1) CN101047424A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223725A (en) * 2010-04-19 2011-10-19 普天信息技术研究院有限公司 Scrambling code distribution method
CN102546076A (en) * 2011-12-05 2012-07-04 浙江大学 Method and system for distributing scrambling codes of TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) network

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223725A (en) * 2010-04-19 2011-10-19 普天信息技术研究院有限公司 Scrambling code distribution method
CN102223725B (en) * 2010-04-19 2013-11-20 普天信息技术研究院有限公司 Scrambling code distribution method
CN102546076A (en) * 2011-12-05 2012-07-04 浙江大学 Method and system for distributing scrambling codes of TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) network
CN102546076B (en) * 2011-12-05 2014-06-04 浙江大学 Method and system for distributing scrambling codes of TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) network

Similar Documents

Publication Publication Date Title
CN1206870C (en) Method for communication scrambling code ID in mobile communication system
CN1150796C (en) Method and apparatus for soft handoff in a CDMA communication system
CN1190016C (en) Device for obtaining pseudo-noise code and direct DSDMA receiver
CN1977468A (en) Method and arrangement for mitigation of intercell interference in a cellular communication system
CN1541493A (en) Method and appts. for orthogonal code management in CDMA systems using smart antenna tech background
CN101030828A (en) Disturbed code distribution for decreasing CDMA mobile telecommunication system same frequency interference
CN1862980A (en) Method for allocating multiple basic intermediate codes
CN1925376A (en) Descending main scrambling code optimum distribution method in broad band CDMA system
CN1768546A (en) Wireless channel distribution method
CN101064551A (en) Scrambling code distribution method for CDMA system
CN101047424A (en) Method for distributing base disturbance code in time-division-synchronous CDMA system
CN1893316A (en) Base station and method for allocating HS-DSCH channelisation codes in a wireless communication system
CN1707974A (en) Cell scramble distributing method for time division-synchronous code division multiple access system
CN100369401C (en) Method of uplink scrambling code distribution in WCDMA system
CN1886924A (en) Method and system for allocation of channelisation codes in a CDMA system
CN101345547B (en) Method and apparatus for optimized distribution of scrambler resource in TDD system
CN1694380A (en) Configuration method of cell code source in time-division synchronous CDMA system group network
CN1241345C (en) Channelizing code resource dynamic optimization distribution method of wideband CDMA system
CN100461931C (en) Dowlink disturbant-code dynamic distribution of wireless telecommunication network
CN1556601A (en) PN programming method used for CDMA honeycomb system
CN101119575A (en) Scrambling planning method of WCDMA wireless network planning
CN1787414A (en) Method for realizing optimizing code planning CDMA system
CN1201514C (en) Implement method of ternary spread spectrum sequence coding in CDMA system
CN1878044A (en) Channelization code allocation method
CN1913695A (en) Method for reducing co-channel interference in sector interval

Legal Events

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

Open date: 20071003