CN111355494A

CN111355494A - Check code processing method and device and electronic equipment

Info

Publication number: CN111355494A
Application number: CN201811581246.7A
Authority: CN
Inventors: 吴昊; 王芳
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2018-12-24
Filing date: 2018-12-24
Publication date: 2020-06-30
Also published as: WO2020134723A1

Abstract

The embodiment of the application discloses a processing method and device of a check code and electronic equipment, wherein the method comprises the following steps: acquiring the number of scheduled users in a preset time slot; determining the input time, the one-time iterative decoding time and the output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the code block number of the check code scheduled by each user; determining time for iterative decoding according to input time and output time of a code block scheduled by a newly-transmitted user in the users and input time and output time of a code block scheduled by a retransmitted user in the users; determining the average iteration times corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of the code block scheduled by the newly-transmitted user and the one-time iterative decoding time of the code block scheduled by the re-transmitted user; and determining the maximum iteration number corresponding to each user according to the average iteration number corresponding to each user.

Description

Check code processing method and device and electronic equipment

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for processing a check code, and an electronic device.

Background

Because the performance of low-density parity-check code (LDPC) is close to the aromatic limit, LDPC is applied in many wireless communication Systems, for example, LDPC can be applied to 3rd Generation Partnership Project New Radio (3 GPP NR) and Advanced Television system 3.0(Advanced Television Systems committee3.0, ATSC 3.0). However, the power consumption and decoding delay of LDPC codes increase as the number of iterations increases, and for this reason, various early-stop mechanisms are generally provided in LDPC decoders to improve energy efficiency and increase system throughput.

When decoding the LDPC, there is a large relationship between the decoding performance of the LDPC and the number of iterations, and generally, the performance is better as the number of iterations is larger. When the system throughput is large, the available iteration times are small; when the system throughput is low, the number of available iterations is high. In general, LDPC codes may be decoded with a fixed number of iterations. However, the above method cannot effectively utilize hardware resources, so that the LDPC decoding performance is poor, and the performance of the communication system is poor.

Disclosure of Invention

An object of the embodiments of the present application is to provide a method and an apparatus for processing a check code, and an electronic device, so as to solve the problem in the prior art that hardware resources cannot be effectively utilized, so that the performance of LDPC decoding is poor, and the performance of a communication system is poor.

In order to solve the above technical problem, the embodiment of the present application is implemented as follows:

in a first aspect, a method for processing a check code provided in an embodiment of the present application includes:

acquiring the number of scheduled users in a preset time slot;

determining the input time, the one-time iterative decoding time and the output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the code block number of the check code scheduled by each user;

determining time for iterative decoding according to input time and output time of a code block scheduled by a newly-transmitted user in the users and input time and output time of a code block scheduled by a retransmitted user in the users;

determining the average iteration times corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of the code block scheduled by the newly-transmitted user and the one-time iterative decoding time of the code block scheduled by the re-transmitted user;

and determining the maximum iteration number corresponding to each user according to the average iteration number corresponding to each user.

Optionally, the determining the maximum iteration number corresponding to each user according to the average iteration number corresponding to each user includes:

and if the average iteration times is larger than or equal to a preset iteration time threshold, the maximum iteration times corresponding to the new transmission user and the retransmission user are the preset iteration time threshold.

and if the average iteration number is smaller than a preset iteration number threshold, the maximum iteration number of the newly-transmitted user is the preset iteration number threshold.

Optionally, the method further comprises:

obtaining iterative decoding time for the retransmission user;

and determining the maximum iteration times corresponding to each retransmission user according to the iterative decoding time for the retransmission users.

Optionally, the determining, according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of code blocks of the check code scheduled by each user, the input time, the one-time iterative decoding time, and the output time of the code block scheduled by each user includes:

determining the input time and the output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the code block number of the check code scheduled by each user;

and determining one-time iterative decoding time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the code block number of the check code scheduled by each user and the time required by decoding the check code constructed by the matrix row number index.

Optionally, the determining input time and output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of the code blocks of the check code scheduled by each user includes:

substituting the value of the size of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the number of code blocks of the check code scheduled by each user into the following formula

cyclc0_j＝C_j*ceil(8*Z_j/512)*kb_j

Calculating to obtain the input time of the code block scheduled by each user;

cyclc2_j＝C_j*ceil(1*Z_j/128)*(1+kb_j-mb_j)

Calculating to obtain the output time of the code block scheduled by each user, wherein, the cycle 0_jIndicating the input time, cyclec 2, of the code block scheduled by the jth user_jRepresents the output time, C, of the code block scheduled by the jth user_jNumber of code blocks, Z, representing the jth user schedule_jAnd the spreading factor of the matrix of the jth user scheduling is shown, and the mbj kbj shows the magnitude value of the matrix of the jth user scheduling.

Optionally, the determining, according to the size value of the matrix scheduled by each user, the number of code blocks of the check code scheduled by each user, and the time required for decoding the check code constructed by the matrix row number index, the one-time iterative decoding time of the code block scheduled by each user includes:

substituting the size value of the matrix scheduled by each user, the code block number of the check code scheduled by each user and the time required for decoding the check code constructed by the matrix row number index into the following formula

cyclc1_j＝C_j*ceil(MatrixCycle(mb_j))

Calculating to obtain one-time iterative decoding time of each user-scheduled code block, wherein the cyclic 1_jAnd the time of one-time iterative decoding of the code block scheduled by the jth user is represented, and the matrix C-cycle represents the time required by decoding the check code constructed by the row number index of the matrix.

Optionally, the determining, according to the input time and the output time of the code block scheduled by the newly-transmitted user among the users and the input time and the output time of the code block scheduled by the re-transmitted user among the users, the time for iterative decoding includes:

subtracting the input time and the output time of the code block scheduled by the newly transmitted user and the input time and the output time of the code block scheduled by the retransmission user from the maximum supported time length in the preset time slot to obtain a corresponding difference value, and taking the obtained difference value as the time for iterative decoding.

Optionally, the determining, according to the time for iterative decoding, the time for iterative decoding of the code block scheduled by the newly transmitted user, and the time for iterative decoding of the code block scheduled by the retransmitted user, an average number of iterations corresponding to each user includes:

substituting the time for iterative decoding, the time for one iterative decoding of the code block scheduled by the newly transmitted user and the time for one iterative decoding of the code block scheduled by the retransmitted user into the following formula

IterationNum＝min(floor(TmpCycle/(cyclc1New+cyclc1Old)),31)-1

