CN102571256B - 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

Scrambling code pair determination method and device

Technical field

The present invention relates to communication technical field, relate in particular to a kind of scrambling code pair determination method and device.

Background technology

It is basic access mode 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 communities with different code words.In order to realize beehive net structure, different cdma systems has all defined the scheme that different separately code words is used and distributed.

The code word that TD SDMA (TD-SCDMA, Time Division-Synchronous Code DivisionMultiple Access) system is used can be divided into according to type: spreading code, downlink frequency pilot code, ascending pilot frequency code, scrambler, training sequence (midamble) code.The corresponding relation of downlink frequency pilot code, ascending pilot frequency code, 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 codes, 128 scramblers and 128 basic midamble codes are divided into 32 basic scrambler groups, each basic scrambler group comprises 1 downlink frequency pilot code, 8 ascending pilot frequency codes, 4 scramblers and 4 basic midamble codes, and scrambler is one to one with basic midamble code.

Wherein, ascending pilot frequency code is used in random access procedure by subscriber equipment, and the downlink frequency pilot code that the ascending pilot frequency Ma Yu community of each community is used has certain corresponding relation, corresponding 8 the ascending pilot frequency codes of downlink frequency pilot code; Scrambler is used for distinguishing different communities, and using the process of scrambler scrambling is exactly in user's data message, to add the characteristic information of community, when user receives the signal from a plurality of communities, just can identify wherein the to one's name signal of community, place like this; Midamble code is the training sequence of spread spectrum burst, can be used for carrying out channel estimating, synchronous, identification base station etc., and in community, the midamble code of different channels is to be produced according to certain skew by basic midamble code; The spreading code channel code that is otherwise known as, be mainly used to data to carry out spread spectrum according to different spreading factors, in order to guarantee spreading factor (SF different on same time slot, Spreading Factor) spreading code is quadrature, General Requirements spreading code is Orthogonal Variable Spreading Factor OVSF (OVSF, Orthogonal Variable Spreading Factor) code, TD-SCDMA system adopts spreading code to distinguish physical channels different in same community.

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

Because the scrambler Length Ratio of TD-SCDMA system is shorter, only there are 16 chip, and the Length Ratio 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 situation that adopt lower SF in uplink process, a chip number corresponding to symbol will be lower than 16, scrambler only has part segment to work, and minizone occurs that the probability that compound key overlaps will be larger.Closer when laying respectively at the user distance of two adjacent communities, and when the compound key that the ovsf code distributing obtains after multiplying each other with scrambler overlaps, just may there is distinguishing the situation of different user and different districts, now the co-channel interference between neighbor cell is very large, when this disturbs greatly when affecting the demodulation performance of base-band physical layer, can cause the deterioration of link performance, thereby affect the capacity of system.

Therefore, when carrying out scrambling code planning and optimizing, mostly, by calculating the compound key correlation of two scramblers of scrambler centering, two of scrambler centering scramblers are carried out to correlation evaluation at present, as far as possible by the little scrambler of correlation to distributing to adjacent Liang Ge community.

As shown in table 2, the right compound key correlation of each scrambler is single value, characterizes the average of Liao Liangge community in miscellaneous service situation, or the situation of Liang Ge community when zero load.

Table 2:

But in existing network, the customer group that community covers is different, user uses the situation of business also different, therefore when different business is carried in community, just different from the disturbed condition between other communities, if still determine the optimum scrambler pair of two neighbor cells according to the right compound key correlation of scrambler, may cause the interference of minizone larger, when the traffic carrying capacity of TD-SCDMA system increases, this disturbed condition is even more serious.

Summary of the invention

The embodiment of the present invention provides a kind of scrambling code pair determination method and device, in order to solve in prior art, exist owing to determining the optimum scrambler pair of two neighbor cells according to the right compound key correlation of scrambler, thereby cause the larger problem of interference of minizone.

Embodiment of the present invention technical scheme is as follows:

A scrambling code pair determination method, the method comprising the steps of: for the first adjacent community and the second community, determine respectively the spreading factor weighted value of each spreading factor that this community is supported; All scrambler centerings, select and meet pre-conditioned scrambler pair; For each scrambler pair of selecting, determine 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 is weighted, obtain the right comprehensive correlation of this scrambler; Select the scrambler pair of comprehensive correlation minimum; And by the scrambler pair of selecting, be defined as the optimum scrambler pair of the first community and the second community.

Scrambler, to a determining device, comprising: the first determining unit, for the first community for adjacent and the second community, determine respectively the spreading factor weighted value of each spreading factor that this community is supported; The first selected cell, for all scrambler centerings, selects and meets pre-conditioned scrambler pair; The second determining unit, for each scrambler pair of selecting for the first selected cell, determines the compound key correlation that this scrambler is right; Weighted units, for each scrambler pair of selecting for the first selected cell, the spreading factor weighted value of determining according to the first determining unit, the compound key correlation that the second determining unit is determined is weighted, and obtains the right comprehensive correlation of this scrambler; The second selected cell, for selecting the scrambler pair of comprehensive correlation minimum; The 3rd determining unit, for the scrambler pair that the second selected cell is selected, is defined as the optimum scrambler pair of the first community and the second community.

In embodiment of the present invention technical scheme, for the first adjacent community and the second community, determine respectively the SF weighted value of each SF that this community is supported, all scrambler centerings, select and meet pre-conditioned scrambler pair, for each scrambler pair of selecting, determine 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 is weighted, obtain the right comprehensive correlation of this scrambler, select the scrambler pair of comprehensive correlation minimum, and by the scrambler pair of selecting, be defined as the optimum scrambler pair of the first community and the second community, because community is when carrying dissimilar business, the SF supporting may be different, therefore the SF weighted value of the SF that the embodiment of the present invention is supported according to community, the compound key correlation right to scrambler computes weighted, and then the comprehensive correlation obtaining according to ranking operation is determined optimum scrambler pair, thereby effectively reduced the interference between neighbor cell.

Accompanying drawing explanation

Fig. 1 is in the embodiment of the present invention, scrambling code pair determination method schematic flow sheet;

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

Fig. 3 is in the embodiment of the present invention, scrambling code optimizing method schematic flow sheet;

Fig. 4 is in the embodiment of the present invention, and scrambler is to determining device structural representation.

Embodiment

Below in conjunction with each accompanying drawing, embodiment of the present invention technical scheme main realized to principle, embodiment and the beneficial effect that should be able to reach is at length set forth.

As shown in Figure 1, in the embodiment of the present invention, scrambling code pair determination method flow chart, its concrete processing procedure is as follows:

Step 11, for the first adjacent community and the second community, determines respectively the SF weighted value of each SF that this community is supported;

The embodiment of the present invention need to be determined the SF weighted value of each SF that the first community is supported, and the SF weighted value of each SF of supporting of the second community, and therefore above-mentioned this community is the first community and the second community.

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

Table 3:

Therefore, when the dissimilar business of little area carrier, the SF that this community is supported may be different, and different SF makes the correlation between the right compound key of scrambler different, therefore when the correlation of investigating between compound key, take into full account the situation of the SF supporting community.

The SF weighted value that can be, but not limited to determine according to following manner each SF supporting community in the embodiment of the present invention, is specially:

Table 3 has provided the corresponding relation of type of service and SF, therefore for the first adjacent community and the second community, the type of service of the miscellaneous service carrying according to this community first respectively, determine each SF that this community is supported, then obtain the number of times that takies of each SF determine, again by the ratio that takies number of times sum that takies number of times and all SF of each SF obtaining, be defined as this SF of supporting this community SF weighted value in supported all SF.For example, in the first community, the number of times that takies of SF=1 is V ₁, the number of times sum that takies of all SF is V ₂, the SF weighted value of SF=1 is V ₁/ V ₂.

In addition, because uplink service is different with the SF that downlink business is used, while therefore supporting up SF and descending SF, the correlation of compound key is also different, in the embodiment of the present invention, above-mentioned SF can be up SF, also can be descending SF, can also be up SF and descending SF, the ratio that takies number of times sum that takies number of times and all up SF that the SF weighted value of each up SF is this up SF, the SF weighted value of each descending SF is the ratio that takies number of times sum that takies number of times and all descending SF of this descending SF.

Step 12, all scrambler centerings, selects and meets pre-conditioned scrambler pair;

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

In the embodiment of the present invention, can study in advance in the situation that supporting various SF, the composite code correlation that scrambler is right, generate the scrambler correlation matrix of minute SF and mark repeated code type, if two right scramblers of scrambler belong to same basic scrambler group, these two scramblers are labeled as " together " in this matrix, if there is repeated code in the compound key of two scramblers that scrambler is right, these two scramblers are labeled as the time delay number that " heavy | " can also further calculate repeated code in this matrix, then be recorded in after " heavy | ", for example " heavy | 4 ".

For example, if the community that the first community is scrambler to be allocated, the second community is for distributing the community of scrambler, scrambler is to (i, j) the scrambler j in is the scrambler of the second community, the scrambler of other neighbor cells of scrambler i and the first community does not all belong to same basic scrambler group, the scrambler of other neighbor cells of scrambler j and the second community does not all belong to same basic scrambler group, for scrambler to (i, j), known by searching the scrambler correlation matrix of above-mentioned minute SF and mark repeated code type, two right scramblers of this scrambler do not belong to same basic scrambler group, and travel through all SF situations, all there is not repeated code in its corresponding compound key, now this scrambler to (i, j) for meeting pre-conditioned scrambler pair.

If all scrambler centerings, can only find the scrambler that belongs to same scrambler group to there is the scrambler pair of repeated code with compound key, can exist the scrambler centering of repeated code to select a scrambler pair at compound key, the repeated code time delay number right due to scrambler is larger, illustrate that this scrambler is just less to the possibility of generation repeated code, therefore preferably, select the larger scrambler pair of time delay number.

Step 13, for each scrambler pair of selecting, determines 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 is weighted, and obtains the right comprehensive correlation of this scrambler;

All SF (SF=1,2,4,8,16) have 31 spreading codes that are multiplied by after complex-valued weights, and wherein unduplicated spreading code has 24, uses C _krepresent, k=1,2...24, as 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 the number of the spreading code that SF is 16 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 networking process, decision systems performance be the right composite code 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 has 24 * 24=576 corr_value to (i, j), and each corr_value is that length is 16 by the circular correlation sequence of compound key of scrambler i and a compound key of 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:

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

Wherein, symbol represent circular correlation.

Scrambler is that 576 corr_value (i, j, k, m) obtain through certain computing to the compound key correlation of (i, j).

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

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

The first community is adjacent with the second community, and scrambler is to meet a pre-conditioned scrambler pair, the up SF that the first community is supported to (i, j) _kthe number of times that takies be ssfup _k, Δ _kbe the up SF that the first community is supported _ksF weighted value, k=1,2,4,8,16 now; The up SF that the second community is supported _mthe number of times that takies be ssfup _m, Δ _mbe the up SF that the second community is supported _msF weighted value, m=1,2,4,8,16 now; The descending SF that the first community is supported _kthe number of times that takies be ssfdw _k, Δ ' _kbe the descending SF that the first community is supported _ksF weighted value, k=1,16 now; The descending SF that the second community is supported _mthe number of times that takies be ssfdw _m, Δ ' _mbe the descending SF that the second community is supported _msF weighted value, m=1,16 now; The compound key correlation of scrambler i and j is corr (i, j).

By following manner, calculate Δ 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}$

By following manner, determine the up comprehensive correlation of scrambler to (i, 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)$

By following manner, determine the descending comprehensive correlation of scrambler to (i, 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^{\′})$

