Data grouping method and device
A technology for grouping and data, applied in the field of communication, can solve the problems of low speed and efficiency of grouping, waste of address space, etc., to improve the speed and efficiency of grouping, avoid wasting of address space, and reduce CPU load.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0018] refer to figure 1 , shows a flow chart of steps of a method for grouping data according to Embodiment 1 of the present invention.
[0019] The data package method of the present embodiment comprises the following steps:
[0020] Step S102: determining the RB of the data to be sent is organizing the data to be sent into UL grant resources according to the SDU length vector corresponding to the RB.
[0021] Wherein, the elements in the SDU length vector are respectively used to identify the segment length of each SDU of the RB.
[0022] According to the SDU length vector corresponding to the RB, the data to be sent by the RB is organized into UL grant resources. Except for the last SDU, the actual data length in other SDUs is the same as the SDU segment length, that is, as long as the SDU segment If the length is determined, the actual data length in the corresponding SDU is determined; the actual data length in the last SDU may be less than or equal to the SDU segment ...
Embodiment 2
[0037] refer to figure 2 , shows a flow chart of steps of a method for grouping data according to Embodiment 2 of the present invention.
[0038] The data package method of the present embodiment comprises the following steps:
[0039] Step S202: the scheduler allocates UL grant resources for RBs with Bj>0.
[0040] In this embodiment, the technical solution of the present invention is described in detail by taking the MAC layer scheduler as an example for execution.
[0041] The resource allocation scheme in this embodiment is based on the basic framework of two rounds of scheduling. The first round of scheduling is aimed at the PBR result Bj. For RBs with Bj>0, the ULgrant resources are allocated according to the priority order of the RBs according to the Bj result and the SDU length vector. to each RB. If all channels are satisfied before the ULgrant resources are exhausted, the second round of scheduling can be entered. The second round of scheduling will allocate the...
Embodiment 3
[0072] refer to image 3 , shows a flow chart of steps of a method for grouping data according to Embodiment 3 of the present invention.
[0073] This embodiment is still based on the basic framework of two-round scheduling, and the data grouping method of this embodiment is described from the aspects of two-round scheduling and BUFFER zero copy.
[0074] The data package method of the present embodiment comprises the following steps:
[0075] Step S302: the MAC scheduler performs a first round of scheduling on all RBs with Bj greater than 0.
[0076] This step is executed when the UL grant authorization notification arrives at the UE. For all RBs with Bj greater than 0, UL grant resources are allocated in the order of priority (if the same priority is in order of ID). The ULgrant authorization length Grant obtained by each RB Step1 It is: in the SDU vector, the integer value is rounded up from Bj, and the remaining ULgrant is Ul rem The minimum value in . At the same tim...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More