CN101345982B - Method and apparatus for distributing high-speed physics downlink shared signal channel resource - Google Patents

Abstract

The invention discloses a method for allocating high speed physical down link shared channel resource for utilizing the high speed physical down link shared channel resource effectively. The method comprises: acquiring the code channel block allowed to carry the high speed physical down link shared channel (HS-PDSCH) resource in system; conforming the available HS- PDSCH resource block, which includes one or several code channel blocks in one time slot or includes one or several continuous code channels on several time slots, made up of the code channel blocks in different combining mode; and selecting an available HS-PDSCH resource block among the confirmed available HS-PDSCH resources to allocate to the current user equipment needing available HS-PDSCH resource. The invention further discloses an apparatus.

Description

A kind of method and device that distributes high-speed physics downlink sharied signal channel resource

Technical field

The present invention relates to the communications field, particularly a kind of method and device that distributes physics downlink sharied signal channel resource.

Background technology

At present, (the 3rd Generation Partnership Project of 3G (Third Generation) Moblie standardization body, 25.858 agreements regulation in the version 5 (Release5) 3GPP), insert (High-Speed downlink packet access in high-speed downlink packet, HSDPA) in the system, by radio network controller (Radio Network Controller, RNC) resource is distributed, base station (Node B, NB) by High-Speed Shared Control Channel (High-Speed shared control channel, HS-SCCH) indication of the transport format resource in the control frame (Transport Format Resource Indicator, TFRI) field is to each subscriber equipment (User Equipment, UE) indication high-speed downlink shared channel (High Speed DownlinkShared Channel, HS-DSCH) go up spendable resource, comprising the time slot of distributing to UE (TimeSlot, TS) and code channel (Code).UE need monitor the time slot and the code channel of the indication of TFRI field, thereby correctly resolves the HS-DSCH data.

The structure of TFRI field is referring to shown in Figure 1, and wherein Start Code represents the coding of initial code channel, represents with 4 (bit); Stop Code represents to stop the coding of code channel, represents with 4bits; TS2-TS6 represents the 3rd to the 7th time slot, represents with 1bit respectively.As seen, the TFRI structures shape in the resource allocation of HS-DSCH, the available code channel that can distribute in each time slot is identical.Based on this key factor, the base station is that UE distributes High-Speed Physical Downlink Shared Channel (High Speed Physical DownlinkShared Channel, HS-PDSCH is to call PDSCH in the following text) during resource, need to obtain to have all available descending time slots of identical idle code channel.

If time slot and two kinds of resources of code channel are corresponded in the orthogonal coordinate system, then be the code channel piece relevant with code channel and time slot with the PDSCH resource representation, so, the TFRI field is that the available PDSCH resource that a UE indicates has just constituted a rectangle, dash area for example shown in Figure 2.

Distribute the method for PDSCH resource to comprise step in the prior art:

Step 1: get the common factor C1 that all descending time slots can be used code channel.

Step 2:, calculate the number of time slots Nc1 that needs C1 according to the length of the data to be transmitted of current UE correspondence.

Wherein, by the sub-rectangle Rsub that constitutes by Nc1*C1 that above-mentioned two steps obtain, indicated the PDSCH resource that to distribute to UE.

If the RNC standard is distributed the PDSCH resource, guarantee that all resources on the code channel can be used, then can directly know common factor C1.Method according to prior art, if the dash area among available PDSCH distribution of resource such as Fig. 3, (initial code channel is 0 to available PDSCH resource, stopping code channel is 10) locate to have occurred tomography at code channel 4 and 5 (for non-available PDSCH resource), part NB refusal uses the TFRI field to indicate, and causes the waste of all available PDSCH resources; Perhaps, part NB can only carry out the resource indication according to code channel 0-3 or code channel 6-10, causes a large amount of available PDSCH wastings of resources.

If RNC not standard distributes the PDSCH resource, then the available resources as PDSCH are irregular, and promptly the available code channel of each time slot exists under the situation than big-difference, and C1 may become empty set, and is for example shown in Figure 4, cause not having the available PDSCH resource that can distribute.As seen,, can't indicate, make UE can't obtain the HSDPA service to UE though there are a large amount of available PDSCH resources in the system.

Even C1 is not empty, under the incomplete same situation of the available code channel in each time slot, can waste valuable interface-free resources.And because C1 is the common factor of available descending time slot code channel, so C1 is unique, when giving UE with the resource allocation of Nc1*C1, this UE will monopolize all resources of Nc1 time slot.When the curtailment of the data to be transmitted of UE correspondence when using the available PDSCH resource of distributing fully, may cause maximum additional waste Nc1-1 code channel piece.

To sum up, the implementation of prior art is to available PDSCH serious waste of resources, and can not use the TFRI field that all available PDSCH resources are indicated.

Summary of the invention

The embodiment of the invention provides a kind of method and device that distributes high-speed physics downlink sharied signal channel resource, is used for realizing effectively utilizing high-speed physics downlink sharied signal channel resource.

A kind of method of distributing high-speed physics downlink sharied signal channel resource may further comprise the steps:

Know the code channel piece that allows carrying High-Speed Physical Downlink Shared Channel HS-PDSCH resource in the system;

Determine the available HS-PDSCH Resource Block that described code channel piece constitutes under various compound modes; Wherein, described available HS-PDSCH Resource Block comprises the one or more continuous code channel piece on the time slot, perhaps comprises a code channel or many continuous code channels identical on a plurality of time slots;

From the available HS-PDSCH Resource Block of determining, select an available HS-PDSCH Resource Block and distribute to the current subscriber equipment that needs to obtain available HS-PDSCH resource.

A kind of method of length of definite distribution high-speed physics downlink sharied signal channel resource comprises step:

Determine the available High-Speed Physical Downlink Shared Channel HS-PDSCH resource of length maximum in the system;

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and determine the length of the HS-PDSCH resource of distributing according to the maximum capacity of transport block set; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and according to described maximum capacity, from data to be transmitted, this time need to determine the data of transmission, making the length of the high-speed multimedia access control load data unit MAC-hs PDU that comprises the data that described needs this time transmit is the maximum length that is no more than described maximum capacity, and the length of the HS-PDSCH resource that the length of described MAC-hs PDU is defined as distributing; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and according to described maximum capacity, from data to be transmitted, this time need to determine the data of transmission, making the length of the MAC-hs PDU of the data that comprise the transmission of described needs this time is the maximum length that is no more than described maximum capacity, further determine to be not less than in the transport block set minimum ability of the length of described MAC-hs PDU, determine the length of described minimum ability for the HS-PDSCH resource of distribution.

A kind of device that is used for Resources allocation comprises:

Be used for code channel piece, determine the unit of the available HS-PDSCH Resource Block that described code channel piece constitutes under various compound modes according to the available High-Speed Physical Downlink Shared Channel HS-PDSCH resource of knowing; Wherein, described available HS-PDSCH Resource Block comprises the one or more continuous code channel piece on the time slot, perhaps comprises a code channel or many continuous code channels identical on a plurality of time slots;

Be used for selecting an available HS-PDSCH Resource Block and distributing to the unit that current needs obtain the subscriber equipment of available HS-PDSCH resource from the available HS-PDSCH Resource Block of determining.

A kind of device that is used for the length of definite distribution high-speed physics downlink sharied signal channel resource comprises:

Spider module is used for determining the available High-Speed Physical Downlink Shared Channel HS-PDSCH resource of system's length maximum;

Rollback module is used for determining according to the length of the available HS-PDSCH resource of described maximum the maximum capacity of transport block set, and determines the length of the HS-PDSCH resource of distributing according to the maximum capacity of transport block set; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and, determine the length of the HS-PDSCH resource of distributing according to the maximum length of the high-speed multimedia access control load data unit MAC-hs PDU of the data that comprise the transmission of this needs that are no more than described maximum capacity; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and according to the maximum length of the MAC-hs PDU of the data that comprise the transmission of this needs that are no more than described maximum capacity, determine to be not less than in the transport block set minimum ability of the length of described MAC-hs PDU, and determine the length of described minimum ability for the HS-PDSCH resource of distributing.

The embodiment of the invention provides the method that obtains the available PDSCH Resource Block under the various compound modes, and each available PDSCH Resource Block all is applicable to the TFRI field structure, realized giving UE with irregular available PDSCH resource allocation, saved Internet resources, made each UE obtain the service that needs simultaneously.

The embodiment of the invention is also further optimized resource allocation methods from aspects such as the recovery of the selection of the available PDSCH Resource Block of the selection of the selection of resource allocation granularity, UE, data to be transmitted, distribution, surplus resources and analysis-by-synthesis Resource Allocation Formulas, realizes the utilization of resources largely and fully satisfies the resource requirement of most UE.

Description of drawings

Fig. 1 is TFRI field structure figure among the present HS-SCCH;

Fig. 2 is the schematic diagram that a kind of available PDSCH resource network distributes;

The schematic diagram that Fig. 3 divides timing to use the PDSCH resource network to distribute for a kind of rule;

The schematic diagram that Fig. 4 divides timing to use the PDSCH resource network to distribute for a kind of non-rule;

Fig. 5 is for being used for the basic block diagram of the device of Resources allocation in the embodiment of the invention;

Fig. 6 is the main method flow chart of Resources allocation in the embodiment of the invention;

