CN101557611A - Downlink multiuser selection method used for multi-aerial system - Google Patents
Downlink multiuser selection method used for multi-aerial system Download PDFInfo
- Publication number
- CN101557611A CN101557611A CNA2009100845223A CN200910084522A CN101557611A CN 101557611 A CN101557611 A CN 101557611A CN A2009100845223 A CNA2009100845223 A CN A2009100845223A CN 200910084522 A CN200910084522 A CN 200910084522A CN 101557611 A CN101557611 A CN 101557611A
- Authority
- CN
- China
- Prior art keywords
- user
- collaboration
- group
- priority
- total
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000010187 selection method Methods 0.000 title abstract description 7
- 238000000034 method Methods 0.000 claims abstract description 62
- 238000012804 iterative process Methods 0.000 claims abstract description 5
- 230000005540 biological transmission Effects 0.000 claims description 35
- 239000011159 matrix material Substances 0.000 claims description 11
- 238000005457 optimization Methods 0.000 claims description 8
- 238000005562 fading Methods 0.000 claims description 7
- 230000007423 decrease Effects 0.000 claims description 4
- 238000012217 deletion Methods 0.000 claims description 4
- 230000037430 deletion Effects 0.000 claims description 4
- 238000013461 design Methods 0.000 claims description 4
- 238000011017 operating method Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000012360 testing method Methods 0.000 description 5
- 238000011161 development Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000001174 ascending effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 229940050561 matrix product Drugs 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
Images
Abstract
The invention relates to a downlink multiuser selection method used for a multi-aerial system, which defines a total user set, a prioritized user set and a candidate user set; a base station selects users with maximum weight value from the prioritized user set as first users, selects users with maximum orthogonal component projected on spanning space of selected user channel vector from the candidate user set by an iterative process so as to form a collaborative user group; the prioritized user set is updated and continues to iterate so as to form a new collaborative user group till the prioritized user set is empty; and then a user group with maximum weight value sum is selected from the formed collaborative user group as a target user group when the base station schedules. On the basis of guaranteeing lower computational complexity, the method better utilizes multiuser diversity gain, improves the performance of scheduling algorithm, not only fully utilizes multiuser channel characteristics, but also considers other characteristics of the user.
Description
Technical field
The present invention relates to a kind of descending multi-user system of selection that is used for multiaerial system, that is to say that relate to a kind of base station many dual-mode antennas are set, the user disposes the descending multi-user multiple antenna communication of single antenna, select user's method, belong to MIMO aerial radio communication technical field.
Background technology
Along with the fast development of wireless communication technology, the wretched insufficiency of frequency spectrum resource has become " bottleneck " of radio communication career development.Multi-antenna technology can be under the situation that does not increase bandwidth and antenna transmitting power because of it, improves frequency efficiency exponentially and obtains extensive favor.And in the practical communication system, the base station can dispose many antennas at an easy rate, but terminal is subjected to the restriction of aspects such as equipment size, hardware complexity, manufacturing cost, and the antenna of configuration is very limited usually, and this has also limited the spatial multiplexing gain of multiaerial system.
For on the basis of existing terminal hardware configuration, obtain higher many antenna gains, the transmission means that adopts the base station to serve for a plurality of users simultaneously usually.Theoretical proof, dirty paper code (DPC, Dirty PaperCoding) can reach the capacity of many antennas down channel, and still, dirty paper code needs complicated Nonlinear Processing, and therefore, this technology is also impracticable.Zero-forcing beamforming ZFBF technology is by signal being carried out simple linear process, just transmission channel can be separated into a plurality of independently parallel channels, and when user's number during much larger than number of transmit antennas, the zero-forcing beamforming technology can be approached the performance of DPC.Therefore, zero-forcing beamforming is a kind of wireless communication technology scheme of practical multi-antenna multi-user.
In general, have only, could obtain optimum zero-forcing beamforming user set by exhaustive search.But when number of users was very big, the complexity of exhaustive search was too high.Therefore, adopt the suboptimal design of some low complex degrees to select wave beam forming user set in the reality usually.
At present, mainly contain two kinds of user choosing methods:
First kind is greedy user choosing method, and this is that a kind of direct overall transmission rate with the multi-user is the user choosing method of optimization aim.Concrete grammar is: select the highest user of achievable rate earlier by scheduler.Then, in each iteration, calculates the overall transmission rate of new user's set that remaining each user and the collaboration user of having selected form, select user's set of overall transmission rate maximum again, gather as the new user of this iteration.If when the set of newly-increased Any user all can not increase overall transmission rate or reach schedulable maximum number of user, then this flow process finished.
Because greedy user choosing method all will calculate total speed of all collaboration user combinations in each iteration, therefore, the computation complexity of this method is higher.
Second kind is the semi-orthogonal user choosing method, and the thinking of this method is to utilize the two-dimensional signal of channel quality and channel direction to characterize user's transmission rate.By selecting the user of nearly orthogonal, reduce between multi-user's stream as far as possible and disturb, thereby optimize multi-user's overall transmission rate indirectly.Concrete grammar is: scheduler is selected the user of channel quality optimum earlier.Then, select successively, until constituting the dispatched users set the user who selects the quadrature component maximum of projection on the channel vector span at family for use.
Because semi-orthogonal user back-and-forth method is to utilize the two-dimensional signal of channel quality and channel direction to characterize transmission rate, need multi-user's composite channel matrix not done inverse operation calculate overall transmission rate in iterative process.Therefore, it is the lower multi-user's selection algorithm of a kind of complexity.But, in the semi-orthogonal algorithm, a thresholding that characterizes user's orthogonality need be set.If this threshold parameter is provided with too smallly, will cause the reduction of multi-user diversity gain; And that threshold setting gets is too high, causes easily between too big stream again and disturbs.Therefore, must come this threshold parameter of optimization by emulation repeatedly.
Above-mentioned two kinds of user choosing methods all are that the user with channel quality the best is that benchmark carries out the user and selects.The hunting zone of this mode is very limited, has limited multi-user's diversity gain.
Therefore, how to develop and a kind ofly new can effectively improve multi-user diversity gain, can guarantee the user choosing method of lower computation complexity again, just become focus and new problem that scientific and technical personnel in the industry pay close attention to.
Summary of the invention
In view of this, the purpose of this invention is to provide a kind of descending multi-user system of selection that is used for multiaerial system, the inventive method has solved prior art problems preferably, can either guarantee lower computation complexity, can utilize multi-user diversity gain better again, improve the performance of dispatching algorithm, on the basis that as far as possible makes full use of the multiuser channel characteristic, take into account other characteristics such as business, time delay and justice of user.
In order to achieve the above object, the invention provides a kind of descending multi-user system of selection that is used for multiaerial system, it is characterized in that: from the user that remains to be served, the base station selected channel rapid fading cycle, the user greater than predetermined threshold value constituted total user's set; And design the corresponding weights factor according to user personality, select suitable user to constitute the priority user set; From the priority user set, select the user of weights maximum first user then as each collaboration user group; Again by iterative process, from candidate user set, be chosen in the collaboration user group user of the quadrature component maximum of projection on the subscriber channel vector span, add the collaboration user group; After constituting the collaboration user group, the set of renewal priority user continues interative computation, forms new collaboration user group, up to priority user set for empty, the targeted group of user's group of from all collaboration user groups that constituted, selecting weights summation maximum again during as base station scheduling.
Technological innovation part of the inventive method and beneficial effect include following many-sided content:
The notion of the priority user set that the present invention proposes can more effectively be utilized multi-user's diversity gain.In traditional semi-orthogonal algorithm, directly the user with channel quality the best selects the user as benchmark, has limited the user search scope, has reduced multi-user diversity gain.And the present invention sets up the priority user set earlier, carries out user's selection based on this priority user set again.And all constitute a collaboration user group at each priority user, and after more a plurality of at last collaboration user groups, the targeted group when obtaining dispatching.If in being controlled at the number of priority user more among a small circle, the present invention can effectively increase the performance that the user selects under the prerequisite that guarantees low computation complexity.
Priority user set of the present invention can take into account other characteristics such as business, time delay and justice of user better on the basis that guarantees dispatched users interchannel orthogonality.When scheduler when selecting the user, if need to consider the different user characteristic, only need step (2) in the methods of the invention to revise the scheduling of resource criterion, and get final product at the selection criterion that step (5) is revised the collaboration user group.
Such as, in order to take into account user fairness, only need to make in above-mentioned two steps following modification:
In the step (2), revise scheduling of resource criterion c (k), make c (k) comprise user's channel quality factor and fairness factor simultaneously.A kind of method for expressing of c (k) is:
In the formula, P is total transmitting power, and M is the number of transmit antennas of base station, h
kBe k user's channel vector, ‖ h
k‖ asks channel vector h
kThe 2-norm, u
k(t) be k user in the t equitable proportion factor constantly:
In the formula, t
cBe equitable proportion PF (Proportional Fair) scheduling average time window duration, S
MBe t user's set of base station scheduling constantly, R
k(S
M, be that k user is in t transmission rate constantly t).
In the step (5),, revise the expression formula of the total speed of weighting for taking into account overall transmission rate and user fairness:
Traditional prior art is to take into account other characteristics of user by revising user's selection criterion.This mode is to take into account other characteristics of user with the orthogonal property of sacrificing channel between the user, therefore can not make the pairing optimization between the user.And in the present invention, the factor that relates to user's different qualities just acts in the comparison of the selection of priority user and collaboration user group, only considers user's the characteristic of channel when step (3) is selected the user.Therefore, the present invention can take into account user's different qualities better on the basis that makes full use of the multiuser channel characteristic.
The inventive method is simple, flexible, and by the different thresholdings or the maximum number of user of priority user set are set, the complexity that just can regulate algorithm is to be applicable to the transmission end of base station of different disposal ability.When adopting threshold method, thresholding α=1, then the priority user set only comprises the maximum user of scheduling of resource criterion c (k) value; α=0, then the priority user set is total user's set.Thresholding α is big more, and the element number in the priority user set is few more, and computation complexity is low more, and still, corresponding cost is that multi-user diversity gain is also more little.Therefore, the transmitting terminal that disposal ability is strong can be provided with α lower, as, get α=0.5; And the low transmitting terminal of disposal ability can be provided with α higher, as, get α=0.7.If adopt fixed-line subscriber number method, the transmitting terminal that disposal ability is strong can be provided with number of users higher, as, get | U|=0.2|S|, | S| represents the element number gathered.And the low transmitting terminal of disposal ability can be provided with number of users lower, such as, get | U|=0.1|S|.
Computation complexity of the present invention is lower.When wherein step (3) selects the user to make up the collaboration user group, similar with traditional semi-orthogonal user selection algorithm, promptly when selecting the user, only need to consider the channel quality of candidate user, and candidate user and selected the orthogonality of family interchannel for use.Therefore,, only need calculate a matrix product in step (2), calculate the once 2-norm of vector, calculate an inner product in step (4) in step (3) for each candidate user in each iteration.And after the collaboration user group formed, the matrix inversion that tries again obtained the beam shape-endowing weight value matrix.And in order to compare overall transmission rate, greedy user's selection algorithm all must carry out one time matrix inversion operation in each iteration.Therefore, computation complexity of the present invention is at most traditional semi-orthogonal multi-user selection method | and U| doubly belongs to the low multi-user selection method of computation complexity.In a word, the present invention has good popularization and application prospect.
Description of drawings
Fig. 1 is the wireless communication system schematic diagram that the inventive method is suitable for.
Fig. 2 is that the base station functions module is formed schematic diagram.
Fig. 3 is traditional semi-orthogonal multi-user selection method flow chart.
Fig. 4 is the descending multi-user system of selection flow chart that the present invention is used for multiaerial system.
Fig. 5 is that the throughput ratio of different priority user numbers among the emulation embodiment of the present invention is than schematic diagram.
Fig. 6 be among the emulation embodiment of the present invention throughput ratio than schematic diagram.
Fig. 7 is that fairness compares schematic diagram among the emulation embodiment of the present invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
Referring to Fig. 1, introduce the basic framework of descending multi-antenna multi-user communication system: include a base station and a plurality of terminal use.Many transmitting antennas of base station configuration, each terminal use disposes single reception antenna.When only being used for receive diversity, can equivalence be the situation of single antenna if the user has disposed many antennas.
Referring to Fig. 2, introduce one and be applicable to base station functions block diagram of the present invention.In order to use multi-user selection method of the present invention.The base station is wanted the configuration schedules device at least, three functional modules of chnnel coding and wave beam forming.Suppose to have K user's data stream to arrive the base station simultaneously.M the user that the user serves under this time slot as the base station that scheduler will be selected from K user earlier.Then, this M data are encoded and power division via independent channel respectively, and multiply by the wave beam forming vector, deliver to M transmitting antenna at last and send.Wave beam forming makes the base station to transmit data for a plurality of users simultaneously on identical running time-frequency resource.In order to simplify the selection of weight vector, adopt zero-forcing beamforming ZFBF method here.The wave beam forming vector of ZFBF can obtain by channel matrix is done inverse operation simply.
Referring to Fig. 3, introduce traditional semi-orthogonal multi-user selection method.At first, the base station utilizes ascending pilot channel or feedback information to obtain each user's channel matrix, therefrom selects the channel rapid fading cycle to constitute candidate user set greater than the user of predetermined threshold value.Then, calculate the weights C (k) of each candidate user.If scheduling only needs to consider optimization user's overall transmission rate, then C (k) is the function that only characterizes user channel quality, as C (k)=‖ g
k‖, in the formula, g
kFor user k at the quadrature component of selecting projection on the channel vector span of family for use, ‖ g
k‖ represents to ask vectorial g
kThe 2-norm.If scheduling needs to consider other characteristics such as business, time delay or justice of user, then can in C (k), add the corresponding factor and characterize corresponding characteristic.Such as, in order to take into account fairness, C (k) can be revised as:
In the formula, P is total transmitting power, and M is the number of transmit antennas of base station, g
kThe channel vector that is user k is at the quadrature component of selecting projection on the channel vector space, family for use, ‖ g
k‖ represents to ask vectorial g
kThe 2-norm, u
k(t) be that user k is in the t equitable proportion factor constantly.
After calculating the weights of each candidate user, the user of weights maximum is selected in the base station, and leaves out in the candidate user set user that the orthogonality with this user does not satisfy condition, and upgrades candidate user set.Carry out repeatedly interative computation then, until selecting M user or candidate user set for empty.As can be seen, traditional semi-orthogonal algorithm is to sacrifice the fairness of channel between the user, to take into account other characteristics of user.
Referring to Fig. 4, introduce the flow chart of the semi-orthogonal user selection algorithm that the present invention is based on the priority user set.
The present invention be from the user that remains to be served, the user of base station selected channel rapid fading cycle greater than predetermined threshold value constitutes total user's S set; And, design the corresponding weights factor according to user personality, select suitable user to constitute priority user set U; From the priority user set, select the user of weights maximum then as collaboration user group S
0First user.By iterative process, from candidate user set, be chosen in collaboration user group S
0The user of the quadrature component maximum of projection adds collaboration user group S on the middle subscriber channel vector span
0After constituting the collaboration user group, the set of renewal priority user continues interative computation, forms new collaboration user group, up to priority user set U be empty, the targeted group the when user who selects weights summation maximum again from all collaboration user groups that constituted organizes as base station scheduling.
Following mask body is introduced each operating procedure of the inventive method:
The constructive method of priority user set has three kinds: threshold setting method, fixed-line subscriber are counted method, thresholding and fixed-line subscriber and are counted combination method
The concrete operations content of first kind of threshold setting method is described earlier: suppose that the scheduling of resource criterion is c (k), in the formula, natural number k is user's sequence number, and its maximum number is K; The judgment formula that then constitutes the priority user set is:
Wherein, the span of threshold value α is [0,1],
The maximum user's sequence number of c (i) value is chosen in expression from total user's S set;
If only consider optimization user's overall transmission rate, then scheduling of resource criterion c (k) is represented by the functional expression of following two kinds of users' channel matrix:
C (k)=‖ h
k‖, wherein, h
kThe channel vector of representing k user, and this channel vector comprises the influence of large scale decline and small scale decline, ‖ h simultaneously
k‖ represents to ask channel vector h
kThe 2-norm; Or
C (k)=SINR
k, wherein, SINR
kIt is k user's received signal interference-to-noise ratio.
If take into account optimization user's overall transmission rate and user fairness simultaneously, then this scheduling of resource criterion c (k) comprises user's channel quality factor and fairness factor; The functional expression of a kind of dispatching criterion c (k) of this moment is:
Wherein, P represents total transmitting power, and M represents the number of transmit antennas of base station, h
kThe channel vector of representing k user, ‖ h
k‖ represents to ask channel vector h
kThe 2-norm, u
k(t) be k user in the t equitable proportion factor constantly:
Wherein, t
cExpression equitable proportion PF scheduling average time window duration, S
MRepresent user's set of the base station scheduling of anti-the quarter, R
k(S
M, t) k user of expression is in t transmission rate constantly.
Illustrate that again second kind of fixed-line subscriber count the concrete operations content of method: to each user in total user's set, the numerical values recited according to its scheduling of resource criterion c (k) sorts earlier, and m user constitutes priority user and gather before selecting again; M is a constant, or is set to a ratio value of total number of users.
The content of operation that the third thresholding and fixed-line subscriber are counted combination method is: after earlier each user in total user's set being sorted by its c (k) numerical values recited, select preceding m user, again from this m user select c (k) numerical value greater than
The user, it is designated priority user.
Step 3, structure T
GIndividual collaboration user group, the number of users of each collaboration user group is not more than the base station transmit antennas number, and first user is the user of scheduling of resource criterion c (k) numerical value maximum in the priority user set, and all the other users adopt traditional semi-orthogonal algorithm iteration to select.This step can be divided into following five processing procedures again:
(31) the collaboration user group is set respectively is that empty set, candidate user set are total user set and subscriber's meter i=1 in initialization;
(32), calculate its channel vector h according to the following equation respectively to each user in the candidate user set
kAt { g
(1)..., g
(i-1)The quadrature component of projection on the space that generates:
Wherein, natural number k is user's sequence number, g
(j)The quadrature component of representing subscriber channel vector projection on the channel vector space that preceding (j-1) step iteration is selected that j step iteration is selected, g
(j) *Expression channel vector g
(j)Conjugate transpose, ‖ g
(j)‖ represents to ask channel vector g
(j)The 2-norm; And when subscriber's meter i=1, g
k=h
k
(33) when subscriber's meter i=1, from the priority user set, select the maximum user of c (k) value, note is π (i); When subscriber's meter i＞1, from candidate user set, select ‖ g
kThe user that the ‖ value is maximum, note is π (i); π (i) is i user of collaboration user group, with the i quadrature component g in step
(i)Assignment is g
π (i), the vector space of expansion collaboration user group;
(34) judge number of users in this collaboration user group whether less than the number of transmit antennas of base station, if, each user's channel vector and g in first calculated candidate user's set
(i)Angle, and angle described in the deletion candidate user set is less than the user of predetermined threshold value, to guarantee the quadrature performance of interchannel; At this moment, judge whether candidate user set is not empty, if then subscriber's meter i adds 1, returns the operation of execution in step (32), otherwise, the subsequent step operation carried out;
(35) with this collaboration user group as the T that includes priority user
GIndividual collaboration user group.
Step 4, the set of renewal priority user, judge whether to continue to make up next collaboration user group: if satisfy following two conditions: the priority user set that the element in the collaboration user group not all belongs to after priority user set and the renewal is non-NULL, then collaboration user set of counters T
GAdd 1, return the operation of execution in step 3; Otherwise, no longer making up the collaboration user group, execution in step 5 is selected the operation of best collaboration user group;
The calculating expression of the total speed of this step weighting is that the user personality of optimizing is as required set, if only optimize overall transmission rate, then the computing formula of the total speed w of weighting is:
In the formula, S
nBe n the collaboration user group that has constituted, R
k(S
n) be that the base station is collaboration user group S
nIn all users when serving simultaneously, the transmission rate of k user's correspondence.
If take into account overall transmission rate and user fairness is dispatched, then the computing formula of the total speed of weighting is:
In the formula, u
k(t) be that k user is at the t equitable proportion factor constantly, S
nN the collaboration user group that expression has constituted, R
k(S
n, t) being illustrated in t moment base station is collaboration user group S
nIn all users when serving simultaneously, the transmission rate of k user's correspondence.
From the inventive method of above-mentioned introduction as can be seen, transmission end of base station must be known the channel condition information that each terminal use is complete, could carry out the descending multi-user transmission well.Therefore, it is lower that the present invention only is suitable for translational speed, can determine the user of channel matrix.Therefore, in step 1, the user that be lower than predetermined threshold value the channel rapid fading cycle leaves out from total user's set.In the TDD system, can utilize uplink pilot signal to estimate user's down channel.In the FDD system, need utilize feedback information to obtain channel condition information.
The present invention has carried out repeatedly emulation and has implemented test, introduces the test situation of embodiment below:
Referring to Fig. 5,, in the inventive method the fixed-line subscriber number that is provided with is divided into two kinds of situations: always 0.1 and 0.2 times of number of users for investigating the setting of priority user number.SUS among the figure represents traditional semi-orthogonal user selection algorithm (not considering fairness), PF-SUS represents the algorithm that traditional SUS combines with PF, and the inventive method is based on the semi-orthogonal algorithm (the priority user selection criterion is taken into account transmission rate and two characteristics of fairness of user) of priority user set.Following table is that the parameter of embodiment system is provided with situation:
| The transmitting antenna number | 4 |
| The |
1 |
| Total user's |
20～100 |
| Total transmitting power P | 10dB |
As can be seen from Figure 5, to count Unum be that the performance of two kinds of result of the tests of 0.1 and 0.2 times of total number of users is approaching substantially to priority user.Both differences reduce along with the increase of user's number.Therefore, be lower than at 50 o'clock, get the priority user number and be total number of users 0.2 times at number of users; At number of users greater than 50 o'clock, get the priority user number and be total number of users 0.1 times.Perhaps consider, the priority user number is fixed as 0.1 times of total number of users from reducing complexity.
In the inventive method, the another kind of construction method of priority user set is the threshold setting method, promptly dynamically arranges threshold value according to optimal user, promptly
0≤α≤1; Wherein, thresholding α is the variable of value between 0～1;
The maximum user's sequence number of c (i) value is chosen in expression from total user's S set.
Among the emulation embodiment, choose α=0,0.6,0.7,0.8 and 0.9 respectively, and the priority user number is set is at most 0.1 times of total number of users.Implement test by emulation, draw when α≤0.7, performance not have to lose substantially; And when α 〉=0.8, performance begins decay.Therefore, α is set to 0.7.
Suppose to adopt thresholding and fixed-line subscriber to count combination method and screen priority user, choose the priority user number and be total number of users 0.1 times, α=0.7.At this moment, the performance of the inventive method and SUS, PF-SUS method is carried out throughput ratio result, as shown in Figure 6.
As can be seen from Figure 6, the performance that the present invention is based on the semi-orthogonal algorithm of priority user set is better than traditional PF-SUS algorithm.At number of users less than 50 o'clock, the performance of the inventive method even be better than not considering traditional SUS algorithm of user fairness.This has improved multi-user diversity gain because of the inventive method and has caused.
The throughput of knowing the inventive method by Fig. 6 is better than PF-SUS, investigates the fair characteristic of the inventive method below.In order to investigate the user fairness characteristic more significantly, the received signal intensity of supposing the user is exponential distribution by user's sequence number.The received signal intensity of promptly supposing user k is: (0.4 * k/10)/M, wherein, M is a number of transmit antennas to RSS (k)=10^.
The result of this test is referring to shown in Figure 7, its conclusion is: when user's received signal intensity during with the sequence number exponential increase, the fair characteristic of SUS algorithm of not considering user fairness is very poor, the user of the user's that received signal is strong average transmission rate a little less than far above received signal.But PF-SUS method and the inventive method have weakened this otherness significantly, and therefore, PF-SUS method and the inventive method can be taken into account user fairness preferably.
Can get thus, compare with traditional PF-SUS algorithm, increased some computation complexities although the present invention is based on the semi-orthogonal user selection algorithm of priority user set,, can improve overall transmission rate, and guarantee to reach the user fairness characteristic almost identical with the PF-SUS algorithm. Also can more effectively take into account exactly user's channel characteristic and fair characteristic.
Claims (7)
1, a kind of descending multi-user system of selection that is used for multiaerial system is characterized in that: from the user that remains to be served, the base station selected channel rapid fading cycle, the user greater than predetermined threshold value constituted total user's set; And design the corresponding weights factor according to user personality, select suitable user to constitute the priority user set; From the priority user set, select the user of weights maximum first user then as each collaboration user group; Again by iterative process, from candidate user set, be chosen in the collaboration user group user of the quadrature component maximum of projection on the subscriber channel vector span, add the collaboration user group; After constituting the collaboration user group, the set of renewal priority user continues interative computation, forms new collaboration user group, up to priority user set for empty, the targeted group of user's group of from all collaboration user groups that constituted, selecting weights summation maximum again during as base station scheduling.
2, method according to claim 1 is characterized in that: this method comprises following operating procedure:
(1) the total user's set of initialization: will have the downlink business requesting users to put into total user's set, and utilize up pilot frequency information or feedback information to obtain the channel matrix of each user in this total user's set, the deletion rapid fading cycle is improved the accuracy of channel matrices estimation less than the user of predetermined threshold value from this total user's set again;
(2) from described total user's set, select suitable user according to the scheduling of resource criterion and constitute the priority user set, and initialization collaboration user set of counters T
G=1, collaboration user set of counters T
GBe used for identifying the collaboration user group number that has constituted;
(3) make up T
GThe collaboration user group, the number of users of each collaboration user group is not more than the base station transmit antennas number, and first user is the user of scheduling of resource criterion c (k) numerical value maximum in the priority user set, and all the other users adopt traditional semi-orthogonal algorithm iteration to select;
(4) renewal priority user set judges whether to continue to make up next collaboration user group: if satisfy following condition: the priority user set that the element in the collaboration user group not all belongs to after priority user set and the renewal is non-NULL, then collaboration user set of counters T
GAdd 1, return the operation of execution in step (3); Otherwise, no longer making up the collaboration user group, execution in step (5) is selected the operation of best collaboration user group;
(5), calculate the total speed of weighting of all collaboration user groups, and incite somebody to action the targeted group when wherein the user of weights maximum organizes as scheduling according to resource scheduling algorithm.
3, method according to claim 2 is characterized in that: in the described step (2), the method for selecting suitable user to constitute the priority user set comprises: threshold setting method, fixed-line subscriber are counted method and thresholding and fixed-line subscriber and are counted combination method.
4, method according to claim 3 is characterized in that: the concrete operations of described threshold setting method the contents are as follows:
Suppose that the scheduling of resource criterion is c (k), in the formula, natural number k is user's sequence number, and its maximum number is K; The judgment formula that then constitutes the priority user set is:
Wherein, the span of threshold value α is [0,1],
The maximum user's sequence number of c (i) value is chosen in expression from total user's S set;
If only consider optimization user's overall transmission rate, then scheduling of resource criterion c (k) is represented by the functional expression of following two kinds of users' channel matrix:
C (k)=|| h
k||, wherein, h
kThe channel vector of representing k user, and this channel vector comprises the influence that large scale decline and small scale decline simultaneously, || h
k|| channel vector h is asked in expression
kThe 2-norm; Or
C (k)=SINR
k, wherein, SINR
kIt is k user's received signal interference-to-noise ratio;
If take into account optimization user's overall transmission rate and user fairness simultaneously, then this scheduling of resource criterion c (k) comprises user's channel quality factor and fairness factor; The functional expression of the dispatching criterion c (k) of this moment is:
Wherein, P represents total transmitting power, and M represents the number of transmit antennas of base station, h
kThe channel vector of representing k user, || h
k|| channel vector h is asked in expression
kThe 2-norm, u
k(t) be k user in the t equitable proportion factor constantly:
Wherein, t
cThe expression Proportional Fair average time window duration, S
MExpression t is user's set of base station scheduling constantly, R
k(S
M, t) k user of expression is in t transmission rate constantly.
5, method according to claim 3, it is characterized in that: the concrete operations that described fixed-line subscriber is counted method the contents are as follows: to each user in total user's set, numerical values recited according to its scheduling of resource criterion c (k) sorts earlier, and m user constitutes the priority user set before selecting again; M is a constant, or is set to a ratio value of total number of users;
Described thresholding and fixed-line subscriber are counted combination method: after earlier each user in total user's set being sorted by its c (k) numerical values recited, select preceding m user, from this m user, select again c (k) numerical value greater than
The user, it is designated priority user.
6, method according to claim 2 is characterized in that: described step (3) further comprises following content of operation:
(31) the collaboration user group is set respectively is that empty set, candidate user set are total user set and subscriber's meter i=1 in initialization;
(32), calculate its channel vector h according to the following equation respectively to each user in the candidate user set
kAt { g
(1)..., g
(i-1)The quadrature component of projection on the space that generates:
Wherein, natural number k is user's sequence number, g
(j)The quadrature component of representing subscriber channel vector projection on the channel vector space that preceding (j-1) step iteration is selected that j step iteration is selected, g
(j) *Expression channel vector g
(j)Conjugate transpose, || g
(j)|| channel vector g is asked in expression
(j)The 2-norm; And when subscriber's meter i=1, g
k=h
k
(33) when subscriber's meter i=1, from the priority user set, select the maximum user of c (k) value, note is π (i); When subscriber's meter i＞1, from candidate user set, select || g
k|| the user that value is maximum, note is π (i); π (i) is i user of collaboration user group, with the i quadrature component g in step
(i)Assignment is g
π (i), the vector space of expansion collaboration user group;
(34) judge number of users in this collaboration user group whether less than the number of transmit antennas of base station, if, each user's channel vector and g in first calculated candidate user's set
(i)Angle, and angle described in the deletion candidate user set is less than the user of predetermined threshold value, to guarantee the quadrature performance of interchannel; At this moment, judge whether candidate user set is not empty, if then subscriber's meter i adds 1, returns the operation of execution in step (32), otherwise, the subsequent step operation carried out;
(35) with this collaboration user group as the T that includes priority user
GIndividual collaboration user group.
7, method according to claim 2 is characterized in that: in the described step (5), the calculating expression of the total speed of described weighting is that the user personality of optimizing is as required set,
If only optimize overall transmission rate, then the computing formula of the total speed w of weighting is:
In the formula, S
nN the collaboration user group that expression has constituted, R
k(S
n) represent that the base station is collaboration user group S
nIn all users when serving simultaneously, the transmission rate of k user's correspondence;
If take into account overall transmission rate and user fairness is dispatched, then the computing formula of the total speed of weighting is:
In the formula, u
k(t) be that k user is at the t equitable proportion factor constantly, S
nN the collaboration user group that expression has constituted, R
k(S
n, t) being illustrated in t moment base station is collaboration user group S
nIn all users when serving simultaneously, the transmission rate of k user's correspondence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100845223A CN101557611B (en) | 2009-05-15 | 2009-05-15 | Downlink multiuser selection method used for multi-aerial system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100845223A CN101557611B (en) | 2009-05-15 | 2009-05-15 | Downlink multiuser selection method used for multi-aerial system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101557611A true CN101557611A (en) | 2009-10-14 |
| CN101557611B CN101557611B (en) | 2011-01-19 |
Family
ID=41175500
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100845223A Active CN101557611B (en) | 2009-05-15 | 2009-05-15 | Downlink multiuser selection method used for multi-aerial system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101557611B (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854235A (en) * | 2010-04-06 | 2010-10-06 | 中国人民解放军信息工程大学 | User selection method and device in multi-input multi-output system |
| CN102130709A (en) * | 2011-04-20 | 2011-07-20 | 中国科学技术大学 | Multiple-input multiple-output (MIMO) multicasting beamforming method |
| CN102186212A (en) * | 2011-04-08 | 2011-09-14 | 中兴通讯股份有限公司 | Intercell cooperation scheduling method, system and user equipment |
| CN102196369A (en) * | 2010-03-18 | 2011-09-21 | 华为技术有限公司 | Method for selecting and grouping users in multi-antenna system, and communication device |
| CN102324954A (en) * | 2011-05-18 | 2012-01-18 | 西安电子科技大学 | Cooperation combination preferable method based on synchronous constraint and signal channel energy rules |
| WO2012010027A1 (en) * | 2010-07-23 | 2012-01-26 | 中兴通讯股份有限公司 | User scheduling method and system based on mimo system |
| CN102348287A (en) * | 2010-07-24 | 2012-02-08 | 中兴通讯股份有限公司 | Method and device for realizing user scheduling |
| CN103701577A (en) * | 2013-12-11 | 2014-04-02 | 北京邮电大学 | Pilot frequency distribution method for inhibiting pilot frequency pollution in cloud wireless access network |
| CN104168659A (en) * | 2014-08-19 | 2014-11-26 | 东南大学 | Multi-cell MIMO system user scheduling method under MRT pre-coding strategy |
| CN104302006A (en) * | 2014-09-02 | 2015-01-21 | 饶品魁 | Distributed type multi-antenna network overall scheduling system |
| WO2015027601A1 (en) * | 2013-08-27 | 2015-03-05 | 东南大学 | A method for multi-user scheduling of low complexity based on replacement |
| CN104539328A (en) * | 2014-12-05 | 2015-04-22 | 江苏省邮电规划设计院有限责任公司 | Delay-aware-based semi-orthogonal scheduling method in multi-user system |
| WO2016179779A1 (en) * | 2015-05-11 | 2016-11-17 | 华为技术有限公司 | Semi-orthogonal transmission-based communication method and device |
| CN106788650A (en) * | 2016-12-16 | 2017-05-31 | 中国电子科技集团公司第二十研究所 | A kind of cooperation close-to zero beam manufacturing process based on orthogonal project operator |
| CN106789772A (en) * | 2016-12-29 | 2017-05-31 | 深圳天珑无线科技有限公司 | A kind of safety communicating method and device |
| CN106921421A (en) * | 2015-12-25 | 2017-07-04 | 展讯通信（上海）有限公司 | Bluetooth route system, bluetooth route sending and receiving method |
| CN109802911A (en) * | 2019-01-21 | 2019-05-24 | 浙江大学 | A kind of Fast Channel estimation and signal synchronizing method suitable for underwater acoustic modem |
| CN111711473A (en) * | 2020-06-18 | 2020-09-25 | 西安电子科技大学 | Massive MIMO user selection method based on position information |
| CN114614963A (en) * | 2022-03-16 | 2022-06-10 | 北京航空航天大学 | Alternative optimization iterative user group selection method, electronic device and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1838558A (en) * | 2005-03-25 | 2006-09-27 | 松下电器产业株式会社 | Transmitting antenna selecting method and apparatus in multi-antenna multi-user communication system |
| CN101047414A (en) * | 2006-04-01 | 2007-10-03 | 中国科学技术大学 | Downlink multi-user method combined with receiving antenna selection and close-to zero beam forming |
| CN101252420B (en) * | 2008-04-02 | 2012-02-22 | 中国科学院计算技术研究所 | System and method of multi-user multi-aerial transmission |
| CN101257368B (en) * | 2008-04-09 | 2011-03-02 | 中国科学技术大学 | Multiuser scheduling method based on Tomlinson and Hashim precoding |
-
2009
- 2009-05-15 CN CN2009100845223A patent/CN101557611B/en active Active
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102196369B (en) * | 2010-03-18 | 2014-03-12 | 华为技术有限公司 | Method for selecting and grouping users in multi-antenna system, and communication device |
| CN102196369A (en) * | 2010-03-18 | 2011-09-21 | 华为技术有限公司 | Method for selecting and grouping users in multi-antenna system, and communication device |
| CN101854235B (en) * | 2010-04-06 | 2013-04-10 | 中国人民解放军信息工程大学 | User selection method and device in multi-input multi-output system |
| CN101854235A (en) * | 2010-04-06 | 2010-10-06 | 中国人民解放军信息工程大学 | User selection method and device in multi-input multi-output system |
| CN102340879A (en) * | 2010-07-23 | 2012-02-01 | 中兴通讯股份有限公司 | User scheduling method and system based on MIMO (multiple input multiple output) system |
| WO2012010027A1 (en) * | 2010-07-23 | 2012-01-26 | 中兴通讯股份有限公司 | User scheduling method and system based on mimo system |
| CN102348287A (en) * | 2010-07-24 | 2012-02-08 | 中兴通讯股份有限公司 | Method and device for realizing user scheduling |
| CN102186212A (en) * | 2011-04-08 | 2011-09-14 | 中兴通讯股份有限公司 | Intercell cooperation scheduling method, system and user equipment |
| CN102130709B (en) * | 2011-04-20 | 2014-02-12 | 中国科学技术大学 | Multiple-input multiple-output (MIMO) multicasting beamforming method |
| CN102130709A (en) * | 2011-04-20 | 2011-07-20 | 中国科学技术大学 | Multiple-input multiple-output (MIMO) multicasting beamforming method |
| CN102324954A (en) * | 2011-05-18 | 2012-01-18 | 西安电子科技大学 | Cooperation combination preferable method based on synchronous constraint and signal channel energy rules |
| CN102324954B (en) * | 2011-05-18 | 2013-12-25 | 西安电子科技大学 | Cooperation combination preferable method based on synchronous constraint and signal channel energy rules |
| WO2015027601A1 (en) * | 2013-08-27 | 2015-03-05 | 东南大学 | A method for multi-user scheduling of low complexity based on replacement |
| CN103701577A (en) * | 2013-12-11 | 2014-04-02 | 北京邮电大学 | Pilot frequency distribution method for inhibiting pilot frequency pollution in cloud wireless access network |
| CN103701577B (en) * | 2013-12-11 | 2017-08-11 | 北京邮电大学 | Suppress the pilot distribution method of pilot pollution in cloud wireless access network |
| CN104168659B (en) * | 2014-08-19 | 2017-07-28 | 东南大学 | Multiple cell mimo system user scheduling method under MRT precoding strategies |
| CN104168659A (en) * | 2014-08-19 | 2014-11-26 | 东南大学 | Multi-cell MIMO system user scheduling method under MRT pre-coding strategy |
| CN104302006A (en) * | 2014-09-02 | 2015-01-21 | 饶品魁 | Distributed type multi-antenna network overall scheduling system |
| CN104539328A (en) * | 2014-12-05 | 2015-04-22 | 江苏省邮电规划设计院有限责任公司 | Delay-aware-based semi-orthogonal scheduling method in multi-user system |
| CN104539328B (en) * | 2014-12-05 | 2017-09-05 | 江苏省邮电规划设计院有限责任公司 | The semi-orthogonal dispatching method perceived in multi-user system based on time delay |
| US10588118B2 (en) | 2015-05-11 | 2020-03-10 | Huawei Technologies Co., Ltd. | Semi-orthogonal transmission-based communication method and device |
| WO2016179779A1 (en) * | 2015-05-11 | 2016-11-17 | 华为技术有限公司 | Semi-orthogonal transmission-based communication method and device |
| CN106921421A (en) * | 2015-12-25 | 2017-07-04 | 展讯通信（上海）有限公司 | Bluetooth route system, bluetooth route sending and receiving method |
| CN106788650A (en) * | 2016-12-16 | 2017-05-31 | 中国电子科技集团公司第二十研究所 | A kind of cooperation close-to zero beam manufacturing process based on orthogonal project operator |
| CN106788650B (en) * | 2016-12-16 | 2020-05-19 | 中国电子科技集团公司第二十研究所 | Cooperative zero forcing beamforming method based on orthogonal projection operator |
| CN106789772A (en) * | 2016-12-29 | 2017-05-31 | 深圳天珑无线科技有限公司 | A kind of safety communicating method and device |
| CN109802911A (en) * | 2019-01-21 | 2019-05-24 | 浙江大学 | A kind of Fast Channel estimation and signal synchronizing method suitable for underwater acoustic modem |
| CN111711473A (en) * | 2020-06-18 | 2020-09-25 | 西安电子科技大学 | Massive MIMO user selection method based on position information |
| CN111711473B (en) * | 2020-06-18 | 2021-11-09 | 西安电子科技大学 | Massive MIMO user selection method based on position information |
| CN114614963A (en) * | 2022-03-16 | 2022-06-10 | 北京航空航天大学 | Alternative optimization iterative user group selection method, electronic device and storage medium |
| CN114614963B (en) * | 2022-03-16 | 2023-09-26 | 北京航空航天大学 | Alternate optimization iteration user group selection method, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101557611B (en) | 2011-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101557611B (en) | Downlink multiuser selection method used for multi-aerial system | |
| CN101015137B (en) | Apparatus and method for beamforming in multi-antenna system | |
| EP1737141A2 (en) | User selection method in a zero-forcing beamforming algorithm | |
| CN103220024B (en) | A kind of multi-user matches the beam form-endowing method of virtual MIMO system | |
| US20100054113A1 (en) | Method for Selection of an Optimized Number of Subscribers in Mobile Radio Systems | |
| Papoutsis et al. | User selection and resource allocation algorithm with fairness in MISO-OFDMA | |
| CN101741446B (en) | Multiple-input multiple-output method and device | |
| Choi et al. | Resource allocation for CoMP with multiuser MIMO-OFDMA | |
| CN101689902A (en) | Method and apparatus for transmitting information simultaneously to multiple destinations over shared wireless resources | |
| CN101631355A (en) | Selection method of modulation encoding way for TD-HSPA+multi-user MIMO system | |
| CN101499837B (en) | Low complexity user selecting method in multi-user MIMO broadcast channel | |
| CN101841916A (en) | Downlink multiuser scheduling method, device and base station | |
| CN101472298B (en) | User scheduling method and apparatus for TDD multi-input multi-output down emission system | |
| CN102857278B (en) | Resource allocation method | |
| CN101908914A (en) | Space division multiple address (SDMA) relay transmission method, device and system | |
| CN101834650A (en) | Multiuser MIMO (multiple-input multiple-output) downlink transmitting and dispatching method | |
| CN102142880A (en) | Quick dispatching method for user of multi-input-multiple-output and multi-user diversity system | |
| CN102833038A (en) | Downlink multi-business collaboration pre-coding method of multi-cell multicast MIMO (multiple input multiple output) mobile communication system | |
| Hammarwall et al. | Utilizing the spatial information provided by channel norm feedback in SDMA systems | |
| CN101790228B (en) | Downlink transmission method of TD-SCDMA reinforcing evolution system | |
| CN105049099B (en) | The multi-antenna adaptive dispatching method of LTE multiaerial systems | |
| CN104539339A (en) | Resource allocation method based on SLNR (Signal to Leakage Noise Ratio) multiuser dual layer beam forming | |
| CN103346867B (en) | Multiple cell multi-user's co-channel interference suppression method based on triangle decomposition and SLNR algorithm | |
| CN104202075A (en) | Wireless data transmission method based on multiple-input and multiple-output fast multiuser scheduling | |
| EP2418782B1 (en) | Method, base station and mobile terminal device for communication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: JINGXIN COMMUNICATION TECHNOLOGY (GUANGZHOU) CO., Free format text: FORMER OWNER: BEIJING POSTAL AND TELECOMMUNICATIONS UNIV. Effective date: 20150317 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100876 HAIDIAN, BEIJING TO: 510663 GUANGZHOU, GUANGDONG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20150317 Address after: 510663 Guangzhou Science City, Guangdong Shenzhou Road, No. 10 Patentee after: Jingxin Communication Technology (Guangzhou) Co., Ltd. Address before: 100876 Beijing city Haidian District Xitucheng Road No. 10 Patentee before: Beijing University of Posts and Telecommunications |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: COMBA TELECOM TECHNOLOGY (GUANGZHOU) Ltd. Document name: Notification that Application Deemed not to be Proposed |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210802 Address after: 510663 Shenzhou Road 10, Science City, Guangdong, Guangzhou Patentee after: Jingxin Network System Co.,Ltd. Address before: 510663 Shenzhou Road 10, Science City, Guangdong, Guangzhou Patentee before: COMBA TELECOM TECHNOLOGY (GUANGZHOU) Ltd. |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: She Hong Document name: Notification of conformity |