Data decoding method based on QOS level adaptive adjustment

Abstract

The data decoding method based on adaptive adjustment of QOS level provided by the present application has the following specific steps: the decoding configuration receiving module receives the decoding configuration information of each user in the current TTI; the decoding sorting module sorts the users from low to high based on the QOS priority level and inputs them into the decoding queue; the decoding control module obtains the data of each user in the decoding queue and performs decoding based on the maximum number of decoding iterations after dynamic update. The present application gives priority to decoding the data of users with low QOS level, and applies the time saved by stopping the decoding iteration of users with low QOS level in advance to the decoding of users with high QOS level, thereby improving the decoding success rate of users with high QOS level data while ensuring that the decoding operation meets the throughput requirements, thereby achieving the purpose of optimizing the system experience.

Description

[0001] This application is a divisional application. The parent application number is 202210287463.5. The application date is 2022.03.22. The name of the invention is decoding iteration number control system. Technical Field

[0002] The present application belongs to the technical field of forward error correction code decoding, and specifically relates to a data decoding method based on adaptive adjustment of QOS levels. Background Art

[0003] The statements in this section merely provide background technical information related to the present application and do not necessarily constitute prior art.

[0004] With the rapid development of mobile Internet, the system throughput and number of concurrent users of mobile communications are showing a trend of sustained and rapid growth. At the same time, mobile data services present more abundant service levels, and various service levels have become the key foundation for supporting the rapid development of application services corresponding to the above levels. Therefore, in order to meet the increasingly rich and diverse business needs, mobile communication networks need to effectively implement service level quality requirements and ensure business service quality.

[0005] There are many key indicators corresponding to the service level, including but not limited to bit error rate, latency, guaranteed rate, bandwidth, jitter, etc. However, due to the uncertainty factors of the air interface (obstruction, multipath, signal jitter, edge effect, etc.), wireless communication often becomes a bottleneck for end-to-end low bit error rate in scenarios with high real-time requirements, which ultimately greatly limits the application scope of mobile communications.

[0006] Existing solutions for optimizing air interface bit error rate mainly include wireless technology enhancement and scheduling technology enhancement. However, in wireless technology enhancement, the encoding and decoding processing is too rough. It is mainly based on the modulation and coding adaptive algorithm to select the modulation and coding index, and perform decoding processing at the receiving end based on the statically preset maximum number of decoding iterations. It fails to fully utilize the hardware processing capabilities. When the decoding throughput is met, the maximum number of decoding iterations is adaptively adjusted, resulting in impaired system performance and ultimately affecting the service experience. Therefore, how to optimize the maximum number of decoding iterations to improve the decoding performance of key user data while meeting the decoding processing throughput is a problem that needs to be solved in the industry. Summary of the invention

[0007] In order to solve the above problems, the present application proposes a data decoding method based on adaptive adjustment of QOS level, which gives priority to decoding of low QOS level user data and applies the time saved by stopping decoding iterations of low QOS level users in advance to the decoding of high QOS level users. In this way, while ensuring that the decoding operation meets the throughput requirements, the decoding success rate of high QOS level user data is improved, thereby achieving the purpose of optimizing the system experience.

[0008] The present application provides a data decoding method based on adaptive adjustment of QOS levels, based on a decoding system composed of a decoding configuration receiving module, a decoding sorting module, and a decoding control module, and the specific steps are as follows;

[0009] Step 1: The decoding configuration receiving module receives the decoding configuration information of each user in the current TTI;

[0010] Step 2: The decoding sorting module sorts the users from low to high based on the QOS priority level and inputs them into the decoding queue;

[0011] Step 3: The decoding control module obtains the per-user data of the decoding queue and performs decoding based on the dynamically updated maximum number of decoding iterations;

[0012] The TTI is a unit transmission time interval; by giving priority to decoding of low QOS level user data and stopping decoding iterations of low QOS level users in advance, the time saved is applied to the decoding of high QOS level users.

[0013] Preferably, the decoding configuration information includes at least the maximum number of decoding iterations of the user, the conservative maximum number of decoding iterations of the user, and the QOS indicator of the user, wherein the maximum number of decoding iterations is the maximum number of decoding iterations required for the user to meet the preset performance requirement 1 of the user, and the conservative maximum number of decoding iterations is the maximum number of decoding iterations required for the user to meet the preset performance requirement 2 of the user, and the performance requirement 2 has a better performance indicator than the performance requirement 1.

[0014] Preferably, the QOS priority level is obtained by sorting based on QOS indicators, and the QOS indicators include one or a combination of bit error rate, delay, guaranteed rate, and jitter.

[0015] Preferably, the priority order between different QOS indicators is obtained by preset.

[0016] Preferably, in step 2, the specific method of sorting users from low to high is:

[0017] Step 2.1, according to the importance of indicators, prioritize different indicators from low to high, and establish an empty queue Q1_i for each indicator, where the value of i is 1, ..., I, where I represents the total number of indicator types, and the value of i is 1, corresponding to the queue with the lowest indicator importance;

[0018] Step 2.2: Put each user into the queue corresponding to its highest priority indicator;

[0019] Step 2.3: sort the users in each queue from low to high based on the priority order of the indicator value corresponding to the queue to obtain the sorted queue Q2_i;

[0020] Step 2.4: Integrate each Q2_i queue according to the value of i from 1 to I to obtain the final user priority ranking from low to high.

[0021] Preferably, in step 3, the method for dynamically updating the maximum number of decoding iterations is:

[0022] Step 3.1, based on the maximum number of decoding iterations preset by each user, calculate the total decoding time T_sum0 of all users in the current TTI, and subtract T_sum0 from the TTI duration T_tti to obtain the saved time S, and preset the value of K to be the total number of users UE_Num that need to be decoded in the current TTI, and set C equal to 1;

[0023] Step 3.2, calculate the decoding time TDelta_i increased by each user when the conservative maximum number of decoding iterations is adjusted, where i corresponds to the user number in the decoding queue and takes values ​​of 1, ..., K;

[0024] Step 3.3: Determine whether K is less than C.

[0025] If yes, jump to step 3.5;

[0026] If not, determine whether TDelta_K is less than or equal to S. If so, select the value that satisfies m from the values ​​of 1, ..., K. Take the smallest value of m and put Assign a value to S and jump to step 3.4; if not, jump to step 3.5;

[0027] Step 3.4, update the maximum number of decoding iterations for the mth to Kth users in the decoding queue to their conservative maximum number of decoding iterations, and then assign (m-1) to K;

[0028] Step 3.5: Decode the Cth user, record the time S_C saved by completing the decoding iteration in advance, and assign (S+S_C) to S;

[0029] Step 3.6: Determine whether C is greater than or equal to UE_Num. If so, jump to step 3.7; if not, assign (C+1) to C, and then jump to step 3.3;

[0030] Step 3.7, decoding is completed.

[0031] Compared with the prior art, the beneficial effects of this application are:

[0032] This application prioritizes decoding of low-QOS level user data and applies the time saved by stopping decoding iterations early for low-QOS level users to the decoding of high-QOS level users. This improves the decoding success rate of high-QOS level user data while ensuring that the decoding operation meets the throughput requirements, thereby achieving the purpose of optimizing the system experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] The drawings in the specification, which constitute a part of the present application, are used to provide further understanding of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute improper limitations on the present application.

[0034] Figure 1 This is a method flow chart of an embodiment of the present application.

[0035] Figure 2 This is a system structure diagram of an embodiment of the present application.

[0036] Figure 3 This is a schematic diagram of an implementation example of the present application. DETAILED DESCRIPTION

[0037] The present application is further described below in conjunction with the accompanying drawings and embodiments.

[0038] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit the exemplary embodiments according to the present disclosure. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should be understood that when the terms "comprising" and / or "including" are used in this specification, it indicates the presence of features, steps, operations, devices, components and / or combinations thereof.