Calculating to obtain average iteration times; wherein, IterationNum represents average iteration times, cycle 1New represents one-time iterative decoding time of the code block scheduled by the newly-transmitted user, cycle 1Old represents one-time iterative decoding time of the code block scheduled by the newly-transmitted user, and tmpcle represents time available for iterative decoding.

In a second aspect, an apparatus for processing a check code provided in an embodiment of the present application includes:

the user number obtaining module is used for obtaining the number of scheduled users in a preset time slot;

the first time determination module is used for determining the input time, the one-time iterative decoding time and the output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the code block number of the check code scheduled by each user;

a second time determining module, configured to determine time for iterative decoding according to input time and output time of a code block scheduled by a newly-transmitted user among the users, and input time and output time of a code block scheduled by a retransmitted user among the users;

an average number determining module, configured to determine an average number of iterations corresponding to each user according to the time for iterative decoding, the time for iterative decoding of the code block scheduled by the newly transmitted user, and the time for iterative decoding of the code block scheduled by the retransmitted user;

and the maximum number determining module is used for determining the maximum iteration number corresponding to each user according to the average iteration number corresponding to each user.

Optionally, the maximum number of times determining module is configured to, if the average number of iterations is greater than or equal to a predetermined number of iterations threshold, determine that the maximum number of iterations corresponding to the new transmission user and the retransmission user is the predetermined number of iterations threshold.

Optionally, the maximum number of iterations determining module is configured to, if the average number of iterations is less than a predetermined number of iterations threshold, determine that the maximum number of iterations of the newly transmitted user is the predetermined number of iterations threshold.

Optionally, the apparatus further comprises:

a third time determination module, configured to obtain iterative decoding time for the retransmission user;

and the retransmission user iteration determining module is used for determining the maximum iteration times corresponding to each retransmission user according to the iterative decoding time for the retransmission user.

Optionally, the first time determination module includes:

a first time determining unit, configured to determine input time and output time of a code block scheduled by each user according to a size value of the matrix scheduled by each user, a spreading factor of the matrix scheduled by each user, and the number of code blocks of a check code scheduled by each user;

and the second time determining unit is used for determining one-time iterative decoding time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the code block number of the check code scheduled by each user and the time required by the check code decoding constructed by the matrix row number index.

In a third aspect, an electronic device provided in an embodiment of the present application includes a processor, a memory, and a computer program stored on the memory and executable on the processor, where the computer program, when executed by the processor, implements the steps of the check code processing method according to the first aspect.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when executed by a processor, the computer program implements the steps of the check code processing method according to the first aspect.

As can be seen from the above technical solutions provided by the embodiments of the present application, in the embodiments of the present application, by obtaining the number of scheduled users in a predetermined time slot, further determining the input time, the one-time iterative decoding time, and the output time of a code block scheduled by each user according to the size value of a matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the code block number of a check code scheduled by each user, then determining the time for iterative decoding according to the input time and the output time of a code block scheduled by a newly transmitted user in the user, and the input time and the output time of a code block scheduled by a retransmitted user in the user, determining the average number of iterations corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of a code block scheduled by a newly transmitted user, and the one-time iterative decoding time of a code block scheduled by a retransmitted user, according to the average iteration times corresponding to each user, the maximum iteration times corresponding to each user are determined, so that the time for iterative decoding is determined through the input time and the output time of the code block scheduled by the newly-transmitted user and the input time and the output time of the code block scheduled by the retransmission user in the user, and the average iteration times corresponding to each user are further determined to determine the maximum iteration times corresponding to each user, so that the iteration times corresponding to each user can be dynamically adjusted according to the system throughput, the LDPC decoding performance is optimal, the hardware resources are effectively utilized, and the performance of a communication system is improved.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort.

Fig. 1 is a diagram illustrating an embodiment of a check code processing method according to the present application;

FIG. 2 is a schematic diagram of a check code processing system according to the present application;

FIG. 3 is a block diagram of another embodiment of a check code processing method according to the present application;

FIG. 4 is a block diagram of an embodiment of a check code processing apparatus according to the present application;

fig. 5 is an embodiment of an electronic device according to the present application.

Detailed Description

The embodiment of the application provides a check code processing method and device and electronic equipment.

In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

Example one

As shown in fig. 1, an execution main body of the method may be an electronic device, and the electronic device may be a terminal device or a server on a network side, where the terminal device may be a mobile terminal device such as a mobile phone or a tablet computer, and may also be a device such as a personal computer or a television. The server on the network side may be a base station or other network-side devices, etc., where the server may be an independent server or a server cluster composed of a plurality of servers, and the electronic device may be an electronic device in a communication network based on a certain communication protocol, etc. The method can be used for applications such as improving the performance of a communication system and the like based on the dynamic configuration of the iteration times of the check code. The method may specifically comprise the steps of:

in step S102, the number of users scheduled in a predetermined time slot is acquired.

The predetermined time slot may be a time slot in the field of communication technology, such as one or more time slots in LTE (Long Term Evolution). The predetermined time slot may be a slot in this embodiment.

In implementation, the performance of a low-density parity-check code (LDPC) is close to a fragrant limit, and the LDPC is applied in many wireless communication Systems, for example, as shown in fig. 2, the LDPC may be applied to a third Generation Partnership Project New Radio (3 GPP NR) and an Advanced Television system 3.0 (ATSC 3.0), but power consumption and decoding time delay of the LDPC may increase with an increase of the number of iterations.

When decoding the LDPC, there is a large relationship between the decoding performance of the LDPC and the number of iterations, and generally, the performance is better as the number of iterations is larger. When the system throughput is large, the available iteration times are small; when the system throughput is low, the number of available iterations is high. In general, LDPC codes may be decoded with a fixed number of iterations. However, the above method cannot effectively utilize hardware resources, so that the LDPC decoding performance is poor. In order to optimize LDPC decoding performance, it is necessary to dynamically adjust the iteration number according to system throughput, and therefore, an embodiment of the present application provides a technical solution that can dynamically adjust the iteration number of the check code, which may specifically include the following:

when the iteration number of the user scheduling check code in a certain slot (slot) (i.e. in a predetermined slot) needs to be adjusted, since the iteration number of the adjustment check code may be for each user in the slot, the number of users scheduled in the slot may be obtained first, for example, the schedulable users in the slot include 1 or 5, and the like. The schedulable users in the slot may include new transmission users and/or retransmission users, etc.

In step S104, the input time, the one-time iterative decoding time, and the output time of the code block scheduled by each user are determined according to the magnitude value of each user scheduling matrix, the spreading factor of each user scheduling matrix, and the code block number of each user scheduling check code.

The user scheduling matrix may be a check matrix in the check code. Aiming at the expansion factor of the user scheduling matrix, in order to realize low-complexity coding and construct the LDPC code with linear coding complexity and a quasi-cyclic structure, the check matrix can be expanded (such as secondary expansion), so that the hardware is simple to realize, and the code length and code rate are flexible and variable, therefore, the expansion factor can be generated in the process of expanding. The one-time iterative decoding time may be a time length required for performing one-time iterative decoding, or the like.

In implementation, in a certain slot, a size value of each user scheduling matrix in the slot may be obtained, specifically 46 × 68 or 5 × 27, and the like, in addition, a spreading factor of each user scheduling matrix may also be obtained, specifically 384, and at the same time, a code block number of each user scheduling check code may also be obtained, specifically 10 or 8, and the like. In this way, after the magnitude value of each user scheduling matrix, the spreading factor of each user scheduling matrix, and the code block number of each user scheduling check code in the slot are obtained, calculation may be performed based on the obtained data to obtain the input time of each user scheduled code block, the one-time iterative decoding time of each user scheduled code block, and the output time of each user scheduled code block, specifically, an algorithm for calculating the input time of each user scheduled code block may be preset, the setting of the algorithm may be specifically set or selected according to an actual situation, the algorithm may be an algorithm determined based on one or more of the magnitude value of the user scheduling matrix, the spreading factor of the user scheduling matrix, and the code block number of the user scheduling check code, for example, the algorithm may be an algorithm determined based on the magnitude value of the user scheduling matrix, the spreading factor of the user scheduling matrix, and the code block number of the user scheduling check code, The spreading factor of the user scheduling matrix and the code block number of the user scheduling check code, and an algorithm for determining the input time of the code block scheduled by the user, the size value of each user scheduling matrix in the slot, the spreading factor of each user scheduling matrix and the code block number of each user scheduling check code can be input into the formula of the set algorithm for calculation, and the input time of the code block scheduled by each user can be obtained. In addition, the algorithm may also be an algorithm for determining the input time of the user-scheduled code block based on the size value of the user scheduling matrix and the code block number of the user scheduling check code, and then the size value of each user scheduling matrix and the code block number of each user scheduling check code in the slot may be input into the formula of the above-mentioned algorithm to be calculated, so as to obtain the input time of the user-scheduled code block, and the like, or the algorithm may also be an algorithm for determining the input time of the user-scheduled code block based on any one of the size value of the user scheduling matrix, the spreading factor of the user scheduling matrix, and the code block number of the user scheduling check code, and the like.

Similarly, an algorithm for calculating the one-time iterative decoding time of the code block scheduled by each user may be preset, the setting of the algorithm may be specifically set or selected according to the actual situation, and the algorithm may be an algorithm determined based on one or more of the size value of the user scheduling matrix, the spreading factor of the user scheduling matrix, and the code block number of the user scheduling check code. In addition, an algorithm for calculating the output time of the code block scheduled by each user may be preset, the setting of the algorithm may be specifically set or selected according to the actual situation, and the algorithm may be an algorithm determined based on one or more of the size value of the user scheduling matrix, the spreading factor of the user scheduling matrix, and the number of the code blocks of the user scheduling check code. For a specific processing procedure, reference may be made to the above contents and examples, which are not described herein again.

In step S106, a time for iterative decoding is determined according to the input time and the output time of the code block scheduled by the newly transmitted user among the users and the input time and the output time of the code block scheduled by the retransmitted user among the users.

Wherein, the users schedulable in the predetermined time slot may include new transmission users and/or retransmission users.

In implementation, the input time and the output time of the code block scheduled by the newly transmitted user in the predetermined slot may be obtained from the input time and the output time of the code block scheduled by each user obtained in the step S104, and the input time and output time of the code block scheduled by the retransmission user within a predetermined slot, then, the maximum duration supported in the predetermined slot can be obtained, the input time and the output time of the code block scheduled by the newly transmitted user can be removed from the maximum duration, and the input time and the output time of the code block scheduled by the retransmission user, the remaining time length can be used as the time for iterative decoding, i.e. the maximum duration may be used minus the input time and the output time of the newly transmitted user scheduled code block, and retransmitting the input time and the output time of the code block scheduled by the user, wherein the obtained difference value can be used as the time for iterative decoding.

For example, the maximum duration supported in the slot of the predetermined time slot is 100000, the input time of the code block scheduled by the newly transmitting user is 4896, the output time of the code block scheduled by the newly transmitting user is 828, the input time of the code block scheduled by the retransmitting user is 8160, and the output time of the code block scheduled by the retransmitting user is 1380, then the time for iterative decoding is 100000-4896-828-8160-1380-84736.

In step S108, an average number of iterations corresponding to each user is determined according to the time for iterative decoding, the time for one iterative decoding of the code block scheduled by the newly transmitted user, and the time for one iterative decoding of the code block scheduled by the retransmitted user.

In implementation, the one-time iterative decoding time of the code block scheduled by the newly transmitted user and the one-time iterative decoding time of the code block scheduled by the retransmitted user in the predetermined slot may be obtained from the one-time iterative decoding time of the code block scheduled by each user obtained in step S104, and then, an algorithm of an average number of iterations of each user may be set, a setting mode of the algorithm may be set or selected according to an actual situation, which is not limited in the embodiment of the present application. The obtained one-time iterative decoding time of the code block scheduled by the newly transmitted user and the one-time iterative decoding time of the code block scheduled by the retransmitted user in the predetermined slot can be substituted into a formula corresponding to the algorithm for calculation, so as to obtain the average iteration number of each user.

For example, the sum of the time for one iterative decoding of a code block scheduled by a newly transmitted user and the time for one iterative decoding of a code block scheduled by a retransmitted user in a predetermined slot may be calculated, the value of the sum may be used as the time for one iterative decoding of the code block scheduled by the user, and then, the time for iterative decoding may be divided by the time for one iterative decoding of the code block scheduled by the user to obtain a corresponding quotient. May be based on the resulting average number of iterations per user of the quotient.

In step S110, the maximum iteration count corresponding to each user is determined according to the average iteration count corresponding to each user.

In implementation, for the iteration number of each user scheduling check code in the predetermined slot, an iteration number threshold of each user scheduling check code in the predetermined slot may be preset, then, the obtained average iteration number of each user may be compared with the iteration number threshold, and based on a comparison result, the maximum iteration number of each user is determined.

The embodiment of the application provides a check code processing method, which comprises the steps of determining the input time, the one-time iterative decoding time and the output time of a code block scheduled by each user by acquiring the number of scheduled users in a preset time slot and further according to the size value of a matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the code block number of the check code scheduled by each user, then determining the time for iterative decoding according to the input time and the output time of a code block scheduled by a newly-transmitted user in the user and the input time and the output time of a code block scheduled by a re-transmitted user in the user, determining the average iterative times corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of the code block scheduled by the newly-transmitted user and the one-time iterative decoding time scheduled by the re-transmitted user, and finally determining the average iterative times corresponding to each user according to each user, the maximum iteration times corresponding to each user are determined, so that the time for iterative decoding is determined through the input time and the output time of the code block scheduled by the newly transmitted user and the input time and the output time of the code block scheduled by the retransmitted user in the user, the average iteration times corresponding to each user are further determined, the maximum iteration times corresponding to each user are determined, the iteration times corresponding to each user can be dynamically adjusted according to the throughput of the system, the LDPC decoding performance is optimal, hardware resources are effectively utilized, and the performance of a communication system is improved.

Example two

As shown in fig. 3, an execution main body of the method may be an electronic device, and the electronic device may be a terminal device or a server on a network side, where the terminal device may be a mobile terminal device such as a mobile phone or a tablet computer, and may also be a device such as a personal computer or a television. The server on the network side may be a base station or other network-side devices, etc., where the server may be an independent server or a server cluster composed of a plurality of servers, and the electronic device may be an electronic device in a communication network based on a certain communication protocol, etc. The method can be used for applications such as improving the performance of a communication system and the like based on the dynamic configuration of the iteration times of the check code. The method may specifically comprise the steps of:

in step S302, the number of scheduled users in a predetermined time slot is acquired.

The content of the step S302 is the same as the content of the step S102 in the first embodiment, and the specific processing procedure of the step S302 may refer to the related content of the step S102 in the first embodiment, which is not described herein again.

In step S304, the input time and the output time of the code block scheduled by each user are determined according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of the code blocks of the check code scheduled by each user.

The check code scheduled by the user may be a low density parity check code, etc., and the embodiment of the present application describes in detail by taking the check code as the low density parity check code, and for other types of check codes, the check codes may be processed according to the following related contents, which is not described herein again.

In implementation, for the input time of the code block scheduled by each user, if the number of schedulable users in the predetermined slot is N, the magnitude value of each user scheduling matrix is mb respectively₀*kb₀，mb₁*kb₁，...，mb_N-1*kb_N-1The spreading factor of each user scheduling matrix may be Z₀，Z₁，...，Z_N-1The number of code blocks scheduled per user may be C₀，C₁，...，C_N-1If the time required for decoding the ldpc code constructed according to the row number index of the matrix is matrix c ycle, the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of code blocks of the ldpc code may be substituted into the following formula (1)

cyclc0_j＝C_j*ceil(8*Z_j/512)*kb_j(1)

And calculating to obtain the input time of the code block scheduled by each user.

The size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of code blocks of the check code scheduled by each user may be substituted into the following formula (2)

cyclc2_j＝C_j*ceil(1*Z_j/128)*(1+kb_j-mb_j) (2)

For example, if the number of schedulable users in the slot of the predetermined slot is 1, the size of the scheduling matrix is 46 × 68, the spreading factor of the scheduling matrix is 384, the number of code blocks scheduled by the user is 12, and the time required for decoding the low density parity check code constructed according to the row number index of the matrix is matrix cycle, the size of the scheduling matrix is 46 × 68, the spreading factor of the scheduling matrix is 384, and the number of code blocks of the scheduling check code is 12, the time required for decoding the low density parity check code is substituted into the above formula (1), and the cycle 0 is obtained₀＝12*ceil(8 × 384/512) × 68 × 4896, 4896 is the input time of the code block scheduled by the user. The magnitude value 46 x 68 of the user-scheduled matrix, the spreading factor 384 of the user-scheduled matrix, and the code block number 12 of the user-scheduled check code may be substituted into the above formula (2) to obtain the circ 2₀12 ceil (1 384/128) (1+68-46) 828, 828 is the output time of the user-scheduled code block.

In step S306, determining an iterative decoding time of each user-scheduled code block according to the size value of the matrix scheduled by each user, the number of code blocks of each user-scheduled check code, and the time required for decoding the check code constructed by the matrix row number index.

In implementation, the size value of the matrix scheduled by each user, the number of code blocks of the check code scheduled by each user, and the time required for decoding the check code constructed by the row number index of the matrix can be substituted into the following formula (3)

cyclc1_j＝C_j*ceil(MatrixCycle(mb_j)) (3)

Calculating to obtain one-time iterative decoding time of each user-scheduled code block, wherein the cyclic 1_jAnd the time of one-time iterative decoding of the code block scheduled by the jth user is shown, and the matrix C-cycle shows the time required by decoding the check code constructed by the row number index of the matrix.

For example, based on the above example of step S304, if the number of schedulable users in the predetermined slot is 1, the size of the scheduling matrix is 46 × 68, the spreading factor of the scheduling matrix is 384, the number of code blocks scheduled by the user is 12, and the time required for decoding the low density parity check code constructed according to the above matrix row number index is MatrixCycle, the size of the scheduling matrix is 46 × 68, the number of code blocks of the scheduling check code is 12, and the time required for decoding the check code constructed according to the matrix row number index is MatrixCycle, which are substituted into the above equation (3), so as to obtain cycle 1₀5664, 5664 is an iterative decoding time of the code block scheduled by the user.

In step S308, a time for iterative decoding is determined according to the input time and the output time of the code block scheduled by the newly transmitted user among the users and the input time and the output time of the code block scheduled by the retransmitted user among the users.

In an implementation, the sum of the input times of the code blocks scheduled by all the newly transmitted users in the users and the sum of the output times of the code blocks scheduled by all the newly transmitted users may be calculated, and similarly, the sum of the input times of the code blocks scheduled by all the newly transmitted users in the users and the sum of the output times of the code blocks scheduled by all the newly transmitted users may be calculated, and then, the sum of the input times and the sum of the output times of the code blocks scheduled by the newly transmitted users and the sum of the input times and the sum of the output times of the code blocks scheduled by all the newly transmitted users may be subtracted from the total time of the predetermined slot, and the obtained difference may be the time for iterative decoding.

For example, if the number of schedulable users in the predetermined slot is 1, the user is a newly transmitting user, the size value of the user scheduling matrix is 46 × 68, the spreading factor of the user scheduling matrix may be 384, the number of code blocks scheduled by the user may be 12, and the time required for decoding the low density parity check code constructed according to the matrix row number index is MatrixCycle, the input time of the code block scheduled by the user is 4896 and the output time of the code block scheduled by the user is 828, so that the sum of the input times of all the newly transmitting user scheduled code blocks is 4896, the sum of the output times is 828, the sum of the input times of all the code blocks scheduled by the retransmitting user is 0, and the sum of the output times is 0. Then, the total available cycle number for decoding the check code can be determined, wherein the processing time of the system for the processing chip is different, and the total available cycle number for decoding the check code can be different. If the maximum number of cycles supported by the processing chip in the predetermined slot is 100000, the time for iterative decoding is 100000-4896-828-94276.

