A method, apparatus, device and readable storage medium for determining a logical channel group

CN117769040BActive Publication Date: 2026-09-25PURPLE MOUNTAIN LAB
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202311665090.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-12-05
Publication Date
2026-09-25
Estimated Expiration
2043-12-05

AI Technical Summary

Technical Problem

[0003]有鉴于此,本发明的目的在于提供了一种逻辑信道组确定方法、装置、设备及可读存储介质,解决了现有技术中根据优先级权重确定逻辑信道组准确性较低的技术问题

Benefits of technology

[0042]可见,本发明通过确定逻辑信道组类型;当逻辑信道组类型是信令级别类型时,根据信令第一级固定常数与信令第二级调度时延确定信令优先级权重;其中,信令第一级固定常数是所有逻辑信道组中最大的第一级固定常数;当逻辑信道组类型是GBR类型时,根据GBR令牌桶状态利用小于信令优先级权重的GBR固定优先级权重,或者利用Non-GBR第一级固定常数和PF算法确定GBR优先级权重,或者利用GBR第一级固定常数和GBR第二级调度时延确定GBR优先级权重;当逻辑信道组类型是Non-GBR类型时,根据PBR令牌桶状态利用小于信令优先级权重的Non-GBR固定优先级权重,或者利用GBR第一级固定常数和Non-GBR第二级调度时延确定Non-GBR优先级权重,或者利用Non-GBR第一级固定常数和PF算法确定Non-GBR优先级权重;其中,Non-GBR第一级固定常数是所有逻辑信道中最小的第一级固定常数;根据信令优先级权重、GBR优先级权重和Non-GBR优先级权重确定目标逻辑信道。和当前每个类型的LCG的优先级是固定的,并不会因为其他条件的变化而变化相比,本申请中由于各种类型的逻辑信道组类型的优先级权重确定方式与调度时延相关,故本申请中的每个逻辑信道组的优先级是会动态变化的,可以提高优先级权重确定的准确性,由于各个逻辑信道优先级权重确定更为准确,故可以提高后续逻辑信道选择的准确性。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117769040B_ABST
    Figure CN117769040B_ABST
Patent Text Reader

Abstract

The application discloses a kind of logical channel group determination method, device, equipment and readable storage medium, applied to mobile communication technical field, comprising: when is signaling level type, according to signaling first level fixed constant and signaling second level scheduling delay determine signaling priority weight;When it is GBR type, using GBR fixed priority weight, or using Non-GBR first level fixed constant and PF algorithm, or using GBR first level fixed constant and GBR second level scheduling delay determination GBR priority weight;When it is Non-GBR type, using Non-GBR fixed priority weight, or using GBR first level fixed constant Non-GBR second level scheduling delay, or using Non-GBR first level fixed constant and PF algorithm determination.This application flexible configuration priority, avoid the priority relationship unchangeable, improve the flexibility and accuracy of logical channel group according to priority weight determination.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of mobile communication technology, and in particular to a method, apparatus, device, and readable storage medium for determining logical channel groups. Background Technology

[0002] In LTE (Long Term Evolution) systems, the main purpose of UE (User Equipment) priority management is to determine the priority of resource allocation for different UEs based on the QoS (Quality of Service) of each UE's internal LCG (Logical Channel Group), with higher-priority UEs receiving resources first. UE priority management is reflected in the uplink scheduling process, specifically in logical channel group priority processing to ensure reasonable resource allocation between different UEs and between different logical channel groups within a UE. Currently, the main method used for calculating resource scheduling priority weights is to use fixed or QCI (QoS Class Identifier) ​​configuration weights to map priorities for different types of LCGs. Since the priority of each LCG type is fixed, there is a technical problem of inaccurate determination of logical channel groups in current resource allocation. Summary of the Invention

[0003] In view of this, the purpose of the present invention is to provide a logical channel group determination method, apparatus, device and readable storage medium, which solves the technical problem of low accuracy in determining logical channel groups based on priority weights in the prior art.

[0004] To address the aforementioned technical problems, this invention provides a method for determining logical channel groups, comprising:

[0005] Determine the logical channel group type;

[0006] When the logical channel group type is a signaling level type, the signaling priority weight is determined based on the first-level fixed constant of signaling and the second-level scheduling delay of signaling; wherein, the first-level fixed constant of signaling is the largest first-level fixed constant among all logical channel groups;

[0007] When the logical channel group type is GBR type, the GBR priority weight is determined according to the GBR token bucket state using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay.

[0008] When the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight; wherein, the Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels;

[0009] The target logical channel group is determined based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight.

[0010] Optionally, when the logical channel group type is a signaling level type, determining the signaling priority weight based on the fixed constant of the first signaling level and the scheduling delay of the second signaling level includes:

[0011] When the logical channel group type is the signaling level type, the signaling priority weight is determined by performing a logical sum or multiplication operation between the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling.

[0012] Optionally, when the logical channel group type is GBR type, determining the GBR priority weight based on the GBR token bucket state using a GBR fixed priority weight less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay, includes:

[0013] When the logical channel group type is the GBR type, determine the GBR token bucket state;

[0014] When the GBR token bucket is full, the GBR fixed priority weight is determined as the GBR priority weight;

[0015] When the GBR token bucket is less than 0, the GBR priority weight is determined by logical operation using the Non-GBR first-level fixed constant and the PF algorithm.

[0016] When the GBR token bucket is greater than or equal to 0, the GBR priority weight is determined by logical operation using the GBR first-level fixed constant and the GBR second-level scheduling delay.

[0017] Optionally, when the logical channel group type is Non-GBR, determining the Non-GBR priority weight based on the PBR token bucket state using a Non-GBR fixed priority weight less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight, includes:

[0018] When the logical channel group type is the Non-GBR type, determine the PBR token bucket state;

[0019] When the PBR token bucket is full, the Non-GBR fixed priority weight is directly determined as the Non-GBR priority weight;

[0020] When the PBR token bucket is greater than 0, logical operations are performed using the first-level fixed constant of GBR and the second-level scheduling delay of Non-GBR to determine the Non-GBR priority weight;