[0039] In the present disclosure, terms such as "upper", "lower", "left", "right", "front", "back", "vertical", "horizontal", "side", "bottom" and the like indicating directions or positional relationships are based on the directions or positional relationships shown in the accompanying drawings. They are relational words determined only for the convenience of describing the structural relationships of the various parts or elements of the present disclosure, and do not specifically refer to any part or element in the present disclosure and should not be understood as limitations on the present disclosure.

[0040] like Figure 1 to Figure 2As shown, the present application provides a decoding iteration number control system, including: a decoding configuration receiving module, a decoding sorting module, and a decoding control module;

[0041] A decoding configuration receiving module, which is responsible for receiving the decoding configuration information of each user in the current TTI;

[0042] A decoding sorting module, which sorts users from low to high based on QOS priority and inputs them into a decoding queue;

[0043] A decoding control module obtains the per-user data of the decoding queue and performs decoding based on the dynamically updated maximum number of decoding iterations.

[0044] The steps of each module cooperating with each other to perform decoding iteration control are as follows:

[0045] Step 1: The decoding configuration receiving module receives the decoding configuration information of each user in the current TTI;

[0046] Step 2: The decoding sorting module sorts the users from low to high based on the QOS priority level and inputs them into the decoding queue;

[0047] Step 3: The decoding control module obtains the per-user data of the decoding queue and performs decoding based on the dynamically updated maximum number of decoding iterations.

[0048] The present application also provides a data decoding method based on QOS level adaptive adjustment, and the steps of the method are consistent with steps 1 to 3.

[0049] In the step 1, the TTI is a unit transmission time interval.

[0050] In the step 1, the decoding configuration information includes at least the maximum number of decoding iterations of the user, the conservative maximum number of decoding iterations of the user, and the QOS indicator of the user. The maximum number of decoding iterations is the maximum number of decoding iterations required for the user to meet the preset performance requirement 1 of the user. The conservative maximum number of decoding iterations is the maximum number of decoding iterations required for the user to meet the preset performance requirement 2 of the user. The performance requirement 2 has a better performance indicator than the performance requirement 1.

[0051] In the step 2, the QOS priority level is obtained by sorting based on QOS indicators, and the QOS indicators include one or a combination of bit error rate, delay, guaranteed rate, and jitter.

[0052] The priority order among the different QOS indicators is obtained by preset.

[0053] The specific method for sorting users from low to high is:

[0054] Step 2.1, according to the importance of indicators, prioritize different indicators from low to high, and establish an empty queue Q1_i for each indicator, where the value of i is 1, ..., I, where I represents the total number of indicator types, and the value of i is 1, corresponding to the queue with the lowest indicator importance;

[0055] Step 2.2: Put each user into the queue corresponding to its highest priority indicator;

[0056] Step 2.3: sort the users in each queue from low to high based on the priority order of the indicator value corresponding to the queue to obtain the sorted queue Q2_i;

[0057] Step 2.4: Integrate each Q2_i queue according to the value of i from 1 to I to obtain the final user priority ranking from low to high.

[0058] In step 3, the method for dynamically updating the maximum number of decoding iterations is:

[0059] Step 3.1, based on the maximum number of decoding iterations preset by each user, calculate the total decoding time T_sum0 of all users in the current TTI, and subtract T_sum0 from the TTI duration T_tti to obtain the saved time S, and preset the value of K to be the total number of users UE_Num that need to be decoded in the current TTI, and set C equal to 1;

[0060] Step 3.2, calculate the decoding time TDelta_i increased by each user when the conservative maximum number of decoding iterations is adjusted, where i corresponds to the user number in the decoding queue and takes values ​​of 1, ..., K;

[0061] Step 3.3: Determine whether K is less than C.

[0062] If yes, jump to step 3.5;

[0063] If not, determine whether TDelta_K is less than or equal to S. If so, select the value that satisfies m from the values ​​of 1, ..., K. Take the smallest value of m and put Assign a value to S and jump to step 3.4; if not, jump to step 3.5;

[0064] Step 3.4, update the maximum number of decoding iterations for the mth to Kth users in the decoding queue to their conservative maximum number of decoding iterations, and then assign (m-1) to K;

