CN109327904A - A kind of distribution method of time frequency resources - Google Patents
A kind of distribution method of time frequency resources Download PDFInfo
- Publication number
- CN109327904A CN109327904A CN201710635068.0A CN201710635068A CN109327904A CN 109327904 A CN109327904 A CN 109327904A CN 201710635068 A CN201710635068 A CN 201710635068A CN 109327904 A CN109327904 A CN 109327904A
- Authority
- CN
- China
- Prior art keywords
- resource
- feasible
- allocation plan
- block
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- 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
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to field of communication technology, specially a kind of distribution method of time frequency resources.The present invention enumerates all " feasible allocation plan " first, in accordance with transmitted data amount in resource block, then whether there is according to " feasible allocation plan " and handles respectively.If there is at least one " feasible allocation plan ", then using feasible program evaluation function these " feasible allocation plans " are calculated with priority one by one and selects the scheme progress resource allocation of wherein highest priority；If there is no " feasible allocation plan ", then enumerating " alternative allocation plan " in resource block, resource allocation is carried out to the scheme that " alternative allocation plan " calculates priority and selects wherein highest priority using alternative evaluation function；This method makes full use of the characteristics of multi-user system user diversity gain, and channel resource is distributed to the higher user of channel quality as far as possible.It is demonstrated experimentally that the method for the present invention can obtain higher overall system throughput.
Description
Technical field
The invention belongs to fields of communication technology, and in particular to a kind of distribution method of time frequency resources.
Background technique
Orthogonal frequency-time multiple access (orthogonal frequency-division multiple access, OFDMA)
Transmission technology is as 802.16 standard of IEEE[1][2]An important component obtaining more and more concerns.As
Multiple access derived from orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) accesses skill
The advantages of art, OFDMA inherits OFDM: there is higher robustness for intersymbol interference and multi-path jamming.OFDMA is provided more
Thin resource divides granularity and more flexible time-frequency resource allocating mode.Adaptive coding and modulation technique
(adaptivemodulation and coding, AMC), can be with according to the sending mode of channel communication Mass adjust- ment physical layer
User diversity is made full use of to improve the entire throughput of system.
802.16 OFDMA downlink subframe structure of IEEE as shown in Figure 1, OFDMA downlink subframe by time domain OFDM symbol
And the subchannel of frequency domain constitutes two-dimensional rectangle resource block.OFDMA down channel supports AMC, in identical transmission power and error code
In the case where rate, the signal-to-noise ratio the high, and the data volume that unit resource can be transmitted is bigger.Each user has in the subchannel of frequency domain
Different signal-to-noise ratio, if therefore resource allocation when the channel situation of each user is taken in can effectively improve and is
It unites total handling capacity.
Time/frequency source block is described with the rectangle in two-dimensional surface.The unit of the rectangular block longitudinal axis is subchannel, on the longitudinal axis
Every lattice indicate 1 sub-channels；The unit of rectangular block horizontal axis is double OFDM symbols, and every lattice expression two on horizontal axis is continuous
OFDM symbol.Resource allocation smallest particles degree is a slot (slot), and single slot is by two OFDM symbols and a sub-channels
It constitutes, as shown in the lattice in Fig. 2.In method description below, all resource allocations are using slot as minimum unit.When
The continuum that some user is transmitted is distributed on frequency resource block is known as burst transfer (burst).802.16 standard of IEEE
It must be rectangle that regulation, which distributes to the burst of user, therefore burst occupies a rectangular sub blocks in time/frequency source block.Often
A user is distributed to channel time-frequency resource allocating respectively by this method after slot request with proposing certain amount in the form of burst
A user, and each user is specified to transmit the subchannel of occupancy and the whole story position of OFDM symbol.
Channel resource allocation problem belongs to np complete problem, and since computation complexity is excessively high, discomfort shares traditional method
It is calculated in real-time, is O (n the invention proposes a kind of computation complexity2) heuristic method to resource allocation problem carry out
Approximate solution.
Summary of the invention
It is an object of the invention to propose a kind of distribution method of time frequency resources that computation complexity is low.
Distribution method of time frequency resources proposed by the present invention is the resource allocation (channel using channel quality optimization
Awareresource allocator, CARA) method solves time-frequency resource allocation problem, for rectangle constraint condition
Under time-frequency resource allocating problem.The implementation procedure of CARA method is described below.The input parameter of CARA method are as follows: one
The state of signal-to-noise of a user request and the user in each frequency domain subchannel；Export result are as follows: the result of resource allocation.
The solution procedure of CARA method is divided into two parts:
First part solves the problems, such as user's request " accurate distribution ".So-called " accurate distribution " refers to that the data of distribution resource sub-block are held
It measures equal with the data volume that user requests.The method of first part enumerates all " feasible allocation plan " first, and (it is detailed
Definition sees below).If there is no " feasible allocation plan ", then can not be user's request " accurate distribution " resource, Zhi Nengtong
Crossing second part " fuzzy allocation " is that user requests distribution resource sub-block.If there is at least one " feasible allocation plan ", that
Priority is calculated to these " feasible allocation plans " using feasible program evaluation function one by one, then according to highest priority
" feasible allocation plan " carries out resource allocation, exports resource allocation result, method end of run later.
Second part solves the problems, such as that user requests " fuzzy allocation ".So-called " fuzzy allocation " refers to the number of distribution resource sub-block
The data volume requested according to capacity and user is unequal.Second part mainly solves the feelings that user's request is unable to get " accurate distribution "
Condition.The method of second part enumerates all " alternative allocation plan " (its specific definition sees below) first, then using standby
Scheme evaluation function is selected to calculate priority one by one to these " alternative allocation plans ", then according to " alternative point of highest priority
With scheme " resource allocation is carried out, exports resource allocation result, method end of run later.
The term and symbol used during description CARA method are illustrated below:
Slot: the minimum unit of time-frequency resource allocating is made of continuous two OFDM symbols of time domain and one sub-channels of frequency domain,
As shown in Figure 2.
Burst: burst transfer distributes to the continuum that some user is transmitted in time/frequency source block, as shown in figure 1 institute
Show.
L: the time domain length (L=resource block time-domain OFDM symbol number/2) of initial time/frequency source block.
W: the frequency domain length (number of W=subchannel) of initial time/frequency source block.
L × W: the slot number that the initial time/frequency source block of L × W=includes can see that by the definition of L, W and slot.
ri: the request size (the slot number that i-th of user carries out transmission needs) of i-th of user provides r hereiniIt must
It must be integer.
REQ: the set being made of the request of each user, REQ={ r1, r2..., ri..., rn|ri∈Z}
li: distribute to the burst long of i-th of user.
wi: distribute to the burst wide of i-th of user.
factor(ri): by riAll factor pairs constitute set, riEach factor pair by riTwo factor structures
At the two factors must satisfy condition: product is equal to ri。
MAP: the data structure of time/frequency source block is described.MAP is that a horizontal axis length is L, and longitudinal extent is the two-dimemsional number of W
Group.(initial coordinate 1) is addressed to the point in coordinate with the method for (horizontal axis, the longitudinal axis): (1,1)~(1, W+2), (L+2,
1)~(L+2, W+2), (1,1)~(L+2,1), the point of (1, W+2)~(L+2, W+2), this 4 regions are except time/frequency source block
Protection band, these point numerical value be -1.The resource points (point within protection band) of MAP identify the allocation situation of the slot, such as
The fruit point indicates that this slot is not previously allocated for 0；Indicate that this slot distributes to user's request size and is if the point is i
The burst of i.
FRM (free_space_map): unappropriated resource in time/frequency source block.
Surround side: all and length tangent with FRM are equal to the line segment of tangent length, the line as having double-head arrow in Fig. 3
Shown in section.
FRM_Edge: the set of the encirclement side information of FRM is recorded.
Allocation_Scheme: the set being made of allocation plan.
The definition used during description CARA method is described in detail below:
1 " feasible allocation plan "
" feasible allocation plan " refers to burst amount of capacity and the essentially equal distribution situation of user's request data quantity, description
The data structure of " feasible allocation plan " is made of the configuration of the length and width of burst and the present position in time/frequency source block burst,
Describe the geometric dimension for the burst that a user may be assigned to and the information the location of in resource block.Structure is such as
Shown in lower: (l, w, ei, h/t), wherein eiIndicate the resource side that this burst is occupied, l represents burst in side parallel with resource side
Upward length, with slot number measurement, similar w represent burst with the length in the vertical direction of resource side, h/t indicate
The alignment thereof on this burst and resource side is head alignment/tail alignment.It can be seen that for determining resource side and burst
Length and width configuration mode, as shown in Figure 4 may be there are two types of different " feasible allocation plan "." feasible allocation plan " is last necessary
Meet: burst is completely in inside resource block, and the nonoverlapping condition of distribution region.
It is described that all " alternative allocation plan " is enumerated in resource block: to against the vertex on resource side inside resource block
The rectangular block that side length is integer is distributed, if the data capacity that rectangular block includes is greater than request data quantity, proportionally by resource
The size of sub-block is adjusted to the size close to request data capacity.
2 " alternative allocation plans "
" alternative allocation plan " is similar with the definition of " feasible allocation plan ", but there is no the limitations to burst amount of capacity.
The data structure of " alternative allocation plan " is described by the length and width configuration of burst and the present position in time/frequency source block burst
It constitutes, describes the geometric dimension for the burst that a user may be assigned to and the information the location of in resource block.Knot
Structure is as follows: (l, w, ei, h/t), wherein eiIndicate the resource side that this burst is occupied, l represents burst flat with resource side
Length on line direction, with slot number measurement, similar w represent burst with the length in the vertical direction of resource side, h/t
The alignment thereof for indicating this burst and resource side is head alignment/tail alignment.
It is described that all " alternative allocation plan " is enumerated in resource block: to against the vertex on resource side inside resource block
The rectangular block that side length is integer is distributed, if the data capacity that rectangular block includes is greater than request data quantity, proportionally by resource
The size of sub-block is adjusted to the size close to request data capacity.
3 feasible program evaluation functions
Feasible program evaluation function is defined as follows:
weight1(ci)=10 × slots+efree_space,
Wherein ciIt indicating " the feasible allocation plan " of evaluation, slots indicates that scheme corresponds to the slot number that burst includes,
efree_spaceIndicate the encirclement number of edges mesh of surplus resources block after distributing.
4 alternative evaluation functions
Alternative evaluation function is defined as follows:
weight2(ci)=capacity_metrici×coding_ratei,
Wherein:
Wherein ciIndicate " the alternative allocation plan " of evaluation, coding_rateiBelieve in the slot that expression burst is included
Transfer rate corresponding to the worst slot of road condition.
Rqst is the data volume size that user requests transmission, and bst_cap is the data capacity of burst.
The definition of 5 correlation functions
Defined function GetEdge (MAP) obtains FRM_Edge information:
Parameter: MAP is inputted,
Export result: FRM_Edge.
Steps are as follows for the calculating of GetEdge (MAP):
1) integer variable i is defined, W+1 is successively risen to from 2, increases by 1 every time.
1.1) for each value of i, setting variable edge_start first is equal to 0, edge_start and indicates to work as equal to 1
Preceding point, which is located at, to be surrounded on side, and 0 on the contrary；Then variable j initial value is set as 1.
If 1.2) j is more than L+2, jump to 1), calculating (1-value (j, i)) × (value (j, i) XOR value (j,
I-1),
Wherein value (j, i) function judges the numerical value of the position (j, i), if this numerical nonzero value (j,
I)=1；On the contrary then value (j, i)=0.XOR is xor operation.If:
1.2.1) value is 0 and edge_start is 0, j from adding 1, it jumps to 1.2)
1.2.2) value is 0 and edge_start is 1, and the current side that surrounds terminates, this information for surrounding side is recorded in FRM_
In Edge.Edge_start becomes 0, j from adding 1, jumps to 1.2)
1.2.3) value is 1 and edge_start is 1, j from adding 1, is jumped to 1.2)
1.2.4) value is 1 and edge_start is that 0, edge_start becomes 1, has found the new initial end for surrounding side, j
From adding 1, jump to 1.2)
2) integer variable i is defined, L+1 is successively risen to from 2, increases by 1 every time.
2.1) for each value of i, setting variable edge_start first is equal to 0；Then set variable j initial value as
1。
If 2.2) j is more than W+2, jumps to 2), calculate (1-value (j, i)) × (value (j, i)) XOR value
(i-1, j), if:
2.2.1) value is 0 and edge_start is 0, j from adding 1, is jumped to 2.2)
2.2.2) value is 0 and edge_start is 1, and the current side that surrounds terminates, this information for surrounding side is recorded in FRM_
In Edge.Edge_start becomes 0, j from adding 1, jumps to 2.2)
2.2.3) value is 1 and edge_start is 1, j from adding 1, is jumped to 2.2)
2.2.4) value is 1 and edge_start is that 0, edge_start becomes 1, has found the new initial end for surrounding side, j
From adding 1, jump to 2.2)
3) integer variable i is defined, 2 is successively decremented to from W+1, reduces 1 every time.
3.1) for each value of i, setting variable edge_start first is equal to 0；Then variable j initial value is set
It is 1.
If 3.2) j is more than L+2, jump to 3), calculating (1-value (j, i)) × (value (j, i) XOR value (j,
I+1), if:
3.2.1) value is 0 and edge_start is 0, j from adding 1, is jumped to 3.2)
3.2.2) value is 0 and edge_start is 1, and the current side that surrounds terminates, this information for surrounding side is recorded in FRM_
In Edge.Edge_start becomes 0, j from adding 1, jumps to 3.2)
3.2.3) value is 1 and edge_start is 1, j from adding 1, is jumped to 3.2)
3.2.4) value is 1 and edge_start is that 0, edge_start becomes 1, has found the new initial end for surrounding side, j
From adding 1, jump to 3.2)
4) integer variable i is defined, 2 is successively decremented to from L+1, reduces 1 every time.
4.1) for each value of i, setting variable edge_start first is equal to 0；Then set variable j initial value as
1。
If 4.2) j is more than W+2, jumps to 4), calculate (1-value (j, i)) × (value (j, i)) XOR value (i
+ 1, j), if:
4.2.1) value is 0 and edge_start is 0, j from adding 1, is jumped to 4.2)
4.2.2) value is 0 and edge_start is 1, and the current side that surrounds terminates, this information for surrounding side is recorded in FRM_
In Edge.Edge_start becomes 0, j from adding 1, jumps to 4.2)
4.2.3) value is 1 and edge_start is 1, j from adding 1, is jumped to 4.2)
4.2.4) value is 1 and edge_start is that 0, edge_start becomes 1, has found the new initial end for surrounding side, j
From adding 1, jump to 4.2)
Calculating terminates.
Detailed description of the invention
Fig. 1: IEEE 802.16 OFDMA downlink subframe structure；
Fig. 2: the description of time/frequency source block and the definition of slot；
Fig. 3: the definition on side is surrounded；
Fig. 4: the burst possible position inside FRM；
Fig. 5: CARA method and channel quality method performance comparison is not considered.
Specific embodiment
A specific embodiment of the invention is as follows:
Input:
The size of data r of the single transmission request of some user
The data capacity cap of user unit slot on each sub-channels1, cap2..., capN, wherein N is number of subchannels
Mesh.Output:
The result of resource allocation
Method flow:
First stage:
1) GetEdge (MAP) obtains FRM_Edge information
2) it for first resource side edge in FRM_Edge, proceeds as follows:
2.1) since the head of resource side edge, the slot for the head position subchannel that initialization slot_rate is edge
Data capacity；The frequency domain length freq_len for initializing burst is 1；According to the position of edge and move towards to determine burst in frequency
The growing direction in domain.
2.2) if freq_len is more than the allowed band of resource, jump to 2.3).If freq_len is in allowed band
It is interior, then continue following operation.If the last one subchannel slot data capacity on burst frequency domain growing direction is less than
Slot_rate, then slot_rate is replaced with the slot data capacity of the last one subchannel.Pass through ceil (r/slot_
Rate it) calculates the slot number s that transmission needs and quotient is denoted as time_len if s can be divided exactly by freq_len.If by
The resource sub-block that time_len and freq_len are constituted is completely contained in inside resource and gets along well that other have distributed resource sub-block
It overlaps, then the time_len and freq_len burst constituted is recorded in " feasible allocation plan " set.freq_len
From adding 1, repeat 2.2)
2.3) since the tail of resource side edge, the slot for the tail position subchannel that initialization slot_rate is edge
Data capacity；The frequency domain length freq_len for initializing burst is 1；According to the position of edge and move towards to determine burst in frequency
The growing direction in domain.
2.4) if freq_len is more than the allowed band of resource, jump to 2.5).If freq_len is in allowed band
It is interior, then continue following operation.If the last one subchannel slot data capacity on burst frequency domain growing direction is less than
Slot_rate, then slot_rate is replaced with the slot data capacity of the last one subchannel.Pass through ceil (r/slot_
Rate it) calculates the slot number s that transmission needs and quotient is denoted as time_len if s can be divided exactly by freq_len.If by
The resource sub-block that time_len and freq_len are constituted is completely contained in inside resource and gets along well that other have distributed resource sub-block
It overlaps, then the time_len and freq_len burst constituted is recorded in " feasible allocation plan " set.freq_len
From adding 1, repeat 2.4)
2.5) updating edge is next resource side in FRM_Edge, is returned to and 2.1) continues to execute；If in FRM_Edge
There is no more edge, then jump to 3).
3) " if feasible allocation plan " collection is combined into sky, jump to 4).Otherwise, using feasible program evaluation function to institute
" the feasible allocation plan " having calculates and records priority, and " the feasible allocation plan " for selecting wherein highest priority carries out resource
Distribution, method terminate.
Second stage:
4) the resource side edge parallel with time shaft for first in FRM_Edge, proceeds as follows:
4.1) time_len is set as the length of edge, the head position subchannel that initialization slot_rate is edge
Slot data capacity；The frequency domain length freq_len for initializing burst is 1；According to the position of edge and move towards to determine
Growing direction of the burst in frequency domain.
4.2) if freq_len is more than the allowed band of resource, jump to 4.3).If freq_len is in allowed band
It is interior, then continue following operation.If the last one subchannel slot data capacity on burst frequency domain growing direction is less than
Slot_rate, then slot_rate is replaced with the slot data capacity of the last one subchannel.If by time_len and
The resource sub-block that freq_len is constituted is completely contained in inside resource and gets along well that other have distributed resource sub-block and overlap, then
Continue following operation, otherwise 4.2) freq_len is repeated from adding 1.Calculate according to slot_rate by time_len and
The data capacity for the burst that freq_len is constituted, if data capacity is more than request data quantity, according to ratio by time_len
It is adjusted to the configuration closest to request data quantity.The time_len and freq_len burst constituted is recorded " alternative point below
With scheme " set in.4.2) freq_len is repeated from adding 1
4.5) updating edge is next resource side parallel with time shaft in FRM_Edge, is returned to and 4.1) continues to execute；
If more edge are not present in FRM_Edge, jump to 5).
5) all " alternative allocation plan " is calculated using alternative evaluation function and records priority, selected wherein
" the alternative allocation plan " of highest priority carries out resource allocation, and method terminates.
Allocation example
The process of the Demo Asset that cites a plain example below distribution:
Problem parameter:
1) 500 bit of size of data of the single transmission request of user
2) data capacity of user unit slot on each sub-channels: 72 bits (the first sub-channels), 96 bits, 48 ratios
Spy, 144 bits, 96 bits (the 5th sub-channels)
Method solution procedure:
1) first stage step 1: the length and width configuration of distribution r=6: r first can be decomposed into 6=(1 × 6,2 × 3)；At this time
MAP are as follows:
-1 -1 -1 -1 -1 -1 -1
-1 -1 -1 0 0 0 -1
-1 -1 -1 0 0 0 -1
-1 0 0 0 0 0 -1
-1 0 0 0 0 0 -1
-1 0 0 0 0 0 -1
-1 -1 -1 -1 -1 -1 -1
Its longitudinal direction is frequency domain (y), is laterally time-domain (x).
If carrying out table with (vertex 1_x coordinate, vertex 1_y coordinate, increment _ x coordinate, increment _ y-coordinate surround edge lengths)
Show the information for surrounding side, then current 6 encirclement side informations are as follows: (2,2,1,0,5)；(6,2,0,1,5)；(6,6, -1,0,3)；
(4,6,0, -1,2)；(3,4, -1,0,2)；(2,4,0, -1,3).Wherein " increment " indicates that vertex 2 becomes relative to the coordinate on vertex 1
Change the symbol in direction.
Step 2): it takes out first resource side (2,2,1,0,5) and is named as edge；
Step 2.1): it is (0,1) that initialization slot_rate, which is 72, burst growing direction, and freq_len is initialized as 1.
Step 2.2): slot number s be 7, thus calculate time_len be 7.Because of (time_len:7, freq_len:1)
Resource sub-block be more than the boundary of resource block, therefore distribute it is invalid, freq_len from plus after be set as 2；
Continue to execute 2.2): freq_len 2 continues following operation in resource allowed band.Because of the frequency domain newly increased
Subchannel slot data capacity is greater than current slot_rate, does not update slot_rate.Acquiring s is 7, freq_len due to nothing
Method divides exactly s and distributes in vain, and freq_len is set as 3 from after adding；
Execute 2.2): freq_len 3 continues following operation in resource allowed band.Because of the frequency domain letter newly increased
Slot data capacity 48 bit in road is less than current slot_rate, therefore slot_rate is updated to 48 bits.Calculate slot
It is that 11, freq_len is distributed in vain due to that can not divide exactly s that number, which obtains s, and freq_len is set as 4 from after adding；
It executes 2.2): freq_len 4 ... (not finding " feasible allocation plan ", omit detailed process herein)
Executing 2.2): freq_len 6 has been more than to execute 2.3) in resource allowed band；
Step 2.3): with step 2.1)~2.2) similar, step 2.3)~2.4) " feasible allocation plan " is not found；
Step 2.5): updating edge is next resource side (6,2,0,1,5) in FRM_Edge, is returned to and 2.1) continues to hold
Row；
Step 2.1): it is (0, -1) that initialization slot_rate, which is 96, burst growing direction, and freq_len is initialized as 1；
Step 2.2): slot number s be 6, thus calculate time_len be 6.Because of the money of (time_len:6, freq_len:1)
Source sub-block has been more than the boundary of resource block, therefore is distributed in vain, and freq_len is set as 2 from after adding；
Continue to execute 2.2): freq_len 2 continues following operation in resource allowed band.Because of the frequency domain newly increased
Subchannel slot data capacity is greater than current slot_rate, does not update slot_rate.Acquire s be 6, time_len acquire for
3, it is " feasible allocation plan " by the burst that time_len and freq_len are constituted, is recorded as (2,3, e2, h).Freq_len is certainly
3 are set as after adding；
... (omitting subsequent 2.2 herein) step does not find " feasible allocation plan ")
... (omitting 2.3 herein)~2.4) the step of, " feasible allocation plan " is not found)
Step 2.5): updating edge is next resource side (6,6, -1,0,3) in FRM_Edge, is returned to and 2.1) continues to hold
Row；
... it is that method is run the result is that increasing two new " feasible allocation plans ": (3,2, e3, h), (3,2, e3, t)
Step 2.5): updating edge is next resource side (4,6,0, -1,2) in FRM_Edge, is returned to and 2.1) continues to hold
Row；
... it is that method is run the result is that increasing two new " feasible allocation plans ": (2,3, e4, h), (2,3, e4, t)
Step 2.5): updating edge is next resource side (3,4, -1,0,2) in FRM_Edge, is returned to and 2.1) continues to hold
Row；
... " feasible allocation plan " is not found
Step 2.5): updating edge is next resource side (2,4,0, -1,3) in FRM_Edge, is returned to and 2.1) continues to hold
Row；
... " feasible allocation plan " is not found；It jumps to 3).
Step 3): for all " feasible allocation plans " by calculating, priority is identical, therefore selects first " feasible point
With scheme " actual resource allocation is carried out, resource block is following as shown (when 1 mark of secondary allocation result) after distribution.
-1 -1 -1 -1 -1 -1 -1
-1 -1 -1 1 1 1 -1
-1 -1 -1 1 1 1 -1
-1 0 0 0 0 0 -1
-1 0 0 0 0 0 -1
-1 0 0 0 0 0 -1
-1 -1 -1 -1 -1 -1 -1
Allocation result emulation
Fig. 5 illustrates CARA method and traditional resource distribution method performance comparing result, and traditional resource distribution method here is
Refer to the distribution method (non-CARA method) for not considering channel condition optimization.Two different channel/SNR conditions are emulated,
One is the channels that SNR mean value is 20dB variance 2, and another kind is that SNR mean value is the channel that 10dB variance is 2.In every class channel
Under the conditions of, CARA method non-to CARA/ is tested respectively.From simulation result it can be seen that, in identical signal-to-noise ratio condition
Under, higher data transmission rate can be obtained in the case where number of users is more using CARA method.
Distribution method of time frequency resources proposed by the present invention takes full advantage of the user diversity gain of multi-user, can effectively mention
The utilization rate of high system time frequency resource.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (2)
1. a kind of distribution method of time frequency resources, it is characterised in that the time-frequency resource allocating problem under rectangle constraint condition using such as
Lower step is solved: being enumerated all " feasible allocation plan " in resource block first, in accordance with transmitted data amount, is then pressed
It whether there is according to " feasible allocation plan " and handle respectively.
2. if there is at least one " feasible allocation plan ", then using feasible program evaluation function to these " feasible distribution
Scheme " calculates priority one by one and selects the scheme progress resource allocation of wherein highest priority；If there is no " feasible point
With scheme ", then " alternative allocation plan " is enumerated in resource block, using alternative evaluation function to " alternative distribution side
Case " calculates priority and selects the scheme progress resource allocation of wherein highest priority；
Wherein: described to enumerate all " feasible allocation plan " in resource block and follow following rule: to against resource side
Vertex is equal to the resource sub-block of request data quantity size in resource block inner part with data capacity amount size；
It is described that all " alternative allocation plan " is enumerated in resource block: to match in resource block inner part on the vertex that against resource side
Side length is the rectangular block of integer, if the data capacity that rectangular block includes is greater than request data quantity, proportionally by resource sub-block
Size be adjusted to the size close to request data capacity；
The feasible program evaluation function is defined as follows:
weight1(ci)=10 × slots+efree_space,
Wherein ciIt indicating " the feasible allocation plan " of evaluation, slots indicates that scheme corresponds to the slot number that burst includes,
efree_spaceIndicate the encirclement number of edges mesh of surplus resources block after distributing；
The alternative evaluation function is defined as follows:
weight2(ci)=capacity_metrici×coding_ratei,
Wherein:
Wherein ciIndicate " the alternative allocation plan " of evaluation, coding_rateiChannel in the slot that expression burst is included
Transfer rate corresponding to the worst slot of condition；
Here, lost is the minimum unit of time-frequency resource allocating, when burst is prominent transmission, distributes to certain in time/frequency source block
The continuum that a user is transmitted, rqst are the data volume size that user requests transmission, and bst_cap is the data of burst
Capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710635068.0A CN109327904A (en) | 2017-07-30 | 2017-07-30 | A kind of distribution method of time frequency resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710635068.0A CN109327904A (en) | 2017-07-30 | 2017-07-30 | A kind of distribution method of time frequency resources |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109327904A true CN109327904A (en) | 2019-02-12 |
Family
ID=65245390
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710635068.0A Pending CN109327904A (en) | 2017-07-30 | 2017-07-30 | A kind of distribution method of time frequency resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109327904A (en) |
-
2017
- 2017-07-30 CN CN201710635068.0A patent/CN109327904A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103051583B (en) | A kind of OFDMA resource allocation methods based on rate adaptation | |
| KR100943620B1 (en) | Method for resource allocating in a multi-carrier communication system | |
| KR20060097450A (en) | System and method for controlling resource allocation in a multicell communication system | |
| CN101146317A (en) | Resource allocation and control signaling transmission method | |
| CN101312429B (en) | Time-frequency resource distribution method for OFDM access system | |
| US11044051B2 (en) | Adaptive guards for mixed numerology systems and associated method of use | |
| CN101321142A (en) | Son-carrier wave distribution method, resource mapping apparatus, data transmission method and device | |
| CN102387587B (en) | Resource allocation method and device | |
| CN101754288B (en) | Method for dynamically allocating downlink resources of an orthogonal frequency division multiplexing system | |
| CN102148791A (en) | Communication device and receiving method | |
| CN111328146A (en) | Service scheduling method for optimizing transmission rate weight based on genetic algorithm | |
| CN102149203B (en) | Power allocation method in cognition orthogonal frequency division multiple access (OFDMA) system based on proportional fairness and interference constraints | |
| Wang et al. | Two-dimensional resource allocation for OFDMA system | |
| CN102164370A (en) | Distributed multiple input multiple output orthogonal frequency division multiplexing system and multidimensional resource allocation method | |
| Yu et al. | A novel resource allocation algorithm for real-time services in multiuser OFDM systems | |
| CN105960768A (en) | Method of coordinating radio transmitters based on a coding of level of power transmitted and corresponding transmitter | |
| CN109327904A (en) | A kind of distribution method of time frequency resources | |
| CN107682934A (en) | A kind of adaptive resource improves allocative decision in OFDM multi-user systems | |
| CN1954534A (en) | Methods and apparatus for flexible spectrum allocation in communication systems | |
| JP5970544B2 (en) | Method and apparatus for determining cell user throughput in LTE system | |
| CN105992225B (en) | A kind of frequency spectrum sharing method and system based on electric power wireless private network | |
| CN104113406B (en) | OFDMA system descending resource allocation method based on user bandwidth demand under imperfect channel state information | |
| CN101136713B (en) | Time-frequency resource allocation method of OFDM access system | |
| CN111866979A (en) | Base station and channel dynamic allocation method based on multi-arm slot machine online learning mechanism | |
| CN109219125B (en) | Power and rate self-adaptive distribution method in OFDM system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190212 |
|
| WD01 | Invention patent application deemed withdrawn after publication |