CN102571256A - Scrambling code pair determination method and device - Google Patents

Abstract

The invention discloses a scrambling code pair determination method and a scrambling code pair determination device. The method comprises the following steps of: for adjacent first and second cells, determining a spreading factor weight value of each spreading factor supported by each cell respectively; selecting scrambling code pairs consistent with preset conditions from all scrambling code pairs; for each selected scrambling code pair, determining a compound code correlative value of the scrambling code pair, and weighting the compound code correlative value of the scrambling code pair according to the determined spreading factor weight value to obtain a comprehensive correlative value of the scrambling code pair; selecting a scrambling code pair with the minimum comprehensive correlative value; and determining the selected scrambling code pair as an optimal scrambling code pair of the first and second cells. By the technical scheme, the problem that the optimal scrambling code pair of the two adjacent cells is determined according to the compound code correlative value of the scrambling code pair to cause strong interference between the cells in the prior art is solved.

Description

Scrambler is to confirming method and device

Technical field

The present invention relates to communication technical field, relate in particular to a kind of scrambler confirming method and device.

Background technology

It is the access mode on basis that 3-G (Generation Three mobile communication system) has extensively adopted with code division multiple access (CDMA, Code DivisionMultiple Access), and its essential characteristic is exactly to distinguish different users and different sub-districts with different code word.In order to realize the beehive net structure, different cdma systems has all defined the scheme that different code word is separately used and distributed.

TD SDMA (TD-SCDMA, Time Division-Synchronous Code DivisionMultiple Access) the employed code word of system can be divided into according to type: spreading code, downlink frequency pilot code, ascending pilot frequency sign indicating number, scrambler, training sequence (midamble) sign indicating number.The corresponding relation of downlink frequency pilot code, ascending pilot frequency sign indicating number, scrambler and basic midamble intersymbol is as shown in table 1:

Table 1:

As shown in table 1; 32 downlink frequency pilot code, 256 ascending pilot frequency sign indicating numbers, 128 scramblers and 128 basic midamble sign indicating numbers are divided into 32 basic scrambler groups; Comprise 1 downlink frequency pilot code, 8 ascending pilot frequency sign indicating numbers, 4 scramblers and 4 basic midamble sign indicating numbers in each basic scrambler group, scrambler is one to one with basic midamble sign indicating number.

Wherein, the ascending pilot frequency sign indicating number is used in random access procedure by subscriber equipment, 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; Scrambler is used for distinguishing different sub-districts, and the process of using scrambled is exactly in user's data information, to add the characteristic information of sub-district, when the user receives the signal from a plurality of sub-districts, just can identify the signal that wherein to one's name belongs to the sub-district like this; The midamble sign indicating number is the training sequence of spread spectrum burst, can be used for carrying out channel estimating, synchronously, identification base station etc., the midamble sign indicating number of different channels is according to certain offset generating by basic midamble sign indicating number in the sub-district; The spreading code channel code that is otherwise known as; Mainly be used for data are carried out spread spectrum according to different spreading factors; For the spreading code that guarantees spreading factor different on same time slot (SF, Spreading Factor) is a quadrature, generally requiring spreading code is Orthogonal Variable Spreading Factor OVSF (OVSF; Orthogonal Variable Spreading Factor) sign indicating number, the TD-SCDMA system adopts spreading code to distinguish physical channels different in the same sub-district.

What different user's dependence was distinguished by the TD-SCDMA system in the sub-district is ovsf code, wherein only uses the ovsf code of SF=1 or 16 at down direction, then can use SF=1 at up direction, 2,4,8 or 16 ovsf code.What the sub-district that distinguish is different relied on is that length is the scrambler of 16 chips (Chip).Under the condition of identical networking, the compound key that generally uses ovsf code and scrambler step-by-step to obtain after multiplying each other is distinguished the data of different user between different districts.

Because the scrambler length of TD-SCDMA system is shorter, 16 chip are only arranged, and the length of SF is shorter; Also be 16 chip; Therefore just there is situation about overlapping in the compound key between different districts, and particularly in the uplink process, adopts under the situation of lower SF, and the corresponding chip number of symbol will be lower than 16; Scrambler only has the part segment to work, and probability that compound key overlaps appears in the minizone will be bigger.When the user distance that lays respectively at two adjacent sub-districts closer; And when the ovsf code that is distributed overlaps with the compound key that obtains after scrambler multiplies each other; The situation of different user and different districts just may appear distinguishing, this moment the same frequency between neighbor cell disturb very big, when this disturbs greatly when influencing the demodulation performance of base band physical layer; Can cause the deterioration of link performance, thereby influence the capacity of system.

Therefore, when carrying out scrambling code planning and optimizing, through calculating the compound key correlation of two scramblers of scrambler centering, come two scramblers of scrambler centering are carried out the correlation evaluation mostly at present, as far as possible that correlation is little scrambler is to distributing to two adjacent sub-districts.

As shown in table 2, the right compound key correlation of each scrambler is a single value, has characterized two averages of sub-district under the miscellaneous service situation, or two situation of sub-district when zero load.

Table 2:

But in existing network, the customer group that the sub-district covers is different, and the user uses professional situation also different; Therefore when different service is carried in the sub-district; Just different with the disturbed condition between other sub-districts, if still confirm that according to the right compound key correlation of scrambler the optimum scrambler of two neighbor cells is right, then possibly cause the interference of minizone bigger; When the traffic carrying capacity of TD-SCDMA system increased, this disturbed condition was even more serious.

Summary of the invention

The embodiment of the invention provides a kind of scrambler to confirming method and device, in order to solve exist in the prior art owing to confirm that according to the right compound key correlation of scrambler the optimum scrambler of two neighbor cells is right, thereby cause the bigger problem of interference of minizone.

Embodiment of the invention technical scheme is following:

A kind of scrambler is to confirming method, and the method comprising the steps of: to adjacent first sub-district and second sub-district, confirm the spreading factor weighted value of each spreading factor that this sub-district is supported respectively; All scrambler centerings, select that to satisfy pre-conditioned scrambler right; Each scrambler to selecting is right, confirms the compound key correlation that this scrambler is right, and according to the spreading factor weighted value of determining, the compound key correlation right to this scrambler carries out weighting, obtains the right comprehensive correlation of this scrambler; It is right to select the minimum scrambler of comprehensive correlation; And the scrambler of selecting is right, the optimum scrambler of confirming as first sub-district and second sub-district is right.

A kind of scrambler comprises confirming device: first confirms the unit, is used for to adjacent first sub-district and second sub-district, confirms the spreading factor weighted value of each spreading factor that this sub-district is supported respectively; First selected cell is used for all scrambler centerings, selects that to satisfy pre-conditioned scrambler right; Second confirms the unit, and each scrambler that is used for selecting to first selected cell is right, confirms the compound key correlation that this scrambler is right; Weighted units, each scrambler that is used for selecting to first selected cell is right, confirms the spreading factor weighted value that the unit is determined according to first, confirms that to second the compound key correlation that the unit is determined carries out weighting, obtains the right comprehensive correlation of this scrambler; Second selected cell, it is right to be used to select the minimum scrambler of comprehensive correlation; The 3rd confirms the unit, and the scrambler that is used for second selected cell is selected is right, and the optimum scrambler of confirming as first sub-district and second sub-district is right.

In the embodiment of the invention technical scheme,, confirm the SF weighted value of each SF that this sub-district is supported respectively to the first adjacent sub-district and second sub-district; All scrambler centerings, select that to satisfy pre-conditioned scrambler right, right to each scrambler of selecting; Confirm the compound key correlation that this scrambler is right, and according to the SF weighted value of determining, the compound key correlation right to this scrambler carries out weighting; Obtain the right comprehensive correlation of this scrambler, it is right to select the minimum scrambler of comprehensive correlation, and the scrambler of selecting is right; The optimum scrambler of confirming as first sub-district and second sub-district is right, because the sub-district is being carried dissimilarly when professional, the SF that is supported maybe be different; Therefore the SF weighted value of the SF that supports according to the sub-district of the embodiment of the invention; The compound key correlation right to scrambler computes weighted, and then confirms that according to the comprehensive correlation that ranking operation obtains optimum scrambler is right, thereby reduced interference among adjacent cells effectively.

Description of drawings

Fig. 1 is in the embodiment of the invention, and scrambler is to confirming the method flow sketch map;

Fig. 2 is in the embodiment of the invention, the scrambling planning method schematic flow sheet;

Fig. 3 is in the embodiment of the invention, scrambling code optimum method flow sketch map;

Fig. 4 is in the embodiment of the invention, and scrambler is to confirming the apparatus structure sketch map.

Embodiment

At length set forth to the main realization principle of embodiment of the invention technical scheme, embodiment and to the beneficial effect that should be able to reach below in conjunction with each accompanying drawing.

As shown in Figure 1, in the embodiment of the invention, scrambler is to confirming method flow diagram, and its concrete processing procedure is following:

Step 11 to the first adjacent sub-district and second sub-district, is confirmed the SF weighted value of each SF that this sub-district is supported respectively;

The embodiment of the invention need be confirmed the SF weighted value of each SF that first sub-district is supported, and the SF weighted value of each SF of supporting of second sub-district, and therefore above-mentioned this sub-district is first sub-district and second sub-district.

Wherein, dissimilar business is the corresponding different SF of possibility in the TD-SCDMA system, and table 3 has provided the corresponding relation of type of service and SF.

Table 3:

Therefore; When dissimilar professional of little area carrier, the SF that this sub-district is supported maybe be different, and different SF makes that the correlation between the right compound key of scrambler is different; Therefore when the correlation of investigating between the compound key, take into full account the situation of the SF that supports the sub-district.

In the embodiment of the invention can but the SF weighted value of each SF of being not limited to confirm to support the sub-district according to following manner be specially:

Table 3 has provided the corresponding relation of type of service and SF; Therefore to adjacent first sub-district and second sub-district; The type of service of the miscellaneous service that carries according to this sub-district is at first respectively confirmed each SF of supporting this sub-district, and each SF that obtains then to determine takies number of times; The ratio that takies the number of times sum that takies number of times and all SF of each SF that will obtain is again confirmed as the SF weighted value of this SF in all SF that supported of supporting this sub-district.For example, in first sub-district, the number of times that takies of SF=1 is V ₁, the number of times sum that takies of all SF is V ₂, then the SF weighted value of SF=1 is V ₁/ V ₂

In addition; Because uplink service is different with the SF that downlink business uses, when therefore supporting up SF and descending SF, the correlation of compound key is also different; In the embodiment of the invention; Above-mentioned SF can be up SF, also can be descending SF, can also be up SF and descending SF; The SF weighted value of each up SF is the ratio that takies the number of times sum that takies number of times and all up SF of this up SF, and the SF weighted value of each descending SF is the ratio that takies the number of times sum that takies number of times and all descending SF of this descending SF.

Step 12 all scrambler centerings, selects that to satisfy pre-conditioned scrambler right;

Because the scrambler of neighbor cell can not belong to same basic scrambler group; Therefore two scramblers of the scrambler centering of first sub-district and second sub-district can not be the scrambler in the same basic scrambler group; And the scrambler of scrambler of this scrambler centering and other neighbor cells of first sub-district does not all belong to same basic scrambler group, and the scrambler of other neighbor cells of another scrambler and second sub-district does not all belong to same basic scrambler group; If first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, and then this scrambler centering should comprise the scrambler of second sub-district; Support that in first sub-district and second sub-district (SF is supported in first sub-district to each SF _i, SF is supported in second sub-district _j, i=1,2,4,8,16, j=1,2,4,8,16) time, should all there be repeated code in all right compound keys of this scrambler.

In the embodiment of the invention; Can study in advance under the situation of supporting various SF, the compound key correlation that scrambler is right generates the scrambler correlation matrix that divides SF and mark repeated code type; If two right scramblers of scrambler belong to same basic scrambler group; Then these two scramblers are labeled as " together " in this matrix, and repeated code appears in the compound key of two scramblers right as if scrambler, and then these two scramblers are labeled as the time delay number that " heavy | " can also further calculate repeated code in this matrix; After being recorded in " heavy | " then, for example " heavy | 4 ".

For example, if first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler; Scrambler to (i, the scrambler j in j) is the scrambler of second sub-district, the scrambler of other neighbor cells of the scrambler i and first sub-district does not all belong to same basic scrambler group; The scrambler of other neighbor cells of the scrambler j and second sub-district does not all belong to same basic scrambler group, then to scrambler to (i, j); Scrambler correlation matrix through searching above-mentioned minute SF and mark repeated code type can be known; Two right scramblers of this scrambler do not belong to same basic scrambler group, and travel through all SF situation, and all there is not repeated code in its corresponding compound sign indicating number; Then this moment, this scrambler was to (i is j) for to satisfy pre-conditioned scrambler right.

If all scrambler centerings; Can only find belong to same scrambler group scrambler to existing the scrambler of repeated code right with compound key; Then can exist the scrambler centering of repeated code to select a scrambler right at compound key, the repeated code time delay number right owing to scrambler be big more, explains that this scrambler is just more little to the possibility that repeated code takes place; Therefore preferably, select the bigger scrambler of time delay number right.

Step 13, right to each scrambler of selecting, confirm the compound key correlation that this scrambler is right, and according to the SF weighted value of determining, the compound key correlation right to this scrambler carries out weighting, obtain the right comprehensive correlation of this scrambler;

All SF (SF=1,2,4,8,16) have 31 spreading codes after multiply by complex-valued weights, and wherein unduplicated spreading code has 24, uses C _kExpression, k=1,2...24, like table 4:

Table 4:

Wherein, SF is that 1 or 2 spreading code quantity is 1, and SF is that the number of 4 or 8 spreading code is 3, and SF is that the number of 16 spreading code is 16.

After multiplying each other, scrambler i and 24 spreading codes have 24 compound key SC _{I, k}, k=1,2......24, same, after multiplying each other, scrambler j and 24 spreading codes have 24 compound spread spectrum scrambler SC _{J, m}, m=1,2......24.

In the networking process, the decision systems performance be the right compound key correlation of scrambler, rather than simple scrambler correlation, so we need investigate compound key SC _{I, k}With compound key SC _{J, m}Circular dependency corr_value (i, j, k, m).Scrambler is to (i j) has 24 * 24=576 corr_value, and each corr_value is that length is 16 by the circular correlation sequence of the compound key of the compound key of scrambler i and scrambler j.If scrambler i and spread spectrum codes C _kCompound key be SC _{I, k}, scrambler j and spread spectrum codes C _kCompound key be SC _{J, m}, i, j=1,2......128, k, m=1,2......24, then:

$\mathrm{corr}\_\mathrm{value}(i,j,k,m)={\mathrm{SC}}_{i,k}\⊗{\mathrm{SC}}_{j,m}$

Wherein, symbol

expression circular correlation.

Scrambler is to (i, compound key correlation j) are that (k m) obtains through certain computing 576 corr_value for i, j.

The embodiment of the invention proposes, and can confirm comprehensive correlation according to the SF weighted value of up SF, and this moment, this comprehensive correlation also can be called up comprehensive correlation; Also can confirm comprehensive correlation according to the SF weighted value of descending SF, this moment, this comprehensive correlation also can be called descending comprehensive correlation; Can also confirm comprehensive correlation according to the SF weighted value of up SF and the SF weighted value of descending SF, this moment, this comprehensive correlation also can be called two-way comprehensive correlation.

Introduce how to confirm up comprehensive correlation, descending comprehensive correlation and two-way comprehensive correlation respectively below.

First sub-district is adjacent with second sub-district, scrambler to (i, j) for to satisfy a pre-conditioned scrambler right, the up SF that first sub-district is supported _kThe number of times that takies be ssfup _k, Δ _kBe the up SF that first sub-district is supported _kThe SF weighted value, this moment k=1,2,4,8,16; The up SF that second sub-district is supported _mThe number of times that takies be ssfup _m, Δ _mBe the up SF that second sub-district is supported _mThe SF weighted value, this moment m=1,2,4,8,16; The descending SF that first sub-district is supported _kThe number of times that takies be ssfdw _k, Δ ' _kBe the descending SF that first sub-district is supported _kThe SF weighted value, this moment k=1,16; The descending SF that second sub-district is supported _mThe number of times that takies be ssfdw _m, Δ ' _mBe the descending SF that second sub-district is supported _mThe SF weighted value, this moment m=1,16; The compound key correlation of scrambler i and j be corr (i, j).

Calculate Δ through following manner respectively _k, Δ _m, Δ ' _kAnd Δ ' _m:

${\mathrm{\Δ}}_k=\frac{{\mathrm{ssfup}}_k}{\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_k}$

${\mathrm{\Δ}}_m=\frac{\mathrm{ssfupm}}{\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_m}$

${\mathrm{\Δ}}_k^{\′}=\frac{{\mathrm{ssfdw}}_k}{\underset{k=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_k}$

${\mathrm{\Δ}}_m^{\′}=\frac{{\mathrm{ssfdw}}_m}{\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_m}$

Confirm that through following manner scrambler is to (i, up comprehensive correlation j)

$\stackrel{\‾}{\mathrm{corr}\_\mathrm{up}(i,j)}=\mathrm{corr}(i,j)\·\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}({\mathrm{\Δ}}_m\·{\mathrm{\Δ}}_k)$

Confirm that through following manner scrambler is to (i, descending comprehensive correlation j)

$\stackrel{\‾}{\mathrm{corr}\_\mathrm{dw}(i,j)}=\mathrm{corr}(i,j)\·\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}\underset{k=\mathrm{1,16}}{\mathrm{\Σ}}({\mathrm{\Δ}}_m^{\′}\·{\mathrm{\Δ}}_k^{\′})$

Confirm that through following manner scrambler is to (i, two-way comprehensive correlation j)