[0065] Step 3.5: Decode the Cth user, record the time S_C saved by completing the decoding iteration in advance, and assign (S+S_C) to S;

[0066] Step 3.6: Determine whether C is greater than or equal to UE_Num. If so, jump to step 3.7; if not, assign (C+1) to C, and then jump to step 3.3;

[0067] Step 3.7, decoding is completed.

[0068] The specific implementation methods of the present application are described below with specific examples:

[0069] Example: Figure 3 As described above, in this embodiment, the users scheduled by the current TTI include four, namely UE1, UE2, UE3, and UE4. The QOS indicators in this embodiment involve delay and bit error rate, among which the delay indicator has a lower priority than the bit error rate indicator.

[0070] First, the decoding configuration receiving module receives the decoding configuration information of each user in the current TTI, including the maximum decoding iteration number of UE1 is 6, the conservative maximum decoding iteration number is 8, and the QOS indicator is delay; the maximum decoding iteration number of UE2 is 5, the conservative maximum decoding iteration number is 9, and the QOS indicator is delay and bit error rate; the maximum decoding iteration number of UE3 is 7, the conservative maximum decoding iteration number is 8, and the QOS indicator is bit error rate; the maximum decoding iteration number of UE4 is 3, the conservative maximum decoding iteration number is 7, and the QOS indicator is bit error rate.

[0071] Next, the decoding sorting module sorts the users from low to high based on the QOS priority level and inputs them into the decoding queue. First, according to step 2.1, two empty queues are established, namely Q1_1 and Q1_2. In addition, among the QOS indicators, since the priority of the delay indicator is lower than the bit error rate indicator, Q1_1 corresponds to the lowest priority indicator, therefore, Q1_1 corresponds to the delay indicator, and Q1_2 corresponds to the bit error rate indicator. Next, according to step 2.2, each user is placed in the queue corresponding to its highest priority indicator (UE1, UE3, and UE4 have only one QOS indicator, so they can be directly placed in the queue of their indicator, and UE2 includes delay and bit error rate. Since the priority of the delay indicator is lower than the bit error rate indicator, UE2 is placed in the queue corresponding to the bit error rate indicator, that is, Q1_2). Therefore, UE1 is placed in queue Q1_1, and UE3, UE4, and UE2 are placed in queue Q1_2; then, according to step 2.3, the users in the queue are prioritized. There is only one user in Q1_1, so the users in Q1_1 do not need to adjust the order and can be directly copied to Q2_1. Q1_2 includes three UEs, namely UE3, UE4, and UE2. Assuming that in terms of the bit error rate index value, UE4 is smaller than UE3, and UE3 is smaller than UE2, then they are written into queue Q2_2 in the order of UE4, UE3, and UE2 according to the bit error rate index from low to high; finally, according to step 2.4, the users in multiple queues are sorted, and the final user priority is sorted from low to high as follows: UE1, UE4, UE3, and UE2.

[0072] Next, the decoding control module obtains the per-user data of the decoding queue according to steps 3.1 to 3.7 and performs decoding based on the dynamically updated maximum number of decoding iterations. The specific operations are as follows:

[0073] Operation 1. According to step 3.1, based on the maximum number of decoding iterations preset by each user, the total decoding time T_sum0 of all users in the current TTI is calculated, and T_sum0 is subtracted from the TTI duration T_tti to obtain the saved time S, and the value of K is preset to be the total number of users UE_Num that need to be decoded in the current TTI, that is, 4, and C is set to be 1. In this embodiment, the value of S obtained in this step is 0;

[0074] Operation 2: Calculate the decoding time TDelta_i increased by each user for adjusting the conservative maximum number of decoding iterations, where i corresponds to the user number in the decoding queue and takes values ​​of 1, ..., K. In this embodiment, the corresponding values ​​of i are 1, 2, 3, and 4, and the values ​​of TDelta_i are 10us, 20us, 50us, and 20us, respectively;

[0075] Operation 3: It is determined that K is not less than C, and TDelta_K is not less than S, so jump to step 3.5;

