CN104507169A - Three-dimensional resource dynamic allocation method and device for reducing system uplink transmission time delay - Google Patents

Abstract

The invention discloses a three-dimensional resource dynamic allocation method and a device for reducing TD-LTE/TD-LTE-A (Time Division-Long Term Evolution/ Time Division-Long Term Evolution-A) system uplink transmission time delay. According to the method and the device, resources can be reasonably, efficiently and dynamically allocated from the three-dimensional aspects of time domain, frequency domain and airspace. The method comprises the following steps of grouping user services according to different time delays and speed requirements, and calculating resource occupancy priority parameters of user services belonging to groups; calculating a dispatching priority of the time domain, and carrying out time domain dispatch for a user according to the dispatching priority; calculating a dispatching priority of the frequency domain, and allocating frequency domain resources according to the dispatching priority; reasonably allocating a transmission mode of airspace resources according to channel quality; finally, after finishing three-dimensional resource allocation calculation, carrying out table look-up operation on a generated mapping table through a system, and carrying our quick resource allocation according to data in the table. The method and the device can achieve the aim of preferentially allocating resources for users with better channel quality, higher time delay requirement and higher speed requirement, and have the characteristics of reducing resource allocation algorithm complexity, enhancing transmission reliability and reducing packet loss probability.

Description

Three-dimensional resource dynamic allocation method and device for reducing system uplink transmission time delay

Technical Field

The invention discloses a three-dimensional resource dynamic allocation method and a three-dimensional resource dynamic allocation device for reducing uplink transmission time delay of a TD-LTE/TD-LTE-A system, and belongs to the field of wireless resource management research in a mobile communication system.

Background

At present, LTE can provide a downlink rate of up to 100Mbps, and with the development of large-scale MIMO and ultrahigh frequency transmission technologies, an experimental office of 1Gbps has been successfully built, and the theoretical rate is up to 10 Gbps. On the other hand, with the great improvement of the hardware performance of the mobile phone and the explosive increase of the application program, the user demand is developed from a single voice service into a series of services such as voice, streaming media, web browsing, online games and the like, which are integrated. The services also show the characteristics of multiple types, high time delay requirement, large rate change range and strong burstiness, so that a more efficient and flexible resource management method is needed.

The traditional resource management is mainly realized by combining methods such as admission control, power control, switching control, radio resource scheduling and allocation. The wireless resource scheduling and allocating algorithm mainly comprises a sequential scheduling and allocating method and a resource scheduling and allocating algorithm considering independent factors such as channel quality, transmission data packet size, HoL waiting time, user fairness and the like. The algorithms are optimally designed aiming at the use of the limited wireless resources of the mobile communication system, and the performance of the system is improved to a certain extent. In the future, mobile communication systems will provide more services, and radio resources will also exhibit multidimensional characteristics of time domain, frequency domain, code domain and space domain. Therefore, the allocation of radio resources with a single consideration is not sufficient, and considering only one performance aspect tends to cause the other performance aspects to deteriorate. Therefore, under the condition of carrying multiple services, the allocation algorithm of the radio resources should be designed from the multi-dimensional perspective so as to make the most of the radio resources reasonably and fully utilized and improve the performance of the system without increasing extra investment.

Disclosure of Invention

The invention aims to research a three-dimensional resource dynamic allocation method for reducing uplink transmission time delay of a TD-LTE/TD-LTE-A system, combines uplink time domain, frequency domain and space domain three-dimensional resources for practical engineering application, provides a method and a device capable of reducing transmission time delay and resource block allocation complexity of a mobile communication system, and can simply and quickly realize uplink three-dimensional resource allocation under a multi-user multi-service scene.

In order to achieve the purpose, the invention adopts the following technical scheme:

a three-dimensional resource dynamic allocation method for reducing uplink transmission time delay of a TD-LTE/TD-LTE-A system is characterized in that the following steps are repeated in each operation period:

