CN102348287A - Method and device for realizing user scheduling - Google Patents
Method and device for realizing user scheduling Download PDFInfo
- Publication number
- CN102348287A CN102348287A CN2010102408657A CN201010240865A CN102348287A CN 102348287 A CN102348287 A CN 102348287A CN 2010102408657 A CN2010102408657 A CN 2010102408657A CN 201010240865 A CN201010240865 A CN 201010240865A CN 102348287 A CN102348287 A CN 102348287A
- Authority
- CN
- China
- Prior art keywords
- user
- scheduling
- metric value
- maximum
- users
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000012805 post-processing Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000004422 calculation algorithm Methods 0.000 abstract description 18
- 238000005259 measurement Methods 0.000 abstract 7
- 238000005516 engineering process Methods 0.000 description 13
- 238000004891 communication Methods 0.000 description 4
- 238000004088 simulation Methods 0.000 description 4
- 238000001228 spectrum Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000003595 spectral effect Effects 0.000 description 2
- 241001522296 Erithacus rubecula Species 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Images
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
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and a device for realizing user scheduling. The measurement value of each user can be calculated, and the maximum measurement value and the corresponding user can be obtained; the maximum united measurement value of matched user combination under each matched user number and the corresponding matched user combination are respectively obtained; the obtained maximum scheduling measurement value and each maximum united measurement value are renewed by corresponding retrenchment factors; and the user or matched user combination corresponding to the maximum value in the renewed maximum measurement value and each maximum united measurement value are determined to be scheduled. The method and the device disclosed by the invention can limit the integral matching conditions when multiple users are matched, and multi-user matching can be carried out only when the integral performance after user matching is good enough so as to ensure that the integral performance of a system can still be improved when a user channel is interfered more complexly. A matching algorithm and a scheduling algorithm are both considered in the user scheduling, the correctness of the user scheduling is improved, and the reduction of system performance is avoided.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a method and an apparatus for implementing user scheduling.
Background
In wireless communication, as the demand for services such as multimedia is higher and higher, a mobile communication system is required to provide higher data rate and system capacity. The LTE utilizes an OFDM technology, a multi-antenna technology and a precoding technology, and can better meet the requirement of high data rate of a user.
However, as the demand of LTE-a is raised, more and more attention is paid to the cell average spectrum efficiency and the cell edge spectrum efficiency. Both uplink and downlink of the LTE system employ a multiple access multiplexing scheme based on OFDM. Unlike a conventional wireless communication system using CDMA as a basic multiple access multiplexing scheme, the LTE system has no processing gain because of complete frequency division orthogonality within a cell. If the frequency cannot be multiplexed, it becomes extremely difficult to further improve the spectrum efficiency, so researchers have introduced multi-user Multiple input Multiple output (MU-MIMO), the MU-MIMO technology means that Multiple users multiplex the same time-frequency resource to transmit data, and then the MIMO processing is used to eliminate the interference between the multiplexed users or only detect the useful signal of the user in the interference signal.
However, due to limitations in the LTE system architecture and the like, MU-MIMO performance is not very desirable and has not been paid sufficient attention. However, with the introduction of the LTE-a system, the MU-MIMO technology has been interested in extensive research in the industry, and it can increase the system throughput and improve the spectrum efficiency of the system, and is one of the breakthrough technologies for 4G communication.
In the practical application of MU-MIMO, the method selects proper users to multiplex in the same physical resource, namely the pairing algorithm, which is the most basic and important part of MU-MIMO, and will affect the performance of MU-MIMO system, and the pairing rules of different MU-MIMO algorithms have different design methods. There are two common MU-MIMO pairing criteria currently available: one is a signal-to-leakage-and-noise ratio criterion, and the other is a signal-to-interference ratio criterion of cyclic optimization; specific MU-MIMO algorithms include random pairing, determinant pairing, orthogonal pairing, and the like.
However, scheduling problems are also involved in the system, and two important factors to be considered in the research of the radio resource management scheduling algorithm are throughput and fairness. The throughput includes cell throughput and user throughput, and fairness is generally considered as a statistical result of channel resources occupied by each user or different packet services. There are currently three common scheduling algorithms: a maximum throughput algorithm, a round robin algorithm and a proportional fairness algorithm.
Because a pairing algorithm and a scheduling algorithm are not considered when the MU-MIMO technology is adopted in the LTE-a system, when user scheduling is actually performed, interference suffered by a single user becomes more complex with the increase of the number of user pairings, so that the accuracy of user scheduling is reduced, which inevitably leads to the reduction of system performance.
Disclosure of Invention
In view of this, the main objective of the present invention is to provide a method and an apparatus for implementing user scheduling, which consider a pairing algorithm and a scheduling algorithm in user scheduling to improve the correctness of user scheduling and avoid the reduction of system performance.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
a method of implementing user scheduling, the method comprising:
calculating the metric value of each user, and acquiring the maximum metric value and the corresponding user; respectively acquiring the maximum joint metric value of the user pairing combination and the corresponding user pairing combination under the number of the pairing users;
applying corresponding reduction factors to the obtained maximum scheduling metric values and the maximum joint metric values for updating; and determining the user or the user pairing combination corresponding to the maximum value in the updated maximum metric value and each maximum joint metric value for scheduling.
The process of calculating the scheduling metric value includes:
traversing all the independent users to be scheduled, and calculating the metric value of the users; and the number of the first and second groups,
and traversing all the user pairing combinations containing different pairing user numbers, and calculating the joint metric value of each user pairing combination.
The process of calculating the joint metric value of the user pair comprises the following steps:
calculating the metric value of a single user to be scheduled in paired users, adding the calculated metric values of the single users to be scheduled, and taking the addition result as a combined metric value of user pairing;
the method for calculating the metric value of the individual user to be scheduled comprises the following steps:
wherein β is a constant; vthruputRepresenting the completed throughput of the user within a specified statistical time period; when performing single-user scheduling, NbitRepresenting the number of bits that a user can correctly transmit under the current channel conditions;
when scheduling 2 users or more than 2 users, the current channel condition refers to: channel conditions subject to channel interference from other users in the pair-wise combination.
The updating process comprises the following steps:
and multiplying each maximum scheduling metric value and each maximum joint metric value by a corresponding reduction factor respectively, and taking the product as the updated maximum scheduling metric value and each maximum joint metric value.
The method further comprises the following steps:
and acquiring the updated maximum scheduling metric value and the user or the user pair corresponding to the maximum value in the maximum joint metric values to be used as a scheduling object for scheduling.
A device for realizing user scheduling comprises a scheduling metric value calculating unit, a scheduling metric value post-processing unit and a scheduling object confirming unit; wherein,
the scheduling metric value calculating unit is used for calculating the metric value of each user; respectively acquiring the joint metric value of the user pairing combination and the corresponding user pairing combination under the number of each pairing user;
the scheduling metric post-processing unit is used for obtaining a maximum scheduling metric in the scheduling metrics and each maximum joint metric in the joint metrics under the number of each paired user, and updating the obtained maximum scheduling metric and each maximum joint metric by applying a reduction factor;
and the scheduling object confirming unit is used for taking the updated maximum scheduling metric value and the user or the user pair corresponding to the maximum value in the maximum joint metrics as the scheduling object.
When calculating the scheduling metric value, the scheduling metric value calculating unit is configured to:
traversing all the independent users to be scheduled, and calculating the metric value of the users; and the number of the first and second groups,
and traversing all the user pairing combinations containing different pairing user numbers, and calculating the joint metric value of each user pairing combination.
When calculating the joint metric value of the user pair, the scheduling metric value calculating unit is configured to:
calculating the metric value of each single user to be scheduled in the paired users, adding the calculated metric values of each single user to be scheduled, and taking the addition result as a joint metric value of the user pairing;
when calculating the metric value of a single user to be scheduled, the scheduling metric value calculating unit is configured to:
wherein β is a constant; vthruputRepresenting the completed throughput of the user within a specified statistical time period; when performing single-user scheduling, NbitRepresenting the number of bits that a user can correctly transmit under the current channel conditions;
when 2 users or more than 2 users are paired and scheduled, the current channel condition refers to: channel conditions subject to channel interference from other users in the pair-wise combination.
When updating, the scheduling metric post-processing unit is configured to:
and multiplying the maximum scheduling metric value and each maximum joint metric value by a corresponding reduction factor respectively, and taking the product as the updated maximum scheduling metric value and each maximum joint metric value.
The apparatus further includes a scheduling execution unit for scheduling the user to be a scheduling object.
The invention realizes the user scheduling technology, in the application of MU-MIMO technology, under the condition that a plurality of users reuse the same resource, the integral pairing condition of multi-user pairing can be limited, and the multi-user pairing can be carried out only when the integral performance is good enough after the users are paired, thus ensuring that the integral performance of the system can be still improved when the user channel is interfered by more complex; therefore, the pairing algorithm and the scheduling algorithm are considered in the user scheduling, the accuracy of the user scheduling is improved, and the reduction of the system performance is avoided.
Drawings
FIG. 1 is a flowchart of an embodiment of the present invention for implementing user scheduling;
FIG. 2 is a simplified flow chart of the present invention for implementing user scheduling;
fig. 3 is a diagram of an apparatus for implementing user scheduling according to an embodiment of the present invention.
Detailed Description
When the system adopts MU-MIMO technology and can schedule N users at most on the same time-frequency resource, the current channel characteristic and fairness principle of the users need to be considered simultaneously when the multi-user scheduling is carried out, and finally the users to be scheduled on the resource are determined. In general, first, a reduction factor is multiplied by the joint metric values of 2 and more than 2 user pairs, and the reduction factors adopted by the joint metric values of different numbers of users after pairing may be the same or different; and then, replacing the original joint metric value with the reduced metric value to serve as a final scheduling basis.
The reduction factor has a value less than or equal to 1, which is related to the channel environment in which the system is located. Under a given channel scene, the average spectral efficiency and the edge spectral efficiency of the system can reach the optimal value or be higher than the set reference value by adopting a proper reduction factor. The optimal value of the reduction factor is determined by a number of system level simulations given the channel environment in which the system is located.
The fairness principle means that the probability that a user obtains scheduling again is lower if the throughput of data completed by the user is higher within a certain time period, otherwise, the probability that the user obtains scheduling is higher, so that all users can obtain equal processing.
The detailed scheduling process is as follows:
and (I) respectively calculating the metric value of each user aiming at the user to be scheduled. The metric value is calculated according to the following principle: the better the current channel quality of the user is, the larger the metric value is, otherwise, the smaller the metric value is; within a certain statistical time period, if the amount of data scheduled to be transmitted by the user is larger, the metric value is smaller, and vice versa. And searching the maximum metric value in the calculated metric values of the users, and recording the maximum metric value M1 and the corresponding users.
And secondly, calculating a joint metric value of each n user pairs aiming at paired users which can carry out n user pairs in the users to be scheduled. When calculating the joint metric value of the user pair in each combination, firstly, the metric value of each user in the combination is calculated respectively, and then all the metric values in the combination obtained by calculation are added to obtain the joint metric value of the n user pairs corresponding to the combination. In calculating the metric values of the individual users, the metric values are calculated by the same principle as described in (a) except that the channels of the users are channels in the presence of channel interference of other users in the pair combination.
Traversing all possible N user pairing combinations, finally searching the maximum joint metric value in the step, and recording the joint metric value Mn and the corresponding N user pairing, wherein N is a positive integer which is more than or equal to 2 and less than or equal to N. Note that when n is 1, the process degrades to the operating mode in (one).
(III) multiplying each Mn obtained in the previous (two) processes by the corresponding reduction factor alpha respectivelynObtaining a new metric Mnnew＝Mn×αnThen compare M1, MnnewWherein N is a positive integer of 2. ltoreq. n.ltoreq.N. And taking the maximum value of the N values of the metric values to be compared, and taking the paired user corresponding to the maximum value as the user to be scheduled to finish scheduling.
The foregoing operation principle may be represented as shown in fig. 1, and referring to fig. 1, fig. 1 is a flowchart for implementing user scheduling according to an embodiment of the present invention, where the flowchart includes the following steps:
step 101: and respectively calculating the metric value of each user aiming at the individual users to be scheduled, and obtaining the maximum metric value M1.
Step 102: traversing all possible n user pairing combinations aiming at pairing users in the users to be scheduled, and calculating a joint metric value of each n user pairing; and respectively obtaining the maximum joint metric value Mn in the joint metric values corresponding to the different values of n.
Step 103: multiplying each Mn by a corresponding reduction factor to obtain a new metric value MnnewM1, MnnewThe user corresponding to the maximum value in (1) is taken as a scheduling object.
Step 104: and scheduling the users to be scheduled.
In practical applications, it may be assumed that the system employs MU-MIMO technology, and at most 4 users may be allocated to use simultaneously on the same time-frequency resource, i.e. N is 4.
Assume that on a certain time-frequency resource, there are 5 users to be multiplexed, which are referred to as user a, user b, user c, user d, and user e, respectively.
When users are scheduled, the current channel characteristics and the fairness principle of the users are considered at the same time. The metric value calculation formula of a single user is as follows:
wherein N isbitIndicating the number of bits that a user can correctly transmit under the current channel conditions; β is a constant; vthruputRepresenting the throughput that the user has completed within a specified statistical time period.
In a given certain channel scenario, a suitable reduction factor α is obtained by a large number of system simulationsn。
Assume a2＝1，α3＝0.8，α4＝0.7。
And (I) carrying out single-user scheduling, and obtaining a metric value by each user. The metric values are calculated according to equation (1), and in this embodiment there are 5 users, and thus 5 metric values are obtained, assuming that the user with the largest metric value is user c, whose metric value is 0.9, i.e. M1 is 0.9.
And (II) carrying out 2-user pairing scheduling, and calculating a joint metric value of each 2-user pairing. Firstly, the metric value of each of the 2 users is calculated respectively, and then the two metric values are added to obtain a combined metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 1 paired user. In this process, there are 10 possible combinations of 2 user pairs, and thus 10 joint metric values are obtained, assuming that the user pair with the largest joint metric value is user (b, e), and the joint metric value is 1.2, i.e., the maximum joint metric value M2 is 1.2.
And (III) carrying out 3-user pairing scheduling, and calculating a joint metric value of each 3-user pairing. Firstly, the metric value of each user in the 3 users is calculated respectively, and then the 3 metric values are added to obtain a combined metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 2 paired users. In this process, there are 10 possible 3 user pairing combinations, so that 10 joint metric values are obtained, and the maximum joint metric value M3 among the 10 joint metric values is found, assuming that M3 is 155, corresponding to the combination (a, b, e).
And (IV) 4-user pairing scheduling is carried out, and the joint metric value of each 4-user pairing is calculated. Firstly, the metric value of each of the 4 users is calculated respectively, and then the 4 metric values are added to obtain a joint metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 3 paired users. In this process, there are 5 possible 4 user pairing combinations, so 5 joint metric values are obtained, and the maximum joint metric value M4 among the 5 joint metric values is found, assuming that M4 is equal to 1.6, and the corresponding combination is (a, b, d, e).
And (V) multiplying the maximum joint metric values of the 2-user pair, the 3-user pair and the 4-user pair by corresponding reduction factors respectively to obtain a new maximum joint metric value M2 of the 2-user pairnew＝M2×α2Get the maximum joint metric value M3 for the new 3-user pair equal to 1.2new＝M3×α3Get the maximum joint metric value M4 for 4 user pairs at 1.24new＝M4×α41.12. Four metric values M1, M2 are comparednew、M3newAnd M4newWherein M3newIs the largest; therefore, 3-user scheduling is adopted on the time frequency resource, and the scheduled user combination is (a, b, e).
Note that: the processes of the 4 processes (one), (two), (three), and (four) in this embodiment may be operated in parallel or may be operated in series.
Alternatively, in a given certain channel scenario, the appropriate reduction factor α is obtained through a number of system simulationsn。
Assume a2＝1，α3＝0.8，α4＝0.8。
And (I) carrying out single-user scheduling, and obtaining a metric value by each user. The metric values are calculated according to equation (1), and in this embodiment there are 5 users, and thus 5 metric values are obtained, assuming that the user with the largest metric value is user c, whose metric value is 0.9, i.e. M1 is 0.9.
And (II) carrying out 2-user pairing scheduling, and calculating a joint metric value of each 2-user pairing. Firstly, the metric value of each of the 2 users is calculated respectively, and then the two metric values are added to obtain a combined metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 1 paired user. In this process, there are 10 possible combinations of 2 user pairs, and thus 10 joint metric values are obtained, assuming that the user pair with the largest joint metric value is user (b, e), and the joint metric value is 1.2, i.e., the maximum joint metric value M2 is 1.2.
And (III) carrying out 3-user pairing scheduling, and calculating a joint metric value of each 3-user pairing. Firstly, the metric value of each user in the 3 users is calculated respectively, and then the 3 metric values are added to obtain a combined metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 2 paired users. In this process, there are 10 possible 3 user pairing combinations, so that 10 joint metric values are obtained, and the maximum joint metric value M3 among the 10 joint metric values is found, assuming that M3 is 1.55, and the corresponding combination is (a, b, e).
And (IV) 4-user pairing scheduling is carried out, and the joint metric value of each 4-user pairing is calculated. Firstly, the metric value of each of the 4 users is calculated respectively, and then the 4 metric values are added to obtain a joint metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 3 paired users. In this process, there are 5 possible 4 user pairing combinations, so 5 joint metric values are obtained, and the maximum joint metric value M4 among the 5 joint metric values is found, assuming that M4 is equal to 1.6, and the corresponding combination is (a, b, d, e).
(V) multiplying the maximum joint metric values of the 2-user pair, the 3-user pair and the 4-user pair by corresponding reduction factors respectively,obtaining the maximum joint metric value M2 of the new 2-user pairingnew＝M2×α2Get the maximum joint metric value M3 for the new 3-user pair equal to 1.2new＝M3×α3Get the maximum joint metric value M4 for 4 user pairs at 1.24new＝M4×α41.28. Four metric values M1, M2 are comparednew、M3newAnd M4newWherein M4newIs the largest; therefore, 4-user scheduling is adopted on the time frequency resource, and the scheduled user combination is (a, b, d, e).
Note that: the processes of the 4 processes (one), (two), (three), and (four) in this embodiment may be operated in parallel or may be operated in series.
Alternatively, in a given channel scenario, the appropriate reduction factor α is obtained through a number of system simulationsn。
Assume a2＝1，α3＝0.75，α4＝0.67。
And (I) carrying out single-user scheduling, and obtaining a metric value by each user. The metric values are calculated according to equation (1), and in this embodiment there are 5 users, and thus 5 metric values are obtained, assuming that the user with the largest metric value is user c, which has a metric value of 1.75, i.e. M1 is 1.75.
And (II) carrying out 2-user pairing scheduling, and calculating a joint metric value of each 2-user pairing. Firstly, the metric value of each of the 2 users is calculated respectively, and then the two metric values are added to obtain a combined metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 1 paired user. In this process, there are 10 possible combinations of 2 user pairs, and thus 10 joint metric values are obtained, assuming that the user pair with the largest joint metric value is user (b, e), and the joint metric value is 1.2, i.e., the maximum joint metric value M2 is 1.2.
And (III) carrying out 3-user pairing scheduling, and calculating a joint metric value of each 3-user pairing. Firstly, the methodAnd respectively calculating the metric value of each of the 3 users, and then adding the 3 metric values to obtain a combined metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 2 paired users. In this process, there are 10 possible 3 user pairing combinations, so that 10 joint metric values are obtained, and the maximum joint metric value M3 among the 10 joint metric values is found, assuming that M3 is 1.55, and the corresponding combination is (a, b, e).
And (IV) 4-user pairing scheduling is carried out, and the joint metric value of each 4-user pairing is calculated. Firstly, the metric value of each of the 4 users is calculated respectively, and then the 4 metric values are added to obtain a joint metric value. The single user metric value is calculated according to the formula (1), and in the process, N is obtainedbitThe channel used is a channel subject to interference from 3 paired users. In this process, there are 5 possible 4 user pairing combinations, so 5 joint metric values are obtained, and the maximum joint metric value M4 among the 5 joint metric values is found, assuming that M4 is equal to 1.6, and the corresponding combination is (a, b, d, e).
And (V) multiplying the maximum joint metric values of the 2-user pair, the 3-user pair and the 4-user pair by corresponding reduction factors respectively to obtain a new maximum joint metric value M2 of the 2-user pairnew＝M2×α2Get the maximum joint metric value M3 for the new 3-user pair equal to 1.2new＝M3×α31.1625, the maximum joint metric value M4 of the 4 user pairs is obtainednew＝M4×α41.072. Four metric values M1, M2 are comparednew、M3newAnd M4newWhere M1 is maximal; therefore, 1-user scheduling is adopted on the time frequency resource, and the scheduled user is c.
Note that: the processes of the 4 processes (one), (two), (three), and (four) in this embodiment may be operated in parallel or may be operated in series.
As can be seen from the above description, in the application of the MU-MIMO technology, when multiple users reuse the same resource, the overall pairing condition during multi-user pairing can be limited, and multi-user pairing can be performed only when the overall performance is good enough after user pairing, so that the overall performance of the system can still be improved when the user channel is interfered by more complexity.
It should be noted that, no matter the metric values of the users to be scheduled are respectively calculated, the maximum metric value therein is obtained; or traversing all possible n user pairing combinations for pairing users in the users to be scheduled, and calculating a joint metric value of each n user pairing; in practice, the scheduling metric value of each user scheduling scheme is calculated by traversing all possible user scheduling schemes containing different numbers of users for the users to be scheduled. Therefore, the main operation concept in the above technical contents can be represented as shown in fig. 2. Referring to fig. 2, fig. 2 is a simplified flowchart of the user scheduling implementation process of the present invention, where the process includes the following steps:
step 210: calculating the metric value of each user, and acquiring the maximum metric value and the corresponding user; and respectively acquiring the maximum joint metric value of the user pairing combination and the corresponding user pairing combination under the number of the pairing users.
Step 220: applying corresponding reduction factors to the obtained maximum scheduling metric values and the maximum joint metric values for updating; and determining the user or the user pairing combination corresponding to the maximum value from the updated maximum metric values and the maximum joint metric values to be scheduled.
Of course, the maximum metric value obtained for a single user to be scheduled does not need to be updated with respect to the reduction factor, such as: the reduction factor used when updating is zero.
In order to ensure the smooth proceeding of the above technical contents, a device as shown in fig. 3 may be provided. Referring to fig. 3, fig. 3 is a diagram of a device for implementing user scheduling according to an embodiment of the present invention, where the device includes a scheduling metric value calculating unit, a scheduling metric value post-processing unit, a scheduling object determining unit, and may further include a scheduling executing unit.
When the method is applied specifically, the scheduling metric value calculation unit can calculate the metric value of each user aiming at the single user to be scheduled; and traversing all possible user pairing combinations aiming at the paired users in the users to be scheduled, and calculating the joint metric value of each user pairing. Namely: and calculating the scheduling metric value of each user scheduling scheme aiming at all possible user scheduling schemes containing different user numbers traversed by the user to be scheduled. And the scheduling metric value calculating unit can send the calculated scheduling metric value to the scheduling metric value post-processing unit.
The scheduling metric post-processing unit can respectively obtain the maximum scheduling metric values in the scheduling metric values corresponding to different user numbers, update each obtained maximum scheduling metric value by applying a reduction factor, send each updated maximum scheduling metric value to the scheduling object confirmation unit, and the scheduling object confirmation unit takes the user corresponding to the maximum value in each updated maximum scheduling metric value as a scheduling object.
Of course, the scheduling target confirming unit may further notify the scheduling executing unit of the user to be scheduled, and the scheduling executing unit may schedule the user to be scheduled.
In summary, in the application of the MU-MIMO technology, under the condition that multiple users reuse the same resource, the overall pairing conditions of multi-user pairing can be limited, and the multi-user pairing can be performed only when the overall performance is good enough after the users are paired, so that the overall performance of the system can be still improved when the user channel is interfered by more complex; therefore, the pairing algorithm and the scheduling algorithm are considered in the user scheduling, the accuracy of the user scheduling is improved, and the reduction of the system performance is avoided.
The above description is only exemplary of the present invention and should not be taken as limiting the scope of the present invention, and any modifications, equivalents, improvements, etc. that are within the spirit and principle of the present invention should be included in the present invention.
Claims (10)
1. A method for implementing user scheduling, the method comprising:
calculating the metric value of each user, and acquiring the maximum metric value and the corresponding user; respectively acquiring the maximum joint metric value of the user pairing combination and the corresponding user pairing combination under the number of the pairing users;
applying corresponding reduction factors to the obtained maximum scheduling metric values and the maximum joint metric values for updating; and determining the user or the user pairing combination corresponding to the maximum value in the updated maximum metric value and each maximum joint metric value for scheduling.
2. The method of claim 1, wherein calculating the scheduling metric value comprises:
traversing all the independent users to be scheduled, and calculating the metric value of the users; and the number of the first and second groups,
and traversing all the user pairing combinations containing different pairing user numbers, and calculating the joint metric value of each user pairing combination.
3. The method of claim 2, wherein calculating the joint metric value for the user pair comprises:
calculating the metric value of a single user to be scheduled in paired users, adding the calculated metric values of the single users to be scheduled, and taking the addition result as a combined metric value of user pairing;
the method for calculating the metric value of the individual user to be scheduled comprises the following steps:
wherein β is a constant; vthruputRepresenting the completed throughput of the user within a specified statistical time period; when performing single-user scheduling, NbitRepresenting the number of bits that a user can correctly transmit under the current channel conditions;
when scheduling 2 users or more than 2 users, the current channel condition refers to: channel conditions subject to channel interference from other users in the pair-wise combination.
4. The method according to any of claims 1 to 3, wherein the updating comprises:
and multiplying each maximum scheduling metric value and each maximum joint metric value by a corresponding reduction factor respectively, and taking the product as the updated maximum scheduling metric value and each maximum joint metric value.
5. The method of claim 4, further comprising:
and acquiring the updated maximum scheduling metric value and the user or the user pair corresponding to the maximum value in the maximum joint metric values to be used as a scheduling object for scheduling.
6. A device for realizing user scheduling is characterized in that the device comprises a scheduling metric value calculating unit, a scheduling metric value post-processing unit and a scheduling object confirming unit; wherein,
the scheduling metric value calculating unit is used for calculating the metric value of each user; respectively acquiring the joint metric value of the user pairing combination and the corresponding user pairing combination under the number of each pairing user;
the scheduling metric post-processing unit is used for obtaining a maximum scheduling metric in the scheduling metrics and each maximum joint metric in the joint metrics under the number of each paired user, and updating the obtained maximum scheduling metric and each maximum joint metric by applying a reduction factor;
and the scheduling object confirming unit is used for taking the updated maximum scheduling metric value and the user or the user pair corresponding to the maximum value in the maximum joint metrics as the scheduling object.
7. The apparatus of claim 6, wherein when calculating the scheduling metric value, the scheduling metric value calculation unit is configured to:
traversing all the independent users to be scheduled, and calculating the metric value of the users; and the number of the first and second groups,
and traversing all the user pairing combinations containing different pairing user numbers, and calculating the joint metric value of each user pairing combination.
8. The apparatus of claim 7, wherein when calculating a joint metric value for a user pair, the scheduling metric value calculating unit is configured to:
calculating the metric value of each single user to be scheduled in the paired users, adding the calculated metric values of each single user to be scheduled, and taking the addition result as a joint metric value of the user pairing;
when calculating the metric value of a single user to be scheduled, the scheduling metric value calculating unit is configured to:
wherein β is a constant; vthruputRepresenting the completed throughput of the user within a specified statistical time period; when performing single-user scheduling, NbitRepresenting the number of bits that a user can correctly transmit under the current channel conditions;
when 2 users or more than 2 users are paired and scheduled, the current channel condition refers to: channel conditions subject to channel interference from other users in the pair-wise combination.
9. The apparatus according to any of claims 6 to 8, wherein, in performing the update, the scheduling metric value post-processing unit is configured to:
and multiplying the maximum scheduling metric value and each maximum joint metric value by a corresponding reduction factor respectively, and taking the product as the updated maximum scheduling metric value and each maximum joint metric value.
10. The apparatus of claim 9, further comprising a scheduling execution unit for scheduling the user to be scheduled.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102408657A CN102348287A (en) | 2010-07-24 | 2010-07-24 | Method and device for realizing user scheduling |
| PCT/CN2011/076701 WO2012013108A1 (en) | 2010-07-24 | 2011-06-30 | Method and apparatus for user scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102408657A CN102348287A (en) | 2010-07-24 | 2010-07-24 | Method and device for realizing user scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102348287A true CN102348287A (en) | 2012-02-08 |
Family
ID=45529409
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102408657A Pending CN102348287A (en) | 2010-07-24 | 2010-07-24 | Method and device for realizing user scheduling |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102348287A (en) |
| WO (1) | WO2012013108A1 (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007083185A2 (en) * | 2006-01-20 | 2007-07-26 | Nortel Networks Limited | Adaptive orthogonal scheduling for virtual mimo system |
| CN101222267A (en) * | 2007-01-08 | 2008-07-16 | 中兴通讯股份有限公司 | User matching method in MIMO transmission and method for confirming match factor |
| CN101388702A (en) * | 2007-09-11 | 2009-03-18 | 株式会社Ntt都科摩 | Adaptive pre-encoding method and device for MIMO system based on codebook |
| CN101399631A (en) * | 2007-09-30 | 2009-04-01 | 中兴通讯股份有限公司 | Precoding selection representing method under SU-MIMO mode and MU-MIMO mode |
| WO2009083782A2 (en) * | 2007-12-28 | 2009-07-09 | Nokia Corporation | Optimal user pairing for multiuser mimo |
| CN101496439A (en) * | 2007-08-31 | 2009-07-29 | 富士通株式会社 | Feedback device, feedback method, scheduling device and scheduling method |
| CN101557611A (en) * | 2009-05-15 | 2009-10-14 | 北京邮电大学 | Downlink multiuser selection method used for multi-aerial system |
-
2010
- 2010-07-24 CN CN2010102408657A patent/CN102348287A/en active Pending
-
2011
- 2011-06-30 WO PCT/CN2011/076701 patent/WO2012013108A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007083185A2 (en) * | 2006-01-20 | 2007-07-26 | Nortel Networks Limited | Adaptive orthogonal scheduling for virtual mimo system |
| CN101222267A (en) * | 2007-01-08 | 2008-07-16 | 中兴通讯股份有限公司 | User matching method in MIMO transmission and method for confirming match factor |
| CN101496439A (en) * | 2007-08-31 | 2009-07-29 | 富士通株式会社 | Feedback device, feedback method, scheduling device and scheduling method |
| CN101388702A (en) * | 2007-09-11 | 2009-03-18 | 株式会社Ntt都科摩 | Adaptive pre-encoding method and device for MIMO system based on codebook |
| CN101399631A (en) * | 2007-09-30 | 2009-04-01 | 中兴通讯股份有限公司 | Precoding selection representing method under SU-MIMO mode and MU-MIMO mode |
| WO2009083782A2 (en) * | 2007-12-28 | 2009-07-09 | Nokia Corporation | Optimal user pairing for multiuser mimo |
| CN101557611A (en) * | 2009-05-15 | 2009-10-14 | 北京邮电大学 | Downlink multiuser selection method used for multi-aerial system |
Non-Patent Citations (3)
| Title |
|---|
| YONG LI 等: "Combined Proportional Fair and Maximum Rate Scheduling for Virtual MIMO", 《VTC 2008》, 31 December 2008 (2008-12-31) * |
| 杨京艺 等: "LTE上行虚拟MIMO系统基于SINR的比例公平用户配对算法", 《电脑知识与技术》, vol. 6, no. 13, 31 May 2010 (2010-05-31) * |
| 聂永萍: "CoMP-MU-MIMO上行用户配对方案性能比较", 《数字通信》, no. 6, 31 December 2009 (2009-12-31) * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2012013108A1 (en) | 2012-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11671151B2 (en) | Efficient peak-to-average-power reduction for OFDM and MIMO-OFDM | |
| CN103763782B (en) | Dispatching method for MU-MIMO down link based on fairness related to weighting users | |
| CN106060872B (en) | A kind of heuristic proportional fair dispatching method that D2D coexists with cellular network | |
| Yang et al. | An auction approach to resource allocation in uplink OFDMA systems | |
| CN106034349B (en) | Transmission power control method and device | |
| Doumiati et al. | A framework of topological interference management and clustering for D2D networks | |
| Zhang et al. | Deep learning based user association in heterogeneous wireless networks | |
| CN101917768B (en) | User fairness resource allocation method for orthogonal frequency division multiple access relay system | |
| CN102300326B (en) | Scheduling method of multi-user multi-input multi-output (MIMO) communication system and base station | |
| Leng et al. | Client scheduling in wireless federated learning based on channel and learning qualities | |
| CN114423028B (en) | CoMP-NOMA cooperative clustering and power distribution method based on multi-agent deep reinforcement learning | |
| CN104144039A (en) | Coherence-time-based pilot frequency distribution method for large-scale MIMO system | |
| CN106209188B (en) | Pilot pollution reduction method based on partial pilot frequency alternate multiplexing in large-scale MIMO system | |
| CN102891822B (en) | Resource distribution method of multi-user OFDM (Orthogonal Frequency Division Multiplexing) system | |
| Haci | Non-orthogonal multiple access (NOMA) with asynchronous interference cancellation | |
| CN111682915B (en) | Self-allocation method for frequency spectrum resources | |
| CN102685903B (en) | Resource distribution method based on partial channel information in orthogonal frequency division multiple access (OFDMA) system | |
| CN103369647A (en) | Multi-wire power distribution method and device | |
| CN105072686A (en) | Wireless resource distribution method based on OFDMA relay network | |
| Saraiva et al. | Energy efficiency maximization under minimum rate constraints in multi-cell MIMO systems with finite buffers | |
| CN103703854B (en) | User scheduling method and device | |
| Huang et al. | Design of low-latency uplink MAC scheduling for Massive MIMO-OFDM systems | |
| CN102348287A (en) | Method and device for realizing user scheduling | |
| Ahmad et al. | Robust channel quality indicator reporting for multi-carrier and multi-user systems | |
| CN101102151B (en) | Scheduling method and system for space division multiple access system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120208 |