CN107920390B - Uplink logical channel scheduling method and device and user equipment - Google Patents

Uplink logical channel scheduling method and device and user equipment Download PDF

Info

Publication number
CN107920390B
CN107920390B CN201610885534.6A CN201610885534A CN107920390B CN 107920390 B CN107920390 B CN 107920390B CN 201610885534 A CN201610885534 A CN 201610885534A CN 107920390 B CN107920390 B CN 107920390B
Authority
CN
China
Prior art keywords
logical channel
scheduling
tti
uplink
uplink resources
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.)
Active
Application number
CN201610885534.6A
Other languages
Chinese (zh)
Other versions
CN107920390A (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

Images

Classifications

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

Abstract

The invention provides an uplink logical channel scheduling method, an uplink logical channel scheduling device and user equipment. The method comprises the following steps: calculating the duration of the scheduling according to the DCI sent by the base station; determining uplink resources which can be used for transmitting data and correspond to each TTI according to the UL grant sent by the base station; calculating the guaranteed data volume of each logic channel in the current scheduling according to the duration of the current scheduling; and according to the sequence of the priorities of the logical channels from high to low, sequentially allocating the uplink resources required by the guaranteed data volume scheduled at the time to each logical channel, and if the remaining uplink resources are still allocated to each logical channel after the uplink resources required by the guaranteed data volume scheduled at the time are allocated to each logical channel, sequentially allocating the remaining uplink resources to each logical channel to the maximum extent according to the sequence of descending priorities of the logical channels. The invention can transmit the guaranteed data volume of a plurality of TTIs of the same logic channel in the same TTI in a centralized way, and reduces the number of generated MAC SDUs, thereby reducing the head expense of MAC PDU package.

Description

Uplink logical channel scheduling method and device and user equipment
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a method and an apparatus for scheduling an uplink logical channel, and a user equipment.
Background
In LTE (Long Term Evolution), a UE (User Equipment) is a sending end for uplink data transmission, and a base station allocates an uplink grant (UL grant) and an uplink resource to the UE to determine a total uplink data amount that the UE can send. The uplink data scheduling of each logical channel in the UE is completed by the UE, each logical channel is configured with a corresponding absolute priority, the uplink resource is preferentially used to send data of a logical channel with a high priority, and meanwhile, in order to avoid that a logical channel with a low priority cannot be scheduled for a long time, each logical channel is configured with a PBR (Prioritized Bit Rate), and a logical channel j is defined to ensure that the sent data volume is BjEvery TTI (Transmission Time Interval), BjIncrease Δ ofj＝PBR×TTI。
When the UE performs logical channel scheduling in a certain TTI, the scheduling is performed in two rounds. The first round allocates uplink resources for each channel according to the priority of the logical channels from high to low, and the first round is largeAs small as the guaranteed amount of data B for that channelj(if the amount of data that can be sent is less than BjThen the resources are allocated in the amount of data that can actually be transmitted). For each logical channel served in the first round of allocated resources, corresponding BjThe size of the MAC SDU corresponding to the logical channel needs to be subtracted. And after the first round is finished, if resources are remained, performing a second round, and allocating the remained resources according to the descending order of the priority of the logical channels, namely allocating the remained wireless resources to the channel with the highest priority to the maximum extent, and if the resources are remained, allocating the resources to the channel with the next highest priority until the resources are used up.
In the process of implementing the invention, the inventor finds that at least the following technical problems exist in the prior art:
generally, a MAC PDU (Media Access Control Protocol Data Unit) includes a plurality of MAC SDUs (Media Access Control Service Data Unit), each MAC SDU corresponds to 1 MAC header (at least 1 byte), each MAC SDU also corresponds to 1 RLC header (at least 1 byte) under the configuration of UM (Unacknowledged Mode) and AM (Acknowledged Mode) of RLC (Radio Link Control), and if the number of MAC SDUs is large, a large header overhead will be generated.
The 3GPP LTE R14 introduces enhanced LAA (licensed-assisted access) characteristics, and supports eNB (Evolved NodeB) to simultaneously schedule PUSCH (Physical Uplink Shared Channel) transmission of multiple consecutive subframes through DCI (Downlink Control Information) of one subframe. In this case, if the existing uplink logical channel scheduling method is still used, there will be unnecessary overhead.
Disclosure of Invention
The uplink logical channel scheduling method, the device and the user equipment provided by the invention can centralize the guaranteed data volumes of a plurality of TTIs of the same logical channel in the same TTI for transmission, reduce the number of generated MAC SDUs and further reduce the head overhead of MAC PDU packaging.
In a first aspect, the present invention provides a method for scheduling an uplink logical channel, including:
calculating the duration of the scheduling according to the DCI sent by the base station;
determining uplink resources which can be used for transmitting data and correspond to each TTI according to the UL grant sent by the base station;
calculating the guaranteed data volume of each logic channel in the current scheduling according to the duration of the current scheduling;
and according to the sequence of the priorities of the logical channels from high to low, sequentially allocating the uplink resources required by the guaranteed data volume scheduled at the time to each logical channel, and if the remaining uplink resources are still allocated to each logical channel after the uplink resources required by the guaranteed data volume scheduled at the time are allocated to each logical channel, sequentially allocating the remaining uplink resources to each logical channel to the maximum extent according to the sequence of descending priorities of the logical channels.
Optionally, the calculating the duration of the current scheduling according to the DCI sent by the base station includes: the duration of the scheduling is calculated according to the following formula: the duration of the current scheduling is TTI multiplied by n; wherein n is the number of continuous TTIs of the UE of the uplink scheduling, and n is ≧ 1.
Optionally, the calculating the guaranteed data volume of each logical channel in the current scheduling according to the duration of the current scheduling includes: the guaranteed data volume of each logic channel scheduled at this time is calculated according to the following formula: guaranteed data volume A of logical channel j scheduled at this timejInitial Bj+ PBR × duration; wherein j represents a logical channel, and j ≧ 1 and the larger j represents the lower priority of the corresponding logical channel; each logical channel j corresponds to a variable BjWhen a logical channel is established, BjInitialization is 0; b isjThe increase is in steps PBR × TTI at each TTI.
Optionally, the sequentially allocating, according to the priority of the logical channels from high to low, the uplink resources required for guaranteeing the data volume scheduled at this time to each logical channel includes: after the resource allocation of the current TTI is finished, the next TTI in the scheduling range is carried outAllocating uplink resources until the guaranteed data volume of all the logic channels scheduled at this time is allocated to the uplink resources or the uplink resources which can be used for transmitting data and correspond to all the TTIs scheduled at this time are allocated; for the logical channel served in the resource allocation of the current round, corresponding AjThe size of the MAC SDU corresponding to the logical channel needs to be subtracted and a reduced a is obtainedjAs the initial B of the next TTI after the end of the current schedulingj。
Optionally, if remaining uplink resources remain after allocating the uplink resources required by the guaranteed data amount scheduled for each logical channel, allocating the remaining uplink resources to each logical channel to the maximum extent according to the descending order of the priority of the logical channel includes: and after the resource allocation of the current TTI is finished, allocating the uplink resource of the next TTI in the scheduling range until the uplink resource which can be used for transmitting data and corresponds to all the TTIs scheduled at the time is allocated or the data of each logic channel is transmitted.
Optionally, if the data volume that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is higher than the guaranteed data volume a of the logical channel with the highest priority in the current scheduling1And allocating the remaining uplink resources of the first TTI to the logic channel with the second highest priority until the uplink resources corresponding to the first TTI are allocated.
Optionally, if the data volume that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is lower than the guaranteed data volume a of the logical channel with the highest priority in the current scheduling1Preferentially distributing the uplink resources required by the residual guaranteed data volume of the current scheduling to the logic channel with the highest priority in the second TTI, and then distributing the guaranteed data volume A of the current scheduling to the logic channel with the next highest priority2Required uplink resources.
In a second aspect, the present invention provides an uplink logical channel scheduling apparatus, including:
the first calculating unit is used for calculating the duration of the current scheduling according to the DCI sent by the base station;
a determining unit, configured to determine, according to a UL grant sent by a base station, an uplink resource available for data transmission corresponding to each TTI;
the second calculation unit is used for calculating the guaranteed data volume of each logic channel in the current scheduling according to the duration of the current scheduling;
and the scheduling unit is used for sequentially allocating the uplink resources required by the scheduled data volume for each logical channel according to the sequence of the priorities of the logical channels from high to low, and if the remaining uplink resources are still allocated to each logical channel after the uplink resources required by the scheduled data volume for the current time are allocated, sequentially allocating the remaining uplink resources to each logical channel to the maximum extent according to the sequence of descending the priorities of the logical channels.
Optionally, the first calculating unit is configured to calculate the duration of the current scheduling according to the following formula: the duration of the current scheduling is TTI multiplied by n; wherein n is the number of continuous TTIs of the UE of the uplink scheduling, and n is ≧ 1.
Optionally, the second calculating unit is configured to calculate a guaranteed data amount of each logical channel scheduled at this time according to the following formula: guaranteed data volume A of logical channel j scheduled at this timejInitial Bj+ PBR × duration; wherein j represents a logical channel, and j ≧ 1 and the larger j represents the lower priority of the corresponding logical channel; each logical channel j corresponds to a variable BjWhen a logical channel is established, BjInitialization is 0; b isjThe increase is in steps PBR × TTI at each TTI.
Optionally, the scheduling unit is configured to allocate, to each logical channel, the uplink resource required for guaranteeing the data amount scheduled this time, and then allocate, to the logical channel served in the resource allocation in this round, the corresponding ajThe size of the MAC SDU corresponding to the logical channel needs to be subtracted and a reduced a is obtainedjAs the initial B of the next TTI after the end of the current schedulingj。
Optionally, the scheduling unit is configured to allocate uplink resources of a next TTI within the current scheduling range after the resource allocation of the current TTI is completed, until the uplink resources, which are available for data transmission, corresponding to all TTIs scheduled this time are allocated or data of each logical channel is transmitted.
Optionally, the scheduling unit is configured to, if the data volume that can be transmitted by the uplink resource corresponding to the first TTI of the current scheduling is higher than the guaranteed data volume a of the logical channel with the highest priority in the current scheduling1And then, allocating the remaining uplink resources of the first TTI to the logic channel with the second highest priority until the uplink resources corresponding to the first TTI are allocated.
Optionally, the scheduling unit is configured to, if the data volume that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is lower than the guaranteed data volume a of the logical channel with the highest priority in the current scheduling1In the second TTI, the uplink resource needed by the residual guaranteed data volume of the current scheduling is preferentially distributed to the logic channel with the highest priority, and then the guaranteed data volume A of the current scheduling is distributed to the logic channel with the next highest priority2Required uplink resources.
In a third aspect, the present invention provides a user equipment, where the user equipment includes the foregoing uplink logical channel scheduling apparatus.
The uplink logical channel scheduling method, apparatus and user equipment provided in the embodiments of the present invention calculate the duration of this scheduling according to DCI sent by a base station, determine uplink resources available for data transmission corresponding to each TTI according to a UL grant sent by the base station, calculate the guaranteed data amount of each logical channel in this scheduling according to the duration of this scheduling, sequentially allocate, to each logical channel, the uplink resources required for the guaranteed data amount in this scheduling according to a sequence of logical channel priorities from high to low, and sequentially allocate, to each logical channel, the remaining uplink resources to the greatest extent according to a sequence of descending logical channel priorities if there are remaining uplink resources after allocating the uplink resources required for the guaranteed data amount in this scheduling to each logical channel. Compared with the prior art, the invention can transmit the guaranteed data volume of a plurality of TTIs of the same logic channel in the same TTI in a centralized way, and reduce the number of generated MAC SDUs, thereby reducing the head expense of MAC PDU package.
Drawings
Fig. 1 is a flowchart of a method for scheduling an uplink logical channel according to an embodiment of the present invention;
FIG. 2 is a diagram of a MAC PDU generated according to the prior art;
FIG. 3 is a diagram illustrating a MAC PDU generated according to another embodiment of the present invention;
fig. 4 is a schematic structural diagram of an uplink logical channel scheduling apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention provides a method for scheduling an uplink logical channel, which comprises the following steps as shown in figure 1:
s11, calculating the duration of the current scheduling according to the DCI sent by the base station;
s12, determining the uplink resource which can be used for transmitting data and corresponds to each TTI according to the UL grant sent by the base station;
s13, calculating the guaranteed data volume of each logic channel in the current scheduling according to the duration of the current scheduling;
and S14, sequentially allocating the uplink resources required by the scheduled data volume for each logical channel according to the sequence of the priorities of the logical channels from high to low, and if the remaining uplink resources remain after the uplink resources required by the scheduled data volume for each logical channel are allocated, sequentially allocating the remaining uplink resources to each logical channel to the maximum extent according to the sequence of descending the priorities of the logical channels.
The uplink logical channel scheduling method provided in the embodiment of the present invention calculates the duration of this scheduling according to DCI sent by a base station, determines uplink resources which can be used for transmitting data and are corresponding to each TTI according to a UL grant sent by the base station, calculates the guaranteed data volume of each logical channel in this scheduling according to the duration of this scheduling, sequentially allocates uplink resources required by the guaranteed data volume in this scheduling to each logical channel according to a sequence from high to low in logical channel priority, and sequentially allocates the remaining uplink resources to each logical channel to the maximum extent according to a sequence in which the logical channel priority is decreased if remaining uplink resources remain after allocating the uplink resources required by the guaranteed data volume in this scheduling to each logical channel. Compared with the prior art, the invention can transmit the guaranteed data volume of a plurality of TTIs of the same logic channel in the same TTI in a centralized way, and reduce the number of generated MAC SDUs, thereby reducing the head expense of MAC PDU package.
Optionally, the calculating the duration of the current scheduling according to the DCI sent by the base station includes: the duration of the scheduling is calculated according to the following formula: the duration of the current scheduling is TTI multiplied by n; wherein n is the number of continuous TTIs of the UE of the uplink scheduling, and n is ≧ 1.
Optionally, the size of the uplink resource determines the size of the data amount that can be transmitted.
Optionally, the calculating the guaranteed data volume of each logical channel in the current scheduling according to the duration of the current scheduling includes: the guaranteed data volume of each logic channel scheduled at this time is calculated according to the following formula: guaranteed data volume A of logical channel j scheduled at this timejInitial Bj+ PBR × duration; wherein j represents a logical channel, and j ≧ 1 and the larger j represents the lower priority of the corresponding logical channel; each logical channel j corresponds to a variable BjWhen a logical channel is established, BjInitialization is 0; b isjThe increase is in steps PBR × TTI at each TTI.
Optionally, the sequentially allocating, according to the priority of the logical channels from high to low, the uplink resources required for guaranteeing the data volume scheduled at this time to each logical channel includes: after the resource allocation of the current TTI is finishedAllocating uplink resources of the next TTI within the scheduling range until all the logical channels are allocated to the uplink resources in the guaranteed data volume of the scheduling or the uplink resources which can be used for transmitting data and correspond to all the TTIs of the scheduling are allocated; for the logical channel served in the resource allocation of the current round, corresponding AjThe size of the MAC SDU corresponding to the logical channel needs to be subtracted and a reduced a is obtainedjAs the initial B of the next TTI after the end of the current schedulingj。
Optionally, if remaining uplink resources remain after allocating the uplink resources required by the guaranteed data amount scheduled for each logical channel, allocating the remaining uplink resources to each logical channel to the maximum extent according to the descending order of the priority of the logical channel includes: and the residual uplink resources are allocated to the channel with the highest priority to the maximum extent, and if the data of the logical channel with the highest priority is sent and the resources are residual, the residual resources are allocated to the channel with the next highest priority.
Optionally, if remaining uplink resources remain after allocating the uplink resources required by the guaranteed data amount scheduled for each logical channel, allocating the remaining uplink resources to each logical channel to the maximum extent according to the descending order of the priority of the logical channel includes: and after the resource allocation of the current TTI is finished, allocating the uplink resource of the next TTI in the scheduling range until the uplink resource which can be used for transmitting data and corresponds to all the TTIs scheduled at the time is allocated or the data of each logic channel is transmitted.
Optionally, if the data volume that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is higher than the guaranteed data volume a of the logical channel with the highest priority in the current scheduling1And allocating the remaining uplink resources of the first TTI to the logic channel with the second highest priority until the uplink resources corresponding to the first TTI are allocated.
Optionally, if the data volume that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is lower than the guaranteed data volume a of the logical channel with the highest priority in the current scheduling1Then at the second TTI preferentially distributes the uplink resource needed by the residual guaranteed data volume of the current scheduling to the logic channel with the highest priority, and then distributes the guaranteed data volume A of the current scheduling to the logic channel with the next highest priority2Required uplink resources.
Specifically, let the UE have 3 logical channels (1, 2, and 3, respectively), and the priorities are ordered from high to low as: logical channel 1, logical channel 2, logical channel 3; the PBR configured for each logical channel is 128kB/second, namely the guaranteed data volume in 1ms of each logical channel is at least 128 bytes; the UE receives the DCI, schedules PUSCH transmission of a subframe 4 and a subframe 5 of the UE, and the two subframes can both transmit 1000byte data; assuming that data to be sent by each logical channel is sufficient, the following is a specific description of the existing logical channel scheduling method in this specific scenario and the method provided by the embodiment of the present invention.
The steps of logical channel scheduling according to the prior art are as follows: in the first TTI, the UE allocates uplink resources with a guaranteed data size of 128 bytes for the channel to the logical channel 1 in the 1 st subframe (considering MAC header overhead, the actual resources should be slightly larger than 128 bytes, and the following is similar), allocates uplink resources with a guaranteed data size of 128 bytes for the channel to the logical channel 2, and then allocates uplink resources with a guaranteed data size of 128 bytes for the logical channel 3 in the channel; if the first subframe has resources left and the amount of data to be transmitted by the logical channel 1 is enough, the remaining resources of the first subframe are preferentially allocated to the logical channel 1; in the second TTI, the method for the UE to schedule three logical channels in the 2 nd subframe is the same as in the 1 st subframe.
According to the existing logical channel scheduling method, the MAC PDUs of two subframes generated by the UE are shown in fig. 2, and it can be seen that there are 6 MAC SDUs in total, which has more header overhead.
Optionally, the current TTI duration is 1ms, and the subframe length scheduled by the UE is 1 ms; later the protocol will support TTIs of different lengths (e.g. duration of 0.5ms), the same applies to the present disclosure.
The method for dispatching the logical channel provided by the embodiment of the invention comprises the following steps: in the first TTI, the UE allocates uplink resources of the guaranteed data size scheduled this time to the logical channel 1 in the 1 st subframe (the guaranteed data size is 128 × 2 — 256byte, considering the overhead of the MAC header, the actual resources should be slightly larger than 256 bytes, and the following is similar), then allocates uplink resources of the guaranteed data size scheduled this time to the logical channel 2 (the guaranteed data size is 128 × 2 — 256byte), and then allocates uplink resources of the guaranteed data size scheduled this time to the logical channel 3 (the guaranteed data size is 128 × 2 — 256 byte); if the first subframe has resources left and the amount of data to be transmitted by the logical channel 1 is enough, the remaining resources of the first subframe are preferentially allocated to the logical channel 1; in the 2 nd TTI, the amount of data to be transmitted by logical channel 1 is sufficient, and the UE allocates all uplink resources of the 2 nd subframe to logical channel 1 in descending order of logical channel priority.
As shown in fig. 3, the MAC PDU generated by the method provided by the embodiment of the present invention has 4 MAC SDUs in total, the number is small, and the head overhead of the MAC PDU packet is small.
An embodiment of the present invention further provides an uplink logical channel scheduling apparatus, and as shown in fig. 4, the apparatus includes:
a first calculating unit 11, configured to calculate a duration of the current scheduling according to DCI sent by the base station;
a determining unit 12, configured to determine, according to the UL grant sent by the base station, uplink resources that can be used for transmitting data and correspond to each TTI;
a second calculating unit 13, configured to calculate, according to the duration of the current scheduling, a guaranteed data amount of each logical channel in the current scheduling;
and the scheduling unit 14 is configured to sequentially allocate, according to the priority of the logical channels from high to low, the uplink resources required for the guaranteed data volume scheduled this time to each logical channel, and if remaining uplink resources remain after allocating, to each logical channel, the uplink resources required for the guaranteed data volume scheduled this time, then sequentially allocate, to the maximum extent, the remaining uplink resources to each logical channel according to the order of decreasing the priority of the logical channels.
The uplink logical channel scheduling apparatus provided in the embodiment of the present invention calculates the duration of current scheduling according to DCI sent by a base station, determines an uplink resource which is available for data transmission and corresponds to each TTI according to a UL grant sent by the base station, calculates the guaranteed data amount of each logical channel in current scheduling according to the duration of current scheduling, sequentially allocates uplink resources required for the guaranteed data amount of current scheduling to each logical channel according to a sequence from high to low in logical channel priority, and sequentially allocates the remaining uplink resources to each logical channel to the maximum extent according to a sequence in which the logical channel priority is decreased if remaining uplink resources remain after allocating the uplink resources required for the guaranteed data amount of current scheduling to each logical channel. Compared with the prior art, the invention can transmit the guaranteed data volume of a plurality of TTIs of the same logic channel in the same TTI in a centralized way, and reduce the number of generated MAC SDUs, thereby reducing the head expense of MAC PDU package.
Optionally, the first calculating unit 11 is configured to calculate the duration of the current scheduling according to the following formula: the duration of the current scheduling is TTI multiplied by n; wherein n is the number of continuous TTIs of the UE of the uplink scheduling, and n is ≧ 1.
Optionally, the size of the uplink resource determines the size of the data amount that can be transmitted.
Optionally, the second calculating unit 13 is configured to calculate a guaranteed data amount of each logical channel scheduled at this time according to the following formula: guaranteed data volume A of logical channel j scheduled at this timejInitial Bj+ PBR × duration; wherein j represents a logical channel, and j ≧ 1 and the larger j represents the lower priority of the corresponding logical channel; each logical channel j corresponds to a variable BjWhen a logical channel is established, BjInitialization is 0; b isjThe increase is in steps PBR × TTI at each TTI.
Optionally, the scheduling unit 14 is configured to allocate, to each logical channel, the remaining uplink resources to the highest priority channel to the maximum extent if the remaining uplink resources remain after the uplink resources required by the guaranteed data amount scheduled this time are allocated to the logical channel, and allocate, to the next highest priority channel, the remaining resources if the resources remain after the highest priority logical channel data is sent.
Optionally, the scheduling unit 14 is configured to allocate, to each logical channel, the uplink resource required by the data amount guaranteed in the current scheduling, and then, for the logical channel served in the current resource allocation, corresponding to the logical channel ajThe size of the MAC SDU corresponding to the logical channel needs to be subtracted and a reduced a is obtainedjAs the initial B of the next TTI after the end of the current schedulingj。
Optionally, the scheduling unit 14 is configured to allocate uplink resources of a next TTI within the current scheduling range after the resource allocation of the current TTI is completed, until the uplink resources, which are available for data transmission, corresponding to all TTIs scheduled this time are allocated or data of each logical channel is transmitted.
Optionally, the scheduling unit 14 is configured to, if the data amount that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is higher than the guaranteed data amount a of the logical channel with the highest priority in the current scheduling1And then, allocating the remaining uplink resources of the first TTI to the logic channel with the second highest priority until the uplink resources corresponding to the first TTI are allocated.
Optionally, the scheduling unit 14 is configured to, if the data amount that can be transmitted by the uplink resource corresponding to the first TTI in this scheduling is lower than the guaranteed data amount a of the highest priority logical channel in this scheduling1In the second TTI, the uplink resource needed by the residual guaranteed data volume of the current scheduling is preferentially distributed to the logic channel with the highest priority, and then the guaranteed data volume A of the current scheduling is distributed to the logic channel with the next highest priority2Required uplink resources.
The embodiment of the invention also provides the user equipment, which comprises the uplink logical channel scheduling device.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (13)

1. An uplink logical channel scheduling method, comprising:
calculating the duration of the scheduling according to the DCI sent by the base station;
determining uplink resources which can be used for transmitting data and correspond to each TTI according to the UL grant sent by the base station;
calculating the guaranteed data volume of each logic channel in the current scheduling according to the duration of the current scheduling;
according to the priority of the logical channels from high to low, sequentially allocating the uplink resources required by the guaranteed data volume scheduled this time for each logical channel, and if the remaining uplink resources remain after the uplink resources required by the guaranteed data volume scheduled this time are allocated for each logical channel, sequentially allocating the remaining uplink resources to each logical channel to the maximum extent according to the descending order of the priority of the logical channels;
the calculating the duration of the current scheduling according to the DCI sent by the base station comprises: the duration of the scheduling is calculated according to the following formula:
the duration of the current scheduling is TTI multiplied by n; wherein n is the number of continuous TTIs of the UE of the uplink scheduling, and n is ≧ 2.
2. The method according to claim 1, wherein the calculating the guaranteed data amount of each logical channel in the current scheduling according to the duration of the current scheduling comprises: the guaranteed data volume of each logic channel scheduled at this time is calculated according to the following formula:
the guaranteed data volume Aj of the logical channel j scheduled at this time is initial Bj + PBR × duration; wherein j represents a logical channel, and j ≧ 1 and the larger j represents the lower priority of the corresponding logical channel; each logic channel j corresponds to a variable Bj, and when the logic channel is established, the Bj is initialized to 0; bj increases in steps PBR × TTI every TTI.
3. The method according to claim 2, wherein said allocating the uplink resources required for the guaranteed amount of data scheduled this time to each logical channel in turn according to the order of logical channel priority from high to low comprises: after the resource allocation of the current TTI is finished, allocating uplink resources of the next TTI in the scheduling range until all the logical channels are allocated to the uplink resources in the guaranteed data volume of the scheduling or the uplink resources which can be used for transmitting data and correspond to all the TTIs of the scheduling are completely allocated; for the logical channel served in the current round of resource allocation, the corresponding Aj needs to subtract the size of the MAC SDU corresponding to the logical channel, and the decreased Aj is used as the initial Bj of the next TTI after the current scheduling is finished.
4. The method of claim 3, wherein if there are remaining uplink resources after allocating the uplink resources required for the guaranteed amount of data scheduled for the current time to each logical channel, allocating the remaining uplink resources to the respective logical channels to the maximum extent in the descending order of logical channel priorities comprises: and after the resource allocation of the current TTI is finished, allocating the uplink resource of the next TTI in the scheduling range until the uplink resource which can be used for transmitting data and corresponds to all the TTIs scheduled at the time is allocated or the data of each logic channel is transmitted.
5. The method of claim 4, wherein if the amount of data that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is higher than the guaranteed data amount A1 of the logical channel with the highest priority in the current scheduling, the remaining uplink resources of the first TTI are allocated to the logical channel with the next highest priority until the uplink resource corresponding to the first TTI is completely allocated.
6. The method of claim 4, wherein if the amount of data that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is lower than the guaranteed data amount A1 of the highest priority logical channel in the current scheduling, the uplink resource required by the remaining guaranteed data amount in the current scheduling is preferentially allocated to the highest priority logical channel in the second TTI, and then the uplink resource required by the guaranteed data amount A2 in the current scheduling is allocated to the next highest priority logical channel.
7. An uplink logical channel scheduling apparatus, comprising:
the first calculating unit is used for calculating the duration of the current scheduling according to the DCI sent by the base station;
a determining unit, configured to determine, according to a UL grant sent by a base station, an uplink resource available for data transmission corresponding to each TTI;
the second calculation unit is used for calculating the guaranteed data volume of each logic channel in the current scheduling according to the duration of the current scheduling;
a scheduling unit, configured to sequentially allocate, according to a sequence from high to low priorities of logical channels, the uplink resources required for the guaranteed amount of data scheduled this time to each logical channel, and if remaining uplink resources remain after allocating, to each logical channel, the uplink resources required for the guaranteed amount of data scheduled this time, then sequentially allocate, to the greatest extent, the remaining uplink resources to each logical channel according to a sequence in which the priorities of the logical channels decrease;
the first calculating unit is configured to calculate the duration of the current scheduling according to the following formula: the duration of the current scheduling is TTI multiplied by n; wherein n is the number of continuous TTIs of the UE of the uplink scheduling, and n is ≧ 2.
8. The apparatus of claim 7, wherein the second calculating unit is configured to calculate the guaranteed data amount of each logical channel in the current scheduling according to the following formula: the guaranteed data volume Aj of the logical channel j scheduled at this time is initial Bj + PBR × duration; wherein j represents a logical channel, and j ≧ 1 and the larger j represents the lower priority of the corresponding logical channel; each logic channel j corresponds to a variable Bj, and when the logic channel is established, the Bj is initialized to 0; bj increases in steps PBR × TTI every TTI.
9. The apparatus of claim 8, wherein the scheduling unit is configured to, after allocating the uplink resource required for guaranteeing the data amount in the current scheduling for each logical channel, for a logical channel served in the current round of resource allocation, corresponding Aj needs to subtract a size of the MAC SDU corresponding to the logical channel, and use the decreased Aj as an initial Bj of a next TTI after the current scheduling is finished.
10. The apparatus according to claim 9, wherein the scheduling unit is configured to allocate uplink resources of a next TTI within the current scheduling range after the resources of the current TTI are allocated, until all uplink resources available for data transmission corresponding to all TTIs of the current scheduling are allocated or data of each logical channel is transmitted.
11. The apparatus of claim 10, wherein the scheduling unit is configured to, if the amount of data that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is higher than the guaranteed data amount a1 of the logical channel with the highest priority in the current scheduling, allocate the remaining uplink resources of the first TTI to the logical channel with the next highest priority until the uplink resource corresponding to the first TTI is completely allocated.
12. The apparatus of claim 10, wherein the scheduling unit is configured to, if the amount of data that can be transmitted by the uplink resource corresponding to the first TTI in the current scheduling is less than the guaranteed data amount a1 of the highest priority logical channel in the current scheduling, preferentially allocate, in the second TTI, the uplink resource required by the remaining guaranteed data amount in the current scheduling to the highest priority logical channel, and then allocate, in the second TTI, the uplink resource required by the guaranteed data amount a2 in the current scheduling to the next highest priority logical channel.
13. A user equipment, characterized in that the user equipment comprises the uplink logical channel scheduling apparatus according to any one of claims 7 to 12.
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 CN107920390A (en) 2018-04-17
CN107920390B true 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)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110475341B (en) * 2018-05-09 2022-05-17 大唐移动通信设备有限公司 Method and device for resource allocation
CN110831211B (en) * 2018-08-10 2021-11-23 展讯通信（上海）有限公司 Data uploading method and device, storage medium and user terminal
CN113747596A (en) * 2018-09-21 2021-12-03 华为技术有限公司 Wireless scheduling method and device
CN111294932B (en) * 2018-12-11 2022-08-16 北京紫光展锐通信技术有限公司 Method and device for scheduling logical channel and generating configuration information
CN111328138B (en) * 2018-12-13 2023-04-07 大唐移动通信设备有限公司 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
CN111294965A (en) 2019-01-11 2020-06-16 展讯通信（上海）有限公司 Uplink transmission resource selection method, terminal and storage medium
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
CN111586870B (en) * 2020-05-11 2022-02-18 无锡摩罗科技有限公司 Optimization method for transmitting RLC PDU data on multiple logical channels
CN116389272B (en) * 2023-04-11 2023-11-21 国家气象信息中心(中国气象局气象数据中心) 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 (4)

