Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and device for determining scheduling strategy

A scheduling strategy and determination method technology, applied in the field of communication, can solve the problems of judging, unable to complete UE status, etc., and achieve the effect of balancing differences and reducing interference

Inactive Publication Date: 2010-12-22
ZTE CORP
View PDF1 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] According to the current specification for making scheduling decisions based on single-valued Happy bits, the Node B will not be able to complete the judgment of the UE status and make reasonable scheduling decisions. Therefore, the main purpose of the present invention is to provide a Deterministic scheme of scheduling strategy to solve the above problems

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for determining scheduling strategy
  • Method and device for determining scheduling strategy
  • Method and device for determining scheduling strategy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] This embodiment provides a Node B scheduling decision-making solution with simple logical meaning and convenient implementation, including the following steps 110 to 120:

[0052] Step 110: For each E-DCH data transmission, Node B will receive from the same UE, extract Happy bits from the E-DPCCH corresponding to the primary / secondary carrier, and combine the Happy bit value set {HB1, HB2}.

[0053] Step 120: If the received happy bit value set is {0, 0}, it is considered that the power of both the primary and secondary carriers is increased; if the received happy bit value set is {0, 1}, it is considered that the allocated power is not increased ; If the received happy bit value set is {1, 0}, it is considered that the allocated power will not be increased; if the received happy bit value set is {1, 1}, it is considered that neither the main carrier nor the auxiliary carrier needs to increase the power (Specifically as shown in Table 1 below).

[0054] Table 1 Schedul...

Embodiment 2

[0058] This embodiment provides a Node B scheduling decision-making solution with simple logical meaning and convenient implementation, including the following steps 210 to 220:

[0059] Step 210: For each E-DCH data transmission, Node B will receive data from the same UE, extract Happy bits from the E-DPCCH corresponding to the primary / secondary carrier, and combine the Happy bit value set {HB1, HB2}.

[0060] Step 220: If the set of happy bit values ​​received is {0, 0}, it is considered that the power of both the primary and secondary carriers is increased; if the set of happy bit values ​​received is {0, 1}, the allocated power is increased, and the main carrier / Secondary carrier equal priority; if the received Happy bit value set is {1, 0}, then increase the allocated power, the main / secondary carrier equal priority; if the received Happy bit value set is {1, 1}, then It is considered that neither the main carrier nor the auxiliary carrier needs to increase power (specif...

Embodiment 3

[0064] This embodiment provides a Node B scheduling decision-making scheme that comprehensively considers the power difference between primary and secondary carriers, including the following steps 310 to 320:

[0065] Step 310: For each E-DCH data transmission, the Node B will receive the happy bits from the E-DPCCH corresponding to the primary / secondary carrier respectively from the same UE, and combine the happy bit value set {HB1, HB2}.

[0066] Step 320: If the received happy bit value set is {0, 0}, it is considered that the power of both the primary and secondary carriers is increased; if the received happy bit value set is {0, 1}, it is considered that the allocated power can be increased , the current power of the auxiliary carrier is low; if the received happy bit value set is {1, 0}, it is considered that the allocated power can be increased, and the current power of the main carrier is low; if the received happy bit value set is {1, 0}, 1}, it is considered that nei...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method and a device for determining a scheduling strategy. The method comprises the following steps of: receiving, by a node B, an enjoyment bit value reported by user equipment (UE) on an enhanced dedicated channel special physical control channel (E-DPCCH) corresponding to a main / auxiliary carrier wave and combining the enjoyment bit value into an enjoyment bit value set {A, B}; determining the scheduling strategy according to the enjoyment bit value set {A, B} by the node B, wherein if {A, B} is {0, 0}, scheduling the main carrier wave and the auxiliary carrier wave to respectively increase a distributed power; if {A, B} is {1, 1}, scheduling the main carrier wave and the auxiliary carrier wave not to increase the distributed power; and if {A, B} is {0, 1} or {1, 0}, scheduling the main carrier wave and / or the auxiliary carrier wave to increase or not to increase the distributed power. The invention ensures that the scheduling requirements of the UE on downlink conferment can be satisfied, simultaneously balances the difference between the main carrier wave and the auxiliary carrier wave and decreases the interference.

Description

technical field [0001] The present invention relates to the communication field, in particular to a method and a device for determining a scheduling policy by a Node B according to a happy bit reported by a user equipment. Background technique [0002] In the 3rd Generation Partnership Project (3rdGeneration Partnership Project, referred to as 3GPP), the dedicated transmission channel for uplink enhancement has been standardized, and the technology is called high-speed uplink packet access high-speed uplink Packet Access (High Speed ​​Uplink Packet Access, HSUPA for short). The HSUPA function is introduced, and its main enhanced function is to define a new transmission channel called Enhanced Dedicated Channel (E-DCH for short). Five new physical channels are introduced in the definition of E-DCH, among which, E-DCH Dedicated Physical Control Channel (E-DPCCH for short) and E-DCH Dedicated Physical Data Channel (E-DCH Dedicated Physical Data Channel, E-DPDCH for short) are ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04W28/00H04W72/04
Inventor 张瑜程翔贺美芳
Owner ZTE CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com