[0021] When the PBR token bucket is less than or equal to 0, logical operations are performed using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight.

[0022] Optionally, the PF algorithm includes an improved PF algorithm for looking up a two-dimensional array table.

[0023] Optionally, the step of obtaining the improved PF algorithm two-dimensional array lookup table includes:

[0024] Obtain the classic PF algorithm; wherein, the classic PF algorithm is

[0025]

[0026] TBSize represents the maximum number of bits that the UE can transmit under the current channel conditions; α represents the quality adjustment factor; n represents the number of time periods (TTIs); ScheduleThrpt represents the scheduler's authorized throughput; β represents the throughput; θ represents the smoothing factor; and TTI represents the time period. schedule This indicates the uplink and downlink logical channel group scheduling traffic;

[0027] The molecular part is simplified to α*log2(TBSize), a finite number of TBSizes are enumerated and a table is made, all log2(TBSize) are pre-calculated, and a two-dimensional array of molecules is constructed based on each TBSize and log2(TBSize);

[0028] The denominator is simplified to β*log2(ScheduleThrpt), and a two-dimensional array is constructed based on each ScheduleThrpt and log2(ScheduleThrpt) to determine the two-dimensional denominator array;

[0029] The improved PF algorithm two-dimensional array lookup table is constructed based on the numerator two-dimensional array and the denominator two-dimensional array.

[0030] Optionally, determining the target logical channel group based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight includes:

[0031] From all the signaling priority weights, all the GBR priority weights, and all the Non-GBR priority weights, the logical channel with the highest priority weight is determined as the target logical channel group, and resources are allocated accordingly.

[0032] The present invention also provides a logical channel group determination apparatus, comprising:

[0033] The logical channel group type determination module is used to determine the logical channel group type;

[0034] The signaling priority weight determination module is used to determine the signaling priority weight based on the first-level fixed constant and the second-level scheduling delay when the logical channel group type is a signaling level type; wherein, the first-level fixed constant is the largest first-level fixed constant among all logical channel groups;

[0035] The GBR priority weight determination module is used to determine the GBR priority weight based on the GBR token bucket state when the logical channel group type is GBR type, using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and PF algorithm, or using a GBR first-level fixed constant and GBR second-level scheduling delay.

[0036] The Non-GBR priority weight determination module is used to determine the Non-GBR priority weight based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm when the logical channel group type is Non-GBR. The Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels.

[0037] The target logical channel determination module is used to determine the target logical channel group based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight.

[0038] The present invention also provides a logical channel group determination device, comprising:

[0039] Memory, used to store computer programs;

[0040] A processor is used to implement the logical channel group determination method as described above when executing the computer program.

[0041] The present invention also provides a computer-readable storage medium storing computer-executable instructions, which, when loaded and executed by a processor, implement the logical channel group determination method described above.

[0042] As can be seen, this invention determines the logical channel group type; when the logical channel group type is a signaling level type, the signaling priority weight is determined based on the first-level fixed constant of signaling and the second-level scheduling delay of signaling; wherein, the first-level fixed constant of signaling is the largest first-level fixed constant among all logical channel groups; when the logical channel group type is a GBR type, the GBR priority weight is determined based on the GBR token bucket state using a GBR fixed priority weight smaller than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the second-level scheduling delay of GBR to determine the GBR priority weight. When the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using a GBR first-level fixed constant and a Non-GBR second-level scheduling delay, or using a Non-GBR first-level fixed constant and the PF algorithm. The Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels. The target logical channel is determined based on the signaling priority weight, GBR priority weight, and Non-GBR priority weight. Compared to the current method where the priority of each type of LCG is fixed and does not change due to other conditions, in this application, because the priority weight determination method for various types of logical channel groups is related to the scheduling delay, the priority of each logical channel group in this application changes dynamically, which can improve the accuracy of priority weight determination. Since the priority weight determination of each logical channel is more accurate, the accuracy of subsequent logical channel selection can be improved.

[0043] In addition, the present invention also provides a logical channel group determination device, apparatus, and readable storage medium, which also have the above-mentioned beneficial effects. Attached Figure Description

[0044] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0045] Figure 1 A flowchart of a logical channel group determination method provided in an embodiment of the present invention;

[0046] Figure 2 A flowchart illustrating a logical channel group determination method provided in an embodiment of the present invention;

[0047] Figure 3 This is a schematic diagram of the structure of a logic channel group determination device provided in an embodiment of the present invention;

[0048] Figure 4 This is a schematic diagram of the structure of a logical channel group determination device provided in an embodiment of the present invention. Detailed Implementation

[0049] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0050] Proportional Fairness (PF) scheduling fully utilizes the time-frequency characteristics of the channel to schedule users with better channel conditions as much as possible, and to schedule every user, effectively achieving a trade-off between throughput and fairness. It is a classic resource scheduling algorithm. In NR (New Radio) systems, the PF scheduling algorithm can establish a more scientific correlation with QoS (Quality of Service) and calculate more reasonable priority weights in a hierarchical manner. However, due to the large amount of computation and efficiency requirements, the fairness factor and traffic factor in actual systems are not dynamically adjustable.

[0051] Please refer to Figure 1 , Figure 1 A flowchart illustrating a logical channel group determination method provided in an embodiment of the present invention. The method may include:

[0052] S100, determine the logical channel group type.

[0053] In this embodiment, the logical channel group (LCG) type is determined when the scheduler receives a data scheduling request from the UE (User Equipment) and Qload > 0. Qload represents the size of the data packet for scheduling user data.

[0054] S101, when the logical channel group type is a signaling level type, the signaling priority weight is determined according to the first-level fixed constant of signaling and the second-level scheduling delay of signaling; wherein, the first-level fixed constant of signaling is the largest first-level fixed constant among all logical channel groups.