the first step is as follows: set users to omega_UE＝{UE₁,UE₂,…,UE_i,…,UE_NGrouping services contained in N according to different performance requirements, and establishing a service grouping table;

the second step is that: calculating resource occupation priority parameter PRI of the service of the user i belonging to the service packet j according to the long-term delay and the long-term rate of the service of the user i belonging to the service packet j, the delay threshold of the service packet j and the rate required value of the service packet j_i,j(t)；

The third step: calculating the scheduling priority T of the time domain according to the maximum rate and the long-term rate of the user i at the time T, the cache size of the data volume to be sent and the priority parameter_i(T) and performing time domain scheduling (TDPS) for the users according to the T_iAnd (t) scheduling the users in sequence in a descending order until the system stops scheduling when no resources are available.

The fourth step: according to the maximum rate, long-term rate and T which can be achieved by the user i on the resource block m_i(t) calculating the scheduling priority F of the frequency domain_i,mAnd allocating Resource Blocks (RBs) to the users to be scheduled determined in the TDPS according to the resource blocks, and selecting F in the unallocated RB set and the unallocated user set_i,mMaximum RB-UE Pair { RB_x,UE_y}, RB will be_xTo a UE_yAnd with RB_xExpanding towards two sides for the center, and allocating adjacent unallocated RBs to UE_yUntil the resource blocks on the left side and the right side can not be expanded or the number of the distributed RBs is larger than or equal to the number of the RBs required by the user;

the fifth step: selecting a transmission mode of space domain resources according to the channel quality when the signal to noise ratio SINR is larger than the SINR₀When selecting to use space multiplexing to transmit data, otherwise, selecting to use space diversity to transmit data, wherein, SINR₀A threshold value for selecting a transmission mode;

and a sixth step: after the relevant calculation of time domain, frequency domain and space domain three-dimensional resource allocation is finished, generating a three-dimensional resource mapping table, wherein the three-dimensional resource mapping table comprises a user list for acquiring scheduling qualification, a corresponding relation list of users and resource blocks and a transmission form of MIMO; the system carries out table look-up operation on the mapping table and carries out rapid resource allocation according to data in the table;

the process of scheduling and RB allocation is to repeat the above first to sixth steps at multiples of the transmission time interval.

In the first step according to

<math> <mrow> <msub> <mi>G</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mo>[</mo> <msubsup> <mi>d</mi> <mi>j</mi> <mi>budget</mi> </msubsup> <mo>,</mo> <msubsup> <mi>r</mi> <mi>j</mi> <mi>budget</mi> </msubsup> <mo>]</mo> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>,</mo> <mi>J</mi> </mrow> </math> [ rule 1]

The services comprised by the users are grouped, wherein,is the delay threshold for the traffic packet j,the rate requirement value for traffic packet j.

In the second step according to

[ rule 2]

<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&alpha;</mi> <mo>)</mo> </mrow> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&alpha;</mi> <mo>)</mo> </mrow> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </math> [ rule 3]

Calculating resource occupation priority parameter PRI of service of user i belonging to service group j_i,j(t) wherein D_i,j(t) and R_i,j(t) respectively the long-term delay and the long-term rate of the service packet j belonging to the user i, alpha is a sliding window constant, alpha is more than 0 and less than 1,the method is a correction value introduced for avoiding packet loss caused by that resources are not distributed when the maximum time delay of the service is reached.

In the third step according to

<math> <mrow> <msub> <mi>T</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>&CenterDot;</mo> <msub> <mi>Q</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&CenterDot;</mo> <munder> <mi>&Sigma;</mi> <mi>j</mi> </munder> <msub> <mi>PRI</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </math> [ rule 5]

Calculating scheduling priority T of time domain_i(t) wherein r_i(t) is the maximum rate that user i can reach at time t, R_i(t) is the long-term rate of user i at time t, and the calculation method is the same as [ rule 3 ]]，Q_i(t) the buffer size of the amount of data to be sent reported by user i through the buffer status report,the resource occupancy priority parameter for user i.

In the fourth step according to

$F_{i,m}=\frac{r_{i,m}\left(t\right)}{R_{i,m\left(t\right)}}{T}_i\left(t\right)$ [ rule 6]

Calculating the scheduling priority F of the frequency domain_i,mWherein r is_i,m(t) and R_i,m(t) the maximum data transmission rate and long-term rate that can be achieved on RB m when RB m is allocated to user i, respectively; according to

[ rule 7]Calculating the number of RBs required by the user, wherein Q_iAnd (t) the buffer size of the data volume to be sent reported by the user i through the buffer status report, and M is the total number of all resource blocks in the system.

In the fourth step with RB_xExpanding towards two sides for the center, and allocating adjacent unallocated RBs to UE_yThe following rules are adopted: when [ rule 8 ] is satisfied]Time to RB_x+1To a UE_yWhen [ rule 9 ] is satisfied]Time to RB_x-1To a UE_y，

