Scrambling code distribution method

Abstract

The invention provides a scrambling code distribution method. The method comprises the following steps of: selecting an optimal scrambling code for distribution by combining a priority of each scrambling code set and according to the priority of each scrambling code in the intersection determined by each scrambling code set so as to excellently reduce inter-cell interference. Furthermore, in the technical scheme of the invention, the priority of base station sharing cells is set as the highest; and the scrambling codes are preferentially distributed to the base station sharing cells so as to prevent the base station sharing cells from using the scrambling codes positioned in the same scrambling code set and further reduce the interference.

Description

technical field [0001] The invention relates to mobile communication technology, in particular to a method for allocating scrambling codes in a mobile communication system. Background technique [0002] The introduction of Code Division Multiple Access (CDMA, Code Division Multiple Access) technology provides a new resource, that is, a code resource, for the mobile communication system. In the Time Division-Synchronous Code Division Multiple Access (TD-SCDMA, Time Division-Synchronous Code Division Multiple Access) system, the data in the channel can be scrambled by using the scrambling code. In the downlink direction, the scrambling code can be used to distinguish different cells. In the uplink direction, the base station (NodeB) uses scrambling codes to distinguish users from different cells. [0003] In network planning, in order to avoid inter-cell interference and improve network performance, effective and reasonable code resource planning is required. Especially in TD...

AI Technical Summary

Problems solved by technology

[0023] Too rough: the above allocation method only considers that adjacent cells cannot allocate scrambling codes in the same scrambling code set. After a scrambling code in code set 1, in principle, one of the scrambling codes from scrambling code sets 2 to 12 can be selected and assigned to cell B. However, choosing a different scrambling code may cause interference between the two cells. Different effects, that is, one may be optimal, but the existing allocation method does not consider this issue;

[0024] In addition, the problem of shared base station cells is not considered: usually, a base station will have three subordinate cells, assuming that they are cell D, cell E, and cell F, then cell D, cell E, and cell F will be cells with a common base station. Correspondingly, Cell E and cell F are the common base station cells of cell D. In the prior art, the common base station cells are usually not treated as adjacent cells. Then, if the scrambling codes are to be allocated for cell D and cell E, it will not The principle that the scrambling codes in the same scrambling code set will not be allocated to adjacent cells will be followed. In this way, the scrambling codes in the same scrambling code set between cell D and cell E may be allocated to the scrambling codes in the same scrambling code set, resulting in a large interference

Images