[0055] In this embodiment, the signaling level type refers to the signaling plane data sent and received at the radio air interface layer 3. The signaling data at this signaling level type can be one of Msg3 (fixed messages in mobile communication random access (UE)), SRB (messages containing resource requests), or QCI5 (primarily transmitting high-definition voice signals); or any combination of Msg3 (fixed messages in mobile communication random access (UE)), SRB (messages containing resource requests), and QCI5 (primarily transmitting high-definition voice signals). The 5G base station protocol stack is divided into three layers, including the L1 physical layer and the L2 / L3 higher-layer protocol stack software. L1 is layer one (PHY, physical layer), L2 is layer two (including Medium Access Control MAC, Radio Link Control RLC, Packet Data Convergence Protocol PDCP), and L3 is radio air interface layer three (RRC, Radio Resource Control layer, used by base stations in wireless networks for control and resource analysis information transmission). In this embodiment, the signaling level 2 scheduling delay refers to the difference between the last scheduling time of the UE and the current time. This embodiment does not limit the specific process of determining the signaling priority weight based on the first-level fixed constant and the second-level scheduling delay. For example, the signaling priority weight can be determined by performing logical operations on the first-level fixed constant and the second-level scheduling delay; this embodiment does not limit the specific logical operations, for example, the signaling priority weight can be determined by multiplying the first-level fixed constant and the second-level scheduling delay; or the signaling priority weight can be determined by adding the first-level fixed constant and the second-level scheduling delay. In this embodiment, the first-level fixed constant is greater than the first-level fixed constant of GBR (Guaranteed Bit Rate) and the first-level fixed constant of Non-GBR (Non-Guaranteed Bit Rate).

[0056] It should be further explained that, in order to improve computational efficiency, the above-mentioned determination of signaling priority weights based on the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling when the logical channel group type is a signaling level type can include: determining the signaling priority weights by performing logical summation or multiplication operations using the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling. This embodiment directly applies the simplest summation or multiplication operations to determine the signaling priority weights, thus improving the efficiency of signaling priority weight determination.

[0057] S102, when the logical channel group type is GBR type, the GBR priority weight is determined according to the GBR token bucket state using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay.

[0058] In this embodiment, the scheduling delay represents the difference between the current scheduling and the previous scheduling time. When the logical channel group type is GBR, this embodiment needs to combine the GBR token bucket state to determine the calculation method for the GBR priority weight. This embodiment does not limit the specific GBR token bucket state. For example, the GBR token bucket state can be full; or the GBR token bucket state can be less than 0; or in this embodiment, the GBR token bucket state can be greater than or equal to 0. In this embodiment, the GBR fixed priority weight can be directly used as the GBR priority weight. The GBR fixed priority weight in this embodiment is a weight smaller than the signaling priority weight, and larger than the priority weights calculated under both GBR and Non-GBR service types. The GBR type refers to the priority weight calculated under the GBR service type, determined using the GBR first-level fixed constant and the GBR second-level scheduling delay. The Non-GBR service type refers to the priority weight calculated under the Non-GBR service type, i.e., determined using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay. It's understandable that the fixed priority weight for GBR is set relatively high to ensure that GBR services with this weight are scheduled first. However, in reality, GBR priority calculation is positively correlated with latency and has no upper limit. It cannot be guaranteed that the fixed priority will be greater than the priority calculated for all GBR types. Therefore, the fixed priority weight for GBR is greater than the priority weight calculated for most GBR and Non-GBR service types.

[0059] It should be further explained that, when the logical channel group type is GBR, the above-mentioned methods for determining the GBR priority weight based on the GBR token bucket state using a fixed GBR priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay, may include:

[0060] S1021, when the logical channel group type is GBR type, determine the GBR token bucket state;

[0061] S1022, When the GBR token bucket is full, the GBR fixed priority weight is determined as the GBR priority weight;

[0062] S1023, when the GBR token bucket is less than 0, the non-GBR first-level fixed constant and PF algorithm are used to perform logical operations to determine the GBR priority weight;

[0063] S1024, when the GBR token bucket is greater than or equal to 0, logical operations are performed using the first-level fixed constant of GBR and the second-level scheduling delay of GBR to determine the GBR priority weight.

[0064] This embodiment illustrates how to determine the GBR priority weight under different GBR token bucket states. It can be understood that when the GBR token bucket is full, it indicates that the GBR token bucket has not been used for too long; therefore, it is directly assigned a fixed GBR priority weight to increase its chance of being invoked. In this embodiment, the fixed GBR priority weight is a weight smaller than the signaling priority weight, but larger than the priority weights calculated for both GBR and Non-GBR service types. When the GBR token bucket is negative (less than 0), it indicates that scheduling is too frequent; therefore, the first-level fixed constant of GBR needs to be reduced to the first-level fixed constant of Non-GBR to decrease its probability of being selected. When the GBR token bucket is greater than or equal to 0, the GBR priority weight is determined by logical operations using the first-level fixed constant of GBR and the second-level scheduling delay of GBR.

[0065] S103, when the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight; wherein, the Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels.

[0066] In this embodiment, the PBR (Prioritized Bit Rate) token bucket state can be full; or the PBR token bucket state can be less than 0; or the PBR token bucket state can be greater than or equal to 0. There are three ways to calculate the Non-GBR priority weight in this embodiment. First, when the token bucket is full, the Non-GBR fixed priority weight is used as the Non-GBR priority weight. This Non-GBR fixed priority weight can be the same as the GBR fixed priority weight, a weight smaller than the signaling priority weight, and a fixed value larger than the priority weights calculated under both GBR and Non-GBR service types. Second, when the PBR token bucket is greater than 0, logical operations are performed using the first-level fixed constant of GBR and the second-level scheduling delay of Non-GBR to determine the Non-GBR priority weight; the logical operation in this embodiment can be a logical AND operation. Third, when the PBR token bucket is less than or equal to 0, logical operations are performed using the first-level fixed constant of Non-GBR and the PF algorithm to determine the Non-GBR priority weight. The first-level fixed constant of Non-GBR is less than the first-level fixed constant of signaling, and also less than the first-level fixed constant of GBR.

[0067] It should be further explained that, when the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using a GBR first-level fixed constant and a Non-GBR second-level scheduling delay, or using a Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight, which may include:

[0068] S1031, when the logical channel group type is the Non-GBR type, determine the PBR token bucket state;

[0069] S1032, when the PBR token bucket is full, the Non-GBR fixed priority weight is directly determined as the Non-GBR priority weight;