For another example, the schedulable users in the predetermined slot include 3 users, wherein 1new transmission user and 2 retransmission users are included, and the size values of the scheduling matrixes of the 3 users are respectively5 × 27, 46 × 68, spreading factors of the 3 user scheduling matrices are 384, 384, 384, 3 user scheduling code blocks are 10, 10, 10, respectively, and a time required for decoding the low density parity check code constructed according to the matrix row index is matrix c, which is obtained based on the processing of the above steps S304 and S306: input time cyclec 0 of code block scheduled by 0 th user₀10 ceil (8 384/512) 27 1620, output time cyclec 2₀10 ceil (1 384/128) (1+27-5) 690, input time cyclec 0 of code block scheduled by the 1 st user₁10 ceil (8 ceil 384/512) 68 4080, output time cyclec 2₁10 ceil (1 384/128) (1+68-46) 690, input time cyclec 0 of code block scheduled by the 2 nd user₂10 ceil (8 ceil 384/512) 68 4080, output time cyclec 2₂10 ceil (1 384/128) (1+68-46) 690. If the index of the newly transmitted user is 0 and the indexes of the retransmitted users are 1 and 2, the input time accumulation of all code blocks scheduled by the newly transmitted users in the predetermined slot obtains the cycle 0New 1620, the output time accumulation obtains the cycle 2New 690, the input time accumulation of all the retransmitted users in the predetermined slot obtains the cycle 0Old 4080+4080 8160, and the output time accumulation obtains the cycle 2Old 690+ 1380, so that the time for iterative decoding is 100000 + 1620 +690 + 8160 + 1380 + 88150.

In step S310, an average iteration number corresponding to each user is determined according to the time for iterative decoding, the time for iterative decoding of the code block scheduled by the newly transmitted user, and the time for iterative decoding of the code block scheduled by the retransmitted user.

In implementation, the time for iterative decoding, the time for one iterative decoding of a newly transmitted user-scheduled code block, and the time for one iterative decoding of a retransmitted user-scheduled code block may be substituted into the following formula (4)

IterationNum＝min(floor(TmpCycle/(cyclc1New+cyclc1Old)),31)–1 (4)

Calculating to obtain average iteration times; wherein, IterationNum represents average iteration times, cycle 1New represents one-time iterative decoding time of a code block scheduled by a newly transmitted user, cycle 1Old represents one-time iterative decoding time of the code block scheduled by a retransmitted user, and tmpcle represents time available for iterative decoding.

For example, based on the example of step S308, if 1 schedulable user in the predetermined slot is 1, the user is a newly transmitting user, and the size value of the user scheduling matrix is 46 × 68, the spreading factor of the user scheduling matrix may be 384, the number of code blocks scheduled by the user may be 12, the time required for decoding the low density parity check code constructed according to the matrix row number index is MatrixCycle, the time accumulated for one iteration decoding is found to be cyc 1 ═ 5664, the time available for iteration decoding is found to be 94276, the time 94276 used for iteration decoding and the time accumulated 5664 used for iteration decoding may be substituted into the above formula (4) for calculation, and the average iteration number IterationNum ═ min (floor (94276/5664),31) -1 ═ 15 corresponding to the user may be obtained.

Based on the example of step S308, the schedulable users in the predetermined slot include 3 users, wherein the schedulable users include 1new transmission user and 2 retransmission users, the size values of the 3 user scheduling matrices are 5 × 27, 46 × 68 and 46 × 68, respectively, the spreading factors of the 3 user scheduling matrices are 384, 384 and 384, respectively, the number of the code blocks scheduled by the 3 users is 10, 10 and 10, respectively, the time required for decoding the low density parity check code constructed according to the matrix row index is MatrixCycle, and then the one-iteration decoding time of the code block scheduled by the 0 th user is circ 1₀10 × 121 × 1210, one iteration decoding time cycle 1 of the code block scheduled by the 1 st user₁10 × 472 × 4720, one iteration decoding time cyclec 1 of the 2 nd user-scheduled code block₂10 × 472 — 4720, the iterative decoding time corresponding to all New users in the predetermined slot is accumulated to obtain a cyclic 1New — 1210, and the iterative decoding time corresponding to all retransmission users in the predetermined slot is accumulated to obtain a cyclic 1Old — 4720+4720 — 9440, so that the average iteration number IterationNum — min (floor (88150/(1210+9440)),31) -1 — 7, corresponding to each user.

In step S312, if the average iteration count is greater than or equal to the predetermined iteration count threshold, the maximum iteration count corresponding to the new transmission user and the retransmission user is the predetermined iteration count threshold.

The predetermined iteration threshold may be set according to actual conditions, specifically 12 or 8.

In implementation, based on the example of step S308, if 1 schedulable user in the predetermined slot is available and the user is a newly transmitting user, and if the predetermined threshold value of the number of iterations is 12, the obtained average number of iterations corresponding to the user is 15, so that the maximum number of iterations corresponding to the newly transmitting user is 15.

If the average number of iterations is less than a predetermined threshold number of iterations, the processing may be based on the following steps S314 to S318.

In step S314, if the average iteration count is smaller than the predetermined iteration count threshold, the maximum iteration count of the newly transmitted user is the predetermined iteration count threshold.

In an implementation, for example, based on the above example of step S308, the users that can be scheduled in the predetermined slot include 3 users, where 1new transmission user and 2 retransmission users are included, and if the predetermined threshold of the number of iterations is 8, since the obtained average number of iterations for each user is 7, the maximum number of iterations for the new transmission user may be 8. The maximum iteration number corresponding to the retransmission user may be determined in various ways, or the iteration number corresponding to the retransmission user may not be adjusted. A manner of determining the maximum number of iterations corresponding to the retransmission user is provided below, and specific reference may be made to the processing of step S316 and step S318 below.

In step S316, an iterative decoding time for the retransmission user is acquired.

In an implementation, for the retransmission users, the retransmission users may be sorted in an ascending order according to the code block packet error rate of the check code, for example, based on the example of step S308, the schedulable users in the predetermined slot include 3 users, where 1new transmission user and 2 retransmission users are included, and the ascending order of the 2 retransmission users is 0 and 1. Then, an iterative decoding time that can be used for the retransmission user, i.e., TmpCycle '═ maxccycle-cycle 0 New-cycle 2 New-cycle 1New (Threshold +1), is calculated, resulting in TmpCycle' ═ 100000-.

