CN102624505B - Resource distribution method used in high speed uplink packet access and base station - Google Patents

Abstract

The invention provides a resource distribution method used in high speed uplink packet access and a base station, which aim to solve the problem that UE (user equipment) fails mostly when selecting an E-TFC [E-DCH (enhanced dedicated channel) transport format combination] for a resending process, so that business rate is reduced. The resource distribution method includes that the numbers of the time slots are distributed by different methods for a resending process and a new process, the number of time slots distributed for the resending process is identical to that of time slots distributed for an initial sending process, accordingly, UE can select a TB (transmission block) with the size identical to that of a TB in the initial sending process when selecting the E-TFC for the resending process, and successful selection for the resending process is guaranteed to the greatest extent. If the UE successfully selects resending processes mostly, whether an idle new process is available or not does not need to be considered, and accordingly the problem that data of the resending process are abandoned so that data rate is reduced is avoided.

Description

Resource allocation methods and base station in High Speed Uplink Packet access

Technical field

The application relates to wireless communication technology, particularly relates to resource allocation methods and base station in High Speed Uplink Packet access.

Background technology

HSUPA (High Speed Uplink Packet Access, High Speed Uplink Packet access) be WCDMA (the Wideband Code Division Multiple Access recently proposing, Wideband Code Division Multiple Access (WCDMA)) up link enhancement mode version, its main target comprises: in fast-changing wireless environment, obtain larger throughput; By service integration, transmit multiple business simultaneously; According to the service quality of business (QoS) demand, limit corresponding transmission delay.

UE (User Equipment, subscriber equipment) E-TFC (E-DCH Transport Format Combination, E-DCH transformat combination) select to refer to: E-TFC selects entity basis from UTRAN (UMTS Terrestrial Radio Access Network, the wireless access network of UMTS) schedule information that receives carries out E-TFC selection, and the different data flow being mapped on E-DCH (Enhanced Dedicated Channel strengthens special control) selected.The concrete configuration of E-TFC entity is controlled SAP (Service Access Point Service Access point) by RRC (control of Radio Resource Control Radio Resource) by MAC and is provided.E-TFC selects also multiplexing function to be played to control action simultaneously.

The selection course relative complex of the selection course that realizes E-TFC in HSUPA system TFC than before, the selection course of E-TFC comprise determine send data logical channel set, determine the transmission block size that physical resource can support and from definite logical channel set, generate 3 processes of maximum MAC-e PDU (Protocol Data Unit, protocol Data Unit) that meet transmission block size.

In the E-TFC of UE selection course, UE adopts HARQ (Hybrid Automatic Repeat Request, mixed automatic retransfer request) process to transmit data, and the operation of the HARQ of HSUPA is:

Be preferably the resource of the retransmission process distribution of UE according to base station, UE preferentially selects retransmission process transmitting HARQ data, if base station is for retransmitting course allocation resource (as the resource such as number of time slot, code channel) failure, be the needs that the mandate of base station cannot meet UE retransmission process transmission data, now UE cannot use retransmission process transmission data.Then, judge whether available free new process, if available free new process, the resource that is new course allocation according to base station, select new process transmission HARQ data, if there is no idle new process, UE can abandon the data in retransmission process at most, and selects this retransmission process to carry out transmitting HARQ data as new process.

In the operating process of above-mentioned HARQ, when UE selects retransmission process transmission data, need the condition meeting to be, the size of the transmission block (TB piece) finding according to the number of time slot of base station assigns in E-TFC selects, the TB block size need to just pass data with this retransmission process time is the same.But, in the agreement of HSUPA system, defining 5ms TTI E-DCH TB set of blocks, the TB block size that wherein different time-gap number is corresponding seldom has the situation of coincidence.And in existing resource allocation methods, it is retransmission process and new course allocation number of time slot that base station adopts following computing formula unified:

Wherein, for the TB block size of this retransmission process, bo is the data volume that the maximum resource piece in surplus resources can carry.N _tskfor the maximum number of time slot in surplus resources, be the number of time slot N of the E-PUCH channel of current configuration (E-DCH Physical Uplink Channel strengthens uplink physical channel) _tse-PUCH number of time slot N with the support of UE ability _uEsmaller value.

From above-mentioned computing formula, base station is finally for retransmitting the number of time slot N of course allocation _realnumber of time slot while probably just passing data with this retransmission process is inconsistent, actual proof, and this possibility occurs often.

Therefore by above protocol description, if the number of time slot of the number of time slot of the data of E-PUCH channel in the time of HARQ transfer of data when retransmitting different, UE is failed in most cases when do E-TFC selection for retransmission process.Further, according to protocol description, if UE does not now have idle new process, UE can abandon the data in retransmission process, causes the rate reduction of business.

Summary of the invention

The application provides resource allocation methods and the base station in High Speed Uplink Packet access, to solve UE failure in most cases when do E-TFC selection as retransmission process, and then the problem that causes service rate to reduce.

In order to address the above problem, the application discloses the resource allocation methods in High Speed Uplink Packet access, comprising:

Travel through the retransmission process of terminal, obtain the transport block size of current retransmission process;

Number of time slot using described retransmission process in the time just passing data is as current maximum number of time slot N _tsk;

Be N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Calculate the actual bearer data volume of described maximum resource piece;

In the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described retransmission process, the number of time slot that is defined as described retransmission process distribution is N _tsk, and adjust spreading factor according to the actual bearer data volume of described maximum resource piece, be defined as according to the spreading factor after adjusting the code channel resource that described retransmission process distributes.

Preferably, described method also comprises: by described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration, as described maximum number of time slot N _tskwhile being less than or equal to the remaining time slots number of channel configuration, be N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece.

Preferably, described method also comprises: as described maximum number of time slot N _tskwhile being greater than the remaining time slots number of channel configuration, traveling through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, traveling through the new process of terminal.

Preferably, described method also comprises: in the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described retransmission process, travel through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, traveling through the new process of terminal.

Preferably, described method also comprises: be N when there is no number of time slot in surplus resources piece _tskresource Block time, travel through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

Preferably, described method also comprises: the new process of traversal terminal, judge in new process whether available free new process, and if had, travel through the new process of described free time and carry out resource distribution; If not, ending resource distributes.

Preferably, describedly judge in new process whether available free new process, comprising: the number x that records the new process of m subframe scheduling before terminal; Maximum terminal schedulable process sum n are deducted to the number x of the new process of described subframe scheduling, then deduct all retransmission process numbers, obtain idle new process number; Wherein, m, x and n are all more than or equal to 0, and n=m+1; If the new process number of described free time is greater than 0, represent available free new process; Otherwise representing does not have idle new process.

Preferably, described is N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece, comprising: be N from number of time slot _tskresource Block in search Resource Block that code channel number the is maximum Resource Block as carrying data volume maximum, and using this Resource Block as current maximum resource piece.

Preferably, the new process that described traversal is idle is also carried out resource distribution, comprising: the new process that traversal is idle, and obtain the transport block size of current new process, and determine maximum number of time slot and the maximum resource piece of described new process; Calculate the actual bearer data volume of the maximum resource piece of described new process; In the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described new process, according to the actual bearer data volume of the transport block size of described new process, maximum number of time slot and maximum resource piece, be calculated as the number of time slot of described new course allocation, and be defined as the code channel resource of described new course allocation according to spreading factor; In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described new process, the maximum number of time slot of described new process is all distributed to described new process, and be defined as the code channel resource of described new course allocation according to spreading factor.

Preferably, described maximum number of time slot and the maximum resource piece of determining new process, comprising: the maximum number of time slot using the smaller value of the time slot data of the number of time slot of channel configuration and terminal capability support as described new process; To in surplus resources piece, carry the Resource Block of data volume maximum as the maximum resource piece of described new process.

The application also provides the base station of distributing for the resource of High Speed Uplink Packet access, and described base station comprises resource distribution module, and described resource distribution module comprises:

Transport block size acquiring unit, for traveling through the retransmission process of terminal, obtains the transport block size of current retransmission process;

Maximum number of time slot determining unit, for using described retransmission process the number of time slot in the time just passing data as current maximum number of time slot N _tsk;

Maximum resource piece determining unit, for being N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Carrying data volume computing unit, for calculating the actual bearer data volume of described maximum resource piece;

Resource allocation unit, in the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described retransmission process, the number of time slot that is defined as described retransmission process distribution is N _tsk, and adjust spreading factor according to the actual bearer data volume of described maximum resource piece, be defined as according to the spreading factor after adjusting the code channel resource that described retransmission process distributes.

Preferably, described resource distribution module also comprises: comparing unit, and for by described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration, as described maximum number of time slot N _tskwhile being less than or equal to the remaining time slots number of channel configuration, triggering described maximum resource piece determining unit is N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece.

Preferably, as described maximum number of time slot N _tskwhile being greater than the remaining time slots number of channel configuration, or be N when there is no number of time slot in surplus resources piece _tskresource Block time, described comparing unit triggers described transport block size acquiring unit and travels through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travels through the new process of terminal; In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described retransmission process, described resource allocation unit triggers described transport block size acquiring unit and travels through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

Preferably, described resource distribution module also comprises: idle process judging unit, when traveling through the new process of terminal, judge in new process whether available free new process, and if had, travel through the new process of described free time and carry out resource distribution; If not, ending resource distributes.

Preferably, described idle process judging unit comprises:

Record subelement, for recording the number x of the new process of m subframe scheduling before terminal;

Idle process computation subunit, for maximum terminal schedulable process sum n are deducted to the number x of the new process of described subframe scheduling, then deducts all retransmission process numbers, obtains idle new process number; Wherein, m, x and n are all more than or equal to 0, and n=m+1;

Judgment sub-unit, is greater than 0 for the new process number when the described free time, judges available free new process; Otherwise judgement does not have idle new process.

Compared with prior art, the application comprises following advantage:

First, the application is in resource allocation process, adopt diverse ways to distribute number of time slot for retransmission process and new process, resource for retransmission process is distributed, consider the number of time slots of distributing when this retransmission process just passes, the identical number of time slot of number of time slots while distributing with first biography for this retransmission process, UE is in the time doing E-TFC selection for retransmission process like this, the same TB piece of TB block size can choose with first biography time, thus the chosen successfully of retransmission process ensured as far as possible.If UE selects retransmission process success in most cases, just without considering again whether available free new process, and then avoid because retransmission process data are dropped the problem that causes data rate reduction.

Secondly, the application has also improved the resource allocation methods to new process, safeguard the mode of UE idle process by MAC layer, if there is no idle new process, ending resource distributes, the data that no longer abandon retransmission process are transmitted data by UE, and this makes resource allocation process can control more exactly the use of UE process, further avoided because retransmission process data are dropped the problem that causes data rate to reduce.

Certainly, arbitrary product of enforcement the application not necessarily needs to reach above-described all advantages simultaneously.

Brief description of the drawings

Fig. 1 is the flow chart of the resource allocation methods in a kind of High Speed Uplink Packet access described in the embodiment of the present application;

Fig. 2 A is the flow chart of the retransmission process resource allocation methods in a kind of High Speed Uplink Packet access described in another embodiment of the application;

Fig. 2 B is the flow chart of the new process resource distribution method in a kind of High Speed Uplink Packet access described in another embodiment of the application;

Fig. 3 is the structure chart of a kind of base station of distributing for the resource of High Speed Uplink Packet access described in the embodiment of the present application.

Embodiment

For the above-mentioned purpose, the feature and advantage that make the application can become apparent more, below in conjunction with the drawings and specific embodiments, the application is described in further detail.

Analyze prior art, the identical factor of number of time slots of distributing when not considering that number of time slots that the resource of retransmission process is distributed need to be with first biography in current resource allocation methods, the distribution method of the number of time slots adopting for retransmission process and new process is identical, therefore when likely occurring number of time slots that retransmission process resource distributes and just passing, the number of time slots of distribution is different, and causing UE is that retransmission process is E-TFC and selects failed situation.In this case, if UE leisureless new process at the moment, the data of retransmission process will be dropped, the problem that causes customer service speed to decline.

Based on the analysis of above reason, the application improves the resource allocation process of retransmission process, in resource allocation process, adopt diverse ways to distribute number of time slot for retransmission process and new process, resource for retransmission process is distributed, consider the number of time slots of distributing when this retransmission process just passes, the identical number of time slot of number of time slots while distributing with first biography for this retransmission process, UE is in the time doing E-TFC selection for retransmission process like this, the equirotal TB piece of TB piece (transmission block) can choose with first biography time, thereby ensure the chosen successfully of retransmission process as far as possible.

Below by embodiment, the realization flow of method described in the application is elaborated.

Shown in Fig. 1, it is the flow chart of the resource allocation methods in a kind of High Speed Uplink Packet access described in the embodiment of the present application.

In the embodiment of the present application, the resource allocation methods of optimizing in base station is as follows:

Step 1: the transport block size TBS that obtains retransmission process or new process;

Described transport block size TBS is the cache size that base station is pre-assigned to UE process.

UE adopts HARQ process to transmit data, and HARQ process comprises the process, retransmission process and the idle process that are taking.Wherein, the described process taking refers to that UE uses this process transmission data, thinks that this HARQ process is occupied before not receiving feedback information; Retransmission process refers to that UE receives NACK (Negative Acknowledgement, the negative response) feedback corresponding to this process, and this process is waited for and being retransmitted; Idle process refers to current unoccupied, can be used to transmit the process of new data.New process as herein described has comprised idle process and the process taking, and still, that step 1 is obtained is the transport block size TBS of the new process of free time.

The transport block size TBS of UE process, before the above-mentioned process of UE is carried out to resource distribution, has just been determined in base station, therefore ought carry out resource and divide timing directly to obtain described TBS.Illustrate respectively how base station obtains the transport block size TBS of retransmission process and new process below, specific as follows:

First, according to User Priority queuing result, take out the highest UE of priority, then the highest UE of this priority is distributed to the resources such as power and number of time slot, code channel

Then, travel through the process of this high priority UE, preferentially travel through retransmission process, if the transmission of data blocks mistake of a process, and fed back NACK (Negative Acknowledgement, negative response), this process is retransmission process.Base station, in the time pre-determining the TBS of retransmission process, is the transport block size in the time just passing data by retransmission process as the size of this process re-transmitting data block.Timing is divided in resource in base station, directly obtains retransmission process wherein t represents current TTI, i.e. time t, and k represents user k, R represents the retransmission process R of user k.

If all retransmission process have traveled through, travel through new process.Base station, in the time pre-determining the TBS of new process, is according to UE _kthe SI information (Scheduling Information, schedule information) that the last time reports, or again according to the current UE buffer area data length of statistics, obtain preallocated TBS size.Concrete, a kind of simple method is, directly using the TBS comprising in SI information as preallocated TBS size; Slightly complicated, can, according to the current UE buffer area data length of statistics, the TBS comprising be revised, then using revised TBS as preallocated TBS size in SI information.Certainly, can also have additive method to determine the TBS size of new process, the embodiment of the present application does not limit this.Timing is divided in resource in base station, directly obtains the TBS size of new process.

Step 2: search maximum resource piece in residue E-PUCH resource and the maximum number of time slot of E-PUCH;

1) retransmission process

If retransmission process, the maximum number of time slot N of E-PUCH _tskfor the number of time slot of this retransmission process in the time just passing data.By described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration, if maximum timeslot number N _tskbe less than or equal to the remaining time slots number of the E-PUCH channel of current TTI configuration, the number of time slot in traversal residue E-PUCH is N _tskresource Block, and from these Resource Block, search the Resource Block that can carry maximum amount of data as the maximum resource piece of this retransmission process, proceed resource and distribute.Wherein, the number of time slot of the E-PUCH channel of described current TTI configuration has configured in the time of initialization community.

It should be noted that, the carrying data volume of above-mentioned Resource Block is not a value accurately calculating, but is weighed and drawn by other indexs, as weighed by code channel number, number of time slot or power etc.

Therefore be, N from multiple number of time slot _tsksurplus resources piece in search maximum resource piece method have multiple.For example,, at maximum number of time slot N _tskin number of time slot situation about equating during with first biography, Resource Block that can be using Resource Block maximum code channel number as carrying data volume maximum, and using this Resource Block as current maximum resource piece; In addition, also can be using prominent Resource Block as maximum resource piece.If maximum number of time slot N _tsknumber of time slot during with first biography can be unequal, can also be using Resource Block maximum number of time slot as maximum resource piece.

If there is no number of time slot in residue E-PUCH is N _tskresource Block, jump to step 1, continue traversal UE other processes.

By described maximum number of time slot N _tskwhile comparing with the remaining time slots number of channel configuration, if maximum timeslot number N _tskthe remaining time slots number that is greater than the E-PUCH channel of current TTI configuration, also jumps to step 1, continues other processes of traversal UE.

In the time of other processes of traversal UE, if also have retransmission process, preferentially travel through retransmission process, if all retransmission process have traveled through, start to travel through new process.

It should be noted that above-mentioned definite maximum number of time slot N _tskafter, can give tacit consent to direct execution and determine the step of maximum resource piece, that is: be N from described number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece.If carry out unsuccessful, i.e. described maximum number of time slot N _tskbe greater than the remaining time slots number of channel configuration, cannot find number of time slot is N _tsksurplus resources piece, in this case, then jump to step 1, continue traversal UE other processes.

But, in order to optimize above-mentioned processing, reduce the step of unnecessary definite maximum resource piece, can increase the step of a comparison, that is: first by described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration, if maximum timeslot number N _tskbe less than or equal to the remaining time slots number of the E-PUCH channel of current TTI configuration, determine maximum resource piece according to above-mentioned steps; If maximum timeslot number N _tskbe greater than the remaining time slots number of the E-PUCH channel of current TTI configuration, omit the step of determining maximum resource piece, leap to step 1, continue other processes of traversal UE.Therefore, the processing after this optimization has improved allocation efficiency of resource.

And, also it should be noted that, in practical application, although total number of time slot of channel configuration is just definite in the time that cell initial is set up, but may reconfigure due to a variety of causes, therefore can omit unnecessary step for further guarantee, also can adopt the processing mode after above-mentioned optimization.

As from the foregoing, the embodiment of the present application is for retransmission process, and the number of time slot using this retransmission process in the time just passing data is as maximum timeslot number, and searches maximum resource piece based on this maximum timeslot number.

2) new process

If new process, the maximum number of time slot N of E-PUCH _tskfor the number of time slot N of the E-PUCH channel of current configuration _tse-PUCH number of time slot N with the support of UE ability _uEsmaller value:

N _tsk＝min{N _ts，N _UE}；

In the time searching the maximum resource piece of new process, can adopt greedy algorithm, find the Resource Block that can carry maximum amount of data in residue E-PUCH resource as maximum resource piece.As previously mentioned, the data volume that can carry by Resource Block of measurement such as code channel number, number of time slot or power.

Wherein, described greedy algorithm generally can obtain satisfied solution fast because it saved for look for optimal solution want limit the plenty of time that likely must expend.Greedy algorithm is often done optimal selection taking present case as basis, and does not consider various possible overall condition.For example, when shopping is given change at ordinary times, for making the coin number of change minimum, do not consider all various schemes of delivering of changing, but from the Currency Type of maximum face amount, consider each Currency Type by the order of successively decreasing, first as far as possible by the Currency Type of large face amount, in the time of the amount of money of the large face amount Currency Type of deficiency, just go the Currency Type of consideration time a kind of less face amount.Here it is is using greedy algorithm.This method is always optimum here, is because the coin kind of bank to its distribution and the ingenious arrangement of coin value.As only have face amount to be respectively the coin of 1,5 and 11 units, and wish to give for change the coin that total value is 15 units.Press greedy algorithm, should look for the coin of 1 11 unit face amount and the coin of 41 unit face amounts, give altogether 5 coins for change.But optimum solution should be the coin of 35 unit face amounts.

Based on described greedy algorithm, the process that the employing greedy algorithm described in the embodiment of the present application is searched maximum resource piece no longer describes in detail.

Based on the method for above new process being determined maximum resource piece and maximum number of time slot, in the process of the new process of traversal, before entering step 2, can also increase following preferred steps:

Preferably, judge in the new process of UE whether available free new process, if available free process continues the new process of free time to carry out resource allocation process; If there is no idle process, jump to step 6, finish the resource allocation process of this UE.

In the new process of UE, new process that may be all, also may be partly in the hop free time all in transmission data.The object of described preferred steps is: do not have idle new process at UE, can equally not abandon the data in retransmission process at most according to prior art, and select this retransmission process to pass new data, but be no longer this UE Resources allocation, the resource until reallocate while waiting until available free new process, therefore this UE does not re-use the retransmission process transmission new data that has abandoned data, but starts transmission while waiting until available free new process again.So just can avoid because retransmission process data are dropped the problem that causes data rate to reduce.

Concrete, safeguard the mode of UE idle process by following MAC layer, can judge in the new process of UE whether available free new process by following sub-step:

Sub-step 1, records the number x of the new process of m subframe scheduling before terminal;

Sub-step 2, deducts the number x of the new process of described subframe scheduling by maximum terminal schedulable process sum n, then deducts all retransmission process numbers, obtains idle new process number;

Wherein, m, x and n are all more than or equal to 0, and n=m+1;

Sub-step 3, if idle new process number is greater than 0, represents available free new process; Otherwise representing does not have idle new process.

For instance, suppose that the maximum schedulable processes sum of UE n are 4, remove the process that current subframe may be dispatched, at least also remaining 3 can dispatching process, therefore from UE, in 3 subframes, record the number of the new process of these 3 subframe schedulings.Then, calculate according to following formula:

Number-retransmission process number of front 3 the new processes of subframe scheduling of idle process number=4-UE.

Step 3: according to RoT (Rise Over Thermal, hot noise increase) UPH (the UE transmission power headroom that reports of thresholding and UE, be defined as the ratio of UE maximum transmission power and the required transmitting power of E-PUCH), the license of the calculation of parameter power such as SNPL (Serving and Neighbour Cell Pathloss, the information on path loss of this community and adjacent cell);

According to the last UE _kthe path loss metric SNPL (being expressed as LMetric) reporting, is calculated as and meets RoT and the power 2 of needs: obtaining power license 2 is

The last UE _kthe power headroom reporting be designated as power license 3.

Power license 2 is permitted in 3 and is got smaller value with power now, SF is the minimum spreading factor that maximum resource piece is corresponding.Described P _thcan be used for step 4 and calculate the data volume that maximum resource piece can carry.

Wherein, RoT _totalthe threshold value of total received power of signal deployment, P _ebaseit is the interference volume of the E-PUCH channel of closed power maintenance.

Step 4: calculate the data volume that ENI number and maximum resource piece can carry;

Wherein, described ENI number is the multiplexing E-UCCH at E-PUCH channel (E-DCH Uplink Control Channel, namely ascending control channel) number.

First,, according to the mapping relations of code check and signal to noise ratio, obtain corresponding code check.It should be noted that, first determine modulation system: according to in two curves, shine upon respectively code check, modulation system corresponding to curve that code check is large is selected modulation system, if UE only supports QPSK (Quadrature Phase Shift Keying, Quadrature Phase Shift Keying, a kind of digital modulation mode), do not carry out modulation system selection.

Then, according to the mapping relations of code check and ENI, obtain ENI number by code check v (t), next calculate the actual bearer data volume of maximum resource piece under this code check:

$\mathrm{bo}=(\frac{704}{\mathrm{SF}}*N_{\mathrm{tsk}}-N_{\mathrm{sysmbol}\_\mathrm{euuch}})*v\left(t\right)*\mathrm{bit}\_\mathrm{mod};$

Wherein, N _tskfor this user can use maximum number of time slot, v (t) is normalized value corresponding to code check under selected modulation system, and bit_mod value is fixed as 4, N _{sysmbol_euuch}for the symbolic number sum of multiple E-UCCH and TPC (Transmit Power Control, through-put power control), i.e. N _{sym_eucch}=ENI*17; .

Wherein, SF is minimum spreading factor, Δ _harqit is the power headroom of signal deployment.

Step 5: determine the number of time slot distributing, and rated output, code channel resource;

1) if the transport block size of terminal processes be more than or equal to the actual bearer data volume bo of maximum resource piece:

If be new course allocation resource, take whole time slot N _tsk, code check finally uses v (t), and taking according to spreading factor SF of code channel resource determined.For example, between SF and the code channel quantity that takies, have certain corresponding relation, as SF=1, distribute 16 code channels, SF=2, distributes 8 code channels, and SF=4 distributes 4 code channels, and SF=8 distributes 2 code channels, and SF=16 distributes 1 code channel.Certainly, also can adopt additive method of the prior art, determine taking of code channel resource according to SF, the embodiment of the present application does not limit this.

Being calculated as of power: wherein, PRRI is the abbreviation of Power Resource Relative Indicator, refers to power resource relevant information.

If for retransmitting course allocation resource, jump to step 1 other processes that travel through UE.In the time of other processes of traversal UE, if also have retransmission process, preferentially travel through retransmission process, if all retransmission process have traveled through, start to travel through new process.

2) if the actual bearer data volume bo of maximum resource piece is greater than the transport block size of terminal processes :

If be new course allocation resource, calculate the number of time slot taking: power code check finally uses v (t), and taking according to spreading factor SF of code channel resource determined.

If for retransmitting course allocation resource, Time Slot Occupancy N _tsk, code check finally uses v (t).

Adjust the SF factor, ${\mathrm{SF}}_k\left(t\right)=(\frac{\mathrm{bo}}{\frac{{\mathrm{TBS}}_k^R\left(t\right)+\mathrm{CRC}\_\mathrm{bits}+\mathrm{Tail}\_\mathrm{bits}}{\mathrm{bit}\_\mathrm{mod}\·v\left(t\right)}+N_{\mathrm{sym}\_\mathrm{eucch}}\left(t\right)}\·\mathrm{SF});$

Wherein, CRC_bits=24, N _{sym_eucch}for the symbolic number sum of multiple E-UCCH and TPC, i.e. N _{sym_eucch}=ENI*17; Taking according to SF of code channel resource _k(t) factor is determined.

Being calculated as of power: be also according to SF _k(t) factor is determined.

Step 6: resource allocation process completes.

Based on the content of above Fig. 1 embodiment, below by the explain execution flow process of 6 steps that Fig. 1 comprises of a concrete example.

Shown in Fig. 2, it is the flow chart of the resource allocation methods in a kind of High Speed Uplink Packet access described in another embodiment of the application.

First, according to User Priority queuing result, take out the highest UE of priority, then the highest UE of this priority is distributed to the resources such as power and code channel, number of time slot.Assigning process comprises the distribution of retransmission process and two processes of distribution of new process, specific as follows:

1) resource of retransmission process is distributed as shown in Figure 2 A:

Step 201, the retransmission process of traversal terminal, obtains the transport block size TBS of current retransmission process;

Wherein, described current retransmission process refers to traveling through one by one in the process of retransmission process, at selected that retransmission process of current time.

The transport block size TBS that can obtain according to the retransmission process part in Fig. 1 step 1 current retransmission process, following steps 202 and 203 correspond to the retransmission process part in Fig. 1 step 2.

Step 202, the number of time slot using described retransmission process in the time just passing data is as current maximum number of time slot N _tsk;

Step 203, as described maximum number of time slot N _tskwhile being less than or equal to the remaining time slots number of channel configuration, traversal number of time slot is N _tsksurplus resources piece, and be N from described number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Wherein, can be N from number of time slot _tskresource Block in search Resource Block that code channel number the is maximum Resource Block as carrying data volume maximum, and using this Resource Block as current maximum resource piece.The number of time slot of described channel configuration has configured in the time of initialization community.

Be N when there is no number of time slot in surplus resources piece _tskresource Block time, return to remaining retransmission process of step 201 traversal and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

As described maximum number of time slot N _tskwhile being greater than the remaining time slots number of channel configuration, returning to step 201 remaining retransmission process of traversal and carry out resource distribution, if all retransmission process have traveled through, traveling through the new process of terminal.

Step 204, calculates the actual bearer data volume of described maximum resource piece;

The actual bearer data volume that can calculate according to the step 3 in Fig. 1 and step 4 described maximum resource piece, following steps 205 correspond to the retransmission process part in Fig. 1 step 5.

Step 205, in the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described retransmission process, the number of time slot that is defined as described retransmission process distribution is N _tsk, and adjust spreading factor according to the actual bearer data volume of described maximum resource piece, be defined as according to the spreading factor after adjusting the code channel resource that described retransmission process distributes, and rated output PRRI, the resource allocation process of retransmission process finishes.

Wherein, concrete spreading factor method of adjustment can be referring to Fig. 1 step 5.

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described retransmission process, return to step 201 remaining retransmission process of traversal and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

2) resource of new process is distributed as shown in Figure 2 B:

Step 211, whether available free the new process of traversal terminal, judge in new process new process, if had, travels through the new process of described free time and carry out resource distribution according to following steps; If not, ending resource distributes;

Step 212, obtains the transport block size TBS of current new process;

Can obtain according to the new process part in Fig. 1 step 1 the transport block size TBS of current new process.

Step 213, determines maximum number of time slot and the maximum resource piece of described new process;

For new process, definite method of step 213 is different from determining of step 203 retransmission process, and definite method of new process is as follows:

Maximum number of time slot using the smaller value of the time slot data of the number of time slot of channel configuration and terminal capability support as described new process, specifically can be referring to the new process part in Fig. 1 step 2;

To in surplus resources piece, carry the Resource Block of data volume maximum as the maximum resource piece of described new process, specifically can be referring to the new process part in Fig. 1 step 2.

Step 214, calculates the actual bearer data volume of the maximum resource piece of described new process;

The actual bearer data volume that can calculate according to the step 3 in Fig. 1 and step 4 described maximum resource piece, following steps 215 correspond to the new process part in Fig. 1 step 5.

Step 215, in the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described new process, according to the actual bearer data volume of the transport block size of described new process, maximum number of time slot and maximum resource piece, be calculated as the number of time slot of described new course allocation, and be defined as the code channel resource of described new course allocation rated output PRRI according to spreading factor;

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described new process, the maximum number of time slot of described new process is all distributed to described new process, and be defined as the code channel resource of described new course allocation rated output PRRI according to spreading factor.

In sum, because base station is that number of time slot when retransmitting the number of time slot of course allocation and just passing data with this retransmission process is the same, make UE when do E-TFC selection for retransmission process, the same TB piece of TB block size can choose with first biography time, thus the chosen successfully of retransmission process ensured as far as possible.If UE selects retransmission process success in most cases, just without considering again whether available free new process, and then avoid because retransmission process data are dropped the problem that causes data rate reduction.

Further, the embodiment of the present application has also been improved the resource allocation methods to new process, safeguard the mode of UE idle process by MAC layer, if there is no idle new process, ending resource distributes, the data that no longer abandon retransmission process are transmitted data by UE, and this makes resource allocation process can control more exactly the use of UE process, further avoided because retransmission process data are dropped the problem that causes data rate to reduce.

It should be noted that, for aforesaid each embodiment of the method, for simple description, therefore it is all expressed as to a series of combination of actions, but those skilled in the art should know, the application is not subject to the restriction of described sequence of movement, because according to the application, some step can adopt other orders or carry out simultaneously.Secondly, those skilled in the art also should know, the embodiment described in specification all belongs to preferred embodiment, and related action might not be that the application is necessary.

Based on the explanation of said method embodiment, the embodiment of the present application also provides a kind of base station of distributing for the resource of High Speed Uplink Packet access.

Shown in Fig. 3, it is the structure chart of a kind of base station of distributing for the resource of High Speed Uplink Packet access described in the embodiment of the present application.

Described base station can comprise resource distribution module, and described resource distribution module comprises with lower unit:

Transport block size acquiring unit 10, for traveling through the retransmission process of terminal, obtains the transport block size of current retransmission process;

Maximum number of time slot determining unit 20, for using described retransmission process the number of time slot in the time just passing data as current maximum number of time slot N _tsk;

Maximum resource piece determining unit 30, for being N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Carrying data volume computing unit 40, for calculating the actual bearer data volume of described maximum resource piece;

Resource allocation unit 50, in the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described retransmission process, the number of time slot that is defined as described retransmission process distribution is N _tsk, and adjust spreading factor according to the actual bearer data volume of described maximum resource piece, be defined as according to the spreading factor after adjusting the code channel resource that described retransmission process distributes.

In a preferred embodiment, described maximum resource piece determining unit 30 can be N from number of time slot _tskresource Block in search Resource Block that code channel number the is maximum Resource Block as carrying data volume maximum, and using this Resource Block as current maximum resource piece.

In another preferred embodiment, described resource distribution module can also comprise comparing unit, specific as follows:

Comparing unit, for by described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration, as described maximum number of time slot N _tskwhile being less than or equal to the remaining time slots number of channel configuration, triggering described maximum resource piece determining unit is N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece.

As described maximum number of time slot N _tskwhile being greater than the remaining time slots number of channel configuration, or be N when there is no number of time slot in surplus resources piece _tskresource Block time, described comparing unit triggers described transport block size acquiring unit 10 remaining retransmission process of traversal and carries out resource distribution, if all retransmission process have traveled through, travels through the new process of terminal;

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described retransmission process, described resource allocation unit 50 triggers described transport block size acquiring unit 10 remaining retransmission process of traversal and carries out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

Preferably, when carrying out resource to new process, described resource distribution module divides timing:

Described transport block size acquiring unit 10 also can be used for the idle new process of traversal, obtains the transport block size of current new process;

Described maximum number of time slot determining unit 20 also can be used for determining the maximum number of time slot of described new process; Concrete, maximum number of time slot that can be using the smaller value of the number of time slot of channel configuration and the time slot data of terminal capability support as described new process;

Described maximum resource piece determining unit 30 also can be used for determining the maximum resource piece of described new process; Concrete, can will in surplus resources piece, carry the Resource Block of data volume maximum as the maximum resource piece of described new process;

Prime number carrying data volume computing unit 40 also can be used for the actual bearer data volume of the maximum resource piece that calculates described new process;

Described resource allocation unit 50 also can be used in the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described new process, according to the actual bearer data volume of the transport block size of described new process, maximum number of time slot and maximum resource piece, be calculated as the number of time slot of described new course allocation, and be defined as the code channel resource of described new course allocation according to spreading factor;

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described new process, the maximum number of time slot of described new process is all distributed to described new process, and be defined as the code channel resource of described new course allocation according to spreading factor.

Preferably, in a preferred embodiment, described resource distribution module can also comprise with lower unit:

Whether available free idle process judging unit, when traveling through the new process of terminal, judge in new process new process, if had, travels through the new process of described free time and carry out resource distribution; If not, ending resource distributes.

Further, described idle process judging unit can comprise following subelement:

Record subelement, for recording the number x of the new process of m subframe scheduling before terminal;

Idle process computation subunit, for maximum terminal schedulable process sum n are deducted to the number x of the new process of described subframe scheduling, then deducts all retransmission process numbers, obtains idle new process number; Wherein, m, x and n are all more than or equal to 0, and n=m+1;

Judgment sub-unit, is greater than 0 for the new process number when the described free time, judges available free new process; Otherwise judgement does not have idle new process.

For above-mentioned base station embodiment, because it is substantially similar to embodiment of the method, so description is fairly simple, relevant part is referring to the part explanation of embodiment of the method shown in Fig. 1 and Fig. 2.

Each embodiment in this specification all adopts the mode of going forward one by one to describe, and what each embodiment stressed is and the difference of other embodiment, between each embodiment identical similar part mutually referring to.

Resource allocation methods and base station in the High Speed Uplink Packet access above the application being provided, be described in detail, applied principle and the execution mode of specific case to the application herein and set forth, the explanation of above embodiment is just for helping to understand the application's method and core concept thereof; , for one of ordinary skill in the art, according to the application's thought, all will change in specific embodiments and applications, in sum, this description should not be construed as the restriction to the application meanwhile.

Claims (13)

1. the resource allocation methods in High Speed Uplink Packet access, is characterized in that, comprising:

Travel through the retransmission process of terminal, obtain the transport block size of current retransmission process;

Number of time slot using described retransmission process in the time just passing data is as current maximum number of time slot N _tsk;

By described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration;

As described maximum number of time slot N _tskwhile being less than or equal to the remaining time slots number of channel configuration, be N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Calculate the actual bearer data volume of described maximum resource piece;

In the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described retransmission process, the number of time slot that is defined as described retransmission process distribution is N _tsk, and adjust spreading factor according to the actual bearer data volume of described maximum resource piece, be defined as according to the spreading factor after adjusting the code channel resource that described retransmission process distributes.

2. method according to claim 1, is characterized in that, also comprises:

As described maximum number of time slot N _tskwhile being greater than the remaining time slots number of channel configuration, traveling through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, traveling through the new process of terminal.

3. method according to claim 1, is characterized in that, also comprises:

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described retransmission process, travel through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

4. method according to claim 1, is characterized in that, also comprises:

Be N when there is no number of time slot in surplus resources piece _tskresource Block time, travel through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

5. according to the arbitrary described method of claim 1 to 4, it is characterized in that, also comprise:

Whether available free the new process of traversal terminal, judge in new process new process, if had, travels through the new process of described free time and carry out resource distribution; If not, ending resource distributes.

6. whether available free method according to claim 5, is characterized in that, describedly judge in new process new process, comprising:

Record the number x of the new process of front m the subframe scheduling of terminal;

Maximum terminal schedulable process sum n are deducted to the number x of the new process of described subframe scheduling, then deduct all retransmission process numbers, obtain idle new process number; Wherein, m, x and n are all more than or equal to 0, and n=m+1;

If the new process number of described free time is greater than 0, represent available free new process; Otherwise representing does not have idle new process.

7. method according to claim 1, is characterized in that, described is N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece, comprising:

Be N from number of time slot _tskresource Block in search Resource Block that code channel number the is maximum Resource Block as carrying data volume maximum, and using this Resource Block as current maximum resource piece.

8. method according to claim 5, is characterized in that, the new process that described traversal is idle is also carried out resource distribution, comprising:

The new process that traversal is idle, obtains the transport block size of current new process, and determines maximum number of time slot and the maximum resource piece of described new process;

Calculate the actual bearer data volume of the maximum resource piece of described new process;

In the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described new process, according to the actual bearer data volume of the transport block size of described new process, maximum number of time slot and maximum resource piece, be calculated as the number of time slot of described new course allocation, and be defined as the code channel resource of described new course allocation according to spreading factor;

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described new process, the maximum number of time slot of described new process is all distributed to described new process, and be defined as the code channel resource of described new course allocation according to spreading factor.

9. method according to claim 8, is characterized in that, described maximum number of time slot and the maximum resource piece of determining new process, comprising:

Maximum number of time slot using the smaller value of the number of time slot of the number of time slot of channel configuration and terminal capability support as described new process;

To in surplus resources piece, carry the Resource Block of data volume maximum as the maximum resource piece of described new process.

10. a base station of distributing for the resource of High Speed Uplink Packet access, is characterized in that, described base station comprises resource distribution module, and described resource distribution module comprises:

Transport block size acquiring unit, for traveling through the retransmission process of terminal, obtains the transport block size of current retransmission process;

Maximum number of time slot determining unit, for using described retransmission process the number of time slot in the time just passing data as current maximum number of time slot N _tsk;

Comparing unit, for by described maximum number of time slot N _tskcompare with the remaining time slots number of channel configuration, as described maximum number of time slot N _tskwhile being less than or equal to the remaining time slots number of channel configuration, triggering maximum resource piece determining unit is N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Maximum resource piece determining unit, for being N from number of time slot _tsksurplus resources piece in search carrying data volume maximum Resource Block as current maximum resource piece;

Carrying data volume computing unit, for calculating the actual bearer data volume of described maximum resource piece;

Resource allocation unit, in the time that the actual bearer data volume of described maximum resource piece is greater than the transport block size of described retransmission process, the number of time slot that is defined as described retransmission process distribution is N _tsk, and adjust spreading factor according to the actual bearer data volume of described maximum resource piece, be defined as according to the spreading factor after adjusting the code channel resource that described retransmission process distributes.

11. base stations according to claim 10, is characterized in that:

As described maximum number of time slot N _tskwhile being greater than the remaining time slots number of channel configuration, or be N when there is no number of time slot in surplus resources piece _tskresource Block time, described comparing unit triggers described transport block size acquiring unit and travels through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travels through the new process of terminal;

In the time that the actual bearer data volume of described maximum resource piece is less than or equal to the transport block size of described retransmission process, described resource allocation unit triggers described transport block size acquiring unit and travels through remaining retransmission process and carry out resource distribution, if all retransmission process have traveled through, travel through the new process of terminal.

12. base stations according to claim 10, is characterized in that, described resource distribution module also comprises:

Whether available free idle process judging unit, when traveling through the new process of terminal, judge in new process new process, if had, travels through the new process of described free time and carry out resource distribution; If not, ending resource distributes.

13. base stations according to claim 12, is characterized in that, described idle process judging unit comprises:

Record subelement, for recording the number x of the new process of m subframe scheduling before terminal;

Idle process computation subunit, for maximum terminal schedulable process sum n are deducted to the number x of the new process of described subframe scheduling, then deducts all retransmission process numbers, obtains idle new process number; Wherein, m, x and n are all more than or equal to 0, and n=m+1;

Judgment sub-unit, is greater than 0 for the new process number when the described free time, judges available free new process; Otherwise judgement does not have idle new process.