<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&le;</mo> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mi>max</mi> <mrow> <mo>(</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> </math> [ rule 8]

$\left\{\begin{array}{c}{F}_{y,x-1}>F_{y,x+1}\\ \max \left(F_{i,x-1}\right)=F_{y,x-1}\end{array}\right.$ [ rule 9]

Wherein, F_y,x-1For the UE_yFrequency domain scheduling priority value when occupying resource block x-1, F_y,x+1For the UE_yAnd the frequency domain scheduling priority value when the resource block x +1 is occupied.

The three-dimensional resource dynamic allocation device for reducing the uplink transmission time delay of the TD-LTE/TD-LTE-A system comprises:

a to-be-scheduled user queue module;

the parameter input module is used for receiving the user queue to be scheduled output by the user queue to be scheduled module, setting the performance requirement parameters of each user to be scheduled, and outputting the user queue to be scheduled with the performance requirement parameters, wherein the performance requirement parameters comprise the maximum time delay and rate requirements of the users;

the scheduler module is used for sequentially performing time domain resource allocation, frequency domain resource allocation and space domain resource allocation on the user queue to be scheduled with the performance requirement parameters;

the three-dimensional resource mapping table module is used for generating a three-dimensional resource mapping table by combining the user queue to be scheduled and the distribution result of the scheduler module, and the mapping table comprises a user list for obtaining scheduling qualification in time domain scheduling, a corresponding relation list of users and resource blocks and a transmission form of MIMO;

the scheduler module comprises:

the time domain resource distributor unit is used for grouping the services of the users according to different time delay and rate requirements, calculating resource occupation priority parameters and time domain scheduling priorities of the services of the users, performing time domain scheduling on the users according to the resource occupation priority parameters and the time domain scheduling priorities, and outputting a user list with scheduling qualification;

a frequency domain resource allocator unit for calculating a scheduling priority F of the frequency domain_i,mAnd accordingly, the frequency domain resource RB is distributed to the users with scheduling qualification output by the time domain resource distributor;

and the space domain resource distributor unit is used for selecting a transmission mode of space domain resources according to the channel quality, selecting to use space multiplexing to transmit data when the signal-to-noise ratio is greater than a set threshold value, and otherwise, selecting to use space diversity to transmit data.

Has the advantages that: according to the three-dimensional resource dynamic allocation method and device for reducing the uplink transmission time delay of the TD-LTE/TD-LTE-A system, services with different time delay and other performance requirements are grouped, users who have services sensitive to time delay and having speed guarantee requirements can obtain higher priority, the users can obtain preferential scheduling in a time domain, and more resource blocks can be obtained in a frequency domain, so that the effectiveness and reliability of user communication are enhanced. Finally, diversity and multiplexing switching is carried out in the airspace according to the channel quality, and the utilization rate of resources is further improved. The algorithm mainly works by calculating the resource occupation priority of the user in the time domain, and the frequency domain uses the allocation method of expanding resource blocks to two sides and considers the transmission form of space domain resources, so that the complexity is low in the actual system operation process, and the allocation of system resources has high efficiency.

Drawings

Fig. 1 is a flowchart of a three-dimensional resource dynamic allocation method for reducing uplink transmission delay of a TD-LTE/TD-LTE-a system.

Fig. 2 is a diagram of an implementation apparatus of a three-dimensional resource dynamic allocation method for reducing uplink transmission delay of a TD-LTE/TD-LTE-a system.

Fig. 3 is a schematic diagram of resource block allocation of a three-dimensional resource dynamic allocation method for reducing uplink transmission delay of a TD-LTE/TD-LTE-a system.

Detailed Description

The present invention is further described with reference to the following specific examples, which are intended to be illustrative only and not to be limiting of the scope of the invention, as various equivalent modifications of the invention will become apparent to those skilled in the art after reading the present invention and fall within the scope of the appended claims.

In the present embodiment, a system bandwidth of 20M is adopted, and the number of available resource blocks is 100. Each TTI contains two 0.5ms slots, each slot contains 7 OFDM symbols, and 10 TTIs constitute one radio frame length. The system specific parameters are shown in table 1.

TABLE 1 System parameters

Parameter(s)	Parameter value
		Bandwidth of	20MHz
Number of subcarriers	100
		Time slot length	0.5ms
eNodeB radius	1km
		Transmitting antenna receiving antenna	2×2
Mobile model	Random Walk
		Multipath model	Jakes model
Shadow fading model	Logarithmic model
		Path loss model	L＝128.1+37.6log10d
Speed of movement of user	3km/h

As shown in fig. 1, a three-dimensional resource dynamic allocation method for reducing uplink transmission delay of a TD-LTE/TD-LTE-a system according to an embodiment of the present invention includes the following specific implementation steps:

the first step is as follows: set users to omega_UE＝{UE₁,UE₂,…,UE_i,…,UE_NServices contained in N are grouped according to different performance requirements, and a service grouping table is established. The grouping criteria are:

<math> <mrow> <msub> <mi>G</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mo>[</mo> <msubsup> <mi>d</mi> <mi>j</mi> <mi>budget</mi> </msubsup> <mo>,</mo> <msubsup> <mi>r</mi> <mi>j</mi> <mi>budget</mi> </msubsup> <mo>]</mo> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>,</mo> <mi>J</mi> </mrow> </math> [ rule 1]

Wherein,is the delay threshold for the traffic packet j,the rate requirement value for traffic packet j. The grouping situation is as in table 2.

TABLE 2 Rate budget and maximum Transmission delay values for traffic

Type of service	Rate budget (kbps)	Maximum transmission delay (ms)
			VoIP	10(G.729 coding scheme)	50
Video	200	100
			HTTP	100	300
FTP	50	300

The second step is that: according to

[ rule 2]

Calculating resource occupation priority parameter PRI of service of user i belonging to service group j_i,j(t) of (d). Wherein D is_i,j(t) and R_i,j(t) long-term delay and long-term rate of the service belonging to service packet j for user i, respectively. D_i,j(t) and R_i,j(t) according to

<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&alpha;</mi> <mo>)</mo> </mrow> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&alpha;</mi> <mo>)</mo> </mrow> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </math> [ rule 3]

And (6) obtaining. This is a moving average weighted exponentially down, the weighted influence of each value decreasing exponentially over time. The degree of weighting is determined by a constant sliding window α (0 < α < 1), typically α being 0.5.Is a correction value introduced to avoid packet loss caused by that the service is not allocated with resources when the maximum time delay is reached,according to

[ rule 4]

And (6) obtaining. Wherein,is one of the time delay amountAnd (4) a threshold value.

The third step: performing time domain scheduling (TDPS) on users according to the resource occupation priority, wherein the scheduling priority T of the time domain_i(t) according to

<math> <mrow> <msub> <mi>T</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>&CenterDot;</mo> <msub> <mi>Q</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&CenterDot;</mo> <munder> <mi>&Sigma;</mi> <mi>j</mi> </munder> <msub> <mi>PRI</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </math> [ rule 5]

And (6) calculating. Wherein r is_i(t) is the maximum rate that user i can reach at time t, which can be found according to the Shannon formula, R_i(t) is the long-term rate of user i at time t, and the calculation method is the same as [ rule 3 ]]，Q_i(t) is the buffer size of the amount of data to be sent reported by user i via the Buffer Status Report (BSR),the resource occupancy priority parameter for user i. According to T_iAnd (t) scheduling the users in sequence in a descending order until the system stops scheduling when no resources are available.

