CN101110603A - Code division multiple access system scramble distribution method based on time-delay characteristic - Google Patents

Code division multiple access system scramble distribution method based on time-delay characteristic Download PDF

Info

Publication number
CN101110603A
CN101110603A CNA2006100888070A CN200610088807A CN101110603A CN 101110603 A CN101110603 A CN 101110603A CN A2006100888070 A CNA2006100888070 A CN A2006100888070A CN 200610088807 A CN200610088807 A CN 200610088807A CN 101110603 A CN101110603 A CN 101110603A
Authority
CN
China
Prior art keywords
scrambler
scrambling
delay
sub
district
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
Application number
CNA2006100888070A
Other languages
Chinese (zh)
Other versions
CN100502252C (en
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.)
China Academy of Telecommunications Technology CATT
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 CNB2006100888070A priority Critical patent/CN100502252C/en
Publication of CN101110603A publication Critical patent/CN101110603A/en
Application granted granted Critical
Publication of CN100502252C publication Critical patent/CN100502252C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The present invention discloses a CDMA system scrambling programming method based on lag characteristics, which includes that lag probability distribution information amongst interference signals of different users in a network. Lags are distributed and mapped to 0-4 coding frames according to lag mapping rules. It is necessary to set scrambling programming rules of varied levels according to preset rules, distribute base scrambling based on the scrambling programming rule, confirm relation amongst communities, adopt different downlink pilot frequency group rule for two adjacent communities and map the base scrambling to the scrambling. Having taken impact of asynchrony of adjacent communities under actual network environment on the scrambling programming into a full consideration, the present invention can decrease complexity of code word programming, optimize scrambling distribution plan and improve system performance.

Description

A kind of code division multiple access system scrambling code distribution method based on time-delay characteristics
Technical field
The present invention relates to the collocation method of code source in code division multiple access (CDMA) networking, relate in particular to the collocation method of the district code word resource of TD SDMA (TD-SCDMA) mobile communication system.
Background technology
In the 3rd generation,, (3G) mobile communication system extensively adopted the access mode based on CDMA, distinguished different users with different code words.Specific implementation is to adopt scrambler to distinguish between the sub-district, adopts orthogonal variable spreading factor sign indicating number (0VSF, Orthogonal Variable SpreadingFactor) sign indicating number to distinguish the user in the sub-district.In order to realize the beehive net structure, different cdma systems has all defined different separately code words and has used and allocative decision, so that be that actual cellular cell carries out scrambling code planning.
In the 3GPP standard, stipulated that 128 scramblers are divided into 32 groups in the TD-SCDMA system, every group comprises 4 scramblers, and its basic grouped is as shown in table 1.
TD-SCDMA scrambler grouping in the table 13GPP standard
Code character Code word
SYNC-DL ID SYNC-UL ID Scrambling Code ID Basic Midamble Code ID
Group
1 0 0...7 0 0
1 1
2 2
3 3
Group 2 1 8...15 4 4
5 5
6 6
7 7
……
Group 32 31 248...255 124 124
125 125
126 126
127 127
In the table 1, every code character comprises 1 downlink frequency pilot code, 8 ascending pilot frequency sign indicating numbers, 4 scramblers and 4 basic Midamble sign indicating numbers, and its basic corresponding relation is as follows:
Each downlink frequency pilot code is corresponding one by one with the code character that 8 ascending pilot frequency sign indicating numbers are formed;
Each downlink frequency pilot code is corresponding one by one with the code character that 4 scramblers are formed;
Each downlink frequency pilot code is corresponding one by one with the code character that 4 basic Midamble sign indicating numbers are formed;
Scrambler is corresponding one by one with basic Midamble sign indicating number.
Actual mobile communications network is built for the requirement of the mobile communication business that satisfies corresponding specific geographical area, because the factors such as difficulty of the base station siting of station in the complexity of different geographic area wireless propagation environment, the inhomogeneities of various area communication traffic carrying capacitys and the networking, cause mobile communications network cellular topology structure often to have unusual complexity.For each cell allocation scrambler of forming actual cellular network is a important step in the cdma system network planning process.The scrambler allocative decision of an optimization can reduce the generation and the unnecessary signaling interaction control procedure of unusual call drop phenomenon significantly, therefore, the effect quality direct relation of scrambler distribution the overall performance of wireless network and the operation stability of wireless network infrastructure device.
Under the constraints of the listed various code word corresponding relations of table 1, the actual requirement that scrambler distributes divides timing at scrambler exactly, guarantees not have between the neighbor cell scrambler and the downlink frequency pilot code of repetition.For this reason, a simple scrambler allocation step is as follows:
1, the downlink frequency pilot code that is fit to for each cell selecting;
2, scrambler that from 4 scramblers of downlink frequency pilot code correspondence, is fit to and basic Midamble sign indicating number for each cell selecting;
Though this step is fairly simple, can satisfy the basic demand shown in the table 1.But, for this time division duplexing-CDMA mobile communication system of TD-SCDMA, owing to adopted short spreading factor, it only is 16 chips (Chip) that system can use maximum spreading factor, and the length of each scrambler also is 16 chips, to be exactly not enough guarantee less cross correlation so that distinguish the code channel of neighbor cell different user to this less spreading factor existing questions, thereby bring difficulty for the continuous covering networking of system.
For this reason, the application number that our company submits to is 200410048702.3, the TD-SCDMA system scrambler grouping scheme that provides in the Chinese patent application of " the scrambler differentiating method of time-division-synchronization code multi-address division system and code word division methods " is provided name, correlation properties under the AWGN condition have been divided into 12 groups with 128 scramblers according to scrambler and spreading code formation compound key, when the planning scrambler, all scrambler correlation properties in every group of scrambler all are consistent, can reduce the complexity of scrambling code planning like this.
Yet this grouping scheme has been ignored the multipath effect in the actual channel, and when two code channels were not ideal synchronisation, correlation properties just had difference.The application number that our company submits to is 200610057869.5, name is called in the scheme that the Chinese patent application of " scrambling code distribution method that reduces the CDMA mobile communication systems co-channel interference " provides, 0 to the 15chip scrambler correlation that postpones is studied, and defined parameter scrambler maximum correlation, maximum correlation probability between scrambler, scrambler maximum correlation average, variance, utilize these parameters can more comprehensively study correlation between the scrambler, and provided a preliminary planning criterion.But this scheme has only provided the maximum in certain delay scope, and has ignored the probability of happening of different delays.Owing to do not consider the different their cross correlations that postpone under the side-play amount between the compound key, can not fully reduce the co-channel interference in the real network.Therefore, need be optimized, to improve the overall performance and the network operation stability of mobile communications network to existing scrambler allocative decision.
Summary of the invention
In view of this, the technical problem to be solved in the present invention provides a kind of cdma system scrambling planning method based on lag characteristic, to optimize the scrambler allocative decision, improves the overall performance and the network operation stability of mobile communications network.
A kind of scrambling planning method based on lag characteristic provided by the invention comprises:
Obtain delay probability distributed intelligence between the interference signal of different user in the network;
To postpone distribution according to delay mapping criterion and be mapped to the 0-4 chip, wherein delay mapping criterion is:
To postpone the probability addition of 0,8 chips,
To postpone the probability addition of 1,7,9,15 chips,
To postpone the probability addition of 2,6,10,14 chips,
To postpone the probability addition of 3,5,11,13 chips,
To postpone the probability addition of 4,12 chips, obtain a probability density distribution that postpones the 0-4 chip;
Determine the neighboring BS relationship between each sub-district, according to the scrambling code planning criterion of pre-defined rule setting different brackets, and according to this scrambling code planning criterion allocation base scrambler;
Adopt different descending pilot frequency group criterions for neighbor cell, basic scrambler is mapped to scrambler.
Described pre-defined rule comprises:
More little according to maximum correlation between two scramblers, the rule that priority is high more; Or
More little according to the maximum correlation average between two scramblers, the rule that priority is high more; Or
Determine priority according to the number that certain correlation in the relational pattern occurs, it is many more that number appears in this correlation, and priority is high more.
Preferablyly, according to the following step allocation base scrambler:
The sub-district that needs the allocation base scrambler according to the definite selective sequential of pre-defined rule;
Check all adjacent area base scrambler distribution condition of described sub-district;
Upgrade available basic scrambler set according to described scrambling code planning criterion;
From described available scrambler set, select a basic scrambler according to determined order, distribute to described sub-district.
Ground preferably is mapped to scrambler according to the following step with basic scrambler:
Select a sub-district according to predefined procedure;
In all scramblers of sub-district base scrambler correspondence, select a scrambler according to predefined procedure;
Check that whether selected scrambler belongs to same descending pilot frequency group with the scrambler that the adjacent area has been distributed;
If it does not belong to same descending pilot frequency group, then selected scrambler is distributed to this sub-district;
If belong to same descending pilot frequency group, according to the next scrambler of predefine selective sequential;
Continue to select next sub-district to carry out of the mapping of basic scrambler, until the mapping of finishing all cell scramblings to scrambler.
Preferably, set the grade of scrambling code planning criterion through the following steps:
All scramblers are combined in all relational pattern that obtain under the investigation delay sort, set the grade of this criterion according to the priority orders of described relational pattern.
By adopting system simulation method to obtain described delay probability distributed intelligence; Perhaps;
The delay probability of employing under general situations about occurring such as 0-15 chip delay distributes as described delay probability distributed intelligence.
Scrambler is divided into 48 families, consistent with all the scrambler delay groups in the gang with the relational pattern that other scrambler delay group forms.
When under all planning criterion constraints, in the time of can't finding suitable scrambler, gradually reduce the constraint of planning criterion according to priority order from low to high.
Correlation characteristics under all postponing less than the scrambler according to the TD-SCMDA system in the existing programme are set the scrambling code planning scheme.The result who cooks up can not reach optimum according to actual conditions, plans that perhaps complexity is higher.The present invention has considered the correlation characteristics of the scrambler of TD-SCMDA system under postponing, a kind of simple scrambling planning method is provided, by setting up and shining upon criterion according to delay, the delay probability distributed intelligence of network is mapped to corresponding chip, according to the scrambling code planning criterion allocation base scrambler of setting, scrambler branch family under obtaining postponing relation adopts the criterion of different descending pilot frequency groups at neighbor cell, and basic scrambler is mapped to scrambler.Under the situation that takes into full account the asynchronous influence to scrambling code planning in adjacent area under the real network environment, can reduce the complexity of code word planning, adopt scrambling planning method provided by the invention to carry out scrambling code planning in the real network, can reach optimized scrambler and distribute, improve systematic function.
Description of drawings
Fig. 1 is scrambling planning method flow chart according to an embodiment of the invention;
Fig. 2 is the base scrambler allocation flow figure of sub-district according to an embodiment of the invention;
Fig. 3 is the mapping flow chart of basic according to an embodiment of the invention scrambler to scrambler;
Fig. 4 is the network cell distributed architecture schematic diagram of CDMA mobile communication system;
Fig. 5 is the network topology schematic diagram of CDMA mobile communication system;
Table 101 is depicted as the relational pattern characteristic between the scrambler delay group;
The scrambler that table 102 is depicted as according to relational pattern 1 postpones group categories;
Table 103 to table 113 is respectively scrambler relational pattern 1 to scrambler relational pattern 11.
Embodiment
In view of different their cross correlations that postpone under the side-play amounts between the compound key in the cdma system, for reducing the co-channel interference in the real network as far as possible, the present invention proposes based on the scrambling planning method that postpones under the environment, core concept is: set up and according to postponing the mapping criterion, delay probability distributed intelligence between the interference signal of different user in the network is mapped to corresponding chip, according to the scrambling code planning criterion allocation base scrambler of setting, scrambler branch family relation under obtaining postponing, adopt the criterion of different descending pilot frequency groups at neighbor cell, basic scrambler is mapped to scrambler, thereby finishes the scrambler mapping of each sub-district.
For making principle of the present invention, characteristic and advantage clearer, describe the present invention below in conjunction with specific embodiment.
Below with reference to Fig. 1 according to a particular embodiment of the invention method flow is illustrated.
Step S01: the delay probability distributed intelligence in the acquisition network between the interference signal of different user, represent with the form of probability density distribution.The probability distribution that postpones between the interference signal about different user is described as follows: suppose to have base station A and base station B, user 1 serves base station A, user 2 serves base station B, because between the base station is synchronous, if 2 couples of users' 1 of user signal forms strong jamming, these two signals will inevitably exist a delay inequality, so-called probability distribution, just be meant in the whole network range or at specific cell, to the statistics of this interference signal delay inequality.
Concrete grammar can adopt system simulation method, or theoretical rough calculation.If can't obtain to postpone distributed intelligence accurately in the real network, can suppose that 0-15 chip delay equiprobability occurs, adopt the delay probability under general situations about occurring such as 0-15 chip delay to distribute as described delay probability distributed intelligence.
Step S02: will postpone the probability that distribution is mapped to delay 0-4 chip according to postponing the mapping criterion; It is as follows wherein to postpone the mapping criterion:
Postpone 0,8 chips and be combined into one group, be about to postpone the probability addition of 0,8 chips, in addition
Postpone 1,7,9,15 chips and be combined into one group,
Postpone 2,6,10,14 chips and be combined into one group,
Postpone 3,5,11,13 chips and be combined into one group,
Postpone 4,12 chips and be combined into one group, finally obtain a probability density distribution that postpones the 0-4 chip.
Step S 03: determine the neighboring BS relationship between each sub-district.
Specifically can or test the pilot frequency intensity that obtains according to reality and determine according to engineering experience.
Step S04: the scrambling code planning criterion of setting different brackets according to predetermined rule.
Any a pair of scrambler is combined under the different delays, can form different relational pattern, so-called relational pattern is meant, the correlation matrix of two scrambler formed 16*16 relevant 16*16 that obtain of compound key combination under specific delays, the scrambler relational pattern is specifically seen attached form and associated description; If the number that any one correlation occurs in the relational pattern equates, then is called identical relational pattern.
According to predetermined rule, as: the variance of the matrix that relational pattern forms is more little, and then priority is high approximately; Or (as scrambler SC1 and 16 16 compound keys that OVSF spreading code dot product obtains " and " between 16 compound keys that scrambler SC2 and 16 OVSF spreading code dot products obtain) maximum correlation is more little between the formed compound key of two scramblers, the criterions that priority is high more etc. are combined in all relational pattern that obtain under the investigation delay to all scramblers and sort.For any one relational pattern, the basic scrambler group that regulation produces this pattern does not allow to appear in the scrambler relational pattern of neighbor cell, and sets the grade of this criterion according to the priority orders of pattern.
The so-called investigation postpones to be meant: set a probable value thresholding, the set that all probable values are higher than the delay of this thresholding is called the investigation delay.
Step S05: use the scrambling code planning criterion allocation base scrambler of different brackets,, specifically comprise with reference to Fig. 2:
51) determine a sub-district that needs the allocation base scrambler according to the predefine order;
52) all adjacent areas of checking this sub-district situation of allocation base scrambler;
The planning criterion that 53) will set all is set to effectively; Promptly under all planning criterion constraints, select scrambler.
54) upgrade available basic scrambler set according to all effective criterions; When under all planning criterion constraints, in the time of can't finding suitable scrambler, gradually reduce the constraint of planning criterion, get rid of the lower planning criterion of priority earlier.That is to say, when the planning criterion of strictness can not satisfy, progressively abandon the lower planning criterion of priority, under the planning criterion constraint of other higher priorities, select scrambler.
55) check whether available basic scrambler set is empty; If then forward step 551 to; Otherwise, execution in step 552;
551) the minimum validity criteria of priority is set to invalidly, forwards step 54 to;
552) in the set of available scrambler according to predetermined basic scrambler of selective sequential;
56) upgrade basic scrambler allocation result;
57) whether check all allocation base scramblers of all sub-districts.If then finish the distribution of basic scrambler; Otherwise, change step 51, continue to select next sub-district to carry out basic scrambler and distribute.
Step S06: adopt the criterion of different descending pilot frequency groups according to neighbor cell, basic scrambler is mapped to scrambler.With reference to Fig. 3, specifically comprise:
61) according to sub-district of predefine selective sequential;
62) in all scramblers of sub-district base scrambler correspondence according to scrambler of predefine selective sequential;
63) check that whether this scrambler belongs to same descending pilot frequency group with the scrambler that the adjacent area has been distributed, if change step 631; Otherwise, change step 64.
631) according to the next scrambler of predefine selective sequential, change step 63.
64) this scrambler is distributed to this sub-district;
65) check the mapping whether all sub-districts have all been finished scrambler.If then finish; Otherwise, execution in step 66;
66) according to the next sub-district of predefine selective sequential, forward step 62 to, continue to select next sub-district to carry out of the mapping of basic scrambler, until the mapping of finishing all cell scramblings to scrambler.
Network with one 7 cell structure is that example illustrates that network basic structure as shown in Figure 4 according to scrambling code planning scheme of the present invention below.
Step S11 determines that interference signal postpones to distribute between the neighbor cell of network environment;
Can obtain radius of society by STATIC SIMULATION is under the urban macro cell environment under 1000 meters, and adjacent cell signal postpones to distribute probably as shown in the table:
Table 3 adjacent area interference signal postpones distribute (0-15 chip)
Postpone 0 1 2 3 4 5 6 7
Probability 0.1160 0.0513 0.0633 0.0048 0.1271 0.0044 0.0806 0.1116
Postpone 8 9 10 11 12 13 14 15
Probability 0.1124 0.0438 0.0484 0.0034 0.1119 0.0023 0.0476 0.0711
Step S12 is according to postponing the delay distribution that the mapping criterion distributes the 0-15 chip delay to be mapped to the 0-4 chip; The probability addition of 0,8 chips will be postponed; Postpone the probability addition of 1,7,9,15 chips; Postpone the probability addition of 2,6,10,14 chips; Postpone the probability addition of 3,5,11,13 chips; The probability addition that postpones 4,12 chips obtains following delay and distributes:
Table 4: the adjacent area after the simplification postpones distribute (0-4 chip)
Postpone 0 1 2 3 4 5 6 7
Probability 0.1160 0.0513 0.0633 0.0048 0.1271 0.0044 0.0806 0.1116
Postpone 8 9 10 11 12 13 14 15
Probability 0.1124 0.0438 0.0484 0.0034 0.1119 0.0023 0.0476 0.0711
Step S13 determines neighboring BS relationship;
During for the cell allocation scrambler, the network topology of looking ahead.As shown in Figure 5, can determine these 7 sub-districts and other 6 sub-districts neighboring BS relationship each other.
Step S14, the scrambling code planning criterion of setting different brackets;
Setting probability threshold is 0.2, then greater than the delay of thresholding 0,1,2,4 chips is arranged according to the form detection probability.Relational pattern when investigating all basic scrambler scramblers and being combined in delay [0,1,2,4] chip has 11 kinds.The flow process of scrambling code planning for the purpose of simplifying the description, present embodiment has only provided the criterion of 3 grades, and the principle of tier definition is to be that 16 numbers that occur are foundation according to correlation in the relational pattern, and the number of appearance is many more, and priority is high more.
Criterion 1 does not allow to occur 16 16 in the relational pattern.Promptly
Delay is 0 o'clock, adopts different basic scramblers according to adjacent sub-district.
Delay is 4 o'clock, and following combination (2,5), (3,4), (6,11), (8,9), (10,12) do not appear in neighbor cell base scrambler scrambler
Criterion 2 does not allow to occur 8 16 in the relational pattern.Promptly
Delay is 2 o'clock, and following combination (1,3), (1,4), (6,7), (7,11), (8,10), (8,12), (9,10), (9,12) do not appear in neighbor cell base scrambler scrambler
Criterion 3 does not allow to occur 4 16 in the relational pattern.That is:
Delay is 1 o'clock, and following combination (2,9), (2,10), (5,8), (5,12) do not appear in neighbor cell base scrambler scrambler
Step S15, the allocation base scrambler;
Suppose that the order according to 1-7 is a cell allocation base scrambler.Concrete steps are as follows:
Select No. 1 the sub-district, find that its adjacent area all is the allocation base scrambler,, determine that optional basic scrambler set is 1-12 according to the setting criterion among the step S14.Suppose that basic scrambler selecting sequence is the 1-12 selective sequential, then, select scrambler 1 to distribute to the sub-district No. 1.
Then, selecting No. 2 sub-districts is next basic scrambler to be allocated sub-district.Find No. 1 sub-district, adjacent area allocation base scrambler 1, find that according to the criterion of step 4 basic scrambler 1,3,4 does not allow to give the sub-district No. 2.Other basic scramblers all can be distributed to the sub-district No. 2.In order basic scrambler 2 is distributed and give No. 2 sub-districts.
Afterwards, selecting No. 3 sub-districts is next basic scrambler to be allocated sub-district.Find No. 1 sub-district, adjacent area allocation base scrambler 1, No. 2 sub-districts, adjacent area are allocation base scrambler 2.Find that according to the criterion of step 4 { 1,2,3,4,5,9,10} can not distribute to the sub-district No. 3 to basic scrambler, in order basic scrambler 6 is distributed to the sub-district No. 3.
Select No. 4 the sub-district.{ 1,2,3,4,5,6,7,9,10,11} is unavailable, selects basic scrambler 8 to distribute to the sub-district No. 4 can to determine basic scrambler equally.
Afterwards, select No. 5 sub-districts.Use 3 criterions and find do not have basic scrambler to use.It is invalid that criterion 3 is made as.Still can't find available basic scrambler, it is invalid to continue criterion 2 is set to, find basic scrambler 1,2,5,6,8,11,9}, unavailable, select basic scrambler 3 to distribute to the sub-district No. 5.
Same can distribute to the sub-district No. 6 with No. 7 basic scramblers, and basic scrambler 10 is distributed to the sub-district No. 7.So far all cell allocation bases process of disturbing finishes.Final basic scrambler allocation result is as shown in the table:
Table 5: the basic scrambler of each sub-district, planning back
Postpone 0 1 2 3 4 5 6 7
Probability 0.1160 0.0513 0.0633 0.0048 0.1271 0.0044 0.0806 0.1116
Postpone 8 9 10 11 12 13 14 15
Probability 0.1124 0.0438 0.0484 0.0034 0.1119 0.0023 0.0476 0.0711
Step S16, basic scrambler is mapped to scrambler.
Still according to the selective sequential sub-district mapping scrambling of 1-7 sub-district.In the scrambler group of basic scrambler correspondence according to from small to large selective sequential scrambler.Concrete steps are as follows:
No. 1 cell allocation base scrambler 1 selects No. 1 scrambler to distribute No. 1 sub-district in the scrambler of basic scrambler 1 correspondence.
No. 2 cell allocation base scramblers 2 select No. 2 scramblers to find to belong to same descending pilot frequency group with No. 1 sub-district in the scrambler of basic scrambler 2 correspondences, then select next scrambler 6 to distribute to the sub-district No. 2.Same is No. 3 cell allocation scramblers 52, is No. 4 cell allocation scramblers 61, is No. 5 cell allocation scramblers 12, is No. 6 cell allocation scramblers 81, is No. 7 cell allocation scramblers 67.So far, the scrambler mapping process finishes.
The scrambler delay group categories characteristic that scrambling planning method according to the present invention is obtained is illustrated below.
At application number is in the Chinese patent application of " 200410048703.8 " and " 200410048702.3 ", and the correlation properties under white Gaussian noise (AWGN) condition have been divided into 12 groups of base scramblers with 128 scramblers according to scrambler and spreading code formation compound key.Each basic scrambler postpones the 0-15 chip can form 16 different code words.Such 12 groups of base scramblers can form 192 different basic scramblers delay combinations, and (A, B) basic scrambler A of expression is offset B the code word behind the chip to the right, the scrambler of each combination correspondence and a reality under the certain deviation amount with two tuples.Investigate these 192 correlations between the different basic scramblers delay combinations, find that its correlation properties have 11 class situations, table 103 is to table 114.Can find that from first kind of relevant pattern two scramblers of this relevant pattern explanation form, and to meet sign indicating number identical.
Difference between the different scrambler relational pattern is the number difference of certain relevant value in the correlation matrix, and the position of appearance can be different.Sum up shown in table 101 for table 103 to 11 kinds of relational pattern shown in the table 114.
The characteristics that analysis draws relational pattern 1 are as follows:
Any code word of horizontal 16 compound code words is relevant fully with some code words of vertical compound code word, and is mutually orthogonal with other 15 sign indicating numbers., mutually orthogonal as horizontal code word 1 with other 15 vertical code words with vertically code word 1 is relevant fully.
Relational pattern has and has characteristic between the compound key sub-block that two scrambler delay group A, B of above-mentioned feature constitute: any the compound code word in the compound key sub-block of scrambler A correspondence, in the compound key sub-block that scrambler B constitutes, always there is a relevant fully with it compound code word, has strong interference between Xiang Guan compound code word fully.According to relational pattern 1 classification between the scrambler delay, 192 scramblers can be postponed components be 48 families.Relational pattern between any two scrambler delay groups in every family is all identical with relational pattern 1 in the appendix.
Scrambler according to relational pattern 1 postpones group categories (dividing family's relation) shown in table 102.
(A, B) 16 compound keys of the basic scrambler A formation of expression are offset the code word that forms behind B the chip to the right in the table 102.
Can analyze the following information that draws according to table 102:
1) any one chip is after postponing 4 chips, all will be with it own or other another scramblers each other with sign indicating number.
2) in 192 groups of scrambler delay groups, have only 48 to be different between any two sign indicating numbers, and postpone to be distributed between the 0-4 chip.The compound key that so-called sign indicating number together is meant two scramblers formation is identical.
3) compound key that synthesizes with scrambler delay group inside the gang and ovsf code is identical
4) when the delay side-play amount is ± 4 chips, basic scrambler 2 and 5,3 and 4,6 and 11,8 and 9,10 and 12 is each other with sign indicating number; And basic scrambler 1 and 7 separately with itself be with sign indicating number, promptly when postponing ± 4 chips, also can produce very strong interference in this sub-district.
5) scrambler that forms behind 8 chips of any one scrambler and its delay belongs to sign indicating number.
According to the basic scrambler shown in the table 102 postpone branchs family's situation and the basic scrambler delay that sums up thus under correlation properties, scrambling code planning scheme of the present invention fully takes into account the situation that the generation the when adjacent area is asynchronous in the real network environment is disturbed and investigated lag characteristic, the scrambler of optimizing distributes, and improves systematic function.
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.
Table 101
Pattern number correlation Pattern 1 Pattern 2 Pattern 3 Pattern 4 Pattern 5 Pattern 6 Pattern 7 Pattern 8 Pattern 9 Pattern 10 Pattern 11
0 240 192 0 128 96 112 216 144 48 160 172
4 0 0 256 112 128 120 0 64 192 56 56
8 0 64 0 0 32 16 32 48 16 32 16
12 0 0 0 16 0 8 0 0 0 8 8
16 16 0 0 0 0 0 8 0 0 0 4
Table 102
Scrambler delay group family numbering Member in the scrambler delay group family Scrambler delay group family numbering Member in the scrambler delay group family
1 (1,0)(1,4)(1,8)(1,12) 25 (1,2)(1,6)(1,10)(1,14)
2 (2,0)(5,4)(2,8)(5,12) 26 (2,2)(5,6)(2,10)(5,14)
3 (3,0)(4,4)(3,8)(4,12) 27 (3,2)(4,6)(3,10)(4,14)
4 (4,0)(3,4)(4,8)(3,12) 28 (4,2)(3,6)(4,10)(3,14)
5 (5,0)(2,4)(5,8)(2,12) 29 (5,2)(2,6)(5,10)(2,14)
6 (6,0)(11,4)(6,8)(11,12) 30 (6,2)(11,6)(6,10)(11,14)
7 (7,0)(7,4)(7,8)(7,12) 31 (7,2)(7,6)(7,10)(7,14)
8 (8,0)(9,4)(8,8)(9,12) 32 (8,2)(9,6)(8,10)(9,14)
9 (9,0)(8,4)(9,8)(8,12) 33 (9,2)(8,6)(9,10)(8,14)
10 (10,0)(12,4)(10,8)(12,12) 34 (10,2)(12,6)(10,10)(12,14)
11 (11,0)(6,4)(11,8)(6,12) 35 (11,2)(6,6)(11,10)(6,14)
12 (12,0)(10,4)(12,8)(10,12) 36 (12,2)(10,6)(12,10)(10,14)
13 (1,1)(1,5)(1,9)(1,13) 37 (1,3)(1,7)(1,11)(1,15)
14 (2,1)(5,5)(2,9)(5,13) 38 (2,3)(5,7)(2,11)(5,15)
15 (3,1)(4,5)(3,9)(4,13) 39 (3,3)(4,7)(3,11)(4,15)
16 (4,1)(3,5)(4,9)(3,13) 40 (4,3)(3,7)(4,11)(3,15)
17 (5,1)(2,5)(5,9)(2,13) 41 (5,3)(2,7)(5,11)(2,15)
18 (6,1)(11,5)(6,9)(11,13) 42 (6,3)(11,7)(6,11)(11,15)
19 (7,1)(7,5)(7,9)(7,13) 43 (7,3)(7,7)(7,11)(7,15)
20 (8,1)(9,5)(8,9)(9,13) 44 (8,3)(9,7)(8,11)(9,15)
21 (9,1)(8,5)(9,9)(8,13) 45 (9,3)(8,7)(9,11)(8,15)
22 (10,1)(12,5)(10,9)(12,13) 46 (10,3)(12,7)(10,11)(12,15)
23 (11,1)(6,5)(11,9)(6,13) 47 (11,3)(6,7)(11,11)(6,15)
24 (12,1)(10,5)(12,9)(10,13) 48 (12,3)(10,7)(12,11)(10,15)
Table 103
16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16
Table 104
0 8 0 0 0 0 8 0 8 0 0 0 0 0 0 8
8 0 0 0 0 0 0 8 0 8 0 0 0 0 8 0
0 0 0 8 8 0 0 0 0 0 8 0 0 8 0 0
0 0 8 0 0 8 0 0 0 0 0 8 8 0 0 0
0 0 8 0 0 8 0 0 0 0 0 8 8 0 0 0
0 0 0 8 8 0 0 0 0 0 8 0 0 8 0 0
8 0 0 0 0 0 0 8 0 8 0 0 0 0 8 0
0 8 0 0 0 0 8 0 8 0 0 0 0 0 0 8
8 0 0 0 0 0 0 8 0 8 0 0 0 0 8 0
0 8 0 0 0 0 8 0 8 0 0 0 0 0 0 8
0 0 8 0 0 8 0 0 0 0 0 8 8 0 0 0
0 0 0 8 8 0 0 0 0 0 8 0 0 8 0 0
0 0 0 8 8 0 0 0 0 0 8 0 0 8 0 0
0 0 8 0 0 8 0 0 0 0 0 8 8 0 0 0
0 8 0 0 0 0 8 0 8 0 0 0 0 0 0 8
8 0 0 0 0 0 0 8 0 8 0 0 0 0 8 0
Table 105
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
Table 106
4 4 0 0 4 4 0 0 4 4 0 0 12 4 0 0
0 4 4 0 0 4 4 0 0 4 4 0 0 12 4 0
0 0 4 4 0 0 4 4 0 0 4 4 0 0 12 4
4 0 0 4 4 0 0 4 4 0 0 4 4 0 0 12
12 4 0 0 4 4 0 0 4 4 0 0 4 4 0 0
0 12 4 0 0 4 4 0 0 4 4 0 0 4 4 0
0 0 12 4 0 0 4 4 0 0 4 4 0 0 4 4
4 0 0 12 4 0 0 4 4 0 0 4 4 0 0 4
4 4 0 0 12 4 0 0 4 4 0 0 4 4 0 0
0 4 4 0 0 12 4 0 0 4 4 0 0 4 4 0
0 0 4 4 0 0 12 4 0 0 4 4 0 0 4 4
4 0 0 4 4 0 0 12 4 0 0 4 4 0 0 4
4 4 0 0 4 4 0 0 12 4 0 0 4 4 0 0
0 4 4 0 0 4 4 0 0 12 4 0 0 4 4 0
0 0 4 4 0 0 4 4 0 0 12 4 0 0 4 4
4 0 0 4 4 0 0 4 4 0 0 12 4 0 0 4
Table 107
0 0 4 4 8 0 4 4 0 0 4 4 0 8 4 4
0 4 4 0 0 4 4 0 0 4 4 8 8 4 4 0
0 8 4 4 0 0 4 4 8 0 4 4 0 0 4 4
8 4 4 0 0 4 4 8 0 4 4 0 0 4 4 0
0 8 4 4 0 0 4 4 8 0 4 4 0 0 4 4
8 4 4 0 0 4 4 8 0 4 4 0 0 4 4 0
0 0 4 4 8 0 4 4 0 0 4 4 0 8 4 4
0 4 4 0 0 4 4 0 0 4 4 8 8 4 4 0
0 0 4 4 0 8 4 4 0 0 4 4 8 0 4 4
0 4 4 8 8 4 4 0 0 4 4 0 0 4 4 0
8 0 4 4 0 0 4 4 0 8 4 4 0 0 4 4
0 4 4 0 0 4 4 0 8 4 4 0 0 4 4 8
8 0 4 4 0 0 4 4 0 8 4 4 0 0 4 4
0 4 4 0 0 4 4 0 8 4 4 0 0 4 4 8
0 0 4 4 0 8 4 4 0 0 4 4 8 0 4 4
0 4 4 8 8 4 4 0 0 4 4 0 0 4 4 0
Table 108
4 4 0 0 4 4 0 0 4 4 0 0 4 12 0 0
0 4 4 0 0 4 4 0 8 4 4 0 8 4 4 0
0 0 4 4 0 0 4 4 0 0 4 12 0 0 4 4
4 0 0 4 4 0 0 4 4 0 8 4 4 0 8 4
4 12 0 0 4 4 0 0 4 4 0 0 4 4 0 0
8 4 4 0 8 4 4 0 0 4 4 0 0 4 4 0
0 0 4 4 0 0 4 12 0 0 4 4 0 0 4 4
4 0 8 4 4 0 8 4 4 0 0 4 4 0 0 4
4 4 0 0 4 12 0 0 4 4 0 0 4 4 0 0
8 4 4 0 8 4 4 0 0 4 4 0 0 4 4 0
0 0 4 12 0 0 4 4 0 0 4 4 0 0 4 4
4 0 8 4 4 0 8 4 4 0 0 4 4 0 0 4
4 4 0 0 4 4 0 0 4 12 0 0 4 4 0 0
0 4 4 0 0 4 4 0 8 4 4 0 8 4 4 0
0 0 4 4 0 0 4 4 0 0 4 4 0 0 4 12
4 0 0 4 4 0 0 4 4 0 8 4 4 0 8 4
Table 109
0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0
0 0 0 0 0 0 0 0 8 0 8 0 8 0 8 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16
0 0 0 0 0 0 0 0 8 0 8 0 8 0 8 0
0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0
0 0 0 0 0 0 0 0 8 0 8 0 8 0 8 0
0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0
0 0 0 0 0 0 0 0 8 0 8 0 8 0 8 0
0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0
8 0 8 0 8 0 8 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0
8 0 8 0 8 0 8 0 0 0 0 0 0 0 0 0
0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0
8 0 8 0 8 0 8 0 0 0 0 0 0 0 0 0
0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0
8 0 8 0 8 0 8 0 0 0 0 0 0 0 0 0
Table 110
0 0 0 8 0 0 8 0 0 0 0 8 0 0 8 0
0 4 8 4 0 4 0 4 0 4 8 4 0 4 0 4
8 8 0 0 0 0 0 0 8 8 0 0 0 0 0 0
8 4 0 4 0 4 0 4 8 4 0 4 0 4 0 4
0 0 8 0 0 0 0 8 0 0 8 0 0 0 0 8
0 4 0 4 0 4 8 4 0 4 0 4 0 4 8 4
0 0 0 0 8 8 0 0 0 0 0 0 8 8 0 0
0 4 0 4 8 4 0 4 0 4 0 4 8 4 0 4
0 0 0 8 0 0 8 0 0 0 0 8 0 0 8 0
0 4 8 4 0 4 0 4 0 4 8 4 0 4 0 4
8 8 0 0 0 0 0 0 8 8 0 0 0 0 0 0
8 4 0 4 0 4 0 4 8 4 0 4 0 4 0 4
0 0 8 0 0 0 0 8 0 0 8 0 0 0 0 8
0 4 0 4 0 4 8 4 0 4 0 4 0 4 8 4
0 0 0 0 8 8 0 0 0 0 0 0 8 8 0 0
0 4 0 4 8 4 0 4 0 4 0 4 8 4 0 4
Table 111
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
0 4 0 4 0 4 8 4 0 4 0 4 0 4 8 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
8 4 0 4 0 4 0 4 8 4 0 4 0 4 0 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
0 4 8 4 0 4 0 4 0 4 8 4 0 4 0 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
0 4 0 4 8 4 0 4 0 4 0 4 8 4 0 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
0 4 0 4 0 4 8 4 0 4 0 4 0 4 8 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
8 4 0 4 0 4 0 4 8 4 0 4 0 4 0 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
0 4 8 4 0 4 0 4 0 4 8 4 0 4 0 4
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
0 4 0 4 8 4 0 4 0 4 0 4 8 4 0 4
Table 112
0 0 0 8 0 0 0 8 0 8 0 0 0 8 0 0
4 0 4 0 4 0 4 0 4 0 4 0 12 0 4 0
0 0 0 0 0 0 0 0 0 8 0 8 0 8 0 8
4 0 4 0 4 0 4 0 4 0 12 0 4 0 4 0
0 8 0 0 0 8 0 0 0 0 0 8 0 0 0 8
12 0 4 0 4 0 4 0 4 0 4 0 4 0 4 0
0 8 0 8 0 8 0 8 0 0 0 0 0 0 0 0
4 0 4 0 4 0 12 0 4 0 4 0 4 0 4 0
0 8 0 0 0 8 0 0 0 0 0 8 0 0 0 8
4 0 4 0 12 0 4 0 4 0 4 0 4 0 4 0
0 8 0 8 0 8 0 8 0 0 0 0 0 0 0 0
4 0 12 0 4 0 4 0 4 0 4 0 4 0 4 0
0 0 0 8 0 0 0 8 0 8 0 0 0 8 0 0
4 0 4 0 4 0 4 0 12 0 4 0 4 0 4 0
0 0 0 0 0 0 0 0 0 8 0 8 0 8 0 8
4 0 4 0 4 0 4 0 4 0 4 0 4 0 12 0
Table 113
0 0 8 0 0 0 8 0 0 0 8 0 0 0 8 0
0 4 0 4 0 4 0 4 0 4 0 4 0 4 0 12
0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0
0 4 0 4 0 4 0 4 0 4 0 4 0 12 0 4
0 0 8 0 0 0 8 0 0 0 8 0 0 0 8 0
0 4 0 12 0 4 0 4 0 4 0 4 0 4 0 4
16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 12 0 4 0 4 0 4 0 4 0 4 0 4 0 4
0 0 8 0 0 0 8 0 0 0 8 0 0 0 8 0
0 4 0 4 0 4 0 12 0 4 0 4 0 4 0 4
0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0
0 4 0 4 0 12 0 4 0 4 0 4 0 4 0 4
0 0 8 0 0 0 8 0 0 0 8 0 0 0 8 0
0 4 0 4 0 4 0 4 0 4 0 12 0 4 0 4
0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0
0 4 0 4 0 4 0 4 0 12 0 4 0 4 0 4

Claims (8)

1. the scrambling planning method based on lag characteristic is characterized in that, comprising:
Obtain the delay probability distributed intelligence between the interference signal of different user in the network;
To postpone distribution according to delay mapping criterion and be mapped to the 0-4 chip, wherein delay mapping criterion is:
To postpone the probability addition of 0,8 chips,
To postpone the probability addition of 1,7,9,15 chips,
To postpone the probability addition of 2,6,10,14 chips,
To postpone the probability addition of 3,5,11,13 chips,
To postpone the probability addition of 4,12 chips, obtain a probability density distribution that postpones the 0-4 chip;
Determine the neighboring BS relationship between each sub-district, according to the scrambling code planning criterion of pre-defined rule setting different brackets, and according to this scrambling code planning criterion allocation base scrambler;
Adopt different descending pilot frequency group criterions for neighbor cell, basic scrambler is mapped to scrambler.
2. scrambling planning method as claimed in claim 1 is characterized in that, described pre-defined rule comprises:
More little according to maximum correlation between the formed compound key of two scramblers, the rule that priority is high more; Or
More little according to the maximum correlation average between the formed compound key of two scramblers, the rule that priority is high more; Or
Determine priority according to the number that certain correlation in the relational pattern occurs, it is many more that number appears in this correlation, and priority is high more.
3. scrambling planning method as claimed in claim 1 or 2 is characterized in that, according to the following step allocation base scrambler:
The sub-district that needs the allocation base scrambler according to the definite selective sequential of pre-defined rule;
Check all adjacent area base scrambler distribution condition of described sub-district;
Upgrade available basic scrambler set according to described scrambling code planning criterion;
From described available scrambler set, select basic scrambler according to determined order, distribute to described sub-district.
4. scrambling planning method as claimed in claim 1 or 2 is characterized in that, according to the following step basic scrambler is mapped to scrambler:
Select a sub-district according to predefined procedure;
In all scramblers of sub-district base scrambler correspondence, select a scrambler according to predefined procedure;
Check that whether selected scrambler belongs to same descending pilot frequency group with the scrambler that the adjacent area has been distributed;
If it does not belong to same descending pilot frequency group, then selected scrambler is distributed to this sub-district;
If belong to same descending pilot frequency group, according to the next scrambler of predefine selective sequential;
Continue to select next sub-district to carry out of the mapping of basic scrambler, until the mapping of finishing all cell scramblings to scrambler.
5. scrambling planning method as claimed in claim 1 or 2 is characterized in that, sets the grade of scrambling code planning criterion through the following steps:
All scramblers are combined in all relational pattern that obtain under the investigation delay sort, set the grade of this criterion according to the priority orders of described relational pattern.
6. scrambling planning method as claimed in claim 1 or 2 is characterized in that, obtains described delay probability distributed intelligence by adopting system simulation method; Perhaps;
The delay probability of employing under general situations about occurring such as 0-15 chip delay distributes as described delay probability distributed intelligence.
7. as each described scrambling planning method in the claim 1 to 6, it is characterized in that, scrambler is divided into 48 families, consistent with all the scrambler delay groups in the gang with the relational pattern that other scrambler delay group forms.
8. as each described scrambling planning method in the claim 1 to 6, it is characterized in that,
When under all planning criterion constraints, in the time of can't finding suitable scrambler, gradually reduce the constraint of planning criterion according to priority order from low to high.
CNB2006100888070A 2006-07-18 2006-07-18 Code division multiple access system scramble distribution method based on time-delay characteristic Expired - Fee Related CN100502252C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2006100888070A CN100502252C (en) 2006-07-18 2006-07-18 Code division multiple access system scramble distribution method based on time-delay characteristic

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006100888070A CN100502252C (en) 2006-07-18 2006-07-18 Code division multiple access system scramble distribution method based on time-delay characteristic