By following manner, determine the two-way comprehensive correlation of scrambler to (i, 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, selects the scrambler pair of comprehensive correlation minimum;

Comprehensive correlation is minimum, illustrates that the correlation of two scramblers that this scrambler is right is less.

Step 15, by the scrambler pair of selecting, is defined as the optimum scrambler pair of the first community and the second community.

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

If the community that the first community is scrambler to be allocated, the second community is for distributing the community of scrambler, when being the first cell allocation scrambler, need to consider the switching times between the first He Ge neighbor cell, community, the embodiment of the present invention has proposed the concept of normalization switching times, if the first community is identical with the main carrier frequency of the second community, the switching times to the second community by the first community, be defined as the first community to the normalization switching times of the second community, if the first community is different from the main carrier frequency of the second community, by the first community to the switching times of the second community and the ratio of alien frequencies rejection ratio, be defined as the first community to the normalization switching times of the second community.Now, can be, but not limited to by following two kinds of methods of salary distribution is the first cell allocation scrambler, is specially:

The first method of salary distribution, determine that the first community is to the normalization switching times of the second community, judge whether the first community is greater than the first community to the normalization switching times of other neighbor cells to the normalization switching times of the second community, if the determination result is YES,, by the scrambler of this optimum scrambler centering except the scrambler of the second community, distribute to the first community;

The second method of salary distribution, determine that the first community is to the normalization switching times of the second community, the normalization switching times of determining is multiplied by the comprehensive correlation that weighting obtains, obtain the comprehensive correlation of the right switching times of this optimum scrambler, judge whether the comprehensive correlation of described switching times is less than the right comprehensive correlation of switching times of optimum scrambler of the first community and other neighbor cells, if the determination result is YES,, by the scrambler of this optimum scrambler centering except the scrambler of the second community, distribute to the first community.

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

First generate the scrambler correlation matrix of mark repeated code type.

Scrambler is to (i, j) correlation shows in 576 16 value sequence corr_value, correlation corresponding to time delay when the first five of 16 value sequences represents respectively 0chip time delay, 1chip time delay, 2chip time delay, 3chip time delay, 4chip time delay ,-1chip time delay ,-2chip time delay ,-3chip time delay ,-4chip with latter four, wherein the situation of i and j delay-correlated when 0chip is maximum, ± 1, ± 2, ± 3, ± within 4 o'clock, reduce successively.

Because the possible value of 16 elements in 16 value sequences is 0,4,8,12,16, by front 5 elements of 576 16 value sequence corr_value, (time delay is 0,1,2,3,4 chip) and the maximum of rear 4 elements (time delay for-1 ,-2 ,-3 ,-4chip) number that is greater than 8 (being 12 or 16) come out, be 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}\×n_{12}$

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

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

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

Mean_max_value (i, j) and Average_value4 (i, j) are added, obtain:

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

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

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

Table 5:

Then generate the scrambler correlation matrix of minute SF and mark repeated code type.

576 corr_value are determining the correlation properties of scrambler to (i, j) jointly, need to consider the correlated series how to be 16 by these 576 length reflect scrambler to (i, j) correlation in different (SFi, SFj) situation.

By following manner, calculate max_value4, n12 and n16:

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.

The account form of mean_max_value (i, j) is as follows:

$\mathrm{mean}\_\max \_\mathrm{value}(i,j,{\mathrm{SF}}_i,{\mathrm{SF}}_j)=\frac{7}{576}\×n_{12}$

Calculate scrambler to (SF in 576 of (i, j) 16 value sequences _i, SF _j) average of front 5 elements of scope and rear 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)\×\mathrm{ct}\left({\mathrm{SF}}_j\right)}\×\underset{{\mathrm{SF}}_i=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}\underset{{\mathrm{SF}}_j=\mathrm{1,2,4,8,16}}{\mathrm{\Σ}}$

