[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN101026799A - UE scheduled authorization request assignment and HSUPA scheduling performance improving method - Google Patents

UE scheduled authorization request assignment and HSUPA scheduling performance improving method Download PDF

Info

Publication number
CN101026799A
CN101026799A CNA2007100735614A CN200710073561A CN101026799A CN 101026799 A CN101026799 A CN 101026799A CN A2007100735614 A CNA2007100735614 A CN A2007100735614A CN 200710073561 A CN200710073561 A CN 200710073561A CN 101026799 A CN101026799 A CN 101026799A
Authority
CN
China
Prior art keywords
node
information
happy bit
hsupa
request
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2007100735614A
Other languages
Chinese (zh)
Other versions
CN100486375C (en
Inventor
梁自军
杨卓
唐长春
王琛
范蕾
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CNB2007100735614A priority Critical patent/CN100486375C/en
Publication of CN101026799A publication Critical patent/CN101026799A/en
Application granted granted Critical
Publication of CN100486375C publication Critical patent/CN100486375C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

Characters of the method are that when receiving authorizing request of dispatch from UE, HSUPA despatcher of Node B assigns dispatching authorities based on Happy Bit Delay Condition information in Node B. the information of Happy Bit Delay Condition is contained in enhanced dedicated physical channel in protocol of Node B application part. The invention also discloses method for enhancing dispatching performance of HSUPA. Estimating authorizing request of dispatch of UE, the method raises dispatching performance of despatcher of Node B.

Description

A kind of UE scheduling authorization request distributes and improves the method for HSUPA scheduling performance
Technical field
The present invention relates to the communications field, especially Wideband Code Division Multiple Access (WCDMA) inserts (WCDMA, Wideband CodeDivision Multiple Access) wireless communication system high speed upstream packet inserts (HSUPA, High Speed Uplink Packet Access) professional scheduling.
Background technology
The third generation (3G) wireless mobile communications is among the continuous evolution variation, constantly introduce new demand and realize low cost and high-performance, at the 5th edition (R5, Release 5) and sixth version (R6, Release6) introduced high speed downlink packet access (HSDPA in respectively, High Speed Downlink Access) and HSUPA, its purpose mainly is the overall performance that improves the wireless frequency spectrum utilance and improve system.
HSUPA is the enhancement techniques of WCDMA system to the uplink ability, mainly introduced three kinds of technology: physical layer is mixed automatic repeat requests (HARQ, Hybrid Automatic Repeat Request), based on the fast dispatch of base station (Node B), the short frame transmission of 2 milliseconds of (ms) Transmission Time Intervals (TTI, TransmissionTime Interval).The HSUPA systematic function is significantly improved on the transmission performance of uplink service than traditional WCDMA version, the increase of nearly 50%-70% on power system capacity, the minimizing of 20%-55% is arranged, 50% the increase of on the user grouping calling flow, having an appointment in the delay of end-to-end grouping bag.
Use the WCDMA system of HSUPA technology, comprised radio network controller (RNC, RadioNetwork Controller), Node B and subscriber equipment (UE, User Equipment).NodeB is by measure the upstream noise lifting (RoT of each sub-district in good time, Rise over Thermal), the uplink signal-channel quality of UE, by strengthening dedicated channel (E-DCH, Enhanced Dedicated Channel) upstream data obtains the dispatch request information of UE, determine to distribute to the scheduling authorization of each UE according to information such as the priority of the dispatch request information of the uplink signal-channel quality of the RoT situation of sub-district, UE, UE, UE, scheduling strategy that Node B scheduler adopts and algorithms, send corresponding dispatching command then to corresponding UE; UE is according to scheduling authorization and the non-scheduling authorization of RNC configuration and the buffer state of UE of Node B, in enhancing dedicated channel transport format combination (E-TFC, the E-DCHTransport Format Combination) table of the pre-configured UE of giving of RNC, select suitable transformat to merge and send up E-DCH data to Node B.
In HSUPA, authorize and can send UE to by following three kinds of modes:
One, when Radio Link is set up, distribute initial mandate by service Node B (Serving Node B), pass to UE by RNC, this is authorized and is absolute grant;
Two, Serving Node B sends by E-DCH absolute grant channel (E-AGCH, E-DCH AbsoluteGrant Channel) and licenses to UE, and this is authorized and is absolute grant;
Three, Serving Node B and non-service Node B (Non-Serving Node B) send by E-DCH relative authorization channel (E-RGCH, E-DCH Relative Grant Channel) and license to UE, and this is authorized and is relative authorization, as shown in Figure 1; Can send mandate (UP), the mandate (DOWN) that reduces a step-length that improves a step-length and keep present mandate no change (HOLD) for Serving Node B, can send DOWN and HOLD for Non-Serving Node B, wherein concrete step-length is by the configuration decision of RNC.
In the communication process of UE and Node B, UE mainly passes through following dual mode to the request of authorizing:
One, UE tells by the present scheduling authorization of whether being satisfied with (Happy Bit) that enhancing Dedicated Physical Control Channel (E-DPCCH, E-DCH Dedicated PhysicalControl Channel) carries whether the present mandate of Node B can meet the demands;
If satisfy three following conditions simultaneously, then the value of Happy Bit is set to dissatisfied present mandate (unhappy), otherwise is satisfied present mandate (happy), and three conditions are as described below:
The current scheduling mandate that l, UE are to use when E-TFC selects (SG, Serving Grant) allows the data dispatching of the maximum of transmission to carry out the transmission of data dispatching;
2, UE has enough power with higher data rate transport;
Used power excursion when 3, selecting based on the E-TFC of the same TTI that transmits together with happy bit, based on the HARQ process (HARQ Process) of current SG * activation and the ratio of total HARQ Process, all E-DCH buffer states (TEBS, Total E-DCH Buffer Status) need to surpass happy bit time delay condition (Happy Bit Delay Condition) ms ability end of transmission;
If nonactivated HARQ Process, then the 1st is satisfied forever; For 10ms TTI, the ratio of the HARQ Process of the activation in the 3rd and total HARQ Process is 1 forever.
Two, UE tells the state that Node B is present by sending schedule information (SI, Scheduling Information);
SI comprises following four partial informations (as shown in Figure 2):
1, highest priority logical channel indicates (HLID, Highest priority Logical channelID): the logic channel that is illustrated in the limit priority of data to be transmitted in the buffering area (Buffer) of UE indicates, if there is the priority of a plurality of logic channels identical and, then fills in that maximum logic channel of data and indicate for the highest;
2, TEBS: that represents all logic channels controls (RLC at Radio Link, Radio LinkControl) layer data that need transmit or retransmit is the data total amount of unit with the byte, what report is TEBS value corresponding index value, the scope of its index value is 0 to 31, and the corresponding relation of TEBS index value and TEBS value is as shown in table 1.
Table 1
The TEBS index TEBS value (unit: byte)
0 TEBS=0
1 0<TEBS≤10
2 10<TEBS≤14
3 14<TEBS≤18
4 18<TEBS≤24
5 24<TEBS≤32
6 32<TEBS≤42
7 42<TEBS≤55
8 55<TEBS≤73
9 73<TEBS≤97
10 97<TEBS≤129
11 129<TEBS≤171
12 171<TEBS≤228
13 228<TEBS≤302
14 302<TEBS≤401
15 401<TEBS≤533
16 533<TEBS≤708
17 708<TEBS≤940
18 940<TEBS≤1248
19 1248<TEBS≤1658
20 1658<TEBS≤2202
21 2202<TEBS≤2925
22 2925<TEBS≤3884
23 3884<TEBS≤5160
24 5160<TEBS≤6853
25 6853<TEBS≤9103
26 9103<TEBS≤12092
27 12092<TEBS≤16062
28 16062<TEBS≤21335
29 21335<TEBS≤28339
30 28339<TEBS≤37642
31 37642<TEBS
3, highest priority logical channel buffer state (HLBS, Highest priority Logicalchannel Buffer Status): expression is accounted for the ratio of TEBS by the data of the logic channel of HLID indication, the HLBS that reports is an index value, the corresponding relation of the index value of HLBS and HLBS value is as shown in table 2, if the index value of TEBS is not 31, then get the upper limit of the TEBS value scope of corresponding TEBS index correspondence, otherwise get 50000 bytes, if the index value of TEBS is 0, then the index of HLBS also is 0.
Table 2
The HLBS index HLBS value (percentage)
0 0<HLBS≤4
1 4<HLBS≤6
2 6<HLBS≤8
3 8<HLBS≤10
4 10<HLBS≤12
5 12<HLBS≤14
6 14<HLBS≤17
7 17<HLBS≤21
8 21<HLBS≤25
9 25<HLBS≤31
10 31<HLBS≤37
11 37<HLBS≤45
12 45<HLBS≤55
13 55<HLBS≤68
14 68<HLBS≤82
15 82<HLBS≤100
4, UE power threshold (UPH, UE Power Headroom): the ratio of the maximum available launch power of expression UE and the transmitting power of Dedicated Physical Control Channel (DPCCH, Dedicated Physical Control Channel), unit is a decibel.
By top explanation, UE mainly passes through dual mode to the solicited message of Node B scheduling, and a kind of is Happy Bit, and another kind is a SI information; Because UE produces the important parameters of Happy Bit: Happy Bit Delay Condition, do not send Node B to, so even Node B knows the SI information of UE, can not determine the demand of UE to scheduling authorization, the SG that distributes to UE when causing dispatching is unreasonable, the SG that may distribute to UE is excessive, cause the waste of resource, also may be too small, cause UE dissatisfied to SG, can adjust by the Happy Bit of back, but extended to the UE request responding time, finally cause the scheduling performance of Node B scheduler to be subjected to certain influence, certain waste can appear in resource simultaneously, and the service delay of UE also has certain increasing.
Summary of the invention
The objective of the invention is to, a kind of dispatching method of Wideband Code Division Multiple Access (WCDMA) access to wireless communication system high speed uplink packet access (HSUPA) business is provided, described method is by estimating the scheduling authorization request of UE accurately, and then improves the scheduling performance of Node B scheduler.
For solving the problems of the technologies described above, the invention provides the distribution method of a kind of UE scheduling authorization request, it is characterized in that: when the HSUPA scheduler of Node B is received the scheduling authorization request of UE, according to the Happy Bit Delay Condition information distribution scheduling authorization among the NodeB, wherein, described Happy BitDelay Condition information is included in the enhancing DPCH of Node B applying portion agreement.
The present invention also provides a kind of method of the HSUPA of raising scheduling performance, and described method comprises:
(1) RNC sends to Node B with Happy Bit Delay Condition parameter;
(2) the SI information that reports according to above-mentioned Happy Bit Delay Condition parameter and UE of the HSUPA scheduler of Node B is determined the dispatch request of UE, and according to dispatch request allocation schedule mandate between UE of determining.
The method according to this invention, described step (2) further comprises following method:
2.1, the E-DCH data that report of Node B demodulation UE, obtain Happy Bit information and SI information;
2.2, the HSUPA scheduler is according to the Happy Bit information and the SI information that demodulate, and RNC disposes the dispatching requirement of determining UE to the Happy Bit Delay Condition of UE;
2.3, Node B is according to the scheduling strategy of HSUPA dispatching algorithm, determines the final scheduling authorization of each UE, sends corresponding dispatching command.
The method according to this invention further comprises following method in step 2.2:
The first step, according to the power excursion of UE power threshold, Dedicated Physical Data Channel, calculate maximum enhancing Dedicated Physical Data Channel power excursion with respect to the power offset information of the Dedicated Physical Control Channel of the power excursion of the special physical controlling channel of upward of telling DSCH Downlink Shared Channel, E-DCH, strengthen the Dedicated Physical Data Channel power excursion according to this and calculate corresponding SG, be designated as SG1;
Second the step, according to the E-TFC and the SG of TEBS, Happy Bit Delay Condition information calculations correspondence, be designated as SG2;
The 3rd SG that goes on foot, gets request is the smaller value of SG1 and SG2.
The method according to this invention further comprises following method in step 2.3:
The first step: can be used for the load of E-DCH according to the RTWP information calculations of the sub-district that measures;
Second step: the priority that data the highest logic channel to be passed is arranged according to UE sorts from high to low to UE;
The 3rd step: travel through all UE, be non-scheduling and the assurance bit rate traffic assignments resource of UE;
The 4th step: the UE of traversal in the formation, according to the SG and the sub-district disposable load allocation schedule mandate of UE request, up to traveled through all UE or sub-district do not have surplus resources to distribute till;
The 5th step: the SG and the original SG that distributes that distribute according to corresponding UE determine the dispatching command that needs send, and send corresponding dispatching command to corresponding UE.
Relative prior art, method provided by the invention has following beneficial effect:
The first, the present invention can estimate the dispatch request of UE accurately.
The second, the present invention can distribute corresponding scheduling authorization according to the dispatch request of the UE of accurate estimation, makes full use of the Radio Resource of system, improves the scheduling performance of scheduler.
The 3rd, the present invention can control the scheduling authorization of UE preferably by estimating the dispatch request of UE accurately, reduces the waste of resource, shortens the response time to UE.
The 4th, the present invention reduces the adjustment frequency to the scheduling authorization of UE by estimating the dispatch request of UE accurately, strengthens the stability of UE speed and the stability of system.
Description of drawings
Fig. 1 is the graph of a relation of RG scheduling and HARQ Process;
Fig. 2 is the structural representation of SI information;
Fig. 3 is the flow chart that calculates the scheduling authorization request of UE;
Fig. 4 is the flow chart that the HSUPA scheduler is determined the dispatching requirement of UE;
Fig. 5 is the flow chart that the HSUPA scheduler is determined the scheduling authorization of UE.
Embodiment
For ease of profound understanding technology contents of the present invention, the present invention is described in detail below in conjunction with drawings and the specific embodiments.
The present invention is by introducing new Happy BitDelay Condition information element (IE in the enhancing DPCH information (E-DCH Infomation) of Node B applying portion (NBAP:Node B Application Part) agreement, Information Element), indicate UE to fill in the employed Happy Bit of Happy Bit field Delay Condition information, for the HSUPA scheduler of Node B calculates the SG request of UE and distributes the SG of UE that reference is provided.The HSUPA scheduler of Node B is by above-mentioned Happy Bit Delay Condition parameter, and the SI information that reports of UE just can be calculated the dispatch request of UE, reasonably allocation schedule mandate between UE then exactly.Wherein, the signaling process that relates to comprises: Radio Link is set up request (RADIO LINK SETUP REQUEST), Radio Link increases request (RADIO LINK ADDITION REQUEST), wireless link reconfigured preparation (RADIO LINK RECONFIGURATION PREPARE), wireless link reconfigured request (RADIO LINKSETUP REQUEST).In follow-up explanation, will be with the wireless link reconfigured concrete scheme process of example explanation that is prepared as, as shown in Figure 3, remaining signaling process and wireless link reconfigured preparation are similar, will not remake repetition.
Fig. 3 is the flow chart that calculates the scheduling authorization request of UE.
Process 1: carry out the process of E-DCH business configuration by the reprovision flow process, as shown in Figure 3, concrete step is as follows:
The first step: service wireless network controller (SRNC, Serving RNC) sends wireless link reconfigured preparation to control radio network controller (CRNC, Controlling RNC);
Second step: CRNC sends wireless link reconfigured preparation to Node B;
Second step: CRNC sends wireless link reconfigured preparation to Node B, and its message format is as shown in table 3:
Table 3
Information Element/Group Name information element/group name claims Presence selects The Range scope Type and Reference reftype The explanation of the Semantics Description meaning of one's words Critica lity critical condition The critical value that Assigned Critical ity is composed
Omit with top ...
E-DPCH Information strengthens DPCH information 0..1 YES is The reject refusal
The maximum Dedicated Physical Data Channel that strengthens of>Maximum Set of E-DPDCHs is gathered M is essential 9.2.2.20 C
>Puncture Limit the restriction of punching M is essential 9.2.1.50
>E-TFCS Information strengthens dedicated channel transport format and merges collection information M is essential 9.2.2.13 Dh
>E-TTI strengthens the Transmission Time Interval of dedicated channel M is essential 9.2.2.13 Di
>E-DPCCH Power Offset strengthens the power excursion of Dedicated Physical Control Channel M is essential 9.2.2.13 Dj
>Happy bit delay condition happy bit time delay condition O is optional 9.#.#.# YES is Ignore ignores
>E-RGCH 2-Index-Step Threshold enhancing dedicated channel relative authorization channel step size is 2 thresholding M is essential 9.2.2.13 Ig
>E-RGCH 3-Index-Step Threshold enhancing dedicated channel relative authorization channel step size is 3 thresholding M is essential 9.2.2.13 Ih
>HARQ Info for E-DCH strengthens the hybrid automatic retransmission request information of dedicated channel M is essential 9.2.2.18 ba
Whether>HS-DSCH Configured Indicator has disposed the high speed descending sharing channel indication M is essential 9.2.2.18 Ca
E-DCH FDD Information strengthens dedicated channel frequency division multiplexing information C-EDPCH Info condition entry-enhancing DPCH information 9.2.2.13 Da YES is The reject refusal
Serving E-DCH RL strengthens dedicated channel service Radio Link O is optional 9.2.2.48 B YES is The reject refusal
Omit with the lower part ...
Wherein in the table 3 be that field in the form at the end is the new Happy Bit Delay Condition field of introducing in the enhancing DPCH information of Node B applying portion agreement with the grey, be used to refer to UE and fill in the employed Hppy Bit of Happy Bit field Delay Condition information, for the HSUPA scheduler of NodeB calculates the SG request of UE and distributes the SG of UE that reference is provided.
The position of this Happy Bit Delay Condition field is not limited to as shown in table 3.The concrete definition of IE " Happybit delay condition " is as shown in table 4:
Table 4
Information Element/Group Name information element/group name claims Presence selects The Range scope Type and Reference reftype The explanation of the Semantics Description meaning of one's words
Happy bit delay condition happy bit time delay condition Enumerated (2ms, 10ms, 20ms, 50ms, 100ms, 200ms, 500ms, 1000ms) enumerate (2 milliseconds, 10 milliseconds, 20 milliseconds, 50 milliseconds, 100 milliseconds, 200 milliseconds, 500 milliseconds, 1000 milliseconds)
The 3rd step: Node B sends wireless link reconfigured finishing to CRNC;
The 4th step: CRNC sends wireless link reconfigured finishing to SRNC;
The 5th step: SRNC sends wireless link reconfigured submission to CRNC;
The 6th step: CRNC sends wireless link reconfigured submission to Node B;
The 7th step: SRNC sends the radio bearer reprovision to UE;
The 8th step: UE sends the radio bearer reprovision to SRNC and finishes.
The E-DCH data that process 2:Node B demodulation UE reports are obtained Happy Bit information and SI information.
Happy Bit information and SI information that the HSUPA scheduler of process 3:Node B reports according to the UE that demodulates, and RNC disposes the dispatching requirement of determining UE to the Happy Bit Delay Condition of this UE, as shown in Figure 4, concrete steps are as follows:
The first step: according to the power excursion (PO of UPH, Dedicated Physical Data Channel d), with respect to the power excursion (PO of the special physical controlling channel of upward of telling DSCH Downlink Shared Channel Hs), the power excursion (PO of the Dedicated Physical Control Channel of E-DCH Ec) etc. the POed of information calculations maximum, computing formula is as follows:
PO ed=PO all-PO d-PO hs-PO ec
PO wherein AllFor UPH is converted into linear power than value afterwards;
According to PO EdAnd PO EdSearch corresponding SG with the mapping table of SG, be designated as SG1;
Second step: E-TFC and SG according to information calculations correspondences such as TEBS, Happy Bit Delay Condition are designated as SG2;
Table look-up according to the TEBS index value and to obtain corresponding TEBS value, be designated as BuffSize;
Calculating according to the number of the E-DCH TTI of configuration and the HARQ Process of activation will be in the data block size of single TTI of Happy BitDelay Condition millisecond end of transmission needs, and computing formula is as follows:
TB Size=(BuffSize*HP act)/(HBDC*TTI*HP all)
Wherein: TB SizeBe the transmission block size that single TTI need transmit, HP ActBe the number of the HARQProcess that activates, HP AllNumber for all HARQ Process;
According to TB SizeSearch corresponding E-TFC, the value of E-TFC is that the transmission block size of all E-TFC correspondences is more than or equal to TB SizeMinimum value;
E-TFC and PO according to the RNC configuration EdCorresponding relation search corresponding SG, be designated as SG2;
The 3rd step: the SG that gets request is the smaller value of SG1 and SG2.
Process 4: according to the up available noise lifting resource of sub-district, the processing resource that Node B can use, the dispatch request of all UE, the information such as priority of UE, scheduling strategy in conjunction with the HSUPA dispatching algorithm of Node B carries out resource allocation between UE, determine the final scheduling authorization of each UE, send corresponding dispatching command, as shown in Figure 5, concrete steps are as follows:
The first step: can be used for the load of E-DCH according to the information calculations such as RTWP of the sub-district that measures, be designated as Load E-DCH
Second step: the priority that data the highest logic channel to be passed is arranged according to UE sorts from high to low to UE;
The 3rd step: travel through all UE,, upgrade remaining Load for non-scheduling (Non-Schedule) and assurance bit rate (GBR, Grant Bit Rate) the traffic assignments resource of UE E-DCH
The 4th step: the UE of traversal in the formation, according to the SG and the sub-district disposable load allocation schedule mandate of UE request, up to traveled through all UE or sub-district do not have surplus resources to distribute till;
The 5th step: the SG and the original SG that distributes that distribute according to corresponding UE determine the dispatching command that needs send, and send corresponding dispatching command to corresponding UE;
If can adjust scheduling authorization with RG, then preferentially use E-RGCH to adjust, otherwise, use E-AGCH to adjust.
By method of the present invention, RNC is transmitting Happy Bit Delay Condition parameter in the UE, also pass to Node B, the SI information that the HSUPA scheduler of Node B reports by this parameter and UE is calculated the dispatch request of UE accurately, then reasonably allocation schedule mandate between UE.When Node B receives the SI information that UE reports, can calculate the dispatching requirement of UE like this according to Buffer state, available horsepower and the Happy Bit Delay Condition of the UE in the SI information, between UE, distribute rational scheduling authorization.
Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.

Claims (5)

1, the distribution method of a kind of UE scheduling authorization request, it is characterized in that: when the HSUPA scheduler of Node B is received the scheduling authorization request of UE, according to the Happy Bit DelayCondition information distribution scheduling authorization among the Node B, wherein, described Happy Bit Delay Condition information is included in the enhancing DPCH of Node B applying portion agreement.
2, a kind of method that improves the HSUPA scheduling performance, described method comprises:
(1) RNC sends to Node B with Happy Bit Delay Condition parameter;
(2) the SI information that reports according to above-mentioned Happy Bit Delay Condition parameter and UE of the HSUPA scheduler of Node B is determined the dispatch request of UE, and according to dispatch request allocation schedule mandate between UE of determining.
3, method as claimed in claim 2 is characterized in that: described step (2) further comprises following method:
2.1, the E-DCH data that report of Node B demodulation UE, obtain Happy Bit information and SI information;
2.2, the HSUPA scheduler is according to the Happy Bit information and the SI information that demodulate, and RNC disposes the dispatching requirement of determining UE to the Happy Bit Delay Condition of UE;
2.3, Node B is according to the scheduling strategy of HSUPA dispatching algorithm, determines the final scheduling authorization of each UE, sends corresponding dispatching command.
4, method as claimed in claim 3 is characterized in that: further comprise following method in step 2.2:
The first step, calculate the power excursion of maximum enhancing Dedicated Physical Data Channel according to the power excursion of UE power threshold, Dedicated Physical Data Channel, with respect to the power offset information of the Dedicated Physical Control Channel of the power excursion of the special physical controlling channel of upward of telling DSCH Downlink Shared Channel, E-DCH, calculate corresponding SG according to this POed, be designated as SG1;
Second the step, according to the E-TFC and the SG of TEBS, Happy Bit Delay Condition information calculations correspondence, be designated as SG2;
The 3rd SG that goes on foot, gets request is the smaller value of SG1 and SG2.
5, method as claimed in claim 3 is characterized in that: further comprise following method in step 2.3:
The first step: can be used for the load of E-DCH according to the RTWP information calculations of the sub-district that measures;
Second step: the priority that data the highest logic channel to be passed is arranged according to UE sorts from high to low to UE;
The 3rd step: travel through all UE, be non-scheduling and the assurance bit rate traffic assignments resource of UE;
The 4th step: the UE of traversal in the formation, according to the SG and the sub-district disposable load allocation schedule mandate of UE request, up to traveled through all UE or sub-district do not have surplus resources to distribute till;
The 5th step: the SG and the original SG that distributes that distribute according to corresponding UE determine the dispatching command that needs send, and send corresponding dispatching command to corresponding UE.
CNB2007100735614A 2007-03-13 2007-03-13 UE scheduled authorization request assignment and HSUPA scheduling performance improving method Expired - Fee Related CN100486375C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2007100735614A CN100486375C (en) 2007-03-13 2007-03-13 UE scheduled authorization request assignment and HSUPA scheduling performance improving method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2007100735614A CN100486375C (en) 2007-03-13 2007-03-13 UE scheduled authorization request assignment and HSUPA scheduling performance improving method

Publications (2)

Publication Number Publication Date
CN101026799A true CN101026799A (en) 2007-08-29
CN100486375C CN100486375C (en) 2009-05-06

Family

ID=38744619

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2007100735614A Expired - Fee Related CN100486375C (en) 2007-03-13 2007-03-13 UE scheduled authorization request assignment and HSUPA scheduling performance improving method

Country Status (1)

Country Link
CN (1) CN100486375C (en)

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101166152B (en) * 2007-09-30 2010-06-09 上海华为技术有限公司 A method and device for scheduling E-DCH non-service link
WO2011000320A1 (en) * 2009-07-01 2011-01-06 华为技术有限公司 Method and communication device for assigning scheduling grant
WO2011020318A1 (en) * 2009-08-17 2011-02-24 中兴通讯股份有限公司 Method and terminal for setting a happy bit on an uplink enhanced control channel
CN102098743A (en) * 2009-12-15 2011-06-15 中兴通讯股份有限公司 E-DCH (Enhanced Dedicated Channel) scheduling optimization method and wireless access network node
CN101668346B (en) * 2008-09-05 2011-07-06 华为终端有限公司 Method and device for determining value of satisfaction bit
CN102123512A (en) * 2010-01-08 2011-07-13 捷讯研究有限公司 Method and apparatus for logical channel prioritization for uplink carrier aggregation
CN101299887B (en) * 2008-06-19 2011-08-24 中兴通讯股份有限公司 Method for scheduling customer equipment load
CN101741707B (en) * 2008-11-04 2012-04-04 上海华为技术有限公司 Uplink data transmission method, device and communication system
CN102415198A (en) * 2009-04-24 2012-04-11 瑞典爱立信有限公司 Method and apparatus for performing uplink transmission in wireless communication system
CN102457953A (en) * 2010-10-22 2012-05-16 中兴通讯股份有限公司 Indication method, system and terminal for multi-carrier HSUPA power limitation
CN102651912A (en) * 2012-03-15 2012-08-29 华为技术有限公司 Transmission method of scheduling information, equipment and communication system
CN101969664B (en) * 2009-07-28 2013-01-23 华为技术有限公司 Scheduling authorization processing method and device
CN103167622A (en) * 2011-12-15 2013-06-19 展讯通信(上海)有限公司 Scheduling authorized method, device and network equipment
CN101511129B (en) * 2008-02-13 2013-06-26 株式会社Ntt都科摩 Mobile communication method, mobile communication system and radio base station
CN103250369A (en) * 2010-12-01 2013-08-14 高通股份有限公司 Determining an uplink control path with blind decoding
CN103813466A (en) * 2012-11-02 2014-05-21 瑞萨移动公司 Method and apparatus for obtaining reliable e-dch reception for transmission of scheduling information
CN103999528A (en) * 2011-09-30 2014-08-20 交互数字专利控股公司 Device communication using a reduced channel bandwidth
WO2015139360A1 (en) * 2014-03-17 2015-09-24 华为技术有限公司 Ue, network side device, power adjustment method, and sg determination method
CN105071907A (en) * 2009-12-24 2015-11-18 三星电子株式会社 Method and apparatus for defining transceiving timing of a physical channel in a TDD communication system which supports cross-carrier scheduling
CN105493418A (en) * 2013-09-17 2016-04-13 英特尔Ip公司 Techniques and configurations associated with machine type communication in enhanced coverage mode
CN107852428A (en) * 2015-08-07 2018-03-27 萨托里环球有限责任公司 Expansible real-time Message Passing system
CN108292987A (en) * 2015-12-14 2018-07-17 苹果公司 Link estimation and power in VOLTE based on ROHC are saved
US10420066B2 (en) 2012-09-26 2019-09-17 Interdigital Patent Holdings, Inc. Methods, systems and apparatuses for operation in long-term evolution systems

Cited By (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101166152B (en) * 2007-09-30 2010-06-09 上海华为技术有限公司 A method and device for scheduling E-DCH non-service link
CN101511129B (en) * 2008-02-13 2013-06-26 株式会社Ntt都科摩 Mobile communication method, mobile communication system and radio base station
CN101299887B (en) * 2008-06-19 2011-08-24 中兴通讯股份有限公司 Method for scheduling customer equipment load
CN101668346B (en) * 2008-09-05 2011-07-06 华为终端有限公司 Method and device for determining value of satisfaction bit
CN101741707B (en) * 2008-11-04 2012-04-04 上海华为技术有限公司 Uplink data transmission method, device and communication system
CN102415198B (en) * 2009-04-24 2015-02-04 瑞典爱立信有限公司 Method and apparatus for performing uplink transmission in wireless communication system
CN102415198A (en) * 2009-04-24 2012-04-11 瑞典爱立信有限公司 Method and apparatus for performing uplink transmission in wireless communication system
CN101938786B (en) * 2009-07-01 2013-03-20 华为技术有限公司 Scheduling authority allocating method and communication device
WO2011000320A1 (en) * 2009-07-01 2011-01-06 华为技术有限公司 Method and communication device for assigning scheduling grant
US8908622B2 (en) 2009-07-01 2014-12-09 Huawei Technologies Co., Ltd. Method and communication device for assigning scheduling grant
CN101969664B (en) * 2009-07-28 2013-01-23 华为技术有限公司 Scheduling authorization processing method and device
US8837351B2 (en) 2009-08-17 2014-09-16 Zte Corporation Method and UE for setting a happy bit on an uplink E-DPCCH
WO2011020318A1 (en) * 2009-08-17 2011-02-24 中兴通讯股份有限公司 Method and terminal for setting a happy bit on an uplink enhanced control channel
CN102098743A (en) * 2009-12-15 2011-06-15 中兴通讯股份有限公司 E-DCH (Enhanced Dedicated Channel) scheduling optimization method and wireless access network node
CN105071907A (en) * 2009-12-24 2015-11-18 三星电子株式会社 Method and apparatus for defining transceiving timing of a physical channel in a TDD communication system which supports cross-carrier scheduling
CN102123512A (en) * 2010-01-08 2011-07-13 捷讯研究有限公司 Method and apparatus for logical channel prioritization for uplink carrier aggregation
CN102457953A (en) * 2010-10-22 2012-05-16 中兴通讯股份有限公司 Indication method, system and terminal for multi-carrier HSUPA power limitation
CN102457953B (en) * 2010-10-22 2015-08-12 中兴通讯股份有限公司 A kind of indicating means of multi-carrier HSUPA power limited, system and terminal
CN103250369B (en) * 2010-12-01 2017-04-12 高通股份有限公司 Determining an uplink control path with blind decoding
CN103250369A (en) * 2010-12-01 2013-08-14 高通股份有限公司 Determining an uplink control path with blind decoding
CN103999528A (en) * 2011-09-30 2014-08-20 交互数字专利控股公司 Device communication using a reduced channel bandwidth
US11582750B2 (en) 2011-09-30 2023-02-14 Interdigital Patent Holdings, Inc. Device communication using a reduced channel bandwidth
US10111224B2 (en) 2011-09-30 2018-10-23 Interdigital Patent Holdings, Inc. Device communication using a reduced channel bandwidth
US12120653B2 (en) 2011-09-30 2024-10-15 Interdigital Patent Holdings, Inc. Device communication using a reduced channel bandwidth
CN103999528B (en) * 2011-09-30 2018-08-07 交互数字专利控股公司 It is communicated using the equipment of the channel width of reduction
CN103167622A (en) * 2011-12-15 2013-06-19 展讯通信(上海)有限公司 Scheduling authorized method, device and network equipment
CN103167622B (en) * 2011-12-15 2016-04-06 展讯通信(上海)有限公司 Scheduling authorization method and device, the network equipment
CN102651912A (en) * 2012-03-15 2012-08-29 华为技术有限公司 Transmission method of scheduling information, equipment and communication system
WO2013135148A1 (en) * 2012-03-15 2013-09-19 华为技术有限公司 Scheduling information transmission method, device and communications system
CN102651912B (en) * 2012-03-15 2015-02-04 华为技术有限公司 Transmission method of scheduling information, equipment and communication system
US11076380B2 (en) 2012-09-26 2021-07-27 Interdigital Patent Holdings, Inc. Methods, systems and apparatuses for operation in long-term evolution (LTE) systems
US10420066B2 (en) 2012-09-26 2019-09-17 Interdigital Patent Holdings, Inc. Methods, systems and apparatuses for operation in long-term evolution systems
CN103813466A (en) * 2012-11-02 2014-05-21 瑞萨移动公司 Method and apparatus for obtaining reliable e-dch reception for transmission of scheduling information
CN103813466B (en) * 2012-11-02 2019-05-14 安华高科技股份有限公司 For obtaining the received method and apparatus of reliable E-DCH for being directed to transmitting scheduling information
CN105493418A (en) * 2013-09-17 2016-04-13 英特尔Ip公司 Techniques and configurations associated with machine type communication in enhanced coverage mode
US10142064B2 (en) 2013-09-17 2018-11-27 Intel IP Corporation Techniques and configurations associated with machine type communication in enhanced coverage mode
CN105493418B (en) * 2013-09-17 2019-06-14 英特尔Ip公司 Equipment associated with the machine type communication in enhancing covering pattern
WO2015139360A1 (en) * 2014-03-17 2015-09-24 华为技术有限公司 Ue, network side device, power adjustment method, and sg determination method
CN107852428A (en) * 2015-08-07 2018-03-27 萨托里环球有限责任公司 Expansible real-time Message Passing system
CN108292987B (en) * 2015-12-14 2021-02-12 苹果公司 ROHC-based link estimation and power saving in VOLTE
CN108292987A (en) * 2015-12-14 2018-07-17 苹果公司 Link estimation and power in VOLTE based on ROHC are saved

Also Published As

Publication number Publication date
CN100486375C (en) 2009-05-06

Similar Documents

Publication Publication Date Title
CN100486375C (en) UE scheduled authorization request assignment and HSUPA scheduling performance improving method
CN101420744B (en) Radio communication system, radio communication method, base station and radio terminal
CN100512565C (en) Method for enhancing wireless communication up-grouping dispatch
JP5039593B2 (en) Wireless communication system, wireless communication method, and base station
CN101053275B (en) A system, arrangements and method allowing for balancing of load between two groups of dedicated uplink channels
CN101273568A (en) Mobile station, fixed station, communication system and communication method
EP1900146B1 (en) Resource allocation method, communication system, network element, module, computer program product and computer program distribution medium
CN102132616B (en) Base station, radio communication system, radio communication method
CN101409913B (en) Radio communication system, radio communication method and base station
CN101404790B (en) radio communication system, radio communication method and base station
EP2317817B1 (en) Base station, upper node, radio communication system and radio communication method
CN101516138B (en) Radio communication system, radio communication method, and base station
CN101453787B (en) Radio communication system, radio communication method and base station
CN100531442C (en) Method for enhancing wireless communication up-link service quality
CN101409924B (en) Radio communication system, radio communication method and base station
CN101222671A (en) Method, system and equipment for confirming inceptive service authorization value

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090506

Termination date: 20180313

CF01 Termination of patent right due to non-payment of annual fee