In step S318, the maximum iteration count corresponding to each retransmission user is determined according to the iterative decoding time for the retransmission user.

In the implementation, if the retransmission users are arranged in ascending order according to the code block packet error rate, the following steps are performed: ue0, ue 1.., uei, then the maximum number of iterations for the retransmission user is calculated as follows: namely, taking index 0, ue1,., or uei respectively, and calculating T ' ═ TmpCycle ' -cycle 0 index-cycle 2 index-cycle 1index (Threshold +1), wherein TmpCycle ' ═ MaxCycle-cycle 0 New-cycle 2 New-cycle 1New (Threshold + 1). And if the T' >0, the maximum iteration number of the user index is the threshold of the iteration number. Otherwise, the user-to-user uei corresponding to the index does not carry out scheduling. That is, based on the example of step S316, it can be obtained that the maximum number of iterations corresponding to the retransmission user 0 is 8, and the number of iterations corresponding to the retransmission user 1 is not scheduled.

EXAMPLE III

Based on the same idea, the foregoing method for processing a check code provided in this embodiment of the present application further provides a device for processing a check code, as shown in fig. 4.

The processing device of the check code comprises: a user number obtaining module 401, a first time determining module 402, a second time determining module 403, an average number determining module 404, and a maximum number determining module 405, wherein:

a user number obtaining module 401, configured to obtain the number of users scheduled in a predetermined time slot;

a first time determining module 402, configured to determine input time, one-time iterative decoding time, and output time of a code block scheduled by each user according to a size value of a matrix scheduled by each user, a spreading factor of the matrix scheduled by each user, and a code block number of a check code scheduled by each user;

a second time determining module 403, configured to determine a time for iterative decoding according to an input time and an output time of a code block scheduled by a newly-transmitted user in the user and an input time and an output time of a code block scheduled by a retransmitted user in the user;

an average number determining module 404, configured to determine an average number of iterations corresponding to each user according to the time for iterative decoding, the time for iterative decoding of the code block scheduled by the newly transmitted user, and the time for iterative decoding of the code block scheduled by the retransmitted user;

a maximum number determining module 405, configured to determine the maximum number of iterations corresponding to each user according to the average number of iterations corresponding to each user.

In this embodiment of the present application, the maximum number determining module 405 is configured to, if the average iteration number is greater than or equal to a predetermined iteration number threshold, determine that the maximum iteration number corresponding to the new transmission user and the retransmission user is the predetermined iteration number threshold.

In this embodiment of the application, the maximum number of times determining module 405 is configured to, if the average number of iterations is less than a predetermined number of iterations threshold, determine that the maximum number of iterations of the newly-transmitted user is the predetermined number of iterations threshold.

In an embodiment of the present application, the apparatus further includes:

In this embodiment of the application, the first time determining module 402 includes:

In an embodiment of the present application, the first time determining unit is configured to:

cyclc0_j＝C_j*ceil(8*Z_j/512)*kb_j

Calculating to obtain the input time of the code block scheduled by each user;

cyclc2_j＝C_j*ceil(1*Z_j/128)*(1+kb_j-mb_j)

In an embodiment of the present application, the second time determining unit is configured to:

cyclc1_j＝C_j*ceil(MatrixCycle(mb_j))

In this embodiment of the application, the second time determining module 403 is configured to subtract the input time and the output time of the code block scheduled by the newly transmitting user and the input time and the output time of the code block scheduled by the retransmitting user from the maximum supported time duration in the predetermined time slot to obtain a corresponding difference, and use the obtained difference as the time for iterative decoding.

In this embodiment of the application, the average number determining module 404 is configured to:

Calculating the iteration num of min (floor (tmpcle/(cycle 1New + cycle 1Old)),31) -1 to obtain the average iteration number; wherein, IterationNum represents average iteration times, cycle 1New represents one-time iterative decoding time of the code block scheduled by the newly-transmitted user, cycle 1Old represents one-time iterative decoding time of the code block scheduled by the newly-transmitted user, and tmpcle represents time available for iterative decoding.

The embodiment of the application provides a processing device of check codes, which determines the input time, the one-time iterative decoding time and the output time of a code block scheduled by each user by acquiring the number of scheduled users in a preset time slot and further according to the value of the size of a matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the number of code blocks of the check codes scheduled by each user, then determines the time for iterative decoding according to the input time and the output time of the code block scheduled by a newly-transmitted user in the user and the input time and the output time of the code block scheduled by a re-transmitted user in the user, determines the average iterative times corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of the code block scheduled by the newly-transmitted user and the one-time iterative decoding time of the code block scheduled by the re-transmitted user, and finally determines the average iterative times corresponding to each user according to the, the maximum iteration times corresponding to each user are determined, so that the time for iterative decoding is determined through the input time and the output time of the code block scheduled by the newly transmitted user and the input time and the output time of the code block scheduled by the retransmitted user in the user, the average iteration times corresponding to each user are further determined, the maximum iteration times corresponding to each user are determined, the iteration times corresponding to each user can be dynamically adjusted according to the throughput of the system, the LDPC decoding performance is optimal, hardware resources are effectively utilized, and the performance of a communication system is improved.

Example four

Figure 5 is a schematic diagram of a hardware structure of an electronic device implementing various embodiments of the present application,

the electronic device 500 includes, but is not limited to: a radio frequency unit 501, a network module 502, an audio output unit 503, an input unit 504, a sensor 505, a display unit 506, a user input unit 507, an interface unit 508, a memory 509, a processor 510, and a power supply 511. Those skilled in the art will appreciate that the electronic device configuration shown in fig. 5 does not constitute a limitation of the electronic device, and that the electronic device may include more or fewer components than shown, or some components may be combined, or a different arrangement of components.

The processor 510 is configured to obtain the number of users scheduled in a predetermined time slot;

the processor 510 is further configured to determine input time, one-time iterative decoding time, and output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of the code blocks of the check code scheduled by each user;

the processor 510 is further configured to determine a time for iterative decoding according to an input time and an output time of a code block scheduled by a newly transmitted user among the users and an input time and an output time of a code block scheduled by a retransmitted user among the users;

the processor 510 is further configured to determine an average iteration number corresponding to each user according to the time for iterative decoding, the time for one iterative decoding of the code block scheduled by the newly transmitted user, and the time for one iterative decoding of the code block scheduled by the retransmitted user;

the processor 510 is further configured to determine a maximum iteration number corresponding to each user according to the average iteration number corresponding to each user.

In addition, the processor 510 is further configured to, if the average iteration number is greater than or equal to a predetermined iteration number threshold, set the maximum iteration number corresponding to the new transmission user and the retransmission user to be the predetermined iteration number threshold.

In addition, the processor 510 is further configured to determine that the maximum iteration number of the newly transmitted user is the predetermined iteration number threshold if the average iteration number is smaller than the predetermined iteration number threshold.

The processor 510 is further configured to obtain an iterative decoding time for the retransmission user; and determining the maximum iteration times corresponding to each retransmission user according to the iterative decoding time for the retransmission users.

In addition, the processor 510 is further configured to determine an input time and an output time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of the code blocks of the check code scheduled by each user;

the processor 510 is further configured to determine a one-time iterative decoding time of the code block scheduled by each user according to the size value of the matrix scheduled by each user, the code block number of the check code scheduled by each user, and the time required for decoding the check code constructed by the matrix row number index.

The processor 510 is further configured to substitute a size value of the matrix scheduled by each user, a spreading factor of the matrix scheduled by each user, and a number of code blocks of the check code scheduled by each user into the following formula

cyclc0_j＝C_j*ceil(8*Z_j/512)*kb_j

Calculating to obtain the input time of the code block scheduled by each user;

cyclc2_j＝C_j*ceil(1*Z_j/128)*(1+kb_j-mb_j)

In addition, the processor 510 is further configured to substitute the size value of the matrix scheduled by each user, the number of code blocks of the check code scheduled by each user, and the time required for decoding the check code constructed by the row number index of the matrix into the following formula

cyclc1_j＝C_j*ceil(MatrixCycle(mb_j))

In addition, the processor 510 is further configured to subtract the input time and the output time of the code block scheduled by the newly transmitting user and the input time and the output time of the code block scheduled by the retransmitting user from the maximum duration supported in the predetermined time slot to obtain corresponding difference values, and use the obtained difference values as the time for iterative decoding.

The processor 510 is further configured to substitute the time for iterative decoding, the time for one-time iterative decoding of the code block scheduled by the new transmission user, and the time for one-time iterative decoding of the code block scheduled by the retransmission user into the following formula

IterationNum＝min(floor(TmpCycle/(cyclc1New+cyclc1Old)),31)-1

The embodiment of the application provides an electronic device, which determines the input time, the one-time iterative decoding time and the output time of a code block scheduled by each user by acquiring the number of scheduled users in a preset time slot and further according to the numerical value of the size of a matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the number of the code blocks of a check code scheduled by each user, then determines the time for iterative decoding according to the input time and the output time of the code block scheduled by a newly-transmitted user in the user and the input time and the output time of the code block scheduled by a retransmitted user in the user, determines the average iterative times corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of the code block scheduled by the newly-transmitted user and the one-time iterative decoding time of the code block scheduled by the retransmitted user, and finally determines the average iterative times corresponding to each user according to the average iterative, the maximum iteration times corresponding to each user are determined, so that the time for iterative decoding is determined through the input time and the output time of the code block scheduled by the newly transmitted user and the input time and the output time of the code block scheduled by the retransmitted user in the user, the average iteration times corresponding to each user are further determined, the maximum iteration times corresponding to each user are determined, the iteration times corresponding to each user can be dynamically adjusted according to the throughput of the system, the LDPC decoding performance is optimal, hardware resources are effectively utilized, and the performance of a communication system is improved.

It should be understood that, in the embodiment of the present application, the radio frequency unit 501 may be used for receiving and sending signals during a message sending and receiving process or a call process, and specifically, receives downlink data from a base station and then processes the received downlink data to the processor 510; in addition, the uplink data is transmitted to the base station. In general, radio frequency unit 501 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like. In addition, the radio frequency unit 501 can also communicate with a network and other devices through a wireless communication system.

The electronic device provides wireless broadband internet access to the user via the network module 502, such as assisting the user in sending and receiving e-mails, browsing web pages, and accessing streaming media.

The audio output unit 503 may convert audio data received by the radio frequency unit 501 or the network module 502 or stored in the memory 509 into an audio signal and output as sound. Also, the audio output unit 503 may also provide audio output related to a specific function performed by the electronic apparatus 500 (e.g., a call signal reception sound, a message reception sound, etc.). The audio output unit 503 includes a speaker, a buzzer, a receiver, and the like.

The input unit 504 is used to receive an audio or video signal. The input Unit 504 may include a Graphics Processing Unit (GPU) 5041 and a microphone 5042, and the Graphics processor 5041 processes image data of a still picture or video obtained by an image capturing device (e.g., a camera) in a video capturing mode or an image capturing mode. The processed image frames may be displayed on the display unit 506. The image frames processed by the graphic processor 5041 may be stored in the memory 509 (or other storage medium) or transmitted via the radio frequency unit 501 or the network module 502. The microphone 5042 may receive sounds and may be capable of processing such sounds into audio data. The processed audio data may be converted into a format output transmittable to a mobile communication base station via the radio frequency unit 501 in case of the phone call mode.

The electronic device 500 also includes at least one sensor 505, such as light sensors, motion sensors, and other sensors. Specifically, the light sensor includes an ambient light sensor that can adjust the brightness of the display panel 5061 according to the brightness of ambient light, and a proximity sensor that can turn off the display panel 5061 and/or a backlight when the electronic device 500 is moved to the ear. As one type of motion sensor, an accelerometer sensor can detect the magnitude of acceleration in each direction (generally three axes), detect the magnitude and direction of gravity when stationary, and can be used to identify the posture of an electronic device (such as horizontal and vertical screen switching, related games, magnetometer posture calibration), and vibration identification related functions (such as pedometer, tapping); the sensors 505 may also include fingerprint sensors, pressure sensors, iris sensors, molecular sensors, gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc., which are not described in detail herein.

The display unit 506 is used to display information input by the user or information provided to the user. The Display unit 506 may include a Display panel 5061, and the Display panel 5061 may be configured in the form of a Liquid Crystal Display (LCD), an Organic Light-Emitting Diode (OLED), or the like.

The user input unit 507 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic device. Specifically, the user input unit 507 includes a touch panel 5071 and other input devices 5072. Touch panel 5071, also referred to as a touch screen, may collect touch operations by a user on or near it (e.g., operations by a user on or near touch panel 5071 using a finger, stylus, or any suitable object or attachment). The touch panel 5071 may include two parts of a touch detection device and a touch controller. The touch detection device detects the touch direction of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch sensing device, converts the touch information into touch point coordinates, sends the touch point coordinates to the processor 510, and receives and executes commands sent by the processor 510. In addition, the touch panel 5071 may be implemented in various types such as a resistive type, a capacitive type, an infrared ray, and a surface acoustic wave. In addition to the touch panel 5071, the user input unit 507 may include other input devices 5072. In particular, other input devices 5072 may include, but are not limited to, a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, a mouse, and a joystick, which are not described in detail herein.