[0076] Operation 4: According to step 3.5, the Cth user (corresponding to the first user at this time) is decoded, and the time S_C saved by completing the decoding iteration in advance is recorded (assuming that the program stops iteration in advance and the time saved is 25us, then the value of S_C is 25us), and (S+S_C) is assigned to S (0+25=25us at this time);

[0077] Operation 5: According to step 3.6, it is determined that C is less than UE_Num, so (C+1) is assigned to C (C is equal to 2 at this time), and then jump to step 3.3;

[0078] Operation 6: According to step 3.3, it is determined that K is greater than or equal to C, and TDelta_K is less than S. Therefore, from the values ​​of m of 1, ..., K, select the value that satisfies The smallest m value (in this case, m is 4, so when m is 3, Just greater than S, therefore, m can only be 4), and Assign the value to S (at this time S equals 25 minus 20, which equals 5), and jump to step 3.4;

[0079] Operation 7: Update the maximum number of decoding iterations of the mth (corresponding to 4) to the Kth (corresponding to 4) users in the decoding queue to their conservative maximum number of decoding iterations, and assign (m-1) to K (at this time, K is updated from 4 to 3, that is, the fourth user has been adjusted to the conservative maximum number of decoding iterations. Even if the decoding of the low-priority user stops iteration in advance, the extra time does not need to be considered for allocation to the lower four users. Therefore, the K value is adjusted to 3, that is, only the third user needs to be considered);

[0080] Operation 8: According to step 3.5, the Cth user (corresponding to the second user in this case) is decoded, and the time S_C saved by completing the decoding iteration in advance is recorded (assuming that the iteration is not stopped in advance, the value of S_C is 0us), and (S+S_C) is assigned to S (in this case, 5+0 is equal to 5us);

[0081] Operation 9: If it is determined that C is less than UE_Num, C is updated to 3, and then jump to step 3.3;

[0082] Operation 10: According to step 3.3, since K is not less than C and TDelta_K is greater than S, jump to step 3.5;

[0083] Operation 11, according to step 3.5, decode the Cth user (corresponding to the third user in this case), and record the time S_C saved by completing the decoding iteration in advance (assuming that the iteration is not stopped in advance, the value of S_C is 0us), and assign (S+S_C) to S (in this case, 5+0 is equal to 5us);

[0084] Operation 12: According to step 3.6, it is determined that C is less than UE_Num, so (C+1) is assigned to C (C is updated to 4 at this time), and then jump to step 3.3;

[0085] Operation 13, according to step 3.3. Since it is determined that K (currently 3) is less than C (currently 4), that is, the next user to be decoded is the fourth user, the first three users have already completed decoding. Even if there is remaining processing time in the current TTI, there is no need to adjust the maximum number of decoding iterations for the first three users, so jump to step 3.5;

[0086] Operation 14: According to step 3.5, the Cth user (the value is 4 at this moment) is decoded, and the time S_C saved by completing the decoding iteration in advance is recorded (assuming that the iteration is not stopped in advance, so the value of S_C is 0), and (S+S_C) is assigned to S (that is, 5 plus 0 equals 5us);

[0087] Operation 15: Determine whether C (C is 4 at this moment) is greater than or equal to UE_Num (which is 4), then jump to step 3.7;

[0088] Operation 16: According to step 3.7, complete the decoding operation.

[0089] From this embodiment, it can be seen that the application allocates the time saved by the low-priority user UE1 stopping the decoding iteration in advance to the highest-priority user UE2, so that UE2 can decode according to the conservative maximum number of decoding iterations, and finally achieve the performance target of performance requirement 2, which is more intelligent than the prior art to achieve the performance target of performance requirement 1, and significantly improve the service experience. Through this application, the decoding of low-QOS level user data is carried out preferentially, and the time saved by the low-QOS level user stopping the decoding iteration in advance is applied to the decoding of high-QOS level users, thereby ensuring that the decoding operation meets the throughput requirements, and improving the decoding success rate of high-QOS level user data, so as to achieve the purpose of optimizing the system experience.

[0090] The above are only preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