$\stackrel{\‾}{(\mathrm{corr}\_\mathrm{both}(i,j)}=\frac{\stackrel{\‾}{\mathrm{corr}\_\mathrm{up}(i,j)}\·\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_k}{\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_k\underset{k=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_k}+\frac{\stackrel{\‾}{\mathrm{corr}\_\mathrm{dw}{(i,j)}_k}\·\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_m}{\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_m\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_m}$

$=\mathrm{corr}(i,j)\·(\frac{\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}({\mathrm{\Δ}}_m\·{\mathrm{\Δ}}_k\·\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_k)}{\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_k\underset{k=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_k}+\frac{\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}\underset{k=\mathrm{1,16}}{\mathrm{\Σ}}({\mathrm{\Δ}}_m^{\′}\·{\mathrm{\Δ}}_k^{\′}\·\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_m)}{\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}{\mathrm{ssfup}}_m\underset{m=\mathrm{1,16}}{\mathrm{\Σ}}{\mathrm{ssfdw}}_m}$

Step 14, it is right to select the minimum scrambler of comprehensive correlation;

Comprehensive correlation is minimum, explains that the correlation of two scramblers that this scrambler is right is more little.

Step 15, the scrambler of selecting is right, and the optimum scrambler of confirming as first sub-district and second sub-district is right.

If first sub-district and second sub-district are the sub-district of scrambler to be allocated, then the optimum scrambler of determining first sub-district and second sub-district to after, can directly two scramblers of this scrambler centering be distributed to first sub-district and second sub-district respectively.

If first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distributing the sub-district of scrambler, then when being the first cell allocation scrambler; Need to consider the switching times between first sub-district and each neighbor cell; The embodiment of the invention has proposed the notion of normalization switching times, if first sub-district is identical with the main carrier frequency of second sub-district, then with the switching times of first sub-district to second sub-district; Confirm as the normalization switching times of first sub-district to second sub-district; If first sub-district is different with the main carrier frequency of second sub-district, then with first sub-district to the switching times of second sub-district and the ratio of alien frequencies rejection ratio, confirm as the normalization switching times of first sub-district to second sub-district.At this moment, can but be not limited to be the first cell allocation scrambler, to be specially through following two kinds of methods of salary distribution:

First kind of method of salary distribution; Confirm the normalization switching times of first sub-district to second sub-district; Judge first sub-district to the normalization switching times of second sub-district whether greater than the normalization switching times of first sub-district to other neighbor cells; If judged result is for being, then should the scrambler of optimum scrambler centering except that the scrambler of second sub-district, distribute to first sub-district;

Second kind of method of salary distribution; Confirm the normalization switching times of first sub-district to second sub-district; The normalization switching times of determining multiply by the comprehensive correlation that weighting obtains; Obtain the comprehensive correlation of the right switching times of this optimum scrambler, whether judge the comprehensive correlation of said switching times, if judged result is for being less than the comprehensive correlation of the right switching times of the optimum scrambler of first sub-district and other neighbor cells; Then should the scrambler of optimum scrambler centering except that the scrambler of second sub-district, distribute to first sub-district.

Introduce the scrambler correlation matrix that how to generate branch SF and mark repeated code type below.

At first generate the scrambler correlation matrix of mark repeated code type.

Scrambler is to (i; J) correlation shows among 576 16 value sequence corr_value; The first five of 16 value sequences with back four represent respectively 0chip time delay, 1chip time delay, 2chip time delay, 3chip time delay, 4chip time delay ,-the 1chip time delay ,-the 2chip time delay ,-the 3chip time delay ,-the corresponding correlation of time-delay during 4chip; Wherein i and the j situation that time-delay is relevant when 0chip is maximum, ± 1, ± 2, ± 3, ± reduced successively in 4 o'clock.

Because the possible value of 16 elements is 0,4,8,12,16 in 16 value sequences; (time delay is 0 with preceding 5 elements of 576 16 value sequence corr_value; 1,2,3; 4 chip) and back 4 elements (time delay for-1 ,-2 ,-3 ,-4chip) maximum comes out greater than the number of 8 (being 12 or 16), is respectively n ₁₂, n ₁₆:

max_value4(i，j，k，m)＝max{corr_value(i，j，k，m，l)}

n ₁₂＝{max_value4(i，j，k，m)＝12}

n ₁₆＝{max_value4(i，j，k，m)＝16}

Wherein, l=0,1,2,3,4,12,13,14,15.

$\mathrm{mean}\_\max \_\mathrm{value}(i,j)=\frac{7}{576}\&times;{\mathrm{<figure-callout\; id="12"\; label="n"\; filenames="HDA0000041973190000011.png,HDA0000041973190000021.png"\; state="\{\{state\}\}">n</figure-callout>}}_{12}$

Calculate scrambler to (i, the average of preceding 5 elements and back 4 element averages in 576 16 value sequences j):

$\mathrm{Average}\_\mathrm{value}4(i,j)=$

$\frac{1}{576}\&times;\underset{k=1}{\overset{24}{\mathrm{\&Sigma;}}}\underset{m=1}{\overset{24}{\mathrm{\&Sigma;}}}\{\frac{1}{9}\&times;[\underset{l=0}{\overset{4}{\text{\&Sigma;}}}\mathrm{corr}\_\mathrm{value}(i,j,k,m,l)+\underset{l=12}{\overset{15}{\mathrm{\&Sigma;}}}\mathrm{corr}\_\mathrm{value}(i,j,k,m,l)\left]\right\}$

With mean_max_value (i, j) and Average_value4 (i, j) addition obtains:

R(i，j)＝mean_max_value(i，j)+Average_value4(i，j)

If n ₁₆≠ 0, so in the scrambler correlation matrix of mark repeated code type mark R (i j) is repeated code, and in 576 16 value sequences, finds the minimal time delay chip number when repeated code occurring, and is being recorded as " heavy | X ", and X is the time delay number of repeated code; If scrambler to (i, two scramblers in j) belong to same basic scrambler group, in the scrambler correlation matrix of mark repeated code type, (i j) is " together " to mark R so.

The scrambler correlation matrix of mark repeated code type can but be not limited to as shown in table 5:

Table 5:

Generate the scrambler correlation matrix that divides SF and mark repeated code type then.

576 corr_value are determining scrambler to (how i, correlation properties j) need to consider through these 576 length it is that 16 correlated series reflects that scrambler is to (i is j) in different (SFi, SFj) correlation under the situation jointly.

Calculate max_value4, n12 and n16 through following manner:

max_value4(i，j，k，m，SF _i，SF _j)＝max{corr_value(i，j，k，m，l，SF _i，SF _j)}

n ₁₂＝{max_value4(i，j，k，m，SF _i，SF _j)＝12}

n ₁₆＝{max_value4(i，j，k，m，SF _i，SF _j)＝16}

Wherein, l=0,1,2,3,4,12,13,14,15.

Mean_max_value (i, account form j) is following:

$\mathrm{mean}\_\max \_\mathrm{value}(i,j,{\mathrm{SF}}_i,{\mathrm{SF}}_j)=\frac{7}{576}\&times;{\mathrm{<figure-callout\; id="12"\; label="n"\; filenames="HDA0000041973190000011.png,HDA0000041973190000021.png"\; state="\{\{state\}\}">n</figure-callout>}}_{12}$

Calculate scrambler to (i, (SF in 576 16 value sequences j) _i, SF _j) average of preceding 5 elements of scope and back 4 element averages:

$\mathrm{Average}\_\mathrm{value}4(i,j,{\mathrm{SF}}_i,{\mathrm{SF}}_j)=\frac{1}{\mathrm{ct}\left({\mathrm{SF}}_i\right)\&times;\mathrm{ct}\left({\mathrm{SF}}_j\right)}\&times;\underset{{\mathrm{SF}}_i=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}\underset{{\mathrm{SF}}_j=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}$

$\{\frac{1}{9}\&times;[\underset{l=0}{\overset{4}{\mathrm{\&Sigma;}}}\mathrm{corr}\_\mathrm{value}(i,j,k,m,l,{\mathrm{SF}}_i,{\mathrm{SF}}_j)+\underset{l=12}{\overset{15}{\mathrm{\&Sigma;}}}\mathrm{corr}\_\mathrm{value}(i,j,k,m,l,{\mathrm{SF}}_i,{\mathrm{SF}}_j)]$

Ct (SF _i) be that SF is being supported in first sub-district _iThe time the compound key number, ct (SF _j) be that SF is being supported in first sub-district _jThe time the compound key number.

With mean_max_value (i, j, SF _i, SF _j) and Average_value4 (i, j, SF _i, SF _j) addition, obtain:

R(i，j，SF _i，SF _j)＝mean_max_value(i，j，SF _i，SF _j)+Average_value4(i，j，SF _i，SF _j)

If n ₁₆≠ 0, mark R (i, j, SF in the scrambler correlation matrix of minute SF and mark repeated code type so _i, SF _j) be repeated code, and in 576 16 value sequences, find the minimal time delay chip number when repeated code occurring, and be recorded as " heavy | X ", X is the time delay number of repeated code; If scrambler to (i, two scramblers in j) belong to same basic scrambler group, so in the scrambler correlation matrix of minute SF and mark repeated code type, mark R (i, j, SF _i, SF _j) be " together ".

Divide SF and mark repeated code type the scrambler correlation matrix can but be not limited to as shown in table 6:

Table 6:

Can know by above-mentioned processing procedure, in the embodiment of the invention technical scheme, to the first adjacent sub-district and second sub-district; Confirm the SF weighted value of each SF that this sub-district is supported respectively,, select that to satisfy pre-conditioned scrambler right all scrambler centerings; Each scrambler to selecting is right, confirms the compound key correlation that this scrambler is right, and according to the SF weighted value of determining; The compound key correlation right to this scrambler carries out weighting, obtains the right comprehensive correlation of this scrambler, and it is right to select the minimum scrambler of comprehensive correlation; And the scrambler of selecting is right, the optimum scrambler of confirming as first sub-district and second sub-district is right and since the sub-district carry dissimilar when professional; The SF that supported maybe be different, so the SF weighted value of the SF that supports according to the sub-district of the embodiment of the invention, and the compound key correlation right to scrambler computes weighted; And then confirm that according to the comprehensive correlation that ranking operation obtains optimum scrambler is right, thereby reduced interference among adjacent cells effectively.

Provide more detailed execution mode below.

The scrambler that the embodiment of the invention proposes also goes in the scrambling code optimum process confirming that method goes in the scrambling code planning process, and is as shown in Figure 2, in the embodiment of the invention, and the scrambling planning method flow chart, its concrete processing procedure is following:

Step 21 extracts the resource data of waiting to plan the sub-district from resource database, comprise engineering parameters such as longitude and latitude data, base station deflection, base station angle of declination;

Step 22 according to data such as the longitude and latitude that obtains in the step 21, deflections, confirms to wait to plan the position relation of sub-district, i.e. the distance of each minizone and angle;

Step 23, to each sub-district to be planned, calculate the normalization switching times that arrives neighbor cell in this sub-district to be planned with;

Step 24, according to the normalization switching times and the descending order that step 23 calculates, the sub-district ordering with respectively to be planned forms cell list;

Step 25 waits to plan sub-district and second sub-district to be planned in the cell list first, confirms the SF weighted value of each SF that this sub-district is supported respectively, and wherein sub-district and second sub-district to be planned are waited to plan for first in this sub-district;

Step 26 all scrambler centerings, selects that to satisfy pre-conditioned scrambler right;

Step 27, right to each scrambler of selecting, confirm the compound key correlation that this scrambler is right;

Step 28, right to each scrambler of selecting, according to the SF weighted value that step 25 is determined, the compound key correlation right to this scrambler carries out weighting, obtains the right comprehensive correlation of this scrambler;

Step 29, it is right to select the minimum scrambler of comprehensive correlation, and this scrambler is right to being optimum scrambler;

Step 210 is distributed to first respectively with two scramblers of this optimum scrambler centering and is waited to plan sub-district and second sub-district to be planned;

Step 211, according to aforesaid way for respectively waiting to plan the plot planning scrambler;

Step 212, the result that step 211 is obtained are carried out figure and are appeared with data and export;

Step 213, whether determining step 211 resulting results need is further optimized, if judged result for being, then goes to step 23, if judged result then goes to step 214 for not;

Step 214, form is exported the result that step 210 obtains according to the rules;

Step 215 is accomplished scrambling code planning.

As shown in Figure 3, in the embodiment of the invention, the scrambling code optimum method flow diagram, its concrete processing procedure is following:

Step 31 extracts the resource data of sub-district to be optimized from resource database, comprise engineering parameters such as longitude and latitude data, base station deflection, base station angle of declination;

Step 32 according to data such as the longitude and latitude that obtains in the step 31, deflections, is confirmed the position relation of sub-district to be optimized, i.e. the distance of each minizone and angle;

Step 33, to each sub-district to be optimized, calculate this sub-district to be optimized to the normalization switching times of neighbor cell with;

Step 34, according to the normalization switching times and the descending order that step 33 calculates, the sub-district ordering that each is to be optimized forms cell list;

Step 35 to each sub-district to be optimized, judges whether this sub-district has carried out scrambling code planning, if judged result for being, then goes to step 314, if judged result then goes to step 36 for not;

Step 36, to this sub-district and the neighbor cell adjacent with this sub-district, the SF weighted value of each SF that confirms respectively to be supported;

Step 37 all scrambler centerings, selects that to satisfy pre-conditioned scrambler right, and the scrambler centering of wherein selecting comprises the scrambler of above-mentioned neighbor cell;

Step 38, right to each scrambler of selecting, confirm the compound key correlation that this scrambler is right;

Step 39, right to each scrambler of selecting, according to the SF weighted value that step 36 is determined, the compound key correlation right to this scrambler carries out weighting, obtains the right comprehensive correlation of this scrambler;

Step 310, it is right to select the minimum scrambler of comprehensive correlation, and this scrambler is right to being optimum scrambler;

Step 311 judges that whether the normalization switching times that arrives above-mentioned neighbor cell in this sub-district is greater than the normalization switching times of this sub-district to other neighbor cells;

Step 312, if the judged result of step 311 is for being, then should the scrambler of optimum scrambler centering except that the scrambler of this neighbor cell, distribute to this sub-district;

Step 313 is optimized each sub-district of not planning according to aforesaid way;

Step 314 is accomplished scrambling code optimum.

Accordingly, the embodiment of the invention also provides a kind of scrambler to confirming device, and is as shown in Figure 4, comprises that first confirms unit 41, first selected cell, 42, second definite unit 43, weighted units 44, second selected cell 45 and the 3rd definite unit 46, wherein:

First confirms unit 41, is used for to adjacent first sub-district and second sub-district, confirms the SF weighted value of each SF that this sub-district is supported respectively;

First selected cell 42 is used for all scrambler centerings, selects that to satisfy pre-conditioned scrambler right;

Second confirms unit 43, and each scrambler that is used for selecting to first selected cell 42 is right, confirms the compound key correlation that this scrambler is right;

Weighted units 44, each scrambler that is used for selecting to first selected cell 42 is right, confirms the SF weighted value that unit 41 is determined according to first, confirms that to second the compound key correlation that unit 43 is determined carries out weighting, obtains the right comprehensive correlation of this scrambler;

Second selected cell 45, it is right to be used to select the minimum scrambler of comprehensive correlation;

The 3rd confirms unit 46, and the scrambler that is used for second selected cell 45 is selected is right, and the optimum scrambler of confirming as first sub-district and second sub-district is right.

Preferably, first confirms that unit 41 comprises that specifically first confirms subelement, acquisition subelement and second definite subelement, wherein:

First confirms subelement, is used for to adjacent first sub-district and second sub-district, and the type of service of the miscellaneous service that carries according to this sub-district is respectively confirmed each SF that supports this sub-district;

Obtain subelement, be used for to adjacent first sub-district and second sub-district, obtain respectively first confirm each SF that subelement is determined the number of times that takies;

Second confirms subelement; Be used for to adjacent first sub-district and second sub-district; With the ratio that takies the number of times sum that takies number of times and all SF of each SF that obtains the subelement acquisition, confirm as the SF weighted value of this SF in all SF that supported of supporting this sub-district.

Preferably, said SF is:

Up SF; Or

Descending SF; Or

Up SF and descending SF.

Preferably, saidly pre-conditionedly be:

Two scramblers of this scrambler centering do not belong to same basic scrambler group; And

When first sub-district and each SF of second sub-district support, all there is not repeated code in all right compound keys of this scrambler; And

The scrambler of scrambler of this scrambler centering and other neighbor cells of first sub-district does not all belong to same basic scrambler group, and the scrambler of other neighbor cells of another scrambler of this scrambler centering and second sub-district does not all belong to same basic scrambler group; And

If first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, and then this scrambler centering comprises the scrambler of second sub-district.

More preferably, if first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, and then said scrambler comprises also that to confirming device the 4th confirms unit, first judging unit and first allocation units, wherein:

The 4th confirms the unit, is used for confirming the normalization switching times of first sub-district to second sub-district;

First judging unit, be used to judge first sub-district to the normalization switching times of second sub-district whether greater than the normalization switching times of first sub-district to other neighbor cells;

First allocation units are used in the judged result of first judging unit when being, confirm the scrambler of optimum scrambler centering except that the scrambler of second sub-district that unit 46 is determined with the 3rd, distribute to first sub-district.

More preferably, if first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, and then said scrambler comprises also that to confirming device the 5th confirms unit, the 6th definite unit, second judging unit and second allocation units, wherein:

The 5th confirms the unit, is used for confirming the normalization switching times of first sub-district to second sub-district;

The 6th confirms the unit, is used for confirming the comprehensive correlation that normalization switching times that the unit is determined and weighted units 44 weightings obtain according to the 5th, confirms the comprehensive correlation of the right switching times of this optimum scrambler;

Second judging unit is used to judge that whether the comprehensive correlation of determining the 6th definite unit of switching times is less than the comprehensive correlation of the right switching times of the optimum scrambler of first sub-district and other neighbor cells;

Second allocation units are used in the disconnected result of second judging unit when being, confirm the scrambler of optimum scrambler centering except that the scrambler of second sub-district that unit 46 is determined with the 3rd, distribute to first sub-district.

Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.

Claims (16)

1. a scrambler is characterized in that confirming method, comprising:

To the first adjacent sub-district and second sub-district, confirm the spreading factor weighted value of each spreading factor that this sub-district is supported respectively;

All scrambler centerings, select that to satisfy pre-conditioned scrambler right;

Each scrambler to selecting is right, confirms the compound key correlation that this scrambler is right, and according to the spreading factor weighted value of determining, the compound key correlation right to this scrambler carries out weighting, obtains the right comprehensive correlation of this scrambler;

It is right to select the minimum scrambler of comprehensive correlation; And

The scrambler of selecting is right, and the optimum scrambler of confirming as first sub-district and second sub-district is right.

2. scrambler as claimed in claim 1 is characterized in that confirming method, to the first adjacent sub-district and second sub-district, confirms the spreading factor weighted value of each spreading factor that this sub-district is supported respectively, specifically comprises:

To the first adjacent sub-district and second sub-district, carry out respectively:

The type of service of the miscellaneous service that carries according to this sub-district is confirmed each spreading factor of supporting this sub-district;

Each spreading factor that acquisition is determined take number of times;

With the ratio that takies the number of times sum that takies number of times and all spreading factors of each spreading factor that obtains, confirm as the spreading factor weighted value of this spreading factor in all spreading factors of being supported of supporting this sub-district.

3. scrambler as claimed in claim 1 is characterized in that to confirming method said spreading factor is:

Up spreading factor; Or

Descending spreading factor; Or

Up spreading factor and descending spreading factor.

4. scrambler as claimed in claim 3 is characterized in that confirming method, if said spreading factor is up spreading factor, then confirms the comprehensive correlation that this scrambler is right through following manner:

$\mathrm{corr}(i,j)\&CenterDot;\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}({\mathrm{\&Delta;}}_m\&CenterDot;{\mathrm{\&Delta;}}_k)$

Wherein, (i is that scrambler is to (i, compound key correlation j) j) to corr;

Δ _kIt is the spreading factor weighted value of the up spreading factor k that supports of first sub-district;

Δ _mIt is the spreading factor weighted value of the up spreading factor m that supports of second sub-district.

5. scrambler as claimed in claim 3 is characterized in that confirming method, if said spreading factor is descending spreading factor, then confirms the comprehensive correlation that this scrambler is right through following manner:

$\mathrm{corr}(i,j)\&CenterDot;\underset{m=\mathrm{1,16}}{\mathrm{\&Sigma;}}\underset{k=\mathrm{1,16}}{\mathrm{\&Sigma;}}\left({\mathrm{\&Delta;}}_m^{\&prime;}{\&CenterDot;\mathrm{\&Delta;}}_k^{\&prime;}\right)$

Wherein, (i is that scrambler is to (i, compound key correlation j) j) to corr;

Δ ' _kIt is the spreading factor weighted value of the descending spreading factor k that supports of first sub-district;

Δ ' _mIt is the spreading factor weighted value of the descending spreading factor m that supports of second sub-district.

6. scrambler as claimed in claim 3 is characterized in that confirming method, if said spreading factor is descending spreading factor and descending spreading factor, then confirms the descending comprehensive correlation that this scrambler is right through following manner:

$\mathrm{corr}(i,j)\&CenterDot;(\frac{\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}({\mathrm{\&Delta;}}_m\&CenterDot;{\mathrm{\&Delta;}}_k\&CenterDot;\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}{\mathrm{ssfup}}_k)}{\underset{k=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}{\mathrm{ssfup}}_k\underset{k=\mathrm{1,16}}{\mathrm{\&Sigma;}}{\mathrm{ssfdw}}_k}+\frac{\underset{m=\mathrm{1,16}}{\mathrm{\&Sigma;}}\underset{k=\mathrm{1,16}}{\mathrm{\&Sigma;}}({\mathrm{\&Delta;}}_m^{\&prime;}\&CenterDot;{\mathrm{\&Delta;}}_k^{\&prime;}\&CenterDot;\underset{m=\mathrm{1,16}}{\mathrm{\&Sigma;}}{\mathrm{ssfdw}}_m)}{\underset{m=\mathrm{1,2,4,8,16}}{\mathrm{\&Sigma;}}{\mathrm{ssfup}}_m\underset{m=\mathrm{1,16}}{\mathrm{\&Sigma;}}{\mathrm{ssfdw}}_m})$