Fig. 7 A is the method flow diagram that distributes maximum available PDSCH resource in the embodiment of the invention;

Fig. 7 B is a traversing operation and obtain the method flow diagram of available PDSCH resource under the various compound modes in the embodiment of the invention;

Fig. 8 is the method flow diagram that distributes optimum available PDSCH resource in the embodiment of the invention;

Fig. 9 determines resource distribution mode and method of allocating resources flow chart in the embodiment of the invention;

Structure chart when Figure 10 comprises the granularity module for resource allocation device in the embodiment of the invention;

Figure 11 is according to resource allocation granularity method of allocating resources flow chart in the embodiment of the invention;

Figure 12 is a method flow diagram of determining the resource allocation granularity in the embodiment of the invention;

Structure chart when Figure 13 comprises rollback module for resource allocation device in the embodiment of the invention;

Figure 14 adopts surplus resources fallback mechanism method of allocating resources flow chart in the embodiment of the invention;

Figure 15 is a method flow diagram of determining the available PDSCH resource of UE actual needs in the embodiment of the invention;

Figure 16 be in the embodiment of the invention TBSb, TBSmax, Lhs and TBSmin concern schematic diagram;

Figure 17 uses the preferential rule of time slot in the embodiment of the invention, carry out the method flow diagram of surplus resources rollback;

Figure 18 uses the preferential rule of code channel in the embodiment of the invention, carry out the method flow diagram of surplus resources rollback;

Structure chart when Figure 19 comprises that for resource allocation device in the embodiment of the invention UE selects module;

Figure 20 is a method flow diagram of in the embodiment of the invention resource allocation being given the highest UE of urgency level;

Figure 21 is according to optimum distributing scheme method of allocating resources flow chart in the embodiment of the invention;

Figure 22 is the method flow diagram that obtains optimum distributing scheme in the embodiment of the invention;

Figure 23 is the structure chart of resource allocation device preferable in the embodiment of the invention;

Figure 24 is a method of allocating resources flow chart preferable in the embodiment of the invention.

Embodiment

The embodiment of the invention is by the detailed traversal to all code channels and time slot, obtain the available PDSCH resource that all can use the indication of TFRI field, therefrom select available PDSCH resource then and indicate to UE, realize giving UE available PDSCH resource allocation by the TFRI field.

The code channel piece is meant in the right angle orthogonal coordinate system code channel and the rectangle that time slot constitutes in the present embodiment, is from the division to network of the angle of time slot and code channel.Resource Block is meant the one or more code channel pieces that meet the TFRI field structure, is from the division to Internet resources of the angle of code channel piece.The resource allocation granularity is represented the minimum length (length is meant the bit number that can carry) of Resources allocation in the first resource assigning process, also can be expressed as the minimum number of the code channel piece of distribution, under the certain situation of channel quality, there is fixing corresponding relation between the code channel piece and the bit number that can carry.Available code channel piece is meant the code channel piece that allows carrying PDSCH resource.Maximum available PDSCH Resource Block is meant that the bit that can carry the PDSCH resource counts the available PDSCH Resource Block of maximum, also can refer to the maximum available PDSCH Resource Block of code channel piece number that comprises, also can refer to the available PDSCH Resource Block of shaded area maximum in the coordinate system as shown in Figure 4.Only available PDSCH Resource Block is meant that length is not less than in the available PDSCH Resource Block of total length of UE data to be transmitted the available PDSCH Resource Block of minimum length.Baseline in the present embodiment is for the resource partition size being the code channel sign (being specially yard Taoist monastic name or code channel coding etc., is that example describes with the sign indicating number Taoist monastic name below) at interval, for traveling through the datum line that the code channel piece provides.

Referring to shown in Figure 5, the device (or claiming resource allocation device) that is used for Resources allocation in the present embodiment comprising: interface module 500, memory module 501, spider module 502, data module 503 and distribution module 504.This device is for RNC or NB, and perhaps each module middle part of this device belongs to RNC and another part belongs to NB, and for example data module 503 belongs to RNC, and other module belongs to NB.

Interface module 500 is known the resource allocation conditions (comprising which is that available PDSCH resource and which right and wrong can be used the PDSCH resource) of system.Wherein, the mode of knowing has multiple, as knowing available code channel piece by the mode that receives message, perhaps knows available code channel piece by the write operation of accepting external device (ED).

Memory module 501, storage need be to the data of each UE transmission, and the resource allocation conditions of saved system, temporary variable and various parameters etc., can be storage mediums such as buffer memory, internal memory, hard disk and tape.

Spider module 502, with the baseline is starting point, according to predetermined rule acquired system resource allocation situation is carried out traversal about each code channel and time slot, determine the length and the position of available PDSCH Resource Block under all compound modes, and length and the position of when needs obtain maximum available PDSCH Resource Block, determining maximum available PDSCH Resource Block.

Data module 503, determine high speed media access control load data unit (the High Speed Medium Access Control Payload Data Unit of the needs transmission of UE correspondence, MAC-hs PDU) total length, wherein, MAC-hs PDU comprises head and data portion, data portion comprises load data unit (the MAC-d PDU of one or more medium access control data, hereinafter to be referred as PDU), next PDU of ordinary circumstance is 336bits, comprises that the MAC-hs PDU of such PDU need take 2 code channel pieces.Data module 503 also is used for selecting part PDU to be defined as the data that needs this time transmit and determining to comprise the length of the MAC-hs PDU of this part PDU from all PDU waiting for transmission.The total length of MAC-hsPDU is determined according to all PDU waiting for transmission in the present embodiment, and the length of MAC-hs PDU is determined according to this PDU that need transmit.

Distribution module 504, the length according to available PDSCH Resource Block under the length of data to be transmitted and the various compound mode for UE distributes available PDSCH Resource Block, and generates corresponding TFRI field.

Wherein, the described predetermined rule of spider module 502 foundations comprises and satisfies all traversal rules traverse all code channels and time slot, as from low time slot (TS2) to high time slot (TS6) and each time slot from the direction of low code channel (code channel 0) to high code channel (code channel 15); Perhaps, from low time slot to high time slot and each time slot from the direction of high code channel to low code channel; Perhaps, from low code channel to high code channel and each code channel from the direction of low time slot to high time slot; Perhaps, from high code channel to low code channel and each code channel from high time slot to the direction of low time slot etc.Present embodiment is determined the position and the moving direction of baseline according to predetermined rule, and with the starting point of baseline as time slot or code channel traversing operation, the direction that moves along baseline travels through.Because the resource allocation granularity of regulation is 4 code channel pieces at present, the time slot that is used at present to carry the PDSCH resource in the network system comprises 5 time slots, at present the code channel number that defines in the network system is 16, and in view of 16 and 4 being relations of integral multiple, and 5 and 4 do not constitute the relation of integral multiple; So preferable traversal order is: at first with a side code channel as baseline (code channel 0 or code channel 15), since a side time slot (TS2 or TS6), in a time slot, travel through to the opposite side code channel from baseline, the direction of thinking the opposite side time slot then moves a time slot, continuation travels through this time slot, to the last the traversal of the code channel on time slot finishes, and then a traversing operation under this baseline is finished.Move baseline (being code channel 4 or code channel 11) and repeat above-mentioned steps according to the resource allocation granularity, till baseline can't move (length that the baseline after promptly moving will exceed total code channel), traversal finished.Rule in the present embodiment is: code channel 0 is defined as initial baseline, according to the direction of TS2 to TS6 each time slot is traveled through, the traversal direction in each time slot is the direction from the paramount code channel of baseline.During to time slot traversal, finish when finding non-available PDSCH resource or traversing under this time slot all code channels.

Referring to Fig. 6, the main method flow process of Resources allocation is as follows in the present embodiment:

Step 601: know the available code channel piece in each code channel and the time slot; Can know available code channel piece by the mode that receives message, perhaps know available code channel piece by the write operation of accepting external device (ED).

Step 602: length and the position of determining the available PDSCH Resource Block that available code channel piece constitutes under various compound modes; Wherein, available PDSCH Resource Block comprises the one or more continuous code channel piece on the time slot, perhaps comprises a code channel or many continuous code channels identical on a plurality of time slots.Can write down traversing result by modes such as array, chained list or tabulations, thereby determine the compound mode of available code channel piece, to obtain available PDSCH Resource Block by the mode of each code channel and time slot traversal is known continuous available code channel piece.Present embodiment is that example is elaborated with the array.

Step 603: from the available PDSCH Resource Block of determining, select the available PDSCH Resource Block under a kind of compound mode and distribute to a UE.

Present embodiment provides the specific implementation of plurality of distribution resource, is to give UE with the available PDSCH resource block assignments of maximum as first kind of specific implementation, mainly is applicable to the long situation of total length of the data to be transmitted of UE correspondence; As second kind of specific implementation is to give UE according to the total length of the data to be transmitted of UE correspondence with only available PDSCH resource block assignments, mainly is applicable to the short situation of total length of the data to be transmitted of UE correspondence; As the third specific implementation is with above-mentioned two kinds of scheme combinations, judge that by preset threshold value the data to be transmitted total length is long or weak point, if long, then adopts first kind of specific implementation, otherwise adopt second kind of specific implementation, this scheme is the advantage of above-mentioned two kinds of schemes comprehensively.

Referring to Fig. 7 A, in the present embodiment the available PDSCH resource block assignments of maximum to be given under the UE situation, the idiographic flow of Resources allocation is as follows:

Step 701: maximum available PDSCH Resource Block variable R max in the system is carried out initialization, and establishing Rmax is 0.

Step 702: determine the position of baseline, with the sign indicating number Taoist monastic name as baseline, and according to this baseline according to code channel from low to high, time slot order from low to high travels through, and writes down traversing result simultaneously.Wherein, the initial value of baseline is a code channel 0.

Step 703: after traversal finishes under this baseline, determine maximum available PDSCH Resource Block RB under this baseline.

Step 704: whether the value (being length) of judging RB is greater than the value (being length) of Rmax, if then continue step 705, otherwise continue step 706.

Step 705: the value with the value of RB is replaced Rmax refers to RB with Rmax, i.e. Rmax=RB.

Step 706: judge on the high code channel direction whether have the code channel that can be used as baseline, if then continue step 707, otherwise continue step 708.

For example, granularity is 4, and baseline is a code channel 0, then needs mobile baseline, and the baseline after moving is a code channel 4; If baseline is a code channel 12, just exceeded the scope of existing code channel after mobile, then do not need mobile baseline, because the baseline after moving is a code channel 16, and the maximum code channel of system's regulation is a code channel 15 at present, nonexistent code road 16.For example, granularity is 4, and the initial value of baseline is a code channel 4, then when baseline is code channel 12, exist for the code channel as baseline, still need mobile baseline, the baseline after moving is a code channel 0, because code channel 4 had been made baseline,, finish about the traversal of this UE resource allocation so baseline does not need to move again.

Step 707: move baseline along code channel direction from low to high, continue step 702.

Step 708: the value of current Rmax is with regard to the length of maximum resource piece in the expression system, just can determine the position of maximum available PDSCH Resource Block Rmax in the system according to the RB of current Rmax correspondence and corresponding baseline, Rmax is distributed to UE, and indicate to this UE by the TFRI field.

In step 706 and 707, it is multiple to judge whether to need the method for mobile baseline and mobile baseline to have, as first kind of mode be with every code channel successively as baseline, for example current basic line is a code channel 0, the baseline after moving is a code channel 1; As the second way is to determine baseline according to the resource allocation granularity, and for example resource allocation granularity is 4 code channel pieces, and current basic line is a code channel 0, and the baseline after then moving is a code channel 4; As the third mode be according to available PDSCH resource from having to do not having and the variation of growing out of nothing determine baseline, for example, current basic line is a code channel 0, code channel 0 to code channel 2 is available PDSCH resource on all time slots, occurred the non-available PDSCH resource of part on the code channel 3, the baseline after then moving is a code channel 3, and for example code channel 4 is non-available PDSCH resource to code channel 6 again, occurred available PDSCH resource on the code channel 7, then baseline moves to code channel 7 from code channel 3; As the 4th kind of mode, i.e. the combination of second and third kind mode, for example resource allocation granularity is 4 code channel pieces, current basic line is a code channel 0, code channel 0 to code channel 7 is available PDSCH resource on all time slots, has occurred the non-available PDSCH resource of part on the code channel 8, and the baseline after then moving is a code channel 8.Present embodiment need be determined maximum available PDSCH Resource Block, so adopting the preferred mode of determining baseline is the variation of growing out of nothing according to resource allocation granularity and available PDSCH resource, for example resource allocation granularity is 4, current basic line is a code channel 0, variation that available PDSCH resource grow out of nothing occurred at certain time slot from code channel 7 to code channel 8, the baseline after then moving is a code channel 8.

Can know the method that obtains maximum available PDSCH Resource Block and distribute to UE by the description of above-mentioned steps, below traversal under baseline in step 702 and 703 and the method that obtains RB are described in detail, is that example describes with code channel 0 as baseline, shown in Fig. 7 B, it is as follows to have flow process:

Step 702A: determine baseline, time slot is carried out initialization, present embodiment is being that example describes from TS2 to the direction of TS6, Bian Li time slot is TS2 first, then establishing initialized time slot is TS2, and initialization is used to write down the variable c of available code channel piece number (number that is equivalent to code channel), and establishing c is 0.Continue step 702D.Wherein, the original position of baseline is a code channel 0.

Step 702B: move a time slot to high time slot direction, determine current time slot, and initializing variable c, establishing c is 0.

Step 702C: travel through according to the direction of resource allocation granularity, determine code channel to high code channel.Traversal first under time slot is from baseline, because granularity is 4, promptly continuous 4 code channel pieces all be available code channel piece or all be non-available code channel piece that per 4 code channels are definite once in the time of then can directly determining to travel through.This step can directly travel through each code channel successively, carries out the traversal of code channel in the present embodiment according to the resource allocation granularity, can reduce the step of traversing operation.

Step 702D: judge whether current code channel piece is available code channel piece, if, then upgrade the variable c that is used to write down available code channel piece number, continue step 702E, otherwise continue step 702F.Wherein, can upgrade c according to the resource allocation granularity, i.e. c=c+4,4 is granularity.

Step 702E: judge whether to exist the not code channel of traversal, if then continue step 702C, otherwise continue step 702F.

Step 702F: this time slot traversal finishes, and writes down the c value under this time slot and this time slot, continues step 702G.Can judge also whether c equals 0, if, record not then, otherwise record c value.

Step 702G: judge whether to exist the not time slot of traversal, if then continue step 702B, otherwise continue step 702H.

Step 702H: with the c under each time slot according to from big to small sequence arrangement, and with array At[s] form preserves, s=0,1,2...t in the present embodiment, t represents the maximum occurrences of s.The order of the c that a plurality of numerical value equate can be arranged arbitrarily.

Step 702I: determine available PDSCH Resource Block Rb, i.e. Rb=(s+1) * c, s=0,1,2...t, c are the array element of s institute mark among the array At, for example first element c among peek group At during s=0 promptly gets the c of available code channel piece number maximum.Along with the variation of s value, can obtain a plurality of Rb.

Because the present embodiment first term of defining arrays is At[0], thus need s to add 1 among Rb=(s+1) * c, if the first term of defining arrays is At[1], Rb=s * c then.Because each array element c is the number of available code channel piece on each time slot under the baseline, then can determine the number of the shared time slot of Rb by the value of s, promptly the time slot number is s+1.By the described method of above-mentioned steps 702A-step 702I, just can obtain the available PDSCH Resource Block Rb that available code channel piece constitutes under various compound modes, no longer need to get the common factor C1 of all available descending time slot code channels, and Rb is the available code channel piece on the continuous code channel, so each Rb all can make full use of the available PDSCH resource in the system with the indication of TFRI field.

Step 702J: the Rb of length maximum among a plurality of Rb that determine to obtain, and according to formula RB=MAX (Rb _k) determining maximum available PDSCH Resource Block RB under this baseline, the Rb that is about to the length maximum composes to RB, wherein, by subscript k Rb is identified to distinguish each Rb, and k=0,1,2..., m, m represent the maximum occurrences of k.K can change along with the value difference of s, for example, and k=0 during s=0.If represent to be worth number for non-0 c, then m=m1 with m1.If c did not write down c, then m1=t+1 at 0 o'clock; Wherein the initial value of m1 is 0, and expression is empty, and promptly Rb does not exist or thinks that Rb is 0.The mode that multiple definite RB is arranged when having the Rb of a plurality of numerical value maximums, as: the Rb that can therefrom select a maximum at random as RB, perhaps according to the variation order of k Rb that first is maximum as RB.

In determining the process of RB, can consider the requirement of UE,, avoid distributing the wasting of resources that resource caused that UE can't use and the influence of transfer of data as the tenability of descending time slot etc. to transfer of data.Represent that with m2 UE supports the maximum number of descending time slot, in step 702J, with the value of value less among m1 and the m2 as m, promptly m=MIN (m1, m2).

Because present embodiment is need to obtain maximum available PDSCH Resource Block RB, thus with the c each time slot under according to from big to small rank order, and the value of s is to t in proper order from 0 in the process of calculating Rb.Step 702I and step 702J can be merged: initialization RB is 0, whenever calculates a Rb then, just whether judge Rb greater than RB, if, then upgrade RB with Rb, i.e. RB=Rb, otherwise keep RB constant.

When needs carry out the indication of available PDSCH resource with the TFRI field, determine content in the TFRI field according to the position of Rmax.The position of Rmax is equivalent to the position of corresponding RB, the position of RB is equivalent to the position of Rb maximum under this baseline, the position of Rb can obtain corresponding s according to its subscript k, the value of the array element c of s indication position is the number of the shared code channel of Rb, search the code channel that c code channel is the Rb place from baseline according to the direction of traversal, as baseline is code channel 0, c=4, and then the code channel at Rb place is that code channel 0 is to code channel 3.The pairing time slot of each array element c before the array element c of s indication position and this position is the time slot at Rb place.The time slot of having determined the code channel at Rb place and place has just been determined the position of Rb, the i.e. position of Rmax.For example, s=2, c=4, s indication position and before the position (be At[0], At[1], At[2]) time slot corresponding is TS4, TS2, TS5, then a TFRI field instance is as follows:

0000

0011

1

0

1

1

0

Wherein, 0000 is the coding of code channel 0, and 0011 is the coding of code channel 3, and 1 expression distributes the available PDSCH resource on this time slot, the available PDSCH resource on unallocated this time slot of 0 expression.