The fourth step: the frequency domain scheduling (FDPS) procedure allocates Resource Blocks (RBs) to the users to be scheduled determined in the TDPS. According to

$F_{i,m}=\frac{r_{i,m}\left(t\right)}{R_{i,m\left(t\right)}}{T}_i\left(t\right)$ [ rule 6]

Calculating the scheduling priority F of the frequency domain_i,m. Wherein r is_i,m(t) and R_i,m(t) when RB m is allocated to user i, the maximum data transmission rate and long-term rate that can be achieved on RB m are calculated in the same way as r_i(t) and R_i(t) of (d). According to

[ rule 7]

And calculating the number of RBs required by the user i. All resource blocks RB in the system constitute RB set omega_RB＝{RB₁,RB₂,…,RB_m,…,RB_M1, …, M, initially, unallocated RB setUnallocated user setAccording to [ rule 6 ]]As shown in FIG. 3, inAndmiddle selection F_i,mMaximum RB-UE Pair { RB_x,UE_yX is more than or equal to 1 and less than or equal to M, y is more than or equal to 1 and less than or equal to N, and RB_xTo a UE_yAnd updateAndto be allocated to the UE_yResource block RB of_xIs centered atExpanding resource blocks to two sides in the interior, and considering the resource block RB at the left side_x-1And right resource block RB_x+1Satisfies the following rule

<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&le;</mo> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mi>max</mi> <mrow> <mo>(</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> </math> [ rule 8]

And RB_x+1Not allocated, then RB will be_x+1To a UE_yAnd updateFor F_y,x-1＞F_y,x+1The same applies to the case of (1). [ rule 8]Middle F_y,x-1For the UE_yFrequency domain scheduling priority value when occupying resource block x-1, F_y,x+1For the UE_yFrequency domain scheduling priority value max (F) when resource block x +1 is occupied_i,x+1)＝F_y,x+1Is shown in RB_x+1For all UEs_i，UE_yThere is a maximum frequency domain scheduling priority value. This process is repeated until RB as in FIG. 3_x-9And RB_x+7When the resource blocks are not expandable, or the number of the distributed RB is more than or equal to n_i,RBThen the fourth step is repeated for the resource allocation of the next user, as shown in FIG. 3 at RB_x+12To proceed to UE_zIs finally allocated to the UE_yResource block of [ RB ]_x-8，RB_x+6]. If it is notAnd if the resource block is empty, the allocation process of the resource block is ended.