Wherein, (i is that scrambler is to (i, compound key correlation j) j) to corr;

Δ _kIt is the spreading factor weighted value of the up spreading factor k that supports of first sub-district;

Δ _mIt is the spreading factor weighted value of the up spreading factor m that supports of second sub-district;

Δ ' _kIt is the spreading factor weighted value of the descending spreading factor k that supports of first sub-district;

Δ ' _mIt is the spreading factor weighted value of the descending spreading factor m that supports of second sub-district;

Ssfup _kIt is the number of times that takies of the up spreading factor k that supports of first sub-district;

Ssfdw _kIt is the number of times that takies of the descending spreading factor k that supports of first sub-district;

Ssfup _mIt is the number of times that takies of the up spreading factor m that supports of second sub-district;

Ssfdw _mIt is the number of times that takies of the descending spreading factor m that supports of second sub-district.

7. scrambler as claimed in claim 1 is characterized in that confirming method, saidly pre-conditionedly is:

Two scramblers of this scrambler centering do not belong to same basic scrambler group; And

When first sub-district and each spreading factor of second sub-district support, all there is not repeated code in all right compound keys of this scrambler; And

The scrambler of scrambler of this scrambler centering and other neighbor cells of first sub-district does not all belong to same basic scrambler group, and the scrambler of other neighbor cells of another scrambler of this scrambler centering and second sub-district does not all belong to same basic scrambler group; And

