CN102571256A

Movatterモバイル変換

Info

Publication number: CN102571256A
Application number: CN2010106165870A
Authority: CN
Inventors: 位莅; 吕雪峰; 王治国; 顾涛
Original assignee: China Mobile Group Shandong Co Ltd
Current assignee: China Mobile Group Shandong Co Ltd
Priority date: 2010-12-30
Filing date: 2010-12-30
Publication date: 2012-07-11
Anticipated expiration: 2030-12-30
Also published as: CN102571256B

Abstract

本发明公开了一种扰码对确定方法及装置，该方法包括步骤：针对相邻的第一小区和第二小区，分别确定该小区所支持的每个扩频因子的扩频因子权重值；在所有扰码对中，选择出满足预设条件的扰码对；针对选择出的每个扰码对，确定该扰码对的复合码相关值，并根据确定出的扩频因子权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值；选择出综合相关值最小的扰码对；并将选择出的扰码对，确定为第一小区和第二小区的最优扰码对。采用本发明技术方案，解决了现有技术中存在的由于根据扰码对的复合码相关值来确定两个相邻小区的最优扰码对，从而造成小区间的干扰较大的问题。

The invention discloses a method and device for determining a scrambling code pair. The method includes the steps of: respectively determining the weight value of the spreading factor of each spreading factor supported by the cell for the adjacent first cell and the second cell; Among all the scrambling code pairs, select the scrambling code pair that meets the preset condition; for each selected scrambling code pair, determine the composite code correlation value of the scrambling code pair, and according to the determined spreading factor weight value, Weighting the composite code correlation value of the scrambling code pair to obtain the comprehensive correlation value of the scrambling code pair; selecting the scrambling code pair with the smallest comprehensive correlation value; and determining the selected scrambling code pair as the first cell and the second cell The optimal scrambling code pair for the second cell. The technical solution of the present invention solves the problem in the prior art that the optimal scrambling code pair of two adjacent cells is determined according to the composite code correlation value of the scrambling code pair, resulting in relatively large interference between cells.

Description

Translated fromChinese

扰码对确定方法及装置Method and device for determining scrambling code pair

技术领域technical field

本发明涉及通信技术领域，尤其涉及一种扰码对确定方法及装置。The present invention relates to the field of communication technologies, in particular to a method and device for determining a scrambling code pair.

背景技术Background technique

第三代移动通信系统广泛采用了以码分多址(CDMA，Code DivisionMultiple Access)为基础的多址接入方式，其基本特征就是以不同的码字来区分不同的用户以及不同的小区。为了实现蜂窝组网结构，不同的CDMA系统都定义了各自不同的码字使用和分配的方案。The third-generation mobile communication system widely adopts the multiple access mode based on Code Division Multiple Access (CDMA, Code Division Multiple Access), and its basic feature is to distinguish different users and different cells with different code words. In order to realize the cellular network structure, different CDMA systems have defined different schemes for using and distributing codewords.

时分同步码分多址(TD-SCDMA，Time Division-Synchronous Code DivisionMultiple Access)系统所使用的码字按照类型可以分为：扩频码、下行导频码、上行导频码、扰码、训练序列(midamble)码。下行导频码、上行导频码、扰码和基本midamble码间的对应关系如表1所示：The code words used in Time Division-Synchronous Code Division Multiple Access (TD-SCDMA, Time Division-Synchronous Code Division Multiple Access) system can be divided into: spreading code, downlink pilot code, uplink pilot code, scrambling code, training sequence according to the type (midamble) code. The corresponding relationship between downlink pilot code, uplink pilot code, scrambling code and basic midamble code is shown in Table 1:

表1：Table 1:

如表1所示，将32个下行导频码、256个上行导频码、128个扰码和128个基本midamble码分为32个基本扰码组，每个基本扰码组中包括1个下行导频码、8个上行导频码、4个扰码和4个基本midamble码，扰码与基本midamble码是一一对应的。As shown in Table 1, 32 downlink pilot codes, 256 uplink pilot codes, 128 scrambling codes and 128 basic midamble codes are divided into 32 basic scrambling code groups, and each basic scrambling code group includes 1 Downlink pilot codes, 8 uplink pilot codes, 4 scrambling codes and 4 basic midamble codes. The scrambling codes correspond to the basic midamble codes one by one.

其中，上行导频码由用户设备在随机接入过程中使用，每个小区的上行导频码与小区所使用的下行导频码有一定的对应关系，一个下行导频码对应8个上行导频码；扰码用来区分不同的小区，使用扰码加扰的过程就是在用户的数据信息中添加小区的特征信息，这样当用户接收到来自多个小区的信号时，就能够识别出其中属于自己所在小区的信号；midamble码是扩频突发的训练序列，可以用来进行信道估计、同步、识别基站等，小区中不同信道的midamble码是由基本midamble码按照一定的偏移产生的；扩频码又被称为信道码，主要用来对数据按照不同的扩频因子进行扩频，为了保证在同一时隙上不同的扩频因子(SF，Spreading Factor)的扩频码是正交的，一般要求扩频码是正交可变扩频因子(OVSF，Orthogonal Variable Spreading Factor)码，TD-SCDMA系统采用扩频码来区分同一小区内不同的物理信道。Among them, the uplink pilot code is used by the user equipment in the random access process, and the uplink pilot code of each cell has a certain corresponding relationship with the downlink pilot code used by the cell. One downlink pilot code corresponds to 8 uplink pilot codes. Frequency code; scrambling code is used to distinguish different cells. The process of using scrambling code scrambling is to add the characteristic information of the cell to the user's data information, so that when the user receives signals from multiple cells, he can identify the cell. The signal belonging to the own cell; the midamble code is the training sequence of the spread spectrum burst, which can be used for channel estimation, synchronization, identification of the base station, etc. The midamble codes of different channels in the cell are generated by the basic midamble code according to a certain offset The spreading code is also called the channel code, which is mainly used to spread the data according to different spreading factors, in order to ensure that the spreading codes of different spreading factors (SF, Spreading Factor) on the same time slot are positive In general, the spreading code is required to be an Orthogonal Variable Spreading Factor (OVSF, Orthogonal Variable Spreading Factor) code, and the TD-SCDMA system uses the spreading code to distinguish different physical channels in the same cell.

TD-SCDMA系统在小区内区分不同的用户依靠的是OVSF码，其中在下行方向仅使用SF＝1或16的OVSF码，在上行方向则可以使用SF＝1，2，4，8或16的OVSF码。用户区分不同的小区依靠的是长度为16个码片(Chip)的扰码。在同频组网的条件下，一般使用OVSF码与扰码按位相乘之后得到的复合码来区分不同小区间不同用户的数据。The TD-SCDMA system distinguishes different users in the cell by means of OVSF codes, in which only OVSF codes with SF=1 or 16 are used in the downlink direction, and SF=1, 2, 4, 8 or 16 codes can be used in the uplink direction OVSF code. The user distinguishes different cells by means of a scrambling code with a length of 16 chips (Chip). Under the condition of the same-frequency networking, the composite code obtained after bitwise multiplication of the OVSF code and the scrambling code is generally used to distinguish the data of different users in different cells.

由于TD-SCDMA系统的扰码长度比较短，仅有16个chip，并且SF的长度比较短，也是16个chip，因此不同小区间的复合码就存在重合的情况，特别是在上行传输过程中采用较低的SF的情况下，一个符号对应的chip数将低于16，扰码仅有部分片断起作用，小区间出现复合码重合的概率将会更大。当分别位于两个相邻的小区的用户距离比较近，并且所分配的OVSF码与扰码相乘后得到的复合码重合时，就可能会出现不能区分不同用户以及不同小区的情况，此时相邻小区间的同频干扰非常大，当此干扰大到影响基带物理层的解调性能时，会造成链路性能的恶化，从而影响了系统的容量。Since the length of the scrambling code in the TD-SCDMA system is relatively short, only 16 chips, and the length of the SF is relatively short, also 16 chips, the composite codes between different cells overlap, especially in the uplink transmission process In the case of a lower SF, the number of chips corresponding to a symbol will be less than 16, and only part of the scrambling code works, and the probability of composite code overlap between cells will be greater. When the distance between users located in two adjacent cells is relatively close, and the composite code obtained by multiplying the assigned OVSF code and the scrambling code overlaps, it may not be possible to distinguish between different users and different cells. The same-channel interference between adjacent cells is very large. When the interference is large enough to affect the demodulation performance of the baseband physical layer, it will cause the deterioration of the link performance, thereby affecting the capacity of the system.