Publications (2)

Publication Number Publication Date
CN101110603A true CN101110603A (en) 2008-01-23
CN100502252C CN100502252C (en) 2009-06-17

Family

ID=39042523

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006100888070A Expired - Fee Related CN100502252C (en) 2006-07-18 2006-07-18 Code division multiple access system scramble distribution method based on time-delay characteristic

Country Status (1)

Country Link
CN (1) CN100502252C (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102256256A (en) * 2010-05-21 2011-11-23 中国移动通信集团浙江有限公司 Method and device for planning frequency and scrambling codes
CN103152119A (en) * 2011-12-06 2013-06-12 中国移动通信集团北京有限公司 System scrambling code confirming method, device, base stations, distribution method, equipment and system
CN104796216A (en) * 2015-03-31 2015-07-22 上海大唐移动通信设备有限公司 Method and device for scrambling code distribution

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102256256A (en) * 2010-05-21 2011-11-23 中国移动通信集团浙江有限公司 Method and device for planning frequency and scrambling codes
CN102256256B (en) * 2010-05-21 2014-06-04 中国移动通信集团浙江有限公司 Method and device for planning frequency and scrambling codes
CN103152119A (en) * 2011-12-06 2013-06-12 中国移动通信集团北京有限公司 System scrambling code confirming method, device, base stations, distribution method, equipment and system
CN103152119B (en) * 2011-12-06 2015-11-04 中国移动通信集团北京有限公司 System scrambler defining method, device and base station, distribution method, equipment and system
CN104796216A (en) * 2015-03-31 2015-07-22 上海大唐移动通信设备有限公司 Method and device for scrambling code distribution

Also Published As

Publication number Publication date
CN100502252C (en) 2009-06-17

Similar Documents

Publication Publication Date Title
CN1929323B (en) Method of suppressing cross time slot interfere for time slot CDMA system
CN101272585B (en) Estimation method and device for TD-SCDMA system code resource allocation
CN105611554A (en) Physical cell identification distribution method
CN103167582A (en) Terminal control method and control base station
CN103297978A (en) Cell configuring method and cell configuring device
CN100502252C (en) Code division multiple access system scramble distribution method based on time-delay characteristic
CN101982991A (en) Heterogeneous service QoS based LTE network inter-cell interference ordination method
CN104796902A (en) Frequency domain resource distribution method based on graph coloring in ultra-dense network
CN101583082B (en) Method, device and base station for dynamically adjusting multicast single frequency network area
US7486636B2 (en) Method, system and computer program for planning a telecommunications network
CN1925376B (en) Descending main scrambling code optimum distribution method in broad band CDMA system
CN100365954C (en) Cell scramble distributing method for time division-synchronous code division multiple access system
CN105517000A (en) Cell splitting method and apparatus
CN103179607B (en) A kind of Optimal Configuration Method of network scrambler and device
CN100407600C (en) Configuration method of cell code source in time-division synchronous CDMA system group network
CN110621025B (en) Equipment model selection method and device
CN100409715C (en) Method for reducing co-channel interference in sector interval
CN106817691A (en) A kind of PCI distribution method and device
CN101325429B (en) Method for distributing district code word for mobile communication system
CN100382464C (en) TD-SCDMA system cell code word planning method and method for searching composite code word combination thereof
CN101420258A (en) Method for automatic PN planning in CDMA network
CN101414871A (en) Method and apparatus for configuring scrambling
CN104066187B (en) TD SCDMA code method for optimizing resources
CN102223725B (en) Scrambling code distribution method
CN1917408B (en) Method for planning code resources in cell of SCDMA 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
ASS Succession or assignment of patent right

Owner name: INST OF TELECOMMUNICATION SCIENCE AND TECHNOLGOY

Free format text: FORMER OWNER: DATANG MOBILE COMMUNICATION EQUIPMENT CO., LTD.

Effective date: 20110428

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 100083 NO. 29, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 100083 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING

TR01 Transfer of patent right

Effective date of registration: 20110428

Address after: 100083 No. 40, Haidian District, Beijing, Xueyuan Road

Patentee after: Inst of Telecommunication Science and Technolgoy

Address before: 100083 Haidian District, Xueyuan Road, No. 29,

Patentee before: Datang Mobile Communication Equipment Co., Ltd.

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: 20090617

Termination date: 20210718