If first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, and then this scrambler centering comprises the scrambler of second sub-district.

8. scrambler as claimed in claim 7 is characterized in that to confirming method if first sub-district is the sub-district of scrambler to be allocated, second sub-district then also comprises for distributing the sub-district of scrambler:

Confirm the normalization switching times of first sub-district to second sub-district;

Judge first sub-district to the normalization switching times of second sub-district whether greater than the normalization switching times of first sub-district to other neighbor cells;

If judged result is for being, then should the scrambler of optimum scrambler centering except that the scrambler of second sub-district, distribute to first sub-district.

9. scrambler as claimed in claim 7 is characterized in that to confirming method if first sub-district is the sub-district of scrambler to be allocated, second sub-district then also comprises for distributing the sub-district of scrambler:

Confirm the normalization switching times of first sub-district to second sub-district;

According to the comprehensive correlation that the normalization switching times of determining and weighting obtain, confirm the comprehensive correlation of the right switching times of this optimum scrambler;

Judge that whether the comprehensive correlation of said switching times is less than the comprehensive correlation of the right switching times of the optimum scrambler of first sub-district and other neighbor cells;

If judged result is for being, then should the scrambler of optimum scrambler centering except that the scrambler of second sub-district, distribute to first sub-district.

Like claim 8 or 9 described scramblers to confirming method, it is characterized in that, confirm the normalization switching times of first sub-district to second sub-district, specifically comprise:

If first sub-district is identical with the main carrier frequency of second sub-district,, confirm as the normalization switching times of first sub-district to second sub-district then with the switching times of first sub-district to second sub-district;

If first sub-district is different with the main carrier frequency of second sub-district, then with first sub-district to the switching times of second sub-district and the ratio of alien frequencies rejection ratio, confirm as the normalization switching times of first sub-district to second sub-district.

11. a scrambler is characterized in that confirming device, comprising:

First confirms the unit, is used for to adjacent first sub-district and second sub-district, confirms the spreading factor weighted value of each spreading factor that this sub-district is supported respectively;

First selected cell is used for all scrambler centerings, selects that to satisfy pre-conditioned scrambler right;

Second confirms the unit, and each scrambler that is used for selecting to first selected cell is right, confirms the compound key correlation that this scrambler is right;

Weighted units, each scrambler that is used for selecting to first selected cell is right, confirms the spreading factor weighted value that the unit is determined according to first, confirms that to second the compound key correlation that the unit is determined carries out weighting, obtains the right comprehensive correlation of this scrambler;

Second selected cell, it is right to be used to select the minimum scrambler of comprehensive correlation;

The 3rd confirms the unit, and the scrambler that is used for second selected cell is selected is right, and the optimum scrambler of confirming as first sub-district and second sub-district is right.

