CN100574176C - Resource allocation methods in the multi-carrier communications systems - Google Patents

Resource allocation methods in the multi-carrier communications systems Download PDF

Info

Publication number
CN100574176C
CN100574176C CN200510081002.9A CN200510081002A CN100574176C CN 100574176 C CN100574176 C CN 100574176C CN 200510081002 A CN200510081002 A CN 200510081002A CN 100574176 C CN100574176 C CN 100574176C
Authority
CN
China
Prior art keywords
resource
mobile radio
resource allocation
radio station
channel
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.)
Expired - Fee Related
Application number
CN200510081002.9A
Other languages
Chinese (zh)
Other versions
CN1713561A (en
Inventor
崔荣埈
尹相普
朴元亨
朴世雄
金钟泽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Consortium Of Industry University Cooperation
Samsung Electronics Co Ltd
Original Assignee
Consortium Of Industry University Cooperation
Samsung Electronics Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Consortium Of Industry University Cooperation, Samsung Electronics Co Ltd filed Critical Consortium Of Industry University Cooperation
Publication of CN1713561A publication Critical patent/CN1713561A/en
Application granted granted Critical
Publication of CN100574176C publication Critical patent/CN100574176C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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
    • H04L5/0058—Allocation criteria
    • H04L5/0067—Allocation algorithms which involve graph matching
    • 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/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • 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/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0023—Time-frequency-space
    • 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
    • H04L5/0037—Inter-user or inter-terminal allocation
    • 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
    • H04L5/0058—Allocation criteria
    • H04L5/006—Quality of the received signal, e.g. BER, SNR, water filling
    • 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/0091—Signaling for the administration of the divided path
    • H04L5/0094—Indication of how sub-channels of the path are allocated
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides the resource allocation methods in a kind of multi-carrier communications systems, according to the feedback channel information that comes from mobile radio station, a plurality of mobile radio stations are given with resource allocation in the base station in this multi-carrier communications systems.The base station receives resource request message from each mobile radio station, and according to the resource request message that all mobile radio stations from system come, selects one group of mobile radio station that maximum system gain is provided, and overlapping resource on particular point in time not.Then institute's requested resource is distributed to selected mobile radio station.

Description

Resource allocation methods in the multi-carrier communications systems
Technical field
The present invention relates generally to a kind of mobile communication system, and more specifically, relate to the resource allocation methods in multi-carrier communications systems.
Background technology
Along with the development of mobile communication technology, various and resource allocation techniques complexity have been proposed, be used for the optimization system performance.Before packet-based framework, the voice cellular network is given each user with a dedicated channel allocation when request resource.But be to use packet-based framework, a plurality of users share the single channel that is used to communicate by letter.
Fig. 1 shows the resource allocation in the shared scheme of traditional single channel.With reference to Fig. 1, the scheduler program 103 in base station (BS) is according to their feeding back channel state information, and 105a divides priority to 105d with mobile radio station.Scheduler program 103 uses the priority of channel dispensers 104 according to them, and multiplexed each mobile radio station 105a temporarily is stored in the data of transmission buffer 102a in the 102d to 105d's, and by transmitting antenna 106 send multiplexed data.
In the superincumbent single channel common share communication system, the performance of system depends on scheduling.Although high performance scheduling is arranged, owing between a plurality of users, only share single channel, so high speed data transfer is restricted.
System based on next generation communication technology OFDM (OFDM) can use the subcarrier of a plurality of quadratures to dispose a plurality of channels, and it makes resource allocation more flexible.And, when using MIMO (multiple-input and multiple-output) scheme or array antenna, resource can be distributed to a plurality of users simultaneously.
The channel condition information that a new trend in mobile communication technology is each channel is from the direct feedback of mobile radio station.
In the high-speed radiocommunication system of picture CDMA HDR (code division multiple access high data rate), mobile radio station feeds back to the base station with the channel status measurement.Based on channel condition information, the base station is the transmitting and scheduling data and suitable modulation and coding is applied to each channel.In the next generation wireless communication system, along with the increase of channel quantity, the amount of information that flows to the base station from mobile radio station also increases, and each base station need distribute two or more channels to realize diversity.Therefore, need be when each user ask two or more channel, Resources allocation efficiently.
For ofdm system, can find the resource allocation of the best of the throughput of the system that maximizes by attempting all possible combination.But, find that the computational complexity of best resource allocation is NP difficulty (the polynomial time difficulty that can not determine), thereby the enforcement of its reality is impossible.
Summary of the invention
Therefore, the purpose of this invention is to provide the resource allocation methods in multi-carrier wireless communications system, be used to reduce the computation complexity of resource allocation and can carry out effective resource management, in this multi-carrier wireless communications system, give each mobile radio station two or more channel allocation.
By in multi-carrier communications systems, providing resource allocation methods to achieve the above object.
According to an aspect of the present invention, resource allocation methods is offered the multi-carrier communications systems that has the base station, this base station is given a plurality of mobile radio stations according to the feedback channel information that comes from mobile radio station with resource allocation.The base station receives resource request message from each mobile radio station, based on the resource request message that comes from all mobile radio stations, select one group of mobile radio station that maximum system gain is provided, and overlapping resource on time point not, and will distribute to selected mobile radio station by selected mobile radio station institute requested resource.
Best, resource request message comprises at least one resource index group and utilization rate, and this utilization rate is accessible when the resource of distributing corresponding at least one resource index group.
Best system gain is to use the summation of rate, and uses the bit error rate (BER) of the resource corresponding with at least one resource index group or packet error probability (PER), signal to noise ratio (snr) to calculate utilization rate.
According to another aspect of the present invention, in the channel information transmission method of the mobile radio station of multi-carrier communications systems, the base station is given a plurality of mobile radio stations according to the feedback channel information that comes from mobile radio station with resource allocation in this system, the service quality (QoS) of considering ongoing service requires or the diversity condition, mobile radio station produces at least one resource index group, this resource index group comprises at least one resource, in the time will giving mobile radio station with at least one resource index and corresponding resource allocation, mobile radio station calculates accessible utilization rate, and will indicate the information of at least one resource index group and utilization rate to send the base station to.
Preferably use the SNR of the resource corresponding to calculate utilization rate with at least one resource index group.Produce step in the resource index group,, and do not consider to have resource less than the SNR of SNR threshold value for each channel is provided with the SNR threshold value.
Preferably also use the BER of the resource corresponding to calculate utilization rate with at least one resource index group.Produce step in the resource index group,, and do not consider to have resource greater than the BER of BER threshold value for each channel is provided with the BER threshold value.
Preferably also use the PER of the resource corresponding to calculate utilization rate with at least one resource index group.Produce step in the resource index group,, and do not consider to have resource greater than the PER of PER threshold value for each channel is provided with the PER threshold value.
According to a further aspect in the invention, the resource allocation methods of MIMO communication system (wherein the base station is given a plurality of mobile radio stations according to the feedback channel information that comes from mobile radio station with resource allocation), the base station is from each mobile radio station receive channel request message, according to the channel request message of coming from all mobile radio stations, base station selected one group of mobile radio station provides maximum system output and overlapping channel on time point not, and the base station assigns channel corresponding with the antenna of being asked by selected mobile radio station given selected mobile radio station.
The optimum channel request message comprises at least one antenna index group and utilization rate, and this utilization rate is can reach when distributing the channel corresponding with at least one antenna index group.
That best system output is to use and, and utilization rate is by calculating with PER, SNR or BER by the corresponding channel of the indicated antenna of at least one antenna index group.
According to a further aspect of the invention, the resource allocation methods of OFDMA (OFDM access) communication system (wherein the base station is given a plurality of mobile radio stations according to the feedback channel information that comes from mobile radio station with resource allocation), the base station receives subchannel requests message from each mobile radio station, form subchannel by a plurality of subcarriers, the base station is according to the subchannel requests message of coming from all mobile radio stations, select one group of mobile radio station that maximum system output is provided and overlapping subchannel on time point not, and selected mobile radio station is distributed to subchannel in the base station, and this subchannel is by selected mobile radio station request.
Preferably subchannel requests message comprises at least one sub-channel index group and utilization rate, and this utilization rate is accessible when distributing the subchannel corresponding with at least one sub-channel index group.
That best system output is to use and, and utilization rate uses PER, SNR or the BER of the subchannel corresponding with at least one sub-channel index group to calculate.
Specifically, according to one aspect of the present invention, provide a kind of in multi-carrier communications systems the method by the base station assigns resource, wherein the base station is given described a plurality of mobile radio stations according to the feedback channel information from a plurality of mobile radio stations with resource allocation, described method comprises step: receive resource request message from each mobile radio station, this resource request message comprises at least one resource index group and utilization rate, and this utilization rate is accessible when the resource of distributing corresponding at least one resource index group; Select one group of mobile radio station according to the resource request message that comes from all mobile radio stations, so that maximum system gain to be provided under the situation that does not have overlapping resource on the time point; And will distribute to selected mobile radio station by selected mobile radio station institute requested resource, the method Resources allocation of wherein using theoretical figure is with maximization total system utilization rate.
Description of drawings
From the detailed description of hereinafter carrying out in conjunction with the accompanying drawings, above-mentioned purpose, characteristics and advantage with other of the present invention will become very obvious, wherein:
Fig. 1 shows at traditional single channel and shares resource distributor system configuration in the scheme;
Fig. 2 shows and has used wireless communication system of the present invention;
Fig. 3 shows the resource allocation map according to the resource allocation methods of the embodiment of the invention;
Fig. 4 shows and is representing according to the resource map in the resource allocation methods of the embodiment of the invention;
Fig. 5 shows in resource allocation methods according to an embodiment of the invention and forms under the situation of agglomerations (clique) on three summits, is used to detect the example of the operation of 3-agglomeration;
Fig. 6 shows in resource allocation methods according to an embodiment of the invention and forms under the situation of agglomerations on four summits, is used to detect the example of the operation of 4-agglomeration;
Fig. 7 shows computer aided animation result's curve chart, and this result is under the situation of four resources, relatively the result of the packet loss rate (drop rate) between prior art resource allocation and the resource allocation of the present invention;
Fig. 8 shows computer aided animation result's curve chart, and this result is to gain between resource allocation and the resource allocation of the present invention and the result who compares;
Fig. 9 shows the curve chart of analog result, and this result is under the situation of eight resources, the comparative result of the packet loss rate of different resource allocation algorithm;
Figure 10 shows the curve chart of analog result, this result be comparison in agglomeration searching algorithm according to the present invention with the exhaustive search of wherein having attempted all possible candidate's resource in the result of number of computations.
Embodiment
Below, describe the preferred embodiments of the present invention in detail with reference to accompanying drawing.Because known function and structure may make the present invention thicken on unnecessary details, so described in not illustrating below.
Fig. 2 shows the configuration of wireless communication system, wherein will be applied to this system according to the resource allocation methods that embodiments of the invention are carried out.Scheduler program 203 in the base station carries out priority rating with mobile radio station 205a to 205d, determine to be tasked their channel according to the feeding back channel state information that comes from their by branch, and with mobile radio station 205a to the priority of 205d and the channel notification channel dispenser 204 of being assigned.Channel dispenser 204 is tasked channel with temporarily being stored in transmission buffer 202a to the data branch among the 202d according to the priority and the channel distribution information that receive from scheduler program 203, and this transmission buffer 202a is corresponding to 205d with mobile radio station 205a to 202d.Transmit data via antenna 206a to 206d subsequently, antenna 206a is corresponding with their each channel to 206d.
According to the embodiment of the invention, each mobile radio station will be from the next gain informing base station of a plurality of channels.The base station is analyzed channel gain information and is given each mobile radio station with two or more assignment of resources.The diversity effect that the result obtains has improved total systematic function.
Suppose the one or more desired channel group of mobile radio station selection, and the gain of selected channel is reported to the base station, under the situation of considering desired channel, mobile radio station is given with assignment of resources in the base station.In this embodiment of the present invention, have only channel group selected and be reported to the base station, but it is not limited to this, and mobile radio station can report to the base station with their output and/or BER with two or more channel group or all possible aggregate channel group.
In order to understand resource allocation methods according to the preferred embodiment of the invention better, suppose that user's 1 usefulness resource 1 and 2 has reached gain 4; User's 2 usefulness resources 1 and 3 reach gain 6; User's 3 usefulness resources 2 and 3 reach gain 5 or reach gain 4 with resource 4; And user's 4 usefulness resources 2 and 4 reach gain 5 or reach gain 2 with resource 3.By with resource 1 with tasked user 1 in 3 minutes and with resource 2 with tasked user 4 in 4 minutes, under the situation of overlapping resource not, just maximized overall gain, as shown in table 1:
Table 1-resource allocation table
Figure C20051008100200071
The invention provides the function of a kind of algorithm as the mobile radio station request, it is by maximizing particular value with specific assignment of resources to particular mobile station.When each user's gain was identical, problem just becomes gave mobile radio station as much as possible with resource allocation.Consider the practical communication quality, described value can be PER (packet error probability).In the present invention, pass through theoretical graphical method, solved the optimal resource allocation problem in the mode that reduces computational complexity.
In the described channel circumstance of table 1, each mobile radio station calculates utilization rate of being divided two or more resources of tasking mobile radio station and utilization rate from selected resource to the base station and the index of reporting.Significantly, the quantity of selected resource is 2 at least.Under extreme case, mobile radio station can calculate for all combination of resources and use, and utilization rate information is sent to the base station.According to the purposes of system, service efficiency can be user throughput or PER.Such as, in mimo system, with Pe (SNR)=bSNR A αProvide the PER with high SNR, wherein α is that diversity gain and a and b are the modulation variablees.
Behind each mobile radio station receiving channel information, the base station is that mobile radio station produces the function of figure as channel information.
According to resource allocation, determine the overall availability of system to the user.Therefore, use theoretical graphical method, wherein Resources allocation is with maximization total system utilization rate.Thereby can be used as the resource group and represent 1:(1,2) 1=4, (1,3) 2=6, (2,3) 3=5, (4) 3=4, (2,4) 4=5 and (3) 4=2.
Symbol (a N1..., a Ni) j=w has defined by select resource group { a for user j N1...., a NiAnd weight (that is the service efficiency) w that can reach.Under the situation of knowing the assignment group, the base station produces resource allocation map as shown in Figure 3, and it shows the resource allocation map that is used to illustrate resource allocation methods according to the preferred embodiment of the invention and will reference.
With reference to Fig. 3, come the establishing resource distribution diagram by the summit (that is node) of candidate allocation group.The weight branch is tasked the summit, and have limit of picture between any two summits of diverse resource and user.Therefore, the node 302 of user's 1 request resource 1 and resource 2 is by linking 33 nodes 303 that are connected to user's 4 request resource 3.Node 302 is also by linking 34 nodes 304 that are connected to user's 3 request resource 4.Because they have different resources and different users, so node 303 is connected to node 304 by linking 35.Node 304 is also by linking 36 nodes 306 that are connected to user's 2 request resource 1 and resource 3.At last, node 306 is also by linking 37 nodes 305 that are connected to user's 4 request resource 2 and resource 4.
Find agglomeration from the resource allocation figure that produced, and will have weight limit and agglomeration select as optimal resource allocation.
In the scope that system can calculate, provide the maximum number of a plurality of resources, can use parallel partitioning algorithm or serial partitioning algorithm to search for agglomeration.
Can determine to provide the optimal resource allocation of maximum system utilization rate with the resource allocation figure that draws in the above described manner.But,, find that the complexity of the process of optimal resource allocation also increases along with the increase of number of resources.In this article, supposed to provide the maximum number n of a plurality of resources, then system can find optimal resource allocation in real time.If resource outnumber n, use approximate optimal allocation method, wherein by with resource divided by n.The optimal allocation of using parallel partitioning algorithm and serial partitioning algorithm to be similar to.
Parallel partitioning algorithm is divided into g group with total resources and user, and the optimal allocation algorithm application is organized in each, thereby only the user is distributed to the resource in he organizes.If each group has m iIndividual resource, then m iBe equal to or less than m p, to allow best resource allocation, come the sum of computational resource by equation (1):
m = Σ i = 1 g m i ........(1)
m i≤m p， for ∀ i
When being applied to resource group A as the allocation strategy S of the superset of the set of vertices of agglomeration iThe time, make A j=F (S, A i) become and be used to obtain the resource group A that distributed jFunction.Then provide algorithm by equation (2):
∪ i = 0 m A i = { a 1 , . . . . , a m } , | A i | = m i , .........(2)
A i＝F(Opt，A i)
Simultaneously, the serial partitioning algorithm repeatedly uses the optimal allocation algorithm, up to having distributed all resources.Subopt (n) represents a kind of method, the m that this method discovery can get the active user pThe optimal allocation of individual resource.In this method, Subopt (n) repeatedly is applied to remaining resource, thereby reaches approximate optimum.By equation (3) this algorithm is described:
A *＝{a 1，...，a m}
while
Figure C20051008100200094
{
A i＝F(Subopt(n)，A *)
A *←A *-A i
} ...........(3)
The Opt and the Subopt (n) of equation (2) and (3) will be described below.
1) step 1: the QoS according to the user uses all available resources to produce figure, as shown in Figure 3.Divide the timing limit to connect two summits simultaneously two resource groups because have only as BS, so summit c learns the number of the adjacent vertex of c, N (c).
2) step 2: make C 0And C 1Be set of vertices, the N () on these summits equals 0 and 1 respectively.The superset S of the set of vertices c of the maximum agglomeration that obtains by this algorithm is described by equation (4) then:
∀ c ∈ C 0 , S←S∪{(c)}
...........(4)
∀ c ∈ C 1 , S←S?∪{(c，b c)}，N(c)←N(c)-1
Symbol ← hinted renewal process wherein.
3) step 3: by the ascending order of N () with C-C 0-C 1In all summits sort.If all N () are identical, then they are arranged randomly.For the summit c in ordering, from the adjacent vertex b of c cCreated as shown in Figure 4 to the figure that c draws.Here, c is defined as b cFollow-up person, and with b cBe defined as the preceding continuous person of c.For convenience, the figure that is drawn is by b c→ c simply represents.If made the figure that is drawn, then in former figure with c and b cBetween limit deletion, and N ' (b c) ← N ' (b c)+1, wherein N ' is follow-up person's number of summit x (x).
4) step 4: for the summit c in collating sequence with by c fFirst follow-up person of the c of expression is by c → c fRepresent the figure that drawn, c fThe follow-up person that it may have been arranged, c F, s, i.e. c f→ c F, sThen can be by c → c f→ c F, sSpirte is expanded, wherein c is defined as principal vertex, with c fBe defined as first son vertex, and with c F, sBe defined as second son vertex.The boss summit can have many first son vertexs, and each first son vertex can also have many second son vertexs.First summit can be identical with second summit on another first summit of coming from same principal vertex.
Such as, consider two figures that drawn, c f→ c F 'And c f→ c f→ c F, sIf c F 'And c F, sBe identical summit, then three summits (c, c f, c F ') the formation agglomeration.
Fig. 5 shows the process that is used to search for the 3-agglomeration, and each agglomeration is all formed by three summits.
With reference to Fig. 5, the first son vertex c when the edge with principal vertex c 52 252-2 is connected to another first summit c of principal vertex c51 1The second summit c of 52-1 1,2During 54-2, summit (c, c 1, c 2) the formation agglomeration.In this mode, to all principal vertexs, agglomeration is searched and be inserted into S.
5) step 5: as min (N (c f), N (c F, s))＞2 o'clock, need extra search for bigger agglomeration.
Fig. 6 shows the process that is used to search for the 4-agglomeration, and each agglomeration is all formed by four summits.
With reference to Fig. 6, for first son vertex of principal vertex c
Figure C20051008100200101
Find 3-agglomeration group
Figure C20051008100200102
If c f y ∉ { c f 1 , . . . . . , c f x } , Then exist The maximum agglomeration of middle discovery.For this reason, in the figure that is drawn before, find
Figure C20051008100200105
Between relation.
In an identical manner, can also continue to search for big agglomeration.The complexity of agglomeration searching algorithm increases with the size of agglomeration.Therefore, be provided with reference to the agglomeration size in the near optimal distribution method in the above, and the agglomeration searching algorithm is searched for best solution in reference agglomeration size range.
In resource allocation methods according to the preferred embodiment of the invention,, designed the agglomeration searching algorithm as table 2.
The false code of table 2-algorithm
//All?resources?sets，each?having?one?or?two?resources?for?a?mobile?station，which satisfies?a?target?Pe?are?located?at?nodes?in?a?graph?and?stored. function?schedule() { Graph?G //graph?class //number?of?all?resource?sets?each?having?two?BS?resources N＝BS_RESOURCE_NUM?COMBINATION?2
for?i＝1?to?MOBILE_NUM { for?j＝1?to?BS_RESOURCE_NUM //in?the?case?where?the?target?Pe?is?satisfied?by?one?resource if?Pe(I，j)<TARGET_Pe?then G.MakeNode(i，j) For?j＝1?to?N { //in?the?case?where?two?resources?are?combined C＝Combination(BS_RESOURCE_NUM) //in?the?case?where?the?target?Pe?is?satisfied?by?two?resources IfPe(I，C)<TARGET_Pe?then G.MakeNode(i，C) } } //a?clique?having?the?largest?weight?is?found?in?the?graph G.GetBestClique() } //search?the?clique?having?the?largest?weight?in?the?graph function?GraphGetBestClique() { maxWeight＝-1； for?i＝1?to?NODE_NUM { //one?node weight＝Node[i].weight if?weight>maxWeight?then maxWeight＝weight for?j?ADJACENT?TO?Node[i] { //in?the?case?where?i?and?j?are?connected
weight+＝Node[j].weight if?weight>maxWeight?then maxWeight＝weight； for?k?ADJACENT?TO?Node[j] { //in?the?case?where?i，j?and?k?are?connected if?k?ADJACENT?TO?Node[i]and?k?Node[i]then weight+＝Node[k].weight if?weight>maxWeight?then maxWeight＝weight； for?1ADJACENT?TO?Node[k] { //in?the?case?where?i，j，k?and?l?are?connected if1?ADJACENT?TO?Node[i]and?Node[j]then weight+＝Node[l].weight if?weight>maxWeight?then maxWeight＝weight； } } } ?} print?maxWeight }
Fig. 7 shows the computer aided animation result, and this result is under the situation of four resources, and more traditional prior art is based on round-robin method (round robbing, the result of the packet loss rate between resource allocation RR) and the resource allocation of the present invention.
Suppose four resources are carried out, then target BER is 10 -4, and when producing packets of voice by the G.739 encoder of supporting 8kbps, the grouping that surpasses 20 milliseconds delay boundary line will be dropped.
As shown in Figure 7, can be used in the packet loss rate of the reduction in optimal resource allocation of the present invention (Opt) rather than the RR method, serve many users.In the RR method, each user will satisfy the channel reporting of target BER and give BS, and BS selects to have the channel of target BER subsequently randomly for each user.On the other hand, in optimal resource allocation method Opt of the present invention (No div), each user uses a channel and will satisfy the channel notification BS of target BER.BS selects resource then, thereby can serve most user.In optimal resource allocation method Opt of the present invention (div), each user will satisfy one or two channel group notice BS of target BER, and BS selection resource, thereby can serve most user.Attention is from the aspect of QoS, and the use of a plurality of channels is more effective.The agglomeration searching algorithm only is used in the simulation.Fig. 8 shows analog result, when this result is ∑-log (Pe) at the target function of BER, to gain between traditional RR method and the resource allocation methods of the present invention and the result who compares.
In Fig. 7, when target function is given user as much as possible with resource allocation, in Fig. 8, when the target function of BER is ∑-log (Pe), RR and resource allocation of the present invention are compared from gain and aspect.As shown, the RR algorithm is compared in resource allocation of the present invention, and bigger gain is provided.
Fig. 9 shows eight resources, the curve chart of the comparison of the packet loss rate between resource allocation algorithm.
At m pUnder=4 the situation, parallel division suboptimum algorithm, serial are divided the suboptimum algorithm and by the optimal selection of the agglomeration searching algorithm that can search the 8-agglomeration, have been drawn packet loss rate.Two heuristic algorithms all show similar performance, and carry out the comparison with optimal selection.
Figure 10 is the curve chart that has compared the number of computations between exhaustive search and the agglomeration searching algorithm that obtains by analyzing, and this agglomeration searching algorithm need not parallel and serial partitioning algorithm.As shown in figure 10, the calculating of agglomeration searching algorithm needs of the present invention is than exhaustive search much less.
According to aforesaid the present invention, resource is distributed, thereby when the user asks a plurality of channel, as the function of user request can service-user maximum quantity, perhaps minimize total BER or PER.
Use the resource allocation methods of the present invention to a plurality of antenna systems, influence transmission and reception antenna diversity and also improved systematic function, described a plurality of antenna systems are each antenna configurations channel.
And, be available if can use a plurality of channels simultaneously and one or more channels be arranged for the user, the computational complexity in this resource allocation methods reduction system then, a plurality of users can select given channel simultaneously in this system.
Though with reference to its certain preferred embodiment, illustrate and illustrated the present invention, but it should be appreciated by those skilled in the art under the situation that does not depart from main idea of the present invention and scope, can carry out the various modifications on form and the details, main idea of the present invention and scope define in appending claims.

Claims (3)

1, a kind of in multi-carrier communications systems by the method for base station assigns resource, wherein the base station is given described a plurality of mobile radio stations according to the feedback channel information from a plurality of mobile radio stations with resource allocation, described method comprises step:
Receive resource request message from each mobile radio station, this resource request message comprises at least one resource index group and utilization rate, and this utilization rate is accessible when the resource of distributing corresponding at least one resource index group;
Select one group of mobile radio station according to the resource request message that comes from all mobile radio stations, so that maximum system gain to be provided under the situation that does not have overlapping resource on the time point; And
To distribute to selected mobile radio station by selected mobile radio station institute requested resource, the method Resources allocation of wherein using theoretical figure is with maximization total system utilization rate.
2, resource allocation methods according to claim 1, wherein system gain is described utilization rate sum.
3, resource allocation methods according to claim 1 wherein uses among signal to noise ratio snr, bit error rate BER and the packet error probability PER of the resource corresponding with at least one resource index group, calculates described utilization rate.
CN200510081002.9A 2004-06-25 2005-06-27 Resource allocation methods in the multi-carrier communications systems Expired - Fee Related CN100574176C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020040048092A KR100943620B1 (en) 2004-06-25 2004-06-25 Method for resource allocating in a multi-carrier communication system
KR48092/04 2004-06-25

Publications (2)

Publication Number Publication Date
CN1713561A CN1713561A (en) 2005-12-28
CN100574176C true CN100574176C (en) 2009-12-23

Family

ID=34980277

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200510081002.9A Expired - Fee Related CN100574176C (en) 2004-06-25 2005-06-27 Resource allocation methods in the multi-carrier communications systems

Country Status (5)

Country Link
US (1) US7542441B2 (en)
EP (1) EP1610573B1 (en)
KR (1) KR100943620B1 (en)
CN (1) CN100574176C (en)
DE (1) DE602005003168T2 (en)

Families Citing this family (39)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7089200B2 (en) * 1999-12-21 2006-08-08 Third Millennium Management Pty Ltd Payroll management method and apparatus
EP1729247A1 (en) * 2005-06-01 2006-12-06 InVision Software AG Resource planning for employees
EP1739902B1 (en) * 2005-06-27 2016-04-06 Samsung Electronics Co., Ltd. Apparatus and method for scheduling transmission of data packets in a multichannel wireless communication system
CN101305628A (en) * 2005-11-07 2008-11-12 汤姆森特许公司 Apparatus and method for dynamic frequency selection in OFDM networks
WO2007065272A1 (en) * 2005-12-08 2007-06-14 Nortel Networks Limited Resource assignment systems and methods
CN101005328B (en) * 2006-01-20 2011-11-30 中兴通讯股份有限公司 Feedback resource distribution method based on orthogonal frequency-division multiplex system
KR101062674B1 (en) * 2006-02-18 2011-09-06 삼성전자주식회사 Apparatus and method for allocating resources and performing communication in a wireless communication system
US8041362B2 (en) * 2006-03-20 2011-10-18 Intel Corporation Downlink resource allocation and mapping
JP4823756B2 (en) * 2006-04-27 2011-11-24 京セラ株式会社 Mobile communication system, base station apparatus, and frequency allocation method for mobile communication system
KR101284836B1 (en) * 2006-05-25 2013-07-10 삼성전자주식회사 Constructing method of resource assignment map for mobile communication systems
KR101344060B1 (en) * 2006-07-07 2014-01-15 삼성전자주식회사 Method and apparatus for allocating radio resource in communication system
US20080008255A1 (en) * 2006-07-10 2008-01-10 Raj Kumar Jain Multiple rate architecture for wireline communication system
CA2663976A1 (en) * 2006-10-24 2008-05-02 Qualcomm Incorporated Enabling resource partitioning for wireless communication systems
JP4722188B2 (en) * 2007-02-08 2011-07-13 株式会社エヌ・ティ・ティ・ドコモ Wireless communication system, lower and middle stations
KR20090126265A (en) * 2007-03-01 2009-12-08 가부시키가이샤 엔티티 도코모 Base station device and communication control method
US20080233966A1 (en) * 2007-03-22 2008-09-25 Comsys Communication & Signal Processing Ltd. Resource allocation apparatus and method in an orthogonal frequency division multiple access communication system
KR101365563B1 (en) 2007-03-26 2014-02-21 퍼듀 리서치 파운데이션 Decentralized Control of Feedback for Multiuser Diversity
CN101291512B (en) * 2007-04-18 2012-05-23 华为技术有限公司 Downlink resource indicating method and device
TWI446740B (en) * 2007-04-30 2014-07-21 Koninkl Philips Electronics Nv A method for communicating in a mimo context
GB2452697A (en) 2007-08-14 2009-03-18 Nec Corp Dynamically allocating new resources to a node provided with persistently allocated resources
WO2009029833A1 (en) * 2007-08-31 2009-03-05 New Jersey Institute Of Technology Scheduling processing tasks used in active network measurement
US8867455B2 (en) * 2007-10-01 2014-10-21 Qualcomm Incorporated Enhanced uplink for inactive state in a wireless communication system
CN101621845B (en) * 2008-07-01 2012-04-04 中兴通讯股份有限公司 Resource indicating method and device
KR101505118B1 (en) * 2008-12-31 2015-03-24 서울대학교산학협력단 Apparatus and method for user selection in a multiuser MIMO system
CN101841914B (en) * 2009-03-17 2013-06-26 华为技术有限公司 Dispatching method, base station equipment and communication system
KR101711657B1 (en) * 2009-10-20 2017-03-02 한국전자통신연구원 Method for managing resource in a high capacity wireless communication system
KR101080012B1 (en) 2009-12-21 2011-11-04 주식회사 케이티 User Selection Method using Efficient Channel Feedback in Multiple Antenna System and Base Station Using the same
GB2476488A (en) 2009-12-23 2011-06-29 Nec Corp Allocating physical resource blocks to a user device for transmitting uplink data
WO2011079454A1 (en) * 2009-12-31 2011-07-07 Nokia Corporation Overlapping resource signaling via code switching
CN102271399A (en) * 2010-06-02 2011-12-07 中兴通讯股份有限公司 Resource distribution realization method and system thereof and terminal
US8897220B2 (en) * 2010-09-22 2014-11-25 Qualcomm Incorporated Multi-radio coexistence
WO2012154004A2 (en) 2011-05-12 2012-11-15 엘지전자 주식회사 Method for transmitting signal using plurality of antenna ports and transmission end apparatus for same
CN102958166B (en) * 2011-08-29 2017-07-21 华为技术有限公司 A kind of resource allocation methods and resource management platform
CN103907390A (en) * 2011-09-16 2014-07-02 诺基亚通信公司 Methods and apparatus for radio resource allocation
US8797983B2 (en) * 2012-01-05 2014-08-05 Telefonaktiebolaget L M Ericsson (Publ) Apparatuses and methods for allocating spectrum resources in a wireless communication network
US20140003819A1 (en) * 2012-06-29 2014-01-02 Electronics And Telecommunications Research Institute Cloud base station in fixed-mobile converged access network and operation method thereof
CN112099924B (en) * 2020-11-18 2022-02-15 南京信易达计算技术有限公司 Container-based high-performance computing cluster system
US11651445B2 (en) * 2021-01-15 2023-05-16 Adp, Inc. Personalized pay
US20230229514A1 (en) * 2022-01-14 2023-07-20 Dell Products L.P. Intelligent orchestration of classic-quantum computational graphs

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100648475B1 (en) * 1996-01-29 2007-01-31 소니 가부시끼 가이샤 Communication resource allocation method and apparatus
CN1494236A (en) * 1997-04-24 2004-05-05 ��ʽ����Ntt����Ħ Mobile communication method and mobile communication system
DE19800953C1 (en) * 1998-01-13 1999-07-29 Siemens Ag Resource allocation in radio interface of radio communications system
US6094584A (en) * 1998-03-26 2000-07-25 Lucent Technologies, Inc. Method for operating a wireless telecommunications system
US7136662B2 (en) * 2000-02-02 2006-11-14 Ntt Docomo, Inc. Wireless base station, method of selecting wireless base station, method of multicasting, and wireless terminal
US7072315B1 (en) * 2000-10-10 2006-07-04 Adaptix, Inc. Medium access control for orthogonal frequency-division multiple-access (OFDMA) cellular networks
US6947748B2 (en) 2000-12-15 2005-09-20 Adaptix, Inc. OFDMA with adaptive subcarrier-cluster configuration and selective loading
US7047016B2 (en) * 2001-05-16 2006-05-16 Qualcomm, Incorporated Method and apparatus for allocating uplink resources in a multiple-input multiple-output (MIMO) communication system
US6662024B2 (en) * 2001-05-16 2003-12-09 Qualcomm Incorporated Method and apparatus for allocating downlink resources in a multiple-input multiple-output (MIMO) communication system
KR100455285B1 (en) * 2001-09-06 2004-11-12 삼성전자주식회사 Wireless data communication method and apparatus using multicarrier, and transmission frame format therefor
US7020110B2 (en) 2002-01-08 2006-03-28 Qualcomm Incorporated Resource allocation for MIMO-OFDM communication systems
KR100933155B1 (en) * 2002-09-30 2009-12-21 삼성전자주식회사 Device and Method for Allocating Virtual Cells in Frequency Division Multiple Access Mobile Communication System
JP4209758B2 (en) * 2003-11-20 2009-01-14 富士通株式会社 Detour communication route design method
US7979072B2 (en) * 2004-06-04 2011-07-12 Nortel Networks Limited Method and system for soft handoff in mobile broadband systems

Also Published As

Publication number Publication date
DE602005003168D1 (en) 2007-12-20
KR20050123434A (en) 2005-12-29
US7542441B2 (en) 2009-06-02
US20050288030A1 (en) 2005-12-29
EP1610573A1 (en) 2005-12-28
KR100943620B1 (en) 2010-02-24
CN1713561A (en) 2005-12-28
DE602005003168T2 (en) 2008-02-21
EP1610573B1 (en) 2007-11-07

Similar Documents

Publication Publication Date Title
CN100574176C (en) Resource allocation methods in the multi-carrier communications systems
JP4718269B2 (en) Subchannel assignment method in wireless network
Yin et al. An efficient multiuser loading algorithm for OFDM-based broadband wireless systems
CN100583705C (en) Multi-carrier communication with time division multiplexing and carrier-selective loading
CN101534559B (en) Resource allocator and resource allocation method
CN102316594B (en) Method for cross layer resource distribution and grouped dispatch in cognitive wireless network
US20070019599A1 (en) Apparatus and method for scheduling transmission of data packets in a multichannel wireless communication system
US20160028642A1 (en) Methods and systems for scheduling ofdm frames
CN102025461B (en) Frequency domain scheduling method and device
US8134946B2 (en) System and method for scheduling in relay-assisted wireless networks
CN102158307A (en) Group resource allocation system and technique
CN101940052B (en) A method for allocating resources
CN101227695A (en) Apparatus and method for distributing district communication resource
US7406058B2 (en) Methods and apparatus of transmitting user data using traffic channels
CN102196574B (en) The indicating means of Resources allocation and base station
CN101772168B (en) Method, device and communication system for resource configuration and data transmission
US8140084B2 (en) Apparatus and method for allocating Channel Quality Information (CQI) channel in wireless communication system
CN101772172A (en) Multi-band based method for allocating frequency spectrum resources, device and system thereof
EP1654892B1 (en) Method and apparatus of transmitting user data using traffic channels
CN101729366A (en) Method for distributing resources to plurality of users in multi-input multi-output system
KR20060038786A (en) System and method for between physical layer and medium access control of resource allocation in a radio connection protocol
CN101237691B (en) Method for resource distribution in OFDMA network
CN106102171A (en) A kind of wireless relay system resource allocation methods based on user rate equitable proportion
KR100837080B1 (en) The method to manage radio resources for packet scheduling, and system using the same
RU2320086C2 (en) Methods and device for transmitting user data using an information channel

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20091223

Termination date: 20190627

CF01 Termination of patent right due to non-payment of annual fee