After indicating, the MAC-hs PDU of this UE of transmission in Rmax.If the total length of the PDU to be transmitted of this UE greater than the length of Rmax, is then selected part PDU from PDU to be transmitted, make the total length of the MAC-hs PDU that comprises this part PDU be not more than the length of Rmax, and in Rmax, transmit this MAC-hs PDU.

Referring to Fig. 8, in the present embodiment only available PDSCH resource block assignments to be given under the UE situation, the idiographic flow of Resources allocation is as follows:

Step 801: the total length of determining the MAC-hs PDU to be transmitted of UE, determine resource utilization according to current channel quality, promptly determine the bit number that the code channel piece can carry, and according to this total length and resource utilization, the code channel piece number that determine to need (or further determine the code channel piece number of needs according to the resource allocation granularity, promptly the code channel piece number of Que Dinging should be the integral multiple of resource allocation granularity, is 4 as the resource allocation granularity, the code channel piece number of determining is 4,8,12...)

For example, the code channel piece number of Que Dinging is 8.Channel quality is relevant with many-sided factor, as the error rate of transmission rate of eating dishes without rice or wine and requirement etc.Can resource utilization be set at a fixed value according to channel quality generally speaking, determine that according to current channel quality resource utilization is in order to adapt to network environment preferably in the present embodiment, make the available PDSCH Resource Block of distribution more suitable, improve the utilance of available PDSCH resource.

Step 802: determine the position of baseline, with the sign indicating number Taoist monastic name as baseline, and according to this baseline according to code channel from low to high, time slot order from low to high travels through, and obtains the Rb under this baseline.Detailed process is referring to the description of step 702A-step 702I.

Wherein, because present embodiment is need to obtain only Rb, thus with the c of each time slot by from small to large sequence arrangement and be recorded in array At[s] in, get the c value according to s from 0 to t order, all need to change to the process of t when getting each c value, calculate Rb respectively according to the pairing s of current c.Support the maximum number m2 of time slot if consider UE, all need when then getting each c value to change m2 time process, calculate Rb respectively according to the pairing s of current c.

Step 803: the Rb that judges whether to exist the code channel piece number that comprises to equal 8, if then continue step 812, otherwise continue step 804.

Step 804: judge whether to exist the code channel piece number that comprises greater than 8 Rb, if then continue step 805, otherwise continue step 806.

Step 805: determine to continue step 807 greater than comprising the minimum Rb of code channel piece number among 8 the Rb.

Step 806: determine to continue step 808 less than comprising the maximum Rb of code channel piece number among 8 the Rb.

Step 807: whether judge the included code channel piece number of this time definite Rb less than the included code channel piece number of the Rb that has write down, if then continue step 809, otherwise continue step 810.Wherein, the initial value of record is the maximum of code channel piece, i.e. the maximum 80 of code channel number 17 * number of time slots 5=code channel piece.

Step 808: whether judge the included code channel piece number of this time definite Rb greater than the included code channel piece number of the Rb that has write down, if then continue step 809, otherwise continue step 810.Wherein, the initial value of record is the minimum value 0 of code channel piece.

Step 809: upgrade former record, promptly the position of this Rb that determines of record and included code channel piece number to substitute the data in the former record, continue step 810.

Step 810: judge according to the resource allocation granularity whether high code channel direction exists the code channel that can be used as baseline, if then continue step 811, otherwise continue step 812.

Step 811: move baseline according to the resource allocation granularity, continue step 802.

Step 812: the Rb of current record is distributed to UE, and indicate to this UE by the TFRI field.

Can in calculating the process of Rb, carry out and number 8 between judgement, obtain Rb near 8, if there is Rb, then no longer carry out a plurality of less than the comparison between 8 the Rb greater than 8.

It is short and exist and need the situation effect of the PDU that retransmits better that present embodiment is used in the total length of MAC-hs PDU to be transmitted.

Referring to Fig. 9, passing threshold determines that the idiographic flow of resource distribution mode and Resources allocation is as follows in the present embodiment:

Step 901: determine the total length of the MAC-hs PDU to be transmitted of UE, and determine the code channel piece number cc of needs according to this total length and current resource utilization.

Step 902: code channel piece number cc and the preset threshold value determined are compared, judge whether, if then continue step 903, otherwise continue step 904 greater than threshold value.

Step 903: each code channel and time slot are traveled through, determine maximum available PDSCH Resource Block variable R max in the system, and Rmax is distributed to UE, detailed process is referring to step 701-step 708.

Step 904: each code channel and time slot are traveled through, determine that the code channel piece number that comprises is not less than the Rb of cc, the minimum Rb of code channel piece number that selection comprises from the Rb that determines distributes to UE with the Rb that selects again, and detailed process is referring to step 802-step 812.

The present embodiment passing threshold is controlled the method for salary distribution of selection, combines the advantage of two kinds of methods of salary distribution, and the beneficial effect that reaches is better.

All relevant in above-mentioned traversal and the process of distributing available PDSCH resource with the resource allocation granularity, present embodiment is adjusted the existing resources partition size, more effectively to distribute and to utilize available PDSCH resource, referring to shown in Figure 10, the device of Resources allocation also comprises granularity module 505 in the present embodiment.

Granularity module 505 is determined the resource allocation granularity according to HSDPA typical services (as browsing page, download text file and multimedia service etc.) and/or midamble skew (midamble_shift) to the requirement of initial code channel.Determine suitable resource allocation granularity according to the HSDPA typical services, the less business of length about not subdivisible PDU (being called minimum PDU in the present embodiment) can reduce the wasting of resources, can reduce operating procedure about the bigger business of length of subdivisible PDU not.Determine that according to midamble_shift the resource allocation granularity can directly satisfy the requirement of UE to initial channel, avoid to obtain to serve or repeat the operation of Resources allocation for the UE that UE distributes its unsupported available PDSCH resource to be caused.

Consider that under the situation of resource allocation granularity, the flow process of Resources allocation is as follows, referring to flow process shown in Figure 11:

Step 1101: know each code channel of system assignment and the available code channel piece in the time slot.

Step 1102: to the requirement of initial code channel, determine the resource allocation granularity according to the HSDPA typical services of UE and/or midamble_shift.

Step 1103:, need to determine the available code channel piece number of distributing according to the total length of the MAC-hs PDU to be transmitted of the resource allocation granularity of determining and this UE correspondence.

Step 1104: selector is should the code channel piece of number from all available code channel pieces according to the number of determining, and the available PDSCH Resource Block that the code channel piece of selection is constituted meets the structure of TFRI field, should available PDSCH resource block assignments to this UE.If the number of current available code channel piece is not enough to meet this number, then select current all available code channel pieces.

The specific implementation of determining the resource allocation granularity is as follows, referring to flow process shown in Figure 12:

Step 1201: determine the least resource piece Gmin of needs according to the HSDPA typical services of UE correspondence, wherein the minimum value of Gmin is 1 code channel piece.For example, multimedia service need determine that Gmin is 4 code channel pieces, and literal class service needed determines that Gmin is 1 code channel piece.If the corresponding multiclass business of UE, and the length difference of the minimum PDU of each professional correspondence are then determined Gmin according to the maximum length among a plurality of minimum PDU.

Step 1202: determine the number of midamble_shift, this number depends on midamble configuration parameter mid_k.

Step 1203: the maximum number Nct (maximum number of present general code channel is 16) according to present code channel, determine the requirement of midamble_shift to initial code channel, promptly should require to satisfy

, for example mid_k is 2, and then result of calculation is 8, and promptly the initial code channel of Yao Qiuing is code channel 0 and code channel 8.

Step 1204: get Gmin and

In bigger value as the value of resource allocation granularity G, promptly

Resource allocation is that unit distributes with the resource partition size all, present embodiment is selected the resource allocation granularity according to HSDPA typical services and midamble_shift flexibly to the requirement of initial code channel, avoided single resource allocation granularity (stipulating usually that at present this granularity is 4 code channel pieces) to cause, can be divided into the HSDPA typical services of less PDU (as browsing page for some, download text file etc.), use this resource allocation granularity and may waste the available PDSCH resource of part, PDU for example to be transmitted needs 5 code channel pieces, then distribute 8 code channel pieces at least according to this resource allocation granularity, obviously have 3 code channel pieces to be wasted; Perhaps, for the bigger HSDPA typical services of some PDU (as multimedia service etc.), using this resource allocation granularity makes operating procedure more relatively, for example, PDU to be transmitted needs 8 code channel pieces, for 17 code channels, only needs to determine whether the resource on code channel 0 and the code channel 8 is available in ergodic process, and, need extra determine code channel 4 and code channel 12 according to the resource allocation granularity of existing 4 code channel pieces.

Since the structure qualification of TFRI field the available PDSCH Resource Block that the distributes structure that must be a kind of similar rectangle, comprise 9 code channel pieces so may appear as the available PDSCH Resource Block of UE distribution, and the MAC-hs PDU of transmission that this time needs of this UE correspondence only needs 7 code channel pieces, there is the waste of 2 available code channel pieces, for fear of this wasting of resources, present embodiment provides the MAC-hs PDU of definite actual transmissions that a kind of folder forces formula and the method for surplus resources rollback.