Further, the touch panel 5071 may be overlaid on the display panel 5061, and when the touch panel 5071 detects a touch operation thereon or nearby, the touch operation is transmitted to the processor 510 to determine the type of the touch event, and then the processor 510 provides a corresponding visual output on the display panel 5061 according to the type of the touch event. Although in fig. 5, the touch panel 5071 and the display panel 5061 are two independent components to implement the input and output functions of the electronic device, in some embodiments, the touch panel 5071 and the display panel 5061 may be integrated to implement the input and output functions of the electronic device, and is not limited herein.

The interface unit 508 is an interface for connecting an external device to the electronic apparatus 500. For example, the external device may include a wired or wireless headset port, an external power supply (or battery charger) port, a wired or wireless data port, a memory card port, a port for connecting a device having an identification module, an audio input/output (I/O) port, a video I/O port, an earphone port, and the like. The interface unit 508 may be used to receive input (e.g., data information, power, etc.) from external devices and transmit the received input to one or more elements within the electronic apparatus 500 or may be used to transmit data between the electronic apparatus 500 and external devices.

The memory 509 may be used to store software programs as well as various data. The memory 509 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. Further, the memory 509 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.

The processor 510 is a control center of the electronic device, connects various parts of the whole electronic device by using various interfaces and lines, performs various functions of the electronic device and processes data by running or executing software programs and/or modules stored in the memory 509 and calling data stored in the memory 509, thereby performing overall monitoring of the electronic device. Processor 510 may include one or more processing units; preferably, the processor 510 may integrate an application processor, which mainly handles operating systems, user interfaces, application programs, etc., and a modem processor, which mainly handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into processor 510.

The electronic device 500 may further include a power supply 511 (e.g., a battery) for supplying power to various components, and preferably, the power supply 511 may be logically connected to the processor 510 via a power management system, so as to implement functions of managing charging, discharging, and power consumption via the power management system.

Preferably, an electronic device is further provided in this embodiment of the present application, and includes a processor 510, a memory 509, and a computer program that is stored in the memory 509 and can be run on the processor 510, and when being executed by the processor 510, the computer program implements each process of the above-mentioned check code processing method embodiment, and can achieve the same technical effect, and in order to avoid repetition, details are not described here again.

EXAMPLE five

The embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the foregoing check code processing method embodiment, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.

The embodiment of the application provides a computer-readable storage medium, which determines the input time, the one-time iterative decoding time and the output time of a code block scheduled by each user by acquiring the number of scheduled users in a preset time slot, further determining the input time, the one-time iterative decoding time and the output time of the code block scheduled by each user according to the numerical value of the size of a matrix scheduled by each user, the spreading factor of the matrix scheduled by each user and the number of code blocks of check codes scheduled by each user, then determining the time for iterative decoding according to the input time and the output time of the code block scheduled by a newly-transmitted user in the users and the input time and the output time of the code block scheduled by a re-transmitted user in the users, determining the average iterative times corresponding to each user according to the time for iterative decoding, the one-time iterative decoding time of the code block scheduled by the newly-transmitted user and the one-time iterative decoding time scheduled by, the maximum iteration times corresponding to each user are determined, so that the time for iterative decoding is determined through the input time and the output time of the code block scheduled by the newly transmitted user and the input time and the output time of the code block scheduled by the retransmitted user in the user, the average iteration times corresponding to each user are further determined, the maximum iteration times corresponding to each user are determined, the iteration times corresponding to each user can be dynamically adjusted according to the throughput of the system, the LDPC decoding performance is optimal, hardware resources are effectively utilized, and the performance of a communication system is improved.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A check code processing method is characterized by comprising the following steps:

acquiring the number of scheduled users in a preset time slot;

2. The method according to claim 1, wherein determining the maximum number of iterations for each user according to the average number of iterations for each user comprises:

3. The method according to claim 1, wherein determining the maximum number of iterations for each user according to the average number of iterations for each user comprises:

4. The method of claim 1, further comprising:

obtaining iterative decoding time for the retransmission user;

5. The method of claim 1, wherein determining the input time, the one-iteration decoding time, and the output time of each user-scheduled code block according to the magnitude value of the matrix scheduled by each user, the spreading factor of the matrix scheduled by each user, and the number of code blocks of the check code scheduled by each user comprises:

6. The method of claim 5, wherein determining the input time and the output time of each user-scheduled code block according to the magnitude value of the matrix for each user schedule, the spreading factor of the matrix for each user schedule, and the number of code blocks of each user-scheduled check code comprises:

cyclc0_j＝C_j*ceil(8*Z_j/512)*kb_j

Calculating to obtain the input time of the code block scheduled by each user;

cyclc2_j＝C_j*ceil(1*Z_j/128)*(1+kb_j-mb_j)

7. The method of claim 6, wherein determining an iterative decoding time of each user-scheduled code block according to the size value of the matrix scheduled by each user and the number of code blocks of the check code scheduled by each user, and the time required for decoding the check code constructed by the matrix row number index comprises:

cyclc1_j＝C_j*ceil(MatrixCycle(mb_j))

8. The method of claim 1, wherein determining the time for iterative decoding according to the input time and the output time of the code block scheduled by the newly transmitted one of the users and the input time and the output time of the code block scheduled by the retransmitted one of the users comprises:

9. The method of claim 1, wherein determining an average number of iterations for each user according to the time for iterative decoding, the time for iterative decoding of the newly transmitted user-scheduled code block, and the time for iterative decoding of the retransmitted user-scheduled code block comprises:

10. An apparatus for processing a check code, the apparatus comprising:

11. The apparatus according to claim 10, wherein the maximum number determining module is configured to determine the maximum number of iterations corresponding to the new user and the retransmission user as a predetermined threshold number of iterations if the average number of iterations is greater than or equal to the predetermined threshold number of iterations.

12. The apparatus of claim 10, wherein the maximum number determining module is configured to determine the maximum number of iterations of the newly transmitted user to be the predetermined threshold number of iterations if the average number of iterations is less than the predetermined threshold number of iterations.

13. The apparatus of claim 10, further comprising:

14. The apparatus of claim 10, wherein the first time determining module comprises:

15. An electronic device comprising a processor, a memory and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the method of processing check codes according to any one of claims 1 to 9.

16. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method of processing a check code according to any one of claims 1 to 9.