[0070] S1033, when the PBR token bucket is greater than 0, logical operations are performed using the first level fixed constant of GBR and the second level scheduling delay of Non-GBR to determine the Non-GBR priority weight;

[0071] S1034, when the PBR token bucket is less than or equal to 0, logical operations are performed using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight.

[0072] In this embodiment, the Non-GBR fixed priority weight can be the same as the GBR fixed priority weight. To increase the probability of being invoked, the Non-GBR priority weight is directly assigned. If the PBR token bucket is greater than 0, meaning the priority guarantee bit rate of the Non-GBR service is not met, the calculation weight of the Non-GBR service type is increased to that of the GBR type. That is, the first level is configured with a fixed constant of the first level of GBR, and the second level is calculated using latency. The logical operations in this embodiment can be consistent with the logical operations in the signaling type. This embodiment determines different Non-GBR priority weight calculation methods under various conditions. Compared with the current method of using only one method for calculation, the accuracy of determining the Non-GBR priority weight in this application is higher, thus making the priority selection of logical channel groups more reasonable and accurate.

[0073] It should be further noted that the above-mentioned PF algorithm, which improves computational efficiency, includes an improved PF algorithm for looking up tables in two-dimensional arrays.

[0074] The steps to obtain the improved PF algorithm's two-dimensional array lookup table can include:

[0075] Obtain the classic PF algorithm; where the classic PF algorithm is:

[0076]

[0077] ; TBSize represents the maximum number of bits that the UE can transmit under the current channel conditions; α represents the quality adjustment factor; n represents the number of time periods (TTIs); ScheduleThrpt represents the scheduler's authorized throughput; β represents the throughput; θ represents the smoothing factor; and TTI represents the time period. scheduleThis represents the uplink and downlink logical channel group scheduling traffic; n represents the number of TTIs; the numerator is simplified to α*log2(TBSize), a finite number of TBSizes are enumerated and tableted, all log2(TBSize) are pre-calculated, and a two-dimensional array of the numerator is constructed based on each TBSize and log2(TBSize); the denominator is reduced to log2(1+ScheduleThrpt^β), simplified to β*log2(ScheduleThrpt), and a two-dimensional array of the denominator is constructed based on each ScheduleThrpt and log2(ScheduleThrpt); an improved PF algorithm two-dimensional array lookup table is constructed based on the numerator and denominator two-dimensional arrays. The bearer is the transmission channel entity established for the logical channel group. Uplink and downlink logical channel scheduling traffic includes uplink scheduling traffic and downlink scheduling traffic; downlink scheduling traffic uses downlink logical channel group scheduling traffic; uplink scheduling traffic uses uplink logical channel group traffic.

[0078] This embodiment considers using tabular processing of the formula to improve computational efficiency. The numerator can be simplified to α*log2(TBSize). A finite number of TBSizes are enumerated and tabulated, and all log2(TBSize) are pre-calculated. Real-time computation can obtain the result by looking up the table based on the input TBSize. Space complexity: O(NumOfTBSize), TBSize only needs to be taken according to the maximum number of PRBs (Physical Resource Blocks). The denominator is tabulated, and the space complexity is O(NumOfScheduleThrpt*NumOfβ). First, it needs to be proven that ScheduleThrpt is a finite variable, and then log2(1+ScheduleThrpt^β) can be obtained by looking up the table based on the pre-made two-dimensional array. When each slot is scheduled according to the maximum MaxTBSize, ScheduleThrpt can reach its maximum value.

[0079] When N=1, ScheduleThrpt=θ*MaxTBSize;

[0080] When N=2, ScheduleThrpt = (1-θ)*θ*MaxTBSize + θ*MaxTBSize = θ*MaxTBSize*[(1-θ)^(2-1)+1]; therefore, the general expression of ScheduleThrpt is: ScheduleThrpt = θ*MaxTBSize*[(1-θ)^(n-1) + (1-θ)^(n-2) + ... + (1-θ)^(2-1)+1]; which is the sum of a geometric sequence with a common ratio of (1-θ). Simplifying, we get: ScheduleThrpt = MaxTBSize*[1-(1-θ)^n]. N is the specific value of n in the classic PF algorithm, that is, the time (cycle) difference between two scheduling times.

[0081] As n approaches positive infinity, ScheduleThrpt = MaxTBSize. Therefore, the range of ScheduleThrpt is [0, MaxTBSize]. It's easy to see that MaxTBSize is 319501 under 5G NR SCS 30kHz 100M bandwidth. The step size depends on the required precision. The precision of α and β can be set to 0.1, with a range of {0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1}. Thus, the calculation of the PF formula is transformed into finding the numerator by looking up α and TBSize in a two-dimensional array, and the denominator by looking up β and ScheduleThrpt in a two-dimensional array. W2 (second-level priority weight) is the difference between the numerator and denominator.

[0082] To test the impact of different values ​​of the channel quality adjustment factor α and throughput adjustment factor β on the PF algorithm calculation, a TM500 was used to simulate the service of two UEs. The mcs of UE1 was set to 13 and the mcs of UE2 was set to 3. One UE was scheduled for each TTI, and the number of times two UEs were scheduled for each TTI was counted.

[0083] When α = 0.1 and β = 0.1, UE1 has 9996 scheduling attempts and UE2 has 5996 scheduling attempts, with a ratio of approximately 63:37.

[0084] When α = 0.1 and β = 0.9, UE1 has 2680 scheduling attempts and UE2 has 11612 scheduling attempts, with a ratio of approximately 19:81.

[0085] When α = 0.9 and β = 0.1, UE1 has 6942 scheduling attempts and UE2 has 302 scheduling attempts, with a ratio of approximately 96:4.

[0086] The channel quality adjustment factor in this embodiment affects system throughput (it's better to keep the term "channel quality adjustment factor" here). A smaller α value indicates a smaller impact of channel quality on priority; in this case, UEs with good channel quality will receive less scheduling, thus reducing system throughput. The throughput adjustment factor in this embodiment also affects scheduling fairness (let's keep the term "throughput adjustment factor" for both). A smaller β value indicates a smaller impact of historical licensed throughput on priority. It's clear that when the throughput factor is larger, to ensure high throughput, UE1 with a large MCS (Modulation and Coding Policy Index) can obtain the vast majority of scheduling opportunities, while the PF algorithm also ensures that UE2 is not completely without scheduling. When the fairness factor is larger, to ensure that UE2 with a low MCS can achieve a relatively fair and equal traffic volume to UE1, UE2's scheduling opportunities are greatly increased, but this results in a loss of total system traffic. When the throughput factor and fairness factor are similar, fairness and system throughput fall between the two. To emphasize fairness or system traffic, this can be achieved simply by configuring the relative sizes of α and β. It's important to note that using a lookup table to simplify the classic Priority Factor (PF) algorithm can lead to negative results. Therefore, a factor needs to be added when calculating the W2 difference (numerator minus denominator) to prevent sign reversal and negative priority weights. The PF algorithm can be used to calculate the second-level priority weight (W2 here). The lookup table method uses the logarithm, transforming division into subtraction. Subtraction can result in negative numbers, affecting the relative comparison of priority results (sign reversal means a higher priority is actually lower in comparison). Therefore, adjusting the result with a factor ensures a positive outcome.

[0087] S014, determine the target logical channel group based on signaling priority weight, GBR priority weight and Non-GBR priority weight.

[0088] This embodiment does not limit the specific process of determining logical channel groups based on signaling priority weights, GBR priority weights, and Non-GBR priority weights. For example, the logical channel with the highest priority weight among all signaling priority weights, GBR priority weights, and Non-GBR priority weights can be directly determined as the target logical channel group, and resources can be allocated. Alternatively, this embodiment can iterate through each logical channel group according to the priority weights of signaling priority weights, GBR priority weights, and Non-GBR priority weights until resource allocation is completed.

[0089] The logical channel group determination method provided in this embodiment of the invention may include: S100, determining the logical channel group type; S101, when the logical channel group type is a signaling level type, determining the signaling priority weight based on the first-level fixed constant of signaling and the second-level scheduling delay of signaling; wherein, the first-level fixed constant of signaling is the largest first-level fixed constant among all logical channel groups; S102, when the logical channel group type is a GBR type, determining the GBR priority weight based on the GBR token bucket state using a GBR fixed priority weight smaller than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the second-level scheduling delay of GBR. S103. Determine the GBR priority weight; when the logical channel group type is Non-GBR, determine the Non-GBR priority weight based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm; wherein, the Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels; S104. Determine the target logical channel group based on the signaling priority weight, GBR priority weight, and Non-GBR priority weight. Unlike current methods where the priority of each type of LCG is fixed and does not change due to other conditions, this application dynamically changes the priority weight of each logical channel group because the priority weight determination method for various logical channel group types is related to the scheduling delay. This improves the accuracy of priority weight determination, thereby increasing the accuracy of logical channel group determination. Furthermore, logical summation / multiplication operations can be performed using the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling, improving the efficiency of logical operations. A method for calculating the priority weight corresponding to different GBR token bucket states is provided, improving the accuracy of GBR logical channel type priority weight determination. A method for calculating the priority weight corresponding to different Non-GBR token bucket states is also provided, improving the accuracy of Non-GBR logical channel type priority weight determination. The algorithm includes an improved PF algorithm with a two-dimensional array lookup table, using tabular processing of the formula to improve computational efficiency. Finally, the logical channel with the highest priority weight is selected for resource allocation, improving the accuracy of resource allocation.

[0090] For a clearer understanding of this invention, please refer to the following details. Figure 2 , Figure 2 A flowchart illustrating a logical channel group determination method provided in this embodiment of the invention may specifically include:

[0091] Step 1: When the scheduler receives a data scheduling request and the scheduling amount is greater than zero, it determines the priority calculation for the subject of the current TTI request scheduling.

[0092] Step 2: Determine the logical channel group type.

[0093] Step 3: When the logical channel group is signaling-level data, the signaling first-level priority factor is assigned a fixed constant; the signaling first-level priority factor is guaranteed to have an order of magnitude priority over GBR and Non-GBR types.

[0094] In this embodiment, the first-level signaling priority factor is the first-level signaling fixed constant mentioned above.

[0095] Step 4: Assign the second-level signaling priority factor the difference between the last UE scheduling time and the current time, and use the product of the first-level signaling priority factor and the second-level signaling priority factor as the signaling priority weight.

[0096] In this embodiment, the signaling level 2 priority factor is the signaling level 2 scheduling delay mentioned above.

[0097] Step 5: When the logical channel group is GBR type data, determine whether the GBR token bucket is full.

[0098] Step 6: When the token bucket is full, the GBR priority weight is directly assigned to the GBR fixed constant. The GBR fixed constant is a value that is smaller than the signaling-level priority weight but larger than the calculated GBR priority weight and the calculated Non-GBR priority weight.

[0099] In this embodiment, the GBR fixed constant is the GBR fixed priority weight mentioned above. The calculated GBR priority weight in this embodiment is obtained by performing a logical operation on the first-level GBR first priority factor (GBR first-level fixed constant) and the second-level GBR second priority (GBR second-level scheduling delay). Here, the first-level GBR priority factor is a fixed constant that is less than the signaling type's fixed constant and greater than the Non-GBR fixed constant, and the second-level GBR priority is the difference between the last scheduling time and the current scheduling time. In this embodiment, the original Non-GBR type priority weight is calculated by performing a logical operation on the first-level Non-GBR priority factor and the second-level Non-GBR second priority to obtain the Non-GBR priority weight. Here, the first-level Non-GBR priority factor is a fixed constant less than the first-level GBR priority factor, and the second-level Non-GBR priority is the difference between the last scheduling time and the current scheduling time.

[0100] Step 7: If the token bucket is negative, perform a logical multiplication operation using the Non-GBR first-level priority factor and the PF algorithm to determine the GBR priority weight; the Non-GBR first-level priority factor is the smallest priority factor among all logical channel groups.

[0101] Step 8: When the GBR token bucket is greater than or equal to 0, the GBR priority weight is determined by performing a logical multiplication operation using the GBR first-level priority factor and the GBR second-level scheduling delay.

[0102] Step 9: If the logical channel group is of type Non-GBR, determine whether the PBR is full.

[0103] Step 10: When the PBR token bucket is full, the Non-GBR priority weight is directly determined to be the Non-GBR fixed constant weight; wherein, the Non-GBR fixed constant weight is less than the signaling level priority weight.

[0104] Step 11: When the PBR token bucket is greater than 0, perform logical operations using the first-level priority factor of GBR and the second-level scheduling delay of Non-GBR to determine the Non-GBR priority weight.

[0105] Step 12: When the PBR token bucket is less than or equal to 0, perform logical operations using the Non-GBR first-level priority factor and the PF algorithm to determine the Non-GBR priority weight.

[0106] Step 13: Determine the target logical channel group based on the signaling priority weight, GBR priority weight, and Non-GBR priority weight.

[0107] In this embodiment of the invention, various priority weight calculation methods are associated with QoS (Quality of Service) configuration requirements and LCG (Logical Channel Group). Different calculation methods are used according to the QoS configuration (QoS can configure the weight of logical channel groups) and different LCG types. The architecture introduces a hierarchical calculation approach, and the priority factor calculation methods for GBR (Guaranteed Code Rate) and Non-GBR (Non-Guaranteed Code Rate) services can be flexibly changed. The final scheduling priority factor is obtained by multiplying the factors calculated at the two levels. If the priority of GBR services is required to be strictly higher than that of Non-GBR services, the first priority factor of GBR can be set much larger than the first priority factor of Non-GBR. If the emphasis is on ensuring that Non-GBR services have a chance to be scheduled, the first priority factor of Non-GBR and the first priority factor of GBR can be set to be closer in magnitude. Therefore, the priority weight determination method proposed in this embodiment of the invention has the following beneficial effects:

[0108] 1. Hierarchical design for priority weight calculation. The first priority factor of each logical channel group can be flexibly configured in conjunction with QCI / 5QI levels, making it convenient to set weights according to service type; the second priority factor of each logical channel group is calculated based on latency or PF algorithm, taking into account the difference between GBR / Non-GBR, as well as fairness and channel traffic considerations.

[0109] 2. When the GBR token bucket is oversatisfied (GBRtoken<0), the priority calculation method for GBR services is changed to calculate according to the Non-GBR service type, and the value of W1 of the GBR logical channel group is reduced to release some GBR resources for Non-GBR use; when the Non-GBR PBR token bucket (Non-GBR minimum guaranteed bit rate) is not satisfied (PBRtoken>0), the priority calculation method for Non-GBR services is changed to calculate according to the GBR service type, and some GBR resources are released to meet PBR requirements, making system resources more flexible. That is, under certain conditions, the priority of Non-GBR will be greater than the priority of GBR, and there is no gap between GBR and Non-GBR priorities.

[0110] (3) The use of table lookup method to replace real-time exponentiation, log and division operations greatly improves the computational efficiency of PF algorithm, and the fairness factor and flow factor of scheduling algorithm can be modified by configuration, thereby improving the flexibility of the system according to user needs.

[0111] The following describes a logical channel group determination device provided by an embodiment of the present invention. The logical channel group determination device described below can be referred to in correspondence with the logical channel group determination method described above.

[0112] Please refer to the details. Figure 3 , Figure 3 A schematic diagram of the logical channel group determination device provided in the embodiments of the present invention may include:

[0113] Logical channel group type determination module 100 is used to determine the logical channel group type;

[0114] The signaling priority weight determination module 200 is used to determine the signaling priority weight based on the first-level fixed constant and the second-level scheduling delay when the logical channel group type is a signaling level type; wherein, the first-level fixed constant is the largest first-level fixed constant among all logical channel groups;

[0115] The GBR priority weight determination module 300 is used to determine the GBR priority weight based on the GBR token bucket state when the logical channel group type is GBR type, using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and PF algorithm, or using a GBR first-level fixed constant and GBR second-level scheduling delay.

[0116] The Non-GBR priority weight determination module 400 is used to determine the Non-GBR priority weight based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm when the logical channel group type is Non-GBR. The Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels.

[0117] The target logical channel group determination module 500 is used to determine the target logical channel group based on the signaling priority weight, the GBR priority weight and the Non-GBR priority weight.

[0118] Furthermore, based on the above embodiments, the signaling priority weight determination module 200 may include:

[0119] The signaling priority weight determination unit is used to determine the signaling priority weight by performing a logical sum or multiplication operation between the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling when the logical channel group type is the signaling level type.

[0120] Furthermore, based on any of the above embodiments, the GBR priority weight determination module 300 may include:

[0121] The GBR token bucket state determination unit is used to determine the GBR token bucket state when the logical channel group type is the GBR type.

[0122] The first type of GBR priority weight determination unit is used to determine the fixed GBR priority weight as the GBR priority weight when the GBR token bucket is full.

[0123] The second type of GBR priority weight determination unit is used to determine the GBR priority weight by performing logical operations using the Non-GBR first-level fixed constant and the PF algorithm when the GBR token bucket is less than 0.

[0124] The third type of GBR priority weight determination unit is used to determine the GBR priority weight by performing logical operations using the first level fixed constant of GBR and the second level scheduling delay of GBR when the GBR token bucket is greater than or equal to 0.

[0125] Furthermore, based on any of the above embodiments, the Non-GBR priority weight determination module 400 may include:

[0126] The PBR token bucket state determination unit is used to determine the PBR token bucket state when the logical channel group type is the Non-GBR type.

[0127] The first type of Non-GBR priority weight determination unit is used to directly determine the Non-GBR fixed priority weight as the Non-GBR priority weight when the PBR token bucket is full.

[0128] The second type of Non-GBR priority weight determination unit is used to determine the Non-GBR priority weight by performing logical operations using the first level fixed constant of GBR and the second level scheduling delay of Non-GBR when the PBR token bucket is greater than 0.

[0129] The third type of Non-GBR priority weight determination unit is used to determine the Non-GBR priority weight by performing logical operations using the first-level fixed constant of Non-GBR and the PF algorithm when the PBR token bucket is less than or equal to 0.