The fifth step: after the RB allocation is completed, the user transmits on the 2 × 2 MIMO channel using the allocated RB. When the channel quality is better, i.e. SINR > SINR₀When the temperature of the water is higher than the set temperature,the spatial multiplexing is used for transmitting data, so that the data transmission rate is improved; otherwise, the data is transmitted by using space diversity, and the reliability of data transmission is improved. Wherein, the SINR₀The threshold for selecting the transmission mode may be set to 10 dB.

And a sixth step: and after the correlation calculation of the time domain, the frequency domain and the space domain three-dimensional resource allocation is finished, generating a three-dimensional resource mapping table. The table includes a list of users (time domain) that are eligible for scheduling, a list of correspondence between users and resource blocks (frequency domain), and a transmission format of MIMO (spatial domain). The system carries out table look-up operation on the mapping table and carries out rapid resource allocation according to data in the table.

Each scheduling and RB allocation process repeats the first to sixth steps at multiples of a Transmission Time Interval (TTI) (e.g., K × TTI (K is 1, 2.. K), where K is an upper bound of K).

As shown in fig. 2, the three-dimensional resource dynamic allocation apparatus for reducing uplink transmission delay of a TD-LTE/TD-LTE-a system according to an embodiment of the present invention includes a to-be-scheduled user queue module, a parameter input module, a scheduler module and a three-dimensional resource mapping table module, where the scheduler module includes a time domain resource allocator unit, a frequency domain resource allocator unit and a space domain resource allocator unit.

The parameter input module receives the user queue to be scheduled output by the user queue to be scheduled module, sets performance requirement parameters (including user maximum time delay, rate requirement and the like) of each user to be scheduled, and outputs the user queue to be scheduled with the performance requirement parameters to the scheduler module; the scheduler module carries out time domain resource allocation, frequency domain resource allocation and space domain resource allocation in sequence on the user queue to be scheduled with the performance requirement parameters, and outputs the scheduling result to the three-dimensional resource mapping table module to generate a three-dimensional resource mapping table, wherein the three-dimensional resource mapping table comprises a user list for obtaining scheduling qualification in time domain scheduling, a corresponding relation list of users and resource blocks and a transmission form of MIMO. The system carries out table look-up operation on the generated mapping table and carries out rapid resource allocation according to data in the table.

The time domain resource distributor unit of the scheduler module is used for grouping the services of the users according to different time delay and rate requirements, calculating the resource occupation priority parameter of the services of the users and the scheduling priority of the time domain, performing time domain scheduling on the users according to the resource occupation priority parameter and the scheduling priority of the time domain, and outputting a user list with scheduling qualification; the frequency domain resource distributor unit is used for calculating the scheduling priority of the frequency domain and distributing the frequency domain resource RB to the users with scheduling qualification output by the time domain resource distributor; and the spatial domain resource distributor unit is used for selecting a transmission mode of spatial domain resources according to the channel quality, selecting to use spatial multiplexing to transmit data when the signal-to-noise ratio is greater than a set threshold value, and otherwise, selecting to use spatial diversity to transmit data.