因此，目前在进行扰码规划及优化时，大多通过计算扰码对中两个扰码的复合码相关值，来对扰码对中的两个扰码进行相关性评价，尽量将相关性小的扰码对分配给相邻的两个小区。Therefore, at present, when planning and optimizing scrambling codes, the correlation value of the two scrambling codes in the scrambling code pair is mostly calculated by calculating the composite code correlation value of the two scrambling codes in the scrambling code pair, and the correlation is as small as possible. The scrambling code pairs are assigned to two adjacent cells.

如表2所示，每个扰码对的复合码相关值为单一值，表征了两个小区在各种业务情况下的均值，或者是两个小区在空载时的情况。As shown in Table 2, the composite code correlation value of each scrambling code pair is a single value, representing the average value of the two cells under various service conditions, or the situation of the two cells under no load.

表2：Table 2:

但是在现网中，小区覆盖的用户群不同，用户使用业务的情况也不同，因此当小区承载不同的业务时，与其他小区之间的干扰情况就不同，若依然根据扰码对的复合码相关值来确定两个相邻小区的最优扰码对，则可能造成小区间的干扰较大，当TD-SCDMA系统的业务量增大时，这种干扰情况更为严重。However, in the current network, the user groups covered by the cell are different, and the service conditions of the users are also different. Therefore, when the cell carries different services, the interference with other cells is different. If the composite code of the scrambling code pair is still If the correlation value is used to determine the optimal scrambling code pair of two adjacent cells, the interference between the cells may be relatively large. When the traffic volume of the TD-SCDMA system increases, the interference situation is even more serious.

发明内容Contents of the invention

本发明实施例提供一种扰码对确定方法及装置，用以解决现有技术中存在的由于根据扰码对的复合码相关值来确定两个相邻小区的最优扰码对，从而造成小区间的干扰较大的问题。Embodiments of the present invention provide a method and device for determining a scrambling code pair to solve the problem in the prior art that the optimal scrambling code pair for two adjacent cells is determined according to the composite code correlation value of the scrambling code pair, resulting in The problem of large interference between cells.

本发明实施例技术方案如下：The technical scheme of the embodiment of the present invention is as follows:

一种扰码对确定方法，该方法包括步骤：针对相邻的第一小区和第二小区，分别确定该小区所支持的每个扩频因子的扩频因子权重值；在所有扰码对中，选择出满足预设条件的扰码对；针对选择出的每个扰码对，确定该扰码对的复合码相关值，并根据确定出的扩频因子权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值；选择出综合相关值最小的扰码对；并将选择出的扰码对，确定为第一小区和第二小区的最优扰码对。A method for determining a scrambling code pair, the method comprising the steps of: respectively determining the spreading factor weight value of each spreading factor supported by the cell for adjacent first and second cells; in all scrambling code pairs , select the scrambling code pair that meets the preset conditions; for each selected scrambling code pair, determine the composite code correlation value of the scrambling code pair, and according to the determined spreading factor weight value, the The composite code correlation value is weighted to obtain the comprehensive correlation value of the scrambling code pair; the scrambling code pair with the smallest comprehensive correlation value is selected; and the selected scrambling code pair is determined as the optimal scrambling code pair for the first cell and the second cell Code pair.

一种扰码对确定装置，包括：第一确定单元，用于针对相邻的第一小区和第二小区，分别确定该小区所支持的每个扩频因子的扩频因子权重值；第一选择单元，用于在所有扰码对中，选择出满足预设条件的扰码对；第二确定单元，用于针对第一选择单元选择出的每个扰码对，确定该扰码对的复合码相关值；加权单元，用于针对第一选择单元选择出的每个扰码对，根据第一确定单元确定出的扩频因子权重值，对第二确定单元确定出的复合码相关值进行加权，得到该扰码对的综合相关值；第二选择单元，用于选择出综合相关值最小的扰码对；第三确定单元，用于将第二选择单元选择出的扰码对，确定为第一小区和第二小区的最优扰码对。A device for determining a scrambling code pair, comprising: a first determining unit, configured to respectively determine a spreading factor weight value of each spreading factor supported by the adjacent first cell and a second cell; the first The selection unit is used to select the scrambling code pair satisfying the preset condition among all the scrambling code pairs; the second determination unit is used to determine the scrambling code pair for each scrambling code pair selected by the first selection unit. Composite code correlation value; weighting unit, for each scrambling code pair selected by the first selection unit, according to the spreading factor weight value determined by the first determination unit, for the composite code correlation value determined by the second determination unit performing weighting to obtain the comprehensive correlation value of the scrambling code pair; the second selection unit is used to select the scrambling code pair with the smallest comprehensive correlation value; the third determination unit is used to select the scrambling code pair selected by the second selection unit, Determine the optimal scrambling code pair for the first cell and the second cell.

本发明实施例技术方案中，针对相邻的第一小区和第二小区，分别确定该小区所支持的每个SF的SF权重值，在所有扰码对中，选择出满足预设条件的扰码对，针对选择出的每个扰码对，确定该扰码对的复合码相关值，并根据确定出的SF权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值，选择出综合相关值最小的扰码对，并将选择出的扰码对，确定为第一小区和第二小区的最优扰码对，由于小区在承载不同类型的业务时，所支持的SF可能不同，因此本发明实施例根据小区所支持的SF的SF权重值，对扰码对的复合码相关值进行加权运算，然后再根据加权运算得到的综合相关值确定最优扰码对，从而有效地降低了相邻小区间的干扰。In the technical solution of the embodiment of the present invention, for the adjacent first cell and the second cell, the SF weight value of each SF supported by the cell is respectively determined, and among all the scrambling code pairs, the scrambling code that satisfies the preset condition is selected. For each selected scrambling code pair, determine the composite code correlation value of the scrambling code pair, and weight the composite code correlation value of the scrambling code pair according to the determined SF weight value to obtain the scrambling code The comprehensive correlation value of the pair, select the scrambling code pair with the smallest comprehensive correlation value, and determine the selected scrambling code pair as the optimal scrambling code pair for the first cell and the second cell, because the cells are carrying different types of services , the supported SFs may be different. Therefore, according to the SF weight value of the SF supported by the cell, the embodiment of the present invention performs a weighted operation on the composite code correlation value of the scrambling code pair, and then determines the optimal Optimized scrambling code pairs, thus effectively reducing the interference between adjacent cells.

附图说明Description of drawings

图1为本发明实施例中，扰码对确定方法流程示意图；FIG. 1 is a schematic flowchart of a method for determining a scrambling code pair in an embodiment of the present invention;

图2为本发明实施例中，扰码规划方法流程示意图；FIG. 2 is a schematic flowchart of a scrambling code planning method in an embodiment of the present invention;

图3为本发明实施例中，扰码优化方法流程示意图；FIG. 3 is a schematic flowchart of a scrambling code optimization method in an embodiment of the present invention;

图4为本发明实施例中，扰码对确定装置结构示意图。Fig. 4 is a schematic structural diagram of an apparatus for determining a scrambling code pair in an embodiment of the present invention.

具体实施方式Detailed ways

下面结合各个附图对本发明实施例技术方案的主要实现原理、具体实施方式及其对应能够达到的有益效果进行详细地阐述。The main realization principles, specific implementation modes and corresponding beneficial effects of the technical solutions of the embodiments of the present invention will be described in detail below in conjunction with each accompanying drawing.

如图1所示，为本发明实施例中，扰码对确定方法流程图，其具体处理过程如下：As shown in FIG. 1, it is a flowchart of a method for determining a scrambling code pair in an embodiment of the present invention, and its specific processing process is as follows:

步骤11，针对相邻的第一小区和第二小区，分别确定该小区所支持的每个SF的SF权重值；Step 11, for the adjacent first cell and the second cell, respectively determine the SF weight value of each SF supported by the cell;

本发明实施例需要确定第一小区所支持的每个SF的SF权重值，以及第二小区所支持的每个SF的SF权重值，因此上述该小区为第一小区和第二小区。The embodiment of the present invention needs to determine the SF weight value of each SF supported by the first cell and the SF weight value of each SF supported by the second cell, so the above-mentioned cells are the first cell and the second cell.

其中，不同类型的业务在TD-SCDMA系统中可能对应不同的SF，表3给出了业务类型与SF的对应关系。Among them, different types of services may correspond to different SFs in the TD-SCDMA system. Table 3 shows the corresponding relationship between service types and SFs.

表3：table 3:

由上可见，当小区承载不同类型的业务时，该小区所支持的SF可能不同，不同的SF使得扰码对的复合码之间的相关性不同，因此在考察复合码之间的相关性时，要充分考虑小区支持的SF的情况。It can be seen from the above that when a cell carries different types of services, the SF supported by the cell may be different, and different SFs make the correlation between the composite codes of the scrambling code pairs different. Therefore, when examining the correlation between the composite codes , it is necessary to fully consider the situation of the SF supported by the cell.

本发明实施例中可以但不限于根据下述方式确定小区所支持的每个SF的SF权重值，具体为：In the embodiment of the present invention, the SF weight value of each SF supported by the cell can be determined, but not limited to, in the following manner, specifically:

表3给出了业务类型和SF的对应关系，因此针对相邻的第一小区和第二小区，首先分别根据该小区所承载的各种业务的业务类型，确定该小区所支持的各SF，然后获得确定出的每个SF的占用次数，再将获得的每个SF的占用次数与所有SF的占用次数之和的比值，确定为该小区所支持的该SF在所支持的所有SF中的SF权重值。例如，在第一小区中，SF＝1的占用次数为V₁，所有SF的占用次数之和为V₂，则SF＝1的SF权重值为V₁/V₂。Table 3 shows the corresponding relationship between service types and SFs. Therefore, for the adjacent first and second cells, first determine the SFs supported by the cell according to the service types of the various services carried by the cell. Then obtain the determined occupancy times of each SF, and then determine the ratio of the obtained occupancy times of each SF to the sum of the occupancy times of all SFs as the ratio of the SF supported by the cell among all the supported SFs SF weight value. For example, in the first cell, the occupation times of SF=1 is V₁ , and the sum of occupation times of all SFs is V₂ , then the SF weight value of SF=1 is V₁ /V₂ .

此外，由于上行业务和下行业务使用的SF不同，因此支持上行SF和下行SF时，复合码的相关性也不同，本发明实施例中，上述SF可以为上行SF，也可以为下行SF，还可以为上行SF和下行SF，每个上行SF的SF权重值为该上行SF的占用次数与所有上行SF的占用次数之和的比值，每个下行SF的SF权重值为该下行SF的占用次数与所有下行SF的占用次数之和的比值。In addition, since the SF used by the uplink service and the downlink service are different, when the uplink SF and the downlink SF are supported, the correlation of the composite code is also different. In the embodiment of the present invention, the above SF may be the uplink SF or the downlink SF, It can be uplink SF and downlink SF. The SF weight value of each uplink SF is the ratio of the occupancy times of the uplink SF to the sum of the occupancy times of all uplink SFs. The SF weight value of each downlink SF is the occupancy times of the downlink SF. Ratio to the sum of occupation times of all downlink SFs.

步骤12，在所有扰码对中，选择出满足预设条件的扰码对；Step 12, among all the scrambling code pairs, select the scrambling code pair satisfying the preset condition;

由于相邻小区的扰码不能属于同一个基本扰码组，因此第一小区和第二小区的扰码对中的两个扰码不能为同一个基本扰码组中的扰码，且该扰码对中的一个扰码与第一小区的其他相邻小区的扰码均不属于同一个基本扰码组，另一个扰码与第二小区的其他相邻小区的扰码均不属于同一个基本扰码组；若第一小区为待分配扰码的小区，第二小区为已分配扰码的小区，则该扰码对中应包含第二小区的扰码；在第一小区和第二小区支持各SF(第一小区支持SF_i，第二小区支持SF_j，i＝1，2，4，8，16，j＝1，2，4，8，16)时，该扰码对的所有复合码应均不存在重码。Since the scrambling codes of adjacent cells cannot belong to the same basic scrambling code group, the two scrambling codes in the scrambling code pair of the first cell and the second cell cannot be in the same basic scrambling code group, and the scrambling codes One of the scrambling codes in the code pair does not belong to the same basic scrambling code group as the scrambling codes of other adjacent cells of the first cell, and the other scrambling code does not belong to the same basic scrambling code group as the scrambling codes of other adjacent cells of the second cell. Basic scrambling code group; if the first cell is a cell to be assigned a scrambling code and the second cell is a cell to which a scrambling code has been assigned, the scrambling code pair shall include the scrambling code of the second cell; When the cell supports each SF (the first cell supports SF_i , the second cell supports SF_j , i=1, 2, 4, 8, 16, j=1, 2, 4, 8, 16), the scrambling code pair All composite codes should have no repeated codes.

本发明实施例中，可以预先研究在支持各种SF的情况下，扰码对的复合码相关性，生成分SF且标记重码类型的扰码相关性矩阵，若扰码对的两个扰码属于同一个基本扰码组，则这两个扰码在该矩阵中标记为“同”，若扰码对的两个扰码的复合码出现重码，则这两个扰码在该矩阵中标记为“重|”还可以进一步计算出重码的时延数，然后记录在“重|”后，例如“重|4”。In the embodiment of the present invention, it is possible to pre-study the composite code correlation of the scrambling code pair in the case of supporting various SFs, and generate a scrambling code correlation matrix that divides the SF and marks the repeated code type. If the two scrambling codes of the scrambling code pair belong to the same basic scrambling code group, the two scrambling codes are marked as "same" in the matrix, and if the composite code of the two scrambling codes of the scrambling code pair has repeated codes, the two scrambling codes are marked in the matrix The time delay of the repeated code can be further calculated for "heavy|", and then recorded after "heavy|", for example, "heavy|4".

例如，若第一小区为待分配扰码的小区，第二小区为已分配扰码的小区，扰码对(i，j)中的扰码j为第二小区的扰码，扰码i与第一小区的其他相邻小区的扰码均不属于同一个基本扰码组，扰码j与第二小区的其他相邻小区的扰码均不属于同一个基本扰码组，则针对扰码对(i，j)，通过查找上述分SF且标记重码类型的扰码相关性矩阵可知，该扰码对的两个扰码不属于同一个基本扰码组，并且遍历所有SF情况，其对应的复合码均不存在重码，则此时该扰码对(i，j)为满足预设条件的扰码对。For example, if the first cell is a cell to be assigned a scrambling code, and the second cell is a cell to which a scrambling code has been assigned, the scrambling code j in the scrambling code pair (i, j) is the scrambling code of the second cell, and the scrambling code i and The scrambling codes of other adjacent cells of the first cell do not belong to the same basic scrambling code group, and the scrambling code j and the scrambling codes of other adjacent cells of the second cell do not belong to the same basic scrambling code group, then for the scrambling code For (i, j), by looking up the scrambling code correlation matrix that is divided into SF and marked with repeated code types, it can be known that the two scrambling codes of the scrambling code pair do not belong to the same basic scrambling code group, and traversing all SF cases, the corresponding There is no repeated code in any of the composite codes, then the scrambling code pair (i, j) is a scrambling code pair satisfying the preset condition at this time.

若在所有扰码对中，只能查找到属于同一个扰码组的扰码对和复合码存在重码的扰码对，则可以在复合码存在重码的扰码对中选择一个扰码对，由于扰码对的重码时延数越大，说明该扰码对发生重码的可能性就越小，因此较佳地，选择时延数较大的扰码对。If among all the scrambling code pairs, only the scrambling code pairs belonging to the same scrambling code group and the scrambling code pairs with repeated codes in the composite code can be found, you can select a scrambling code pair among the scrambling code pairs with repeated codes in the composite code, Since the greater the recoding time delay of the scrambling code pair, the possibility of recoding the scrambling code pair is smaller, so it is preferable to select the scrambling code pair with a larger time delay.

步骤13，针对选择出的每个扰码对，确定该扰码对的复合码相关值，并根据确定出的SF权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值；Step 13, for each selected scrambling code pair, determine the composite code correlation value of the scrambling code pair, and according to the determined SF weight value, weight the composite code correlation value of the scrambling code pair to obtain the scrambling code The comprehensive correlation value of the pair;

所有的SF(SF＝1，2，4，8，16)共有31个乘以复数权值后的扩频码，其中不重复的扩频码共有24个，用C_k表示，k＝1，2...24，如表4所：All SFs (SF=1, 2, 4, 8, 16) have a total of 31 spreading codes multiplied by complex weights, wherein there are 24 non-repetitive spreading codes, represented by C_k , k=1, 2...24, as shown in Table 4:

表4：Table 4:

其中，SF为1或者2的扩频码数量为1个，SF为4或者8的扩频码的个数为3个，SF为16的扩频码的个数为16个。Wherein, the number of spreading codes with SF being 1 or 2 is 1, the number of spreading codes with SF being 4 or 8 is 3, and the number of spreading codes with SF being 16 is 16.

扰码i和24个扩频码相乘后会有24个复合码SC_i，k，k＝1，2......24，同样，扰码j和24个扩频码相乘后会有24个复合扩频扰码SC_j，m，m＝1，2......24。After the scrambling code i is multiplied by 24 spreading codes, there will be 24 composite codes SC_{i, k} , k=1, 2...24, similarly, after the scrambling code j is multiplied by 24 spreading codes There will be 24 composite spreading scrambling codes SC_j,m , m=1, 2...24.

在组网过程中，决定系统性能的是扰码对的复合码相关性，而不是简单的扰码相关性，因此我们需考察复合码SC_i，k和复合码SC_j，m的循环相关性corr_value(i，j，k，m)。扰码对(i，j)共有24×24＝576个corr_value，每个corr_value都是由扰码i的一个复合码和扰码j的一个复合码的循环相关序列，长度是16。若扰码i和扩频码C_k的复合码为SC_i，k，扰码j和扩频码C_k的复合码为SC_j，m，i、j＝1，2......128，k、m＝1，2......24，则：In the process of networking, it is the composite code correlation of the scrambling code pair, not the simple scrambling code correlation, that determines the system performance. Therefore, we need to investigate the circular correlation of the composite code SC_{i, k} and the composite code SC_{j, m} corr_value(i, j, k, m). The scrambling code pair (i, j) has 24×24=576 corr_values in total, and each corr_value is a cyclic correlation sequence consisting of a composite code of scrambling code i and a composite code of scrambling code j, with a length of 16. If the composite code of scrambling code i and spreading code C_k is SC_{i, k} , the composite code of scrambling code j and spreading code C_k is SC_{j, m} , i, j=1, 2... 128, k, m=1, 2...24, then:

$corr corr__value value ((i i,, j j,, k k,, m m)) = = {SC SC}_{i i,, k k} &CircleTimes; &CircleTimes; {SC SC}_{j j,, m m}$

其中，符号

表示循环相关。Among them, the symbol

Indicates circular correlation.

扰码对(i，j)的复合码相关值为576个corr_value(i，j，k，m)经过一定运算得到的。The composite code correlation value of the scrambling code pair (i, j) is obtained through certain calculations of 576 corr_values (i, j, k, m).

本发明实施例提出，可以根据上行SF的SF权重值确定综合相关值，此时该综合相关值也可以称为上行综合相关值；也可以根据下行SF的SF权重值确定综合相关值，此时该综合相关值也可以称为下行综合相关值；还可以根据上行SF的SF权重值和下行SF的SF权重值确定综合相关值，此时该综合相关值也可以称为双向综合相关值。According to the embodiment of the present invention, the comprehensive correlation value can be determined according to the SF weight value of the uplink SF, and the comprehensive correlation value can also be called the uplink comprehensive correlation value at this time; the comprehensive correlation value can also be determined according to the SF weight value of the downlink SF, at this time The integrated correlation value may also be called a downlink integrated correlation value; the integrated correlation value may also be determined according to the SF weight value of the uplink SF and the SF weight value of the downlink SF, and in this case, the integrated correlation value may also be called a bidirectional integrated correlation value.

下面分别介绍如何确定上行综合相关值、下行综合相关值和双向综合相关值。The following describes how to determine the uplink comprehensive correlation value, the downlink comprehensive correlation value and the two-way comprehensive correlation value respectively.

第一小区与第二小区相邻，扰码对(i，j)为满足预设条件的一个扰码对，第一小区所支持的上行SF_k的占用次数为ssfup_k，Δ_k为第一小区所支持的上行SF_k的SF权重值，此时k＝1、2、4、8、16；第二小区所支持的上行SF_m的占用次数为ssfup_m，Δ_m为第二小区所支持的上行SF_m的SF权重值，此时m＝1、2、4、8、16；第一小区所支持的下行SF_k的占用次数为ssfdw_k，Δ′_k为第一小区所支持的下行SF_k的SF权重值，此时k＝1、16；第二小区所支持的下行SF_m的占用次数为ssfdw_m，Δ′_m为第二小区所支持的下行SF_m的SF权重值，此时m＝1、16；扰码i和j的复合码相关值为corr(i，j)。The first cell is adjacent to the second cell, and the scrambling code pair (i, j) is a scrambling code pair that satisfies the preset conditions. The uplink SF_k occupation times supported by the first cell is ssfup_k , and Δ_k is the first The SF weight value of the uplink SF_k supported by the cell, at this time k=1, 2, 4, 8, 16; the occupation times of the uplink SF_m supported by the second cell is ssfup_m , and Δ_m is supported by the second cell The SF weight value of the uplink SF_m , at this time m=1, 2, 4, 8, 16; the number of occupancy times of the downlink SF_k supported by the first cell is ssfdw_k , and Δ′_k is the downlink supported by the first cell The SF weight value of SF_k , at this time k=1, 16; the occupancy times of the downlink SF_m supported by the second cell is ssfdw_m , and Δ′_m is the SF weight value of the downlink SF_m supported by the second cell, where When m=1, 16; the composite code correlation value of scrambling codes i and j is corr(i, j).

分别通过下述方式计算得到Δ_k、Δ_m、Δ′_k和Δ′_m：Δ_k , Δ_m , Δ′_k and Δ′_m are calculated by the following methods:

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

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