[0130] Furthermore, based on any of the above embodiments, the PF algorithm in the above logical channel group determination device may include an improved PF algorithm two-dimensional array lookup table.

[0131] Furthermore, based on the above embodiments, the above-mentioned logical channel group determination device may include:

[0132] A classic PF algorithm acquisition module is used to acquire the classic PF algorithm; wherein, the classic PF algorithm is...

[0133]

[0134] TBSize represents the maximum number of bits that the UE can transmit under the current channel conditions; α represents the quality adjustment factor; n represents the number of time periods (TTIs); ScheduleThrpt represents the scheduler's authorized throughput; β represents the throughput; θ represents the smoothing factor; and TTI represents the time period. schedule This indicates the uplink and downlink logical channel group scheduling traffic;

[0135] The molecular part processing module is used to simplify the molecular part to α*log2(TBSize), enumerate a finite number of TBSize to make a table, pre-calculate all log2(TBSize), and construct a two-dimensional molecular array based on each TBSize and log2(TBSize);

[0136] The denominator processing module simplifies the denominator to β*log2(ScheduleThrpt) and constructs a two-dimensional array based on each ScheduleThrpt and log2(ScheduleThrpt) to determine the denominator two-dimensional array.

[0137] The table construction module is used to construct the improved PF algorithm two-dimensional array lookup table based on the numerator two-dimensional array and the denominator two-dimensional array.

[0138] Furthermore, based on any of the above embodiments, the target logical channel determination module 500 may include:

[0139] The logical channel determination module is used to determine the logical channel with the highest priority weight from all the signaling priority weights, all the GBR priority weights, and all the Non-GBR priority weights as the target logical channel group, and to allocate resources.

[0140] It should be noted that the order of the modules and units in the above-mentioned logical channel group determination device can be changed without affecting the logic.

[0141] The logical channel group determination apparatus provided in this embodiment of the invention may include: a logical channel group type determination module 100, used to determine the logical channel group type; a signaling priority weight determination module 200, used to determine the signaling priority weight based on a first-level fixed constant and a second-level scheduling delay when the logical channel group type is a signaling level type; wherein the first-level fixed constant is the largest first-level fixed constant among all logical channel groups; and a GBR priority weight determination module 300, used to determine the GBR priority weight based on the GBR token bucket state using a GBR fixed priority weight smaller than the signaling priority weight, or using a Non-GBR first-level fixed constant and a PF algorithm, or using a GBR first-level fixed constant and a GBR second-level scheduling delay when the logical channel group type is a GBR type. The GBR priority weight is described above; the Non-GBR priority weight determination module 400 is used to determine the Non-GBR priority weight based on the PBR token bucket state when the logical channel group type is Non-GBR, using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight; wherein, the Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels; the target logical channel group determination module 500 is used to determine the target logical channel group based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight. Unlike current methods where the priority of each type of LCG is fixed and does not change due to other conditions, this application dynamically changes the priority weight of each logical channel group because the priority weight determination method for various logical channel group types is related to the scheduling delay. This improves the accuracy of subsequent logical channel group determination. Furthermore, logical summation / multiplication operations can be performed using the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling, improving the efficiency of logical operations. A method for calculating the priority weight corresponding to different GBR token bucket states is provided, improving the accuracy of determining the priority weight of GBR logical channel types. A method for calculating the priority weight corresponding to different Non-GBR token bucket states is also provided, improving the accuracy of determining the priority weight of Non-GBR logical channel types. The algorithm includes an improved PF algorithm with a two-dimensional array lookup table, using tabular processing of the formula to improve computational efficiency. Finally, the logical channel with the highest priority weight is selected for resource allocation, improving the accuracy of resource allocation.

[0142] The following describes a logical channel group determination device provided by an embodiment of the present invention. The logical channel group determination device described below can be referred to in correspondence with the logical channel group determination method described above.

[0143] Please refer to Figure 4 , Figure 4 A schematic diagram of a logical channel group determination device provided in an embodiment of the present invention may include:

[0144] Memory 10 is used to store computer programs;

[0145] Processor 20 is used to execute computer programs to implement the above-described logical channel group determination method.

[0146] The memory 10, processor 20, and communication interface 30 all communicate with each other through the communication bus 40.

[0147] In this embodiment of the invention, the memory 10 is used to store one or more programs. The programs may include program code, which includes computer operation instructions. In this embodiment of the invention, the memory 10 may store programs for implementing the following functions:

[0148] Determine the logical channel group type;

[0149] When the logical channel group type is a signaling level type, the signaling priority weight is determined based on the first-level fixed constant and the second-level scheduling delay of the signaling; among them, the first-level fixed constant of the signaling is the largest first-level fixed constant among all logical channel groups;

[0150] When the logical channel group type is GBR, the GBR priority weight is determined based on the GBR token bucket state using a fixed GBR priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay.

[0151] When the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm; wherein, the Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels;

[0152] The target logical channel group is determined based on the signaling priority weight, GBR priority weight, and Non-GBR priority weight.

[0153] In one possible implementation, the memory 10 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and applications required for at least one function; and the data storage area may store data created during use.

[0154] Furthermore, memory 10 may include read-only memory and random access memory, providing instructions and data to the processor. A portion of the memory may also include NVRAM. The memory stores operating systems and operating instructions, executable modules, or data structures, or subsets thereof, or extended sets thereof, wherein the operating instructions may include various operating instructions for implementing various operations. The operating system may include various system programs for implementing various basic tasks and handling hardware-based tasks.

[0155] Processor 20 can be a central processing unit (CPU), an application-specific integrated circuit, a digital signal processor, a field-programmable gate array, or other programmable logic device. Processor 20 can be a microprocessor or any conventional processor. Processor 20 can call programs stored in memory 10.

[0156] The communication interface 30 can be an interface for the communication module, used to connect with other devices or systems.

[0157] Of course, it should be noted that, Figure 4 The structure shown does not constitute a limitation on the logical channel group determination device in the embodiments of the present invention. In practical applications, the logical channel group determination device may include more than Figure 4 More or fewer components as shown, or combinations of certain components.

[0158] The readable storage medium provided in the embodiments of the present invention is described below. The readable storage medium described below and the logical channel group determination method described above can be referred to in correspondence.

[0159] The present invention also provides a readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the above-described logical channel group determination method.

[0160] The readable storage medium may include various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0161] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the apparatus disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple; relevant parts can be referred to in the method section.

[0162] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0163] Finally, it should be noted that in this document, relationships such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article, or apparatus.

[0164] The present invention provides a detailed description of a logical channel group determination method, apparatus, device, and readable storage medium. Specific examples have been used to illustrate the principles and implementation methods of the present invention. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of the present invention. At the same time, for those skilled in the art, there will be changes in specific implementation methods and application scope based on the ideas of the present invention. Therefore, the content of this specification should not be construed as a limitation of the present invention.

Claims

1. A method for determining logical channel groups, characterized in that, include: Determine the logical channel group type; When the logical channel group type is a signaling level type, the signaling priority weight is determined based on the first-level fixed constant of signaling and the second-level scheduling delay of signaling; wherein, the first-level fixed constant of signaling is the largest first-level fixed constant among all logical channel groups; When the logical channel group type is GBR type, the GBR priority weight is determined according to the GBR token bucket state using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay. When the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight; wherein, the Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channel groups; The target logical channel group is determined based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight.

2. The logical channel group determination method according to claim 1, characterized in that, When the logical channel group type is a signaling level type, the signaling priority weight is determined based on the fixed constant of the first level of signaling and the scheduling delay of the second level of signaling, including: When the logical channel group type is the signaling level type, the signaling priority weight is determined by performing logical summation, or multiplication operations on the first-level signaling fixed constant and the second-level signaling scheduling delay.

3. The logical channel group determination method according to claim 1, characterized in that, When the logical channel group type is GBR type, the GBR priority weight is determined based on the GBR token bucket state using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and the PF algorithm, or using a GBR first-level fixed constant and the GBR second-level scheduling delay, including: When the logical channel group type is the GBR type, determine the GBR token bucket state; When the GBR token bucket is full, the GBR fixed priority weight is determined as the GBR priority weight; When the GBR token bucket is less than 0, the GBR priority weight is determined by logical operation using the Non-GBR first-level fixed constant and the PF algorithm. When the GBR token bucket is greater than or equal to 0, the GBR priority weight is determined by logical operation using the GBR first-level fixed constant and the GBR second-level scheduling delay.

4. The logical channel group determination method according to claim 1, characterized in that, When the logical channel group type is Non-GBR, the Non-GBR priority weight is determined based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight, including: When the logical channel group type is the Non-GBR type, determine the PBR token bucket state; When the PBR token bucket is full, the Non-GBR fixed priority weight is directly determined as the Non-GBR priority weight; When the PBR token bucket is greater than 0, logical operations are performed using the first-level fixed constant of GBR and the second-level scheduling delay of Non-GBR to determine the Non-GBR priority weight; When the PBR token bucket is less than or equal to 0, logical operations are performed using the Non-GBR first-level fixed constant and the PF algorithm to determine the Non-GBR priority weight.

5. The logical channel group determination method according to any one of claims 1 to 4, characterized in that, The PF algorithm includes an improved PF algorithm for looking up a two-dimensional array table.

6. The logical channel group determination method according to claim 5, characterized in that, The steps for obtaining the improved PF algorithm's two-dimensional array lookup table include: Obtain the classic PF algorithm; wherein, the classic PF algorithm is: TBSize represents the maximum number of bits that the UE can transmit under the current channel conditions; α represents the quality adjustment factor; n represents the number of time periods (TTIs); ScheduleThrpt represents the scheduler's authorized throughput; β represents the throughput; θ represents the smoothing factor; and TTI represents the time period. schedule This indicates the uplink and downlink logical channel group scheduling traffic; The molecular part is simplified to α*log2(TBSize), a finite number of TBSizes are enumerated and a table is made, all log2(TBSize) are pre-calculated, and a two-dimensional array of molecules is constructed based on each TBSize and log2(TBSize); The denominator is simplified to β*log2(ScheduleThrpt), and a two-dimensional array is constructed based on each ScheduleThrpt and log2(ScheduleThrpt) to determine the two-dimensional denominator array; The improved PF algorithm two-dimensional array lookup table is constructed based on the numerator two-dimensional array and the denominator two-dimensional array.

7. The logical channel group determination method according to claim 1, characterized in that, The step of determining the target logical channel group based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight includes: From all the signaling priority weights, all the GBR priority weights, and all the Non-GBR priority weights, the logical channel with the highest priority weight is determined as the target logical channel group, and resources are allocated accordingly.

8. A logical channel group determination device, characterized in that, include: The logical channel group type determination module is used to determine the logical channel group type; The signaling priority weight determination module is used to determine the signaling priority weight based on the first-level fixed constant and the second-level scheduling delay when the logical channel group type is a signaling level type; wherein, the first-level fixed constant is the largest first-level fixed constant among all logical channel groups; The GBR priority weight determination module is used to determine the GBR priority weight based on the GBR token bucket state when the logical channel group type is GBR type, using a GBR fixed priority weight that is less than the signaling priority weight, or using a Non-GBR first-level fixed constant and PF algorithm, or using a GBR first-level fixed constant and GBR second-level scheduling delay. The Non-GBR priority weight determination module is used to determine the Non-GBR priority weight based on the PBR token bucket state using a Non-GBR fixed priority weight that is less than the signaling priority weight, or using the GBR first-level fixed constant and the Non-GBR second-level scheduling delay, or using the Non-GBR first-level fixed constant and the PF algorithm when the logical channel group type is Non-GBR. The Non-GBR first-level fixed constant is the smallest first-level fixed constant among all logical channels. The target logical channel determination module is used to determine the target logical channel group based on the signaling priority weight, the GBR priority weight, and the Non-GBR priority weight.

9. A logical channel group determination device, characterized in that, include: Memory, used to store computer programs; A processor for executing the computer program to implement the logical channel group determination method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when loaded and executed by a processor, implement the logical channel group determination method as described in any one of claims 1 to 7.

Citation Information

Patent Citations

  • Multi-user downlink scheduling method and device, equipment and storage medium

    CN117545085A