WO2014067158A1 - 调度方法、装置和基站 - Google Patents
调度方法、装置和基站 Download PDFInfo
- Publication number
- WO2014067158A1 WO2014067158A1 PCT/CN2012/084073 CN2012084073W WO2014067158A1 WO 2014067158 A1 WO2014067158 A1 WO 2014067158A1 CN 2012084073 W CN2012084073 W CN 2012084073W WO 2014067158 A1 WO2014067158 A1 WO 2014067158A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- pairing
- user
- group
- paired
- channel
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 230000003993 interaction Effects 0.000 claims abstract description 36
- 230000004044 response Effects 0.000 claims abstract description 30
- 238000012545 processing Methods 0.000 claims abstract description 15
- 238000004364 calculation method Methods 0.000 claims description 27
- 230000003595 spectral effect Effects 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 12
- 238000001228 spectrum Methods 0.000 claims description 5
- 235000013399 edible fruits Nutrition 0.000 claims 1
- 238000005516 engineering process Methods 0.000 description 11
- 230000005540 biological transmission Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000005562 fading Methods 0.000 description 5
- 238000013468 resource allocation Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/121—Wireless traffic scheduling for groups of terminals or users
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
Definitions
- the present invention relates to the field of communications, and in particular, to a scheduling method, apparatus, and base station.
- MIMO Multiple Input Multiple Output
- MU- ⁇ Multi User-Multiple Input Multiple Output
- the method of using the MU MIM0 technology in the prior art is to ensure that the channel quality of the entire network user is not lower than a certain threshold or the rate is not lower than a certain threshold, in the case of known global information. Iterate through all possible user pairings and resource allocations and obtain a global optimal solution through exhaustive search.
- the computational complexity of this method is very high and can be used as a theoretical upper limit, but it cannot be implemented in the product.
- the amount of information that needs to be exchanged between base stations is very large, and there is a problem of delay.
- Another method of using the MU MIM0 technology in the prior art is to independently adopt the MU MIM0 technology for each cell, such as first user pairing and then resource allocation, or first resource allocation and then user pairing.
- the invention provides a scheduling method, a device and a base station, which solves the problem that the MU MIM0 technology is used independently for each cell and the cells lack cooperation among the cells in the prior art, and the interference information between the cells is used to improve The average cell throughput and the throughput of edge users.
- the embodiment of the present invention provides a scheduling method, where the method includes: pre-pairing all candidate users on a to-be-scheduled channel, and obtaining a pre-pairing result corresponding to the to-be-scheduled channel, where the The scheduling channel is any one of the channels to be scheduled, the pre-pairing result includes at least one pre-pairing group; and the pre-pairing node corresponding to the to-be-scheduled channel, according to channel quality information of the to-be-scheduled channel And channel response information and high-interference indication information of inter-cell interaction, calculating a signal to interference and noise ratio of each paired user of each pre-pairing group in the pre-pairing result; according to each pre-pairing group in the pre-pairing result a paired user's signal-to-noise ratio, after processing each of the pre-paired groups, obtaining all final suitable matching groups, and calculating the weights of all the final suitable matching groups and correspondingly matching the maximum weights to the final fit
- the scheduling channel is
- the pre-pairing result corresponding to the to-be-scheduled channel is determined according to channel quality information, channel response information, and inter-cell interaction of the to-be-scheduled channel.
- the interference indication information, the calculation of the signal to interference and noise ratio of each paired user of each pre-paired group in the pre-pairing result specifically: calculating, according to the high-interference indication information of the inter-cell interaction, all neighboring users to the local cell Calculating the interference power of each of the pre-paired groups in the pre-pairing result according to the interference power of the neighboring cell, the channel quality information of the to-be-scheduled channel, and the channel response information of all neighboring users Generating the useful signal power; calculating the signal dry noise of each paired user of each pre-paired group in the pre-pairing result according to the normalized useful signal power of each paired user of each pre-pairing result in the pre-pairing result ratio.
- the second possible implementation In the current mode, after processing the respective pre-paired groups according to the signal-to-noise ratio of each paired user of each pre-matching group in the pre-matching result, all final suitable matching groups are obtained, and the calculation is performed. Determining, by the first matching user, the final matching pairing group corresponding to the maximum weight, and determining whether the each pre-matching group is a preliminary suitable matching group.
- the group constitutes a preliminary suitable pairing result; calculating an instantaneous rate of each paired user in each of the preliminary suitable matching groups of the preliminary suitable pairing result; determining whether each of the preliminary suitable matching groups is a final suitable pairing result, if the preliminary suitable pairing The instantaneous rate of each paired user in the group is not less than the preset instantaneous rate threshold or meets its quality of service QoS guarantee conditions.
- the preliminary suitable matching group is the final suitable matching group, and all the final suitable matching groups constitute a final suitable matching result; calculating the weight of each final suitable matching group in the final suitable matching result, the weight of the final suitable matching group a sum of instantaneous rates of all paired users in the final suitable pairing group, or a sum of proportional fairness coefficients of all paired users in the final suitable pairing result; selecting the maximum weight among the weights of each of the final suitable matching groups a value, and determining the final suitable pairing group corresponding to the maximum weight as the first pairing user of the to-be-scheduled channel.
- an embodiment of the present invention provides a scheduling apparatus, where the apparatus includes: a pre-pairing module, configured to pre-pair all candidate users on a to-be-scheduled channel, and obtain a pre-corresponding to the to-be-scheduled channel.
- a pre-pairing module configured to pre-pair all candidate users on a to-be-scheduled channel, and obtain a pre-corresponding to the to-be-scheduled channel.
- the tuning channel is any one of all channels to be scheduled
- the pre-pairing result includes at least one pre-pairing group, and transmitting a pre-pairing result corresponding to the to-be-scheduled channel to a signal-to-noise ratio a generating module; a signal-to-noise-ratio generating module, configured to receive, from the pre-pairing module, a pre-pairing result corresponding to the to-be-scheduled channel, according to the pre-pairing result corresponding to the to-be-scheduled channel, according to the to-be-scheduled channel
- the channel quality information, the channel response information, and the high-interference indication information of the inter-cell interaction calculate a signal to interference and noise ratio of each paired user of each pre-paired group in the pre-pairing result, and each of the pre-pairing results
- the signal to interference and noise ratio of each paired user of the pre-pairing group is transmitted to the weight generation module; the weight generation module is configured to generate the signal to interference and
- the signal-to-noise-ratio generating module includes: a first calculating unit, configured to calculate, according to the high-interference indication information of the inter-cell interaction, all neighboring users to the local cell Transmitting power, and transmitting the interference power of all neighboring users to the local cell to the second computing unit; the second calculating unit is configured to receive all the neighboring users sent by the first computing unit to the local cell Calculating the normalization power of each pair of users in the pre-pairing result according to the interference power of the neighboring cell, the channel quality information of the to-be-scheduled channel, and the channel response information.
- the third calculating unit is configured to receive the second computing unit to transmit The normalized useful signal power of each paired user of each pre-paired group in the pre-pairing result, according to each pre-matching
- the normalized useful signal power of each paired user of the pairing group is calculated, and the signal to interference and noise ratio of each paired user of each of the pre-paired groups in the pre-paired result is calculated.
- the weight generating module includes: the first determining unit is configured to determine whether the each pre-pairing group is Initially suitable for the pairing group, when the signal-to-noise ratio of each paired user of the pre-matching group is greater than or equal to a preset signal-to-noise ratio threshold, determining that the pre-matching group is the preliminary suitable matching group, All preliminary suitable pairing groups constitute a preliminary suitable pairing result, and the preliminary suitable pairing result is transmitted to the first calculating unit; the first calculating unit is configured to receive the preliminary suitable pairing result from the first determining unit, and calculate the The instantaneous rate of each paired user in each preliminary suitable pairing group that is initially suitable for the pairing result, and each preliminary suitable pairing of the preliminary suitable pairing result The instantaneous rate of each paired user in the group is transmitted to the second determining unit; the second determining unit is configured to receive, from the first calculating unit, the instantaneous rate of each paired user in the group
- an embodiment of the present invention provides a base station, where the base station includes: a network interface; a processor; a memory; an application physically stored in the memory, where the application includes: And the system performs the following steps: pre-pairing all candidate users on the to-be-scheduled channel, and obtaining a pre-pairing result corresponding to the to-be-scheduled channel, where the to-be-scheduled channel is any of all to-be-scheduled channels a channel, the pre-pairing result includes at least one pre-pairing group; for the pre-pairing result corresponding to the to-be-scheduled channel, channel quality information, channel response information, and inter-cell interaction height of the to-be-scheduled channel are determined
- the interference indication information calculating a signal-to-noise ratio of each paired user of each pre-matching group in the pre-pairing result; according to a signal-to-interference ratio of each paired user of each pre-pairing group in the pre-pairing result
- the application is configured to enable the processor and the system to perform the pre-pairing result corresponding to the to-be-scheduled channel, according to the to-be-scheduled channel
- the channel quality information, the channel response information, and the high interference indication information of the inter-cell interaction, and the instruction for calculating the signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result is: according to the inter-cell interaction
- the high-interference indication information is used to calculate the interference power of all neighboring users to the local cell; and the pre-pairing result is calculated according to the interference power of the neighboring cell, the channel quality information of the to-be-scheduled channel, and the channel response information.
- Normalized useful signal power for each paired user of each of the pre-paired groups calculating the pre-paired result based on the normalized useful signal power of each paired user of each of the pre-paired groups The signal to interference and noise ratio of each paired user of each pre-paired group.
- the signal to interference and noise ratio of each paired user according to each pre-pairing group in the pre-pairing result After processing the respective pre-pairing groups, obtaining all final suitable matching groups, and calculating weights of all the final suitable matching groups, and determining the final suitable matching group corresponding to the maximum weight as the to-be-scheduled
- the instruction of the first pairing user of the channel is: determining whether the respective pre-pairing groups are preliminary suitable matching groups, and the signal-to-noise ratio of each pairing user of the pre-pairing group is greater than or equal to a preset signal dry noise.
- the threshold Comparing the threshold, determining that the pre-matching group is the preliminary suitable matching group, and all the preliminary suitable matching groups constitute a preliminary suitable pairing result; and calculating whether the pair of the preliminary suitable matching result is the final suitable matching result, such as The instantaneous rate suitable for each paired user in the preliminary matching pairing group is not less than a preset instantaneous rate threshold value or meets the quality of service QoS guarantee condition,
- the preliminary suitable matching group is the final suitable matching group, and all the final suitable matching groups constitute a final suitable matching result; calculating the weight of each final suitable matching group in the final suitable matching result, and the weight of the final suitable matching group is The sum of the instantaneous rates of all the paired users in the pairing group, or the sum of the proportional fairness coefficients of all the paired users in the final matching result; Selecting a maximum weight among the weights of each of the final suitable pairing groups, and determining the final suitable pairing group corresponding to the maximum weight as the first pairing user of the to-be-scheduled channel.
- the pre-pairing result corresponding to the to-be-scheduled channel is obtained by using the scheduling method, the device, and the base station, and the pre-pairing result corresponding to the to-be-scheduled channel is obtained.
- Channel quality information of the channel, channel response information, and high interference indication information of inter-cell interaction calculating a signal-to-noise ratio of each paired user of each pre-pairing group in the pre-pairing result; according to each pre-matching group in the pre-pairing result
- a paired user's signal-to-noise ratio after processing each pre-paired group, all final suitable matching groups of pre-paired results are obtained, and the final suitable matching group corresponding to the weights of all final suitable matching groups and corresponding maximum weights is calculated.
- FIG. 1 is a flowchart of a scheduling method according to Embodiment 1 of the present invention.
- FIG. 2 is a flowchart of a scheduling method according to Embodiment 2 of the present invention.
- FIG. 3 is a flowchart of a scheduling method according to Embodiment 3 of the present invention.
- the pre-pairing result corresponding to the to-be-scheduled channel is obtained by performing pre-pairing on all the candidate users on the to-be-scheduled channel, and the channel quality information and channel according to the to-be-scheduled channel are obtained according to the pre-pairing result corresponding to the to-be-scheduled channel.
- the noise ratio after processing each pre-pairing group, obtain all the final suitable matching groups of the pre-pairing result, and calculate the weights of all the final suitable matching groups and determine the final suitable matching group corresponding to the maximum weight as the to-be-scheduled channel.
- the first pairing user performs user scheduling by using the first paired users of all the channels to be scheduled, thereby implementing interference information using inter-cell interaction, and improving the average throughput of the cell and the throughput of the edge users.
- FIG. 1 is a flowchart of a scheduling method according to Embodiment 1 of the present invention. As shown, the embodiment of the present invention specifically includes the following steps:
- Step 1 01 Pre-pairing all candidate users on the to-be-scheduled channel, and obtaining a pre-pairing result corresponding to the to-be-tuned channel.
- the to-be-scheduled channel is any one of all channels to be scheduled, and the pre-pairing node includes at least one pre-pairing group.
- the pairing result includes a plurality of pre-pairing groups; wherein the third number is two or more, and the third number is not greater than the second number.
- the number of channels to be scheduled is the first number, for example, 6 channels to be scheduled are channel 1, channel 2, channel 3, channel 4, channel 5, and channel 6.
- the number of candidate users is the second number, for example, 8 candidate users, namely User 1, User 2, User 3, User 4, User 5, User 6, User 7, and User 8.
- the third number of pairs is paired for two users, and two or more users can be paired. Wherein, the third quantity is not greater than the second quantity.
- the third number of pairs is paired for 2 users, then 2 users occupy the same channel; when the third number is paired to 2 When the user is paired, more than 2 users occupy the same channel.
- the channel may be a channel composed of time-frequency resources in Long Term Evolution (LTE) or Long Term Evolution-Advanced (LTE-A), that is, a Resouce Block (RB); A code channel in a Universal Mobile Telecommunications System (UMTS); or other form of channel.
- LTE Long Term Evolution
- LTE-A Long Term Evolution-Advanced
- RB Resouce Block
- UMTS Universal Mobile Telecommunications System
- Eight candidate users are paired on each channel to be scheduled, for example, two users are allowed to perform pairing, and eight candidate users are paired on each channel to be scheduled.
- a pairing group that allows one user to pair among the eight candidate users is: user 1 and user 2, user 1 and user 3, user 1 and user 4, user 1 and user 5, user 1 and user 6.
- each user's warranty and other users can only be paired once, and the pairing cannot be repeated.
- Step 102 According to the pre-pairing result corresponding to the to-be-scheduled channel, according to the channel quality information of the to-be-tuned channel, the channel response information of the user equipment (User Equipment, ⁇ ), and the high interference indication of the inter-cell interaction (High The Interference Indication (H11) information calculates a Signal to Interference plus Noise Ratio (SINR) of each paired user of each pre-paired group in the pre-matching result of the to-be-scheduled channel.
- SINR Signal to Interference plus Noise Ratio
- step 102 specifically includes the following steps:
- Step 201 Calculate the interference power of all neighboring users to the local cell by using the high-interference indication information of the inter-cell interaction.
- the calculation process of the interference power of the neighboring cell scheduled by the neighboring cell in the neighboring cell is as follows: (1) Assume that the neighboring cell user] the downlink pilot signal received power (RSRP) to the cell is RSRP DL , and the downlink pilot signal has a transmit power spectral density (PSD) of s . At this time, the calculation formula of the downlink large-scale fading of the neighboring user 1 to the local cell is as shown in the formula (1 1). Among them, large-scale fading is also called path loss (PL).
- RSRP downlink pilot signal received power
- PSD transmit power spectral density
- the path loss of all neighboring users is calculated, and the actual power value to the neighboring cell is the same as that of the neighboring user 1, as shown in formula (1 1 ) and Formula (1-2) is shown.
- the calculation formula of the interference power of all the users in the plurality of neighboring cells to the own cell is as shown in (2-2).
- the number of users in the district, ftS ; for the user, PL neighboring user i to the downlink large-scale fading of the cell, ie path loss, ⁇ « is the power of the background Gaussian white noise.
- Step 202 Calculate, according to the interference power of the local cell, the channel quality information of the to-be-scheduled channel, and the channel response information of all neighboring users, each paired user of each pre-pairing group in the pre-pairing result. Normalized useful signal power. As shown by the formula ( 3 1 ) and the formula ( 3 2 ) ( ⁇ " ⁇ , ⁇ . - '" + + P h, m ⁇ If ⁇ ' - ⁇ ⁇ 2 I ⁇ h' Formula ( 3 1 )
- the interference power; 1 is the unit matrix of ⁇ ⁇ ⁇ , m refers to the mth channel in the I" track.
- af, . ., c4 u is the normalized useful signal power for each paired user on the mth channel.
- 1 is the noise power corresponding to the normalized useful signal power of each paired user on the mth channel
- SINR " 1 , , ., S1NR1 is the signal to interference and noise ratio of each paired user on the mth channel.
- the process of if SINR can be performed by proposing one subcarrier from the channel, or extracting the average of thousands of subcarriers.
- Step 1 G 3 according to the signal-to-noise ratio of the pre-paired user, process each pre-paired group 3 ⁇ 4 and calculate all the finals
- the weight of the pairing group is suitable and the final suitable pairing group corresponding to the maximum weight is determined as the first pairing user of the channel to be scheduled.
- the number of the final suitable matching group is less than or equal to the number of the preliminary suitable matching group, and the number of the preliminary suitable matching group is less than or equal to the number of the pre-matching group.
- the foregoing step 103 includes the following steps:
- Step 301 Determine whether each pre-pairing group in the pre-pairing result is a preliminary suitable matching group, and a signal-to-noise ratio of each paired user in the pre-matching group.
- t ( ⁇ is greater than or equal to the preset signal-to-noise ratio threshold m ⁇ , as shown in equation (5)
- the pre-matching group can be considered as the preliminary suitable matching group, and all preliminary suitable matching groups constitute a preliminary fit. Pairing results.
- SINRr 1 SINR i ESH0LD Formula ( 5 ) where k is equal to 1, 2, ., ., or ⁇ .
- the pre- Paired users in the pairing group are not suitable for pairing, deleting or ignoring the paired group.
- All of the preliminary suitable matching groups obtained after the above pre-pairing result is processed in step 301 constitute a preliminary suitable pairing result.
- the number of preliminary suitable matching groups in the preliminary suitable pairing results is less than or equal to the number of pre-matching groups in the pre-matching knots.
- Step 302 Calculate the instantaneous rate of each paired user in each of the preliminary suitable pairing groups in the preliminary suitable pairing result.
- users will be paired for the initial link adaptation and adaptive modulation and coding (Adapt ive Modu lati on Cod i ng, AMC), and hide one thousand 'Poisson's ratio 1 encoding transducer port .. table, Query the encoding method of each paired user.
- the instantaneous rate of each paired user is calculated according to the encoding mode of each paired user and the capacity information of the channel to be scheduled.
- the conversion table of the signal-to-noise ratio and the coding mode provided by each communication equipment vendor is also different.
- Step 303 Determine whether each of the preliminary suitable matching groups is a final suitable pairing result, if the instantaneous rate of each paired user in the preliminary suitable matching group calculated above is not less than a preset instantaneous rate threshold or meets its service quality QoS. Guarantee conditions, then the initial suitable pairing group is finally suitable Pairing groups, all ultimately suitable pairing groups constitute the final suitable pairing result.
- / ⁇ (0, ..., r (t) is the calculated instantaneous rate of each paired user in the preliminary suitable pairing group. If the calculated instantaneous rate after the N u users are paired is not lower than If a certain rate threshold meets other QoS requirements, the user may be considered to be suitable for the paired user, and the initial suitable pairing group is the final suitable matching group.
- the formula (6) is shown.
- the instantaneous rate of at least one paired user is less than the preset instantaneous rate threshold or does not satisfy other quality of service QoS.
- the paired users in the preliminary suitable pairing group are not suitable for pairing, and the preliminary suitable matching group is deleted or ignored.
- all the preliminary suitable matching groups obtained by the pre-pairing result after the processing in step 302 constitute the final suitable pairing result.
- the number of final suitable matching groups in the final suitable pairing result is less than or equal to the number of preliminary suitable matching groups in the preliminary suitable pairing results.
- Step 304 Calculate the weights of each of the final suitable matching groups in the final suitable pairing result.
- the weight of the final suitable pairing group is the sum of the instantaneous rates that are finally suitable for all the paired users in the pairing group, or finally the sum of the proportional fairness coefficients of all the paired users in the pairing result.
- the proportional fairness factor of the paired user is the ratio of the instantaneous rate of the paired user to the average rate.
- the calculation weight can be calculated by using the proportional fairness coefficient of each paired user in addition to the calculation using the instantaneous rate of each paired user.
- the proportional fairness coefficient of each paired user is calculated according to the instantaneous rate of each paired user in the final suitable pairing group.
- the proportional fairness coefficient of each paired user is the ratio of the instantaneous rate of the paired user to the average rate.
- the average rate of paired users is that the paired users are certain The average of all instantaneous rates over time.
- the sum of the proportional fairness coefficients of all paired users in the final pairing group is calculated, and the sum of the fairness coefficients is the weight of the final suitable pairing group on the channel to be scheduled.
- the calculation method of the weights of the other finally suitable pairing groups of the channel is similar, and even the calculation method of the weights of the final suitable pairing group of other channels is similar, and will not be described in detail here.
- the number of preliminary suitable matching groups is less than or equal to the number of pre-matching groups; and finally the number of suitable matching groups is less than or equal to the number of preliminary suitable matching groups.
- the above calculated weights can also be calculated by the Shannon formula.
- the Shannon formula is a prior art. It is not described in detail here. It is worth noting that the above calculated weights can be either throughput or proportional (Proportional). Fair, PF) value, or other form of PF value.
- channel 1 selects /3 ⁇ 4(25) equals 1.01 as the maximum weight, user 2 and user 5 are taken as the first
- Step 104 The first paired user of all the channels to be scheduled is used to perform user scheduling.
- the first number of first paired users are obtained.
- the first number of first paired users are grouped, and the first pair of users who have the largest number of users participating in the pairing are selected as the second paired user group from the plurality of first paired user groups, and according to the second pairing
- the number of user groups is the third paired user of the third paired user group and the third user group.
- the first number of channels, the first number of first paired users are obtained, and all the first paired users are grouped, and each group ensures that the allocated users are not duplicated.
- the first paired user group selected in the group is the second paired user group.
- the sum of the weights of all the second pairing users in each second pairing user group is calculated separately, and the second pairing user group with the largest sum of the selected weights is the third. Pair the user group, and the paired user of the third paired user group is the third paired user.
- the first paired user of the channel to be scheduled and the third paired user of the third paired user group are respectively compared, and if the first paired user is the same as the third paired user in the third paired user group, Selecting a channel to be scheduled corresponding to the first pairing user to perform data transmission; if the first pairing user and all the third pairing users in the third pairing user group are different, then the first pairing user corresponds to The weights of all the third paired users in the third paired user group are calculated on the to-be-scheduled channel, and the third paired user with the largest weight is selected to perform data transmission with the channel to be scheduled corresponding to the first-pair user.
- the first paired user of channel 1 is _ (25), and the weight of 3 ⁇ 4 (25) is equal to 1
- the first paired user of channel 2 is A4 ( 34), and ⁇ ( 34)
- the weight is equal to 0.96;
- the first paired user of channel 3 is As (35), and the weight of A5 (35) is equal to 0.93;
- the first paired user of channel 4 is 3 ⁇ 4 (46), and ⁇ (46)
- the weight of the weight is equal to 1. 17;
- the first pairing user of channel 5 is ⁇ (36), and the weight of ⁇ (36) is equal to 1.
- the third pairing user group ⁇ i3 ⁇ 4(35), ;3 ⁇ 4(46), 3 ⁇ 4(28) ⁇ is determined, where the third pairing user is ⁇ 5 (35), 0 (46), 3 ⁇ 4 (28).
- the first pairing user of channel 1 is; 3 ⁇ 4 (25), and the third pairing user is 3 ⁇ 4 (35) ), 3 ⁇ 4(46), /3 ⁇ 4(28), compare 3 ⁇ 4(25) with /3 ⁇ 4(35), 3 ⁇ 4(46), /3 ⁇ 4(28), and compare the result to the first paired user of channel 1.
- the weights of ⁇ 5 (35), 1 ⁇ 2(46), ⁇ 3 (28) are calculated on channel 1, and the calculated weight is selected as the largest value.
- the third paired user such as 3 ⁇ 4 (35), has a weight of 0. 97.
- the third paired user ⁇ 5 (35) is selected, that is, the user 3 and the user 5 are paired, and the data transmission is performed by using the channel 1;
- the first paired user of channel 3 is As (35)
- the third pairing user is ⁇ (35), 3 ⁇ 4 0 (46), ⁇ ⁇ 3 (28), 3 ⁇ 4 (35) and / 3 ⁇ 4 (35) respectively.
- i3 ⁇ 4. (46), i3 ⁇ 4 (28) for comparison the comparison result is channel 3 If the factory and the third paired user in the third paired user group are the same, then select ⁇
- the channel 3 is used for the data transmission channel ⁇ - the same, and will not be described in detail here.
- step 104 specifically includes the following steps:
- the six channels to be scheduled, and eight candidates allows the user to pair two users if the channel 1 select ⁇ . (25) is the maximum weight, then user 2 and user 5 are selected as the first pairing channel 2 (34) as the maximum weight, then user 3 and user 4 are used as the first pairing user; channel 3 is selected as A5 (35) ) is the maximum weight, then user 3 and user 5 are used as the first pairing user; channel 4 selects ⁇ (46) as the maximum weight, then user 4 and user 6 are used as the first pairing user; channel 5 selects the maximum weight , user 3 and user 6 are used as the first pairing user; channel 6 is selected as ⁇ (28 3 ⁇ 4 households and user 8 as the first pairing user dark).
- the number of the first pair of users in all the first paired user groups is calculated separately. such as:
- ⁇ 3 ⁇ 4( 35 ) ⁇ is a paired user group with only one paired user, ⁇ 2 . ( 46 ), 3 ⁇ 4 ( 2 ⁇ is a paired user group with two paired users, ⁇ . (35), /3 ⁇ 4(46), /3 ⁇ 4(28) ⁇ is a paired user group with three paired users.
- the maximum value is selected from the number of the first pair of users in the first pair of user groups; then the first pair of user groups corresponding to the maximum value is used as the second pairing user group, and the first pair corresponding to the maximum value is simultaneously The user acts as the second pairing user.
- the second pairing user group is used as the third pairing user group, and the second pairing user in the second pairing user group is used as the third pairing user;
- the user group is two or more, the weights of all the second paired users in the second paired user group are calculated, and the weight and the largest second paired user group are used as the third paired user group, and the second pairing is performed simultaneously.
- the second paired user within the user group acts as the third paired user.
- ⁇ ; 5 (35), i3 ⁇ 4 0 (46), 3 ⁇ 4 (28) ⁇ are the second paired user group, that is, the paired user group having three paired users, and the number of the first paired users included is the largest, and If there is only one pairing user group including three paired users, then 5 (35), p 46), /3 ⁇ 4 (28) ⁇ will be used as the third pairing user group, and / 3 ⁇ 4 (35), p 46), A3 ( 28) As a third pairing user.
- the second pairing user group including the three paired users is not only one, and there are two or more, the weight of the second pairing user in each second pairing user group is calculated, and the process of calculating the weight is as follows.
- the scheduling method provided by the embodiment of the present invention performs pre-pairing on all the candidate users on the to-be-scheduled channel to obtain a pre-pairing result corresponding to the to-be-scheduled channel; and the pre-pairing result corresponding to the to-be-scheduled channel, according to the to-be-scheduled channel Channel quality information, channel response information, and high-interference indication information of inter-cell interactions, calculating a signal-to-interference ratio of each paired user of each pre-pairing group in the pre-pairing result; according to each pre-pairing group in the pre-pairing result Pairing the user's signal-to-noise ratio, after processing each pre-paired group, obtaining all the final suitable matching groups of the pre-matching results,
- FIG. 4 is a schematic diagram of a scheduling apparatus according to Embodiment 4 of the present invention, where the scheduling apparatus is configured to perform the scheduling method provided by Embodiments 1, 2, and 3 of the present invention.
- the scheduling apparatus provided by the embodiment of the present invention specifically includes: a pre-pairing module 41, a signal-to-noise ratio generating module 42, a weight generating module 43 and a scheduling module 44.
- the pre-pairing module 41 is configured to pre-pair all the candidate users on the to-be-scheduled channel to obtain a pre-pairing result corresponding to the to-be-scheduled channel, and the to-be-scheduled channel is any one of all to-be-scheduled channels, and the pre-pairing result includes at least a pre-pairing group, and the pre-pairing result corresponding to the channel to be scheduled is transmitted to the signal to interference and noise ratio generating module 42.
- the signal to interference and noise ratio generating module 42 receives the pre-pairing result corresponding to the channel to be scheduled from the pre-pairing module 41, and is configured to Pre-pairing result corresponding to the scheduling channel, calculating a signal-to-noise ratio of each paired user of each pre-pairing group in the pre-pairing result according to channel quality information, channel response information, and high-interference indication information of the inter-cell interaction And transmitting the signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result to the weight generating module 43; the weight generating module 43 receives each pre-pairing in the pre-pairing result from the signal-to-noise-ratio generating module 42.
- the signal to interference and noise ratio of each paired user of the group After processing each pre-pairing group, all final matching groups are obtained, and Calculating all the weights that are finally suitable for the pairing group and determining the final suitable pairing group corresponding to the maximum weight as the first pairing user of the channel to be scheduled, and transmitting the first pairing users of all the channels to be scheduled to the scheduling module 44;
- the first paired user for receiving all the channels to be scheduled from the weight generation module 43 performs user scheduling with the first paired users of all the channels to be scheduled.
- the signal to interference and noise ratio generation module 42 in the scheduling apparatus specifically includes: a first calculation unit 51, a second calculation unit 52, and a third calculation unit 53.
- the first calculating unit 51 is configured to calculate interference power of all neighboring users to the local cell according to the high-interference indication information of the inter-cell interaction, and transmit the interference power of all neighboring users to the local cell to the second computing unit 52;
- the second calculating unit 52 is configured to receive the interference power of all neighboring users sent by the first calculating unit 51 to the local cell, according to the interference power of the neighboring cell, the channel quality information of the channel to be scheduled, and the channel response information. Calculating normalized useful signal power of each paired user of each pre-paired group in the pre-pairing result, and transmitting normalized useful signal power of each paired user of each pre-matching group in the pre-matching result to the third computing unit 53.
- the third calculating unit 53 calculates, by using the normalized useful signal power, each of the pre-paired groups in the pre-paired node according to the normalized useful signal power of each paired user of each pre-matching group in the pre-matching result. Pair the user's letter to the odds ratio.
- the first calculating unit 51 is specifically configured to calculate the transmit power if density and the downlink pilot signal received power of the downlink pilot signal from the neighboring cell user to the local cell according to the high interference indication information of the inter-cell interaction, and calculate the neighboring cell user to the local
- the path loss of the cell, the neighboring cell user is any user of all neighboring users; after obtaining the transmit power spectral density of the neighboring cell user, calculating the transmit power spectral density of the neighboring cell user and the path loss of the neighboring cell user to the local cell The difference is obtained, thereby obtaining the actual power value of the neighboring cell user to the local cell; calculating the sum of the actual power values of all neighboring cell users to the local cell, and the power of the background Gaussian white noise, thereby obtaining all neighboring cell users to the cell Thousands of power.
- the weight generation module in the scheduling apparatus provided by the embodiment of the present invention
- the calculation unit 64 and the selection unit 65 specifically includes: a first determining unit 61, a first calculating unit 62, a second determining unit 63, and a second The calculation unit 64 and the selection unit 65.
- the first determining unit 61 is configured to determine whether each pre-pairing group is a preliminary suitable matching group. When the signal-to-noise ratio of each paired user of the pre-matching group is greater than or equal to a preset signal-to-noise ratio threshold, the pre-determination is performed.
- the pairing group is a preliminary suitable pairing group, all the preliminary suitable pairing groups constitute a preliminary suitable pairing result, and the preliminary suitable pairing result is transmitted to the first calculating unit 62; the first calculating unit 62 is configured to receive the preliminary suitable pairing from the first determining unit 61.
- the second determining unit 63 is configured to receive, from the first calculating unit 62, the instantaneous rate of each paired user in each of the preliminary suitable matching groups that is initially suitable for the pairing result, and determine whether each of the preliminary suitable matching groups is the final suitable pairing result, if the preliminary matching is suitable.
- the instantaneous rate of each paired user in the group is not less than the preset instantaneous If the rate threshold or the QoS guarantee condition of the service quality is satisfied, the matching group is initially suitable for the final matching group, and all the final suitable matching groups constitute the final suitable pairing result, and the final suitable pairing result is transmitted to the second calculating unit 64;
- the second calculating unit 64 is configured to receive the final suitable pairing result from the second determining unit 63, calculate the weight of each final suitable matching group in the final suitable pairing result, or finally the sum of the proportional fairness coefficients of all the paired users in the pairing result, and
- the weights of each of the final suitable matching groups in the final matching result are transmitted to the selecting unit 65;
- the selecting unit 65 is configured to receive, from the second calculating unit 64, the weights of each of the final suitable matching groups in the final suitable pairing result, and select each final suitable
- the maximum weight of the paired group's weights, and the final suitable pairing group corresponding to the maximum weight is determined as the first paired user
- the proportional fairness coefficient of the paired users is the ratio of the instantaneous rate of the paired users to the average rate.
- the number of preliminary suitable matching groups in the preliminary suitable pairing result is less than or equal to the number of pre-matching groups in the pre-matching result; the number of final suitable matching groups in the final suitable pairing result is less than or equal to the preliminary in the preliminary suitable pairing result. The number of matching groups.
- the first determining unit 61 is further configured to use at least one pairing result in the pre-pairing result.
- the second determining unit 63 is also used if the preliminary matching result is If the instantaneous rate of the at least one paired user is less than the preset instantaneous rate threshold or does not satisfy other quality of service QoS guarantee conditions, the paired users in the preliminary matching result are not suitable for pairing, deleting or ignoring the preliminary suitable pairing result.
- the scheduling apparatus pre-pairs all candidate users on the to-be-scheduled channel, and obtains multiple pre-pairing results corresponding to the to-be-scheduled channel; according to channel quality information, channel response information of the channel to be scheduled, and The high-interference indication information of the small-interval interaction, calculates the weight of all the final suitable pairing results corresponding to the channel to be scheduled; and determines the final suitable pairing result corresponding to the maximum weight as the first paired user of the channel to be scheduled;
- the first paired users of all the channels to be scheduled perform user scheduling, thereby implementing interference information using inter-cell interaction, and improving the average throughput of the cell and the throughput of the edge users.
- FIG. 7 is a schematic diagram of a base station according to Embodiment 6 of the present invention.
- the base station is for performing the scheduling method provided by the first, second and third embodiments of the present invention.
- the present embodiment includes a network interface 71, a processor 72, and a memory 73.
- the system bus 74 is used to connect the network interface 7 1 , the processor 72 and the memory 73.
- Network interface 71 is used for communication with user terminals.
- the memory 73 may be a persistent storage such as a hard disk drive and a flash memory having a software module and a device driver.
- the software modules are capable of executing the various functional modules of the above described method of the present invention; the device drivers can be network and interface drivers.
- An application physically stored in the memory comprising instructions operable to cause the processor and the base station to perform the following:
- All the candidate users are pre-paired on the to-be-scheduled channel to obtain a pre-pairing result corresponding to the to-be-scheduled channel, where the to-be-scheduled channel is any one of all to-be-scheduled channels, and the pre-pairing result includes At least one pre-pairing group; for each of the pre-pairing results corresponding to the to-be-scheduled channel, calculating, according to the channel quality information of the channel to be scheduled, the channel response information, and the high-interference indication information of the inter-cell interaction, The signal-to-noise ratio of a pair of users; according to the signal-to-noise ratio of each paired user of each pre-matching group in the pre-pairing result, after processing each pre-matching group, all final matching groups are obtained, and all final fits are calculated.
- the weight of the pairing group is determined and the final suitable pairing group corresponding to the maximum weight is determined as the first pairing user of the channel to be scheduled; the first pairing user of all the channels to
- an application physically stored in the memory where the application is configured to enable the processor and the base station to perform pre-pairing results corresponding to a to-be-scheduled channel, and to determine channel quality information of a channel to be scheduled And the channel response information and the high-interference indication information of the inter-cell interaction, and the instruction for calculating the signal-to-noise ratio of each paired user in each pre-pairing group in the pre-pairing result is: calculating all neighbors according to the high interference indication information of the inter-cell interaction The interference power of the zone user to the local cell; calculating the normalization of each paired user of each pre-pairing group in the pre-pairing result according to the interference power of the neighboring cell, the channel quality information of the channel to be scheduled, and the channel response information of all neighboring users The useful signal power is calculated; the signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result is calculated according to the normalized useful signal power of each paired user of each pre-pairing group
- an application physically stored in the memory may be configured to enable the processor and the base station to perform calculation of all neighboring users according to the high-interference indication information of the inter-cell interaction
- the instruction of the interference power of the cell is: according to the high power interference information of the inter-cell interaction, the transmit power spectral density of the downlink pilot signal of the neighboring cell user to the local cell and the received power of the downlink pilot signal, and calculate the neighboring cell user to The path loss of the cell, the neighbor user is any user of all neighbors; after obtaining the transmit power spectral density of the neighbor user, calculate the transmit power spectral density of the neighboring cell user and the path loss of the neighboring cell user to the local cell The difference is obtained, thereby obtaining the actual power value of the neighboring cell user to the local cell; calculating the sum of the actual power values of all neighboring cell users to the local cell, and the power of the background Gaussian white noise, thereby obtaining all neighboring cell users to the cell Interference power.
- an application physically stored in the memory the application being Performing, by the processor and the base station, a signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result, processing each of the pre-paired groups, and obtaining all final suitable matching groups, and
- the instructions for calculating the weights of all the final suitable matching groups and determining the final suitable matching group corresponding to the maximum weight as the first pairing user of the channel to be scheduled are: determining whether each pre-matching group is a preliminary suitable matching group, when the pre-matching group When the signal-to-noise ratio of each paired user is greater than or equal to the preset signal-to-noise ratio threshold, it is judged that the pre-matching group is the preliminary suitable matching group, and all the preliminary suitable matching groups constitute a preliminary suitable pairing result;
- each of the preliminary suitable matching groups is the final suitable pairing result, if the initial rate suitable for each paired user in the pairing group is not less than the preset instantaneous rate threshold or meets its quality of service QoS
- the guarantee conditions are initially suitable for the matching group to be the final suitable matching group, and all the final suitable matching groups constitute the final suitable matching result; calculate the weight of each final suitable matching group in the final matching result, and finally the weight of the matching group is finally suitable.
- the final suitable pairing group is determined to be the first paired user of the channel to be scheduled.
- the proportional fairness coefficient of the paired user is the ratio of the instantaneous rate of the paired user to the average rate.
- the number of preliminary suitable matching groups in the preliminary suitable pairing result is less than or equal to the number of pre-matching groups in the pre-matching result; the number of final suitable matching groups in the final suitable pairing result is less than or equal to the preliminary in the preliminary suitable pairing result. The number of matching groups.
- an application physically stored in the memory the application further comprising instructions operable to cause the processor and the base station to: process at least one of the paired users in the pre-pairing result When the noise ratio is less than the preset signal-to-noise ratio threshold, the paired users in the pre-pairing result are not suitable for pairing, erasing or ignoring. Pre-pairing.
- an application physically stored in the memory, the application further comprising instructions operable to cause the processor and the base station to: if initially suitable for at least one of the paired users The instantaneous rate is less than the preset instantaneous rate threshold or is not satisfied For other service quality QoS guarantee conditions, it is judged that the paired users in the preliminary matching result are not suitable for pairing, and the preliminary suitable pairing is deleted or ignored.
- the base station performs pre-pairing on all the candidate users on the to-be-scheduled channel, and obtains multiple pre-pairing results corresponding to the to-be-scheduled channel.
- the high-interference indication information of the interaction calculating the weight of all the final suitable pairing results corresponding to the channel to be scheduled; and determining the final suitable pairing result corresponding to the maximum weight as the first pairing user of the channel to be scheduled;
- the first paired user of the channel to be scheduled performs user scheduling, thereby implementing the interference information using the inter-cell interaction, and improving the average throughput of the cell and the throughput of the edge user.
- RAM random access memory
- ROM read only memory
- EEPROM electrically programmable ROM
- EEPROM electrically erasable programmable ROM
- registers hard disk, removable disk, CDTMR0M, or technical fields. Any other form of storage medium known.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明涉及一种调度方法、装置和基站。该方法包括:在待调度信道上对所有候选用户进行预配对,得到与待调度信道对应的预配对结果;根据待调度信道的信道质量信息、信道响应信息以及小区间交互的高干扰指示信息,计算预配对结果中各个预配对组的每一配对用户的信干噪比;根据预配对结果中各个预配对组的每一配对用户的信干噪比,对各个预配对组进行处理后,得到所有最终适合配对组,以及计算所有最终适合配对组的权值并将最大权值对应的最终适合配对组确定为待调度信道的第一配对用户;利用所有待调度信道的第一配对用户进行用户调度。因此,本发明实现了利用小区间交互的干扰信息,提高了小区平均吞吐量和边缘用户的吞吐量。
Description
调 .度方法、 装置和基站 技术领域
本发明涉及通信领域, 尤其涉及一种调度方法、 装置和基站。 背景技术 随着无线通信技术的不断发展, 如何有效提高整网的频谱利用率的问题 变得越来越重要。 传统提高频谱利用率的技术是多输入多输出 (Multiple Input Multiple Output, MIMO )技术, 但是由于发射端和接收端的天线间距 离制约着 MIM0信道矩阵自身的相关性和空域频谱效率的提升, 另外终端本身 的尺寸和成本等因素也制约传统 MIM0技术的应用。 目前, 使用比较多的技术 是多用户多输入多输出 (Multi User-Multiple Input Multiple Output , MU-ΜΐΜΟ )技术, 该技术可以在空域维度上进一步提升频谱利用率。
现有技术中利用 MU MIM0技术的方法是在已知全局信息的情况下, 在保 证全网用户的信道质量不低于某一门限值或速率不低于某一个门限值的前提 下, 遍历所有可能的用户配对和资源分配, 并通过穷尽搜索获得全局最优解。 但是, 该方法的计算复杂度非常高, 可作为理论上限, 但无法在产品中工 程实现。 且需要基站间需要交互的信息量非常大, 同时存在时延的问题。
另外, 现有技术中利用 MU MIM0技术的方法的另一种方法是对每个小区 各自独立地采用 MU MIM0技术, 比如先用户配对后再资源分配、 或者先资源 分配后再用户配对。
但是, 由于该方法是.对每个小区各自独立地采用 MU MIM0技术而不考虑 小区间协作。 若要考虑小区间的协作, 并能有效地利用小区间的交互的干扰 信息, 利用现有技术是做不到的。
发明内容
本发明提^^了一种调度方法、 装置和基站, 解决了现有技术中对每个小 区各自独立地采用 MU MIM0技术而小区间缺乏协作的问题, 利用小区间交互 的千扰信息, 提高了小区平均吞吐量和边缘用户的吞吐量。
在第一方面, 本发明实施例提供了一种调度方法, 所述方法包括: 在待 调度信道上对所有候选用户进行预配对, 得到与所述待调度信道对应的预配 对结果, 所述待调度信道为所有待调度信道中的任一信道, 所述预配对结果 包括至少一个预配对组; 针对所述待调度信道对应的所述预配对结杲, 根据 所述待调度信道的信道质量信息、 信道响应信息以及小区间交互的高千扰指 示信息, 计算所述预配对结果中各个预配对组的每一配对用户的信干噪比; 根据所述预配对结果中各个预配对组的每一配对用户的信千噪比, 对所述各 个预配对组进行处理后, 得到所有最终适合配对组, 以及计算所述所有最终 适合配对组的权值并将最大权值对应的所述最终适合配对组确定为所述待调 度信道的第一配对用户; 利用所有待调度信道的所述第一配对用户进行用户 调度。
在第一方面的第一种可能的实现方式中, 所述针对所述待调度信道对应 的所述预配对结果, 根据所述待调度信道的信道质量信息、 信道响应信息以 及小区间交互的高千扰指示信息, 计算所述预配对结果中各个预配对组的每 一配对用户的信干噪比, 具体包括: 根据所述小区间交互的高千扰指示信息 计算所有邻区用户到本小区的千扰功率; 根据所述所有邻区用户对本小区的 千扰功率、 所述待调度信道的信道质量信息和信道响应信息计算所述预配对 结果中各个预配对组的每一配对用户的归一化有用信号功率; 根据所述预配 对结果中各个预配对组的每一配对用户的归一化有用信号功率, 计算所述预 配对结果中各个预配对组的每一配对用户的信干噪比。
结合第一方面或第一方面的第一种可能的实现方式, 在第二种可能的实
现方式中, 所述根据所述预配对结果中各个预配对组的每一配对用户的信千 噪比, 对所述各个预配对组进行处理后 , 得到所有最终适合配对组 , 以及计 算所述所有最终适合配对组的权值并将最大权值对应的所述最终适合配对组 确定为所述待调度信道的第一配对用户, 具体包括: 判断所述各个预配对组 是否为初步适合配对组, 当所述预配对组的每一配对用户的信千噪比都大于 或等于预设的信千噪比阈值时, 则判断所述预配对组为所述初步适合配对组, 所有初步适合配对组构成初步适合配对结果; 计算所述初步适合配对结果的 各个初步适合配对组中每一配对用户的瞬时速率; 判断所述各个初步适合配 对组是否为最终适合配对结果, 如果所述初步适合配对组中每一配对用户的 瞬时速率都不小于预设的瞬时速率门限值或满足其服务质量 QoS保障条件, 则所述初步适合配对组为所述最终适合配对组, 所有最终适合配对组构成最 终适合配对结果; 计算所述最终适合配对结果中各个最终适合配对组的权值 , 所述最终适合配对组的权值为所述最终适合配对组中所有配对用户的瞬时速 率之和, 或者所述最终适合配对结果中所有配对用户的比例公平系数之和; 选取所述各个最终适合配对组的权值中的最大权值, 并将最大权值对应的所 述最终适合配对组确定为所述待调度信道的第一配对用户。
在第二方面, 本发明实施例提供了一种调度装置, 所述装置包括: 预配 对模块, 用于在待调度信道上对所有候选用户进行预配对, 得到与所述待调 度信道对应的预配对结果, 所述 调庹 -信道为所有待调度信道中的任一信道, 所述预配对结果包括至少一个预配对组, 以及将所述待调度信道对应的预配 对结果传输给信千噪比生成模块; 信千噪比生成模块, 用于从所述预配对模 块接收所述待调度信道对应的预配对结果, 针对所述待调度信道对应的所述 预配对结果, 根据所述待调度信道的信道质量信息、 信道响应信息以及小区 间交互的高千扰指示信息, 计算所述预配对结果中各个预配对组的每一配对 用户的信干噪比, 以及将所述预配对结果中各个预配对组的每一配对用户的 信干噪比传输给权值生成模块; 权值生成模块, 用于从所述信干噪比生成模
块接收所述预配对结果中各个预配对组的每一配对用户的信千噪比, 根据所 述预配对结果中各个预配对组的每一配对用户的信千噪比, 对所述各个预配 对组进行处理后, 得到所有最终适合配对组, 以及计算所述所有最终适合配 对组的权值并将最大权值对应的所述最终适合配对组确定为所述待调度信道 的第一配对用户; 调度模块, 用于从所述权值生成模块接收所述待调度信道 的第一配对用户, 利用所有待调度信道的所述第一配对用户进行用户调度。
在第二方面的第一种可能的实现方式中, 所述信千噪比生成模块包括: 第一计算单元用于根据所述小区间交互的高干扰指示信息计算所有邻区用户 到本小区的千扰功率, 以及将所述所有邻区用户到本小区的千扰功率传输给 第二计算单元; 第二计算单元用于接收所述第一计算单元发送的所述所有邻 区用户到本小区的千扰功率, 根据所述所有邻区用户对本小区的干扰功率、 所述待调度信道的信道质量信息和信道响应信息计算所述预配对结果中各个 预配对组的每一配对用户的归一化有用信号功率, 以及将所述预配对结果中 各个预配对组的每一配对用户的归一化有用信号功率传输给第三计算单元; 第三计算单元用于接收所述第二计算单元发送的所述预配对结果中各个预配 对组的每一配对用户的归一化有用信号功率, 根据所述预配对结杲中各个预 配对组的每一配对用户的归一化有用信号功率, 计算所述预配对结果中各个 预配对组的每一配对用户的信干噪比。
结合第二方面或第二方面的第一种可能的实现方式, 在第二种可能的实 现方式中, 所述权值生成模块包括: 第一判断单元用于判断所述各个预配对 组是否为初步适合配对组, 当所述预配对组的每一配对用户的信千噪比都大 于或等于预设的信千噪比阈值时, 则判断所述预配对组为所述初步适合配对 组, 所有初步适合配对组构成初步适合配对结果, 以及将所述初步适合配对 结果传输给第一计算单元; 第一计算单元用于从所述第一判断单元接收所述 初步适合配对结果, 计算所述初步适合配对结果的各个初步适合配对组中每 一配对用户的瞬时速率, 以及将所述初步适合配对结果的各个初步适合配对
组中每一配对用户的瞬时速率传输给第二判断单元; 第二判断单元用于从所 述第一计算单元接收所述初步适合配对结果的各个初步适合配对组中每一配 对用户的瞬时速率, 判断所述各个初步适合配对组是否为最终适合配对结果, 如果所述初步适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时速 率门限值或满足其服务质量 QoS保障条件, 则所述初步适合配对组为所述最 终适合配对组, 所有最终适合配对组构成最终适合配对结果, 以及将所述最 终适合配对结果传输给第二计算单元; 第二计算单元用于从所述第二判断单 元接收所述最终适合配对结果, 计算所述最终适合配对结果中各个最终适合 对用户的瞬时速率之和, 或者所述最终适合配对结果中所有配对用户的比例 公平系数之和, 以及将所述最终适合配对结果中各个最终适合配对组的权值 传输给选取单元; 选取单元用于从所述第二计算单元接收所述最终适合配对 结果中各个最终适合配对组的权值, 选取所述各个最终适合配对组的权值中 的最大权值, 并将最大权值对应的所述最终适合配对组确定为所述待调度信 道的第一配对用户。
在第三方面, 本发明实施例提供了一种基站, 所述基站包括: 网络接口; 处理器; 存储器; 物理存储在所述存储器中的应用程序, 所述应用程序包括 可用于使所述处理器和所述***执行以下过程的指令: 在待调度信道上对所 有候选用户进行预配对, 得到与所述待调度信道对应的预配对结果, 所述待 调度信道为所有待调度信道中的任一信道, 所述预配对结果包括至少一个预 配对组; 针对所述待调度信道对应的所述预配对结果, 根椐所述待调度信道 的信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计算所 述预配对结果中各个预配对组的每一配对用户的信千噪比; 根据所述预配对 结果中各个预配对组的每一配对用户的信干噪比, 对所述各个预配对组进行 处理后, 得到所有最终适合配对组, 以及计算所述所有最终适合配对组的权 值并将最大权值对应的所述最终适合配对组确定为所述待调度信道的第一配
对用户; 利用所有待调度.信道的所述第一配对用户进行用户调度。 在第三方面的第一种可能的实现方式中, 所述应用程序可用于使所述处 理器和所述***执行针对所述待调度信道对应的所述预配对结果, 根据所述 待调度信道的信道质量信息、 信道响应信息以及小区间交互的高干扰指示信 息, 计算所述预配对结果中各个预配对组的每一配对用户的信千噪比的指令 为: 根据所述小区间交互的高千扰指示信息计算所有邻区用户到本小区的干 扰功率; 根据所述所有邻区用户对本小区的千扰功率、 所述待调度信道的信 道质量信息和信道响应信息计算所述预配对结果中各个预配对组的每一配对 用户的归一化有用信号功率; 根据所述预配对结杲中各个预配对组的每一配 对用户的归一化有用信号功率, 计算所述预配对结果中各个预配对组的每一 配对用户的信干噪比。
结合第三方面后第三方面的第一种可能的实现方式, 在第二种可能的实 现方式中, 所述根据所述预配对结果中各个预配对组的每一配对用户的信干 噪比, 对所述各个预配对组进行处理后, 得到所有最终适合配对组, 以及计 算所述所有最终适合配对组的权值并将最大权值对应的所述最终适合配对组 确定为所述待调度信道的第一配对用户的指令为: 判断所述各个预配对组是 否为初步适合配对组, 当所述预配对组的每一配对用户的信千噪比都大于或 等于预设的信干噪比阈值时, 则判断所述预配对组为所述初步适合配对组, 所有初步适合配对组构成初步适合配对结果; 计算所述初步适合配对结果的 对组是否为最终适合配对结杲, 如杲所述初步适合配对组中每一配对用户的 瞬时速率都不小于预设的瞬时速率 Π限值或满足其服务质量 QoS保障条件, 则所述初步适合配对组为所述最终适合配对组, 所有最终适合配对组构成最 终适合配对结果; 计算所述最终适合配对结果中各个最终适合配对组的权值, 所述最终适合配对组的权值为所述最终适合配对组中所有配对用户的瞬时速 率之和, 或者所述最终适合配对结果中所有配对用户的比例公平系数之和;
选取所述各个最终适合配对组的权值中的最大权值, 并将最大权值对应的所 述最终适合配对组确定为所述待调度信道的第一配对用户。
通过应用本发明公开的调度方法、 装置和基站, 在待调度信道上对所有 候选用户进行预配对, 得到与待调度信道对应的预配对结果; 针对待调度信 道对应的预配对结果, 根据待调度信道的信道质量信息、 信道响应信息以及 小区间交互的高干扰指示信息, 计算预配对结果中各个预配对组的每一配对 用户的信千噪比; 根据预配对结果中各个预配对组的每一配对用户的信千噪 比, 对各个预配对组进行处理后, 得到预配对结果的所有最终适合配对组, 以及计算所有最终适合配对组的权值并将最大权值对应的最终适合配对组确 定为待调度信道的第一配对用户; 利用所有待调度信道的第一配对用户进行 用户调度, 从而实现了利用小区间交互的干扰信息, 提高了小区平均吞吐量 和边缘用户的吞吐量。
图 1为本发明实施例一提供的调度方法的流程图;
图 2为本发明实施例二提供的调度方法的流程图;
图 3为本发明实施例三提供的调度方法的流程图;
具体实施方式
为使本发明实施例的目的、 技术方案和优点更加清楚, 下面将结合本 发明实施例中的附图, 对本发明实施例中的技术方案进行清楚、 完整地描 述, 显然, 所描述的实施例是本发明一部分实施例, 而不是全部的实施例。
基于本发明中的实施例, 本领域普通技术人员在没有作出创造性劳动前提 下所获得的所有其他实施例, 都属于本发明保护的范围。
本发明实施例通过在待调度信道上对所有候选用户进行 '预配对, 得到与 待调度信道对应的预配对结果; 针对待调度信道对应的预配对结果, 根据待 调度信道的信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计算预配对结果中各个预配对组的每一配对用户的信干噪比; 根据预配对结 果中各个预配对组的每一配对用户的信干噪比, 对各个预配对组进行处理后, 得到预配对结果的所有最终适合配对组, 以及计算所有最终适合配对组的权 值并将最大权值对应的最终适合配对组确定为待调度信道的第一配对用户; 利用所有待调度信道的第一配对用户进行用户调度, 从而实现了利用小区间 交互的干扰信息, 提高了小区平均吞吐量和边缘用户的吞吐量。
图 1 为本发明实施例一提供的调度方法的流程图。 如图所示, 本发明实 施例具体包括以下步骤:
步骤 1 01,在待调度信道上对所有候选用户进 _行预配对,得到与所述待调 度信道对应的预配对结果。 其中, 待调度信道为所有待调度信道中的任一信 道, 预配对结杲包括至少一个预配对组。
具体地, 在第一数量个待调度信道的任一待调度信道上对第二数量个候 选用户均进行第三数量预配对, 从而得到与每个待调度信道相对应的预配对 结果, 该预配对结果包括多个预配对组; 其中所述第三数量为两个或以上, 且第三数量不大于第二数量。
当待调度的信道的个数为第一数量个, 比如, 6个待调度的信道, 分别为 信道 1、 信道 2、 信道 3、 信道 4、 信道 5和信道 6。 候选用户的个数为第二数 量个, 比如, 8个候选用户, 分别为用户 1、 用户 2、 用户 3、 用户 4、 用户 5、 用户 6、 用户 7和用户 8。 第三数量配对为 2个用户进行配对, 也可以为 2个 以上的用户进行配对。 其中, 第三数量不大于第二数量。 当第三数量配对为 2 个用户进行配对时, 则 2个用户占用相同的信道; 当第三数量配对为 2个以
上的用户进行配对时, 则 2 个以上的用户占用相同的信道。 该信道可以是长 期演进 ( Long Term Evolution , LTE ) 或高级长期演进 ( Long Term Evolution-Advanced, LTE— A )中的时频资源组成的信道, 即资源块 ( Resouce Block , RB ) ; 也可以是通用移动通信*** ( Universal Mobile Telecommunications System, UMTS) 中的码道; 或者其他形式的信道。
在每个待调度的信道上分别对 8个候选用户进行配对, 比如允许 2个用 户进行配对, 则在每个待调度的信道上对 8个候选用户进行两两配对。
以信道 1为例, 8个候选用户中允许 1个用户进行配对的配对组为: 用户 1和用户 2、 用户 1和用户 3、 用户 1和用户 4、 用户 1和用户 5、 用户 1和用 户 6、 用户 ]和用户 7、 用户 1和用户 8 , 用户 2和用户 3、 用户 2和用户 4 , 用户 2和用户 5、 用户 2和用户 6、 用户 2和用户 7、 用户 2和用户 8、 用户 3 和用户 4、 用户 3和用户 5、 用户 3和用户 6、 用户 3和用户 7、 用户 3和用 户 8、 用户 4和用户 5、 用户 4和用户 6、 用户 4和用户 7、 用户 4和用户 8、 用户 5和用户 6、 用户 5和用户 7、 用户 5和用户 8、 用户 6和用户 7、 用户 6 和用户 8、 用户 7和用户 8, 共 28种配对组。 其中, 每一用户保.证和其他用 户只能配对一次, 不能重复配对。
步骤 102,针对待调度信道对应的预配对结果,根据待调庹-信道的信道质 量信息、 用户终端 (User Equipment, ϋΕ )上 ·ΐ艮的信道响应信息和小区间交 互的高干扰指示 ( High Interference Indication, H 11 )信息计算该待调度 信道的预配对结果中各个预配对组的每一配对用户的信千噪比 ( Signal to Interference plus Noise Ratio, SINR ) 。
可选地, 如图 2所示, 上述步骤 102具体包括以下步骤:
步骤 201,根椐小区间交互的高千扰指示信息计算所有邻区用户到本小区 的千扰功率。
具体地,根据 ΗΠ信息中邻区调度的边缘用户对本小区的干扰功率 ^的 计算过程如下:
( 1 )假设邻区用户 】 到本小区的下行导频信号接收功率 ( Reference Signal Received Power, RSRP )为 RSRPDL , 下行导频信号的发射功率谱密度 ( Power Spectrum Densi ty, PSD ) 为 s, 这时邻区用户 1 到本小区的下 行大尺度衰落 的计算公式如公式(1 1)所示。 其中, 大尺度衰落也称为路 径损耗 (Pathloss, PL) 。
PLn PSDVV~RSRR (1-1)
( 2 ) 令上行大尺度衰落 PLUU和下行大尺度衰落 相等 , 即 PLUL^-PLDI^ 这时, 邻区用户 1到本小区的实际功率值, 如公式(1 2)所示。
其中, 为用户 1 的发射功率谱密度, 该值可由用户 1 的服务小区 获得。 为背景高斯白噪声的功率。
另外, 当存在多个邻区的多个用户时, 计算所有邻区用户的路径损耗, 和到本小区的实际功率值, 与邻区用户 1的计算公式相同, 详见公式(1 1 ) 和公式(1-2)所示。 这时多个邻区的多个用户中所有用户对本小区的千扰功 率 的计算公式如 ( 2-2 )所示。
其中, 为部区千扰用户的数目, ftS ;为用户 , PL 邻区用户 i到本小区的下行大尺度衰落即路径损耗, σ«为背景高斯白噪声的 功率。
步骤 202, 根据所有邻区用户对本小区的千扰功率 、 待调度信道的信 道质量信息和信道响应信息计算预配对结果中各个预配对组的每一配对用户
的归一化有用信号功率。 如公式( 3 1 )和公式( 3 2 ) 所示 ( κ 「 Λ ,■。-'「+ + P h,m \ If \' -^ σ2 I \ h' 公式( 3 1 )
其中, 为基站端天线的数量; 为允许进行配对的用户数量, 该数量 为两个或以上 当为两个时, 则允许两个用户进行配对; 当为两个以上, 则 允许两个以上用户进行配对。 、 …、 ^分别为配对用户 1、 …、 配对用 户 到基站端的信道响应; 分别为配对用户 1、 ., 、配对用户 N— 的发射功率; 为 HI I信息中邻区调度的边缘用户对本小区的干扰功率; 1 为 Λ^ χ Λ^的单位矩阵, m指的是, I"道中的第 m信道。
计算预配对结果中各个预配对组的每一配对用户的信干噪比。 如 公式 ( 4 1 )和公式( 4 2 )所示。
(X
SINR" 公式(4 1 )
1― Cx-
N
SINR N 公式 ( 4—2 )
1 --- Nu
其中, af 、 .。 .、 c4u为第 m信道上每一个配对用户的归一化有用信号功 率。 1 为第 m信道上每一个配对用户的归一化有用信号功率相对应的噪声 功率, SINR"1、 ,,。、 S1NR1为第 m信道上每一个配对用户的信干噪比。
另夕 ■if SINR的过程可以是从 信道提出一个子载波进行, 也可 以提取若千个子载波平均后进行
步驟 1 G 3, 根据预 配对用户的信千噪比, 对各个预配对组进行处理后 ¾ 以及计算所有最终
适合配对组的权值并将最大权值对应的所述最终适合配对组确定为所述待调 度信道的第一配对用户。 其中, 最终适合配对组的数量小于或等于初步适合 配对组的数量, 初步适合配对组的数量小于或等于预配对组的数量。
可选地, , 如图 3所示, 上述步骤 1 03具体包括以下步骤:
步骤 301,判断预配对结果中各个预配对组是否为初步适合配对组, 当预 配对组中每一配对用户的信千噪比 、。. 、 t (^都大于或等于预设的信 千噪比阈值 m^^ 时, 如公式(5 ) 所示, 可认为该预配对组为初步适合 配对组, 所有初步适合配对组构成初步适合配对结果。
SINRr1 > SINRi ESH0LD 公式( 5 ) 其中, 中的 k等于 1、 2、 .,.、 或^。
但是 , 当预配对组中每一配对用户的信干噪比 SINR^、…、 SINR 中至少 一个配对用户的信干噪比小于预设的信千噪比阈值^&^^ 时,則该预配对 组中的配对用户不适合配对, 删除或忽略该预配对组。
上述预配对结果经过步骤 301 处理后的得到的所有初步适合配对组构成 了初步适合配对结果。 初步适合配对结果中的初步适合配对组的数量小于或 等于预配对结杲中的预配对组的数量。
步骤 302,计算初步适合配对结果中的各个初步适合配对组中每一配对用 户的瞬时速率。
具体地, 对初步适合配对的用户进行链路自适应和自适应调制编码 ( Adapt ive Modu l a t i on Cod i ng , AMC ) , 并人言千'1桑比 口编码方式的 换..表 中, 查询到每一配对用户的编码方式。 根据每一配对用户的编码方式和待调 度的信道的容量信息计算每一配对用户的瞬时速率。 另外, 由于各个通信设 备商的不同, 故各个通信设备商提供的信千噪比和编码方式的转换表也不同。
步驟 303, 判断各个初步适合配对组是否为最终适合配对结果, 如果上述 计算出的初步适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时速 率门限值或满足其业务质量 QoS保障条件, 則该初步适合配对组为最终适合
配对组, 所有最终适合配对组构成最终适合配对结果。
具体地, 如/ ^ (0、 …、 r (t)为计算出的初步适合配对组中每一配对用户 的瞬时速率。 如果这 Nu个用户配对后的计算出的瞬时速率都不低于某一个速 率门限值或都满足其他的业务质量 ( Qua l i ty of Serv i ce , QoS )保障条件, 則可认为这些用户是适合配对用户, 同时该初步适合配对组为最终适合配对 组。 如公式 ( 6 ) 所示。
rk (S)≥ r(S)WRESHQLD 公式(6 ) 其中, k等于 1、 2、 , .。, 或 。
但是, 如果初步适合配对组中每一配对用户的瞬时速率 (0、 …、 rNa (t) 中至少一个配对用户的瞬时速率小于预设的瞬时速率门限值或不满足其他的 业务质量 QoS保障条件, 则该初步适合配对组中的配对用户不适合配对, 删 除或忽略所述初步适合配对组。
此时, 预配对结果经过步骤 302 处理后的得到的所有初步适合配对组构 成了最终适合配对结果。 最终适合配对结果中的最终适合配对组的数量小于 或等于初步适合配对结果中的初步适合配对组的数量。
步骤 304, 计算最终适合配对结果中各个最终适合配对组的权值。 其中, 最终适合配对组的权值为最终适合配对组中所有配对用户的瞬时速率之和, 或者最终适合配对结果中所有配对用户的比例公平系数之和。 另外, 配对用 户的比例公平系数为配对用户的瞬时速率和平均速率的比值。
具体地, 计算权值除了利用每一个配对用户的瞬时速率进行计算外, 也 可以用每一个配对用户的比例公平系数进行计算。
其中, 最终适合配对组中所有配对用户的比例公平系数之和的计算过程 如下:
第一, 根据最终适合配对组中每一个配对用户的瞬时速率计算每一个配 对用户的比例公平系数。 其中, 每一个配对用户的比例公平系数是该配对用 户的瞬时速率和平均速率的比值。 配对用户的平均速率是该配对用户在一定
的时间内所有瞬时速率的平均值。
第二, 计算最终适合配对组中所有配对用户的比例公平系数之和, 该比 例公平系数.之和为待调度信道上的最终适合配对组的权值。
以用户 1和用户 2配对为例, 若计算用户 1和用户 2的瞬时速率之和, 如公式 ( 7 )所示, 而计算用户 1和用户 2的比例系数之和, 如公式(8 ) 所 示。 其中, 用户 1的瞬时速率为 用户
用户 2配对后的权值为 A(;2)。
= i ( )十 /2 (J) 公式(7 )
― (t) i i2 jt)
公式( 8 ) i?; (t) R2 { ) 其中, l (t) , 为用户 i和用户 2的平均速率。 ^ 为用户 1
^ R, (t) R2 (t) 和用户 2的比例系数。
以此类推, 该信道的其他最终适合配对组的权值的计算方法与此类似, 甚至其他信道的最终适合配对组的权值的计算方法也与此类似, 在这里不再 详细说明。 其中, 初步适合配对组的数量小于或等于预配对组的数量; 最终 适合配对组的数量小于或等于初步适合配对组的数量。 另外, 上述计算权值 也可以通过香农公式进行计算, 香农公式是现有技术, 在这里不再详细说明 值得指出的是, 上述计算出的权值可以是吞吐量, 也可以是比例公平 (Proportional Fair, PF)值, 或者其他形式的 PF值。
式( 1G) 所示。
公式( 9 ) 公式( 10 ) 其中, 表示所有最终 i 寸组的权值中的最大权值, po表示第 n个
最终适合配对组的每一配对用户的瞬时速率之和, 表示第 n个最终适合配对 组的每一配对用户的比例系数之和。
如信道 1选取/¾(25)等于 1. 01为最大权值, 则将用户 2和用户 5作为第
—配对用户;如信道 2选取 A4(34)等于 0, 96为最大权值,则将用户 3和用户 4 作为第一配对用户; 如信道 3选取 A5(35)等于 0. 93为最大权值, 则将用户 3 和用户 5作为第一配对用户; 如信道 4选取 (46)等于 1. 17为最大权值, 则 将用户 4和用户 6作为第一配对用户; 如信道 5选取 A6(36)等于 1. 14为最大 权值,則将用户 3和用户 6作为第一配对用户; 如信道 6选取 A3(28)等于 0. 99 为最大权值, 则将用户 2和用户 8作为第一配对用户。
另外,确定其他待调度信道的第一配对用户的过程与步骤 201至步骤 203 的过程相同, 在这里不再详细说明。
步骤 104, 利用所有待调度信道的第一配对用户进—行用户调度。
具体地, 当待调度的信道的个数为第一数量个, 则得到第一数量个第一 配对用户。
首先, 将第一数量个第一配对用户进行分组, 并从多个第一配对用户组 中选取参与配对的用户的数量最大的第一配对用户组作为第二配对用户组, 并根据第二配对用户组的数量得到第三配对用户组和第三用户组的第三配对 用户。 其中, 第一数量个信道, 得到第一数量个第一配对用户, 将所有第一 配对用户分组, 每一组保证分配的用户不是重复的。 选出一组内的第一配对 用户最多的为第二配对用户组。 当有两个或以上的第二配对用户组时, 分别 计算每一个第二配对用户组内所有第二配对用户的权值之和, 选取权值之和 最大的第二配对用户组为第三配对用户组, 同时第三配对用户组的配对用户 为第三配对用户。
然后, 将第三配对用户组的第三配对用户与第一数量个待调度的信道的 第一配对用户进行比较; 若第三配对用户和第一配对用户相同, 则选取第一 配对用户与第一配对用户对应的待调度的信道进行数据传输; 若第三配对用
户和第一配对用户不同, 则选取第三配对用户与第一配对用户对应的待调度 的信道进行数据传输。 其中, 将待调度的信道的第一配对用户和第三配对用 户组的每一个第三配对用户分别作比较, 若第一配对用户与第三配对用户组 中的第三配对用户相同时, 则选择第一配对用户与第一配对用户对应的待调 度的信道进行数据传输; 若第一配对用户与第三配对用户组中的所有第三配 对用户皆不相同时, 则在第一配对用户对应的待调度的信道上计算第三配对 用户组中的所有第三配对用户的权值, 并选取最大权值的第三配对用户与第 —配对用户对应的待调度的信道进行数据传输。
以 6个待调度的信道、 8个候选用户和允许 2个用户进行配对为例,如表 1 所示。 首先, 确定了信道 1 的第一配对用户为 _ (25), 并且 ¾(25)的权值等 于 1„ 01为最大权值; 信道 2的第一配对用户为 A4(34), 并且 ^(34)的权值等于 0.96; 信道 3的第一配对用户为 As(35), 并且 A5(35)的权值等于 0.93; 信道 4 的第一配对用户为 ¾(46), 并且^ (46)的权值等于 1。 17; 信道 5的第一配对用 户为 Αδ(36), 并且 Αδ(36)的权值等于 1。 14; 信道 6的第一配对用户为^ ), 并且 ¾(28) 的权值等于 0.99。 然后 , 确定 了 第三配对用 户 组 {i¾(35), ;¾(46), ¾(28)}, 其中第三配对用户为 Α5(35)、 0(46) , ¾(28)。
将 6 个信道的第一配对用户和第三配对用户组的每一个第三配对用户分 别作比较, 比如: 信道 1的第一配对用户为; ¾(25), 第三配对用户为 ¾(35)、 ¾(46)、 /¾(28), 将 ¾(25)分别和/ ¾(35)、 ¾(46)、 /¾(28)作比较, 比较结果为信 道. 1 的第一配对用户和第三配对用户组内的所有第三配对用户皆不相同; 在 信道 1 上计算 Α5(35)、 ½(46)、 Α3(28)的权值, 选取计算出的权.值为最大的第 三配对用户, 如 ¾(35)的权值为 0。 97。 则选择第三配对用户 Α5(35)即用户 3和 用户 5配对后, 利用信道 1进-行数据传输;
再比如:信道 3的第一配对用户为 As(35),第三配对用户为 Αί(35)、 ¾0(46)、 βι3(28) , 将 ¾(35)分别和/¾(35)、 i¾。(46)、 i¾(28)作比较, 比较结果为信道 3的
厂和第三配对用户组内的其中一个第三配对用户相同, 则选 ^
Pi. (35)即用户 3和用户 5配对后, 利用信道 3进行数据传输 信道 ^ -相同, 在这里不再详细说明。
表 1
3
5
4
6
6
3
第一, 将第一数量个待调度的信道的第一配对用户进行分组, 得到多个 配对用户组;
具体地, 以 6个待调度的信道、 8个候选用户和允许 2个用户进行配对为 假如信道 1选取 Α。(25)为最大权值, 则将用户 2和用户 5作为第一配对用 信道 2选取 (34)为最大权值, 则将用户 3和用户 4作为第一配对用户; 信道 3选取 A5(35)为最大权值, 则将用户 3和用户 5作为第一配对用户; 信道 4选 ί (46)为最大权值, 则将用户 4和用户 6作为第一配对用户; 信道 5选 最大权值, 则将用户 3和用户 6作为第一配对用户; 信道 6选取 ?η(28 ¾户 和用户 8作为第一配对用户„
~述确定的第 · ί]户进行分组, 所有的第 ^组如下: 、厶"
{ ¾(25), (34)}, 。 (25), ¾(46)}, {/¾(25), /¾(36)}, {. (34), , {— (35), /¾(46)}, { ¾(35),— ¾(28)}, { ¾(46), (2 }' {A6(36),— ¾(28:小 {— (35), /¾(46), (28)} 第二, 计算第一配对用户组内第一配对用户的数量。
具体地, 分别计算所有的第一配对用户组中第一配对用户的数量。 比如:
{ ¾(35)}为只有一个配对用户的配对用户组, {2。(46), ¾(2 }为有两个配对用 户的配对用户组, {. (35), /¾(46), /¾(28)}为有三个配对用户的配对用户组。
第三, 从第一配对用户组内第一配对用户的数量中选取最大值; 则将最 大值对应的所述第一配对用户组作为第二配对用户组, 同时将最大值对应的 第一配对用户作为第二配对用户。
具体地, 5(3 , n2o(46), ρ]3( }内第一配对用户的数量最大, 则将
{— (35), /¾(46), ¾(28)}作为第二配对用户组, 同时将 (35)、 /¾(46)、 _ (28)作 为第二配对用户。
第四, 当第二配对用户组只有一个时, 则将第二配对用户组作为第三配 对用户组, 同时将第二配对用户组内的第二配对用户作为第三配对用户; 当 第二配对用户组为两个或以上时, 则计算第二配对用户组内所有第二配对用 户的权值和, 将权值和最大的第二配对用户组作为第三配对用户组, 同时将 第二配对用户组内的第二配对用户作为第三配对用户。
具体地, {;5(35), i¾0(46), ¾(28)}为第二配对用户组, 即有三个配对用户的 配对用户组, 而且包括的第一配对用户的数量最大, 同时包括三个配对用户 的配对用户组只有一个, 则将 5(35), p 46), /¾(28)}作为第三配对用户组, 同 时将/ ¾(35)、 p 46) , A3(28)作为第三配对用户。 另外, 若包括三个配对用户 的第二配对用户组不只是一个, 有两个或以上, 则计算每一第二配对用户组 内的第二配对用户的权值, 具体计算权值的过程如步骤 202 中计算权值的过 程相同, 在这里不再详细说明。 最终选取权值最大的第二配对用户组作为第
三配对用户组, 同时将第二配对用户组内的第二配对用户作为第三配对用户。 因此, 本发明实施例提供的调度方法, 在待调度信道上对所有候选用户 进行预配对, 得到与待调度信道对应的预配对结果; 针对待调度信道对应的 预配对结果, 根据待调度信道的信道质量信息、 信道响应信息以及小区间交 互的高千扰指示信息, 计算预配对结果中各个预配对组的每一配对用户的信 干噪比; 根据预配对结果中各个预配对组的每一配对用户的信千噪比, 对各 个预配对组进行处理后, 得到预配对结果的所有最终适合配对组, 以及计算 所有最终适合配对组的权值并将最大权值对应的最终适合配对组确定为待调 度信道的第一配对用户; 利用所有待调度信道的第一配对用户进行用户调度, 从而实现了利用小区间交互的千扰信息, 提高了小区平均吞吐量和边缘用户 的吞吐量。
图 4 为本发明实施例四提供的调度装置的示意图, 该调度装置用于执行 本发明实施例一、 二和三提供的调度方法。 如图所示, 本发明实施例提供的 调度装置具体包括: 预配对模块 41、 信千噪比生成模块 42、 权值生成模块 43 和调度模块 44。
预配对模块 41用于在待调度信道上对所有候选用户进行预配对,得到与 待调度 _信道对应的预配对结果, 待调度信道为所有待调度信道中的任一信道, 预配对结果包括至少一个预配对组, 以及将待调度信道对应的预配对结果传 输给信干噪比生成模块 42 ; 信干噪比生成模块 42于从預配对模块 41接收待 调度信道对应的预配对结果, 针对待调度信道对应的预配对结果, 根据待调 度信道的信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计算预配对结果中各个预配对组的每一配对用户的信千噪比, 以及将预配对 结果中各个预配对组的每一配对用户的信千噪比传输给权值生成模块 43 ; 权 值生成模块 43从信千噪比生成模块 42接收预配对结果中各个预配对组的每 一配对用户的信干噪比, 根据预配对结果中各个预配对组的每一配对用户的 信干噪比, 对各个预配对组进行处理后 , 得到所有最终适合配对组, 以及计
算所有最终适合配对组的权值并将最大权值对应的最终适合配对组确定为待 调度信道的第一配对用户, 及将所有待调度信道的第一配对用户传输给调度 模块 44; 调度模块 44用于从权值生成模块 43接收所有待调度信道的第一配 对用户, 利用所有待调度信道的第一配对用户进行用户调度。
可选地, 如图 5所示, 本发明实施例提供的调度装置中的信干噪比生成 模块 42具体包括: 第一计算单元 51、 第二计算单元 52和第三计算单元 53。
第一计算单元 51用于根据小区间交互的高千扰指示信息计算所有邻区用 户到本小区的干扰功率, 以及将所有邻区用户到本小区的千扰功率传输给第 二计算单元 52 ; 第二计算单元 52用于接收第一计算单元 51发送的所有邻区 用户到本小区的千扰功率, 根据所有邻区用户对本小区的千扰功率、 待调度 信道的信道质量信息和信道响应信息计算预配对结果中各个预配对组的每一 配对用户的归一化有用信号功率, 以及将预配对结果中各个预配对组的每一 配对用户的归一化有用信号功率传输给第三计算单元 53;第三计算单元 53用 归一化有用信号功率, 根据预配对结果中各个预配对组的每一配对用户的归 一化有用信号功率, 计算预配对结杲中各个预配对组的每- 配对用户的信千 噪比。
其中, 第一计算单元 51具体用于根据小区间交互的高干扰指示信息中邻 区用户到本小区的下行导频信号的发射功率 if密度和下行导频信号接收功 率, 计算邻区用户到本小区的路径损耗, 邻区用户是所有邻区用户中的任一 用户; 获取邻区用户的发射功率谱密度后, 计算邻区用户的发射功率谱密度 和邻区用户到本小区的路径损耗的差值, 从而得到邻区用户到本小区的实际 功率值; 计算所有邻区用户到本小区的实际功率值之和, 以及根据背景高斯 白噪声的功率, 从而得到的所有邻区用户对本小区的千扰功率。
可选地, 如图 6所示, 本发明实施例提供的调度装置中的权值生成模块
43具体包括: 第一判断单元 61、 第一计算单元 62、 第二判断单元 63、 第二
计算单元 64和选取单元 65。
第一判断单元 61用于判断各个预配对组是否为初步适合配对组, 当预配 对组的每一配对用户的信千噪比都大于或等于预设的信千噪比阈值时, 则判 断预配对组为初步适合配对组, 所有初步适合配对组构成初步适合配对结果, 以及将初步适合配对结果传输给第一计算单元 62;第一计算单元 62用于从第 一判断单元 61接收初步适合配对结果, 计算初步适合配对结果的各个初步适 合配对组中每一配对用户的瞬时速率, 以及将初步适合配对结果的各个初步 适合配对组中每一配对用户的瞬时速率传输给第二判断单元 63; 第二判断单 元 63用于从第一计算单元 62接收初步适合配对结果的各个初步适合配对组 中每一配对用户的瞬时速率, 判断各个初步适合配对组是否为最终适合配对 结果, 如果初步适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时 速率门限值或满足其服务质量 QoS保障条件, 则初步适合配对组为最终适合 配对组, 所有最终适合配对组构成最终适合配对结果, 以及将最终适合配对 结果传输给第二计算单元 64; 第二计算单元 64用于从第二判断单元 63接收 最终适合配对结果, 计算最终适合配对结果中各个最终适合配对组的权值, 或者最终适合配对结果中所有配对用户的比例公平系数之和, 以及将最终适 合配对结果中各个最终适合配对组的权值传输给选取单元 65;选取单元 65用 于从第二计算单元 64接收最终适合配对结果中各个最终适合配对组的权值, 选取各个最终适合配对组的权值中的最大权值, 并将最大权值对应的最终适 合配对组确定为待调度信道的第一配对用户。 其中, 配对用户的比例公平系 数为配对用户的瞬时速率和平均速率的比值。 另外, 初步适合配对结果中的 初步适合配对组的数量小于或等于预配对结果中的预配对组的数量; 最终适 合配对结果中的最终适合配对组的数量小于或等于初步适合配对结果中的初 步适合配对组的数量。
进一步可选的,第一判断单元 61还用于当预配对结果中至少一个配对用
户的信千噪比小于预设的信千噪比阈值时, 则预配对结果中的配对用户不适 合配对, 删除或忽略预配对结果; 第二判断单元 63还用于如果初步适合配对 结果中至少一个配对用户的瞬时速率小于预设的瞬时速率门限值或不满足其 他的业务质量 QoS保障条件, 则初步适合配对结果中的配对用户不适合配对, 删除或忽略初步适合配对结果。
因此, 本发明实施例提供的调度装置, 在待调度信道上对所有候选用户 进行预配对, 得到与待调度信道对应的多个预配对结果; 根据待调度信道的 信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计算与待 调度信道上对应的所有最终适合配对结果的权值; 并将最大权值对应的最终 适合配对结果确定为待调度信道的第一配对用户; 利用所有待调度信道的第 一配对用户进行用户调度, 从而实现了利用小区间交互的干扰信息, 提高了 小区平均吞吐量和边缘用户的吞吐量。
图 7为本发明实施例六提供的基站的示意图。 该基站用于执行本发明实 施例一、 二和三提供的调度方法。 如图所示, 本实施例包括网络接口 71、 处 理器 72和存储器 7 3。 ***总线 74用于连接网络接口 7 1 , 处理器 72和存储 器 7 3。
网络接口 71用于与用户终端的通信。
存储器 73可以是永久存储器, 例如硬盘驱动器和闪存, 存储器 73中具 有软件模块和设备驱动程序。 软件模块能够执行本发明上述方法的各种功能 模块; 设备驱动程序可以是网络和接口驱动程序。
在启动时, 这些软件组件被加载到存储器 7 3 中, 然后被处理器 72访问 并执行如下指令:
物理存储在所述存储器中的应用程序, 所述应用程序包括可用于使所述 处理器和所述.基站执行以下过.程的指令:
在待调度信道上对所有候选用户进行预配对, 得到与待调度信道对应的 预配对结果, 待调度信道为所有待调度信道中的任一信道, 预配对结果包括
至少一个预配对组; 针对待调度信道对应的预配对结果, 根据待调度信道的 信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计算预配 对结果中各个预配对组的每一配对用户的信干噪比; 根据预配对结果中各个 预配对组的每一配对用户的信千噪比, 对各个预配对组进行处理后 , 得到所 有最终适合配对组, 以及计算所有最终适合配对组的权值并将最大权值对应 的最终适合配对组确定为待调度信道的第一配对用户; 利用所有待调度信道 的第一配对用户进行用户调度。
可选地, 物理存储在所述存储器中的应用程序, 所述应用程序可用于使 所述处理器和所述基站执行针对待调度信道对应的预配对结果, 根椐待调度 信道的信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计 算预配对结果中各个预配对组的每一配对用户的信千噪比的指令为: 根据小 区间交互的高干扰指示信息计算所有邻区用户到本小区的千扰功率; 根据所 有邻区用户对本小区的千扰功率、 待调度信道的信道质量信息和信道响应信 息计算预配对结果中各个预配对组的每一配对用户的归一化有用信号功率; 根据预配对结果中各个预配对组的每一配对用户的归一化有用信号功率, 计 算预配对结果中各个预配对组的每一配对用户的信千 '噪比。
进一步可选地, 物理存储在所述存储器中的应用程序, 所述应用程序可 用于使所述处理器和所述基站执行根据所述小区间交互的高千扰指示信息计 算所有邻区用户到本小区的千扰功率的指令为: 根据小区间交互的高千扰指 示信息中邻区用户到本小区的下行导频信号的发射功率谱密度和下行导频信 号接收功率, 计算邻区用户到本小区的路径损耗, 邻区用户是所有邻区用户 中的任一用户; 获取邻区用户的发射功率谱密度后, 计算邻区用户的发射功 率谱密度和邻区用户到本小区的路径损耗的差值, 从而得到邻区用户到本小 区的实际功率值; 计算所有邻区用户到本小区的实际功率值之和, 以及根据 背景高斯白噪声的功率, 从而得到的所有邻区用户对本小区的干扰功率。
可选地, 物理存储在所述存储器中的应用程序, 所述应用程序可用于使
所述处理器和所述基站执行根据所述预配对结果中各个预配对组的每一配对 用户的信千噪比, 对所述各个预配对组进行处理后, 得到所有最终适合配对 组, 以及计算所有最终适合配对组的权值并将最大权值对应的最终适合配对 组确定为待调度信道的第一配对用户的指令为: 判断各个预配对组是否为初 步适合配对组, 当预配对组的每一配对用户的信干噪比都大于或等于预设的 信千噪比阈值时, 则判断预配对组为初步适合配对组, 所有初步适合配对组 构成初步适合配对结果; 计算初步适合配对结果的各个初步适合配对组中每
—配对用户的瞬时速率; 判断各个初步适合配对组是否为最终适合配对结果, 如果初步适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时速率门 限值或满足其服务质量 QoS保障条件, 则初步适合配对组为最终适合配对组, 所有最终适合配对组构成最终适合配对结果; 计算最终适合配对结果中各个 最终适合配对组的权值, 最终适合配对组的权值为最终适合配对组中所有配 对用户的瞬时速率之和, 或者最终适合配对结果中所有配对用户的比例公平 系数之和; 选取各个最终适合配对组的权值中的最大权值, 并将最大权值对 应的最终适合配对组确定为待调度信道的第一配对用户。 其中, 配对用户的 比例公平系数为配对用户的瞬时速率和平均速率的比值。 另外, 初步适合配 对结果中的初步适合配对组的数量小于或等于预配对结果中的预配对组的数 量; 最终适合配对结果中的最终适合配对组的数量小于或等于初步适合配对 结果中的初步适合配对组的数量。
进一步可选地, 物理存储在存储器中的应用程序, 所述应用程序还包括 可用于使所述处理器和所述基站执行以下过程的指令: 当预配对结果中至少 —个配对用户的信千噪比小于预设的信千噪比阈值时, 则预配对结果中的配 对用户不适合配对, 婣除或忽略.预配对结杲。
进一步可选地, 物理存储在所述存储器中的应用程序, 所述应用程序还 包括可用于使所述处理器和所述基站执行以下过程的指令: 如果初步适合配 对结果中至少一个配对用户的瞬时速率小于预设的瞬时速率门限值或不满足
其他的业务质量 QoS 保障条件, 则判断初步适合配对结果中的配对用户不适 合配对, 删除或忽略初步适合配对结杲。
因此, 本发明实施例提供的基站, 在待调度信道上对所有候选用户进行 预配对, 得到与待调度信道对应的多个预配对结果; 根据待调度信道的信道 质量信息, 信道响应信息以及小区间交互的高千扰指示信息, 计算与待调度 信道上对应的所有最终适合配对结果的权值; 并将最大权值对应的最终适合 配对结果确定为待调度信道的第一配对用户; 利用所有待调度信道的第一配 对用户进行用户调度, 从而实现了利用小区间交互的千扰信息, 提高了小区 平均吞吐量和边缘用户的吞吐量。 专业人员应该还可以进一步意识到, 结合本文中所公开的实施例描述的 各示例的单元及算法步骤, 能够以电子硬件、 计算机软件或者二者的结合来 实现, 为了清楚地说明硬件和软件的可互换性, 在上述说明中已经按照功能 一般性地描述了各示例的组成及步骤。 这些功能究竟以硬件还是软件方式来 执行, 取决于技术方案的特定应用和设计约束条件。 专业技术人员可以对每 个特定的应用来使用不同方法来实现所描述的功能, 但是这种实现不应认为 超出本发明的范围
结合本文中所公开的实施例描述的方法或算法的步骤可以用硬件、 处理 器执行的软件模块, 或者二者的结合来实施。 软件模块可以置于随机存储器 ( RAM ) 、 内存、 只读存储器 ( ROM ) 、 电可编程 R0M、 电可擦除可编程 ROM、 寄存器、 硬盘、 可移动磁盘、 CD™R0M、 或技术领域内所公知的任意其它形式 的存储介质中。
以上所述的具体实施方式, 对本发明的目的、 技术方案和有益效果进行 了进一步详细说明, 所应理解的是, 以上所述仅为本发明的具体实施方式而 已, 并不用于限定本发明的保护范围, 凡在本发明的技术方案的范围之内, 所做的任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之内。
Claims
1、 一种调度方法, 其特征在于, 所述方法包括:
在待调度信道上对所有候选用户进行预配对, 得到与所述待调度信道对 应的预配对结果, 所述待调度信道为所有待调度信道中的任一信道, 所述预 配对结果包括至少一个预配对组;
针对所述待调度信道对应的所述预配对结果, 根据所述待调度信道的信 道质量信息、 信道响应信息以及小区间交互的高干扰指示信息, 计算所述预 配对结果中各个预配对组的^ r一配对用户的信千噪比;
根据所述预配对结果中各个预配对组的每一配对用户的信千噪比, 对所 述各个预配对组进行处理后, 得到所有最终适合配对组 , 以及计算所 最终适合配对组的权值并将最大权值对应的所述最终适合配对』
待调度信道的第一配对用户;
利用所有待调度信道的所述第一配对用户进行用户调度。
2 , 根据权利要求 1所述的调度方法,其特征在于,所述针对所述待调度 信道对应的所述预配对结果, 根据所述待调度信道的信道质量信息, 信道响 应信息以及小区间交互的高千扰指示信息, 计算所述预配对结果中各个预配 对组的每一配对用户的信千噪比, 具体包括:
根据所述小区间交互的高干扰指示信息计算所有邻区用户到本小区的千 扰功率;
根据所述所有邻区用户对本小区的千扰功率、 所述,待调度信道的信道质 量信息和信道响应信息计算所述预配对结果中各个预配对组的每一配对用户 的归一化有用信号功率;
根据所述预配对结果中各个预配对组的每一配对用户的归一化有用信号 功率, 计算所述预配对结果中各个预配对组的每一配对用户的信千噪比。
3、 根据权利要求 2所述的调度方法,其特征在于,所述根据所述小区间 交互的高千扰指示信息计算所有邻区用户到本小区的千扰功率具体包括:
根据所述小区间交互的高干扰指示信息中所述部区用户到所述本小区的 下行导频信号的发射功率谱密度和下行导频信号接收功率, 计算所述邻区用 户到所述本小区的路径损耗, 所述邻区用户是所有邻区用户中的任一用户; 获取所述邻区用户的发射功率谱密度后, 计算所述邻区用户的发射功率 讲密度和所述邻区用户到所述本小区的路径损耗的差值, 从而得到所述邻区 用户到所述本小区的实际功率值;
计算所有邻区用户到所述本小区的实际功率值之和, 以及根据背景高斯 白噪声的功率, 从而得到的所有邻区用户对所述本小区的千扰功率。
4、 根据权利要求 1至 3任一项所述的调度方法, 其特征在于,所述根据 所述预配对结果中各个预配对组的每一配对用户的信干噪比, 对所述各个预 配对组进行处理后, 得到所有最终适合配对组, 以及计算所述所有最终适合 配对组的权.值并将最大权值对应的所述最终适合配对组确定为所述待调度信 道的第一配对用户, 具体包括:
判断所述各个预配对组是否为初步适合配对组, 当所述预配对组的每一 配对用户的信千噪比都大于或等于预设的信千噪比阈值时, 则判断所述预配 对组为所述初步适合配对组 , 所有初步适合配对组构成初步适合配对结果; 计算所述初步适合配对结果的各个初步适合配对组中每一配对用户的瞬 时速率;
判断所述各个初步适合配对组是否为最终适合配对结果, 如果所述初步 适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时速率 Π限值或满 足其服务质量 QoS保障条件, 則所述初步适合配对组为所述最终适合配对组, 所有最终适合配对组构成最终适合配对结果;
计算所述最终适合配对结果中各个最终适合配对组的权值, 所述最终适 合配对组的权值为所述最终适合配对组中所有配对用户的瞬时速率之和 , 或 者所述最终适合配对结果中所有配对用户的比例公平系数之和;
选取所述各个最终适合配对组的权值中的最大权值, 并将最大权值对应
的所述最终适合配对组确定为所述待调度.信道的第一配对用户。
5、 根据权利要求 4所述的调度方法, 其特征在于,所述当所述预配对组 的每一配对用户的信干噪比都大于或等于预设的信干噪比阈值时, 则判断所 述预配对组为所述初步适合配对组还包括:
当所述.预配对组中至少一个配对用户的信千噪比小于所述预设的信干噪 比阈值时, 则所述预配对组中的配对用户不适合配对, 删除或忽略所述预配 对组。
6、 根据权利要求 4或 5所述的调度方法,其特征在于,所述如果所述初 步适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时速率门限值或 满足其服务质量 QoS 保障条件, 则所述初步适合配对组为所述最终适合配对 组还包舌:
如果所述.初步适合配对组中至少一个配对用户的瞬时速率小于所述预设 的瞬时速率门限值或不满足其服务质量 QoS保障条件, 则所述初步适合配对 组中的配对用户不适合配对, 删除或忽略.所述初步适合配对组。
7、 根椐权利要求 4所述的调度方法,其特征在于,所述配对用户的比例 公平系数为所述配对用户的瞬时速率和平均速率的比值。
8 , 根据权利要求 1至 7任一项所述的调度方法,其特征在于,所述初步 的所述预配对组的数量; 所述最终适合配对结果中的所述最终适合配对组的 数量小于或等于所述初步适合配对结果中的所述初步适合配对组的数量。
9、 一种调度装置, 其特征在于, 所述装置包括:
预配对模块, 用于在待调度信道上对所有候选用户进行预配对, 得到与 所述待调度信道对应的预配对结果, 所述待调度信道为所有待调度信道中的 任一信道, 所述预配对结果包括至少一个预配对组, 以及将所述待调度信道 对应的预配对结果传输给信千噪比生成模块;
信千噪比生成模块, 用于从所述预配对模块接收所述待调度信道对应的
预配对结果, 针对所述待调度信道对应的所述预配对结果, 根据所述待调度 信道的信道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计 算所述预配对结果中各个预配对组的每一配对用户的信千噪比, 以及将所述 预配对结果中各个预配对组的每一配对用户的信干噪比传输给权值生成模 块;
权值生成模块, 用于从所述信干噪比生成模块接收所述预配对结果中各 个预配对组的每一配对用户的信千噪比, 根据所述预配对结果中各个预配对 组的每一配对用户的信千噪比, 对所述各个预配对组进行处理后, 得到所有 最终适合配对组, 以及计算所述所有最终适合配对组的权值并将最大权值对 应的所述最终适合配对组确定为所述待调度信道的第一配对用户, 及将所有 待调度信道的第一配对用户传输给调度模块;
调度模块, 用于从所述权值生成模块接收所述所有待调度信道的第一配 对用户, 利用所述所有待调度信道的所述第一配对用户进行用户调度。
10、 根据权利要求 9所述的调度装置, 其特征在于, 所述信千噪比生成 模块包括:
第一计算单元, 用于根据所述小区间交互的高千扰指示信息计算所有邻 区用户到本小区的千扰功率, 以及将所述所有邻区用户到本小区的千扰功率 传输给第二计算单元;
第二计算单元, 用于接收所述第一计算单元发送的所述所有邻区用户到 本小区的干扰功率, 根据所述所有邻区用户对本小区的干扰功率、 所述待调 度信道的信道质量信息和信道响应信息计算所述预配对结杲中各个预配对组 的每一配对用户的归一化有用信号功率, 以及将所述预配对结果中各个预配 对组的每一配对用户的归一化有用信号功率传输给第三计算单元;
第三计算单元, 用于接收所述第二计算单元发送的所述预配对结果中各 个预配对组的每一配对用户的归一化有用信号功率, 根据所述预配对结果中 各个预配对组的每一配对用户的归一化有用信号功率, 计算所述预配对结果
中各个预配对组的每一配对用户的信千噪比。
11、 根据权利要求 1 G所述的调度装置, 其特征在于, 所述第一计算单 元具体用于根据所述小区间交互的高千扰指示信息中所述邻区用户到所述本 小区的下行导频信号的发射功率谱密度和下行导频信号接收功率, 计算所述 邻区用户到所述本小区的 i ^径损毛, 所述邻区用户是所有邻区用户中的任一 用户; 获取所述邻区用户的发射功率谱密度后, 计算所述邻区用户的发射功 率谱密度和所述邻区用户到所述本小区的路径损耗的差值, 从而得到所述邻 区用户到所述本小区的实际功率值; 计算所有邻区用户到所述本小区的实际 功率值之和, 以及根据背景高斯白噪声的功率, 从 得到的所有邻区用户对 所述本小区的千扰功率。
1 2、 根据权利要求 9至: 1 1任一项所述的调度装置, 其特征在于, 所述 权值生成模块包括:
第一判断单元, 用于判断所述各个预配对组是否为初步适合配对组, 当 所述预配对组的每一配对用户的信千噪比都大于或等于预设的信千噪比阈值 时, 则判断所述预配对组为所述初步适合配对组, 所有初步适
率, 以及.将所述.初步适.合配对结果的各个初 -配对用户的 瞬时速率传输给第二判断单元;
各个初步适合配对组中每一配对用户的瞬时速率, 判断所述各个初步适合配 对组是否为最终适合配对结果, 如果所述初步适合配对组中每一配对用户的 瞬时速率都不小于预设的瞬时速率门限值或满足其服务质量 QoS保障条件, 则所述初步适合配对组为所述最终适合配对组, 所有最终适合配对组构成最 终适合配对结果, 以及将所述最终适合配对结果传输给第二计算单元;
第二计算单元, 用于从所述第二判断单元接收所述最终适合配对结果, 计算所述最终适合配对结果中各个最终适合配对组的权值, 所述最终适合配 对组的权值为所述最终适合配对组中所有配对用户的瞬时速率之和, 或者所 述最终适合配对结果中所有配对用户的比例公平系数之和, 以及将所述最终 适合配对结果中各个最终适合配对组的权值传输给选取单元;
选取单元, 用于从所述第二计算单元接收所述最终适合配对结果中各个 最终适合配对组的权值, 选取所述各个最终适合配对组的权值中的最大权值, 并将最大权值对应的所述最终适合配对组确定为所述待调度信道的第一配对 用户。
1 3 , 根据权利要求 12 所述的调度装置, 其特征在于, 所述第一判断单 元还用于当所述预配对结果中至少一个配对用户的信干噪比小于所述预设的 信干噪比阈值时, 則所述预配对结果中的配对用户不适合配对, 删除或忽略 所述预配对结果。
14、 根据权利要求 12或 1 3所述的调度装置, 其特征在于, 所述第二判 断单元还用于如果所述初步适合配对结果中至少一个配对用户的瞬时速率小 于所述预设的瞬时速率门限值或不满足其他的业务质量 QoS保障条件, 则所 述初步适合配对结果中的配对用户不适合配对, 删除或忽略所述初步适合配 对结果。
15、 根据权利要求 12 所述的调度装置, 其特征在于, 所述配对用户的 比例公平系数为所述配对用户的瞬时速率和平均速率的比值。
16、 根据权利要求 9至 15任一项所述的调度装置, 其特征在于, 所述 初步适合配对结果中的所述初步适合配对组的数量小于或等于所述预配对结 果中的所述预配对组的数量; 所述最终适合配对结果中的所述最终适合配对 组的数量小于或等于所述初步适合配对结果中的所述初步适合配对组的数
17、 一种基站, 其特征在于, 所述 站包括:
网络接口;
处理器;
存储器;
物理存储在所述存储器中的应用程序, 所述应用程序包括可用于使所述 处理器和所述.基站执行以下过.程的指令:
在待调度信道上对所有候选用户进行预配对, 得到与所述待调度信道对 应的预配对结果, 所述待调度信道为所有待调度信道中的任一信道, 所述预 配对结果包括至少一个预配对组;
针对所述待调度信道对应的所述预配对结果, 根据所述待调度信道的信 道质量信息、 信道响应信息以及小区间交互的高千扰指示信息, 计算所述预 配对结果中各个预配对组的每一配对用户的信干噪比;
根据所述.预配对结果中各个预配对组的每一配对用户的信干噪比, 对所 述各个预配对组进行处理后, 得到所有最终适合配对组, 以及计算所述所有 最终适合配对组的权值并将最大权值对应的所述最终适合配对组确定为所述 待调度信道的第一配对用户;
利用所有待调度信道的所述第一配对用户进_行用户调度。
18、 根据权利要求 17 所述的基站, 其特征在于, 所述应用程序可用于 使所述处理器和所述基站执行针对所述待调度信道对应的所述预配对结果, 根据所述.待调度信道的信道质量信息、 信道响应信息以及小区间交互的高千 扰指示信息, 计算所述预配对结果中各个预配对组的每一配对用户的信干噪 比的指令为:
根据所述小区间交互的高千扰指示信息计算所有邻区用户到本小区的千 扰功率;
根据所述所有邻区用户对本小区的千扰功率、 所述待调度信道的信道质 量信息和信道响应信息计算所述预配对结果中各个预配对组的每一配对用户 的归一化有用信号功率;
根据所述预配对结果中各个预配对组的每一配对用户的归一化有用信号 功率, 计算所述预配对结果中各个预配对组的每一配对用户的信千噪比。
19、 根据权利要求 18 所述的基站, 其特征在于, 所述应用程序可用于 使所述处理器和所述基站执行根据所述小区间交互的高干扰指示信息计算所 有邻区用户到本小区的干扰功率的指令为:
根据所述小区间交互的高干扰指示信息中所述邻区用户到所述本小区的 下行导频信号的发射功率谱密度和下行导频信号接收功率, 计算所述邻区用 户到所述本小区的路径损耗, 所述邻区用户是所有邻区用户中的任一用户; 获取所述邻区用户的发射功率谱密度后, 计算所述邻区用户的发射功率 谱密度和所述部区用户到所述本小区的路径损耗的差值, 从而得到所述邻区 用户到所述本小区的实际功率值;
计算所有邻区用户到所述本小区的实际功率值之和, 以及根据背景高斯 白噪声的功率, 从而得到的所有邻区用户对所述本小区的干扰功率。
20、 根据权利要求 17至 19任一项所述的基站, 其特征在于, 所述应用 程序可用于使所述处理器和所述基站执行根据所述预配对结果中各个预配对 组的每一配对用户的信千噪比, 对所述各个预配对组进行处理后, 得到所有 最终适合配对组, 以及计算所述所有最终适合配对组的权值并将最大权值对 应的所述最终适合配对组确定为所述待调度信道的第一配对用户的指令为: 判断所述各个预配对组是否为初步适合配对组, 当所述预配对组的每一 配对用户的信千噪比都大于或等于预设的信千噪比阈值时, 则判断所述预配 对组为所述初步适合配对组 , 所有初步适合配对组构成初步适合配对结果; 计算所述初步适合配对结果的各个初步适合配对组中每一配对用户的瞬 时速率;
判断所述各个初步适合配对组是否为最终适合配对结果, 如果所述初步 适合配对组中每一配对用户的瞬时速率都不小于预设的瞬时速率 Π限值或满 足其服务质量 QoS保障条件, 則所述初步适合配对组为所述最终适合配对组,
所有最终适合配对组构成最终适合配对结果;
计算所述最终适合配对结果中各个最终适合配对组的权值, ;
合配对组的权值为所述最终适合配对组中所有配对用户的瞬时速率之和, 或 者所述最终适合配对结果中所有配对用户的比例公平系数之和;
选取所述各个最终适合配对组的权值中的最大权值, 并将最大权值对应
21、 根据权利要求 20所述的基站, 其特征在于, 所述应用程序还包括 可用于使所述处理器和所述基站执行以下过程的指令:
当所述预配对结果中至少一个配对用户的信千噪比小于所述预设的信千 噪比阈值时, 则所述预配对结果中的配对用户不适合配对, 删除或忽略所述 预配对结果。
22、 根据权利要求 20或 21所述的基站, 其特征在吁 所述应用程序还 包括可用于使所述处理器和所述基站执行以下过程的指令:
如果所述初步适合配对结果中至少一个配对用户的瞬寸速率小于所述预 设的瞬时速率 Π限值或不满足其他的业务质量
果
23、 根据权利要求 14 所述的基站, 其特征在于,
公平系数为所述配对用户的瞬时速率和平均速率的比值
24、 根据权利要求 17至 2 3任一项所述的基站, 其特 i 所述初步 适合配对结果中的所述初步适合配对组的数量小于或等于所述预配对结果中 的所述预配对组的数量; 所述最终适合配对结果中的所述最终 ϋ
等于所述初步适合配对结果中的
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2012/084073 WO2014067158A1 (zh) | 2012-11-05 | 2012-11-05 | 调度方法、装置和基站 |
CN201280021983.6A CN103703854B (zh) | 2012-11-05 | 2012-11-05 | 用户调度方法和装置 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2012/084073 WO2014067158A1 (zh) | 2012-11-05 | 2012-11-05 | 调度方法、装置和基站 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2014067158A1 true WO2014067158A1 (zh) | 2014-05-08 |
Family
ID=50363955
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2012/084073 WO2014067158A1 (zh) | 2012-11-05 | 2012-11-05 | 调度方法、装置和基站 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN103703854B (zh) |
WO (1) | WO2014067158A1 (zh) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105721123B (zh) * | 2014-12-03 | 2019-04-09 | 电信科学技术研究院 | 一种用户配对及功率分配方法及装置 |
CN106095115B (zh) * | 2016-06-30 | 2019-05-17 | 北京智能管家科技有限公司 | 一种应用程序调度处理方法及装置 |
CN114828270B (zh) * | 2022-04-06 | 2024-04-12 | 中国联合网络通信集团有限公司 | 一种配对调度方法、装置及存储介质 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101904146A (zh) * | 2007-12-21 | 2010-12-01 | 摩托罗拉公司 | Wimax中的上行链路协同sdma用户配对的方法 |
CN101989874A (zh) * | 2009-07-31 | 2011-03-23 | 中兴通讯股份有限公司 | 一种多用户多输入多输出的配对方法及装置 |
CN101997583A (zh) * | 2009-08-21 | 2011-03-30 | 索尼株式会社 | 用于协作多点传输的上行多用户mimo用户配对方法和装置 |
CN102340879A (zh) * | 2010-07-23 | 2012-02-01 | 中兴通讯股份有限公司 | 一种基于mimo***的用户调度方法及*** |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102316597B (zh) * | 2010-06-30 | 2015-04-22 | 中兴通讯股份有限公司 | Mimo***中的资源调度方法和装置 |
CN102611535A (zh) * | 2011-01-24 | 2012-07-25 | 中兴通讯股份有限公司 | 一种多用户多输入多输出的调度方法和装置 |
-
2012
- 2012-11-05 WO PCT/CN2012/084073 patent/WO2014067158A1/zh active Application Filing
- 2012-11-05 CN CN201280021983.6A patent/CN103703854B/zh active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101904146A (zh) * | 2007-12-21 | 2010-12-01 | 摩托罗拉公司 | Wimax中的上行链路协同sdma用户配对的方法 |
CN101989874A (zh) * | 2009-07-31 | 2011-03-23 | 中兴通讯股份有限公司 | 一种多用户多输入多输出的配对方法及装置 |
CN101997583A (zh) * | 2009-08-21 | 2011-03-30 | 索尼株式会社 | 用于协作多点传输的上行多用户mimo用户配对方法和装置 |
CN102340879A (zh) * | 2010-07-23 | 2012-02-01 | 中兴通讯股份有限公司 | 一种基于mimo***的用户调度方法及*** |
Also Published As
Publication number | Publication date |
---|---|
CN103703854A (zh) | 2014-04-02 |
CN103703854B (zh) | 2017-06-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zhou et al. | Fronthaul compression and transmit beamforming optimization for multi-antenna uplink C-RAN | |
JP5484819B2 (ja) | マルチセル協調送信方法 | |
JP4899637B2 (ja) | 無線通信システムおよび無線通信方法 | |
KR101524689B1 (ko) | 간섭 정렬을 위하여 선택적으로 간섭 채널들에 대한 정보를피드백하는 통신 시스템 및 그 방법 | |
CN103999513B (zh) | 用于mu‑mimo的上行链路功率控制 | |
CN101784119B (zh) | Ofdma分布式天线网络资源的分配方法 | |
WO2010118650A1 (zh) | 一种信道信息反馈方法、终端、基站及多输入多输出*** | |
CN102186212A (zh) | 一种小区间协作调度方法、***和用户设备 | |
Coskun et al. | Three-stage resource allocation algorithm for energy-efficient heterogeneous networks | |
CN113473422B (zh) | 一种面向b5g的无线携能d2d网络高效资源分配方法 | |
Boviz et al. | Effective design of multi-user reception and fronthaul rate allocation in 5G cloud RAN | |
CN114219354A (zh) | 一种基于联邦学习资源分配优化方法及*** | |
KR102027914B1 (ko) | 무선 통신 시스템에서 셀 간 간섭 제거 방법 및 장치 | |
Zhang et al. | Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks | |
US10893394B2 (en) | Devices and methods arranged to support user communication device grouping in a communication network | |
WO2014183315A1 (zh) | Mimo-ofdma无线中继***的分布式资源分配方法 | |
Karimi et al. | Lightweight user grouping with flexible degrees of freedom in virtual MIMO | |
CN110663234A (zh) | 控制设备、网络节点及其方法 | |
WO2013000242A1 (zh) | 资源分配方法及装置 | |
WO2014067158A1 (zh) | 调度方法、装置和基站 | |
Liu et al. | Hybrid multiple access and service-oriented resource allocation for heterogeneous QoS provisioning in machine type communications | |
WO2015085494A1 (zh) | 基站及用户调度方法 | |
CN105072686B (zh) | 一种基于ofdma中继网络的无线资源分配方法 | |
Chen et al. | Resource allocation with CoMP transmission in ultra dense cloud-based LTE small cell networks | |
Xing et al. | Joint channel assignment and power allocation for noma-based d2d communications with imperfect csi |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12887797 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 12887797 Country of ref document: EP Kind code of ref document: A1 |