The invention can achieve the purpose of preferentially distributing resources to users with better channel quality, higher time delay requirement and higher speed requirement. On the basis of ensuring the requirement of the service rate, the uplink transmission time delay of the system is reduced. In order to meet the requirement that uplink resource blocks must be continuous, a simplified method of expanding from the best quality RB to two sides is adopted in RB allocation. The invention has the characteristics of reducing the complexity of a resource allocation algorithm, enhancing the transmission reliability of wireless signals and reducing the packet loss rate.

Claims (7)

1. A three-dimensional resource dynamic allocation method for reducing uplink transmission time delay of a TD-LTE/TD-LTE-A system is characterized by comprising the following steps in each operation period:

the first step is as follows: set users to omega_UE＝{UE₁,UE₂,…,UE_i,…,UE_NGrouping services contained in N according to different performance requirements, and establishing a service grouping table;

the second step is that: according to the long-term time delay and the long-term rate of the service group j belonging to the user i and the service group jCalculating resource occupation priority parameter PRI of service of user i belonging to service packet j_i,j(t)；

The third step: calculating the scheduling priority T of the time domain according to the maximum rate and the long-term rate of the user i at the time T, the cache size of the data volume to be sent and the resource occupation priority parameter_i(T) and performing time domain scheduling (TDPS) for the users according to the T_iAnd (t) scheduling the users in sequence in a descending order until the system stops scheduling when no resources are available. (ii) a

The fourth step: according to the maximum rate, long-term rate and T which can be achieved by the user i on the resource block m_i(t) calculating the scheduling priority F of the frequency domain_i,mAnd allocating Resource Blocks (RBs) to the users to be scheduled determined in the TDPS according to the resource blocks, and selecting F in the unallocated RB set and the unallocated user set_i,mMaximum RB-UE Pair { RB_x,UE_y}, RB will be_xTo a UE_yAnd with RB_xExpanding towards two sides for the center, and allocating adjacent unallocated RBs to UE_yUntil the resource blocks on the left side and the right side can not be expanded or the number of the distributed RBs is larger than or equal to the number of the RBs required by the user;

the fifth step: selecting a transmission mode of space domain resources according to the channel quality when the signal to noise ratio SINR is larger than the SINR₀When selecting to use space multiplexing to transmit data, otherwise, selecting to use space diversity to transmit data, wherein, SINR₀A threshold value for selecting a transmission mode;

and a sixth step: after the relevant calculation of time domain, frequency domain and space domain three-dimensional resource allocation is finished, generating a three-dimensional resource mapping table, wherein the three-dimensional resource mapping table comprises a user list for acquiring scheduling qualification, a corresponding relation list of users and resource blocks and a transmission form of MIMO; the system carries out table look-up operation on the mapping table and carries out rapid resource allocation according to data in the table; the process of scheduling and RB allocation is to repeat the above first to sixth steps at multiples of the transmission time interval.

2. The dynamic three-dimensional resource allocation method for reducing uplink transmission delay of TD-LTE/TD-LTE-A system according to claim 1, wherein said first step is based on

<math> <mrow> <msub> <mi>G</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mo>[</mo> <msubsup> <mi>d</mi> <mi>j</mi> <mi>budget</mi> </msubsup> <mo>,</mo> <msubsup> <mi>r</mi> <mi>j</mi> <mi>budget</mi> </msubsup> <mo>]</mo> <mi>j</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>J</mi> </mrow> </math> [ rule 1]

The services comprised by the users are grouped, wherein,is the delay threshold for the traffic packet j,the rate requirement value for traffic packet j.

3. The dynamic three-dimensional resource allocation method for reducing uplink transmission delay of TD-LTE/TD-LTE-A system as claimed in claim 1, wherein said second step is based on

[ rule 2]

<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&alpha;</mi> <mo>)</mo> </mrow> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&alpha;</mi> <mo>)</mo> </mrow> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </math> [ gauge ]Then 3]

Calculating resource occupation priority parameter PRI of service of user i belonging to service group j_i,j(t) wherein D_i,j(t) and R_i,j(t) respectively the long-term delay and the long-term rate of the service packet j belonging to the user i, alpha is a sliding window constant, alpha is more than 0 and less than 1,the method is a correction value introduced for avoiding packet loss caused by that resources are not distributed when the maximum time delay of the service is reached.

4. The three-dimensional resource dynamic allocation method for reducing uplink transmission delay of TD-LTE/TD-LTE-A system according to claim 3, wherein said third step is based on

<math> <mrow> <msub> <mi>T</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>&CenterDot;</mo> <msub> <mi>Q</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&CenterDot;</mo> <munder> <mi>&Sigma;</mi> <mi>j</mi> </munder> <msub> <mi>PRI</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </math> [ rule 5]

Calculating scheduling priority T of time domain_i(t) in which，r_i(t) is the maximum rate that user i can reach at time t, R_i(t) is the long-term rate of user i at time t, and the calculation method is the same as [ rule 3 ]]，Q_i(t) the buffer size of the amount of data to be sent reported by user i through the buffer status report,the resource occupancy priority parameter for user i.

5. The three-dimensional resource dynamic allocation method for reducing uplink transmission delay of TD-LTE/TD-LTE-A system according to claim 3, wherein said fourth step is based on

$F_{i,m}=\frac{r_{i,m}\left(t\right)}{R_{i,m}\left(t\right)}{T}_i\left(t\right)$ [ rule 6]

Calculating the scheduling priority F of the frequency domain_i,mWherein r is_i,m(t) and R_i,m(t) the maximum data transmission rate and long-term rate that can be achieved on RB m when RB m is allocated to user i, respectively; according to

[ rule 7]

Calculating the number of RBs required by the user, wherein Q_iAnd (t) the buffer size of the data volume to be sent reported by the user i through the buffer status report, and M is the total number of all resource blocks in the system.

6. The method as claimed in claim 1, wherein the RB is used in the fourth step_xExpanding towards two sides for the center, and allocating adjacent unallocated RBs to UE_yThe following rules are adopted: when [ rule 8 ] is satisfied]Time to RB_x+1To a UE_yWhen [ rule 9 ] is satisfied]Time to RB_x-1To a UE_y，

<math> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>&le;</mo> <msub> <mi>F</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mi>max</mi> <mrow> <mo>(</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>R</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> </math> [ rule 8]

$\left\{\begin{array}{c}{F}_{y,x-1}>F_{y,x+1}\\ \max \left(F_{i,x-1}\right)=F_{y,x-1}\end{array}\right.$ [ rule 9]

Wherein, F_y,x-1For the UE_yFrequency domain scheduling priority value when occupying resource block x-1, F_y,x+1For the UE_yAnd the frequency domain scheduling priority value when the resource block x +1 is occupied.

7. The three-dimensional resource dynamic allocation device for reducing the uplink transmission time delay of the TD-LTE/TD-LTE-A system is characterized by comprising the following components:

a queue module of the users to be scheduled,

the parameter input module is used for receiving the user queue to be scheduled output by the user queue to be scheduled module, setting the performance requirement parameters of each user to be scheduled, and outputting the user queue to be scheduled with the performance requirement parameters, wherein the performance requirement parameters comprise the maximum time delay and rate requirements of the users;

the scheduler module is used for sequentially performing time domain resource allocation, frequency domain resource allocation and space domain resource allocation on the user queue to be scheduled with the performance requirement parameters;

the three-dimensional resource mapping table module is used for generating a three-dimensional resource mapping table by combining the user queue to be scheduled and the distribution result of the scheduler module, and the mapping table comprises a user list for obtaining scheduling qualification in time domain scheduling, a corresponding relation list of users and resource blocks and a transmission form of MIMO;

the scheduler module comprises:

the time domain resource distributor unit is used for grouping the services of the users according to different time delay and rate requirements, calculating resource occupation priority parameters and time domain scheduling priorities of the services of the users, performing time domain scheduling on the users according to the resource occupation priority parameters and the time domain scheduling priorities, and outputting a user list with scheduling qualification;

the frequency domain resource distributor unit is used for calculating the scheduling priority of the frequency domain and distributing the frequency domain resource RB to the users with scheduling qualification output by the time domain resource distributor;

and the space domain resource distributor unit is used for selecting a transmission mode of space domain resources according to the channel quality, selecting to use space multiplexing to transmit data when the signal-to-noise ratio is greater than a set threshold value, and otherwise, selecting to use space diversity to transmit data.