CN102244872A - Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells - Google Patents
Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells Download PDFInfo
- Publication number
- CN102244872A CN102244872A CN2010101756380A CN201010175638A CN102244872A CN 102244872 A CN102244872 A CN 102244872A CN 2010101756380 A CN2010101756380 A CN 2010101756380A CN 201010175638 A CN201010175638 A CN 201010175638A CN 102244872 A CN102244872 A CN 102244872A
- Authority
- CN
- China
- Prior art keywords
- sub
- district
- frequency
- interference
- tabulation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells. The method comprises the following steps of: A, establishing a quantitative interference matrix; B, determining a distribution difficulty factor of each cell according to the quantitative interference matrix; C, determining priorities of the cells according to the quantitative interference matrix and the distribution difficulty factor of each cell; and D, sequentially distributing frequencies to each cell from high priorities to low priorities of the cells. By adopting the method disclosed by the invention, an optimal frequency can be provided to each cell.
Description
Technical field
The present invention relates to field of mobile communication, the frequency planning method of particularly a kind of TD-SCDMA sub-district.
Background technology
Along with the development of wireless communication technique, 3-G (Generation Three mobile communication system) standardization partnership projects (3GPP) has proposed TD SDMA (TD-SCDMA) system.In the TD-SCDMA system, avoided interference between the sub-district by the wave beam forming technology as far as possible, but because the existence of problems such as time delay expansion, signal delay, in the TD-SCDMA system, still exist certain same frequently adjacent and adjacent together sign indicating number to disturb, in order to overcome interference, the demand of frequency planning has been proposed.
The algorithm that is used for frequency planning at present has a lot, for example, graph coloring algorithm, genetic algorithm, heuritic approach and neural network algorithm, in the TD-SCDMA system, the application of graph coloring algorithm is the most general.The principle of graph coloring algorithm is: the numbered sequence of setting up color: { the 1st color, the 2nd color ... A color }, and wherein, the 1st color, the 2nd color ... the A color has nothing in common with each other, each node is endowed a color, the color difference that every adjacent two nodes are endowed, B
I, jFor representing the constant of distance relation between i node and the j node, the final goal of algorithm is to use minimum color to make color distortion between i node and the j node more than or equal to B
I, j
Based on the principle of graph coloring algorithm, the frequency planning method of TD-SCDMA sub-district may further comprise the steps in the prior art:
Step 1 is numbered the sub-district, supposes that X is the numbered sequence of sub-district, X={ the 1st sub-district then, the 2nd sub-district ... M sub-district }, wherein, M is the summation of sub-district number; Frequency is numbered, supposes that Y is the numbered sequence of frequency, Y={ the 1st frequency then, the 2nd frequency ... A frequency, wherein, A is the summation of frequency points; Set up the matrix of a M * M
I is more than or equal to 1 and smaller or equal to M, and j is more than or equal to 1 and smaller or equal to M, wherein, if the distance between i sub-district and the j sub-district less than the reusable distance, E then
Ij=1, if the little distance between trivial of i sub-district and j more than or equal to the reusable distance, E then
Ij=0.
Step 2, calculate the difficulty distribution factor of each sub-district:
Wherein, F
iIt is the difficulty distribution factor of i sub-district.
Step 3, successively the sub-district is numbered again according to difficulty distribution factor order from big to small, the sub-district of difficulty distribution factor maximum is defined as the 1st sub-district, difficulty distribution factor time big sub-district is defined as the 2nd sub-district ... the sub-district of difficulty distribution factor minimum is defined as the M sub-district.
Step 4 is given the 1st sub-district with the 1st frequency point allocation, with k
pThe p sub-district that frequency point allocation is given, wherein, p is more than or equal to 2 and smaller or equal to M, k
pMore than or equal to 1 and smaller or equal to A, k
pOccurrence determine as follows: when distributing frequency, at first suppose k for current area
p=1, judge following condition: for all more than or equal to 1 and less than the r of p, | k
p-T
r|＞=E
PrWhether set up, wherein, T
rBe the numbering of the frequency that is assigned with of r sub-district, if set up, k then
pFinal value be 1, if be false, then suppose k
p=2, judge following condition again: for all more than or equal to 1 and less than the r of p, | k
p-T
r|＞=E
PrWhether set up, if establishment, then k
pFinal value be 2, if be false, then suppose k
p=3... is until getting a k
pSatisfy till the above-mentioned condition the then final k that determines
pValue be the frequency numbering of distributing for current area.According to the method described above, all be assigned with frequency until M sub-district.
Step 4 is illustrated, if the current sub-district that is assigned with frequency is the 5th sub-district, is that the frequency of the 5th cell allocation is assumed to be k
5Frequency adopts following method to determine k
5: at first suppose k
5=1, if | k
5-T
1|＞=E
51, and | k
5-T
2|＞=E
52, and | k
5-T
3|＞=E
53, and | k
5-T
4|＞=E
54, k then
5Get 1; If do not satisfy above-mentioned condition, then suppose k
5=2, if | k
5-T
1|＞=E
51, and | k
5-T
2|＞=E
52, and | k
5-T
3|＞=E
53, and | k
5-T
4|＞=E
54, k then
5Get 2...., according to the method described above until finding k
5Final value.
As seen, the purport of the frequency planning method of the TD-SCDMA sub-district that prior art provided is that expectation finds minimum frequency resource to satisfy system requirements, when relatively enriching, frequency resource can not make full use of frequency resource, the frequency planning method of the TD-SCDMA sub-district that therefore, prior art provided not is to provide optimum frequency for each sub-district.
Summary of the invention
In view of this, the invention provides the frequency planning method of a kind of TD-SCDMA sub-district, can provide optimum frequency for each sub-district.
For solving the problems of the technologies described above, technical scheme of the present invention is achieved in that
The frequency planning method of a kind of TD-SCDMA sub-district, method comprises:
A, foundation quantize interference matrix;
B, determine the distribution difficulty factor of each sub-district according to quantizing interference matrix;
C, according to the distribution difficulty factor that quantizes interference matrix and each sub-district, determine the priority of sub-district;
D, according to native region priority from height to low order, be followed successively by each cell allocation frequency.
Setting up the method that quantizes interference matrix described in the steps A comprises:
A1, each sub-district is numbered: X={ the 1st sub-district, the 2nd sub-district ... M sub-district, wherein, X is the numbered sequence of sub-district, M is the summation of sub-district number;
A2, set up the quantification interference matrix of M * M
Wherein, C
IjBe first interference factor between i sub-district and the j sub-district, be used to represent the annoyance level between i sub-district and the j sub-district, wherein, work as C
Ij=-1, then represent between i sub-district and the j sub-district noiselessly, work as C
Ij＞=0, then representing has interference between i sub-district and the j sub-district, and C
IjValue big more, then annoyance level is more little.
Between i sub-district that does not belong to same base station and j sub-district apart from d
IjLess than the reusable distance, and i sub-district and j sub-district intersect for how much, then C
Ij=d
Ij
Between i sub-district that does not belong to same base station and j sub-district apart from d
IjMore than or equal to reusable distance, then C
Ij=-1;
Between i sub-district that does not belong to same base station and j sub-district apart from d
IjLess than the reusable distance, and i sub-district and j sub-district do not intersect for how much, then C
Ij=-1;
When i sub-district and j sub-district belong to same base station, C then
Ij=0; Wherein, i is more than or equal to 1 and smaller or equal to M, and j is more than or equal to 1 and smaller or equal to M.
The method of determining the distribution difficulty factor of each sub-district described in the step B comprises:
B1, determine the second interference factor G between i sub-district and the j sub-district
Ij, wherein, if C
Ij＞=0, G then
Ij=1; Otherwise, G
Ij=0;
The distribution difficulty factor of B2, calculating i sub-district
The method of determining the priority of sub-district described in the step C comprises:
C1, set up two formations: native region priority L formation and the N formation of unallocated sub-district;
C2, will distribute the sub-district of difficulty factor maximum at first to put into the L formation, the N formation is put in other sub-districts;
The size of first interference factor between each sub-district in each sub-district and the N formation in C3, the comparison L formation, the tail of the queue of L formation is put in the pairing sub-district of minimum first interference factor in the N formation, and delete from the N formation, wherein, when first interference factor is-1, do not participate in above-mentioned comparison, and, be-1 as if first interference factor between each sub-district in each sub-district in the L formation and the N formation, then will distribute the sub-district of difficulty factor maximum put into L formation tail of the queue in the N formation, and delete from the N formation;
C4, repeated execution of steps C3, all the sub-district is placed in the L formation in the N formation, and the sub-district of final L queue record is the priority orders of sub-district in proper order.
Comprise for the method for each cell allocation frequency described in the step D:
D1, set up list of persons for each sub-district, list of persons comprises: cell number, frequency the Resources list, interference source tabulation and interfered cell tabulation, and to frequency the Resources list, interference source tabulation and interfered cell tabulation carrying out initialization;
Wherein, during initialization, the frequency range that each frequency in frequency the Resources list of i sub-district is supported according to the sub-district is provided with, with each frequency in frequency the Resources list of i sub-district from head of the queue to tail of the queue put in order as initialization the time default priority, the highest frequency of default priority when the 1st frequency that is arranged in head of the queue is initialization;
The interference source list storage of i sub-district: the frequency that the i sub-district produce is disturbed and each produce the frequency that the disturbs annoyance level to the i sub-district, the frequency that described generation is disturbed is to be assigned with the sub-district of interference frequency and first interference factor between the i sub-district to the annoyance level of i sub-district, during initialization, the interference source tabulation is for empty;
The numbering of the sub-district that the interfered cell list storage of i sub-district produce to be disturbed the i sub-district, during initialization, described to the i sub-district produce the sub-district of disturbing be and the i sub-district between first interference factor more than or equal to 0 sub-district;
D2, being followed successively by each cell allocation frequency from height to low order according to native region priority, is that the method for i cell allocation frequency is: with the highest k of frequency the Resources list medium priority of i sub-district
iFrequency point allocation is given i sub-district, k
iMore than or equal to 1 and smaller or equal to the summation of frequency points;
Each sub-district is upgraded the interfered cell tabulation and the interference source tabulation of list of persons respectively in the interfered cell tabulation of D3, i sub-district, and the highest frequency of frequency the Resources list medium priority of definite list of persons.
The method of s cell update interfered cell tabulation comprised during the interfered cell of i sub-district was tabulated: if comprise the i sub-district in the tabulation of the interfered cell of s sub-district, then the numbering of i sub-district is deleted from the interfered cell tabulation of s sub-district; If do not comprise the s sub-district in the s area interference cell list, then do not do any operation, wherein, s is more than or equal to 1 and smaller or equal to M.
The method of s cell update interference source tabulation comprises in the interfered cell tabulation of i sub-district:
If frequency the Resources list of s sub-district comprises k
iFrequency is then with k
iFrequency is deleted from frequency the Resources list of s sub-district, and with k
iFrequency is stored to k
iIn the interference source tabulation of sub-district, the first interference factor C in the interference source tabulation of s sub-district between storage i sub-district and the s sub-district
Is, upgrade the priority of each frequency in the interference source tabulation of s sub-district then according to the size of first interference factor, wherein, first interference factor is big more, and then priority is low more;
If frequency the Resources list of s sub-district does not comprise k
iFrequency is then searched k in the interference source tabulation of s sub-district
iFrequency if find, then contrasts and is assigned with first interference factor between sub-district and the s sub-district and the first interference factor C of current sub-distribution before the current sub-distribution
IsSize, with in the interference source tabulation with k
iFirst interference factor of frequency correspondence is updated to wherein bigger one, upgrades the priority of each frequency in the interference source tabulation of s sub-district then according to the size of first interference factor, and first interference factor is big more, and then priority is low more; As do not find, then do not do any operation.
The method of determining the frequency that frequency the Resources list medium priority of s sub-district in the interfered cell tabulation of i sub-district is the highest comprises:
Get the minimum frequency of interference source tabulation medium priority of s sub-district, in frequency the Resources list of s sub-district, inquire about the frequency of frequency difference maximum with it, with the frequency of frequency difference maximum with it as the highest frequency of frequency resource tabulation medium priority.
According to technical scheme provided by the invention, at first set up and quantize interference matrix, determine the distribution difficulty factor of each sub-district according to quantizing interference matrix, then according to the distribution difficulty factor that quantizes interference matrix and each sub-district, determine the priority of sub-district, be followed successively by each cell allocation frequency according to native region priority from height to low order at last, as seen, frequency planning aim provided by the present invention is not to adopt the least possible frequency resource to satisfy system requirements, but introduced quantification interference matrix, quantize interference matrix and write down the annoyance level of two sub-districts, so just make the frequency planning process take into full account annoyance level between the sub-district, for each sub-district provides optimum frequency.
Further, in the present invention, after frequency point allocation is carried out in a sub-district, the interfered cell that is assigned with frequency point cell is the list of persons of real-time update self all, the process of upgrading list of persons comprises: upgrade the interference source tabulation, frequency resource tabulation and interfered cell tabulation, thereby after making that each sub-district is assigned with frequency, the state of its interfered cell also changes in real time, guaranteed the optimality of each distribution frequency, and when giving follow-up cell allocation frequency, directly that the priority of list of persons medium frequency the Resources list of sub-district is the highest frequency has improved the efficient of frequency planning like this as distributing frequency.Simultaneously, in the present invention,, like this, under the relatively abundant or not enough situation of frequency resource, can be that current area is distributed optimum frequency all based on actual conditions so long as the frequency of current area support all participates in planning.
Description of drawings
Fig. 1 is the flow chart of the frequency planning method of a kind of TD-SCDMA provided by the present invention sub-district.
Embodiment
For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, scheme of the present invention is described in further detail.
Fig. 1 is the flow chart of the frequency planning method of a kind of TD-SCDMA provided by the present invention sub-district.As shown in Figure 1, this method may further comprise the steps:
Specifically, step 101 comprises: each sub-district is numbered: X={ the 1st sub-district, the 2nd sub-district ... M sub-district }, wherein, X is the numbered sequence of sub-district, M is the summation of sub-district number; Set up the quantification interference matrix of M * M
Wherein, C
IjBe first interference factor between i sub-district and the j sub-district, be used to represent the annoyance level between i sub-district and the j sub-district.
In actual applications, the index that is used to represent the degree disturbed between two sub-districts has a lot, for example, can determine annoyance level according to the distance between two sub-districts, distance is big more, and then annoyance level is more little, also can intersect degree etc. according to the geometry between two sub-districts, at this, only be the annoyance level that example is determined two sub-districts with the distance.Between i sub-district that does not belong to same base station and j sub-district apart from d
IjLess than the reusable distance, and i sub-district and j sub-district intersect for how much, then C
Ij=d
IjBetween i sub-district that does not belong to same base station and j sub-district apart from d
IjMore than or equal to reusable distance, then C
Ij=-1; Between i sub-district that does not belong to same base station and j sub-district apart from d
IjLess than the reusable distance, and i sub-district and j sub-district do not intersect for how much, then C
Ij=-1; When i sub-district and j sub-district belong to same base station, C then
Ij=0.
As seen, work as C
Ij=-1 o'clock, represent the not interference of two sub-districts, work as C
Ij＞=0 o'clock, represent to exist between two sub-districts and disturb C
IjValue big more, then annoyance level is more little, and works as C
Ij=0 o'clock, the annoyance level between two sub-districts was the strongest.
Step 102 is determined the distribution difficulty factor of each sub-district according to quantizing interference matrix.
Specifically, step 102 comprises:
Step 1021 is determined the second interference factor G between i sub-district and the j sub-district
Ij, wherein, if C
Ij＞=0, G then
Ij=1; Otherwise, G
Ij=0.
Step 1022 is calculated the distribution difficulty factor of i sub-district
Step 103 according to the distribution difficulty factor that quantizes interference matrix and each sub-district, is determined the priority of sub-district.
Specifically, step 103 comprises:
Step 1031 is set up two formations: native region priority L formation and the N formation of unallocated sub-district.
Step 1032 will distribute the sub-district of difficulty factor maximum at first to put into the L formation, and the N formation is put in other sub-districts.
Step 1033, the size of first interference factor between each sub-district in each sub-district and the N formation in the comparison L formation, the tail of the queue of L formation is put in the pairing sub-district of minimum first interference factor in the N formation, and delete from the N formation, wherein, be-1 as if first interference factor between each sub-district in each sub-district in the L formation and the N formation, then will distribute the sub-district of difficulty factor maximum put into L formation tail of the queue in the N formation, and delete from the N formation.
Step 1033 is illustrated: suppose that the sub-district that participates at present planning is the 1st sub-district, the 2nd sub-district, the 3rd sub-district and the 4th sub-district, and the difficulty distribution factor of the 1st sub-district, the 2nd sub-district, the 3rd sub-district and the 4th sub-district reduces successively, at first the L formation is put in the 1st sub-district, the N formation is put in other sub-districts, compares C then
12, C
13And C
14Size, suppose C
13Minimum is then deleted the 3rd sub-district, and the 3rd sub-district is put into after the 1st sub-district of L formation from the N formation, compare C then
12, C
14, C
34And C
32Size, suppose C
32Minimum, then the 2nd sub-district is deleted from the N formation, and the 2nd sub-district is put into after the 3rd sub-district of L formation, at last the L formation is put in remaining the 4th sub-district, then the priority of the final sub-district of determining is followed successively by to low from height: the 1st sub-district, the 3rd sub-district, the 2nd sub-district, the 4th sub-district.
Step 1034, repeated execution of steps 1033, all the sub-district is placed in the L formation in the N formation, the sub-district order (from the head of the queue to the tail of the queue) of final L queue record is the priority orders of sub-district, and according to native region priority from height to low order, the sub-district is numbered once more, wherein, the sub-district that priority is the highest is the 1st sub-district, and the sub-district that priority is minimum is the M sub-district.
Need to prove:, represent two sub-districts for-1 the time when first interference factor and do not disturb, so-1 value does not participate in the comparison of the first interference factor size because first interference factor might be-1.In addition, divide timing when for the first time owing to have only the sub-district of distributing difficulty factor maximum in the L formation, therefore relatively in the sub-district of the distribution difficulty factor maximum in the L formation and the N formation size of first interference factor of each sub-district get final product.
Step 104 from height to low order, is followed successively by each cell allocation frequency according to native region priority.
Specifically, step 104 may further comprise the steps:
Step 1041 is set up list of persons for each sub-district, and list of persons comprises: cell number, frequency the Resources list, interference source tabulation and interfered cell tabulation.
What frequency the Resources list of i sub-district was stored is the spendable frequency in i sub-district, the spendable frequency in sub-district can be provided with according to the frequency range that the sub-district is supported, during initialization, putting in order of each frequency in the i sub-district is considered as initialized default priority, the highest frequency of default priority when for example, the 1st frequency that is arranged in head of the queue is initialization.
The tabulation of the interference source of i sub-district comprises: the i sub-district is produced the frequency that disturbs and each produce the frequency that the disturbs annoyance level to the i sub-district, the frequency that described generation is disturbed is meant the annoyance level of i sub-district and is assigned with the sub-district of disturbing frequency and first interference factor between the i sub-district, during initialization, the interference source tabulation is for empty.
The numbering of the sub-district that the interfered cell list records of i sub-district produce to be disturbed the i sub-district, described i sub-district produce that the sub-district of disturbing is meant and the i sub-district between first interference factor more than or equal to 0 sub-district.
Step 1042 is followed successively by each cell allocation frequency according to native region priority from height to low order, and distribution principle is: with the highest k of frequency the Resources list medium priority of i sub-district
iFrequency point allocation is given i sub-district, k
iBe the numbering of the highest frequency of frequency the Resources list medium priority of i sub-district, k
iMore than or equal to 1 and smaller or equal to the summation of frequency points.
Step 1043, each sub-district in the interfered cell tabulation of i sub-district is upgraded list of persons respectively.
List of persons update method with s sub-district in the interfered cell tabulation of i sub-district is that example describes, and wherein, s is more than or equal to 1 and smaller or equal to M.
If comprise the i sub-district in the tabulation of the interfered cell of s sub-district, then the numbering of i sub-district is deleted from the interfered cell tabulation of s sub-district; If do not comprise the s sub-district in the s area interference cell list, then do not do any operation.
If frequency the Resources list of s sub-district comprises k
iFrequency is then with k
iFrequency is deleted from frequency the Resources list of s sub-district, and with k
iFrequency is stored in the interference source tabulation of s sub-district, also writes down k in the interference source tabulation of s sub-district
iFrequency is to the annoyance level of s sub-district, k
iFrequency is the first interference factor C between i sub-district and the s sub-district to the annoyance level of s sub-district
Is, then according to annoyance level, upgrading the priority of each frequency in the interference source tabulation of s sub-district, first interference factor is big more, and then priority is low more; If frequency the Resources list of s sub-district does not comprise k
iFrequency is then searched k in the interference source tabulation of s sub-district
iFrequency if find, then shows k
iFrequency had been assigned to other the arbitrary sub-districts except that the s sub-district before current sub-distribution, contrast to be assigned with first interference factor between sub-district and the s sub-district and the first interference factor C of current sub-distribution before the current sub-distribution
IsSize, annoyance level is updated to bigger one, then according to annoyance level, upgrade the priority of each frequency in the interference source tabulation of s sub-district, first interference factor is big more, then priority is low more; As do not find, then do not do any operation.
Determine the highest frequency of frequency the Resources list medium priority of s sub-district: the minimum frequency of interference source tabulation medium priority of getting the s sub-district, in frequency the Resources list of s sub-district, inquire about the frequency of frequency difference maximum with it, with the frequency of frequency difference maximum with it as the highest frequency of frequency resource tabulation medium priority.
Below step 104 is illustrated.
Supposed before frequency point allocation, the 1st sub-district, the 2nd sub-district and, the list of persons of the 3rd sub-district and the 4th sub-district is as shown in table 1, wherein, native region priority from height to low order is: the 2nd sub-district, the 1st sub-district, the 4th sub-district, the 3rd sub-district, F1, F2, F3, F4 and F5 are respectively first, second, third and fourth and five frequencies, when initialization, the priority orders of F1, F2, F3, F4 and F5 acquiescence is extremely low from height.
| Cell number | The frequency resource tabulation | The interference source tabulation | The interfered cell tabulation |
| The 2nd sub-district | F1，F2，F3，F4，F5 | The 1st sub-district, the 3rd sub-district, the 4th sub-district | |
| The 1st sub-district | F1，F2，F3，F4，F5 | The 2nd sub-district, the 4th sub-district | |
| The 4th sub-district | F1，F2，F3，F4，F5 | The 1st sub-district, the 2nd sub-district, the 3rd sub-district | |
| The 3rd sub-district | F1，F2，F3，F4，F5 | The 2nd sub-district, the 4th sub-district |
Table 1
When distributing frequency for the first time, F 1 is distributed to the 2nd the highest sub-district of priority.
After for the first time distributing frequency, the 1st, 3 and 4 sub-districts in the tabulation of the interfered cell of the 2nd sub-district are upgraded list of persons respectively, and the list of persons behind the 1st, 3 and 4 cell updates is as shown in table 2.
| Cell number | The frequency resource tabulation | The interference source tabulation | The interfered cell tabulation |
| The 2nd sub-district | F1，F2，F3，F4，F5 | The 1st sub-district, the 3rd sub-district, the 4th sub-district | |
| The 1st sub-district | F5，F2，F3，F4 | F1，C12 | The 4th sub-district |
| The 4th sub-district | F5，F2，F3，F4， | F1，C24 | The 1st sub-district, the 3rd sub-district |
| The 3rd sub-district | F5，，F2，F3，F4 | F1，C23 | The 4th sub-district |
Table 2
Specifically, the 1st, 3 and 4 sub-districts are upgraded the process of list of persons respectively and are:
For the 1st sub-district, the tabulation of the interfered cell of the 1st sub-district comprises the 2nd sub-district, therefore the numbering of the 2nd sub-district is deleted from the interfered cell tabulation of the 1st sub-district; Frequency the Resources list of the 1st sub-district comprises F1, then F1 is deleted from frequency the Resources list of the 1st sub-district, with the interference source tabulation that F1 is stored to the 1st sub-district, writes down C
12,, then need not to upgrade the priority of interference source tabulation because the tabulation of the interference source of the 1st sub-district only stores an interference source F1; Determine the highest frequency of frequency the Resources list medium priority of the 1st sub-district: suppose that the frequency difference between F5 and the F1 is poor greater than the frequency between F4 and the F1, and it is poor greater than the frequency between F3 and the F1, and poor greater than the frequency between F2 and the F1, then F5 is the highest frequency of frequency the Resources list medium priority of the 1st sub-district.
For the 4th sub-district, the tabulation of the interfered cell of the 4th sub-district comprises the 2nd sub-district, therefore the numbering of the 2nd sub-district is deleted from the interfered cell tabulation of the 4th sub-district; Frequency the Resources list of the 4th sub-district comprises F1, then F1 is deleted from frequency the Resources list of the 4th sub-district, with the interference source tabulation that F1 is stored to the 4th sub-district, writes down C
24,, then need not to upgrade the priority of interference source tabulation because the tabulation of the interference source of the 4th sub-district only stores an interference source F1; Determine the highest frequency of frequency the Resources list medium priority of the 4th sub-district: suppose that the frequency difference between F5 and the F1 is poor greater than the frequency between F4 and the F1, and it is poor greater than the frequency between F3 and the F1, and poor greater than the frequency between F2 and the F1, then F5 is the highest frequency of frequency the Resources list medium priority of the 4th sub-district.
For the 3rd sub-district, the tabulation of the interfered cell of the 3rd sub-district comprises the 2nd sub-district, therefore the numbering of the 2nd sub-district is deleted from the interfered cell tabulation of the 3rd sub-district; Frequency the Resources list of the 3rd sub-district comprises F1, then F1 is deleted from frequency the Resources list of the 3rd sub-district, with the interference source tabulation that F1 is stored to the 3rd sub-district, writes down C
23,, then need not to upgrade the priority of interference source tabulation because the tabulation of the interference source of the 3rd sub-district only stores an interference source F1; Determine the highest frequency of frequency the Resources list medium priority of the 3rd sub-district: suppose that the frequency difference between F5 and the F1 is poor greater than the frequency between F4 and the F1, and it is poor greater than the frequency between F3 and the F1, and poor greater than the frequency between F2 and the F1, then F5 is the highest frequency of frequency the Resources list medium priority of the 3rd sub-district.
When distributing frequency for the second time, F5 is distributed to the 1st sub-district.
After for the second time distributing frequency, the 4th cell update list of persons in the tabulation of the interfered cell of the 1st sub-district, the list of persons behind the 4th cell update is as shown in table 3.
| Cell number | The frequency resource tabulation | The interference source tabulation | The interfered cell tabulation |
| The 2nd sub-district | F1，F2，F3，F4，F5 | The 1st sub-district, the 3rd sub-district, the 4th sub-district | |
| The 1st sub-district | F5，F2，F3，F4 | F1，C12 | The 4th sub-district |
| The 4th sub-district | F2，F3，F4， | (F1，C24)(F5，C14) | The 3rd sub-district |
| The 3rd sub-district | F5，，F2，F3，F4 | (F1，C23) | The 4th sub-district |
Table 3
Specifically, the process of the 4th cell update list of persons is: the interfered cell tabulation of the 4th sub-district comprises the 1st sub-district, therefore the numbering of the 1st sub-district is deleted from the interfered cell tabulation of the 4th sub-district; Frequency the Resources list of the 4th sub-district comprises F5, then F5 is deleted from frequency the Resources list of the 4th sub-district, with the interference source tabulation that F5 is stored to the 4th sub-district, writes down C
14, upgrade the priority of each frequency in the interference source tabulation of the 4th sub-district then: suppose C
24Less than C
14, then the priority of F1 is greater than the priority of F5; Determine the highest frequency of frequency the Resources list medium priority of the 4th sub-district: suppose that the frequency difference between F5 and the F2 is poor greater than the frequency between F5 and the F3, and poor greater than the frequency between F5 and the F4, then F2 is the highest frequency of frequency the Resources list medium priority of the 4th sub-district.
Divide timing for the third time, F2 is distributed to the 4th sub-district.
After distributing frequency for the third time, the 3rd cell update list of persons in the tabulation of the interfered cell of the 4th sub-district, the list of persons behind the 3rd cell update is as shown in table 4.
| Cell number | The frequency resource tabulation | The interference source tabulation | The interfered cell tabulation |
| The 2nd sub-district | F1，F2，F3，F4，F5 | The 1st sub-district, the 3rd sub-district, the 4th sub-district | |
| The 1st sub-district | F5，F2，F3，F4 | F1，C12 | The 4th sub-district |
| The 4th sub-district | F2，F3，F4， | (F1，C24)(F5，C14) | The 3rd sub-district |
| The 3rd sub-district | F5，F3，F4 | (F1，C23)(F2，C34) |
Table 4
Specifically, the process of the 3rd cell update list of persons is: the interfered cell tabulation of the 3rd sub-district comprises the 4th sub-district, therefore the numbering of the 4th sub-district is deleted from the interfered cell tabulation of the 3rd sub-district; Frequency the Resources list of the 3rd sub-district comprises F2, then F2 is deleted from frequency the Resources list of the 3rd sub-district, with the interference source tabulation that F2 is stored to the 3rd sub-district, writes down C
34, upgrade the priority of each frequency in the interference source tabulation of the 3rd sub-district then: suppose C
23Less than C
34, then the priority of F1 is greater than the priority of F2; Determine the highest frequency of frequency the Resources list medium priority of the 3rd sub-district: suppose that the frequency difference between F5 and the F2 is poor greater than the frequency between F3 and the F2, and poor greater than the frequency between F4 and the F2, then F5 is the highest frequency of frequency the Resources list medium priority of the 3rd sub-district.
Divide timing for the third time, F5 is distributed to the 3rd sub-district.
So far, this flow process finishes.
In addition, need to prove, in actual applications, said method can be used for distributing the dominant frequency point, said method also can be used for distributing auxilliary frequency, only when assisting frequency point allocation, also need consider to have distributed the annoyance level of the sub-district of dominant frequency point to the sub-district of the auxilliary frequency of current distribution.
To sum up, in the present invention, at first set up and quantize interference matrix, determine the distribution difficulty factor of each sub-district according to quantizing interference matrix, then according to the distribution difficulty factor that quantizes interference matrix and each sub-district, determine the priority of sub-district, be followed successively by each cell allocation frequency according to native region priority from height to low order at last, as seen, frequency planning aim provided by the present invention is not to adopt the least possible frequency resource to satisfy system requirements, but introduced quantification interference matrix, quantize interference matrix and write down the annoyance level of two sub-districts, so just make the frequency planning process take into full account annoyance level between the sub-district, for each sub-district provides optimum frequency.
Further, in the present invention, after frequency point allocation is carried out in a sub-district, the interfered cell that is assigned with frequency point cell is the list of persons of real-time update self all, the process of upgrading list of persons comprises: upgrade the interference source tabulation, frequency resource tabulation and interfered cell tabulation, thereby after making that each sub-district is assigned with frequency, the state of its interfered cell also changes in real time, guaranteed the optimality of each distribution frequency, and when giving follow-up cell allocation frequency, directly that the priority of list of persons medium frequency the Resources list of sub-district is the highest frequency has improved the efficient of frequency planning like this as distributing frequency.Simultaneously, in the present invention,, like this, under the relatively abundant or not enough situation of frequency resource, can be that current area is distributed optimum frequency all based on actual conditions so long as the frequency of current area support all participates in planning.
Claims (9)
1. the frequency planning method of a TD-SCDMA sub-district is characterized in that, this method comprises:
A, foundation quantize interference matrix;
B, determine the distribution difficulty factor of each sub-district according to quantizing interference matrix;
C, according to the distribution difficulty factor that quantizes interference matrix and each sub-district, determine the priority of sub-district;
D, according to native region priority from height to low order, be followed successively by each cell allocation frequency.
2. method according to claim 1 is characterized in that, sets up the method that quantizes interference matrix described in the steps A and comprises:
A1, each sub-district is numbered: X={ the 1st sub-district, the 2nd sub-district ... M sub-district, wherein, X is the numbered sequence of sub-district, M is the summation of sub-district number;
A2, set up the quantification interference matrix of M * M
Wherein, C
IjBe first interference factor between i sub-district and the j sub-district, be used to represent the annoyance level between i sub-district and the j sub-district, wherein, work as C
Ij=-1, then represent between i sub-district and the j sub-district noiselessly, work as C
Ij＞=0, then representing has interference between i sub-district and the j sub-district, and C
IjValue big more, then annoyance level is more little.
3. method according to claim 2 is characterized in that,
Between i sub-district that does not belong to same base station and j sub-district apart from d
IjLess than the reusable distance, and i sub-district and j sub-district intersect for how much, then C
Ij=d
Ij
Between i sub-district that does not belong to same base station and j sub-district apart from d
IjMore than or equal to reusable distance, then C
Ij=-1;
Between i sub-district that does not belong to same base station and j sub-district apart from d
IjLess than the reusable distance, and i sub-district and j sub-district do not intersect for how much, then C
Ij=-1;
When i sub-district and j sub-district belong to same base station, C then
Ij=0; Wherein, i is more than or equal to 1 and smaller or equal to M, and j is more than or equal to 1 and smaller or equal to M.
4. method according to claim 2 is characterized in that, determines described in the step B that the method for the distribution difficulty factor of each sub-district comprises:
B1, determine the second interference factor G between i sub-district and the j sub-district
Ij, wherein, if C
Ij＞=0, G then
Ij=1; Otherwise, C
Ij=0;
The distribution difficulty factor of B2, calculating i sub-district
5. method according to claim 4 is characterized in that, determines described in the step C that the method for the priority of sub-district comprises:
C1, set up two formations: native region priority L formation and the N formation of unallocated sub-district;
C2, will distribute the sub-district of difficulty factor maximum at first to put into the L formation, the N formation is put in other sub-districts;
The size of first interference factor between each sub-district in each sub-district and the N formation in C3, the comparison L formation, the tail of the queue of L formation is put in the pairing sub-district of minimum first interference factor in the N formation, and delete from the N formation, wherein, when first interference factor is-1, do not participate in above-mentioned comparison, and, be-1 as if first interference factor between each sub-district in each sub-district in the L formation and the N formation, then will distribute the sub-district of difficulty factor maximum put into L formation tail of the queue in the N formation, and delete from the N formation;
C4, repeated execution of steps C3, all the sub-district is placed in the L formation in the N formation, and the sub-district of final L queue record is the priority orders of sub-district in proper order.
6. method according to claim 5 is characterized in that, comprises for the method for each cell allocation frequency described in the step D:
D1, set up list of persons for each sub-district, list of persons comprises: cell number, frequency the Resources list, interference source tabulation and interfered cell tabulation, and to frequency the Resources list, interference source tabulation and interfered cell tabulation carrying out initialization;
Wherein, during initialization, the frequency range that each frequency in frequency the Resources list of i sub-district is supported according to the sub-district is provided with, with each frequency in frequency the Resources list of i sub-district from head of the queue to tail of the queue put in order as initialization the time default priority, the highest frequency of default priority when the 1st frequency that is arranged in head of the queue is initialization;
The interference source list storage of i sub-district: the frequency that the i sub-district produce is disturbed and each produce the frequency that the disturbs annoyance level to the i sub-district, the frequency that described generation is disturbed is to be assigned with the sub-district of interference frequency and first interference factor between the i sub-district to the annoyance level of i sub-district, during initialization, the interference source tabulation is for empty;
The numbering of the sub-district that the interfered cell list storage of i sub-district produce to be disturbed the i sub-district, during initialization, described to the i sub-district produce the sub-district of disturbing be and the i sub-district between first interference factor more than or equal to 0 sub-district;
D2, being followed successively by each cell allocation frequency from height to low order according to native region priority, is that the method for i cell allocation frequency is: with the highest k of frequency the Resources list medium priority of i sub-district
iFrequency point allocation is given i sub-district, k
iMore than or equal to 1 and smaller or equal to the summation of frequency points;
Each sub-district is upgraded the interfered cell tabulation and the interference source tabulation of list of persons respectively in the interfered cell tabulation of D3, i sub-district, and the highest frequency of frequency the Resources list medium priority of definite list of persons.
7. method according to claim 6, it is characterized in that, the method of s cell update interfered cell tabulation comprised during the interfered cell of i sub-district was tabulated: if comprise the i sub-district in the tabulation of the interfered cell of s sub-district, then the numbering of i sub-district is deleted from the interfered cell tabulation of s sub-district; If do not comprise the s sub-district in the s area interference cell list, then do not do any operation, wherein, s is more than or equal to 1 and smaller or equal to M.
8. method according to claim 7 is characterized in that, the method for s cell update interference source tabulation comprises in the interfered cell tabulation of i sub-district:
If frequency the Resources list of s sub-district comprises k
iFrequency is then with k
iFrequency is deleted from frequency the Resources list of s sub-district, and with k
iFrequency is stored to k
iIn the interference source tabulation of sub-district, the first interference factor C in the interference source tabulation of s sub-district between storage i sub-district and the s sub-district
Is, upgrade the priority of each frequency in the interference source tabulation of s sub-district then according to the size of first interference factor, wherein, first interference factor is big more, and then priority is low more;
If frequency the Resources list of s sub-district does not comprise k
iFrequency is then searched k in the interference source tabulation of s sub-district
iFrequency if find, then contrasts and is assigned with first interference factor between sub-district and the s sub-district and the first interference factor C of current sub-distribution before the current sub-distribution
IsSize, with in the interference source tabulation with k
iFirst interference factor of frequency correspondence is updated to wherein bigger one, upgrades the priority of each frequency in the interference source tabulation of s sub-district then according to the size of first interference factor, and first interference factor is big more, and then priority is low more; As do not find, then do not do any operation.
9. method according to claim 8 is characterized in that, determines that the method for the frequency that frequency the Resources list medium priority of s sub-district in the interfered cell tabulation of i sub-district is the highest comprises:
Get the minimum frequency of interference source tabulation medium priority of s sub-district, in frequency the Resources list of s sub-district, inquire about the frequency of frequency difference maximum with it, with the frequency of frequency difference maximum with it as the highest frequency of frequency resource tabulation medium priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010175638.0A CN102244872B (en) | 2010-05-12 | 2010-05-12 | Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010175638.0A CN102244872B (en) | 2010-05-12 | 2010-05-12 | Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102244872A true CN102244872A (en) | 2011-11-16 |
| CN102244872B CN102244872B (en) | 2014-04-09 |
Family
ID=44962632
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010175638.0A Expired - Fee Related CN102244872B (en) | 2010-05-12 | 2010-05-12 | Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102244872B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404752A (en) * | 2011-12-23 | 2012-04-04 | 广东省电信工程有限公司 | Frequency planning method in GSM network |
| CN102595417A (en) * | 2012-02-22 | 2012-07-18 | 电信科学技术研究院 | Planning method and system for community resources |
| CN103563423A (en) * | 2013-05-24 | 2014-02-05 | 华为技术有限公司 | Wireless communication method and frequency distribution device |
| CN104602248A (en) * | 2013-11-01 | 2015-05-06 | 中国移动通信集团设计院有限公司 | Physical cellular identification assessment method and physical cellular identification assessment network |
| CN103563423B (en) * | 2013-05-24 | 2016-11-30 | 华为技术有限公司 | A kind of wireless communications method and frequency assigning apparatus |
| CN106817768A (en) * | 2015-12-01 | 2017-06-09 | 中国移动通信集团广东有限公司 | A kind of TD-SCDMA network frequency allocation method and device |
| CN107896373A (en) * | 2017-12-30 | 2018-04-10 | 长沙中天电子设计开发有限公司 | More base station communication methods, system, storage medium and its computer equipment |
| CN108769994A (en) * | 2018-06-28 | 2018-11-06 | 深圳前海中电慧安科技有限公司 | Frequency point determines method and device |
| CN112020071A (en) * | 2019-05-31 | 2020-12-01 | 中国电信股份有限公司 | Cell frequency planning method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6223041B1 (en) * | 1997-08-06 | 2001-04-24 | Nortel Networks Ltd | Dynamic radio resource allocation in a wireless communication system |
| CN101420760A (en) * | 2008-12-04 | 2009-04-29 | 华为技术有限公司 | Edge customer scheduling method and device |
-
2010
- 2010-05-12 CN CN201010175638.0A patent/CN102244872B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6223041B1 (en) * | 1997-08-06 | 2001-04-24 | Nortel Networks Ltd | Dynamic radio resource allocation in a wireless communication system |
| CN101420760A (en) * | 2008-12-04 | 2009-04-29 | 华为技术有限公司 | Edge customer scheduling method and device |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404752A (en) * | 2011-12-23 | 2012-04-04 | 广东省电信工程有限公司 | Frequency planning method in GSM network |
| CN102404752B (en) * | 2011-12-23 | 2014-03-26 | 广东省电信工程有限公司 | Frequency planning method in GSM network |
| CN102595417B (en) * | 2012-02-22 | 2015-06-24 | 电信科学技术研究院 | Planning method and system for community resources |
| CN102595417A (en) * | 2012-02-22 | 2012-07-18 | 电信科学技术研究院 | Planning method and system for community resources |
| CN103563423B (en) * | 2013-05-24 | 2016-11-30 | 华为技术有限公司 | A kind of wireless communications method and frequency assigning apparatus |
| CN103563423A (en) * | 2013-05-24 | 2014-02-05 | 华为技术有限公司 | Wireless communication method and frequency distribution device |
| CN104602248A (en) * | 2013-11-01 | 2015-05-06 | 中国移动通信集团设计院有限公司 | Physical cellular identification assessment method and physical cellular identification assessment network |
| CN104602248B (en) * | 2013-11-01 | 2018-09-07 | 中国移动通信集团设计院有限公司 | A kind of method and network of assessment Physical Cell Identifier |
| CN106817768A (en) * | 2015-12-01 | 2017-06-09 | 中国移动通信集团广东有限公司 | A kind of TD-SCDMA network frequency allocation method and device |
| CN106817768B (en) * | 2015-12-01 | 2020-07-31 | 中国移动通信集团广东有限公司 | TD-SCDMA network frequency allocation method and device |
| CN107896373A (en) * | 2017-12-30 | 2018-04-10 | 长沙中天电子设计开发有限公司 | More base station communication methods, system, storage medium and its computer equipment |
| CN108769994A (en) * | 2018-06-28 | 2018-11-06 | 深圳前海中电慧安科技有限公司 | Frequency point determines method and device |
| CN108769994B (en) * | 2018-06-28 | 2022-10-11 | 深圳前海中电慧安科技有限公司 | Frequency point determination method and device |
| CN112020071A (en) * | 2019-05-31 | 2020-12-01 | 中国电信股份有限公司 | Cell frequency planning method and device |
| CN112020071B (en) * | 2019-05-31 | 2022-08-30 | 中国电信股份有限公司 | Cell frequency planning method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102244872B (en) | 2014-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102244872B (en) | Frequency planning method of TD-SCDMA (Time Division Synchronization Code Division Multiple Access) cells | |
| EP2493118B1 (en) | Information processing system | |
| CN103345508B (en) | A kind of date storage method being applicable to community network figure and system | |
| CN103680496A (en) | Deep-neural-network-based acoustic model training method, hosts and system | |
| CN107239468B (en) | Task node management method and device | |
| CN111311005B (en) | Distribution path planning method, distribution path planning device, distribution path planning medium and computer equipment | |
| CN105260404A (en) | Time sequence data storage method and apparatus | |
| CN103079212B (en) | A kind of dynamic frequency allocation method based on interference matrix | |
| CN102726002A (en) | Data configuration, and back off method and device for data configuration | |
| CN103118435B (en) | A kind of node scheduling method, equipment and system | |
| CN112699134A (en) | Distributed graph database storage and query method based on graph subdivision | |
| CN103249159A (en) | Radio resource distribution method in multi-beam satellite mobile communication system | |
| CN111461443A (en) | Optimal design method and system for wind power plant, electronic device and storage medium | |
| CN109089323B (en) | Low-overhead industrial wireless sensor selection method | |
| CN113626138B (en) | Application program access method and related device | |
| CN117933490A (en) | Airport scene dragging scheduling optimization method, electronic equipment and storage medium | |
| CN108199763A (en) | Repeater satellite method for scheduling task and system | |
| CN103077127A (en) | Method and device for determining data migration target | |
| CN106933624A (en) | A kind of Intelligent hardware control system and control method | |
| CN103927264B (en) | A kind of distribution method in airborne digital map software map datum running memory space | |
| CN114173421B (en) | LoRa logic channel based on deep reinforcement learning and power distribution method | |
| CN106776001A (en) | The location mode and device of a kind of distributed experiment ＆ measurement system data | |
| CN105022722A (en) | Electronic form row and column freezing method and electronic form row and column freezing device | |
| CN106775850A (en) | The installation calculating of instance system application and installation method | |
| CN111144786B (en) | Resource allocation method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CHINA POTEVIO CO., LTD. Free format text: FORMER OWNER: PUTIAN IT TECH INST CO., LTD. Effective date: 20130227 Owner name: PUTIAN IT TECH INST CO., LTD. Free format text: FORMER OWNER: CHINA POTEVIO CO., LTD. Effective date: 20130305 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20130305 Address after: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant after: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd. Address before: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District Applicant before: CHINA POTEVIO CO.,LTD. Effective date of registration: 20130227 Address after: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District Applicant after: CHINA POTEVIO CO.,LTD. Address before: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant before: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140409 |