CN101247623B - TDD-OFDMA system physical layer descending resource allocation method - Google Patents
TDD-OFDMA system physical layer descending resource allocation method Download PDFInfo
- Publication number
- CN101247623B CN101247623B CN200710063941XA CN200710063941A CN101247623B CN 101247623 B CN101247623 B CN 101247623B CN 200710063941X A CN200710063941X A CN 200710063941XA CN 200710063941 A CN200710063941 A CN 200710063941A CN 101247623 B CN101247623 B CN 101247623B
- Authority
- CN
- China
- Prior art keywords
- effective coverage
- data burst
- frequency domain
- clear area
- burst
- 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
Links
Images
Abstract
The invention relates to a distribution method for the downlink resource of physical layer in a TDD-OFDMA system, comprising: distributing a DL-MAP sudden(11) according to the principle of first frequency domain and then time domain, the free region below the DL-MAP sudden is distributed for an UL-MAP sudden(12) which is smaller than the DL-MAP in length; the undistributed UL-MAP sudden(12) is distributed in the effective region in a rectangular block form according to the principle of first frequency domain and then time domain, the time domain and frequency domain of the rectangular block are described in the right formula, the undistributed data sudden is selected in the descending order in the rectangular block form to be distributed in the effective region in turn. The method is simple to realize, avoiding the solving complexity of NP complete problem, increasing the speed of the distributing of the downlink resource of the physical layer, the method can provide an optimized preallocated bandwidth, enhance the rates of resource utilization efficiency, and reduce the explosion frame rate.
Description
Technical field
The present invention relates to time division duplex-orthogonal frequency division multiple access system TIME DIVISIONDULPLEXING-Orthogonal Frequency Division Multiple Access, be called for short the TDD-OFDMA wireless telecommunication system, be specifically related to the descending resource allocation method that a kind of TDD-OFDMA system descending burst exists with rectangle time-frequency piece.
Background technology
In recent years, the OFDM technology is owing to spectrum efficiency height, anti-multipath disturb the main flow that becomes the radio communication physical-layer techniques, no matter be the follow-up evolution of 3G, LTE for example, or the WiMAX access technology of current popular, for example IEEE 802.16, IEEE 802.20 have adopted OFDM to provide multiple access to insert OFDMA as physical-layer techniques.
In the OFDMA system, on time domain, be divided into a plurality of OFDM symbols, on frequency domain, then be divided into a plurality of subchannels, each subchannel then is the set of one group of subcarrier.The time-frequency region that a common subchannel and one or several symbol cross constitute is called time slot (Slot), is the allocation unit of OFDMA system minimum.So logically just the two-dimensional rectangle form that the physical layer resources of OFDMA downlink frame is divided with time domain-frequency domain can be represented: a grid is exactly a Slot, as shown in Figure 1.
Yet, require the burst in the downlink frame to exist in some TDD-OFDMA systems with the form of rectangle time-frequency piece.Simultaneously the size of number of bursts that comprises in the downlink frame and burst be at random and can not determine in advance, promptly allow to know theoretical upper limit and lower limit.At this moment, system must be filled into the form of the burst after the scheduling with rectangular block in the descending sub frame.Tu Fa filling problem just develops into the algorithm for rectangular cutting stock problem problem like this.As everyone knows, the algorithm for rectangular cutting stock problem problem is very difficult, computational complexity theory from the mathematics, and it belongs to and has a class problem-np complete problem of high computational complexity.Even that is to say and use very fast computer, in people's the time accepted, also can not obtain the optimal solution of this problem.But for the scheduling of wireless communication system, frame length is generally Millisecond, so that the real-time of scheduling requires is very high, and the limited time can not all leave burst for and fill and use, scheduling also needs the time.Even, so just do not had any meaning so obtain an optimal solution.The filling effect of downlink burst has very big influence to the utilance of system descending resource, if the defective tightness of filling can cause some burst not have suitable rectangular area to fill, causes also not sending and will being dropped, and is called " quick-fried frame ".If the number of time slot that the defective tightness of filling, not have of can causing leaving use is too much, the bandwidth of using additive method to save has all been wasted, final result is power system capacity and spectrum efficiency reduction.
Summary of the invention
The technical issues that need to address of the present invention provide a kind of TDD-OFDMA system physical layer descending resource allocation method, can improve downlink resource utilance, reduce quick-fried frame per second, realize simply simultaneously, can satisfy the requirement of real-time.
Above-mentioned technical problem of the present invention solves like this, a kind of TDD-OFDMA system physical layer descending resource allocation method is provided, initial effective coverage is that (effective coverage is that the maximum that comprises the lower right corner time slot of system time frequency resource is not filled the rectangular area to whole descending sub frame running time-frequency resource, the clear area is the rectangular area that is not filled except that the effective coverage), may further comprise the steps:
1.1) distribute DL-MAP burst (11) by time domain principle behind the first frequency domain, unallocated rectangular area, its right side is the effective coverage, unallocated rectangular area, below is the clear area.The clear area priority allocation is given the UL-MAP burst (12) of length smaller or equal to it, and length of field is 1 during its rectangular block, and frequency domain length is the UL-MAP number of time slot.If also there is the clear area, just continue in the clear area, to attempt the distribute data burst;
1.2) if the UL-MAP burst also is not assigned with, by time domain principle behind the first frequency domain, the form with rectangular block in the effective coverage is distributed UL-MAP burst (12), this rectangular block time domain is long
Frequency domain is long
Unallocated rectangular area, its right side is the effective coverage, and the below unassigned zone is the clear area.If there is the clear area, just continue in the clear area, to attempt the distribute data burst;
1.3) select unallocated data burst in effective coverage (21), to distribute successively from big to small with the form of rectangular block.In assigning process, may have new clear area and effective coverage, should distribute the clear area earlier, distribute the effective coverage then.
According to distribution method provided by the invention, described effective coverage is that the maximum that comprises lower right corner time slot is not filled the rectangular area, and the clear area is the rectangular area that is not filled except that the effective coverage.
According to distribution method provided by the invention, described step 1.3) be if the size of current data burst can be divided exactly by the frequency domain of effective coverage, then fill this data burst according to frequency domain.Unallocated rectangular area, its right side is the effective coverage, no clear area.
According to distribution method provided by the invention, described step 1.3) be if the size of current data burst can not be divided exactly by the frequency domain of effective coverage but can be divided exactly by the time domain of effective coverage, then fill this data burst according to time domain.Its unallocated rectangular area, below is the effective coverage, no clear area.
According to distribution method provided by the invention, described step 1.3) is if the size of current data burst can not be added 1 by the size that the frequency domain of effective coverage or time domain divide exactly the current data burst can be divided exactly by the frequency domain of effective coverage, then fills this data burst according to frequency domain.Unallocated rectangular area, its right side is the effective coverage, no clear area.
According to distribution method provided by the invention, described step 1.3) be if the size of current data burst can not be divided exactly by the frequency domain of effective coverage or time domain, and the size of current data burst adds 1 and can not be divided exactly by the frequency domain of effective coverage, but can be divided exactly by the time domain of effective coverage, then fill this data burst according to time domain.Its unallocated rectangular area, below is the effective coverage, no clear area.
According to distribution method provided by the invention, described step 1.3) be if the size of current data burst can not be divided exactly by the frequency domain of effective coverage and time domain, and the size of current data burst adds 1 and can not be divided exactly by the frequency domain of effective coverage and time domain, and the effective coverage the time length of field smaller or equal to frequency domain length, then this rectangular block frequency domain is long
Time domain is long
Its unallocated rectangular area, below is the effective coverage, and unallocated rectangular area, right side is the clear area.
According to distribution method provided by the invention, described step 1.3) be if the size of current data burst can not be divided exactly by the frequency domain of effective coverage and time domain, and the size of current data burst adds 1 and can not be divided exactly by the frequency domain of effective coverage and time domain, and the effective coverage the time length of field more than or equal to frequency domain length, then this rectangular block time domain is long
Frequency domain is long
Unallocated rectangular area, its right side is the effective coverage, and unallocated rectangular area, below is the clear area.
According to distribution method provided by the invention, described step 1.1), 1.2) and 1.3) in the distribution of clear area be if the size of current data burst can not be divided exactly by the frequency domain of clear area but can be divided exactly by the time domain of clear area, then fill this data burst according to time domain.Its unallocated rectangular area, below is the clear area.
The distribution of the clear area according to distribution method provided by the invention, described step 1.1) is if the size of current data burst can not be divided exactly by the time domain of clear area but can be divided exactly by the frequency domain of clear area, then fills this data burst according to frequency domain.Unallocated rectangular area, its right side is the clear area.
According to distribution method provided by the invention, to be that the size of current data burst adds 1 if the size of current data burst can not be divided exactly by the time domain of clear area or frequency domain can be divided exactly by the time domain of clear area in the distribution of the clear area described step 1.1), then fills this data burst according to time domain.Its unallocated rectangular area, below is the clear area.
According to distribution method provided by the invention, the distribution of the clear area described step 1.1) is if the size of current data burst can not be divided exactly by the time domain of clear area or frequency domain, the size of current data burst adds 1 and can not be divided exactly by the time domain of clear area, but the size of current data burst adds 1 and can be divided exactly by the frequency domain of clear area, then fills this data burst according to frequency domain.Unallocated rectangular area, its right side is the clear area.
According to distribution method provided by the invention, the distribution of the clear area described step 1.1) is if the size of current data burst can not be divided exactly by the time domain of clear area or frequency domain, and the size of current data burst adds 1 and can not be divided exactly by the time domain of clear area or frequency domain, if the time length of field of clear area is big unlike frequency domain length, then fill this data burst according to time domain.Happening suddenly, length of field is the time length of field of clear area when shared, and shared frequency domain length is
Its unallocated rectangular area, below is the clear area.
According to distribution method provided by the invention, the distribution of the clear area described step 1.1) is if the size of current data burst can not be divided exactly by the time domain of clear area or frequency domain, and the size of current data burst adds 1 and can not be divided exactly by the time domain of clear area or frequency domain, if the time length of field of clear area is bigger than frequency domain length, then fill this data burst according to frequency domain.The frequency domain length that the shared frequency domain length that happens suddenly is the clear area, length of field is when shared
Unallocated rectangular area, its right side is the clear area.
According to distribution method provided by the invention, effective coverage that produces in system's filling process or clear area continue to fill according to the method described above.
According to distribution method provided by the invention, described distribution principle is to distribute the unallocated data burst of maximal possible length, has not had the clear area or the effective coverage of suitable data burst allocation and has put into system's clear area formation, waits for the distribution of two times scheduling.
According to distribution method provided by the invention, this method also comprises possible two times scheduling, described DL-MAP burst also is included as the number of bursts that two times scheduling is reserved to be increased, and two times scheduling continues to distribute in dispatching clear area formation that produces and the effective coverage that does not use first.
According to distribution method provided by the invention, whether described possible two times scheduling is to be met just and may to carry out according to requirement in real time.
According to distribution method provided by the invention, time domain is meant time domain from front to back behind the described first frequency domain, and frequency domain from top to bottom; Described step 1.2) effective coverage after upgrading in can be one or zero.Time domain has ensured that from front to back DL-MAP and UL-MAP burst are sent out in advance.
A kind of TDD-OFDMA system physical layer descending resource allocation method provided by the invention, compare with existing solution rectangular-shaped piece stock layout algorithm, has following advantage: the method for a kind of TDD-OFDMA system physical layer descending of the present invention resource allocation, adopt simple arithmetic comparative approach to carry out the distribution of down physical layer resource, though optimum distribution can not be provided, but avoided the complexity of finding the solution of np complete problem, improved the speed of the distribution of down physical layer resource.By detailed emulation, the preassignment bandwidth of optimization can be provided for the TDD-OFDMA network, can improve the level of resources utilization, reduce quick-fried frame per second.
Description of drawings
Further the present invention is described in detail below in conjunction with the drawings and specific embodiments.
Fig. 1 is and the corresponding system time frequency resource schematic diagram of a kind of TDD-OFDMA system physical layer descending resource allocation method of the present invention;
Fig. 2 is a DL-MAP burst allocation flow chart in the method for a kind of TDD-OFDMA system physical layer descending of the present invention resource allocation.
Fig. 3 is the flow chart of data in the clear area in the method for a kind of TDD-OFDMA system physical layer descending of the present invention resource allocation.
Fig. 4 is the flow chart that UL-MAP fills in the effective coverage in the method for a kind of TDD-OFDMA system physical layer descending of the present invention resource allocation.
Fig. 5 is the flow chart that data burst is filled in the effective coverage in the method for a kind of TDD-OFDMA system physical layer descending of the present invention resource allocation.
The initial running time-frequency resource 14*30 of Fig. 6 specific embodiment of the invention TDD-OFDMA system takies schematic diagram.
Fig. 7 specific embodiment of the invention length is that system time frequency resource takies schematic diagram after 49 the DL-MAP burst allocation.
Fig. 8 specific embodiment of the invention length is that 10 data burst one distributes the back system time frequency resource to take schematic diagram.
Fig. 9 specific embodiment of the invention length is that system time frequency resource takies schematic diagram after 32 the UL-MAP burst allocation.
Figure 10 specific embodiment of the invention length is that 25 data burst two distributes the back system time frequency resources to take schematic diagram.
Figure 11 specific embodiment of the invention length is that 233 data burst three distributes the back system time frequency resources to take schematic diagram.
Figure 12 specific embodiment of the invention length is that 33 data burst four distributes the back system time frequency resources to take schematic diagram.
Figure 13 specific embodiment of the invention length is that 8 data burst five distributes the back system time frequency resources to take schematic diagram.
Figure 14 specific embodiment of the invention length is that 8 data burst six distributes the back system time frequency resources to take schematic diagram.
Figure 15 specific embodiment of the invention length is that 4 data burst seven distributes the back system time frequency resources to take schematic diagram.
Figure 16 specific embodiment of the invention length is that 4 data burst eight distributes the back system time frequency resources to take schematic diagram.
Figure 17 specific embodiment of the invention length is that 3 data burst nine distributes the back system time frequency resources to take schematic diagram.
Embodiment
At first, the basic conception that the present invention uses is described: as shown in Figure 1, system time frequency resource is two-dimentional form, wherein each grid is represented a slot, fill DL-MAP burst 11, UL-MAP burst 12 and data burst 13, filling part is not divided into two kinds, the unallocated rectangular area that wherein comprises lower right corner slot is effective coverage 21, not filling rectangular area except that the effective coverage is clear area 22, the distribution once more of clear area 22 may produce clear area 22, but can not produce effective coverage 21.The distribution of effective coverage 21 may produce effective coverage 21, clear area 22 or the two haves both at the same time.
Second the step, guiding theory of the present invention and method be describeds, time domain from front to back, frequency domain from top to bottom progressively the propelling, comprise the steps:
(a) the scheduling back is distributed the DL-MAP burst earlier first, and the principle of distribution is a time domain behind the first frequency domain;
(b) if UL-MAP does not fill, then in the effective coverage, fill the UL-MAP burst, the principle of filling is a time domain behind the first frequency domain;
(c) then padding data burst in the effective coverage;
(d) fill DL-MAP behind the two times scheduling;
(e) padding data burst in clear area and effective coverage behind the two times scheduling.
Further, the present invention also has following characteristics: described step (a) can be further divided into following steps:
(a1) number of the burst that contains among the DL-MAP should reserve the number of bursts N that increases into two times scheduling on the number basis of the burst of scheduling first.Order according to time domain behind the first frequency domain reserves resource space for DL-MAP then;
(a2) if DL-MAP fills up effective resource space just, execution in step (b) then, otherwise execution in step (a3);
(a3) if the IDLE zone that DL-MAP fill to produce less than the needed Slot number of UL-MAP, execution in step (a4) then, otherwise execution in step (a5);
(a4) do the clear area and fill processing;
(a5) if the timeslot number of UL-MAP is few unlike the clear area timeslot number, then the time domain number of time slots that takies in the effective coverage of UL-MAP equals
The actual frequency domain subchannel number that takies of UL-MAP is
Its unallocated rectangular area, below is the clear area, and the right side is the effective coverage for distributing the rectangular area.Carry out then (a4).
Further, the present invention also has following characteristics: described step (a4) can be further divided into following steps:
(a41) with unfilled data burst according to descending sequence arrangement;
(a42) carry out the data burst circulation, if this data burst timeslot number is then ended this circulation greater than the timeslot number of current clear area.If circulation is then withdrawed from the current clear area that do not exist.
(a43) if do not satisfy condition (a42), and this data burst timeslot number can be divided exactly by the line number of current clear area, then fills this data burst according to row, simultaneously this data burst in the formation made marks.Burst below not fill area is the clear area, carries out simultaneously (a49);
(a44) if do not satisfy condition (a42) with (a43), and this data burst timeslot number can be divided exactly by the columns of current clear area, then fills this data burst according to row, simultaneously this data burst in the formation made marks.Burst right side not fill area is the clear area, carries out simultaneously (a49);
(a45) if do not satisfy condition (a42), (a43) with (a44), and this data burst timeslot number adds 1 and can be divided exactly by the line number of current clear area, then fills this data burst according to row, simultaneously this data burst in the formation made marks.Burst below not fill area is the clear area, carries out simultaneously (a49);
(a46) if do not satisfy condition (a42), (a43), (a44) with (a45), and this data burst timeslot number adds 1 and can be divided exactly by the columns of current clear area, then fills this data burst according to row, simultaneously this data burst in the formation made marks.Burst right side not fill area is the clear area, carries out simultaneously (a49);
(a47) if do not satisfy condition (a42), (a43), (a44), (a45) with (a46), and the line number of clear area is not less than columns, then fills this data burst according to row, simultaneously this data burst in the formation made marks.Burst below not fill area is the clear area, carries out simultaneously (a49);
(a48) if do not satisfy condition (a42), (a43), (a44), (a45), (a46) with (a47), and the line number of clear area then fills this data burst according to row less than columns, simultaneously this data burst in the formation made marks.Burst right side not fill area is the clear area, carries out simultaneously (a49);
(a49) upgrade the clear area;
Further, the present invention also has following characteristics: described step (b) can be further divided into following steps:
(b1) if the timeslot number of UL-MAP is few unlike the effective coverage timeslot number, then the number of time slots that takies of UL-MAP equals
The actual frequency domain subchannel number that takies of UL-MAP is
Its unfilled rectangular area, below is the clear area, carries out then (a4).
(b2) if do not satisfy (b1), then system reports an error.
Further, the present invention also has following characteristics: described step (c) can be further divided into following steps:
(c1) with unfilled data burst according to the descending sequence arrangement of timeslot number;
(c2) carry out the data burst circulation, if there is no effective coverage or effective coverage number of time slot deficiency are then carried out (c9) and are ended this circulation, otherwise carry out (c3).
(c3) if the size of current data burst can be divided exactly by the line number of effective coverage, then fill this data burst according to row, it is the effective coverage that the rectangular area is not filled in its below;
(c4) if do not satisfy the condition of (c3), and the size of current data burst can divide exactly by the columns of effective coverage, then fills this data burst according to row, and it is the effective coverage that the rectangular area is not filled on its right side;
(c5) if do not satisfy the condition of (c3), (c4), and the size of current data burst adds 1 and can be divided exactly by the line number of effective coverage, then fills this data burst according to row, and it is the effective coverage that the rectangular area is not filled in its below;
(c6) if do not satisfy (c3), (c4) and (c5) condition, and the size of current data burst adds 1 and can be divided exactly by the columns of effective coverage, and then according to filling this data burst according to row, it is the effective coverage that the rectangular area is not filled on its right side;
(c7) if do not satisfy (c3), (c4), (c5) and (c6) condition, and the time domain number of time slot of effective coverage is less than the frequency domain subchannel number, and then the frequency domain subchannel number that takies of burst is
The time domain number of time slot that takies is
It is the effective coverage that the rectangular area is not filled in its below, and its right side not fill area is the clear area, carries out simultaneously (a4);
(c8) if do not satisfy (c3), (c4), (c5), (c6) and (c7) condition, and the time domain number of time slot of effective coverage is not less than the frequency domain subchannel number, and then the time domain number of time slot that takies of burst is
The frequency domain subchannel number that takies is
It is the effective coverage that the rectangular area is not filled on its right side, and its below not fill area is the clear area, carries out simultaneously (a4);
(c9) end data burst cycle;
The 3rd step specified handling process of the present invention, comprised four parts, was respectively:
(1) allocated bandwidth of DL-MAP as shown in Figure 2, comprises following steps:
Step 201 according to the principle of time domain behind the first frequency domain, is DL-MAP burst allocation resource, comprising being two times scheduling downlink burst reserved resource;
Step 202 judges that can the downlink resource that DL-MAP obtains fill up all frequency domain subchannels just;
Step 203 judges that can the clear area that DL-MAP produces hold the UL-MAP burst;
Step 204 is filled the UL-MAP burst;
Step 205 judges whether to exist clear area (judging by the respective flag variable);
Step 206, flow process: the data burst of (four) clear area is filled and is handled;
Step 207, flow process: the data burst of (three) effective coverage is filled and is handled;
Step 208, flow process: the data burst of (four) clear area is filled and is handled;
Step 209 judges whether to exist effective coverage (judging by the respective flag variable);
Step 210, prepare to carry out in the effective coverage flow process: (two) fill the UL_MAP burst;
Step 211, ALM (because not having resource to send UL-MAP);
(2) the UL_MAP burst is filled in the effective coverage, as shown in Figure 4, fills the UL-MAP burst in the effective coverage, comprises following steps:
Step 401 according to the indexed variable of correspondence, judges whether to exist the clear area;
Step 402 according to the indexed variable of correspondence, judges whether the UL-MAP burst fills;
Step 403 judges that can the space of effective coverage hold the UL-MAP burst;
Step 404 is filled the UL-MAP burst according to the mode of Row Column;
Step 405, can the judgement effective coverage fill up the UL-MAP burst just;
Step 406 is upgraded the clear area;
Step 407, flow process: (four) fill the clear area;
Step 408 is upgraded the effective coverage;
(3) data burst of effective coverage is filled and is handled, and as shown in Figure 5, comprises following steps:
Step 501, with data burst according to from big to small sequence arrangement;
Step 502 circulates to the data burst queue;
Step 503 according to the indexed variable of correspondence, judges whether to exist the effective coverage;
Step 504 judges that can the effective coverage hold the current data burst;
Step 505, can the size of judgment data burst be divided exactly by the line number of finite region;
Step 506, can the size of judgment data burst be divided exactly by the columns of finite region;
Step 507, can the size of judgment data burst add 1 and be divided exactly by the line number of finite region;
Step 508, can the size of judgment data burst add 1 and be divided exactly by the columns of finite region;
Step 509, whether the line number of judging the effective coverage is more than or equal to columns;
Step 510 is filled current burst according to row.Calculate the columns that needs, the counter then line number that pushes away actual needs earlier;
Step 511 is upgraded the clear area;
Step 512, flow process: (four) fill the clear area;
Step 513 is upgraded the effective coverage;
Step 514 circulates to the data burst queue;
Step 515 is filled the current data burst according to row;
Step 516 is filled the current data burst according to row;
Step 517 is filled the current data burst according to row;
Step 518 is filled the current data burst according to row;
Step 519 is filled the current data burst according to row, calculates the line number that needs, the counter then columns that pushes away actual needs earlier;
(4) data burst of clear area is filled and is handled, and as shown in Figure 3, comprises following steps:
Step 301, with data burst according to the descending arrangement of timeslot number;
Step 302 circulates to the data burst queue;
Step 303 according to the indexed variable of correspondence, is judged whether current data burst has filled to finish;
Step 304 judges whether to exist the clear area according to the indexed variable of correspondence;
Step 305 judges whether the current data burst sizes surpasses the size of clear area;
Step 306 judges that can the size of current data burst be divided exactly by the line number of clear area;
Step 307 judges that can the size of current data burst be divided exactly by the columns of clear area;
Step 308 judges that can the size of current data burst add after 1 and be divided exactly by the line number of clear area;
Step 309 judges that can the size of current data burst add after 1 and be divided exactly by the columns of clear area;
Step 310 judges whether the line number of clear area is no more than columns;
Step 311 judges whether the line number of clear area surpasses columns;
Step 312 is filled the current data burst, upgrades the clear area simultaneously;
Step 313 is filled the current data burst according to row, upgrades the clear area then;
Step 314 is filled the current data burst according to row, upgrades the clear area then;
Step 315 circulates to the data burst queue.
At last, describe the method that the present invention proposes in detail in conjunction with a concrete allocation example.
One, distribute preceding state, as shown in Figure 6, specific as follows:
DL-MAP burst sizes: 49 time slots
UL-MAP burst sizes: 32 time slots
The data burst size is: 223,33,25,10,8,8,4,4,3 time slots (pressing descending)
The time domain number of time slot of frame: 14 time slots
The frequency domain number of time slot of frame: 30 time slots
System time gap always keeps count of: 14 * 30=420 number of time slot
Effective coverage information:
ActiveArea.TimeSlot=14 time slot (effective coverage time domain number of time slot)
ActiveArea.FreqSlot=30 time slot (effective coverage frequency domain number of time slot)
Clear area information:
IdleArea.HorSlot=0 time slot (clear area time domain number of time slot)
IdleArea.VerSlot=0 time slot (clear area frequency domain number of time slot)
Formation IdleList in clear area is empty (each clear area that storage scheduling is not first filled)
Two, assigning process
The first step: fill earlier DL-MAP burst 11: because DL_MAP burst 11 totally 49 time slots are filled frequency domain earlier, recharge time domain, upgrade clear area and effective coverage simultaneously.Fill the back state as shown in Figure 7, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝12
ActiveArea.FreqSlot＝30
Newborn clear area 22 information are:
IdleArea.HorSlot＝1
IdleArea.VerSlot＝11
Formation IdleList in clear area is empty
The remaining data burst sizes is respectively: 223,33,25,10,8,8,4,4,3 time slots
Second step: because the clear area of 11 time slots is arranged, but this clear area does not have the UL-MAP burst of 32 time slots big, so descending sequential search data burst, the data burst 13 of finding length 10 is the maximum bursts less than clear area 22, so fill this burst in clear area 22.Fill the back state as shown in Figure 8, specific as follows:
Wherein effective coverage 21 information are:
ActiveArea.TimeSlot＝12
ActiveArea.FreqSlot＝30
Newborn clear area 22 information are:
IdleArea.HorSlot＝1
IdleArea.VerSlot＝1
The remaining data burst sizes is respectively: 223,33,25,8,8,4,4,3 time slots
Because any one not padding data burst can not be filled in the newborn clear area of this moment, so this clear area is inserted among the clear area formation IdleList.
The 3rd step: in the effective coverage, fill UL-MAP burst 12, fill according to the order of time domain behind the first frequency domain, so the time length of field be ceil (32/30)=2, frequency domain length is 32/2=16, upgrades clear area and effective coverage simultaneously.Fill the back state as shown in Figure 9, specific as follows:
Wherein newborn effective coverage information is:
ActiveArea.TimeSlot＝10
ActiveArea.FreqSlot＝30
Newborn clear area information is:
ActiveArea.TimeSlot＝2
ActiveArea.FreqSlot＝14
The remaining data burst sizes is respectively: 223,33,25,8,8,4,4,3 time slots
The 4th step: fill out 28 little time slot effective coverages earlier, descending sequential search data burst, the data burst of finding length 25 is the maximum burst less than the clear area, so fill this burst in the clear area.Because the data burst size adds 1 length of field can be by the clear area time and divides exactly, i.e. mod (26,2)=0, so the time length of field of burst is 2, the frequency domain length of burst is 26/2=13, it is the clear area that rectangle is not filled in its below.Fill the back state as shown in figure 10, specific as follows:
Wherein effective coverage 21 information are:
ActiveArea.TimeSlot＝10
ActiveArea.FreqSlot＝30
Newborn clear area information is:
IdleArea.HorSlot＝2
IdleArea.VerSlot＝1
The remaining data burst sizes is respectively: 223,33,8,8,4,4,3 time slots
Because the newborn clear area of this moment can not be filled any one and do not filled burst, so this clear area is inserted among the clear area formation IdleList.
The 5th step: padding data burst in the effective coverage in order.Remaining first burst is 223 time slots, because the time length of field of effective coverage (10 time slot) is shorter than frequency domain length (30 time slot), so the frequency domain length of burst is ceil (223/10)=23, the time length of field be ceil (223/23)=10, not fill rectangle be the effective coverage in its below.Fill the back state as shown in figure 11, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝10
ActiveArea.FreqSlot＝7
There is not newborn clear area
The remaining data burst sizes is respectively: 33,8,8,4,4,3 time slots
The 6th step: padding data burst in the effective coverage in order.Remaining first burst is 33 time slots, because the frequency domain length of effective coverage (7 time slot) than the time length of field (10 time slot) short, so the time length of field of burst is ceil (33/7)=5, frequency domain length is ceil (33/5)=7, and it is the effective coverage that the rectangular area is not filled on its right side.Fill the back state as shown in figure 12, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝5
ActiveArea.FreqSlot＝7
There is not newborn clear area
The remaining data burst sizes is respectively: 8,8,4,4,3 time slots.
The 7th step: padding data burst in the effective coverage in order.Remaining first burst is 8 time slots, because the time length of field of effective coverage (5 time slots) is shorter than frequency domain length (7 time slots), so the frequency domain length of burst is ceil (8/5)=2, the time length of field be ceil (8/2)=4, it is the effective coverage that the rectangular area is not filled in its below, and right side not fill area is the clear area.Fill the back state as shown in figure 13, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝5
ActiveArea.FreqSlot＝5
Newborn clear area information is:
IdleArea.HorSlot＝1
IdleArea.VerSlot＝2
The remaining data burst sizes is respectively: 8,4,4,3 time slots
Because the newborn clear area of this moment can not be filled any one and do not filled burst, so this clear area is inserted among the clear area formation IdleList.
The 8th step: padding data burst in the effective coverage in order.Remaining first burst is 8 time slots, because the time length of field of effective coverage is the same with frequency domain length long, so the time length of field of burst is ceil (8/5)=2, frequency domain length is ceil (8/2)=4, it is the clear area that the rectangular area is not filled in its below, and it is the effective coverage that the rectangular area is not filled on the right side.Fill the back state as shown in figure 14, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝3
ActiveArea.FreqSlot＝5
Newborn clear area information is:
IdleArea.HorSlot＝2
IdleArea.VerSlot＝1
The remaining data burst sizes is respectively: 4,4,3 time slots
Because the newborn clear area of this moment can not be filled any one and do not filled burst, so this clear area is inserted among the clear area formation IdleList.
The 9th step: padding data burst in the effective coverage in order.Remaining first burst is 4 time slots, because 4+1 can be divided exactly by frequency domain length, so the time length of field of burst is ceil ((4+1)/5)=1, frequency domain length is 4+1=5, and its right side not fill area is the effective coverage.Fill the back state as shown in figure 15, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝2
ActiveArea.FreqSlot＝5
There is not newborn clear area
The remaining data burst sizes is respectively: 4,3 time slots
The tenth step: padding data burst in the effective coverage in order.Remaining first burst is 4 time slots because 4 can by the time length of field (2 time slot) divide exactly, so the burst time length of field be 2, frequency domain length is 4/2=2, its below not the fill area be the effective coverage.Fill the back state as shown in figure 16, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝2
ActiveArea.FreqSlot＝5
There is not newborn clear area
The remaining data burst sizes is respectively: 3 time slots
The 11 step: padding data burst in the effective coverage in order.Burst of last data is 3 time slots, because 3 can be divided exactly by frequency domain length, so the time length of field of burst is 1, frequency domain length is 3/1=3, and it is the clear area that the rectangular area is not filled on its right side.Fill the back state as shown in figure 17, specific as follows:
Wherein newborn effective coverage 21 information are:
ActiveArea.TimeSlot＝1
ActiveArea.FreqSlot＝3
There is not newborn clear area, no remaining data burst.
Because Tiao Du filling finishes first, should remain the effective coverage and keep with the clear area formation.
The 12 step: whether carry out two times scheduling according to real-time requirement decision, if continue in residue effective coverage that keeps and clear area formation, to continue the padding data burst.
Claims (10)
1. TDD-OFDMA system physical layer descending resource allocation method, it is characterized in that, initial effective coverage is a system time frequency resource, effective coverage (21) is meant that the maximum of the lower right corner time slot that comprises system time frequency resource do not fill the rectangular area, clear area (22) is the not filling rectangular area except that effective coverage (21), may further comprise the steps:
1.1) distribute DL-MAP burst (11) by time domain principle behind the first frequency domain, its clear area (22), below priority allocation is given the UL-MAP burst (12) of length smaller or equal to it;
1.2) in the effective coverage, distribute the UL-MAP burst (12) that is not assigned with by time domain principle behind the first frequency domain with the form of rectangular block, this rectangular block time domain is long
Frequency domain is long
1.3) select unallocated data burst in effective coverage (21), to distribute successively from big to small with the form of rectangular block.
2. according to the described distribution method of claim 1, it is characterized in that described step 1.3) be if the size of current data burst (13) can be divided exactly by the frequency domain of effective coverage (21), then fill this data burst according to frequency domain.
3. according to the described distribution method of claim 1, it is characterized in that, described step 1.3) is if the size of current data burst (13) can not be divided exactly by the frequency domain of effective coverage (21) but can be divided exactly by the time domain of effective coverage, then fills this data burst according to time domain.
4. according to the described distribution method of claim 1, it is characterized in that, described step 1.3) be if the size of current data burst (13) can not be divided exactly by the frequency domain or the time domain of effective coverage (21), but the size of current data burst adds 1 and can be divided exactly by the frequency domain of effective coverage, then fills this data burst according to frequency domain.
5. according to the described distribution method of claim 1, it is characterized in that, described step 1.3) be if the size of current data burst (13) can not be divided exactly by the frequency domain or the time domain of effective coverage (21), and the size of current data burst adds 1 and can be divided exactly by the time domain of effective coverage, then fills this data burst according to time domain.
6. according to the described distribution method of claim 1, it is characterized in that, described step 1.3) be if the size of current data burst (13) can not by the frequency domain of effective coverage (21) or time domain divides exactly and the size of current data burst adds 1 and can not be divided exactly by the frequency domain of effective coverage or time domain, effective coverage if (21) the time length of field less than its frequency domain length, then this rectangular block frequency domain is long
Time domain is long
7. according to the described distribution method of claim 1, it is characterized in that, described step 1.3) be if the size of current data burst (13) can not by the frequency domain of effective coverage (21) or time domain divides exactly and the size of current data burst adds 1 and can not be divided exactly by the frequency domain of effective coverage or time domain, if the time length of field of effective coverage (21) is not less than its frequency domain length, then this rectangular block time domain is long
Frequency domain is long
8. according to the described distribution method of claim 1, it is characterized in that described step 1.1) in clear area (22) can be used for allocated length smaller or equal to its unallocated data burst and further can continue to distribute distributing the back to produce new clear area once more.
9. according to the described distribution method of claim 7, it is characterized in that described distribution principle is to distribute the unallocated data burst of maximal possible length, has not had the clear area of suitable data burst allocation and has put into system's clear area formation.
10. according to claim 1 or 8 described distribution methods, it is characterized in that, this method also comprises possible two times scheduling, described DL-MAP burst also is included as the number of bursts that two times scheduling is reserved to be increased, and two times scheduling continues to distribute in the clear area formation of scheduling generation first and the effective coverage that does not use.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710063941XA CN101247623B (en) | 2007-02-14 | 2007-02-14 | TDD-OFDMA system physical layer descending resource allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710063941XA CN101247623B (en) | 2007-02-14 | 2007-02-14 | TDD-OFDMA system physical layer descending resource allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101247623A CN101247623A (en) | 2008-08-20 |
| CN101247623B true CN101247623B (en) | 2011-07-13 |
Family
ID=39947769
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710063941XA Expired - Fee Related CN101247623B (en) | 2007-02-14 | 2007-02-14 | TDD-OFDMA system physical layer descending resource allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101247623B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848181B (en) * | 2009-03-25 | 2012-12-12 | 清华大学 | Digital signal sending method based on time-frequency domain conversation |
| CN101853178B (en) * | 2010-04-30 | 2012-07-04 | 西安交通大学 | Description method of reconfigurable hardware resource in scheduling |
| WO2017156686A1 (en) * | 2016-03-14 | 2017-09-21 | 华为技术有限公司 | Resource indication method, and related device and system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1604511A (en) * | 2004-11-11 | 2005-04-06 | 上海交通大学 | Adaptive power distribution method for multi-antenna OFDM communication system |
-
2007
- 2007-02-14 CN CN200710063941XA patent/CN101247623B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1604511A (en) * | 2004-11-11 | 2005-04-06 | 上海交通大学 | Adaptive power distribution method for multi-antenna OFDM communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101247623A (en) | 2008-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8184585B2 (en) | Method for allocating resource, and method for transmitting resource allocation information | |
| CN102036387B (en) | Method for indicating wireless channel resource allocation, base station, decoding method and terminal | |
| US9936502B2 (en) | System and method for OFDMA resource management in WLAN | |
| CN103931262A (en) | Data scheduling method and device | |
| EP3322242A1 (en) | Method and device for transmission instruction, transmission triggering and transmission implementation for multi-station | |
| CN102448179A (en) | Resource distribution method and eNodeB (evolved Node B) | |
| CN102404862B (en) | Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system | |
| CN101247623B (en) | TDD-OFDMA system physical layer descending resource allocation method | |
| CN104754744A (en) | LTE community resource distribution method and device and base station | |
| CN109245872B (en) | A kind of WLAN upgoing O FDMAPPDU transmission method and device | |
| CN101176277B (en) | Method and apparatus for indexing physical channels in an ofdma system | |
| CN102333377A (en) | Resource allocation method capable of avoiding cross-slot interference in long-term evolution time division system | |
| CN106561066A (en) | Method and device for reducing network delay in wireless communication | |
| CN102457972B (en) | Same-frequency networking method and device for different time slot allocations | |
| CN103458520A (en) | Allocation method and device of uplink frequency domain resources | |
| CN101815300B (en) | Cell frequency assignment method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system | |
| CN109803383A (en) | The method and device sent and received information | |
| CN109391417A (en) | Method, device and system for transmitting downlink control information | |
| CN102595587A (en) | Business transmission method and device | |
| CN101588631A (en) | Method for controlling channel resource allocation | |
| CN103379630B (en) | A kind of Physical Downlink Shared Channel resource allocation methods and system | |
| JP5052672B2 (en) | Method of filling a WiMAX downlink frame by a base station of a WiMAX network | |
| CN102547727B (en) | Frequency band distribution method and device | |
| CN102255841A (en) | Methods and apparatuses for resource mappings of broadcast control channel and data channel | |
| CN113098665B (en) | Processing method and device for allocating PUCCH resources for CSI |
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: 20110713 Termination date: 20160214 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |