Uplink logic channel scheduling method and device and user equipment

A technology of logical channel and scheduling method, which is applied in the field of uplink logical channel scheduling method, device and user equipment, and can solve problems such as header overhead, and achieve the effect of reducing header overhead and reducing quantity

Active Publication Date: 2018-04-17
SPREADTRUM COMM (SHANGHAI) CO LTD
5 Cites 16 Cited by

AI-Extracted Technical Summary

Problems solved by technology

In this case, if the existing uplink logical channel scheduling...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Method used

The uplink logical channel scheduling method provided by the embodiment of the present invention calculates the duration of this scheduling according to the DCI sent by the base station, determines the uplink resources available for transmitting data corresponding to each TTI according to the UL grant sent by the base station, and according to the According to the duration of this scheduling, calculate the guaranteed data volume of each logical channel in this scheduling, and allocate the guaranteed data volume in this scheduling to each logical channel in order according to the order of logical channel priority from high to low For the required uplink resources, if there are still remaining uplink resources after allocating the uplink resources required for the guaranteed amount of data scheduled for this time for each logical channel, each logical channel shall be assigned in descending order of logical channel priority. Maximize the allocation of remaining uplink resources. Compared with the prior art, the present invention can concentrate and send the guaranteed data volumes of multiple TTIs of the same logical channel in the same TTI, reduce the number of generated MAC SDUs, and thereby reduce the header overhead of MAC PDU packets.
[0062...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Abstract

The invention provides an uplink logic channel scheduling method and device and user equipment. The method comprises the steps that the duration of current scheduling is calculated according to the DCI transmitted by a NodeB; the uplink resource corresponding to each TTI and capable of being used for data transmission is determined according to the UL grant transmitted by the NodeB; the guaranteeddata volume of each logic channel in current scheduling is calculated according to the duration of current scheduling; and the uplink resource required for the guaranteed data volume of current scheduling is allocated for each logic channel in turn according to the descending order of the priority of the logic channels, and the remaining uplink resource is allocated for each logic channel to thegreatest extent according to the descending order of the priority of the logic channels if there is remaining uplink resource after the uplink resource required for the guaranteed data volume of current scheduling is allocated for each logic channel. The guaranteed data volume of multiple TTI of the same logic channel can be transmitted in the same TTI in a centralized way so that the number of the generated MAC SDU can be reduced and the header overhead of the MAC PDU set packet can be reduced.

Application Domain

Technology Topic

Image

  • Uplink logic channel scheduling method and device and user equipment
  • Uplink logic channel scheduling method and device and user equipment
  • Uplink logic channel scheduling method and device and user equipment

Examples

  • Experimental program(1)

Example Embodiment

[0036] In order to make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments It is only a part of the embodiments of the present invention, not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.
[0037] The present invention provides an uplink logical channel scheduling method, such as figure 1 As shown, the method includes:
[0038] S11: Calculate the duration of this scheduling according to the DCI sent by the base station;
[0039] S12: Determine, according to the UL grant sent by the base station, the uplink resources corresponding to each TTI that can be used to transmit data;
[0040] S13: Calculate the guaranteed data volume of each logical channel in the current scheduling according to the duration of the current scheduling;
[0041] S14. According to the order of logical channel priority from high to low, each logical channel is allocated the uplink resources required for the guaranteed amount of data scheduled this time in turn, if each logical channel is allocated for the current scheduling If there are still remaining uplink resources after the uplink resources required to guarantee the amount of data, the remaining uplink resources are allocated to the maximum for each logical channel in the descending order of the logical channel priority.
[0042] The uplink logical channel scheduling method provided by the embodiment of the present invention calculates the duration of this scheduling according to the DCI sent by the base station, and determines the uplink resources corresponding to each TTI that can be used to transmit data according to the UL grant sent by the base station. Calculate the guaranteed data volume of each logical channel in this scheduling for the duration of the scheduling. According to the logical channel priority from high to low, each logical channel is assigned the amount of data required for the guaranteed data volume in this scheduling. Uplink resources, if there are still remaining uplink resources after the uplink resources required for the guaranteed data volume of this scheduling are allocated to each logical channel, the logical channel priority will be reduced to the maximum for each logical channel. Allocate the remaining uplink resources. Compared with the prior art, the present invention can concentrate the guaranteed data volume of multiple TTIs of the same logical channel for transmission in the same TTI, reduce the number of generated MAC SDUs, and thereby reduce the header overhead of the MAC PDU group packet.
[0043] Optionally, the calculating the duration of the current scheduling according to the DCI sent by the base station includes: calculating the duration of the current scheduling according to the following formula: the duration of the current scheduling duration=TTI×n; where n is the current uplink The number of consecutive TTIs for scheduling the UE, and n≧1.
[0044] Optionally, the size of the uplink resource determines the amount of data that can be transmitted.
[0045] Optionally, the calculating the guaranteed data amount of each logical channel in the current scheduling according to the duration of the current scheduling includes: calculating the guaranteed data amount of each logical channel in the current scheduling according to the following formula: logical channel j Guaranteed data volume A in this scheduling j = Initial B j +PBR×duration; where j represents a logical channel, j≧1 and the larger j indicates the lower the priority of the corresponding logical channel; each logical channel j corresponds to a variable B j , When the logical channel is established, B j Initialize to 0; B j In each TTI, PBR×TTI is increased in steps.
[0046] Optionally, the allocating the uplink resources required for the guaranteed data volume scheduled this time for each logical channel in the order of logical channel priority from high to low includes: after the current TTI resources are allocated The allocation of the uplink resources of the next TTI within the scope of this scheduling until the guaranteed data volume of all logical channels in this scheduling is allocated to the uplink resources or the uplink resources corresponding to all TTIs scheduled this time that can be used to transmit data are allocated; For the logical channel served in this round of resource allocation, the corresponding A j The size of the MAC SDU corresponding to the logical channel needs to be subtracted, and the reduced A j As the initial B of the next TTI after the end of this scheduling j.
[0047] Optionally, if there are still remaining uplink resources after the uplink resources required for the guaranteed data volume of this scheduling are allocated to each logical channel, the logical channel priority is the largest in the order of decreasing priority of each logical channel. Allocating the remaining uplink resources to a limited extent includes: allocating the remaining uplink resources to the highest priority channel to the greatest extent, and if there are resources remaining after the highest logical channel data is sent, then allocating the remaining resources to the next highest priority channel. channel.
[0048] Optionally, if there are still remaining uplink resources after the uplink resources required for the guaranteed data volume of this scheduling are allocated to each logical channel, the logical channel priority is the largest in the order of decreasing logical channel priority. Allocating the remaining uplink resources to a limited extent includes: after the resources of the current TTI are allocated, the uplink resources of the next TTI within the scope of this scheduling are allocated, until the uplink resources corresponding to all TTIs scheduled for this time that can be used to transmit data are allocated or The data of each logical channel is sent.
[0049] Optionally, if the amount of data that can be transmitted on the uplink resource corresponding to the first TTI scheduled this time is higher than the guaranteed data amount A of the logical channel with the highest priority this time scheduling 1 , The remaining uplink resources of the first TTI are allocated to the logical channel with the second highest priority until the uplink resources corresponding to the first TTI are allocated.
[0050] Optionally, if the amount of data that can be transmitted on the uplink resource corresponding to the first TTI scheduled this time is lower than the guaranteed data amount A of the logical channel with the highest priority this time scheduling 1 , Then in the second TTI, the highest priority logical channel is assigned the remaining uplink resources required for this scheduling to ensure the amount of data, and then the second highest priority logical channel is allocated the guaranteed data amount A of this scheduling. 2 The required uplink resources.
[0051] Specifically, suppose that the UE has 3 logical channels (respectively 1, 2, and 3), and the priority is sorted from high to low: logical channel 1, logical channel 2, logical channel 3; the PBR configured for each logical channel is 128kB/second, that is, the guaranteed amount of data within 1ms of each logical channel is at least 128byte; the UE receives DCI and schedules PUSCH transmission in subframe 4 and subframe 5 of the UE, and both subframes can send 1000byte data; suppose each The data to be sent on the 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 in the embodiment of the present invention.
[0052] The steps for logical channel scheduling according to the prior art are as follows: In the first TTI, the UE first allocates 128-byte uplink resources for the logical channel 1 in the first subframe (considering the MAC header overhead, the actual resources It should be slightly larger than 128 bytes, and the following is similar), and then allocate the uplink resource with the guaranteed data volume of the channel to the logical channel 2 and the uplink resource with the guaranteed data volume of the logical channel 3 on the channel; If there are resources remaining in one subframe and the amount of data to be sent in logical channel 1 is sufficient, the remaining resources in the first subframe are allocated to logical channel 1 first; in the second TTI, the UE schedules three in the second subframe. The method for each logical channel is the same as in the first subframe.
[0053] According to the existing logical channel scheduling method, the MAC PDU of two subframes generated by the UE is as follows: figure 2 As shown, it can be seen that there are 6 MAC SDUs in total, which have more header overhead.
[0054] Optionally, the current TTI duration is 1ms, and the UE scheduled subframe length is 1ms; in the future, the protocol will support TTIs of different lengths (for example, the duration is 0.5ms), and the content of the present invention is also applicable.
[0055] The steps of the logical channel scheduling method provided by the embodiment of the present invention are as follows: In the first TTI, the UE first allocates the logical channel 1 to the uplink resource of the guaranteed data amount in the current scheduling in the first subframe (the guaranteed data amount is 128*2=256byte, considering the MAC header overhead, the actual resource should be slightly larger than 256 bytes, the following is similar), and then the logical channel 2 is allocated the uplink resource of the guaranteed data size in this scheduling (the guaranteed data size is 128 *2=256byte), and then allocate uplink resources with guaranteed data size for this scheduling to logical channel 3 (the guaranteed data size is 128*2=256byte); at this time, there are resources remaining in the first subframe and logical If the amount of data to be sent on channel 1 is sufficient, the remaining resources of the first subframe are allocated to logical channel 1 first; in the second TTI, the amount of data to be sent on logical channel 1 is sufficient, in descending order of logical channel priority , The UE allocates all the uplink resources of the second subframe to logical channel 1.
[0056] The MAC PDU generated according to the method provided by the embodiment of the present invention is as follows: image 3 As shown, there are 4 MAC SDUs in total, the number is small, and the header overhead of the MAC PDU group packet is small.
[0057] The embodiment of the present invention also provides an uplink logical channel scheduling device, such as Figure 4 As shown, the device includes:
[0058] The first calculation unit 11 is configured to calculate the duration of this scheduling according to the DCI sent by the base station;
[0059] The determining unit 12 is configured to determine the uplink resources that can be used to transmit data corresponding to each TTI according to the UL grant sent by the base station;
[0060] The second calculation unit 13 is configured to calculate the guaranteed data amount of each logical channel in the current scheduling according to the duration of the current scheduling;
[0061] The scheduling unit 14 is configured to sequentially allocate the uplink resources required for the guaranteed data volume scheduled this time to each logical channel in the order of logical channel priority from high to low. If each logical channel is allocated the If there are still remaining uplink resources after the uplink resources required for the guaranteed data volume scheduled this time, the remaining uplink resources are allocated to the maximum for each logical channel in the descending order of the logical channel priority.
[0062] The uplink logical channel scheduling apparatus provided by the embodiment of the present invention calculates the duration of this scheduling according to the DCI sent by the base station, and determines the uplink resources corresponding to each TTI that can be used to transmit data according to the UL grant sent by the base station. Calculate the guaranteed data volume of each logical channel in this scheduling for the duration of the scheduling. According to the logical channel priority from high to low, each logical channel is assigned the amount of data required for the guaranteed data volume in this scheduling. Uplink resources, if there are still remaining uplink resources after the uplink resources required for the guaranteed data volume of this scheduling are allocated to each logical channel, the logical channel priority will be reduced to the maximum for each logical channel. Allocate the remaining uplink resources. Compared with the prior art, the present invention can concentrate the guaranteed data volume of multiple TTIs of the same logical channel for transmission in the same TTI, reduce the number of generated MAC SDUs, and thereby reduce the header overhead of the MAC PDU group packet.
[0063] Optionally, the first calculation unit 11 is configured to calculate the duration of the current scheduling according to the following formula: duration of the current scheduling duration=TTI×n; where n is the continuous TTI of the current uplink scheduling UE Number, and n≧1.
[0064] Optionally, the size of the uplink resource determines the amount of data that can be transmitted.
[0065] Optionally, the second calculation unit 13 is configured to calculate the guaranteed data volume of each logical channel in the current scheduling according to the following formula: the guaranteed data volume A of the logical channel j in the current scheduling j = Initial B j +PBR×duration; where j represents a logical channel, j≧1 and the larger j indicates the lower the priority of the corresponding logical channel; each logical channel j corresponds to a variable B j , When the logical channel is established, B j Initialize to 0; B j In each TTI, PBR×TTI is increased in steps.
[0066] Optionally, the scheduling unit 14 is configured to, if there are still remaining uplink resources after the uplink resources required for the guaranteed data volume of this scheduling are allocated for each logical channel, then the remaining uplink resources Allocate to the channel with the highest priority to the maximum. If there are resources remaining after the data of the highest logical channel is sent, the remaining resources are allocated to the channel with the second highest priority.
[0067] Optionally, the scheduling unit 14 is configured to allocate, for each logical channel, the uplink resources required for the guaranteed data volume of this scheduling, and for the logical channels served in this round of resource allocation, the corresponding A j The size of the MAC SDU corresponding to the logical channel needs to be subtracted, and the reduced A j As the initial B of the next TTI after the end of this scheduling j.
[0068] Optionally, the scheduling unit 14 is configured to allocate the uplink resources of the next TTI within the scope of this scheduling after the resources of the current TTI are allocated, until the uplink resources corresponding to all TTIs scheduled this time that can be used to transmit data Allocation is complete or the data of each logical channel is transmitted.
[0069] Optionally, the scheduling unit 14 is configured to, if the amount of data that can be transmitted on the uplink resource corresponding to the first TTI scheduled this time is higher than the guaranteed data amount A of the logical channel with the highest priority this time scheduling 1 At this time, the remaining uplink resources of the first TTI are allocated to the next highest priority logical channel until the uplink resources corresponding to the first TTI are allocated.
[0070] Optionally, the scheduling unit 14 is configured to, if the amount of data that can be transmitted in the uplink resource corresponding to the first TTI in this scheduling is lower than the guaranteed data amount A of the logical channel with the highest priority in this scheduling 1 In the second TTI, the highest priority logical channel is allocated the remaining uplink resources required for this scheduling to ensure the data volume, and then the second highest priority logical channel is allocated the guaranteed data volume A of this scheduling. 2 The required uplink resources.
[0071] An embodiment of the present invention also provides a user equipment, and the user equipment includes the foregoing uplink logical channel scheduling apparatus.
[0072] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing relevant hardware through a computer program. The program can be stored in a computer readable storage medium. During execution, it may include the procedures of the above-mentioned method embodiments. Wherein, the storage medium may be a magnetic disk, an optical disc, a read-only memory (Read-Only Memory, ROM), or a random access memory (Random Access Memory, RAM), etc.
[0073] The above are only specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention. All should be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

no PUM

Description & Claims & Application Information

We can also present the details of the Description, Claims and Application information to help users get a comprehensive understanding of the technical details of the patent, such as background art, summary of invention, brief description of drawings, description of embodiments, and other original content. On the other hand, users can also determine the specific scope of protection of the technology through the list of claims; as well as understand the changes in the life cycle of the technology with the presentation of the patent timeline. Login to view more.
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Similar technology patents

Air-conditioning system for motor vehicle

InactiveUS20050087332A1Comfortable air-conditioning performanceReduce in quantityAir-treating devicesRailway heating/coolingTruckEvaporator
Owner:DENSO CORP

Method and device for sending and receiving data

ActiveCN107645747AReduce complexityReduce header overheadNetwork traffic/resource managementHigh rateProtocol data unit
Owner:DATANG MOBILE COMM EQUIP CO LTD

Classification and recommendation of technical efficacy words

  • Reduce in quantity
  • Reduce header overhead

Fused Protein Composition

InactiveUS20080241884A1Strong cytotoxicityReduce in quantityAntibacterial agentsPeptide/protein ingredientsFucoseDrug
Owner:KYOWA HAKKO KIRIN CO LTD

Method and apparatus for allocating erasure coded data to disk storage

ActiveUS20130132800A1Reduce in quantityError correction/detection using block codesStatic storageDisk storageData chunk
Owner:HEWLETT-PACKARD ENTERPRISE DEV LP

Method and device for sending and receiving data

ActiveCN107645747AReduce complexityReduce header overheadNetwork traffic/resource managementHigh rateProtocol data unit
Owner:DATANG MOBILE COMM EQUIP CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products