${Δ Δ}_{k k}^{' '} = = \frac{{ssfdw ssfdw}_{k k}}{\underset{k k = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{k k}}$

${Δ Δ}_{m m}^{' '} = = \frac{{ssfdw ssfdw}_{m m}}{\underset{m m = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{m m}}$

通过下述方式确定扰码对(i，j)的上行综合相关值

Determine the uplink comprehensive correlation value of the scrambling code pair (i, j) in the following way

$\overset{&OverBar; &OverBar;}{corr corr__up up ((i i,, j j))} = = corr corr ((i i,, j j)) \cdot &Center Dot; \underset{m m = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} \underset{k k = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} (({Δ Δ}_{m m} \cdot &Center Dot; {Δ Δ}_{k k}))$

通过下述方式确定扰码对(i，j)的下行综合相关值

Determine the downlink comprehensive correlation value of the scrambling code pair (i, j) in the following way

$\overset{&OverBar; &OverBar;}{corr corr__dw dw ((i i,, j j))} = = corr corr ((i i,, j j)) \cdot &Center Dot; \underset{m m = = 1,16 1,16}{Σ Σ} \underset{k k = = 1,16 1,16}{Σ Σ} (({Δ Δ}_{m m}^{' '} \cdot &Center Dot; {Δ Δ}_{k k}^{' '}))$

通过下述方式确定扰码对(i，j)的双向综合相关值

Determine the two-way comprehensive correlation value of the scrambling code pair (i, j) in the following way

$\overset{&OverBar; &OverBar;}{((corr corr__both both ((i i,, j j))} = = \frac{\overset{&OverBar; &OverBar;}{corr corr__up up ((i i,, j j))} \cdot &Center Dot; \underset{k k = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} {ssfup ssfup}_{k k}}{\underset{k k = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} {ssfup ssfup}_{k k} \underset{k k = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{k k}} + + \frac{\overset{&OverBar; &OverBar;}{corr corr__dw dw {((i i,, j j))}_{k k}} \cdot &Center Dot; \underset{m m = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{m m}}{\underset{m m = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} {ssfup ssfup}_{m m} \underset{m m = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{m m}}$

$= = corr corr ((i i,, j j)) \cdot &Center Dot; ((\frac{\underset{m m = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} \underset{k k = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} (({Δ Δ}_{m m} \cdot &Center Dot; {Δ Δ}_{k k} \cdot &Center Dot; \underset{k k = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} {ssfup ssfup}_{k k}))}{\underset{k k = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} {ssfup ssfup}_{k k} \underset{k k = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{k k}} + + \frac{\underset{m m = = 1,16 1,16}{Σ Σ} \underset{k k = = 1,16 1,16}{Σ Σ} (({Δ Δ}_{m m}^{' '} \cdot &Center Dot; {Δ Δ}_{k k}^{' '} \cdot &Center Dot; \underset{m m = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{m m}))}{\underset{m m = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} {ssfup ssfup}_{m m} \underset{m m = = 1,16 1,16}{Σ Σ} {ssfdw ssfdw}_{m m}}$

步骤14，选择出综合相关值最小的扰码对；Step 14, selecting the scrambling code pair with the smallest integrated correlation value;

综合相关值最小，说明该扰码对的两个扰码的相关性越小。The smallest comprehensive correlation value indicates that the correlation between the two scrambling codes of the scrambling code pair is smaller.

步骤15，将选择出的扰码对，确定为第一小区和第二小区的最优扰码对。Step 15, determine the selected scrambling code pair as the optimal scrambling code pair for the first cell and the second cell.

若第一小区和第二小区均为待分配扰码的小区，则在确定出第一小区和第二小区的最优扰码对之后，可以直接将该扰码对中的两个扰码分别分配给第一小区和第二小区。If both the first cell and the second cell are cells to be assigned scrambling codes, after determining the optimal scrambling code pair for the first cell and the second cell, the two scrambling codes in the scrambling code pair can be directly separated Assigned to the first cell and the second cell.

若第一小区为待分配扰码的小区，第二小区为已分配扰码的小区，则在为第一小区分配扰码时，需要考虑第一小区和各相邻小区之间的切换次数，本发明实施例提出了归一化切换次数的概念，若第一小区与第二小区的主载频相同，则将第一小区到第二小区的切换次数，确定为第一小区到第二小区的归一化切换次数，若第一小区与第二小区的主载频不同，则将第一小区到第二小区的切换次数与异频抑制比的比值，确定为第一小区到第二小区的归一化切换次数。此时，可以但不限于通过下述两种分配方式为第一小区分配扰码，具体为：If the first cell is a cell to be assigned a scrambling code, and the second cell is a cell to which a scrambling code has been assigned, then when assigning a scrambling code to the first cell, it is necessary to consider the number of handovers between the first cell and each adjacent cell, The embodiment of the present invention proposes the concept of normalized handover times. If the main carrier frequency of the first cell and the second cell is the same, the number of handovers from the first cell to the second cell is determined as the number of handovers from the first cell to the second cell. The number of normalized handovers, if the main carrier frequency of the first cell and the second cell is different, then the ratio of the number of handovers from the first cell to the second cell to the inter-frequency suppression ratio is determined as the ratio of the first cell to the second cell The normalized switching times of . At this time, the scrambling code for the first cell can be allocated but not limited to the following two allocation methods, specifically:

第一种分配方式，确定第一小区到第二小区的归一化切换次数，判断第一小区到第二小区的归一化切换次数是否大于第一小区到其他相邻小区的归一化切换次数，若判断结果为是，则将该最优扰码对中除第二小区的扰码之外的扰码，分配给第一小区；The first allocation method is to determine the normalized switching times from the first cell to the second cell, and judge whether the normalized switching times from the first cell to the second cell is greater than the normalized switching times from the first cell to other adjacent cells number of times, if the judgment result is yes, allocating the scrambling codes in the optimal scrambling code pair except the scrambling code of the second cell to the first cell;

第二种分配方式，确定第一小区到第二小区的归一化切换次数，将确定出的归一化切换次数乘以加权得到的综合相关值，得到该最优扰码对的切换次数综合相关值，判断所述切换次数综合相关值是否小于第一小区与其他相邻小区的最优扰码对的切换次数综合相关值，若判断结果为是，则将该最优扰码对中除第二小区的扰码之外的扰码，分配给第一小区。The second allocation method is to determine the normalized switching times from the first cell to the second cell, multiply the determined normalized switching times by the weighted comprehensive correlation value, and obtain the combined switching times of the optimal scrambling code pair Correlation value, judging whether the comprehensive correlation value of the number of handovers is less than the comprehensive correlation value of the number of handovers of the optimal scrambling code pair of the first cell and other adjacent cells, if the judgment result is yes, then remove the optimal scrambling code pair The scrambling codes other than the scrambling codes of the second cell are assigned to the first cell.

下面介绍如何生成分SF且标记重码类型的扰码相关性矩阵。The following describes how to generate a scrambling code correlation matrix that divides SF and marks repeated code types.

首先生成标记重码类型的扰码相关性矩阵。Firstly, generate a scrambling code correlation matrix for marking repeated code types.

扰码对(i，j)的相关性表现在576个16值序列corr_value中，16值序列的前五位和后四位分别表示0chip时延、1chip时延、2chip时延、3chip时延、4chip时延、-1chip时延、-2chip时延、-3chip时延、-4chip时延时对应的相关性，其中i和j在0chip时延时相关的情况最多，±1、±2、±3、±4时依次减少。The correlation of the scrambling code pair (i, j) is shown in 576 16-value sequences corr_value, the first five bits and the last four bits of the 16-value sequence represent 0chip delay, 1chip delay, 2chip delay, 3chip delay, Correlations corresponding to 4chip delay, -1chip delay, -2chip delay, -3chip delay, and -4chip delay, where i and j are most correlated at 0chip delay, ±1, ±2, ± 3. Decrease in turn at ±4.

由于16值序列中16个元素的可能取值为0、4、8、12、16，将576个16值序列corr_value的前5个元素(时延为0，1，2，3，4个chip)和后4个元素(时延为-1、-2、-3、-4chip)的最大值大于8(即为12或16)的个数统计出来，分别为n₁₂，n₁₆：Since the possible values of the 16 elements in the 16-value sequence are 0, 4, 8, 12, and 16, the first 5 elements of the 576 16-value sequence corr_value (the delay is 0, 1, 2, 3, 4 chip ) and the last 4 elements (with delays of -1, -2, -3, -4chip) whose maximum value is greater than 8 (that is, 12 or 16) are counted, which are n₁₂ and n₁₆ respectively:

max_value4(i，j，k，m)＝max{corr_value(i，j，k，m，l)}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) = 12}

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

其中，l＝0，1，2，3，4，12，13，14，15。Wherein, l=0, 1, 2, 3, 4, 12, 13, 14, 15.

$mean mean__max max__value value ((i i,, j j)) = = \frac{77}{576576} \times \times {n no}_{1212}$

计算扰码对(i，j)的576个16值序列中前5个元素和后4个元素均值的均值：Calculate the mean of the first 5 elements and the last 4 elements of the 576 16-value sequences of the scrambling code pair (i, j):

$Average Average__value value 44 ((i i,, j j)) = =$

$\frac{11}{576576} \times \times {Σ Σ}_{k k = = 11}^{24 twenty four} {Σ Σ}_{m m = = 11}^{24 twenty four} {{\frac{11}{99} \times \times [[{Σ Σ}_{l l = = 00}^{44} corr corr__value value ((i i,, j j,, k k,, m m,, l l)) + + {Σ Σ}_{l l = = 1212}^{1515} corr corr__value value ((i i,, j j,, k k,, m m,, l l))]]}}$

将mean_max_value(i，j)和Average_value4(i，j)相加，得到：Add mean_max_value(i, j) and Average_value4(i, j) to get:

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

如果n₁₆≠0，那么在标记重码类型的扰码相关性矩阵中标记R(i，j)为重码，并且在576个16值序列中找到出现重码时的最小时延chip数，并在记录为“重|X”，X为重码的时延数；若扰码对(i，j)中的两个扰码属于同一基本扰码组，那么在标记重码类型的扰码相关性矩阵中，标记R(i，j)为“同”。If n₁₆ ≠0, then mark R(i, j) as a repeated code in the scrambling code correlation matrix marking the repeated code type, and find the minimum delay chip number when the repeated code occurs in 576 16-value sequences, and record is "heavy|X", X is the time delay of the repeated code; if the two scrambling codes in the scrambling code pair (i, j) belong to the same basic scrambling code group, then in the scrambling code correlation matrix marking the repeated code type, Mark R(i, j) as "same".

标记重码类型的扰码相关性矩阵可以但不限于如表5所示：The scrambling code correlation matrix of the marked repeated code type can be shown in Table 5, but is not limited to:

表5：table 5:

然后生成分SF且标记重码类型的扰码相关性矩阵。Then generate a scrambling code correlation matrix that divides SF and marks the repeated code type.

576个corr_value共同决定着扰码对(i，j)的相关特性，需要考虑如何通过这576个长度是16的相关序列反映出扰码对(i，j)在不同的(SFi，SFj)情况下的相关性。576 corr_values jointly determine the correlation characteristics of the scrambling code pair (i, j), and it is necessary to consider how to reflect the scrambling code pair (i, j) in different (SFi, SFj) situations through these 576 correlation sequences of length 16 the correlation below.

通过下述方式计算max_value4、n12和n16：Calculate max_value4, n12 and n16 by:

max_value4(i，j，k，m，SF_i，SF_j)＝max{corr_value(i，j，k，m，l，SF_i，SF_j)}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 )=12}

n₁₆＝{max_value4(i，j，k，m，SF_i，SF_j)＝16}n₁₆ ={max_value4(i, j, k, m, SF_i , SF_j )=16}

mean_max_value(i，j)的计算方式如下：mean_max_value(i, j) is calculated as follows:

$mean mean__max max__value value ((i i,, j j,, {SF SF}_{i i},, {SF SF}_{j j})) = = \frac{77}{576576} \times \times {n no}_{1212}$

计算扰码对(i，j)的576个16值序列中(SF_i，SF_j)范围前5个元素和后4个元素均值的均值：Calculate the mean value of the first 5 elements and the last 4 elements of the range (SF_i , SF_j ) in the 576 16-value sequences of the scrambling code pair (i, j):

$Average Average__value value 44 ((i i,, j j,, {SF SF}_{i i},, {SF SF}_{j j})) = = \frac{11}{ct ct (({SF SF}_{i i})) \times \times ct ct (({SF SF}_{j j}))} \times \times \underset{{SF SF}_{i i} = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ} \underset{{SF SF}_{j j} = = 1,2,4,8,16 1,2,4,8,16}{Σ Σ}$

${{\frac{11}{99} \times \times [[{Σ Σ}_{l l = = 00}^{44} corr corr__value value ((i i,, j j,, k k,, m m,, l l,, {SF SF}_{i i},, {SF SF}_{j j})) + + {Σ Σ}_{l l = = 1212}^{1515} corr corr__value value ((i i,, j j,, k k,, m m,, l l,, {SF SF}_{i i},, {SF SF}_{j j}))]]$

ct(SF_i)为第一小区在支持SF_i时的复合码个数，ct(SF_j)为第一小区在支持SF_j时的复合码个数。ct(SF_i ) is the number of composite codes when the first cell supports SF_i , and ct(SF_j ) is the number of composite codes when the first cell supports SF_j .

将mean_max_value(i，j，SF_i，SF_j)和Average_value4(i，j，SF_i，SF_j)相加，得到：Add mean_max_value(i, j, SF_i , SF_j ) and Average_value4(i, j, SF_i , SF_j ) to get:

R(i，j，SF_i，SF_j)＝mean_max_value(i，j，SF_i，SF_j)+Average_value4(i，j，SF_i，SF_j)R(i, j, SF_i , SF_j )=mean_max_value(i, j, SF_i , SF_j )+Average_value4(i, j, SF_i , SF_j )

如果n₁₆≠0，那么在分SF且标记重码类型的扰码相关性矩阵中标记R(i，j，SF_i，SF_j)为重码，并且在576个16值序列中找到出现重码时的最小时延chip数，并在记录为“重|X”，X为重码的时延数；若扰码对(i，j)中的两个扰码属于同一基本扰码组，那么在分SF且标记重码类型的扰码相关性矩阵中，标记R(i，j，SF_i，SF_j)为“同”。If n₁₆ ≠0, mark R(i, j, SF_i , SF_j ) as a repeated code in the scrambling code correlation matrix that divides SF and marks the repeated code type, and finds the repeated code in 576 16-value sequences The minimum delay chip number is recorded as "heavy|X", where X is the delay number of repeated codes; if the two scrambling codes in the scrambling code pair (i, j) belong to the same basic scrambling code group, then in the sub-SF In addition, in the scrambling code correlation matrix marked with repeated code type, the mark R(i, j, SF_i , SF_j ) is "same".

分SF且标记重码类型的扰码相关性矩阵可以但不限于如表6所示：The scrambling code correlation matrix that divides SF and marks the repeated code type can be, but not limited to, as shown in Table 6:

表6：Table 6:

由上述处理过程可知，本发明实施例技术方案中，针对相邻的第一小区和第二小区，分别确定该小区所支持的每个SF的SF权重值，在所有扰码对中，选择出满足预设条件的扰码对，针对选择出的每个扰码对，确定该扰码对的复合码相关值，并根据确定出的SF权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值，选择出综合相关值最小的扰码对，并将选择出的扰码对，确定为第一小区和第二小区的最优扰码对，由于小区在承载不同类型的业务时，所支持的SF可能不同，因此本发明实施例根据小区所支持的SF的SF权重值，对扰码对的复合码相关值进行加权运算，然后再根据加权运算得到的综合相关值确定最优扰码对，从而有效地降低了相邻小区间的干扰。It can be seen from the above process that in the technical solution of the embodiment of the present invention, for the adjacent first cell and the second cell, the SF weight value of each SF supported by the cell is respectively determined, and among all scrambling code pairs, the selected For each scrambling code pair that satisfies the preset condition, determine the composite code correlation value of the scrambling code pair, and perform a calculation on the composite code correlation value of the scrambling code pair according to the determined SF weight value. weighted to obtain the comprehensive correlation value of the scrambling code pair, select the scrambling code pair with the smallest comprehensive correlation value, and determine the selected scrambling code pair as the optimal scrambling code pair for the first cell and the second cell. When carrying different types of services, the supported SFs may be different. Therefore, according to the SF weight value of the SF supported by the cell, the embodiment of the present invention performs a weighted operation on the composite code correlation value of the scrambling code pair, and then obtains according to the weighted operation The comprehensive correlation value of the optimal scrambling code pair is determined, thereby effectively reducing the interference between adjacent cells.

下面给出更为详细的实施方式。A more detailed implementation is given below.

本发明实施例提出的扰码对确定方法可以适用于扰码规划过程中，也可以适用于扰码优化过程中，如图2所示，为本发明实施例中，扰码规划方法流程图，其具体处理过程如下：The method for determining the scrambling code pair proposed in the embodiment of the present invention can be applied in the process of scrambling code planning, and can also be applied in the process of scrambling code optimization, as shown in FIG. 2 , which is a flow chart of the scrambling code planning method in the embodiment of the present invention. The specific process is as follows:

步骤21，从资源数据库中提取出待规划小区的资源数据，包括经纬度数据、基站方向角、基站下倾角等工程参数；Step 21, extracting the resource data of the community to be planned from the resource database, including engineering parameters such as longitude and latitude data, base station direction angle, and base station downtilt angle;

步骤22，根据步骤21中得到的经纬度、方向角等数据，确定待规划小区的位置关系，即各小区间的距离和夹角；Step 22, according to the data such as latitude and longitude obtained instep 21, direction angle, determine the positional relationship of the sub-district to be planned, i.e. the distance and the included angle between each sub-district;

步骤23，针对每个待规划小区，计算该待规划小区到相邻小区的归一化切换次数的和；Step 23, for each cell to be planned, calculate the sum of the normalized handover times from the cell to be planned to the adjacent cell;

步骤24，按照步骤23计算出的归一化切换次数的和由大到小的顺序，将各待规划的小区排序，形成小区列表；Step 24, according to the order of the sum of the normalized switching times calculated instep 23 from large to small, sort the cells to be planned to form a cell list;

步骤25，针对小区列表中的第一个待规划小区和第二个待规划小区，分别确定该小区所支持的每个SF的SF权重值，其中该小区为第一个待规划小区和第二个待规划小区；Step 25, for the first cell to be planned and the second cell to be planned in the cell list, respectively determine the SF weight value of each SF supported by the cell, wherein the cell is the first cell to be planned and the second cell to be planned a district to be planned;

步骤26，在所有扰码对中，选择出满足预设条件的扰码对；Step 26, selecting a scrambling code pair satisfying a preset condition among all scrambling code pairs;

步骤27，针对选择出的每个扰码对，确定该扰码对的复合码相关值；Step 27, for each selected scrambling code pair, determine the composite code correlation value of the scrambling code pair;

步骤28，针对选择出的每个扰码对，根据步骤25确定出的SF权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值；Step 28, for each selected scrambling code pair, according to the SF weight value determined instep 25, weighting the composite code correlation value of the scrambling code pair to obtain the comprehensive correlation value of the scrambling code pair;

步骤29，选择出综合相关值最小的扰码对，该扰码对即为最优扰码对；Step 29, select the scrambling code pair with the smallest comprehensive correlation value, and this scrambling code pair is the optimal scrambling code pair;

步骤210，将该最优扰码对中的两个扰码分别分配给第一个待规划小区和第二个待规划小区；Step 210, assigning two scrambling codes in the optimal scrambling code pair to the first cell to be planned and the second cell to be planned respectively;

步骤211，按照上述方式为各待规划小区规划扰码；Step 211, plan scrambling codes for each cell to be planned according to the above method;

步骤212，将步骤211得到的结果进行图形呈现和数据输出；Step 212, performing graphic presentation and data output on the result obtained instep 211;

步骤213，判断步骤211所得到的结果是否需要进一步优化，若判断结果为是，则转至步骤23，若判断结果为否，则转至步骤214；Step 213, judging whether the result obtained instep 211 needs to be further optimized, if the judging result is yes, then go to step 23, if the judging result is no, then go to step 214;

步骤214，按照规定格式输出步骤210得到的结果；Step 214, output the result obtained instep 210 according to the prescribed format;

步骤215，完成扰码规划。Step 215, complete scrambling code planning.

如图3所示，为本发明实施例中，扰码优化方法流程图，其具体处理过程如下：As shown in FIG. 3, it is a flow chart of the scrambling code optimization method in the embodiment of the present invention, and its specific processing process is as follows:

步骤31，从资源数据库中提取出待优化小区的资源数据，包括经纬度数据、基站方向角、基站下倾角等工程参数；Step 31, extracting the resource data of the sub-district to be optimized from the resource database, including engineering parameters such as longitude and latitude data, base station direction angle, and base station downtilt angle;

步骤32，根据步骤31中得到的经纬度、方向角等数据，确定待优化小区的位置关系，即各小区间的距离和夹角；Step 32, according to the data such as latitude and longitude obtained instep 31, direction angle, determine the positional relationship of the sub-district to be optimized, i.e. the distance and the included angle between each sub-district;

步骤33，针对每个待优化小区，计算该待优化小区到相邻小区的归一化切换次数的和；Step 33, for each cell to be optimized, calculate the sum of the normalized handover times from the cell to be optimized to the adjacent cell;

步骤34，按照步骤33计算出的归一化切换次数的和由大到小的顺序，将各待优化的小区排序，形成小区列表；Step 34, according to the order of the normalized handover times calculated instep 33 and from large to small, each cell to be optimized is sorted to form a cell list;

步骤35，针对每个待优化小区，判断该小区是否已经进行了扰码规划，若判断结果为是，则转至步骤314，若判断结果为否，则转至步骤36；Step 35, for each cell to be optimized, judge whether the cell has been scrambling code planning, if the judgment result is yes, then go to step 314, if the judgment result is no, then go to step 36;

步骤36，针对该小区和与该小区相邻的相邻小区，分别确定所支持的每个SF的SF权重值；Step 36, for the cell and the adjacent cells adjacent to the cell, respectively determine the SF weight value of each SF supported;

步骤37，在所有扰码对中，选择出满足预设条件的扰码对，其中选择出的扰码对中包含上述相邻小区的扰码；Step 37, among all scrambling code pairs, select a scrambling code pair satisfying a preset condition, wherein the selected scrambling code pair includes the scrambling code of the adjacent cell;

步骤38，针对选择出的每个扰码对，确定该扰码对的复合码相关值；Step 38, for each selected scrambling code pair, determine the composite code correlation value of the scrambling code pair;

步骤39，针对选择出的每个扰码对，根据步骤36确定出的SF权重值，对该扰码对的复合码相关值进行加权，得到该扰码对的综合相关值；Step 39, for each selected scrambling code pair, according to the SF weight value determined instep 36, weighting the composite code correlation value of the scrambling code pair to obtain the comprehensive correlation value of the scrambling code pair;

步骤310，选择出综合相关值最小的扰码对，该扰码对即为最优扰码对；Step 310, selecting the scrambling code pair with the smallest comprehensive correlation value, and the scrambling code pair is the optimal scrambling code pair;

步骤311，判断该小区到上述相邻小区的归一化切换次数是否大于该小区到其他相邻小区的归一化切换次数；Step 311, judging whether the normalized number of handovers from the cell to the adjacent cell is greater than the normalized number of handovers from the cell to other adjacent cells;

步骤312，若步骤311的判断结果为是，则将该最优扰码对中除该相邻小区的扰码之外的扰码，分配给该小区；Step 312, if the judgment result ofstep 311 is yes, allocating the scrambling codes in the optimal scrambling code pair except the scrambling code of the adjacent cell to the cell;

步骤313，按照上述方式对各未规划的小区进行优化；Step 313, optimize each unplanned cell according to the above method;

步骤314，完成扰码优化。Step 314, complete scrambling code optimization.

相应的，本发明实施例还提供一种扰码对确定装置，如图4所示，包括第一确定单元41、第一选择单元42、第二确定单元43、加权单元44、第二选择单元45和第三确定单元46，其中：Correspondingly, the embodiment of the present invention also provides a device for determining a scrambling code pair, as shown in FIG. 45 and the third determiningunit 46, wherein:

第一确定单元41，用于针对相邻的第一小区和第二小区，分别确定该小区所支持的每个SF的SF权重值；The first determiningunit 41 is configured to respectively determine the SF weight value of each SF supported by the cell for the adjacent first cell and the second cell;

第一选择单元42，用于在所有扰码对中，选择出满足预设条件的扰码对；Thefirst selection unit 42 is configured to select a scrambling code pair satisfying a preset condition among all scrambling code pairs;

第二确定单元43，用于针对第一选择单元42选择出的每个扰码对，确定该扰码对的复合码相关值；Thesecond determination unit 43 is configured to, for each scrambling code pair selected by thefirst selection unit 42, determine the composite code correlation value of the scrambling code pair;

加权单元44，用于针对第一选择单元42选择出的每个扰码对，根据第一确定单元41确定出的SF权重值，对第二确定单元43确定出的复合码相关值进行加权，得到该扰码对的综合相关值；Theweighting unit 44 is configured to, for each scrambling code pair selected by thefirst selection unit 42, weight the composite code correlation value determined by thesecond determination unit 43 according to the SF weight value determined by thefirst determination unit 41, Obtain the comprehensive correlation value of the scrambling code pair;

第二选择单元45，用于选择出综合相关值最小的扰码对；Thesecond selection unit 45 is configured to select the scrambling code pair with the smallest integrated correlation value;

第三确定单元46，用于将第二选择单元45选择出的扰码对，确定为第一小区和第二小区的最优扰码对。The third determiningunit 46 is configured to determine the scrambling code pair selected by the second selectingunit 45 as an optimal scrambling code pair for the first cell and the second cell.

较佳地，第一确定单元41具体包括第一确定子单元、获得子单元和第二确定子单元，其中：Preferably, the first determiningunit 41 specifically includes a first determining subunit, an obtaining subunit and a second determining subunit, wherein:

第一确定子单元，用于针对相邻的第一小区和第二小区，分别根据该小区所承载的各种业务的业务类型，确定该小区所支持的各SF；The first determining subunit is configured to, for the adjacent first cell and the second cell, respectively determine the SFs supported by the cell according to the service types of the various services carried by the cell;

获得子单元，用于针对相邻的第一小区和第二小区，分别获得第一确定子单元确定出的每个SF的占用次数；The obtaining subunit is used to respectively obtain the occupancy times of each SF determined by the first determining subunit for the adjacent first cell and the second cell;

第二确定子单元，用于针对相邻的第一小区和第二小区，将获得子单元获得的每个SF的占用次数与所有SF的占用次数之和的比值，确定为该小区所支持的该SF在所支持的所有SF中的SF权重值。The second determination subunit is used to determine the ratio of the occupation times of each SF obtained by the obtaining subunit to the sum of the occupation times of all SFs as the ratio supported by the cell for the adjacent first cell and the second cell The SF weight value of this SF among all supported SFs.

较佳地，所述SF为：Preferably, the SF is:

上行SF；或upstream SF; or

下行SF；或downlink SF; or

上行SF和下行SF。Uplink SF and downlink SF.

较佳地，所述预设条件为：Preferably, the preset conditions are:

该扰码对中的两个扰码不属于同一个基本扰码组；以及The two scrambling codes in the scrambling code pair do not belong to the same basic scrambling code group; and

在第一小区和第二小区支持各SF时，该扰码对的所有复合码均不存在重码；以及When the first cell and the second cell support each SF, all composite codes of the scrambling code pair do not have repeated codes; and

该扰码对中的一个扰码与第一小区的其他相邻小区的扰码均不属于同一个基本扰码组，且该扰码对中的另一个扰码与第二小区的其他相邻小区的扰码均不属于同一个基本扰码组；以及One of the scrambling codes in the scrambling code pair does not belong to the same basic scrambling code group as the scrambling codes of other adjacent cells of the first cell, and the other scrambling code of the pair does not belong to the same basic scrambling code group as the other adjacent cells of the second cell. The scrambling codes of the cells do not belong to the same basic scrambling code group; and

若第一小区为待分配扰码的小区，第二小区为已分配扰码的小区，则该扰码对中包含第二小区的扰码。If the first cell is a cell to be allocated a scrambling code and the second cell is a cell to which a scrambling code has been allocated, the scrambling code pair includes the scrambling code of the second cell.

更佳地，若第一小区为待分配扰码的小区，第二小区为已分配扰码的小区，则所述扰码对确定装置还包括第四确定单元、第一判断单元和第一分配单元，其中：Preferably, if the first cell is a cell to be assigned a scrambling code, and the second cell is a cell to which a scrambling code has been assigned, the device for determining a scrambling code pair further includes a fourth determining unit, a first judging unit, and a first allocating unit. unit, where:

第四确定单元，用于确定第一小区到第二小区的归一化切换次数；A fourth determination unit, configured to determine the normalized number of handovers from the first cell to the second cell;

第一判断单元，用于判断第一小区到第二小区的归一化切换次数是否大于第一小区到其他相邻小区的归一化切换次数；A first judging unit, configured to judge whether the normalized number of handovers from the first cell to the second cell is greater than the normalized number of handovers from the first cell to other adjacent cells;

第一分配单元，用于在第一判断单元的判断结果为是时，将第三确定单元46确定出的最优扰码对中除第二小区的扰码之外的扰码，分配给第一小区。The first allocating unit is configured to allocate the scrambling codes in the optimal scrambling code pair determined by the third determiningunit 46 except the scrambling code of the second cell to the second cell when the judgment result of the first judging unit is yes. a district.

更佳地，若第一小区为待分配扰码的小区，第二小区为已分配扰码的小区，则所述扰码对确定装置还包括第五确定单元、第六确定单元、第二判断单元和第二分配单元，其中：Preferably, if the first cell is a cell to be assigned a scrambling code, and the second cell is a cell to which a scrambling code has been assigned, the device for determining the scrambling code pair further includes a fifth determining unit, a sixth determining unit, a second judging unit unit and a second allocation unit, where:

第五确定单元，用于确定第一小区到第二小区的归一化切换次数；A fifth determining unit, configured to determine the normalized number of handovers from the first cell to the second cell;

第六确定单元，用于根据第五确定单元确定出的归一化切换次数和加权单元44加权得到的综合相关值，确定该最优扰码对的切换次数综合相关值；The sixth determination unit is configured to determine the comprehensive correlation value of the switching times of the optimal scrambling code pair according to the normalized switching times determined by the fifth determining unit and the comprehensive correlation value weighted by theweighting unit 44;

第二判断单元，用于判断第六确定单元确定出的切换次数综合相关值是否小于第一小区与其他相邻小区的最优扰码对的切换次数综合相关值；The second judging unit is configured to judge whether the comprehensive correlation value of the number of handovers determined by the sixth determination unit is smaller than the comprehensive correlation value of the number of handovers of the optimal scrambling code pair between the first cell and other adjacent cells;

第二分配单元，用于在第二判断单元的断结果为是时，将第三确定单元46确定出的最优扰码对中除第二小区的扰码之外的扰码，分配给第一小区。The second allocating unit is configured to allocate the scrambling codes in the optimal scrambling code pair determined by the third determiningunit 46 except the scrambling code of the second cell to the first cell when the judgment result of the second judging unit is yes. a district.

显然，本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样，倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and equivalent technologies thereof, the present invention also intends to include these modifications and variations.