[0091] Although the above describes the specific implementation methods of the present application in conjunction with the accompanying drawings, it is not intended to limit the scope of protection of the present application. Technical personnel in the relevant field should understand that on the basis of the technical solution of the present application, various modifications or deformations that can be made by technical personnel in this field without creative work are still within the scope of protection of the present application.

Claims

1. A data decoding method based on adaptive adjustment of QOS level, characterized in that: Based on the decoding system composed of a decoding configuration receiving module, a decoding sorting module, and a decoding control module, the specific steps are as follows; Step 1: The decoding configuration receiving module receives the decoding configuration information of each user in the current TTI; Step 2: The decoding sorting module sorts the users from low to high based on the QOS priority level and inputs them into the decoding queue; Step 3: The decoding control module obtains the per-user data of the decoding queue and performs decoding based on the dynamically updated maximum number of decoding iterations; The TTI is a unit transmission time interval; By giving priority to decoding data of users with low QOS levels, and using the time saved by stopping decoding iterations of users with low QOS levels in advance to decode users with high QOS levels; In step 3, the method for dynamically updating the maximum number of decoding iterations is: Step 3.1, based on the maximum number of decoding iterations preset by each user, calculate the total decoding time T_sum0 of all users in the current TTI, and subtract T_sum0 from the TTI duration T_tti to obtain the saved time S, and preset the value of K to be the total number of users UE_Num that need to be decoded in the current TTI, and set C equal to 1; Step 3.2, calculate the decoding time TDelta_i increased by each user when the conservative maximum number of decoding iterations is adjusted, where i corresponds to the user number in the decoding queue and takes values ​​of 1, ..., K; Step 3.3: Determine whether K is less than C. If yes, jump to step 3.5; If not, determine whether TDelta_K is less than or equal to S. If so, select the value that satisfies m from the values ​​of 1, ..., K. Take the smallest value of m and put Assign a value to S and jump to step 3.4; if not, jump to step 3.5; Step 3.4, update the maximum number of decoding iterations for the mth to Kth users in the decoding queue to their conservative maximum number of decoding iterations, and then assign (m-1) to K; Step 3.5: Decode the Cth user, record the time S_C saved by completing the decoding iteration in advance, and assign (S+S_C) to S; Step 3.6: Determine whether C is greater than or equal to UE_Num. If so, jump to step 3.7; if not, assign (C+1) to C, and then jump to step 3.3; Step 3.7, decoding is completed.

2. The data decoding method based on QOS level adaptive adjustment according to claim 1, characterized in that: The decoding configuration information includes at least the maximum number of decoding iterations of the user, the conservative maximum number of decoding iterations of the user, and the QOS indicator of the user. The maximum number of decoding iterations is the maximum number of decoding iterations required for the user to meet the preset performance requirement 1 of the user. The conservative maximum number of decoding iterations is the maximum number of decoding iterations required for the user to meet the preset performance requirement 2 of the user. The performance requirement 2 has a better performance indicator than the performance requirement 1.

3. The data decoding method based on QOS level adaptive adjustment according to claim 2, characterized in that: The QOS priority level is obtained by sorting based on QOS indicators, and the QOS indicators include one or a combination of bit error rate, delay, guaranteed rate, and jitter.

4. The data decoding method based on QOS level adaptive adjustment according to claim 3, characterized in that: The priority order between the different QOS indicators is obtained by preset.

5. The data decoding method based on QOS level adaptive adjustment according to claim 4, characterized in that: In step 2, the specific method of sorting users from low to high is: Step 2.1, according to the importance of indicators, prioritize different indicators from low to high, and establish an empty queue Q1_i for each indicator, where the value of i is 1, ..., I, where I represents the total number of indicator types, and the value of i is 1, corresponding to the queue with the lowest indicator importance; Step 2.2: Put each user into the queue corresponding to its highest priority indicator; Step 2.3: sort the users in each queue from low to high based on the priority order of the corresponding indicator value of the queue to obtain the sorted queue Q2_i; Step 2.4: Integrate each Q2_i queue according to the value of i from 1 to I to obtain the final user priority ranking from low to high.

Images