12. scrambler as claimed in claim 11 is characterized in that to confirming device first confirms that the unit specifically comprises:

First confirms subelement, is used for to adjacent first sub-district and second sub-district, and the type of service of the miscellaneous service that carries according to this sub-district is respectively confirmed each spreading factor of supporting this sub-district;

Obtain subelement, be used for to adjacent first sub-district and second sub-district, obtain respectively first confirm each spreading factor that subelement is determined the number of times that takies;

Second confirms subelement; Be used for to adjacent first sub-district and second sub-district; With the ratio that takies the number of times sum that takies number of times and all spreading factors of each spreading factor that obtains the subelement acquisition, confirm as the spreading factor weighted value of this spreading factor in all spreading factors of being supported of supporting this sub-district.

13. scrambler as claimed in claim 11 is characterized in that to confirming device said spreading factor is:

Up spreading factor; Or

Descending spreading factor; Or

Up spreading factor and descending spreading factor.

14. scrambler as claimed in claim 11 is characterized in that confirming device, saidly pre-conditionedly is:

Two scramblers of this scrambler centering do not belong to same basic scrambler group; And

When first sub-district and each spreading factor of second sub-district support, all there is not repeated code in all right compound keys of this scrambler; And

The scrambler of scrambler of this scrambler centering and other neighbor cells of first sub-district does not all belong to same basic scrambler group, and the scrambler of other neighbor cells of another scrambler of this scrambler centering and second sub-district does not all belong to same basic scrambler group; And

If first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, and then this scrambler centering comprises the scrambler of second sub-district.

15. scrambler as claimed in claim 14 is characterized in that to confirming device if first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, then said scrambler is to confirming that device also comprises:

The 4th confirms the unit, is used for confirming the normalization switching times of first sub-district to second sub-district;

First judging unit, be used to judge first sub-district to the normalization switching times of second sub-district whether greater than the normalization switching times of first sub-district to other neighbor cells;

First allocation units are used in the judged result of first judging unit when being, confirm the scrambler of optimum scrambler centering except that the scrambler of second sub-district that the unit is determined with the 3rd, distribute to first sub-district.

16. scrambler as claimed in claim 14 is characterized in that to confirming device if first sub-district is the sub-district of scrambler to be allocated, second sub-district is for distribute the sub-district of scrambler, then said scrambler is to confirming that device also comprises:

The 5th confirms the unit, is used for confirming the normalization switching times of first sub-district to second sub-district;

The 6th confirms the unit, is used for confirming the comprehensive correlation that normalization switching times that the unit is determined and weighted units weighting obtain according to the 5th, confirms the comprehensive correlation of the right switching times of this optimum scrambler;

Second judging unit is used to judge that whether the comprehensive correlation of determining the 6th definite unit of switching times is less than the comprehensive correlation of the right switching times of the optimum scrambler of first sub-district and other neighbor cells;

Second allocation units are used in the disconnected result of second judging unit when being, confirm the scrambler of optimum scrambler centering except that the scrambler of second sub-district that the unit is determined with the 3rd, distribute to first sub-district.

Images