* 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

Also Published As

Publication number Publication date
CN107920390A (en) 2018-04-17

Similar Documents

Publication Publication Date Title
CN107920390B (en) Uplink logical channel scheduling method and device and user equipment
US10574402B2 (en) Station (STA), access point (AP) and method for aggregation of data packets for uplink transmission
CN110996391B (en) Resource allocation method and terminal
EP2634950B1 (en) Method and Apparatus for Power Headroom Reporting
US8050292B2 (en) Method of performing transmission and prioritization for radio link control packets for a medium access control layer of a wireless communications system
EP2023553B1 (en) Method and apparatus for performing random access procedure in a mobile communication system
US20190069313A1 (en) Method and apparatus for reporting buffer state by user equipment in communication system
EP2474192B1 (en) Methods and arrangements for allocating scheduling request resources in a wireless communication system
US8948082B2 (en) Method and apparatus or allocating resources to user equipments in a telecommunications system
EP2862402B1 (en) Systems and methods for prioritizing a ue in an uplink scheduler
CN109417516B (en) Transmission method and device without dynamic scheduling in mobile communication
US20120155416A1 (en) Method and evolved nodeb for semi-persistent scheduling reactivation
US20100272045A1 (en) Method for allocating uplink resources to logical channels in a wireless communication system and related communication device
EP3128796A1 (en) Method and device for triggering buffer state reporting bsr
JP6148635B2 (en) User equipment and uplink data transmission method
EP3285535A1 (en) Wireless terminal
EP3627933B1 (en) Communication method, terminal, and base station
US20160212761A1 (en) Method for transmitting uplink data, user equipment, and base station
JP2019525622A (en) System and method for uplink data scheduling for grant-free transmission
WO2013166670A1 (en) Method and device for configuring resources of uplink channel
US20160278111A1 (en) Service scheduling method and device
CN110324902A (en) Communication means, communication device and system
CN107113821A (en) The method and apparatus of transmitting uplink data
CN116437457A (en) Method and arrangement in a radio network
CN108322939B (en) Method and apparatus for wireless communication system supporting multiple physical layer methods

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