Data module 503, determine the total length of MAC-hs PDU of the needs transmission of UE correspondence, and according to the length of each PDU, current channel quality and coded system, from all PDU waiting for transmission, select, the PDU of selection is compared, the total length of the most approaching definite available PDSCH Resource Block of its total length with other compound mode of PDU; Wherein preferentially select the high PDU of urgency, as the PDU that needs retransmit, perhaps the cache-time in Subscriber Queue is than long PDU.By traveling through the PDU whether whether UE exist needs to retransmit to there being retransmission process to know.

The device that is used for Resources allocation also comprises rollback module 506, referring to shown in Figure 13.This rollback module 506 knows that distribution module 504 is defined as the available PDSCH Resource Block Rb that UE distributes, according to the length of the Rb that obtains, transport block set (the TransportBlock Set that UE supports, TBS) (or claim TBS competence set) and data module 503 are determined this time needs the length of the MAC-hs PDU that transmit, determine the available PDSCH Resource Block Rr of the actual use of this UE, be equivalent to the available PDSCH Resource Block Rr that actual allocated is given this UE.Then, obtain untapped code channel piece among the Rb according to predefined resource service regeulations, and the available code channel piece during as next resource allocation.The resource service regeulations have multiple, and it is preferential for example to set time slot, and then the side time slot from Rb begins, and preferentially use on this time slot the available code channel piece of each code channel among the Rb; Perhaps, it is preferential to set code channel, and then the side code channel from Rb begins, and preferentially uses on this code channel the available code channel piece of each time slot among the Rb.Stipulate in the present embodiment: the preferential code channel piece that uses on the minimum time slot of the available code channel piece of residue is equivalent to according to s using in order from t to 0 among Fig. 7 B.

Consider that under the situation of surplus resources rollback, the flow process of Resources allocation is as follows, referring to flow process shown in Figure 14:

Step 1401: know each code channel of system assignment and the available code channel piece in the time slot.

Step 1402:, need to determine the available code channel piece number of distributing according to the total length of the MAC-hs PDU to be transmitted of UE correspondence.

Step 1403: from all available code channel pieces, selects to satisfy the code channel piece of this number according to the number of determining, and the available PDSCH Resource Block Rb that the code channel piece of selection is constituted meets the structure of TFRI field, should available PDSCH resource block assignments to this UE.

Step 1404: according to the MAC-hs PDU waiting for transmission and the TBS competence set of UE correspondence, determine the available PDSCH Resource Block Rr of this UE actual needs, and, search and reclaim remaining code channel piece among the available PDSCH Resource Block Rb that has distributed according to the resource service regeulations.

Describe the Rr that determines actual needs below in detail and reclaim the implementation method that remains the code channel piece.

Referring to Figure 15, the specific implementation flow process of the Rr of definite actual needs is as follows in the present embodiment:

Step 1501: the length T BSb of definite available PDSCH Resource Block Rb that has distributed, represent with bit.

Step 1502:, from the TBS competence set, select transmittability TBSmax near TBSb according to the length T BSb of Rb and current channel quality.Wherein the calculating of TBS ability depends on channel quality.This step can obtain the TBS ability according to the default value of channel quality.Obtain TBS ability more accurately according to current channel quality in the present embodiment, the possible wasting of resources maybe can be satisfied and not satisfy the needs of the transfer of data of UE when avoiding resource allocation.

Step 1503: from the PDU to be transmitted of UE correspondence, select PDU according to TBSmax, make the length L hs of the MAC-hs PDU of the PDU that comprises selection be not more than TBSmax.Wherein carry out the selection of PDU according to the length of each PDU, current channel quality and coded system.Channel quality has limited resource utilization and coded system, and under the certain situation of the error rate, channel quality good more (disturb less, network congestion is not serious etc.) resource utilization is high more, even can not use coding.Because each coded system is applicable to different transmission rates and the length of minimum PDU, so coded system has limited the compound mode of PDU, and the selection of PDU; For example, convolution code is used for lower data rate transport, and the length of minimum data piece is 9bits, and Turbo code is used for the higher data speed rates, and the length of minimum data piece is for being generally 321bits.

Step 1504: in the TBS competence set, search once more according to Lhs, select to be not less than minimum transmittability TBSmin in the transmittability of Lhs.

Step 1505: determine resource utilization according to current channel quality, and calculate the code channel piece number of TBSmin correspondence, promptly obtain the length of the Rr of actual needs according to the resource utilization of determining.

About the magnitude relationship of TBSb, TBSmax, Lhs and TBSmin, see also shown in Figure 16.Can determine the length of Rr according among TBSb, TBSmax, Lhs and the TBSmin any one, in the present embodiment TBSmin is defined as the length of Rr, both satisfy the transmittability of UE under current channel quality conditions, and made the length of Rr shorter again, saved resource.

Referring to Figure 17, use the preferential rule of time slot in the present embodiment, the specific implementation flow process that reclaims residue code channel piece is as follows:

Step 1701: get the code channel number Cmax of each time slot among the available PDSCH Resource Block Rb that has distributed, i.e. the number of available code channel piece in time slot is about the c of the s indication position of the subscript k correspondence of Rb in the description of Fig. 7 B.

Step 1702: determine the number of time slots Nts that the Rr of actual needs comprises according to Cmax, promptly

Step 1703: whether judge Nts greater than 1, if then execution in step 1704, otherwise execution in step 1705.

Step 1704: according to the available code channel piece of residue order from less to more each time slot among the Rb is traveled through, determine the code channel piece (corresponding regulation UE is according to this available code channel piece that uses in order) that UE may use, i.e. the position of Rr.Residue code channel piece with respect to Rr among the Rb is the code channel piece that this rollback operation obtains, and is used to other UE Resources allocation.Can avoid large-scale continuous can be split with the code channel piece according to the available code channel piece of residue order from less to more, guarantee that the long UE of follow-up MAC-hs PDU to be transmitted can access enough available PDSCH Resource Block.

Step 1705: illustrate that Rr has only taken the available code channel piece on 1 time slot, then upgrades Rb according to Rr.Residue code channel piece with respect to the Rb after upgrading among the Rb before upgrading is the code channel piece that this rollback operation obtains.

Referring to Figure 18, use the preferential rule of code channel in the present embodiment, the specific implementation flow process that reclaims residue code channel piece is as follows:

Step 1801: get the timeslot number TSmax among the available PDSCH Resource Block Rb that has distributed, be equivalent to add result after 1 about the pairing s of Rb in the description of Fig. 7 B.

Step 1802: determine the code channel number Ncode that the Rr of actual needs comprises according to TSmax, promptly

Step 1803: whether judge Ncode greater than 1, if then execution in step 1804, otherwise execution in step 1805.

Step 1804:, determine the code channel piece that UE may use, i.e. the position of Rr according to Rb being traveled through from code channel order from low to high.Residue code channel piece with respect to Rr among the Rb is the code channel piece that this rollback operation obtains, and the resource that is used to other UE to distribute.

Step 1805: illustrate that Rr has only taken the available code channel piece on 1 code channel, then upgrades Rb according to Rr.Residue code channel piece with respect to the Rb after upgrading among the Rb before upgrading is the code channel piece that this rollback operation obtains.

Use present embodiment and can save Internet resources to greatest extent.

In the time of can being embodied as each UE and distributing available PDSCH resource by above embodiment, save Internet resources to greatest extent, and determine the PDU of this needs transmission to realize making full use of Internet resources according to current channel quality.Limited when Internet resources, and the quantity of UE needs to consider to give more urgent UE with resource allocation when big.

The device of Resources allocation comprises that also UE selects module 507 in the present embodiment, referring to shown in Figure 19.UE selects the urgency level of module 507 according to each UE needs resource, the preferential the highest UE of urgency level that selects from the buffer queue of storing UE sign to be selected, and determine that this UE need obtain available PDSCH resource at first, and the sign that will obtain the UE of resource allocation is deleted from this buffer queue.The priority of urgency level and UE and/or the total length of MAC-hs PDU to be transmitted are relevant.Wherein buffer queue belongs to memory module 501.

Implementation according to the urgency level Resources allocation of each UE needs resource is as follows, referring to shown in Figure 20:

Step 2001: know the available code channel piece in each code channel and the time slot.

Step 2002: the object that the current the highest UE of urgency level that needs resource is defined as this resource allocation.

Step 2003: according to the total length of the pairing MAC-hs PDU to be transmitted of UE that determines, for this UE distributes available PDSCH Resource Block.

Step 2004: this UE is deleted from formation to be selected, and will be designated non-available PDSCH Resource Block for the available PDSCH Resource Block of its distribution.

The foregoing description is a urgency level of determining UE needs resource according to the priority orders of UE, also can determine the urgency level (or claiming urgency) of UE needs resource according to the total length of the MAC-hs PDU to be transmitted of each UE, for example that total length is the longest UE is defined as the highest UE of urgency.Present embodiment provides a kind of preferable implementation, promptly take all factors into consideration the priority of each UE and the total length of MAC-hs PDU to be transmitted, determine the urgency level of each UE, an instantiation is: Sn=β * Pn+ (1-β) * Ln, wherein Sn represents urgency, and the big more urgency level of value is high more; Pn represents priority, and the big more priority of value is high more; Ln represents the total length of MAC-hs PDU to be transmitted; β is a weights factor, and β ∈ [0,1] has characterized the relative significance level of two parameters of Pn and Ln in urgency level, and the big more expression of the value of β Pn is big more to the urgency influence, n=1,2 ..., get different values to identify different UE.Can determine different urgency levels to different UEs by this method with equal priority.Carry out resource allocation if can therefrom choose one wantonly when having the identical UE of a plurality of urgency levels.

In the resource distribution mode that Fig. 7 A-Fig. 9 describes, when adopting maximum available PDSCH resource block assignments principle or optimum available PDSCH resource block assignments principle, available PDSCH Resource Block of a plurality of maximums or optimum available PDSCH Resource Block may appear, can select an available PDSCH Resource Block of maximum or optimum available PDSCH resource block assignments to give UE at random, but may cause remaining the discontinuous of available code channel piece when being a UE Resources allocation, make follow-uply can't obtain enough resources the bigger UE of available PDSCH resources requirement.Present embodiment is analyzed available PDSCH Resource Block of all a plurality of maximums or optimum available PDSCH Resource Block, determines a kind of optimum distributing scheme.Be that example is elaborated with the available PDSCH Resource Block of a plurality of maximums below.

Distribution module 504 is known and is write down the available PDSCH Resource Block of a plurality of maximums, therefrom select an available PDSCH resource block assignments of maximum to give current UE, and write down this method of salary distribution, continue as follow-up UE then and distribute available PDSCH Resource Block, and be the situation of each UE Resources allocation under this method of salary distribution of analysis-by-synthesis; Distribution module 504 selects another maximum available PDSCH resource block assignments to give current UE from the available PDSCH Resource Block of a plurality of maximums, and continuation subsequent operation, up to the comprehensive condition that obtains all maximum available PDSCH Resource Block, then each comprehensive condition is analyzed, determine optimum distributing scheme, and according to this optimum distributing scheme for each UE distributes available PDSCH Resource Block.

Present embodiment provides a kind of comprehensive plurality of distribution situation and obtains the resource allocation methods of optimum distributing scheme, and referring to shown in Figure 21, realization flow is as follows:

Step 2101: know the available code channel piece in each code channel and the time slot.

Step 2102:, obtain a plurality of available PDSCH Resource Block according to the total length of the pairing PDU to be transmitted of UE.

Step 2103: after analysis is distributed to this UE respectively with a plurality of available PDSCH Resource Block, the Resource Allocation Formula that other UE obtains.

Step 2104: from a plurality of Resource Allocation Formulas, select the optimal resource allocation scheme, and according to this optimal resource allocation scheme for each UE distributes available PDSCH Resource Block.It is multiple to select the foundation of optimal resource allocation scheme to have, and is defined as the optimal resource allocation scheme as the longest scheme of total length of available PDSCH Resource Block that all UE are obtained; Perhaps satisfy maximum UE the scheme of the requirement of available PDSCH Resource Block is defined as optimal resource allocation scheme etc. according to priority order from high to low.

Present embodiment provides a kind of preferable implementation, takes all factors into consideration many-sided factor and obtains optimum distributing scheme, and referring to shown in Figure 22, the specific implementation flow process is as follows:

Step 2201: determine the current UE that needs to distribute available PDSCH resource.For example the UE of Que Dinging is UE1.

Step 2202: know available PDSCH code channel piece and available HS-SCCH resource in each code channel and the time slot.

Step 2203: determine maximum available PDSCH Resource Block or determine only available PDSCH Resource Block according to the total length of the MAC-hs PDU to be transmitted of this UE correspondence.For convenience, be that example describes with the available PDSCH Resource Block of maximum below, adopt the method for the method of salary distribution acquisition preferred plan of only available PDSCH Resource Block to consult and carry out.Determine the number of maximum available PDSCH Resource Block simultaneously.For example, the number of the maximum available PDSCH Resource Block of UE1 correspondence is 2.

Step 2204: select an available PDSCH Resource Block of maximum, and distribute to this UE, write down the resource allocation conditions of this UE, i.e. Tn=α * Pn+ (1-α) * Bn, wherein Tn represents the resource allocation conditions of this UE this time; N=1,2...... are the sign of this UE, represent that promptly this UE is the UE of which acquisition resource in the current Resource Allocation Formula; Bn represents the size of the available PDSCH Resource Block that obtains, and multiple expression mode is arranged, and, represents with code channel piece number perhaps that present embodiment is that example describes in the mode of code channel piece number as showing with the bit numerical table; α is a weights factor, and α ∈ [0,1] has characterized the relative significance level of two parameters of Pn and Bn in PDSCH resource selection algorithm.For example, α=0.8, about the P1=2 of UE1, B1=4, then T1=2.4.

Step 2205: write down this UE and obtained resource, and be non-available PDSCH resource the resource mark of its acquisition, and the maximum available PDSCH Resource Block number of upgrading this UE correspondence, as this number is subtracted 1.For example, the maximum available PDSCH Resource Block number after the renewal of UE1 correspondence is 1.

Step 2206: judge whether to exist needs distribute available PDSCH resource UE, whether have available PDSCH resource and available HS-SCCH resource, if above-mentioned condition all satisfies, then continue step 2201, otherwise continue step 2207.This step has been taken all factors into consideration the influence of many-sided factor to resource allocation, the operating procedure when having saved Resources allocation.

For example, know that UE2 also needs to obtain resource this moment, and the number of the maximum available PDSCH Resource Block of UE2 correspondence is 2, and the number of the maximum available PDSCH Resource Block after the renewal is 1, about the P2=1 of UE2, and B2=4, then T2=1.6.Same method knows that UE3 also needs to obtain resource, and the number of corresponding maximum available PDSCH Resource Block is 1, and the number of the maximum available PDSCH Resource Block after the renewal is 0, about the P3=0 of UE3, and B2=4, then T3=0.8.

Step 2207: above step has realized a kind of Resource Allocation Formula, and writes down, analyzes and add up this Resource Allocation Formula.Statistical operation comprises: $T=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\mathrm{Tn},$ Wherein T represents the resource allocation conditions under this Resource Allocation Formula.For example, first kind of Resource Allocation Formula $T=\underset{i=1}{\overset{n=3}{\mathrm{\&Sigma;}}}\mathrm{Tn}=\mathrm{<figure-callout\; id="1"\; label="T"\; filenames="S071B8564520070807E000011.png,S071B8564520070807E000012.png"\; state="\{\{state\}\}">T</figure-callout>}1+\mathrm{<figure-callout\; id="2"\; label="T"\; filenames="S071B8564520070807E000012.png,S071B8564520070807E000021.png"\; state="\{\{state\}\}">T</figure-callout>}2+\mathrm{<figure-callout\; id="3"\; label="T"\; filenames="S071B8564520070807E000012.png,S071B8564520070807E000021.png"\; state="\{\{state\}\}">T</figure-callout>}3=4.8.$

Step 2208: carry out traversal according to the backward of the order of determining UE in the step 2201, search the maximum available PDSCH Resource Block number of each UE correspondence about each UE.For example, order is UE1-UE2-UE3, so backward is UE3-UE2-UE1.

Step 2209: judge whether to exist maximum available PDSCH Resource Block number greater than 0, if, then from traverse first greater than 0 the pairing UE of maximum available PDSCH Resource Block number, continue step 2204, otherwise continue step 2210.Descend a kind of Resource Allocation Formula when continuing step 2204, in following a kind of Resource Allocation Formula, according to the order of determining UE in the step 2201 with in the current Resource Allocation Formula greater than the resource allocation conditions of each UE before 0 the pairing UE of maximum available PDSCH Resource Block number as the resource allocation conditions of UE accordingly in a kind of Resource Allocation Formula down.

For example, at first travel through UE3, the maximum available PDSCH Resource Block number of finding the UE3 correspondence is 0, then continue traversal UE2, the maximum available PDSCH Resource Block number of finding the UE2 correspondence is 1, promptly greater than 0, continues step 2204 at UE2, give UE2 with the available PDSCH resource block assignments of second maximum of UE2 correspondence, this moment P2=1, B2=4, then T2=1.6, and the continuation step knows that UE3 needs Resources allocation, the number of corresponding maximum available PDSCH Resource Block is 1, and the number of the maximum available PDSCH Resource Block after the renewal is 0, about the P3=0 of UE3, B2=2, then T3=0.4.In second kind of Resource Allocation Formula, the distribution condition of UE1 is identical with UE1 in first kind of Resource Allocation Formula, i.e. T1=2.4.So second kind of Resource Allocation Formula $T=\underset{i=1}{\overset{n=3}{\mathrm{\&Sigma;}}}\mathrm{Tn}=\mathrm{<figure-callout\; id="1"\; label="T"\; filenames="S071B8564520070807E000011.png,S071B8564520070807E000012.png"\; state="\{\{state\}\}">T</figure-callout>}1+\mathrm{<figure-callout\; id="2"\; label="T"\; filenames="S071B8564520070807E000012.png,S071B8564520070807E000021.png"\; state="\{\{state\}\}">T</figure-callout>}2+\mathrm{<figure-callout\; id="3"\; label="T"\; filenames="S071B8564520070807E000012.png,S071B8564520070807E000021.png"\; state="\{\{state\}\}">T</figure-callout>}3=4.4.$

Step 2210: all Resource Allocation Formulas of analysis-by-synthesis, select and be each UE Resources allocation according to the Resource Allocation Formula of the best.Instantiation is that the T value with all Resource Allocation Formulas compares, and the pairing Resource Allocation Formula of the T of value maximum is defined as best Resource Allocation Formula.For example, the T value of first kind of Resource Allocation Formula and second kind of Resource Allocation Formula is compared, find the T value 4.4 of the T value 4.8 of first kind of Resource Allocation Formula, determine that therefore first kind of Resource Allocation Formula is best Resource Allocation Formula greater than second kind of Resource Allocation Formula.

Above embodiment respectively from the determining of available PDSCH Resource Block, resource allocation granularity, data waiting for transmission select, the rollback of available PDSCH resource and the sequential scheduling aspect that obtains the UE of resource optimize method of allocating resources, on the basis of having realized resource allocation, saved Internet resources to greatest extent, and fully satisfied the demand of each UE available PDSCH resource.The comprehensive above advantage of present embodiment, a kind of preferable implementation is provided, under this preferable implementation, the device that is used for Resources allocation comprises: interface module 500, memory module 501, UE select module 507, granularity module 505, spider module 502, data module 503, distribution module 504 and rollback module 506.Referring to shown in Figure 23.

Interface module 500 is known the resource allocation conditions (comprising which is that available PDSCH resource and which right and wrong can be used the PDSCH resource) of system.Wherein, the mode of knowing has multiple, as knowing available code channel piece by the mode that receives message, perhaps knows available code channel piece by the write operation of accepting external device (ED).

Memory module 501, storage need be to the data of each UE transmission, and the resource allocation conditions of saved system, temporary variable and various parameters etc., can be storage mediums such as buffer memory, hard disk and tape.

UE selects the urgency level of module 507 according to each UE needs resource, the preferential the highest UE of urgency level that selects from the buffer queue of storing UE sign to be selected, and determine that this UE need obtain available PDSCH resource at first, and the sign that will obtain the UE of resource allocation is deleted from this buffer queue.

Granularity module 505 is determined the resource allocation granularity according to HSDPA typical services and/or midamble_shift to the requirement of initial code channel.

Spider module 502 is a starting point with the baseline, according to predetermined rule each code channel and time slot is traveled through, and determines the length and the position of available PDSCH Resource Block under all compound modes, and length and the position of determining maximum available PDSCH Resource Block where necessary.

Data module 503, determine the total length of the MAC-hs PDU waiting for transmission of UE correspondence, and according to the length of each PDU, current channel quality and coded system, from all PDU waiting for transmission, select, the PDU of selection is compared, the total length of the most approaching definite available PDSCH Resource Block of its total length with other compound mode of PDU; Wherein preferentially select the high PDU of urgency, as the PDU of needs re-transmission, by traveling through the PDU whether whether UE exist needs to retransmit to there being retransmission process to know.

Distribution module 504, length according to available PDSCH Resource Block under the length of data to be transmitted and the various compound mode, for UE distributes available PDSCH Resource Block, and generate corresponding TFRI field, record in the updated stored module 501 is changed to the available PDSCH Resource Block that distributes non-available simultaneously.Distribution module 504 is known and when writing down the available PDSCH Resource Block of a plurality of maximums, therefrom select an available PDSCH resource block assignments of maximum to give current UE, and write down this method of salary distribution, continue as follow-up UE then and distribute available PDSCH Resource Block, and be the situation of each UE Resources allocation under this method of salary distribution comprehensively; Distribution module 504 selects another maximum available PDSCH resource block assignments to give current UE from the available PDSCH Resource Block of a plurality of maximums, and continuation subsequent operation, up to the comprehensive condition that obtains all maximum available PDSCH Resource Block, then each comprehensive condition is analyzed, determine optimum distributing scheme, and according to this optimum distributing scheme for each UE distributes available PDSCH Resource Block.

Rollback module 506 knows that distribution module 504 is defined as the available PDSCH Resource Block Rb that UE distributes, according to the length of the Rb that obtains, the TBS competence set of UE support and the length of the PDU that data module 503 definite needs this time transmit, determine the available PDSCH Resource Block Rr of the actual use of this UE, promptly be equivalent to the available PDSCH Resource Block Rr that actual allocated is given this UE.Then, obtain untapped code channel piece among the Rb according to predefined resource service regeulations, and the available code channel piece during as next resource allocation, the record in the updated stored module 501 is changed to available with being changed to non-available untapped code channel piece simultaneously.

Referring to Figure 24, a kind of preferable method of allocating resources specific implementation flow process is as follows in the present embodiment:

Step 2401: determine the urgency of UE to be allocated according to Sn=β * Pn+ (1-β) * Ln, and select the highest UE of current urgency to be defined as the current UE that needs Resources allocation.

Step 2402: HSDPA typical services and midamble_shift according to the current UE correspondence determine the resource allocation granularity to the requirement of initial code channel.

Step 2403: the total length of the MAC_hs PDU to be transmitted by judging the current UE correspondence is determined the distribution principle of the maximum available PDSCH Resource Block of employing with the relation of preset threshold value or is adopted the distribution principle of only available PDSCH Resource Block.

Step 2404: know available PDSCH code channel piece and available HS-SCCH resource in each code channel and the time slot.

Step 2405: according to the distribution principle of determining each code channel and time slot are traveled through, obtain corresponding available PDSCH Resource Block, and determine the number of corresponding available PDSCH Resource Block.For example, adopt the distribution principle of maximum available PDSCH Resource Block, obtain 2 available PDSCH Resource Block of maximum.

Step 2406: select 1 available PDSCH resource block assignments of maximum to give current UE, and write down the resource allocation conditions of this UE.

Step 2407:, the available PDSCH Resource Block (being the indicated available PDSCH Resource Block of TERI field) that adopts folder to force the formula method to be defined as this UE to distribute, this time need PDU of transmission and the available PDSCH Resource Block that this UE actual capabilities are used according to the length of the maximum available PDSCH Resource Block of current channel quality and distribution.

Step 2408: adopt fallback mechanism, will indicate to UE and its untapped code channel piece recovery, and as the available code channel piece in the follow-up resource allocation.Temporarily delete this UE then.

Step 2409: judge whether to exist needs distribute available PDSCH resource UE, whether have available PDSCH resource and available HS-SCCH resource, if above-mentioned condition all satisfies, then continue step 2401, otherwise continue step 2410.

Step 2410: above step has realized a kind of Resource Allocation Formula, and writes down and add up this Resource Allocation Formula.

Step 2411: carry out traversal according to the backward of the order of determining UE in the step 2401, search the maximum available PDSCH Resource Block number of each UE correspondence about each UE.

Step 2412: judge whether to exist maximum available PDSCH Resource Block number greater than 0, if, then from traverse first greater than 0 the pairing UE of maximum available PDSCH Resource Block number, continue step 2406, and reply buffer queue, otherwise continue step 2413 about this UE and follow-up UE.

Step 2413: all Resource Allocation Formulas of analysis-by-synthesis, select and be each UE Resources allocation according to the Resource Allocation Formula of the best.Instantiation is that the T value with all Resource Allocation Formulas compares, and the pairing Resource Allocation Formula of the T of value maximum is defined as best Resource Allocation Formula.

When having the identical UE of a plurality of urgency, can select a UE arbitrarily, the Resource Allocation Formula when perhaps in this selects the process of UE, determining preferential each UE of selection, and participate in the comparison of Resource Allocation Formula, to obtain best Resource Allocation Formula.

The embodiment of the invention provides the method that obtains the available PDSCH Resource Block under the various compound modes, and each available PDSCH Resource Block all is applicable to the TFRI field structure, realized giving UE with irregular available PDSCH resource allocation, saved Internet resources, made each UE obtain the service that needs simultaneously.The embodiment of the invention is also further optimized resource allocation methods from aspects such as the recovery of the selection of the available PDSCH Resource Block of the selection of the selection of resource allocation granularity, UE, data to be transmitted, distribution, surplus resources and analysis-by-synthesis Resource Allocation Formulas, realizes the utilization of resources largely and fully satisfies the resource requirement of most UE.The software of realizing the embodiment of the invention can be stored in the storage mediums such as hard disk, tape, flash memory.

Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.

Claims (26)

1. a method of distributing high-speed physics downlink sharied signal channel resource is characterized in that, may further comprise the steps:

Know the code channel piece that allows carrying High-Speed Physical Downlink Shared Channel HS-PDSCH resource in the system;

Determine the available HS-PDSCH Resource Block that described code channel piece constitutes under various compound modes; Wherein, described available HS-PDSCH Resource Block comprises the one or more continuous code channel piece on the time slot, perhaps comprises a code channel or many continuous code channels identical on a plurality of time slots;

From the available HS-PDSCH Resource Block of determining, select an available HS-PDSCH Resource Block and distribute to the current subscriber equipment that needs to obtain available HS-PDSCH resource.

2. the method for claim 1 is characterized in that, by each code channel and time slot are traveled through, knows on the identical continuous code channel the various compound modes of available code channel piece in each time slot.

3. method as claimed in claim 2 is characterized in that, a baseline that is used for traversing operation is set, and according to moving direction and the position of baseline in code channel or time slot, travels through the described code channel piece in each code channel and the time slot.

4. method as claimed in claim 3 is characterized in that, the step of carrying out a traversing operation under the baseline comprises:

Determine the position of current basic line and the direction that moves according to default rule;

Side from the vertical direction of described mobile direction travels through to the direction that it moves from baseline;

When finding that non-described code channel piece or this moving direction traversal finishes, move to opposite side along described vertical direction, and proceed to travel through to the direction that it moves from baseline;

When the opposite side traversal to described vertical direction finishes, finish the traversing operation under this baseline.

5. method as claimed in claim 4 is characterized in that, determines that the method for the position of baseline comprises:

Determine the position of baseline according to the resource allocation granularity; Perhaps

The position of baseline is determined in variation from having to do not having according to available HS-PDSCH resource; Perhaps

The position of baseline is determined in the variation of growing out of nothing according to available HS-PDSCH resource.

6. method as claimed in claim 3 is characterized in that, according to the result of the available code channel piece of traversal under the baseline, knows the various compound modes of available code channel piece under this baseline.

7. method as claimed in claim 6 is characterized in that, knows that the operating procedure of the various compound modes of available code channel piece under the baseline comprises:

Know described code channel piece continuous on each time slot respectively by traversing operation;

Select one or more continuous described code channel pieces on the time slot, perhaps select the described code channel piece on one or more identical in a plurality of time slots continuous code channel;

The described code channel piece of selecting is defined as a kind of compound mode.

8. method as claimed in claim 7 is characterized in that, also comprises step under knowing a baseline after the various compound modes of available code channel piece:

Determine the number of described code channel piece continuous on each time slot;

Sort according to the number of descending order to the available code channel piece of each time slot correspondence;

Obtain number and its determined result of product of pairing figure place in the order ranking of described available code channel piece respectively;

Result of product according to maximum obtains maximum available HS-PDSCH Resource Block; Wherein, the number of the available code channel piece of maximum result of product correspondence is the number of code channel in the maximum available HS-PDSCH Resource Block, the figure place of maximum result of product correspondence is the number of time slot in the maximum available HS-PDSCH Resource Block, and this figure place and the pairing time slot of each figure place before thereof are the maximum residing time slot of available HS-PDSCH Resource Block.

9. the method for claim 1 is characterized in that, selects maximum available HS-PDSCH Resource Block from the available HS-PDSCH Resource Block of determining.

10. the method for claim 1, it is characterized in that, according to the total length of the high-speed multimedia access control load data unit MAC-hs PDU to be transmitted of described current user equipment correspondence, from the available HS-PDSCH Resource Block of determining, select to be not less than the available HS-PDSCH Resource Block of the minimum of described total length.

11. the method for claim 1, it is characterized in that, whether the total length of MAC-hs PDU to be transmitted of judging described current user equipment correspondence is greater than preset threshold value, if, then from the available HS-PDSCH Resource Block of determining, select maximum available HS-PDSCH Resource Block, otherwise selection is not less than the available HS-PDSCH Resource Block of the minimum of described total length from the available HS-PDSCH Resource Block of determining.

12. method as claimed in claim 11, it is characterized in that, when knowing when having a plurality of available HS-PDSCH Resource Block that meets alternative condition, difference according to the available HS-PDSCH Resource Block of from described a plurality of available HS-PDSCH Resource Block, selecting, determine to distribute to the available HS-PDSCH Resource Block of subsequent user equipment respectively, to obtain allocation result respectively at all subscriber equipmenies, and from a plurality of allocation result, select the optimal allocation result, and the available HS-PDSCH Resource Block of selecting described in the optimal allocation result is defined as the available HS-PDSCH Resource Block that this distributes to described current user equipment.

13. the method for claim 1 is characterized in that, determines described available HS-PDSCH Resource Block according to the resource allocation granularity.

14. method as claimed in claim 13 is characterized in that, according to the requirement of described current user equipment corresponding service and/or midamble skew to initial code channel, determines the resource allocation granularity.

15. the method for claim 1 is characterized in that, further according to the length of the available HS-PDSCH Resource Block that distributes, this time need to determine the data of transmission from the data to be transmitted of described current user equipment correspondence.

16. method as claimed in claim 15, it is characterized in that, according to one in the coded system of the re-transmission state of cache-time in Subscriber Queue of the significance level of current channel quality, described current user equipment corresponding service, data, data, data and data or multinomial, this time need to determine the data of transmission.

17. the method for claim 1, it is characterized in that, determine the available HS-PDSCH Resource Block of the actual use of current user equipment described in the available HS-PDSCH Resource Block of described selection, and the untapped available HS-PDSCH Resource Block of current user equipment described in the available HS-PDSCH Resource Block of described selection is used for the resource allocation of other subscriber equipment.

18. method as claimed in claim 17 is characterized in that, determines the length of the described actual available HS-PDSCH Resource Block that uses, and determines the described actual available HS-PDSCH Resource Block that uses according to this length determined and default resource service regeulations.

19. method as claimed in claim 18, it is characterized in that, determine the maximum capacity of transport block set according to the length of the available HS-PDSCH Resource Block of distributing to described current user equipment, and determine the length of the described actual available HS-PDSCH Resource Block that uses according to the maximum capacity of transport block set; Perhaps

Length according to the available HS-PDSCH Resource Block of distributing to described current user equipment, from the data to be transmitted of described current user equipment correspondence, this time need to determine the data of transmission, and, determine the length of the described actual available HS-PDSCH Resource Block that uses according to the length of the MAC-hs PDU of the data that comprise the described transmission of needs this time; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH Resource Block of distributing to described current user equipment, and from the data to be transmitted of described current user equipment correspondence, determine the data of this needs transmission according to the maximum capacity of transport block set, and, determine the length of the described actual available HS-PDSCH Resource Block that uses according to the minimum ability of the length of the MAC-hs PDU that is not less than the data that comprise the described transmission of needs this time in the transport block set.

20. method as claimed in claim 18 is characterized in that, described default resource service regeulations comprise:

Use the HS-PDSCH resource from a side direction opposite side of time slot direction, and the side direction opposite side from the code channel direction uses the HS-PDSCH resource on each time slot; Perhaps

Use the HS-PDSCH resource from a side direction opposite side of code channel direction, and the side direction opposite side from the time slot direction uses the HS-PDSCH resource on every code channel; Perhaps

Number according to the described code channel piece of residue on the time slot reaches the code channel HS-PDSCH resource that uses in order from low to high from less to more.

21. the method for claim 1 is characterized in that, according to the ability of described current user equipment support descending time slot, selects described available HS-PDSCH Resource Block.

22. as each described method in the claim 1 to 21, it is characterized in that, according to the urgency level of the available HS-PDSCH resource of each subscriber equipment needs, the subscriber equipment that urgency level is the highest is defined as the subscriber equipment that current needs obtain available HS-PDSCH resource.

23. method as claimed in claim 22 is characterized in that, according to the total length of priority and/or data to be transmitted MAC-hs PDU, determines described urgency level.

24. a method of determining the length of distribution high-speed physics downlink sharied signal channel resource is characterized in that, comprises step:

Determine the available High-Speed Physical Downlink Shared Channel HS-PDSCH resource of length maximum in the system;

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and determine the length of the HS-PDSCH resource of distributing according to the maximum capacity of transport block set; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and according to described maximum capacity, from data to be transmitted, this time need to determine the data of transmission, making the length of the high-speed multimedia access control load data unit MAC-hs PDU that comprises the data that described needs this time transmit is the maximum length that is no more than described maximum capacity, and the length of the HS-PDSCH resource that the length of described MAC-hs PDU is defined as distributing; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and according to described maximum capacity, from data to be transmitted, this time need to determine the data of transmission, making the length of the MAC-hs PDU of the data that comprise the transmission of described needs this time is the maximum length that is no more than described maximum capacity, further determine to be not less than in the transport block set minimum ability of the length of described MAC-hs PDU, determine the length of described minimum ability for the HS-PDSCH resource of distribution.

25. a device that is used for Resources allocation is characterized in that, comprising:

Be used for code channel piece, determine the unit of the available HS-PDSCH Resource Block that described code channel piece constitutes under various compound modes according to the available High-Speed Physical Downlink Shared Channel HS-PDSCH resource of knowing; Wherein, described available HS-PDSCH Resource Block comprises the one or more continuous code channel piece on the time slot, perhaps comprises a code channel or many continuous code channels identical on a plurality of time slots;

Be used for selecting an available HS-PDSCH Resource Block and distributing to the unit that current needs obtain the subscriber equipment of available HS-PDSCH resource from the available HS-PDSCH Resource Block of determining.

26. one kind is used for definite device that distributes the length of high-speed physics downlink sharied signal channel resource, it is characterized in that, comprising:

Spider module is used for determining the available High-Speed Physical Downlink Shared Channel HS-PDSCH resource of system's length maximum;

Rollback module is used for determining according to the length of the available HS-PDSCH resource of described maximum the maximum capacity of transport block set, and determines the length of the HS-PDSCH resource of distributing according to the maximum capacity of transport block set; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and, determine the length of the HS-PDSCH resource of distributing according to the maximum length of the high-speed multimedia access control load data unit MAC-hs PDU of the data that comprise the transmission of this needs that are no more than described maximum capacity; Perhaps

Determine the maximum capacity of transport block set according to the length of the available HS-PDSCH resource of described maximum, and according to the maximum length of the MAC-hs PDU of the data that comprise the transmission of this needs that are no more than described maximum capacity, determine to be not less than in the transport block set minimum ability of the length of described MAC-hs PDU, and determine the length of described minimum ability for the HS-PDSCH resource of distributing.

Images