$\{\frac{1}{9}\×[\underset{l=0}{\overset{4}{\mathrm{\Σ}}}\mathrm{corr}\_\mathrm{value}(i,j,k,m,l,{\mathrm{SF}}_i,{\mathrm{SF}}_j)+\underset{l=12}{\overset{15}{\mathrm{\Σ}}}\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 the first community _itime compound key number, ct (SF _j) be that SF is being supported in the first community _jtime compound key number.

By mean_max_value (i, j, SF _i, SF _j) and Average_value4 (i, j, SF _i, SF _j) be added, 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 while there is repeated code, and being recorded as " heavy | X ", the time delay number that X is repeated code; If scrambler belongs to same basic scrambler group to two scramblers in (i, j), 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 the scrambler correlation matrix of SF and mark repeated code type to can be, but not limited to as shown in table 6:

Table 6:

From above-mentioned processing procedure, in embodiment of the present invention technical scheme, for the first adjacent community and the second community, determine respectively the SF weighted value of each SF that this community is supported, all scrambler centerings, select and meet pre-conditioned scrambler pair, for each scrambler pair of selecting, determine 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 is weighted, obtain the right comprehensive correlation of this scrambler, select the scrambler pair of comprehensive correlation minimum, and by the scrambler pair of selecting, be defined as the optimum scrambler pair of the first community and the second community, because community is when carrying dissimilar business, the SF supporting may be different, therefore the SF weighted value of the SF that the embodiment of the present invention is supported according to community, the compound key correlation right to scrambler computes weighted, and then the comprehensive correlation obtaining according to ranking operation is determined optimum scrambler pair, thereby effectively reduced the interference between neighbor cell.

Provide more detailed execution mode below.

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

Step 21 extracts the resource data of community to be planned from resource database, comprises the 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 obtaining in step 21, deflections, determines the position relationship of community to be planned, i.e. the distance of each minizone and angle;

Step 23, for each community to be planned, calculate this community to be planned to the normalization switching times of neighbor cell and;

Step 24, normalization switching times and the descending order calculating according to step 23, by each community to be planned sequence, forms cell list;

Step 25, for first community to be planned in cell list and second community to be planned, determines respectively the SF weighted value of each SF that this community is supported, and wherein this community is first community to be planned and second community to be planned;

Step 26, all scrambler centerings, selects and meets pre-conditioned scrambler pair;

Step 27, for each scrambler pair of selecting, determines the compound key correlation that this scrambler is right;

Step 28, for each scrambler pair of selecting, the SF weighted value of determining according to step 25, the compound key correlation right to this scrambler is weighted, and obtains the right comprehensive correlation of this scrambler;

Step 29, selects the scrambler pair of comprehensive correlation minimum, and this scrambler is to being optimum scrambler pair;

Step 210, distributes to respectively first community to be planned and second community to be planned by two scramblers of this optimum scrambler centering;

Step 211 is each plot planning scrambler to be planned in the manner described above;

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

Step 213, whether the resulting result of determining step 211 needs to be optimized, and if the determination result is YES, goes to step 23, if the determination result is NO, goes to step 214;

Step 214, the result that formatted output step 210 obtains according to the rules;

Step 215, completes scrambling code planning.

As shown in Figure 3, in the embodiment of the present invention, scrambling code optimizing method flow chart, its concrete processing procedure is as follows:

Step 31 extracts the resource data of community to be optimized from resource database, comprises the 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 obtaining in step 31, deflections, determines the position relationship of community to be optimized, i.e. the distance of each minizone and angle;

Step 33, for each community to be optimized, calculate this community to be optimized to the normalization switching times of neighbor cell and;

Step 34, normalization switching times and the descending order calculating according to step 33, by each community to be optimized sequence, forms cell list;

Step 35, for each community to be optimized, judges whether this community has carried out scrambling code planning, if the determination result is YES, goes to step 314, if the determination result is NO, goes to step 36;

Step 36, for adjacent neighbor cell, He Yugai community, this community, determines respectively the SF weighted value of each SF supporting;

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

Step 38, for each scrambler pair of selecting, determines the compound key correlation that this scrambler is right;

Step 39, for each scrambler pair of selecting, the SF weighted value of determining according to step 36, the compound key correlation right to this scrambler is weighted, and obtains the right comprehensive correlation of this scrambler;

Step 310, selects the scrambler pair of comprehensive correlation minimum, and this scrambler is to being optimum scrambler pair;

Step 311, judges whether this community is greater than this community to the normalization switching times of other neighbor cells to the normalization switching times of above-mentioned neighbor cell;

Step 312, if judgment result is that of step 311 is, by the scrambler of this optimum scrambler centering except the scrambler of this neighbor cell, to distribute to this community;

Step 313, the community of in the manner described above each not being planned is optimized;

Step 314, completes scrambling code optimum.

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

The first determining unit 41, for the first community for adjacent and the second community, determines respectively the SF weighted value of each SF that this community is supported;

The first selected cell 42, for all scrambler centerings, selects and meets pre-conditioned scrambler pair;

The second determining unit 43, for each scrambler pair of selecting for the first selected cell 42, determines the compound key correlation that this scrambler is right;

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

The second selected cell 45, for selecting the scrambler pair of comprehensive correlation minimum;

The 3rd determining unit 46, for the scrambler pair that the second selected cell 45 is selected, is defined as the optimum scrambler pair of the first community and the second community.

Preferably, the first determining unit 41 specifically comprises that first determines subelement, acquisition subelement and second definite subelement, wherein:

First determines subelement, and for the first community for adjacent and the second community, the type of service of the miscellaneous service carrying according to this community respectively, determines each SF that this community is supported;

Obtain subelement, for the first community for adjacent and the second community, obtain respectively the first number of times that takies of determining each SF that subelement is determined;

Second determines subelement, be used for for the first adjacent community and the second community, to obtain the ratio that takies number of times sum that takies number of times and all SF of each SF that subelement obtains, be defined as this SF of supporting this community SF weighted value in supported all SF.

Preferably, described SF is:

Up SF; Or

Descending SF; Or

Up SF and descending SF.

Preferably, be describedly pre-conditionedly:

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

When each SF is supported in the first community and the second community, all there is not repeated code in the right all compound keys of this scrambler; And

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

If the community that the first community is scrambler to be allocated, the second community is for distributing the community of scrambler, the scrambler that this scrambler centering comprises the second community.

More preferably, if the community that the first community is scrambler to be allocated, the second community is for to distribute the community of scrambler, and described scrambler also comprises the 4th determining unit, the first judging unit and the first allocation units to determining device, wherein:

The 4th determining unit, for determining that the first community is to the normalization switching times of the second community;

The first judging unit, for judging whether the first community is greater than the first community to the normalization switching times of other neighbor cells to the normalization switching times of the second community;

The first allocation units, for when judgment result is that of the first judging unit is, the scrambler of the optimum scrambler centering that the 3rd determining unit 46 is determined except the scrambler of the second community, distributes to the first community.

More preferably, if the community that the first community is scrambler to be allocated, the second community is for to distribute the community of scrambler, and described scrambler also comprises the 5th determining unit, the 6th determining unit, the second judging unit and the second allocation units to determining device, wherein:

The 5th determining unit, for determining that the first community is to the normalization switching times of the second community;

The 6th determining unit, the comprehensive correlation obtaining for the normalization switching times determined according to the 5th determining unit and weighted units 44 weightings, determines the comprehensive correlation of the right switching times of this optimum scrambler;

The second judging unit, for judging whether the comprehensive correlation of switching times that the 6th determining unit is determined is less than the right comprehensive correlation of switching times of optimum scrambler of the first community and other neighbor cells;

The second allocation units, for the disconnected result at the second judging unit, when being, the scrambler of the optimum scrambler centering that the 3rd determining unit 46 is determined except the scrambler of the second community, distributes to the first community.

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

Claims (14)

1. a scrambling code pair determination method, is characterized in that, comprising:

For the first adjacent community and the second community, determine respectively the spreading factor weighted value of each spreading factor that this community is supported;

All scrambler centerings, select and meet pre-conditioned scrambler pair, be describedly pre-conditionedly: two scramblers of this scrambler centering do not belong to same basic scrambler group; And when each spreading factor is supported in the first community and the second community, all there is not repeated code in the right all compound keys of this scrambler; And the scrambler of scrambler of this scrambler centering and other neighbor cells of the first community all do not belong to same basic scrambler group, and the scrambler of another scrambler of this scrambler centering and other neighbor cells of the second community does not all belong to same basic scrambler group; And if the community that is scrambler to be allocated, the first community, the second community is for having distributed the community of scrambler, the scrambler that this scrambler centering comprises the second community;

For each scrambler pair of selecting, determine 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 is weighted, obtain the right comprehensive correlation of this scrambler;

Select the scrambler pair of comprehensive correlation minimum; And

By the scrambler pair of selecting, be defined as the optimum scrambler pair of the first community and the second community.

2. scrambling code pair determination method as claimed in claim 1, is characterized in that, for the first adjacent community and the second community, determines respectively the spreading factor weighted value of each spreading factor that this community is supported, specifically comprises:

For the first adjacent community and the second community, carry out respectively:

The type of service of the miscellaneous service carrying according to this community, determines each spreading factor that this community is supported;

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

By the ratio that takies number of times sum that takies number of times and all spreading factors of each spreading factor obtaining, be defined as this spreading factor of supporting this community spreading factor weighted value in supported all spreading factors.

3. scrambling code pair determination method as claimed in claim 1, is characterized in that, described spreading factor is:

Up spreading factor; Or

Descending spreading factor; Or

Up spreading factor and descending spreading factor.

4. scrambling code pair determination method as claimed in claim 3, is characterized in that, if described spreading factor is up spreading factor, by following manner, determines the comprehensive correlation that this scrambler is right:

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

Wherein, the meaning of " " representative " taking advantage of ";

Corr (i, j) is the compound key correlation of scrambler to (i, j);

Δ _kit is the spreading factor weighted value of the up spreading factor k that supports of the first community;

Δ _mit is the spreading factor weighted value of the up spreading factor m that supports of the second community.

5. scrambling code pair determination method as claimed in claim 3, is characterized in that, if described spreading factor is descending spreading factor, by following manner, determines the comprehensive correlation that this scrambler is right:

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

Wherein, the meaning of " " representative " taking advantage of ";

Corr (i, j) is the compound key correlation of scrambler to (i, j);

Δ ' _kit is the spreading factor weighted value of the descending spreading factor k that supports of the first community;

Δ ' _mit is the spreading factor weighted value of the descending spreading factor m that supports of the second community.

6. scrambling code pair determination method as claimed in claim 3, is characterized in that, if described spreading factor is up spreading factor and descending spreading factor, by following manner, determines the descending comprehensive correlation that this scrambler is right:

$\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})$

Wherein, the meaning of " " representative " taking advantage of ";

Corr (i, j) is the compound key correlation of scrambler to (i, j);

Δ _kit is the spreading factor weighted value of the up spreading factor k that supports of the first community;

Δ _mit is the spreading factor weighted value of the up spreading factor m that supports of the second community;

Δ ' _kit is the spreading factor weighted value of the descending spreading factor k that supports of the first community;

Δ ' _mit is the spreading factor weighted value of the descending spreading factor m that supports of the second community;

Ssfup _kit is the number of times that takies of the up spreading factor k that supports of the first community;

Ssfdw _kit is the number of times that takies of the descending spreading factor k that supports of the first community;

Ssfup _mit is the number of times that takies of the up spreading factor m that supports of the second community;

Ssfdw _mit is the number of times that takies of the descending spreading factor m that supports of the second community.

7. scrambling code pair determination method as claimed in claim 1, is characterized in that, if the community that the first community is scrambler to be allocated, the second community, for to distribute the community of scrambler, also comprises:

Determine that the first community is to the normalization switching times of the second community;

Judge whether the first community is greater than the first community to the normalization switching times of other neighbor cells to the normalization switching times of the second community;

If the determination result is YES,, by the scrambler of this optimum scrambler centering except the scrambler of the second community, distribute to the first community.

8. scrambling code pair determination method as claimed in claim 1, is characterized in that, if the community that the first community is scrambler to be allocated, the second community, for to distribute the community of scrambler, also comprises:

Determine that the first community is to the normalization switching times of the second community;

The comprehensive correlation obtaining according to the normalization switching times of determining and weighting, determines the comprehensive correlation of the right switching times of this optimum scrambler;

Judge whether the comprehensive correlation of described switching times is less than the right comprehensive correlation of switching times of optimum scrambler of the first community and other neighbor cells;

If the determination result is YES,, by the scrambler of this optimum scrambler centering except the scrambler of the second community, distribute to the first community.

9. scrambling code pair determination method as claimed in claim 7 or 8, is characterized in that, determines that the first community, to the normalization switching times of the second community, specifically comprises:

If the first community is identical with the main carrier frequency of the second community, the switching times to the second community by the first community, is defined as the first community to the normalization switching times of the second community;

If the first community is different from the main carrier frequency of the second community, by the first community to the switching times of the second community and the ratio of alien frequencies rejection ratio, be defined as the first community to the normalization switching times of the second community.

10. scrambler, to a determining device, is characterized in that, comprising:

The first determining unit, for the first community for adjacent and the second community, determines respectively the spreading factor weighted value of each spreading factor that this community is supported;

The first selected cell, for all scrambler centerings, selects and meets pre-conditioned scrambler pair, is describedly pre-conditionedly: two scramblers of this scrambler centering do not belong to same basic scrambler group; And when each spreading factor is supported in the first community and the second community, all there is not repeated code in the right all compound keys of this scrambler; And the scrambler of scrambler of this scrambler centering and other neighbor cells of the first community all do not belong to same basic scrambler group, and the scrambler of another scrambler of this scrambler centering and other neighbor cells of the second community does not all belong to same basic scrambler group; And if the community that is scrambler to be allocated, the first community, the second community is for having distributed the community of scrambler, the scrambler that this scrambler centering comprises the second community;

The second determining unit, for each scrambler pair of selecting for the first selected cell, determines the compound key correlation that this scrambler is right;

Weighted units, for each scrambler pair of selecting for the first selected cell, the spreading factor weighted value of determining according to the first determining unit, the compound key correlation that the second determining unit is determined is weighted, and obtains the right comprehensive correlation of this scrambler;

The second selected cell, for selecting the scrambler pair of comprehensive correlation minimum;

The 3rd determining unit, for the scrambler pair that the second selected cell is selected, is defined as the optimum scrambler pair of the first community and the second community.

11. scramblers as claimed in claim 10, to determining device, is characterized in that, the first determining unit specifically comprises:

First determines subelement, and for the first community for adjacent and the second community, the type of service of the miscellaneous service carrying according to this community respectively, determines each spreading factor that this community is supported;

Obtain subelement, for the first community for adjacent and the second community, obtain respectively the first number of times that takies of determining each spreading factor that subelement is determined;

Second determines subelement, be used for for the first adjacent community and the second community, to obtain the ratio that takies number of times sum that takies number of times and all spreading factors of each spreading factor that subelement obtains, be defined as this spreading factor of supporting this community spreading factor weighted value in supported all spreading factors.

12. scramblers as claimed in claim 10, to determining device, is characterized in that, described spreading factor is:

Up spreading factor; Or

Descending spreading factor; Or

Up spreading factor and descending spreading factor.

13. scramblers as claimed in claim 10, to determining device, is characterized in that, if the community that the first community is scrambler to be allocated, the second community is for to distribute the community of scrambler, and described scrambler also comprises determining device:

The 4th determining unit, for determining that the first community is to the normalization switching times of the second community;

The first judging unit, for judging whether the first community is greater than the first community to the normalization switching times of other neighbor cells to the normalization switching times of the second community;

The first allocation units, for when judgment result is that of the first judging unit is, the scrambler of the optimum scrambler centering that the 3rd determining unit is determined except the scrambler of the second community, distributes to the first community.

14. scramblers as claimed in claim 10, to determining device, is characterized in that, if the community that the first community is scrambler to be allocated, the second community is for to distribute the community of scrambler, and described scrambler also comprises determining device:

The 5th determining unit, for determining that the first community is to the normalization switching times of the second community;

The 6th determining unit, the comprehensive correlation obtaining for the normalization switching times determined according to the 5th determining unit and weighted units weighting, determines the comprehensive correlation of the right switching times of this optimum scrambler;

The second judging unit, for judging whether the comprehensive correlation of switching times that the 6th determining unit is determined is less than the right comprehensive correlation of switching times of optimum scrambler of the first community and other neighbor cells;

The second allocation units, for the disconnected result at the second judging unit, when being, the scrambler of the optimum scrambler centering that the 3rd determining unit is determined except the scrambler of the second community, distributes to the first community.