CN104244435A - LTE uplink resource scheduling system - Google Patents

Abstract

Provided is an LTE uplink resource scheduling system. According to the LTE uplink resource scheduling system, the optimal scheduling area of each user is determined by determining the resource grouping initial position of the user, and therefore it is ensured that certain resources can be scheduled for each user without being influenced by the small-scale change of the frequency domain. The system has low calculation complexity, and the spectral efficiency is remarkably improved on the premise that the user equality principle is ensured.

Description

A kind of LTE uplink resource dispatching patcher

Technical field

The present invention relates to mobile communication technology field, particularly relate to a kind of LTE uplink resource dispatching patcher.

Background technology

In the mobile communication system in future, data, services is with a large bandwidth and at a high rate absolutely necessary, this just requires that wireless communication technology effectively can eliminate wireless channel decline to the adverse effect of transmission, and reaches higher spectrum efficiency, also will take into account the equality between user simultaneously.

LTE (Long Term Evolution) is the Long Term Evolution of UMTS (universal mobile telecommunications system) technical standard organized to set up by 3GPP (third generation partner program).LTE system introduces the critical transmissions technology such as OFDM and MIMO, significantly increase spectrum efficiency and data transmission rate, but, because the other factorses such as the volume by mobile terminal limit, more difficult configuration many antennas in terminal, therefore its uplink multi-address access scheme generally adopts single-carrier modulated and single antenna transmitting-receiving, and its power PAR sending signal is lower.

Novel radio trunking traffic technology in recent years, cooperates with each other between each entity by the communication that lets on shared, forms spaced antenna battle array, improve transmission performance.3GPP-LTE-Advanced standard is also adopted relaying technique and is improved cell coverage area, expands power system capacity and provide focus to cover.Obtain space diversity gain in the environment that the up link that relaying is assisted can decline on a large scale, reduce the impact of wireless channel decline on transmission reliability, and increase the throughput of system that can reach.But so, the scheduling of resource of system becomes a comparatively complicated combinatorial optimization problem, considers simultaneously and should ensure throughput of system, considers the equality between user again, therefore, how more effectively carrying out system resource scheduling is more and more important research topic.

Summary of the invention

The object of the invention is to be achieved through the following technical solutions.

According to the embodiment of the present invention, a kind of LTE uplink resource dispatching patcher is proposed, described system comprises base station, via node and user, wherein, described base station comprises the first uplink channel estimation unit, data transmission rate computing unit, user's equality scale factor calculating unit, resource dispatch unit, and described via node comprises the second uplink channel estimation unit;

Described first uplink channel estimation unit obtains up-to-date uplink channel fading information, comprises user to via node, via node to base station, and user is to the uplink channel fading information of base station;

Described data transmission rate computing unit be used for calling before resource packet scheduling prestore average data transfer rate, calculate the data transmission rate of user in resource grouping and after having dispatched, recalculate the average data transfer rate of user;

Described user's equality scale factor calculating unit for calculating the real-time equality scale factor of each user, and according to described real-time equality scale factor, for each user determines the initial position that resource is divided into groups;

Described resource dispatch unit is used for resource grouping to dispatch one by one to user, in each scheduling, adds to maximize real-time equality scale factor and for target, carries out the coupling of user and resource grouping;

Described second uplink channel estimation unit is used for the uplink channel information of estimating user to via node, and reports to base station.

According to the embodiment of the present invention, described first uplink channel estimation unit obtains up-to-date uplink channel fading information and specifically comprises: via node and user send uplink pilot signal respectively to base station, and base station estimates via node to the communication link of base station and user to the up channel fading information of the communication link of base station according to this pilot signal; The uplink pilot signal that user sends to via node, via node estimates the up channel fading information of user to the communication link of via node according to this pilot signal, then by up channel, this channel fading information is reported to base station.

According to the embodiment of the present invention, described data transmission rate computing unit be used for called before resource packet scheduling prestore average data transfer rate, calculate user resource grouping on data transmission rate specifically comprise: the user's average data transfer rate R calling base station stored before resource packet scheduling _m; And

Calculate the data transmission rate of user m in a kth resource grouping:

$r_{m,k}=\frac{1}{2}{\log }_2(1+\frac{P_S}{N}{\left|H_{\mathrm{SD},m}\left(k\right)\right|}^2+\frac{1}{N}\·\frac{P_S{P}_R{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2}{P_S{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2+P_R{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2+N})$

P _srepresent the transmitting power of user in each resource grouping; P _rrepresent the transmitting power of via node in each resource grouping; N is N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}the noise power of (k), N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}k () represents user and base station, user and via node and the noise component(s) of kth sub-channels between via node and base station respectively; H _{sD, m}(k), H _{sR, m}(k) and H _{rD, m}k () is user and base station, user and via node and the frequency domain channel fading information of kth sub-channels between via node and base station respectively.

According to the embodiment of the present invention, described user's equality scale factor calculating unit calculates the real-time equality scale factor of each user, and according to described real-time equality scale factor, for each user determines that the initial position that resource is divided into groups specifically comprises:

Calculate the real-time equality proportionality factors lambda of all user m on resource grouping k _{m, k}=r _{m, k}/ R _m;

All resources are divided into the resource grouping set S={1 that C size is identical according to number of users by base station ..., S _c..., S _c, the resource grouping in group is all adjacent; M≤C≤K, M represents total number of users, and K represents resource total number packets; Calculate and formation set V that they are sorted from big to small; Find the resource grouping set of each user's optimum according to set V, then by resource packet scheduling maximum for equality scale factor real-time in grouping to user, determine the resource grouping initial position of this user.

According to the embodiment of the present invention, described according to set V find the resource grouping set of each user's optimum specifically to comprise: take out set V in first element , then resource grouping set c is optimum for user m; After determining the resource grouping initial position of user m, all elements relevant with user m to resource grouping set c in set V are removed; Take out first element in new set V when upper once loop computation, and determine the resource grouping initial position of another user; Through M loop computation, the resource grouping set of each user's optimum can be found, and determine the resource grouping initial position of all users.

According to the embodiment of the present invention, resource grouping is dispatched to user by described resource dispatch unit one by one, in each scheduling, to add and for target, the coupling of carrying out user and resource grouping specifically comprises to maximize real-time equality scale factor:

In each scheduling, for all resources groupings that all users and each user can be scheduled, calculate when a certain resource grouping be scheduled scale factor that after to certain user, system is total add with, that is:

$\underset{m}{\mathrm{\Σ}}\underset{k}{\mathrm{\Σ}}{x}_{m,k}{\mathrm{\λ}}_{m,k}$

Wherein x _{m, k}∈ { 0,1}, x _{m, k}=1 represents that resource grouping k has been scheduled to user m;

In all possible scheduling, have the maximum ratio factor add and user and resource group match (m, k) complete scheduling.

According to the embodiment of the present invention, the average data transfer rate that described data transmission rate computing unit recalculates user after having dispatched comprises:

After this resource packet scheduling, the instantaneous data-transfer rate according to user recalculates average data transfer rate, that is:

$R_m=\left\{\begin{array}{c}\frac{(T-1)R_m+{\mathrm{\Σ}}_{k\∈x_m}{r}_{m,k}}{T}\\ \frac{(T-1)R_m}{T}\end{array}\right.,m\∈M$

Wherein T represents and completes scheduling times, R _musing as the reference of dispatching next time.

The LTE uplink resource dispatching patcher that the present invention proposes, by determining the resource grouping initial position of user, determine the dispatcher-controlled territory of each user's optimum, ensure that each user can be scheduled certain resource, and be not vulnerable to the impact that frequency domain changes among a small circle.This system has lower computation complexity, under the prerequisite ensureing user's principle of equality, significantly increases the availability of frequency spectrum.

Accompanying drawing explanation

By reading hereafter detailed description of the preferred embodiment, various other advantage and benefit will become cheer and bright for those of ordinary skill in the art.Accompanying drawing only for illustrating the object of preferred implementation, and does not think limitation of the present invention.And in whole accompanying drawing, represent identical parts by identical reference symbol.In the accompanying drawings:

Figure 1 show the LTE uplink resource dispatching patcher structural representation according to embodiment of the present invention.

Embodiment

Below with reference to accompanying drawings illustrative embodiments of the present disclosure is described in more detail.Although show illustrative embodiments of the present disclosure in accompanying drawing, however should be appreciated that can realize the disclosure in a variety of manners and not should limit by the execution mode of setting forth here.On the contrary, provide these execution modes to be in order to more thoroughly the disclosure can be understood, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.

The present invention proposes a kind of LTE uplink resource dispatching patcher, as shown in Figure 1, described system comprises base station, via node and user, wherein, described base station comprises the first uplink channel estimation unit, data transmission rate computing unit, user's equality scale factor calculating unit, resource dispatch unit, and described via node comprises the second uplink channel estimation unit;

Described first uplink channel estimation unit obtains up-to-date uplink channel fading information, comprises user to via node, via node to base station, and user is to the uplink channel fading information of base station;

Described data transmission rate computing unit be used for calling before resource packet scheduling prestore average data transfer rate, calculate the data transmission rate of user in resource grouping and after having dispatched, recalculate the average data transfer rate of user;

Described user's equality scale factor calculating unit for calculating the real-time equality scale factor of each user, and according to described real-time equality scale factor, for each user determines the initial position that resource is divided into groups;

Described resource dispatch unit is used for resource grouping to dispatch one by one to user, in each scheduling, adds to maximize real-time equality scale factor and for target, carries out the coupling of user and resource grouping;

Described second uplink channel estimation unit is used for the uplink channel information of estimating user to via node, and reports to base station.

Described first uplink channel estimation unit obtains up-to-date uplink channel fading information and specifically comprises: via node and user send uplink pilot signal respectively to base station, and base station estimates via node to the communication link of base station and user to the up channel fading information of the communication link of base station according to this pilot signal; The uplink pilot signal that user sends to via node, via node estimates the up channel fading information of user to the communication link of via node according to this pilot signal, then by up channel, this channel fading information is reported to base station.

Described data transmission rate computing unit be used for called before resource packet scheduling prestore average data transfer rate, calculate user resource grouping on data transmission rate specifically comprise: the user's average data transfer rate R calling base station stored before resource packet scheduling _m; And

Calculate the data transmission rate of user m in a kth resource grouping:

$r_{m,k}=\frac{1}{2}{\log }_2(1+\frac{P_S}{N}{\left|H_{\mathrm{SD},m}\left(k\right)\right|}^2+\frac{1}{N}\·\frac{P_S{P}_R{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2}{P_S{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2+P_R{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2+N})$

P _srepresent the transmitting power of user in each resource grouping; P _rrepresent the transmitting power of via node in each resource grouping; N is N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}the noise power of (k), N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}k () represents user and base station, user and via node and the noise component(s) of kth sub-channels between via node and base station respectively; H _{sD, m}(k), H _{sR, m}(k) and H _{rD, m}k () is user and base station, user and via node and the frequency domain channel fading information of kth sub-channels between via node and base station respectively.

Described user's equality scale factor calculating unit calculates the real-time equality scale factor of each user, and according to described real-time equality scale factor, for each user determines that the initial position that resource is divided into groups specifically comprises:

Calculate the real-time equality proportionality factors lambda of all user m on resource grouping k _{m, k}=r _{m, k}/ R _m;

All resources are divided into the resource grouping set S={1 that C size is identical according to number of users by base station ..., S _c..., S _c, the resource grouping in group is all adjacent; M≤C≤K, M represents total number of users, and K represents resource total number packets; Calculate and formation set V that they are sorted from big to small; Find the resource grouping set of each user's optimum according to set V, then by resource packet scheduling maximum for equality scale factor real-time in grouping to user, determine the resource grouping initial position of this user.

Described according to set V find the resource grouping set of each user's optimum specifically to comprise: take out set V in first element , then resource grouping set c is optimum for user m; After determining the resource grouping initial position of user m, all elements relevant with user m to resource grouping set c in set V are removed; Take out first element in new set V when upper once loop computation, and determine the resource grouping initial position of another user; Through M loop computation, the resource grouping set of each user's optimum can be found, and determine the resource grouping initial position of all users.

Resource grouping is dispatched to user by described resource dispatch unit one by one, in each scheduling, to add and for target, the coupling of carrying out user and resource grouping specifically comprises to maximize real-time equality scale factor:

In each scheduling, for all resources groupings that all users and each user can be scheduled, calculate when a certain resource grouping be scheduled scale factor that after to certain user, system is total add with, that is:

$\underset{m}{\mathrm{\Σ}}\underset{k}{\mathrm{\Σ}}{x}_{m,k}{\mathrm{\λ}}_{m,k}$

Wherein x _{m, k}∈ { 0,1}, x _{m, k}=1 represents that resource grouping k has been scheduled to user m;

In all possible scheduling, have the maximum ratio factor add and user and resource group match (m, k) complete scheduling.

The average data transfer rate that described data transmission rate computing unit recalculates user after having dispatched comprises:

After this resource packet scheduling, the instantaneous data-transfer rate according to user recalculates average data transfer rate, that is:

$R_m=\left\{\begin{array}{c}\frac{(T-1)R_m+{\mathrm{\Σ}}_{k\∈x_m}{r}_{m,k}}{T}\\ \frac{(T-1)R_m}{T}\end{array}\right.,m\∈M$

Wherein T represents and completes scheduling times, R _musing as the reference of dispatching next time.

Below the specific implementation process of the LTE uplink resource dispatching patcher according to the present invention's proposition:

What adopt according to a specific embodiment of the present invention is single sector junction network of a multi-user LTE up-line system, and system bandwidth is 10MHz, is divided into 48 resources groupings, and each resource grouping is made up of 12 adjacent subcarriers.Each base station is in a network equipped with two reception antennas, and performs maximum-ratio combing to received signal.Base station distance between sites is 500m, and via node is erected at distance 250m place, base station.User emission power upper limit P _m=200mW, the power of additive white Gaussian noise is-160dBm/Hz.

Channel Modeling is the frequency selective fading channels having L=4 paths, and path loss model is:

L _{loss，m，dB}＝128.1+37.61og ₁₀d _m+ξ _m

Wherein d _mbe user and base station, user and via node or the distance between via node and base station, unit is km (km).ξ _mbe Shadow Parameters, it is the stochastic variable of a normal distribution, and average is 0dB, and for user and base station, user and via node and the link between via node and base station, its standard deviation is respectively η _sD=8.0dB, η _sR=10.0dB and η _rD=6.0dB.

The present invention realizes especially by following steps:

S1: signal by the mode of point-to-point direct communication to base station transmit signals, also can be transmitted to base station by the mode of relaying by user simultaneously.At first time interval TS ₁, user m launches information (m=0,1 ...., M-1), M is total number of users, and they are received by via node and base station simultaneously.At second time interval TS ₂, the signal received is transmitted to base station by via node.The signal expression that base station and via node receive is:

$y_{\mathrm{SD},m}\left(t\right)=\sqrt{P_S}\underset{l=0}{\overset{L-1}{\mathrm{\Σ}}}{h}_{\mathrm{SD},m,l}{s}_{S,m}(t-{\mathrm{\τ}}_1)+n_{\mathrm{SD},m}\left(t\right)$

$y_{\mathrm{SR},m}\left(t\right)=\sqrt{P_S}\underset{l=0}{\overset{L-1}{\mathrm{\Σ}}}{h}_{\mathrm{SR},m,l}{s}_{S,m}(t-{\mathrm{\τ}}_1)+n_{\mathrm{SR},m}\left(t\right)$

$y_{\mathrm{RD},m}\left(t\right)=\sqrt{\frac{P_R}{P_S{\mathrm{\Σ}}_{l=0}^{L-1}{\left|h_{\mathrm{SR},m,l}\right|}^2+N}}\underset{l=0}{\overset{L-1}{\mathrm{\Σ}}}{h}_{\mathrm{RD},m,l}{y}_{\mathrm{SR},m}(t-{\mathrm{\τ}}_1)+n_{\mathrm{RD},m}\left(t\right)$

Y in formula _{sD, m}t () represents the signal that base station receives from directapath, y _{sR, m}t () represents the signal that via node receives from user side, y _{rD, m}t () represents the signal that base station receives from via node; h _{sD, m, l}, h _{sR, m, l}and h _{rD, m, l}between user m and base station respectively, the complex channel fading information of l paths between user m and via node and between via node and base station; n _{sD, m}(t), n _{sR, m}(t), n _{rD, m}t () is additive white Gaussian noise; P _srepresent the transmitting power of user in each resource grouping; P _rrepresent the transmitting power of via node in each resource grouping.

H _{sD, m, l}, h _{sR, m, l}and h _{rD, m, l}obtain manner be: via node and user send uplink pilot signal respectively to base station, and base station estimates via node to the communication link of base station and user to the up channel fading information of the communication link of base station according to this pilot signal; The uplink pilot signal that user sends to via node, via node estimates the up channel fading information of user to the communication link of via node according to this pilot signal, then by up channel, this channel fading information is reported to base station.

Corresponding to y _{sD, m}(t), y _{sR, m}(t) and y _{rD, m}(t), frequency-domain received signal Y _{sD, m}(k), Y _{sR, m}(k) and Y _{rD, m}k () can be expressed as:

$Y_{\mathrm{SD},m}\left(k\right)=\sqrt{P_S}{H}_{\mathrm{SD},m}\left(k\right)S_{S,m}\left(k\right)+N_{\mathrm{SD},m}\left(k\right)$

$Y_{\mathrm{SR},m}\left(k\right)=\sqrt{P_S}{H}_{\mathrm{SR},m}\left(k\right)S_{S,m}\left(k\right)+N_{\mathrm{SR},m}\left(k\right)$

$Y_{\mathrm{RD},m}\left(k\right)=\sqrt{\frac{P_R}{P_S{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2+N}}{H}_{\mathrm{RD},m}\left(k\right)H_{\mathrm{SD},m}\left(k\right)S_{S,m}\left(k\right)+N_{\mathrm{RD},m}\left(k\right)$

H in formula _{sD, m}(k), H _{sR, m}(k) and H _{rD, m}k () is user and base station, user and via node and the frequency domain channel fading information of kth sub-channels between via node and base station respectively; N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}k () is user and base station, user and via node and the noise component(s) of kth sub-channels between via node and base station respectively, in formula, N is N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}the noise power of (k).

Then the data transmission rate of user m in a kth resource grouping is:

$r_{m,k}=\frac{1}{2}{\log }_2(1+\frac{P_S}{N}{\left|H_{\mathrm{SD},m}\left(k\right)\right|}^2+\frac{1}{N}\·\frac{P_S{P}_R{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2}{P_S{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2+P_R{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2+N})$

The information that base station reports according to user and via node, utilizes above formula to calculate r _{m, k}, then can call user's average data transfer rate R of base station stored _m, utilize λ _{m, k}=r _{m, k}/ R _mcalculate the real-time equality scale factor of user m on resource grouping k.

S2: base station according to number of users M=10 all resources are divided into 12 S set be made up of 4 adjacent resources=1 ..., S _c..., S ₁₂.Calculate the real-time equality scale factor of all users on each resource grouping set add and and formation set V that they are sorted from big to small.

Take out first element in set V it illustrate current have the maximum ratio factor add and user and resource grouping set coupling (m, c).For user m, the resource grouping finding real-time equality scale factor maximum from grouping c, the first scheduling of resource grouping of completing user m, namely determines the initial position that resource is divided into groups.After determining the resource grouping initial position of user m, all elements relevant with user m to resource grouping set c in set V are removed.

Take out first element in new set V when upper once loop computation, and determine the resource grouping initial position of another user.Through 10 loop computations, the resource grouping set of each user's optimum can be found, and determine the resource grouping initial position of all users.

After scheduling like this, 48 resource groupings only scheduled 10 resource groupings, but determine the dispatcher-controlled territory of each user's optimum, ensure that the equality between power system capacity and user simultaneously.Remaining 38 subcarrier will be dispatched at subsequent step.

S3: in described multi-user LTE up-line system, each user can only be scheduled adjacent multiple resources grouping, and through previous step, each user has been scheduled the grouping of resource, so only can be scheduled to this user in the resource grouping on the scheduled resource grouping left side and the right.

In each scheduling, for all resources groupings that all 10 users and they can be scheduled, calculate when a certain resource grouping be scheduled scale factor that after to certain user, system is total add with, that is:

$\underset{m}{\mathrm{\Σ}}\underset{k}{\mathrm{\Σ}}{x}_{m,k}{\mathrm{\λ}}_{m,k}$

Wherein x _{m, k}∈ { 0,1}, x _{m, k}=1 represents that resource grouping k has been scheduled to user m.

In all possible scheduling, find have the maximum ratio factor add and user and resource group match (m, k), be user m scheduling resource grouping k.

Computational resource divides into groups the number be scheduled, if resource packet scheduling number reaches 48, then shows that resource grouping is all dispatched to user, enters step S4; Otherwise return step S3, continue scheduling sub-carriers.

S4: after this resource packet scheduling, can obtain the instantaneous data-transfer rate of user, now average data transfer rate is recalculated as:

$R_m=\left\{\begin{array}{c}\frac{(T-1)R_m+{\mathrm{\Σ}}_{k\∈x_m}{r}_{m,k}}{T}\\ \frac{(T-1)R_m}{T}\end{array}\right.,m\∈M$

Wherein T represents and completes scheduling times.R _musing as the reference of dispatching next time.

The above; be only the present invention's preferably embodiment, but protection scope of the present invention is not limited thereto, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; the change that can expect easily or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should described be as the criterion with the protection range of claim.

Claims (7)

1. a LTE uplink resource dispatching patcher, described system comprises base station, via node and user, wherein, described base station comprises the first uplink channel estimation unit, data transmission rate computing unit, user's equality scale factor calculating unit, resource dispatch unit, and described via node comprises the second uplink channel estimation unit;

Described first uplink channel estimation unit obtains up-to-date uplink channel fading information, comprises user to via node, via node to base station, and user is to the uplink channel fading information of base station;

Described data transmission rate computing unit be used for calling before resource packet scheduling prestore average data transfer rate, calculate the data transmission rate of user in resource grouping and after having dispatched, recalculate the average data transfer rate of user;

Described user's equality scale factor calculating unit for calculating the real-time equality scale factor of each user, and according to described real-time equality scale factor, for each user determines the initial position that resource is divided into groups;

Described resource dispatch unit is used for resource grouping to dispatch one by one to user, in each scheduling, adds to maximize real-time equality scale factor and for target, carries out the coupling of user and resource grouping;

Described second uplink channel estimation unit is used for the uplink channel information of estimating user to via node, and reports to base station.

2. the system as claimed in claim 1, described first uplink channel estimation unit obtains up-to-date uplink channel fading information and specifically comprises: via node and user send uplink pilot signal respectively to base station, and base station estimates via node to the communication link of base station and user to the up channel fading information of the communication link of base station according to this pilot signal; The uplink pilot signal that user sends to via node, via node estimates the up channel fading information of user to the communication link of via node according to this pilot signal, then by up channel, this channel fading information is reported to base station.

3. a system as claimed in claim 2, described data transmission rate computing unit be used for called before resource packet scheduling prestore average data transfer rate, calculate user resource grouping on data transmission rate specifically comprise: the user's average data transfer rate R calling base station stored before resource packet scheduling _m; And

Calculate the data transmission rate of user m in a kth resource grouping:

$r_{m,k}=\frac{1}{2}{\log }_2(1+\frac{P_S}{N}{\left|H_{\mathrm{SD},m}\left(k\right)\right|}^2+\frac{1}{N}\·\frac{P_S{P}_R{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2}{P_S{\left|H_{\mathrm{SR},m}\left(k\right)\right|}^2+P_R{\left|H_{\mathrm{RD},m}\left(k\right)\right|}^2+N})$

P _srepresent the transmitting power of user in each resource grouping; P _rrepresent the transmitting power of via node in each resource grouping; N is N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}the noise power of (k), N _{sD, m}(k), N _{sR, m}(k) and N _{rD, m}k () represents user and base station, user and via node and the noise component(s) of kth sub-channels between via node and base station respectively; H _{sD, m}(k), H _{sR, m}(k) and H _{rD, m}k () is user and base station, user and via node and the frequency domain channel fading information of kth sub-channels between via node and base station respectively.

4. a system as claimed in claim 3, described user's equality scale factor calculating unit calculates the real-time equality scale factor of each user, and according to described real-time equality scale factor, for each user determines that the initial position that resource is divided into groups specifically comprises:

Calculate the real-time equality proportionality factors lambda of all user m on resource grouping k _{m, k}=r _{m, k}/ R _m;

All resources are divided into the resource grouping set S={1 that C size is identical according to number of users by base station ..., S _c..., S _c, the resource grouping in group is all adjacent; M≤C≤K, M represents total number of users, and K represents resource total number packets; Calculate and formation set V that they are sorted from big to small; Find the resource grouping set of each user's optimum according to set V, then by resource packet scheduling maximum for equality scale factor real-time in grouping to user, determine the resource grouping initial position of this user.

5. a system as claimed in claim 4, described according to set V find the resource grouping set of each user's optimum specifically to comprise: take out set V in first element , then resource grouping set c is optimum for user m; After determining the resource grouping initial position of user m, all elements relevant with user m to resource grouping set c in set V are removed; Take out first element in new set V when upper once loop computation, and determine the resource grouping initial position of another user; Through M loop computation, the resource grouping set of each user's optimum can be found, and determine the resource grouping initial position of all users.

6. a system as claimed in claim 5, resource grouping is dispatched to user by described resource dispatch unit one by one, in each scheduling, to add and for target, the coupling of carrying out user and resource grouping specifically comprises to maximize real-time equality scale factor:

In each scheduling, for all resources groupings that all users and each user can be scheduled, calculate when a certain resource grouping be scheduled scale factor that after to certain user, system is total add with, that is:

$\underset{m}{\mathrm{\Σ}}\underset{k}{\mathrm{\Σ}}{x}_{m,k}{\mathrm{\λ}}_{m,k}$

Wherein x _{m, k}∈ { 0,1}, x _{m, k}=1 represents that resource grouping k has been scheduled to user m;

In all possible scheduling, have the maximum ratio factor add and user and resource group match (m, k) complete scheduling.

7. a system as claimed in claim 6, the average data transfer rate that described data transmission rate computing unit recalculates user after having dispatched comprises:

After this resource packet scheduling, the instantaneous data-transfer rate according to user recalculates average data transfer rate, that is:

$R_m=\left\{\begin{array}{c}\frac{(T-1)R_m+{\mathrm{\Σ}}_{k\∈x_m}{r}_{m,k}}{T}\\ \frac{(T-1)R_m}{T}\end{array}\right.,m\∈M$

Wherein T represents and completes scheduling times, R _musing as the reference of dispatching next time.