CN104539339B - Resource allocation methods based on SLNR multi-user's dual-stream beamforming - Google Patents
Resource allocation methods based on SLNR multi-user's dual-stream beamforming Download PDFInfo
- Publication number
- CN104539339B CN104539339B CN201510054326.7A CN201510054326A CN104539339B CN 104539339 B CN104539339 B CN 104539339B CN 201510054326 A CN201510054326 A CN 201510054326A CN 104539339 B CN104539339 B CN 104539339B
- Authority
- CN
- China
- Prior art keywords
- user
- mrow
- msub
- users
- rbn
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
- H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
- H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
- H04B7/0617—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
- H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
- H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
- H04B7/0619—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal using feedback from receiving side
- H04B7/0621—Feedback content
- H04B7/0632—Channel quality parameters, e.g. channel quality indicator [CQI]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0452—Multi-user MIMO systems
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Based on the resource allocation methods of SLNR multi-user's dual-stream beamforming, the invention is that in order in the resource allocation of multi-user's multi-flow beam forming in TD LTE A systems, optimal resource allocation is realized under conditions of interference can not be known.Its method：It is that user to be allocated determines priority according to channel quality height Step 1: obtaining channel quality of the user under the conditions of co-channel interference is not calculated by initial channel information；Step 2: base station is that user distributes RB according to User Priority, and by calculating space to relation number η on RBl,k,n, consider inter-user interference and subscriber channel condition to determine packet；Step 3: after completing a certain RB distribution, update and calculate user rate, judge whether to reach target call, for having reached that the user of targeted rate does not reallocate resource；Step 4: above-mentioned two step is repeated, until being assigned.
Description
Technical field
The present invention relates to the resource allocation methods based on SLNR forming multiuser wave beams.
Background technology
In November, 2004, LTE relevant concept is just in Toronto 3GPP Long Term Evolution planning work meetings
It is suggested.By a series of perfect of 3GPP, added at present by the big standard of WCDMA, CDMA2000, TD-SCDMA tri- and later stage
802.16 WiMax standards, constitute existing 3G communication standards system.In order to further meet growing mobile communication
Demand, meets the arrival in 4G mobile communication epoch, 3GPP is in LTE gradually evolution, respectively for WCDMA and TD-
Two existing 3G standards of SCDMA, carry out LTE-FDD and TD-LTE standardization effort.In 3G and 4G systems, MIMO technology is all
It is an essential key technology.MIMO technology uses many antennas on Receiver And Transmitter, and advanced with some
Signal processing technology be combined.In the Standard Edition after R10, MIMO transmission mode has reached nine kinds.At present,
MIMO transmission mode is broadly divided into three major types：Transmitting diversity, spatial reuse, wave beam forming.Traditional wave beam forming is applied to
Small spacing aerial array, using the strong correlation between bay, forms the wave beam for pointing to user direction, and then improve noise
Than, the beamforming technique used at present is not limited to traditional wave beam forming, does not require must there is strong correlation between bay,
But beam forming is realized by the precoding beam forming algorithm of transmitting terminal and then spatial multiplexing gain is obtained.Wave beam forming is main
Algorithm includes ZF (ZF), MMSE (minimum mean square error), BD (block diagonalization), SLNR (letter leakage noise ratio) etc..Wherein SLNR
Algorithm synthesis considers noise and disturbing factor, effectively inhibits the inter-stream interference of multithread, while introducing the list of notion of " leakage "
Interference of a certain user to other users is levied, algorithm complex is significantly reduced compared to SINR is calculated, thus has been obtained most
It is widely applied.
In forming multiuser wave beam, the dispatching distribution of resource is also a key factor of decision systems performance.TD-
LTE-A physical layers define RB (Physical Resource Block) as the division of the physical resource of up-downgoing, are air interface physical resources
The least unit of distribution.1 RB is included and is included 7 in the frequency range that 180kHz is taken on 12 continuous subcarriers, frequency domain, time domain
Continuous OFDM symbol, time span is 0.5ms.If using extended cyclic prefix, for 6 OFDM symbols.Wave beam forming
Multiple users will on same RB simultaneous transmission to obtain gain.Most Resource Allocation Formulas is all to optimize overall system
System handling capacity is target.Multiple users in one cell experienced after frequency selective fading channels, declining on each RB
Fall different, different user is also different with interfering with each other on RB, additionally, due to being related between multi-user, user
Interference can also produce influence to system, and these problems are required to consider in system-level optimization process.So that user transmits signal
The deeper RB of decline and same group of larger user of interference can bring influence to the transmission rate of user, and then influence the whole of system
Body handling capacity.Fairness is another important indicator in resource allocation algorithm.Fairness refers to the difference between user's transmission rate
The opposite sex, considers as system, and the speed difference between different user should not be too big on the premise of user's requirement is met.Except this it
Outside, the complexity of algorithm is also the problem of needing in scheme design process to consider, it is necessary to so that algorithm has actual feasibility.
Existing algorithm related to the present invention：Current most of algorithm is based primarily upon single current wave beam forming scene, open
In the document 1 of 2009：《Efficient and low-complexity user selection for the
multiuser MISO downlink》With the document 2 of 2014：《Low-Complexity User Selection for
Rate Maximization in MIMO Broadcast Channels with Downlink Beamforming》Main pin
Right multi-purpose single current wave beam forming gives the volume scheme of user's selection and resource allocation, and its essence is the capacity based on MISO
Optimum distribution.This algorithm has higher power system capacity, but the consideration to system fairness has been short of.
Document 3：《User selection and resource allocation algorithm with fairness
in MISO-OFDMA》The user grouping of reduction complexity is proposed, is started with from inter-user interference is reduced, and examine on this basis
Consider user fairness distribution resource, take into account handling capacity.But the algorithm does not account for the channel condition of user, and due to right
The limitation of fairness is excessively strict, it may appear that the problem of instead resulting in throughput degradation when user increases in cell.Meanwhile, document
[1] these i.e. schemes of the problem of-[3] also have one jointly are all based on single current wave beam forming scene to consider, what is used is equal
For ZF beamforming algorithms, under the scene of multithread, hydraulic performance decline can be caused.Document 4：《Capacity maximization
for zero-forcing MIMO-OFDMA downlink systems with multiuser diversity》Consider
Multi-flow beam forming scene, determines fluxion by reception space selection, and is realized according to the intermediate variable iteration of design
Power distribution and the rightmost case of user's selection, finally provide throughput-maximized resource allocation methods.But the algorithm is neglected
Fairness between user has been omited in system, certain customers can be caused to be in lower rate transmissions state, influence all the time in systems in practice
Consumer's Experience.In addition, the complexity of the program is higher, there is bigger difficulty in realization.
The content of the invention
The invention aims in the resource allocation of multi-user's multi-flow beam forming in TD-LTE-A systems, dry
Disturb and optimal resource allocation is realized under conditions of can not knowing, so as to provide a kind of based on SLNR multi-user's dual-stream beamforming
Resource allocation methods.
Based on the resource allocation methods of SLNR multi-user's dual-stream beamforming, it is realized by following steps：
Step 1: initialising subscriber set U and carrier set Nn, calculates the average signal-to-noise ratio SINR of each user；
Step 2: the numerical value of the signal to noise ratio of each user is carried out into descending arrangement, the priority of user to be allocated, root are used as
All users are lined up into a queue Ui to be allocated according to the priority；
Step 3: current priority highest user k travels through all resource blocks (RB), n-th of RB of selection causesAnd distribute set A by the user k users for adding RBnnSo that An={ k }, while by k from treating point
With being removed in queue Ui, now：Ui=Ui- { k }；
Step 4: according to formula on n-th of RB：
Obtain the space correlation property coefficient η of existing subscriber on other users and n-th of RBL, k, n, wherein：ηL, k, n
Represent on RBn, the relative coefficient between user k and user l；HL, nIt is user l channel matrix, H on RBnK, n
It is user k channel matrix on RBn；
Step 5: according to formula：
Calculate other users and the average correlation coefficient of existing subscriber on n-th of RBL average correlation before taking out
CoefficientMinimum user；L is positive integer；Wherein：ηL, m, nRepresent on RBn, the correlation system between user m and user l
Number；
Step 6: in the L average correlation coefficientIn minimum user, judge whether to enable on RBn
And speed lifted user, if it is judged that be it is yes, then execution step 6 one；If it is judged that being no, then step is performed
Rapid 62；
Step 6 one, select and enable on RBn and speed to lift most user m, user m is added into the RB, An
=An∪ { m }, while remove user m in distribution queue, now Ui=Ui- { m }；Perform step 7；
The distribution of step 6 two, termination to the RB, and the RB is removed from RB set, Nn=Nn- { n } will be current
The final result that An is distributed as user on the RB, and perform step 8；
Step 7: repeating step 4 to six, until reaching the upper limit for the n number of users distributed, terminate to the RB's
Distribution, Nn=Nn- { n }；The number of users distributed on each RB is met：In formula：NtFor the number of transmitting antenna
Amount, S is the data fluxion that sole user is transmitted；
Step 8: updating the average signal-to-noise ratio SINR value of user, the currently acquired speed of all users is calculated, if there is user
J meets Rj≥γj, wherein, RjRepresent the currently acquired speed of all users, γjUser j targeted rate is represented, then by user
J is removed from user's set U, U=U- { j }；
Step 9: user's letter after more being believed according to step 8 closes U, sort and distribute according to maximum average SINR criterion again
Queue Ui, repeats three to eight, until RB is assigned or user is assigned.
The speed that user k is obtained on RBn is：
rK, n=(nsym-ncsym) × QmK, n×nsubcar×coderateK, n
Wherein：Nsym and ncsym are illustrated respectively in a Transmission Time Interval (TTI), and what is transmitted on a RB is total
OFDM (OFDM) symbolic number and wherein be used for control information OFDM symbol number, coderateK, nAnd QmK, nRespectively
It is character rate that user k is obtained on RBn and the bit number per symbol-modulated；Nsubcar is the sub-carrier number on a RB
Mesh.
The present invention be directed to multi-user's multi-flow beam forming in lte-a system, the criterion of inter-user interference is being minimized
Under the Resource Allocation Formula that proposes, considered the handling capacity and fairness of user.By introducing space correlation property coefficient,
The present invention program proposes rational group technology, efficiently solves at the co-channel interference under conditions of user's interference is unknown
Reason, guarantee fairness meet the requirements on the premise of improve the handling capacity of system.
Brief description of the drawings
Fig. 1 is forming multiuser wave beam model schematic；
Fig. 2 be the present invention packet and resource allocation integrated processes schematic flow sheet；
Fig. 3 is the present invention with not considering the polling scheme of user grouping, the user grouping resource allocation side based on fairness
The handling capacity contrast schematic diagram of case；
Fig. 4 is the contrast that method of the method for user grouping with considering user grouping based on fairness is considered based on handling capacity
Schematic diagram；
Fig. 5 is to consider the method for user grouping with considering the method for user grouping in difference based on fairness based on handling capacity
Contrast schematic diagram under number of users；
Embodiment
Embodiment one, with reference to Fig. 1 and Fig. 2 illustrate present embodiment, based on the double-current wave beam of SLNR multi-user
The resource allocation methods of figuration, comprise the following steps：
Step 1: channel quality of the user in the case where not calculating fair disturbed condition is obtained by initial channel information, to treat
Distributing user determines priority according to channel quality height；
Step 2: base station is that user distributes RB according to User Priority, and by calculating space to relation number on RB
ηL, k, n, consider inter-user interference and subscriber channel condition to determine packet；
Step 3: after completing a certain RB distribution, update and calculate user rate, judge whether to reach target call, for
Reach that the user of targeted rate does not reallocate resource, to ensure that more users can have an opportunity acquisition resource, improved system
The fairness of system；
Step 4: repeating above-mentioned two step, until being assigned, the allocation result of user is updated, and export final entirety
Allocative decision.
The present invention has carried out the resource allocation methods research based on multi-user's multi-flow beam forming under lte-a system, is applicable
Scene not only includes multithread, and single current can be equally scheduled as a kind of special case of multithread using this programme, solves big at present
The drawbacks of segmentation scheme is only applicable to single current wave beam forming.
A kind of effective group technology based on minimum inter-user interference of present invention proposition, utilization space relative coefficient,
Original inter-user interference is dexterously instead of to calculate.This method is not entered to effectively reduce the complexity of calculating, solves simultaneously
The problem of co-channel interference can not be known in feedback and makes base station dyscalculia.
Explanation of nouns：
MIMO：Multiple-Input Multiple-Output, multi-input multi-output antenna system；
UE：User Equipment, user equipment；
TTI：Transmission Time Interval, Transmission Time Interval；
CQI：Channel Quality Indicator, channel quality is indicated；
PMI：Precoder Type Indicator, precoding type is indicated；
OFDM：Orthogonal Frequency Division Multiplexing, OFDM；
SINR：Signal to Interference and Noise Ratio, Signal to Interference plus Noise Ratio；
SLNR：Signal to Leakage and Noise Ratio, believe leakage noise ratio；
MMSE：Minimum Mean Square Error, least mean-square error；
ZF：Zero Forcing, ZF；
RB：Resource Block, resource block；
TDD：Time Division Duplex, time division duplex；
MCS：Modulation and Coding Scheme, modulating-coding strategy；
Principle：The system schematic of multi-user's multi-flow beam forming such as Fig. 1.
Assuming that having K user in system, N is equipped with per userrRoot transmitting antenna, base station is equipped with NtRoot transmitting antenna is single
The data fluxion of user's transmission is S.For user k, its wave beam formed matrix on RBn can be expressed as
Wherein wk,sIt is emission value of the s flow datas in transmitting terminal of k-th of user.In base station end, signal is by going here and there simultaneously
Change and pass through precoding beam figuration and launch, receiving terminal is reached after experience transmission channel.The feelings distributed in power averaging
Under condition, the signal that the user k of receiving terminal is received can be expressed as
It is user k original transmitted data.And HkIt is user k channel
Matrix.
Observation type (2), Section 1 is user k oneself transmission data, Section 2Then represent original
It is transferred to other users but the data received by user k, the i.e. interference from other users.Here it is forming multiuser wave beam
The new problem faced compared to single user wave beam forming, inter-user interference.In the case of single user, due in same time-frequency money
On source only one of which user transmission, be not in co-channel interference between user, and multi-user in order to obtain spatial multiplexing gain, it is necessary to
The data of multiple users are transmitted in same frequency, co-channel interference is also just inevitably occurred in that.In general, user is receiving
End can dock the collection of letters number and make filtering process, use filtering matrix：
The speed that user k is obtained on RBn can be expressed as
rk,n=(nsym-ncsym) × Qmk,n×nsubcar×coderatek,n (4)
Wherein nsym and ncsym are illustrated respectively in a TTI, the total OFDM symbol number transmitted on a RB and its
In be used for control information OFDM symbol number, coderatek,nAnd Qmk,nBe respectively the character rates that are obtained on RBn of user k and
Bit number per symbol-modulated, this two MCS (coded modulation strategy) by user k on RBn are determined.Nsubcar is then one
Number of sub carrier wave on individual RB, in TD-LTE-A systems, nsubcar=12.
Here we use system in user and speed as system handling capacity.Within the T time for emulating subframe, use
The Mean Speed that family k is obtained is
ρ in formulaK, nAccorded with for resource distribution instruction.ρK, n=1 expression user k has been dispensed on RBn, ρK, n=0 expression
User k is not previously allocated on RBn.The handling capacity of system can be expressed as
Although our main target is the handling capacity of lifting system, in evaluation system dispatching algorithm, fairness
It is also the important indicator that another can not ignore.The present invention is used as the finger for weighing fairness using Jain ' the s indexes of user rate
Mark, its expression formula is as follows
Jain ' s indexes FpSpan beWork as FpCloser to 1, show that the fairness of system is better.
For Jain ' s indexes, there is no critical appraisal standard, in order to be described with more specific standard for scheme
Fairness requirement, table 1 gives requirements of the 3GPP for CDF (cumulative distribution function).
Table 1CDF curve reference points
In CDF curve maps, user's Normalized throughput is represented with transverse axis, the longitudinal axis represents cumulative probability Distribution Value, i.e. system
In be less than or equal to the Normalized throughput numerical value user shared by ratio.Transverse axis is 1 positional representation system average throughput,
Concentrated on if curve increases near 1, it is believed that fairness is preferable.With (0.1,0.1) this group of data instance in table, restriction is handled up
/ 10th of amount less than or equal to user's no more than total number of users of system average throughput.
It has been already mentioned that modulation bit number and the character rate of transmission are by coded modulation strategy decision in the analysis of (4) formula, and
Coded modulation strategy is related to CQI, and CQI is corresponding with SINR, and the larger SINR of larger SINR correspondences, also has led to for one side
Bigger coderatek,nAnd Qmk,nNumerical value, so as to obtain bigger transmission rate.
In the aspect of real system, when user k is assigned on RBn, its receiving end SINR can be expressed as：
Ps represents the power for the useful signal that user k is received, σ in formula2For white Gaussian noise power, OcFor adjacent cell base
The interference stood, IcFor inter-user interference, their calculation formula is：
Wherein：EkUser k energy is distributed to for base station, due to this section it is not intended that power distribution problems, therefore is used
The strategy of user power mean allocation.αkIt is user k large scale decline, is damaged in systems in practice including shadow fading and path
Consumption.Gk,nAnd Wk,nIt is the receiving matrix and wave beam formed matrix of user respectively.U=1,2 ..., and K } what is represented is all K use
User's collection of family composition.Especially, when user transmits not only first-class data, can also exist between user's its data stream
I in inter-stream interference, i.e. formula (9)l, for user k s flow datas, the calculation formula of its inter-stream interference being subject to is
When using SLNR algorithms, the interference of multi-flow beam forming and noise all can preferably be suppressed, for dispatching
SINR in journey improves, due to Oc、σ2All with dispatching algorithm without much relations, and inter-stream interference IlIt is to be present in indoor, nothing again
Method is individually eliminated, thus we from reduce IcWith increase PsStart with.By resource and the relations of distribution of user's group, use can be reduced
Disturbed between family；On different RB, the H of userK, nThere are different values, its F norm would also vary from, when channel condition is preferable
When, the H of userK, nPossess larger norm value, so PsNumerical value also can be larger, although be so virtually also exaggerated interference,
But it is due to that SLNR algorithms have suppression function, P caused by final RB distribution to interference in itselfsThe brought influence of increase can much
The influence brought more than interference increase.
But in the assignment procedure, inter-user interference can not be known under conditions of allocative decision is uncertain, this is true to scheme
Surely difficulty is brought, optimal scheme can be obtained by traversal search, but this algorithm operation quantity is excessive, without practical operation
Possibility.Therefore, we introduce the concept of the spatial coherence number between user：
ηL, k, nRepresent on RBn, the relative coefficient between user k and user l.Spatial coherence coefficient characterizes user
The power interfered with each other between space channel, space correlation property coefficient is bigger, then it is believed that inter-user interference is stronger, in order to disappear
Except the power needed for interference is bigger, and equal conditions are lower that to obtain data rate lower.η introducing is dexterously solved between user
The problem of interference calculation is difficult.By minimizing η, inter-user interference is that can obtain good suppression, and this method is compared to poor
Lift search and greatly reduce complexity.Under this easy grouping strategy, coordinate the resource allocation side of max carrier to interference thought
Case, you can greatly promote receiving terminal SINR, its simplicity will also be much better than the scheme of power iteration in document 4.
Based on above-mentioned analysis, the whole flow process figure of our scheme is provided, as shown in Figure 2.
Wherein γkRepresent user k targeted rate, if the speed of a certain user reached its targeted rate and
It is required that, then it can stop as the user resource allocation.In algorithm, initial user set U={ 1,2 ... K }, resource block collection are first had to
Nn={ 1,2 ... N } is closed, initial Signal to Interference plus Noise Ratio is calculated, and priority ranking is carried out to user, due to the main purpose of optimization
It is to lift handling capacity, so being ranked up according to the channel condition of user.Our expressions to channel condition are used herein
Following form
User channel quality is characterized using average Signal to Interference plus Noise Ratio of the k on all RB.Because end user is to be divided
Fit on specific resource block, so the Signal to Interference plus Noise Ratio of its receiving terminal is some particular value, but use user on RB used
Average sinr value, can effectively characterize the quality of this user's collective channel condition.Although this method from principle not
It is definitely accurate, but due to the larger difference of large scale fading coefficients between different user so that same user is on different RB
SINR differences are much smaller than SINR difference of the different user on same RB, therefore in general the preferable user of average channel conditions exists
SINR on each RB can be higher.The priority computational methods of this sequence avoid the complexity of exhaustion, are used as a kind of time
Excellent method has accurate measurement to channel condition, and follow-up simulation result, which also demonstrates this method, has feasibility.
After the index that channel quality instruction is determined, followed by packet and the unified algorithm of resource allocation.Detailed process
It is as follows：
(1) user is ranked up in U, and according to the order of priority, all users are lined up into a queue to be allocated
Ui；
(2) by first user in Ui, i.e. best one user k of channel condition takes the lead in traveling through all RB, chooses n-th
Individual RB causesAnd distribute set A by the k users for adding RBnnSo that An={ k }, while by k from treating
Removed in distribution queue Ui, Ui=Ui- { k }；
(3) the space correlation property coefficient of existing subscriber in other users and n is calculated according to (12) on n
(4) other users and the average correlation coefficient of existing subscriber on n are calculatedL before taking out
Minimum user；
(5) in this L user, select and enable on the RBn and speed to lift most user m, m is added should
RB, An=An∪ { m }, while remove m in distribution queue, Ui=Ui- { m }, but if user can not be found so that on the RB
Speed is continued to lift up, then terminates the distribution to the RB, and it is removed from RB set, and Nn=Nn- { n } makees current An
The final result distributed for user on the RB, skips (6), directly carries out (7) step；
(6) (3) to (5) are repeated, until reaching the number of users distributed on the upper limit, each RB for the number of users that n is distributed
It should meetAfter number of users reaches the upper limit, terminate the distribution to the RB, Nn=Nn- { n }；
(7) SINR value of user is updated, the currently acquired speed of all users is calculated, if Rj≥γj, wherein, RjTable
Show the currently acquired speed of all users, γjUser j targeted rate is represented, then U=U- { j }, note it being from total use by j
Removed in the collection U of family；
(8) according to new U, again according to maximum average SINR criterion sequence distribution queue Ui, each of (2)-(7) is repeated
Individual step, until RB is distributed or user distributes.
Wherein L setting be in order to balance in grouping process to channel condition and interference consideration.Although packet is overall former
Then to interfere with each other minimum, but sometimes disturb less user on RB and speed lifting be not it is best,
Because while interference is small, but its channel condition may be very poor, and the speed of itself is not very big.In order to avoid there is this situation,
It is not directly to select the minimum user of correlation to be then provided with packet in relaxation, formula (4), but chooses L interference
Users of very little, then see that the addition of which user can bring highest RB and speed, so effectively improve system
Handling capacity.There are different methods on being arranged in different documents for L, herein using following form：
L=min { card (Ui), Nt/S} (14)
In this approach, packet is combined with resource allocation, by RB and user mutual traversal, be grouped
Journey has not only noted inter-user interference, and considers channel condition of the user on RB, adds based on the preferential of channel condition
Level sequence so that distribution method can obtain preferable handling capacity.Meanwhile, we are arranged on user and reached after targeted rate just not
Resource allocation is participated in again, and the fairness of system is ensure that to a certain extent.
The beneficial effect that technical solution of the present invention is brought：The present invention be directed to multi-user's multi-flow beam in lte-a system
Figuration, the Resource Allocation Formula that proposes under the criterion for minimizing inter-user interference, considered the handling capacity of user with
Fairness.By introducing space correlation property coefficient, the present invention program devises rational group technology, efficiently solve with
Family interference it is unknown under conditions of co-channel interference processing, guarantee fairness meet the requirements on the premise of improve handling up for system
Amount.
Fig. 3 gives the handling capacity situation of scheme.It can be seen that institute's extracting method of the present invention has in handling capacity
More obvious advantage.When number of users is less, the handling capacity of three kinds of algorithms is very nearly the same；As number of users increases, this
The handling capacity highest, and advantage is further obvious all the time of institute's extracting method is invented, polling algorithm is consistently lower than the present invention in handling capacity
Method, and the algorithm that document 3 is given does not account for subscriber channel condition, has only focused on fairness and has gone to study user grouping side
Method, then remains minimum in handling capacity, when number of users reaches 90, method of the invention in handling capacity almost
2 times of the algorithm being grouped based on fairness are reached.Find simultaneously, when number of users persistently increases, algorithm handles up in document 3
Amount declines on the contrary, and the method that we invent is then to efficiently solve this problem.
Fig. 4 gives Jain ' the s index contrasts of fairness.It can be found that the public affairs suggested plans under most scenes
Levelling is all very outstanding, and Jain ' s indexes are higher than 0.85, when number of users is more than 80, are occurred in that under the scene of part less than 0.85
Situation, but be still higher than 0.8, fairness is good, while we combine Fig. 5 CDF curves, it can be seen that number of users 80,
Under conditions of 90, the fairness suggested plans all meets the fairness requirement that 3GPP is provided.Therefore it may be said that this programme is having outstanding
On the premise of handling capacity is showed, satisfactory fairness still ensure that.
Advantages of the present invention also includes greatly reducing algorithm complex.If taking traversal search scheme, then final
Amount of calculation be O (K(Nt/S)N), if taking the scheme of document 4, then amount of calculation is O (NK(Nt/S)).The present invention is directly based upon
Optimal user group distribution on RB, is that each RB directly calculates suitable user's combination by calculating space correlation property coefficient,
Avoid other combinations to attempt, effectively reduce complexity, complexity of the invention is only O (NK (Nt/S))。
Claims (2)
1. based on the resource allocation methods of SLNR multi-user's dual-stream beamforming, it is characterized in that：It is realized by following steps：
Step 1: initialising subscriber set U and carrier set Nn, calculates the average signal-to-noise ratio SINR of each user；
Step 2: the numerical value of the signal to noise ratio of each user is carried out into descending arrangement, as the priority of user to be allocated, according to this
All users are lined up a queue Ui to be allocated by priority；
Step 3: current priority highest user k travels through all resource block RB, n-th of RB of selection causes
And distribute set A by the user k users for adding RBnnSo that An={ k }, while k is removed from queue Ui to be allocated, this
When：Ui=Ui- { k }；
Step 4: according to formula on n-th of RB：
<mrow>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<mo>|</mo>
<msub>
<mi>H</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>H</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<mo>|</mo>
</mrow>
<mrow>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>|</mo>
<msub>
<mo>|</mo>
<mi>F</mi>
</msub>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>|</mo>
<msub>
<mo>|</mo>
<mi>F</mi>
</msub>
</mrow>
</mfrac>
<mo>,</mo>
<mn>0</mn>
<mo>&le;</mo>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>&le;</mo>
<mn>1</mn>
</mrow>
Obtain the space correlation property coefficient η of existing subscriber on other users and n-th of RBl,k,n, wherein：Represent
On RBn, the relative coefficient between user k and user l；HL, nIt is user l channel matrix, H on RBnK, nOn RBn,
It is user k channel matrix；
Step 5: according to formula：
<mrow>
<mover>
<msub>
<mi>C</mi>
<mi>m</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<mfrac>
<mrow>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>l</mi>
<mo>&Element;</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>m</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mi>a</mi>
<mi>r</mi>
<mi>d</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>A</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
</mrow>
Calculate other users and the average correlation coefficient of existing subscriber on n-th of RBL average correlation coefficient before taking outMinimum user；L is positive integer；Wherein：ηL, m, nRepresent on RBn, the relative coefficient between user m and user l；
Wherein L setting be in order to balance in grouping process to channel condition and interference consideration；L setting uses following shape
Formula：
L=min { card (Ui), Nt/S}
In formula：NtFor the quantity of transmitting antenna, S is the data fluxion that sole user is transmitted；
In this approach, packet is combined with resource allocation, by RB and user mutual traversal, in grouping process not
Only note inter-user interference, and considered channel condition of the user on RB, add the priority row based on channel condition
Sequence so that distribution method can obtain preferable handling capacity；Meanwhile, it is arranged on user and reaches after targeted rate and is just no longer participate in money
Source is distributed；
Step 6: in the L average correlation coefficientIn minimum user, judge whether to enable to the sum on RBn
The user of speed lifting, if it is judged that being yes, then performs step 6 one；If it is judged that being no, then step 6 is performed
Two；
Step 6 one, select and enable on RBn and speed to lift most user m, user m is added into the RB, An=An∪
{ m }, while remove user m in distribution queue, now Ui=Ui- { m }；Perform step 7；
The distribution of step 6 two, termination to the RB, and the RB is removed from RB set, Nn=Nn- { n } makees current An
The final result distributed for user on the RB, and perform step 8；
Step 7: repeating step 4 to six, until reaching the upper limit for the n number of users distributed, terminate the distribution to the RB,
Nn=Nn- { n }；The number of users distributed on each RB is met：
Step 8: updating the average signal-to-noise ratio SINR value of user, the currently acquired speed of all users is calculated, if there is user j to expire
Sufficient Rj≥γj, wherein, RjRepresent the currently acquired speed of all users, γjRepresent user j targeted rate, then by user j from
Removed in user's set U, U=U- { j }；
Step 9: user's letter after more being believed according to step 8 closes U, again according to maximum average SINR criterion sequence distribution queue
Ui, repeats three to eight, until RB is assigned or user is assigned.
2. the resource allocation methods according to claim 1 based on SLNR multi-user's dual-stream beamforming, it is characterised in that
The speed that user k is obtained on RBn is：
rK, n=(nsym-ncsym) × QmK, n×nsubcar×coderateK, n
Wherein：Nsym and ncsym are illustrated respectively in a Transmission Time Interval TTI, and what is transmitted on a RB is total orthogonal
Frequency division multiplex OFDM symbolic number and the OFDM symbol number wherein for control information, coderateK, nAnd QmK, nIt is user k respectively
The character rate obtained on RBn and the bit number per symbol-modulated；Nsubcar is the number of sub carrier wave on a RB.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510054326.7A CN104539339B (en) | 2015-01-30 | 2015-01-30 | Resource allocation methods based on SLNR multi-user's dual-stream beamforming |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510054326.7A CN104539339B (en) | 2015-01-30 | 2015-01-30 | Resource allocation methods based on SLNR multi-user's dual-stream beamforming |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104539339A CN104539339A (en) | 2015-04-22 |
| CN104539339B true CN104539339B (en) | 2017-11-03 |
Family
ID=52854819
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510054326.7A Active CN104539339B (en) | 2015-01-30 | 2015-01-30 | Resource allocation methods based on SLNR multi-user's dual-stream beamforming |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104539339B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105163329B (en) * | 2015-09-17 | 2018-09-07 | 哈尔滨工业大学 | Single double-current switching method based on effective speed in a kind of wave beam forming |
| CN108092701B (en) * | 2017-11-21 | 2020-12-01 | 东南大学 | Beam selection method, device and storage medium for hybrid beam forming HBF system |
| CN111954306B (en) * | 2020-07-08 | 2024-02-27 | 北京瀚诺半导体科技有限公司 | Hybrid transmission method and system based on time slot and packet scheduling |
| CN115243378B (en) * | 2022-07-20 | 2024-06-07 | 中国联合网络通信集团有限公司 | Resource allocation method and device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101359953A (en) * | 2007-08-01 | 2009-02-04 | 中兴通讯股份有限公司 | Method for applying MIMO technique in TD-SCDMA system outdoor macrocell |
| EP2293464A1 (en) * | 2003-11-06 | 2011-03-09 | Nortel Networks Limited | Method to determine precoding-weights based on channel state information in a mimo communication system |
| CN102857278A (en) * | 2011-06-30 | 2013-01-02 | 普天信息技术研究院有限公司 | Resource allocation method |
| CN103595455A (en) * | 2013-11-26 | 2014-02-19 | 哈尔滨工业大学 | LTE-A non-codebook beam forming method based on user satisfaction |
-
2015
- 2015-01-30 CN CN201510054326.7A patent/CN104539339B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2293464A1 (en) * | 2003-11-06 | 2011-03-09 | Nortel Networks Limited | Method to determine precoding-weights based on channel state information in a mimo communication system |
| CN101359953A (en) * | 2007-08-01 | 2009-02-04 | 中兴通讯股份有限公司 | Method for applying MIMO technique in TD-SCDMA system outdoor macrocell |
| CN102857278A (en) * | 2011-06-30 | 2013-01-02 | 普天信息技术研究院有限公司 | Resource allocation method |
| CN103595455A (en) * | 2013-11-26 | 2014-02-19 | 哈尔滨工业大学 | LTE-A non-codebook beam forming method based on user satisfaction |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104539339A (en) | 2015-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Choi et al. | Resource allocation for CoMP with multiuser MIMO-OFDMA | |
| WO2021159551A1 (en) | User matching method and power distribution method in mimo-noma downlink communication system | |
| Jiang et al. | Energy-efficient transmission for MIMO interference channels | |
| CN102075959B (en) | Coordinated beamforming method under CoMP in LTE-A system | |
| CN102055563B (en) | Adaptive joint linear precoding method applicable to multi-base station coordination | |
| Moretti et al. | Efficient margin adaptive scheduling for MIMO-OFDMA systems | |
| CN101925070B (en) | Resource allocation method for cognitive system based on space multiplexing | |
| CN102983949A (en) | Space division multiple address (SDMA) transmission method and base station in multi-carrier MU multiple input multiple output (MIMO) system | |
| CN101483874A (en) | Uplink resource allocation method for distributed antenna MIMO-OFDM/SDMA system | |
| CN104539339B (en) | Resource allocation methods based on SLNR multi-user's dual-stream beamforming | |
| CN101557611A (en) | Downlink multiuser selection method used for multi-aerial system | |
| CN106936552A (en) | Uplink pilot sequence distribution method and base station in extensive mimo system | |
| CN104283594B (en) | A kind of method for precoding and equipment | |
| CN102546488A (en) | Interference elimination method based on effective channel parameter semi-orthogonal | |
| CN106209188B (en) | Pilot pollution reduction method based on partial pilot frequency alternate multiplexing in large-scale MIMO system | |
| CN104092519A (en) | Multi-user MIMO cooperative transmission method based on weighting and rate maximization | |
| CN106027214A (en) | Pilot distribution method of multi-cell large-scale MIMO system | |
| CN104253639B (en) | Obtain the method and device of channel quality instruction | |
| CN105611640B (en) | A kind of adjustable CoMP downlink user dispatching method of equitable degree | |
| Chen et al. | Resource allocation with CoMP transmission in ultra dense cloud-based LTE small cell networks | |
| CN102196585B (en) | Method for determining downlink transmission mode of coordinated multi-point transmission | |
| CN105763238A (en) | Multi-user MIMO system user selection method based on quantitative precoding | |
| CN110365384A (en) | A kind of user scheduling method based on extensive MIMO mixed-beam formation system | |
| CN103402268B (en) | Downlink MU_COMP scheduling method based on improved chordal distance | |
| CN103703854B (en) | User scheduling method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |