CN107920390A - Uplink logic channel dispatching method, device and user equipment - Google Patents

Uplink logic channel dispatching method, device and user equipment Download PDF

Info

Publication number
CN107920390A
CN107920390A CN201610885534.6A CN201610885534A CN107920390A CN 107920390 A CN107920390 A CN 107920390A CN 201610885534 A CN201610885534 A CN 201610885534A CN 107920390 A CN107920390 A CN 107920390A
Authority
CN
China
Prior art keywords
scheduling
tti
data volume
logic channel
ascending resource
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
CN201610885534.6A
Other languages
Chinese (zh)
Other versions
CN107920390B (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.)
Spreadtrum Communications Shanghai Co Ltd
Original Assignee
Spreadtrum Communications Shanghai Co Ltd
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 Spreadtrum Communications Shanghai Co Ltd filed Critical Spreadtrum Communications Shanghai Co Ltd
Priority to CN201610885534.6A priority Critical patent/CN107920390B/en
Publication of CN107920390A publication Critical patent/CN107920390A/en
Application granted granted Critical
Publication of CN107920390B publication Critical patent/CN107920390B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/53Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1268Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/23Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention provides a kind of uplink logic channel dispatching method, device and user equipment.The described method includes:The DCI sent according to base station calculates the duration of this scheduling;The corresponding ascending resources that can be used to transmit data of each TTI are determined according to the UL grant that base station is sent;The guarantee data volume dispatched according to each logic channel of the duration that this is dispatched calculating at this;The logically order of channel priority from high to low, it is followed successively by the ascending resource needed for the guarantee data volume described in each logical channel assignment in this scheduling, if still having remaining ascending resource after the ascending resource needed for the guarantee data volume described in each logical channel assignment in this scheduling, then the order successively decreased by priority of logical channels is followed successively by each logic channel and distributes remaining ascending resource to greatest extent.Multiple TTI of same logic channel can be ensured that data volume is concentrated in same TTI and sent by the present invention, reduce the quantity of the MAC SDU of generation, so as to reduce the header overhead of MAC PDU groups bag.

Description

Uplink logic channel dispatching method, device and user equipment
Technical field
The present invention relates to wireless communication technology field, more particularly to a kind of uplink logic channel dispatching method, device and use Family equipment.
Background technology
In LTE (Long Term Evolution, Long Term Evolution), on UE (User Equipment, user equipment) is Uplink authorization (UL grant) and ascending resource are distributed in the transmitting terminal of row data transfer, base station for UE, determine what UE can be sent Total upstream data amount.The uplink data scheduling of each logic channel is completed by UE in UE, and each logic channel configuration is corresponding Absolute priority, ascending resource are preferentially used for sending the data of the logic channel of high priority, while in order to avoid low priority Logic channel cannot be dispatched for a long time, and each logic channel is configured with PBR (Prioritized Bit Rate, Prioritized Bit Speed), it is B to define the data volume that logic channel j ensures to sendj, then each TTI (Transmission Time Interval, Transmission Time Interval), BjIncrementss Δj=PBR × TTI.
UE divides two-wheeled to carry out when some TTI carries out logic channel scheduling.The first round first according to priority of logical channels from High to Low order is each channel distribution ascending resource, and size is the guarantee data volume B of the channeljIf (it can send Data volume is less than Bj, then by actual transmissible data volume distribution resource).It is each to being serviced in first round distribution resource Logic channel, corresponding BjNeed to subtract the size of the corresponding MAC SDU of the logic channel.Provided after the completion of the first round if also had Source residue then carries out the second wheel, successively decreases order-assigned surplus resources by priority of logical channels, will remaining Radio Resource it is maximum The channel for distributing to highest priority of limit, if also resources left, distributes to the high channel of preferential level, Zhi Daozi Source uses until exhausted.
In the implementation of the present invention, inventor has found at least to have the following technical problems in the prior art:
(Media Access Control Protocol Data Unit, media connect the next a MAC PDU of ordinary circumstance Enter control protocol data cell) include multiple MAC SDU (Media Access Control Service Data Unit, matchmaker Body access control service data unit), each MAC SDU correspond to 1 MAC subheader (at least 1 byte), in RLC The UM (Unacknowledged Mode, affirmation mode) and AM of (Radio Link Control, wireless spread-spectrum technology) Under (Acknowledged Mode, affirmation mode) configuration, each MAC SDU also correspond to 1 RLC header (at least 1 byte), If MAC SDU numbers are more, it will have larger header overhead.
3GPP LTE R14 introduce enhanced LAA, and (license-assisted access, authorize frequency spectrum auxiliary to connect Enter) characteristic, DCI (the Downlink Control for supporting eNB (Evolved NodeB, evolved base station) to pass through a subframe Information, descending control signaling) while dispatch PUSCH (the Physical Uplink Shared of multiple continuous subframes Channel, Physical Uplink Shared Channel) send.In this case, if still dispatched using existing uplink logic channel Method, it will have unnecessary header overhead.
The content of the invention
Uplink logic channel dispatching method, device and user equipment provided by the invention, can be by same logic channel Multiple TTI's ensures that data volume is concentrated in same TTI and sends, and the quantity of the MAC SDU of generation is reduced, so as to reduce MAC The header overhead of PDU groups bag.
In a first aspect, the present invention provides a kind of uplink logic channel dispatching method, including:
The DCI sent according to base station calculates the duration of this scheduling;
The corresponding ascending resources that can be used to transmit data of each TTI are determined according to the UL grant that base station is sent;
The guarantee data volume dispatched according to each logic channel of the duration that this is dispatched calculating at this;
The logically order of channel priority from high to low, is followed successively by described in each logical channel assignment in this scheduling Guarantee data volume needed for ascending resource, if described in each logical channel assignment this scheduling guarantee data volume institute Still there is remaining ascending resource after the ascending resource needed, then the order successively decreased by priority of logical channels is followed successively by each logic letter Road distributes remaining ascending resource to greatest extent.
Alternatively, the duration that the DCI sent according to base station calculates this scheduling includes:According to equation below meter Calculate the duration of this scheduling:Duration duration=TTI × n of this scheduling;Wherein, n is this uplink scheduling The number of the continuous T TI of UE, and n≤1.
Alternatively, the duration that this is dispatched described in the basis calculates the guarantee that each logic channel is dispatched at this Data volume includes:The guarantee data volume dispatched according to each logic channel of equation below calculating at this:Logic channel j is at this The guarantee data volume A of schedulingj=initial Bj+PBR×duration;Wherein, j represents logic channel, j≤1 and the bigger expressions pair of j The priority of logical channels answered is lower;Each logic channel j corresponds to a variable Bj, when logic channel is established, BjIt is initialized as 0;BjIn each TTI using PBR × TTI as step-length increase.
Alternatively, the order of the logically channel priority from high to low, is followed successively by each logical channel assignment institute Stating the ascending resource needed for the guarantee data volume in this scheduling includes:This scheduling is carried out after currently the resource allocation of TTI is complete In the range of next TTI ascending resource distribution, until guarantee data volume dispatch for all logic channels at this is distributed The corresponding ascending resources that can be used to transmit data of all TTI to ascending resource or this scheduling distribute;For epicycle The logic channel serviced in resource allocation, corresponding AjNeed to subtract the size of the corresponding MAC SDU of the logic channel, and By the A after reductionjInitial B as next TTI after this finishing schedulingj
Alternatively, the uplink needed for the guarantee data volume if described in each logical channel assignment in this scheduling Still have remaining ascending resource after resource, then the order successively decreased by priority of logical channels for each logic channel to greatest extent Distributing remaining ascending resource includes:The uplink of next TTI in the range of this scheduling is carried out after currently the resource allocation of TTI is complete The distribution of resource, until the corresponding ascending resources that can be used to transmit data of all TTI of this scheduling distribute or each The data sending of logic channel is complete.
Alternatively, if be higher than most in the data volume that this corresponding ascending resource of first TTI dispatched can transmit The guarantee data volume A that the logic channel of high priority is dispatched at this1, then the remaining ascending resource of first TTI is distributed to The logic channel of secondary high priority, until the corresponding ascending resources of first TTI distribute.
Alternatively, if be less than most in the data volume that this corresponding ascending resource of first TTI dispatched can transmit The guarantee data volume A that the logic channel of high priority is dispatched at this1, then it is preferably limit priority logic in second TTI The remaining ascending resource ensured needed for data volume of this scheduling of channel distribution, is again then the logic channel point of time high priority Guarantee data volume A with this scheduling2Required ascending resource.
Second aspect, the present invention provide a kind of uplink logic channel dispatching device, including:
First computing unit, the DCI for being sent according to base station calculate the duration of this scheduling;
Determination unit, the UL grant for being sent according to base station determine that each TTI is corresponding and can be used to transmit data Ascending resource;
Second computing unit, is dispatched for calculating each logic channel according to the duration of this scheduling at this Guarantee data volume;
Scheduling unit, for the order of logically channel priority from high to low, is followed successively by each logical channel assignment Ascending resource needed for the guarantee data volume in this scheduling, is dispatched if described in each logical channel assignment at this Guarantee data volume needed for ascending resource after still have remaining ascending resource, then by the order that priority of logical channels is successively decreased according to It is secondary to distribute remaining ascending resource to greatest extent for each logic channel.
Alternatively, first computing unit, for calculating the duration of this scheduling according to equation below:This is adjusted Duration duration=TTI × n of degree;Wherein, n is the number of the continuous T TI of this uplink scheduling UE, and n≤1.
Alternatively, second computing unit, for calculating what each logic channel was dispatched at this according to equation below Ensure data volume:The guarantee data volume A that logic channel j is dispatched at thisj=initial Bj+PBR×duration;Wherein, j is represented Logic channel, j≤1 and j is bigger represents that corresponding priority of logical channels is lower;Each logic channel j corresponds to a variable Bj, When logic channel is established, BjIt is initialized as 0;BjIn each TTI using PBR × TTI as step-length increase.
Alternatively, the scheduling unit, for for described in each logical channel assignment this scheduling guarantee data volume After required ascending resource, for the logic channel serviced in epicycle resource allocation, corresponding AjNeed to subtract the logic The size of the corresponding MAC SDU of channel, and by the A after reductionjInitial B as next TTI after this finishing schedulingj
Alternatively, the scheduling unit, carries out next in the range of this scheduling after resource allocation for current TTI is complete The distribution of the ascending resource of TTI, until the corresponding ascending resources that can be used to transmit data of all TTI of this scheduling distribute Or the data sending of each logic channel is complete.
Alternatively, the scheduling unit, if can be passed for the corresponding ascending resources of first TTI dispatched at this Defeated data volume is higher than the guarantee data volume A that the logic channel of limit priority is dispatched at this1When, by the surplus of first TTI Remaining ascending resource distributes to the logic channel of time high priority, until the corresponding ascending resources of first TTI distribute.
Alternatively, the scheduling unit, if can be passed for the corresponding ascending resources of first TTI dispatched at this Defeated data volume is less than the guarantee data volume A that the logic channel of limit priority is dispatched at this1When, it is preferential in second TTI Distribute this scheduling the remaining ascending resource ensured needed for data volume for highest priority logical channel, be again then time Gao You The guarantee data volume A of this scheduling of the logical channel assignment of first level2Required ascending resource.
The third aspect, the present invention provide a kind of user equipment, and the user equipment is dispatched including above-mentioned uplink logic channel Device.
Uplink logic channel dispatching method, device and user equipment provided in an embodiment of the present invention, send according to base station DCI calculates the duration of this scheduling, and the UL grant sent according to base station determine that each TTI is corresponding and can be used to transmit number According to ascending resource, the guarantee data that each logic channel dispatches at this are calculated according to the duration that this is dispatched Amount, logically the order of channel priority from high to low, is followed successively by described in each logical channel assignment in the guarantor of this scheduling The ascending resource needed for data volume is demonstrate,proved, if needed for the guarantee data volume described in each logical channel assignment in this scheduling Still there is remaining ascending resource after ascending resource, then the order successively decreased by priority of logical channels is followed successively by each logic channel most Distribute to limits remaining ascending resource.Compared with prior art, the present invention can be by multiple TTI's of same logic channel Ensure that data volume is concentrated in same TTI to send, reduce the quantity of the MAC SDU of generation, so as to reduce MAC PDU groups bag Header overhead.
Brief description of the drawings
Fig. 1 is the flow chart of one embodiment of the invention uplink logic channel dispatching method;
Fig. 2 is the schematic diagram of the MAC PDU of prior art generation;
Fig. 3 is the schematic diagram of the MAC PDU of another embodiment of the present invention generation;
Fig. 4 is the structure diagram of one embodiment of the invention uplink logic channel dispatching device.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention In attached drawing, the technical solution in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only Only it is part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill Personnel's all other embodiments obtained without making creative work, belong to the scope of protection of the invention.
The present invention provides a kind of uplink logic channel dispatching method, as shown in Figure 1, the described method includes:
S11, the DCI sent according to base station calculate the duration of this scheduling;
S12, the UL grant sent according to base station determine the corresponding ascending resources that can be used to transmit data of each TTI;
S13, calculate the guarantee data volume that each logic channel is dispatched at this according to the duration of this scheduling;
The order of S14, logically channel priority from high to low, is followed successively by described in each logical channel assignment at this Ascending resource needed for the guarantee data volume of scheduling, if described in each logical channel assignment this scheduling guarantee data Still there is remaining ascending resource after ascending resource needed for amount, then the order successively decreased by priority of logical channels is followed successively by each patrol Collect channel and distribute remaining ascending resource to greatest extent.
Uplink logic channel dispatching method provided in an embodiment of the present invention, this scheduling is calculated according to the DCI that base station is sent Duration, according to base station send UL grant determine the corresponding ascending resources that can be used to transmit data of each TTI, root The guarantee data volume dispatched according to each logic channel of duration calculating of this scheduling at this, logically channel is excellent The order of first level from high to low, is followed successively by the uplink needed for the guarantee data volume described in each logical channel assignment in this scheduling Resource, if described in each logical channel assignment this scheduling guarantee data volume needed for ascending resource after still have residue Ascending resource, then the order successively decreased by priority of logical channels be followed successively by each logic channel distribute to greatest extent it is remaining Ascending resource.Compared with prior art, multiple TTI of same logic channel can be ensured that data volume concentrates on together by the present invention Sent in one TTI, reduce the quantity of the MAC SDU of generation, so as to reduce the header overhead of MAC PDU groups bag.
Alternatively, the duration that the DCI sent according to base station calculates this scheduling includes:According to equation below meter Calculate the duration of this scheduling:Duration duration=TTI × n of this scheduling;Wherein, n is this uplink scheduling The number of the continuous T TI of UE, and n≤1.
Alternatively, the size of the ascending resource determines the size for the data volume that can be transmitted.
Alternatively, the duration that this is dispatched described in the basis calculates the guarantee that each logic channel is dispatched at this Data volume includes:The guarantee data volume dispatched according to each logic channel of equation below calculating at this:Logic channel j is at this The guarantee data volume A of schedulingj=initial Bj+PBR×duration;Wherein, j represents logic channel, j≤1 and the bigger expressions pair of j The priority of logical channels answered is lower;Each logic channel j corresponds to a variable Bj, when logic channel is established, BjIt is initialized as 0;BjIn each TTI using PBR × TTI as step-length increase.
Alternatively, the order of the logically channel priority from high to low, is followed successively by each logical channel assignment institute Stating the ascending resource needed for the guarantee data volume in this scheduling includes:This scheduling is carried out after currently the resource allocation of TTI is complete In the range of next TTI ascending resource distribution, until guarantee data volume dispatch for all logic channels at this is distributed The corresponding ascending resources that can be used to transmit data of all TTI to ascending resource or this scheduling distribute;For epicycle The logic channel serviced in resource allocation, corresponding AjNeed to subtract the size of the corresponding MAC SDU of the logic channel, and By the A after reductionjInitial B as next TTI after this finishing schedulingj
Alternatively, the uplink needed for the guarantee data volume if described in each logical channel assignment in this scheduling Still have remaining ascending resource after resource, then the order successively decreased by priority of logical channels for each logic channel to greatest extent Distributing remaining ascending resource includes:The remaining ascending resource distributes to the channel of limit priority to greatest extent, such as Fruit superlative degree logical channel data has sent also resources left, then surplus resources is distributed to the high channel of preferential level.
Alternatively, the uplink needed for the guarantee data volume if described in each logical channel assignment in this scheduling Still have remaining ascending resource after resource, then the order successively decreased by priority of logical channels for each logic channel to greatest extent Distributing remaining ascending resource includes:The uplink of next TTI in the range of this scheduling is carried out after currently the resource allocation of TTI is complete The distribution of resource, until the corresponding ascending resources that can be used to transmit data of all TTI of this scheduling distribute or each The data sending of logic channel is complete.
Alternatively, if be higher than most in the data volume that this corresponding ascending resource of first TTI dispatched can transmit The guarantee data volume A that the logic channel of high priority is dispatched at this1, then the remaining ascending resource of first TTI is distributed to The logic channel of secondary high priority, until the corresponding ascending resources of first TTI distribute.
Alternatively, if be less than most in the data volume that this corresponding ascending resource of first TTI dispatched can transmit The guarantee data volume A that the logic channel of high priority is dispatched at this1, then it is preferably limit priority logic in second TTI The remaining ascending resource ensured needed for data volume of this scheduling of channel distribution, is again then the logic channel point of time high priority Guarantee data volume A with this scheduling2Required ascending resource.
Specifically, if UE has 3 logic channels (being respectively 1,2,3), and priority is ordered as from high to low:Logic channel 1st, logic channel 2, logic channel 3;The PBR of each logic channel configuration is 128kB/second, i.e., each logic channel 1ms The data volume of interior guarantee is at least 128byte;UE receives DCI, and the PUSCH for dispatching the UE subframes 4 and subframe 5 is sent, and two Subframe can send 1000byte data;Assuming that each logic channel it is to be sent data it is enough, be to the specific field as follows Existing logic channel dispatching method and method provided in an embodiment of the present invention illustrates under scape.
The step of carrying out logic channel scheduling according to the prior art is as follows:It is first in the 1st subframe in first TTI, UE The ascending resource that logic channel 1 distributes the guarantee data volume 128byte sizes of the channel (considers MAC header expense, real resource It is 128 bytes should be slightly larger than, similar below), then distribute for logic channel 2 the guarantee data volume 128byte sizes of the channel Ascending resource, then for logic channel 3 the guarantee data volume 128byte sizes of the channel ascending resource;First at this time Subframe also has resources left and the data volume to be sent of logic channel 1 is enough, then preferentially by the surplus resources of first subframe point Dispensing logic channel 1;In second TTI, UE three logic channels of the 2nd subframe scheduling method with the 1st subframe Situation is identical.
According to existing logic channel dispatching method, the MAC PDU of two subframes of UE generations are as shown in Fig. 2, can see To 6 MAC SDU are shared, there is more header overhead.
Alternatively, at present TTI when a length of 1ms, UE scheduling subframe lengths be 1ms;Later agreement will support different length TTI (a length of 0.5ms when such as), present invention is equally applicable.
It is as follows by logic channel dispatching method step provided in an embodiment of the present invention:In first TTI, UE is in the 1st son Frame be first logic channel 1 distribute this scheduling guarantees data volume size ascending resource (guarantee data volume size be 128*2 =256byte, it is contemplated that MAC header expense, real resource should be slightly larger than 256 bytes, similar below), then divide for logic channel 2 Fit over the ascending resource (ensureing that data volume size is 128*2=256byte) of the guarantee data volume size of this scheduling, Ran Houwei Logic channel 3 distribute this scheduling guarantees data volume size ascending resource (guarantee data volume size be 128*2= 256byte);First subframe also has resources left at this time and the data volume to be sent of logic channel 1 is enough, then preferentially by first The surplus resources of a subframe distribute to logic channel 1;In the 2nd TTI, the data volume to be sent of logic channel 1 is enough, by logic The ascending resource of 2nd subframe is fully allocated to logic channel 1 by the order that channel priority successively decreases, UE.
According to the MAC PDU of method provided in an embodiment of the present invention generation as shown in figure 3, sharing 4 MAC SDU, quantity Less, the header overhead of MAC PDU groups bag is smaller.
The embodiment of the present invention also provides a kind of uplink logic channel dispatching device, as shown in figure 4, described device includes:
First computing unit 11, the DCI for being sent according to base station calculate the duration of this scheduling;
Determination unit 12, the UL grant for being sent according to base station determine that each TTI is corresponding and can be used to transmit data Ascending resource;
Second computing unit 13, is adjusted for calculating each logic channel according to the duration of this scheduling at this The guarantee data volume of degree;
Scheduling unit 14, for the order of logically channel priority from high to low, is followed successively by each logic channel point With the ascending resource needed for the guarantee data volume in this scheduling, adjusted if described in each logical channel assignment at this Still there is remaining ascending resource after ascending resource needed for the guarantee data volume of degree, then the order successively decreased by priority of logical channels It is followed successively by each logic channel and distributes remaining ascending resource to greatest extent.
Uplink logic channel dispatching device provided in an embodiment of the present invention, this scheduling is calculated according to the DCI that base station is sent Duration, according to base station send UL grant determine the corresponding ascending resources that can be used to transmit data of each TTI, root The guarantee data volume dispatched according to each logic channel of duration calculating of this scheduling at this, logically channel is excellent The order of first level from high to low, is followed successively by the uplink needed for the guarantee data volume described in each logical channel assignment in this scheduling Resource, if described in each logical channel assignment this scheduling guarantee data volume needed for ascending resource after still have residue Ascending resource, then the order successively decreased by priority of logical channels be followed successively by each logic channel distribute to greatest extent it is remaining Ascending resource.Compared with prior art, multiple TTI of same logic channel can be ensured that data volume concentrates on together by the present invention Sent in one TTI, reduce the quantity of the MAC SDU of generation, so as to reduce the header overhead of MAC PDU groups bag.
Alternatively, first computing unit 11, for calculating the duration of this scheduling according to equation below:This Duration duration=TTI × n of scheduling;Wherein, n is the number of the continuous T TI of this uplink scheduling UE, and n≤1.
Alternatively, the size of the ascending resource determines the size for the data volume that can be transmitted.
Alternatively, second computing unit 13, is dispatched for calculating each logic channel according to equation below at this Guarantee data volume:The guarantee data volume A that logic channel j is dispatched at thisj=initial Bj+PBR×duration;Wherein, j generations Table logic channel, j≤1 and j is bigger represents that corresponding priority of logical channels is lower;Each logic channel j corresponds to a variable Bj, when logic channel is established, BjIt is initialized as 0;BjIn each TTI using PBR × TTI as step-length increase.
Alternatively, the scheduling unit 14, for if described in each logical channel assignment this scheduling guarantee Still there is remaining ascending resource after ascending resource needed for data volume, then distribute the remaining ascending resource to greatest extent To the channel of limit priority, if highest logical channel data has sent also resources left, surplus resources are distributed The channel high to preferential level.
Alternatively, the scheduling unit 14, for for described in each logical channel assignment this scheduling guarantee data After ascending resource needed for amount, for the logic channel serviced in epicycle resource allocation, corresponding AjNeed to subtract this and patrol The size of volume corresponding MAC SDU of channel, and by the A after reductionjInitial B as next TTI after this finishing schedulingj
Alternatively, the scheduling unit 14, carries out next in the range of this scheduling after resource allocation for current TTI is complete The distribution of the ascending resource of a TTI, until the corresponding ascending resource distribution that can be used to transmit data of all TTI of this scheduling The data sending of complete or each logic channel is complete.
Alternatively, the scheduling unit 14, if can be with for the corresponding ascending resources of first TTI dispatched at this The data volume of transmission is higher than the guarantee data volume A that the logic channel of limit priority is dispatched at this1When, by first TTI's Remaining ascending resource distributes to the logic channel of time high priority, until the corresponding ascending resources of first TTI distribute.
Alternatively, the scheduling unit 14, if for working as what this was dispatched in the corresponding ascending resources of first TTI The data volume that can be transmitted is less than the guarantee data volume A that the logic channel of limit priority is dispatched at this1When, at second TTI is preferably that highest priority logical channel distributes this scheduling the remaining ascending resource ensured needed for data volume, Ran Houzai For the guarantee data volume A of this scheduling of the logical channel assignment of secondary high priority2Required ascending resource.
The embodiment of the present invention also provides a kind of user equipment, and the user equipment includes above-mentioned uplink logic channel scheduling dress Put.
One of ordinary skill in the art will appreciate that realize all or part of flow in above-described embodiment method, being can be with Relevant hardware is instructed to complete by computer program, the program can be stored in a computer read/write memory medium In, the program is upon execution, it may include such as the flow of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic Dish, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random Access Memory, RAM) etc..
The above description is merely a specific embodiment, but protection scope of the present invention is not limited thereto, any Those familiar with the art the invention discloses technical scope in, the change or replacement that can readily occur in, all should It is included within the scope of the present invention.Therefore, protection scope of the present invention should be subject to scope of the claims.

Claims (15)

  1. A kind of 1. uplink logic channel dispatching method, it is characterised in that including:
    The DCI sent according to base station calculates the duration of this scheduling;
    The corresponding ascending resources that can be used to transmit data of each TTI are determined according to the UL grant that base station is sent;
    The guarantee data volume dispatched according to each logic channel of the duration that this is dispatched calculating at this;
    The logically order of channel priority from high to low, is followed successively by described in each logical channel assignment in the guarantor of this scheduling The ascending resource needed for data volume is demonstrate,proved, if needed for the guarantee data volume described in each logical channel assignment in this scheduling Still there is remaining ascending resource after ascending resource, then the order successively decreased by priority of logical channels is followed successively by each logic channel most Distribute to limits remaining ascending resource.
  2. 2. according to the method described in claim 1, it is characterized in that, the DCI sent according to base station calculates this scheduling Duration includes:The duration of this scheduling is calculated according to equation below:
    Duration duration=TTI × n of this scheduling;Wherein, n is the number of the continuous T TI of this uplink scheduling UE, And n≤1.
  3. 3. according to the method described in claim 2, it is characterized in that, this duration dispatched calculating described in the basis is every A logic channel includes in this guarantee data volume dispatched:Calculate what each logic channel was dispatched at this according to equation below Ensure data volume:
    The guarantee data volume A that logic channel j is dispatched at thisj=initial Bj+PBR×duration;Wherein, j represents logic letter Road, j≤1 and j is bigger represents that corresponding priority of logical channels is lower;Each logic channel j corresponds to a variable Bj, work as logic When channel is established, BjIt is initialized as 0;BjIn each TTI using PBR × TTI as step-length increase.
  4. 4. the according to the method described in claim 3, it is characterized in that, logically channel priority from high to low suitable Sequence, being followed successively by the ascending resource needed for the guarantee data volume described in each logical channel assignment in this scheduling includes:Current TTI Resource allocation it is complete after carry out the distribution of the ascending resource of next TTI in the range of this scheduling, until be all logic channels Ensure that data volume is assigned to all TTI of ascending resource or this scheduling and corresponding can be used to transmit data in this scheduling Ascending resource distribute;For the logic channel serviced in epicycle resource allocation, corresponding AjNeed to subtract the logic The size of the corresponding MAC SDU of channel, and by the A after reductionjInitial B as next TTI after this finishing schedulingj
  5. 5. according to the method described in claim 4, it is characterized in that, it is described if described in each logical channel assignment at this Still there is remaining ascending resource after ascending resource needed for the guarantee data volume of scheduling, then successively decrease by priority of logical channels suitable Sequence distributes remaining ascending resource to greatest extent for each logic channel to be included:The complete rear progress of resource allocation of current TTI is originally The distribution of the ascending resource of next TTI in the range of secondary scheduling, can be used to transmit number until all TTI of this scheduling are corresponding According to ascending resource distribute or the data sending of each logic channel is complete.
  6. If 6. according to the method described in claim 5, it is characterized in that, this scheduling the corresponding uplinks of first TTI The data volume that resource can be transmitted is higher than the guarantee data volume A that the logic channel of limit priority is dispatched at this1, then by first The remaining ascending resource of a TTI distributes to the logic channel of time high priority, until the corresponding ascending resource distribution of first TTI It is complete.
  7. If 7. according to the method described in claim 5, it is characterized in that, this scheduling the corresponding uplinks of first TTI The data volume that resource can be transmitted is less than the guarantee data volume A that the logic channel of limit priority is dispatched at this1, then second A TTI is preferably that highest priority logical channel distributes this scheduling the remaining ascending resource ensured needed for data volume, then It is again the guarantee data volume A of this scheduling of the logical channel assignment of time high priority2Required ascending resource.
  8. A kind of 8. uplink logic channel dispatching device, it is characterised in that including:
    First computing unit, the DCI for being sent according to base station calculate the duration of this scheduling;
    Determination unit, the UL grant for being sent according to base station determine the corresponding uplinks that can be used to transmit data of each TTI Resource;
    Second computing unit, for the guarantor dispatched according to each logic channel of duration calculating of this scheduling at this Demonstrate,prove data volume;
    Scheduling unit, for the order of logically channel priority from high to low, is followed successively by described in each logical channel assignment This scheduling guarantees data volume needed for ascending resource, if described in each logical channel assignment this dispatch guarantor Still there is remaining ascending resource after ascending resource needed for card data volume, then the order successively decreased by priority of logical channels is followed successively by Each logic channel distributes remaining ascending resource to greatest extent.
  9. 9. device according to claim 8, it is characterised in that first computing unit, based on according to equation below Calculate the duration of this scheduling:Duration duration=TTI × n of this scheduling;Wherein, n is this uplink scheduling The number of the continuous T TI of UE, and n≤1.
  10. 10. device according to claim 9, it is characterised in that second computing unit, based on according to equation below Calculate the guarantee data volume that each logic channel is dispatched at this:The guarantee data volume A that logic channel j is dispatched at thisj=initial Bj +PBR×duration;Wherein, j represents logic channel, j≤1 and j is bigger represents that corresponding priority of logical channels is lower;Often A logic channel j corresponds to a variable Bj, when logic channel is established, BjIt is initialized as 0;BjIn each TTI with PBR × TTI For step-length increase.
  11. 11. device according to claim 10, it is characterised in that the scheduling unit, for dividing for each logic channel After the ascending resource needed for the guarantee data volume in this scheduling, for the logic serviced in epicycle resource allocation Channel, corresponding AjNeed to subtract the size of the corresponding MAC SDU of the logic channel, and by the A after reductionjAs this scheduling After next TTI initial Bj
  12. 12. according to the devices described in claim 11, it is characterised in that the scheduling unit, the resource allocation for current TTI The distribution of the ascending resource of next TTI in the range of this scheduling is carried out after complete, can until all TTI of this scheduling are corresponding For transmitting, the ascending resource of data distributes or the data sending of each logic channel is complete.
  13. 13. device according to claim 12, it is characterised in that the scheduling unit, if for dispatching at this The data volume that the corresponding ascending resources of first TTI can transmit is higher than the guarantor that the logic channel of limit priority is dispatched at this Demonstrate,prove data volume A1, then the remaining ascending resource of first TTI is distributed to the logic channel of time high priority, until first The corresponding ascending resources of TTI distribute.
  14. 14. device according to claim 12, it is characterised in that the scheduling unit, if for dispatching at this The data volume that the corresponding ascending resources of first TTI can transmit is less than the guarantor that the logic channel of limit priority is dispatched at this Demonstrate,prove data volume A1, then it is preferably that highest priority logical channel distributes this remaining guarantee data volume of scheduling in second TTI Required ascending resource, is again then the guarantee data volume A of this scheduling of the logical channel assignment of time high priority2It is required Ascending resource.
  15. 15. a kind of user equipment, it is characterised in that the user equipment is included as any one of claim 8 to 14 Uplink logic channel dispatching device.
CN201610885534.6A 2016-10-10 2016-10-10 Uplink logical channel scheduling method and device and user equipment Active CN107920390B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610885534.6A CN107920390B (en) 2016-10-10 2016-10-10 Uplink logical channel scheduling method and device and user equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610885534.6A CN107920390B (en) 2016-10-10 2016-10-10 Uplink logical channel scheduling method and device and user equipment

Publications (2)

Publication Number Publication Date
CN107920390A true CN107920390A (en) 2018-04-17
CN107920390B CN107920390B (en) 2021-09-21

Family

ID=61892503

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610885534.6A Active CN107920390B (en) 2016-10-10 2016-10-10 Uplink logical channel scheduling method and device and user equipment

Country Status (1)

Country Link
CN (1) CN107920390B (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109918282A (en) * 2019-03-16 2019-06-21 河南工学院 A kind of computer log monitoring method and monitor supervision platform
CN110446263A (en) * 2019-08-12 2019-11-12 展讯通信(上海)有限公司 Data transmission method and device
CN110475341A (en) * 2018-05-09 2019-11-19 电信科学技术研究院有限公司 A kind of method and apparatus carrying out resource allocation
CN110831211A (en) * 2018-08-10 2020-02-21 展讯通信(上海)有限公司 Data uploading method and device, storage medium and user terminal
WO2020057637A1 (en) * 2018-09-21 2020-03-26 华为技术有限公司 Method and device for wireless scheduling
CN111294964A (en) * 2019-03-28 2020-06-16 展讯通信(上海)有限公司 Resource selection method, resource configuration method, resource selection device, resource configuration device, storage medium, user equipment and base station
WO2020119358A1 (en) * 2018-12-11 2020-06-18 北京展讯高科通信技术有限公司 Method for scheduling logical channel, method for generating configuration information, and device
CN111328138A (en) * 2018-12-13 2020-06-23 电信科学技术研究院有限公司 Method, device and terminal for organizing MAC PDU
CN111385883A (en) * 2018-12-28 2020-07-07 展讯通信(上海)有限公司 Data transmission method and device, storage medium and terminal
WO2020143707A1 (en) * 2019-01-11 2020-07-16 展讯通信(上海)有限公司 Uplink transmission resource selection method, terminal and storage medium
CN111586870A (en) * 2020-05-11 2020-08-25 北京盛讯通科技有限公司 Optimization method for transmitting RLC PDU data on multiple logical channels
CN111601383A (en) * 2019-06-17 2020-08-28 维沃移动通信有限公司 Resource allocation method, terminal and network equipment
CN114223296A (en) * 2019-10-31 2022-03-22 Oppo广东移动通信有限公司 Method and terminal equipment for allocating resources for uplink logical channel
CN116389272A (en) * 2023-04-11 2023-07-04 国家气象信息中心(中国气象局气象数据中心) Broadcast channel statistical multiplexing method and device based on logic channel data volume correction

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102271408A (en) * 2010-06-01 2011-12-07 普天信息技术研究院有限公司 Method for allocating uplink resources in LTE (Long Term Evolution) system
CN102415187A (en) * 2009-04-23 2012-04-11 松下电器产业株式会社 Logical channel prioritization procedure for generating multiple uplink transport blocks
CN102918896A (en) * 2010-04-01 2013-02-06 松下电器产业株式会社 Transmit power control for physical random access channels
CN105453672A (en) * 2013-08-07 2016-03-30 交互数字专利控股公司 Distributed scheduling for device-to-device communication

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102415187A (en) * 2009-04-23 2012-04-11 松下电器产业株式会社 Logical channel prioritization procedure for generating multiple uplink transport blocks
CN102918896A (en) * 2010-04-01 2013-02-06 松下电器产业株式会社 Transmit power control for physical random access channels
CN102271408A (en) * 2010-06-01 2011-12-07 普天信息技术研究院有限公司 Method for allocating uplink resources in LTE (Long Term Evolution) system
CN105453672A (en) * 2013-08-07 2016-03-30 交互数字专利控股公司 Distributed scheduling for device-to-device communication
US20160183276A1 (en) * 2013-08-07 2016-06-23 Interdigital Patent Holdings, Inc. Distributed scheduling for device-to-device communication

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
3GPP: "《3GPP TS 36.523-1 V13.1.0 (2016-06)》", 30 June 2016 *

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110475341A (en) * 2018-05-09 2019-11-19 电信科学技术研究院有限公司 A kind of method and apparatus carrying out resource allocation
CN110831211A (en) * 2018-08-10 2020-02-21 展讯通信(上海)有限公司 Data uploading method and device, storage medium and user terminal
WO2020057637A1 (en) * 2018-09-21 2020-03-26 华为技术有限公司 Method and device for wireless scheduling
US12004169B2 (en) 2018-09-21 2024-06-04 Huawei Technologies Co., Ltd. Radio scheduling method and apparatus
WO2020119358A1 (en) * 2018-12-11 2020-06-18 北京展讯高科通信技术有限公司 Method for scheduling logical channel, method for generating configuration information, and device
US11950274B2 (en) 2018-12-11 2024-04-02 Beijing Unisoc Communications Technology Co., Ltd. Method for scheduling logical channel, method for generating configuration information, and device
CN111328138A (en) * 2018-12-13 2020-06-23 电信科学技术研究院有限公司 Method, device and terminal for organizing MAC PDU
CN111385883B (en) * 2018-12-28 2023-01-10 展讯通信(上海)有限公司 Data transmission method and device, storage medium and terminal
CN111385883A (en) * 2018-12-28 2020-07-07 展讯通信(上海)有限公司 Data transmission method and device, storage medium and terminal
WO2020143707A1 (en) * 2019-01-11 2020-07-16 展讯通信(上海)有限公司 Uplink transmission resource selection method, terminal and storage medium
US11917613B2 (en) 2019-01-11 2024-02-27 Spreadtrum Communications (Shanghai) Co., Ltd. Uplink transmission resource selection method, terminal and storage medium
CN109918282A (en) * 2019-03-16 2019-06-21 河南工学院 A kind of computer log monitoring method and monitor supervision platform
CN109918282B (en) * 2019-03-16 2023-02-24 河南工学院 Computer log monitoring method and monitoring platform
CN111294964A (en) * 2019-03-28 2020-06-16 展讯通信(上海)有限公司 Resource selection method, resource configuration method, resource selection device, resource configuration device, storage medium, user equipment and base station
CN111601383A (en) * 2019-06-17 2020-08-28 维沃移动通信有限公司 Resource allocation method, terminal and network equipment
CN110446263B (en) * 2019-08-12 2022-12-06 展讯通信(上海)有限公司 Data transmission method and device
CN110446263A (en) * 2019-08-12 2019-11-12 展讯通信(上海)有限公司 Data transmission method and device
CN114223296A (en) * 2019-10-31 2022-03-22 Oppo广东移动通信有限公司 Method and terminal equipment for allocating resources for uplink logical channel
CN111586870B (en) * 2020-05-11 2022-02-18 无锡摩罗科技有限公司 Optimization method for transmitting RLC PDU data on multiple logical channels
CN111586870A (en) * 2020-05-11 2020-08-25 北京盛讯通科技有限公司 Optimization method for transmitting RLC PDU data on multiple logical channels
CN116389272A (en) * 2023-04-11 2023-07-04 国家气象信息中心(中国气象局气象数据中心) Broadcast channel statistical multiplexing method and device based on logic channel data volume correction
CN116389272B (en) * 2023-04-11 2023-11-21 国家气象信息中心(中国气象局气象数据中心) Broadcast channel statistical multiplexing method and device based on logic channel data volume correction

Also Published As

Publication number Publication date
CN107920390B (en) 2021-09-21

Similar Documents

Publication Publication Date Title
CN107920390A (en) Uplink logic channel dispatching method, device and user equipment
CN102036390B (en) Method for processing priority
JP6162279B2 (en) Method and apparatus for configuring usable transmit power information in a mobile communication system for carrier aggregation
CN103746936B (en) For the method and WTRU from WTRU scheduled uplink datas
CN102149206B (en) Uplink dispatch method
US7821977B2 (en) Determining data amounts for scheduled and autonomous transmission with a user equipment
CN102612093B (en) Carrier-aggregation-based method for scheduling upstream cross-layer resources in LTE-Advanced system
EP1986455A1 (en) Communication of scheduling related information in a mobile communication system
CN101621369B (en) Method of performing packet transmission and priority, and relevant apparatus thereof
CN103945540B (en) A kind of priority of logical channels processing method and processing device
EP1643694A2 (en) Method and apparatus for transmitting uplink nonscheduled data in a mobile communication system
EP2058990B1 (en) Apparatus and method for transmitting and receiving control information for uplink data in a mobile communication system
CN104247547B (en) Data distribution collocation method, base station system and user terminal
US10367614B2 (en) Method and apparatus for MU resource request
KR20100119341A (en) Device and method for handling uplink transmission resource of user equipment in wireless communication system
CN103857054B (en) Multiplexing and combined dispatch processing method in long evolving system MAC layer
CN102946622A (en) Method and device for establishing business flow as well as business flow revising method and device
CN102474866A (en) Method and apparatus for measuring radio resource use per traffic class in a wireless communication system
CN105992325A (en) Power control method applied to carrier aggregation enhancement and apparatus
CN106936918A (en) For the RLC PDU transmission methods of LTE mobile communication system
WO2016082115A1 (en) Service scheduling method and device
CN104066197B (en) A kind of real time scheduling of traffic method of low packet loss ratio in TD LTE
CN108322939B (en) Method and apparatus for wireless communication system supporting multiple physical layer methods
EP1652342B1 (en) Method, access point and program product for providing bandwidth and airtime fairness in wireless networks
CN104918333B (en) A kind of dispatching method for Non-GBR business

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant