Data processing method, communication node, storage medium, and program product

Abstract

The present application provides a data processing method, a communication node, a storage medium, and a program product. The data processing method is applied to a first communication node and comprises: acquiring a bit sequence to be encoded; on the basis of encoding requirement information of said bit sequence and support information of base matrices in a base matrix set, determining a target base matrix from the base matrix set; and encoding said bit sequence by means of the target base matrix to determine a target encoded bit sequence, wherein the base matrix set at least comprises two base matrices.

Description

Data processing method, communication node, storage medium and program product TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, for example, to a data processing method, a communication node, a storage medium and a program product. BACKGROUND

[0002] With the rapid development of big data, cloud computing, latency-sensitive network and other technologies, user equipment in wireless communication networks is growing explosively, and wireless communication networks will carry diverse applications and massive data, which puts high requirements on data transmission rate, throughput, reliability, latency and the like. When data transmission is performed in a data transmission channel in a wireless communication system, errors in data transmission often occur due to the influence of factors such as multipath, noise and interference. The sending end adds some redundant information to the data to be transmitted through channel coding, so that the receiving end can recover the original data to be transmitted through the redundant information, that is, eliminate the distortion caused by data transmission.

[0003] A commonly used channel coding method can include low density parity check (LDPC) coding, polarization coding, turbo coding and convolutional coding and the like. LDPC coding is defined by a sparse parity check matrix, and the decoding performance can be improved through iterative decoding, wherein the parity check matrix can be obtained by a base matrix and a lifting value.

[0004] However, multiple different base matrices can exist in the data channel at the same time, and the coding and decoding transmission of the data to be transmitted suitable for different information lengths and code rate intervals, and since the same base matrix can support multiple code rates, the support code rates can overlap between different base matrices, and in this case, how to select a base matrix to make the decoding performance optimal is a problem before coding and decoding. With the increasing requirements of communication peak rate in wireless communication systems, the channel coding method will be difficult to meet the demand of data communication robustness. SUMMARY

[0005] The present application provides a data processing method, a communication node, a storage medium and a program product to solve the problem that multiple base matrices exist in LDPC coding, support code rates overlap, and appropriate base matrices cannot be selected for the required transmission data for coding and decoding processing, thereby improving the error correction performance of data packets and increasing the robustness of data communication.

[0006] The present application provides a data processing method, a communication node, a storage medium and a program product to solve the problem that multiple base matrices exist in LDPC coding, support code rates overlap, and appropriate base matrices cannot be selected for the required transmission data for coding and decoding processing, thereby improving the error correction performance of data packets and increasing the robustness of data communication.

[0007] acquire a to-be-encoded bit sequence; determine a target base matrix from a base matrix set according to encoding requirement information of the to-be-encoded bit sequence and support information of each base matrix in the base matrix set; encode the to-be-encoded bit sequence by using the target base matrix to determine a target encoded bit sequence; and the base matrix set includes at least two base matrices.

[0008] The embodiment of the present application provides a data processing method, which is applied to a second communication node and includes the following steps:

[0009] acquire a to-be-decoded bit sequence; determine a target base matrix from a base matrix set according to decoding requirement information of the to-be-decoded bit sequence and support information of each base matrix in the base matrix set; and decode the to-be-decoded bit sequence by using the target base matrix to determine a target decoded bit sequence; and the base matrix set includes at least two base matrices.

[0010] The embodiment of the present application provides a communication node, which includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus used for realizing connection communication between the processor and the memory, and the program is executed by the processor to realize the data processing method in any one of the embodiments of the present application.

[0011] The embodiment of the present application provides a storage medium, which is used for computer readable storage, and the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to realize the data processing method in any one of the embodiments of the present application.

[0012] The embodiment of the present application further provides a computer program product, which includes a computer program, and the computer program realizes the data processing method in any one of the embodiments of the present application when executed by a processor.

[0013] The data processing method, the communication node, the storage medium and the program product provided by the embodiment of the present application acquire a to-be-encoded bit sequence; determine a target base matrix from a base matrix set according to encoding requirement information of the to-be-encoded bit sequence and support information of each base matrix in the base matrix set; encode the to-be-encoded bit sequence by using the target base matrix to determine a target encoded bit sequence; and the base matrix set includes at least two base matrices. Through the above technical solution, the target base matrix most suitable for the to-be-encoded bit sequence is selected from the base matrix set including multiple base matrices according to the encoding requirement of the to-be-encoded bit sequence, and then the to-be-encoded bit sequence is encoded by using the target base matrix, so that the error correction performance of the data packet in the encoding process is improved, and the robustness of data communication is increased. BRIEF DESCRIPTION OF DRAWINGS

[0014] FIG. 1 is an example diagram of a data transmission implementation environment provided by the present application;

[0015] FIG. 2 is a flow diagram of a data processing method according to an embodiment of the present application;

[0016] FIG. 3 is an example diagram of a target base matrix selection method under different code rates according to an embodiment of the present application;

[0017] FIG. 4 is an example diagram of a target base matrix selection method under different code rates according to an embodiment of the present application;

[0018] FIG. 5 is a flow diagram of a data processing method according to an embodiment of the present application;

[0019] FIG. 6 is a structural diagram of a data processing apparatus according to an embodiment of the present application;

[0020] FIG. 7 is a structural diagram of a data processing apparatus according to an embodiment of the present application;

[0021] FIG. 8 is a structural diagram of a communication node according to an embodiment of the present application. DETAILED DESCRIPTION

[0022] The embodiments in the present application and the features in the embodiments can be combined with each other without conflict.

[0023] The operations shown in the flow diagrams of the drawings can be performed in a computer system such as a set of computer-executable instructions. Also, although a logical order is shown in the flow diagrams, in some cases, the operations shown or described can be performed in an order different from that shown here.

[0024] The data processing method provided by the embodiments of the present application can be applied to various mobile communication networks, including third generation (3G), fourth generation (4G), fifth generation (5G), and future mobile communication networks such as sixth generation (6G) mobile communication networks. In the embodiments of the present application, the mobile communication network can include a network side device (e.g., a base station) and a receiving side device (e.g., a terminal). In the present example, in the downlink, for example, the first communication node (also referred to as the first communication node device or the first node) can be a base station side device, and the second communication node (also referred to as the second communication node device or the second node) can be a terminal side device. In some examples, in the uplink, for example, the first communication node can also be a terminal side device, and the second communication node can also be a base station side device. In some examples, such as in device-to-device communication, the first communication node and the second communication node can both be base stations or terminals. The first communication node and the second communication node can be referred to as the first node and the second node, respectively. Therefore, whether the first node and the second node are base stations or terminals needs to be determined according to the context.

[0025] In order to facilitate the understanding of the technical solutions of the present application, firstly, the selection of the LDPC code base matrix and the application scene of the encoding method are introduced in detail. The data processing method provided in the embodiments of the present application can be applied to any related scene needing wireless data transmission. In the data transmission process, due to the influence of factors such as multipath, noise and interference, the LDPC code as a channel encoding method can eliminate the distortion caused in the transmission process.

[0026] Fig. 1 is an example diagram of a data transmission implementation environment provided by the present application, which includes a first transmission node 100 and a second transmission node 200, wherein the first transmission node 100 and the second transmission node 200 can send, receive and interact with each other related wireless signals.

[0027] In one example, the first transmission node 100 and the second transmission node 200 can include the following electronic devices: a base station (BS), an access point (AP), a node B, a g node B (generalized node B), a radio network controller (RNC), an evolved node B (eNB), a base station controller (BSC), a base transceiver station (BTS), a transceiver function (TF), a radio router, a radio transceiver, a basic service set (BSS), an extended service set (ESS), or a radio base station (RBS). The first transmission node 100 and the second transmission node 200 can also be an access terminal, a user equipment (UE), a subscriber unit, a subscriber station, a mobile station, a mobile, a remote station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, or a user device. For example, the second processing node can be a cellular telephone, a cordless telephone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device having wireless communication function, a computing device, or other processing devices connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a 5G network or a future 5G and above network, etc., and the embodiments of the present application do not limit this.

[0028] In combination with the above data transmission implementation environment, the execution subject of the data processing method in the embodiments of the present application is generally an electronic device with certain computing capability, and in some possible implementation manners, the data processing method can be realized by a processor calling computer readable instructions stored in a memory.

[0029] In one example embodiment, FIG. 2 is a flow diagram of a data processing method provided by the embodiments of the present application, which can be applied to the case of selecting the most suitable LDPC code base matrix for a bit sequence requiring encoding and decoding processing. The method can be executed by a data processing device, which can be executed by software and / or hardware and integrated on a communication node. The method can be applied to a first communication node, which can be the first transmission node in the data transmission implementation environment shown in FIG. 1, or can be a corresponding execution subject selected and set by those skilled in the art according to actual application scenarios, which is not limited in the embodiments of the present application.

[0030] As shown in FIG. 2, the data processing method provided by the embodiments of the present application specifically includes S101-S103.

[0031] S101, obtaining a to-be-encoded bit sequence.

[0032] In the embodiment, the to-be-encoded bit sequence can be specifically understood as a bit sequence composed of a plurality of information bits requiring encoding and transmission.

[0033] In the embodiment, when the first communication node needs to perform wireless data transmission to the second communication node corresponding thereto, the original data requiring data transmission can be obtained first, that is, the to-be-encoded bit sequence requiring encoding and transmission is obtained.

[0034] S102, determining a target base matrix from the base matrix set according to the encoding requirement information of the to-be-encoded bit sequence and the support information of each base matrix in the base matrix set.

[0035] The base matrix set includes at least two base matrices.

[0036] In the embodiment, the encoding requirement information can be specifically understood as information determined according to the requirement characteristics of the to-be-encoded bit sequence when requiring encoding and transmission. The support information can be specifically understood as information determined based on the inherent characteristics of the base matrix, which can support or adapt to the requirement characteristics.

[0037] In the embodiment, the encoding requirement information of the to-be-encoded bit sequence is compared with the support information of each base matrix in the base matrix set, and the base matrix in the base matrix set whose support information is most adapted to the encoding requirement information is determined as the target base matrix.

[0038] S103, encoding the to-be-encoded bit sequence through the target base matrix to determine a target encoded bit sequence.

[0039] In the embodiment, the target base matrix is expanded based on the lifting value corresponding to the to-be-encoded bit sequence, and the to-be-encoded bit sequence is encoded by using the expanded matrix, and the encoded to-be-encoded bit sequence is processed into a code length required for transmission by puncturing or other processing methods, to obtain a target encoded bit sequence.

[0040] The data processing method provided in the embodiments of the present application comprises the following steps: obtaining a to-be-encoded bit sequence; determining a target base matrix from a base matrix set according to encoding requirement information of the to-be-encoded bit sequence and support information of each base matrix in the base matrix set; and encoding the to-be-encoded bit sequence by using the target base matrix to determine a target encoded bit sequence. The base matrix set comprises at least two base matrices. By using the above technical solution, the target base matrix most suitable for the to-be-encoded bit sequence is selected from the base matrix set comprising multiple base matrices according to the encoding requirement of the to-be-encoded bit sequence, and the to-be-encoded bit sequence is encoded by using the target base matrix, thereby improving the error correction performance of the data packet in the encoding process and increasing the robustness of data communication.

[0041] In an embodiment, the encoding requirement information comprises a code rate of the to-be-encoded bit sequence, and the support information comprises a base code rate and a code rate threshold of each base matrix. The target base matrix is determined from the base matrix set according to the encoding requirement information of the to-be-encoded bit sequence and the support information of each base matrix in the base matrix set, comprising:

[0042] The target base matrix is determined from the base matrix set according to the code rate of the to-be-encoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set. The code rate, the base code rate and the code rate threshold are all real numbers greater than 0 and less than 1. The absolute value of the difference between the base code rates of any two base matrices in the base matrix set is greater than or equal to a first preset difference threshold.

[0043] In the embodiment, the base code rate can be understood as the encoding code rate that can be supported by the base matrix according to the number of rows and columns of the base matrix and the puncturing condition. In some examples, the base code rate of the base matrix can be represented by the range of the encoding code rate that can be supported by the base matrix. In some examples, the starting point in the range of the encoding code rate that can be supported by the base matrix can be taken as the base code rate of the base matrix.

[0044] In the embodiment, the code rate threshold can be understood as a threshold used to distinguish the range of the encoding code rate that can be supported by different base matrices.

[0045] In the embodiment, the first preset difference threshold can be understood as a threshold preset according to actual conditions, used to ensure that there is a difference in the range of the encoding code rate that can be supported by each base matrix in the base matrix set. In an example, the first preset difference threshold can be 0.01.

[0046] In the embodiment, the encoding rate range that each base matrix in the base matrix set can provide for the to-be-encoded bit sequence is determined according to the base rate of each base matrix in the base matrix set and the rate threshold used to distinguish the encoding rate range supported by different base matrices. Then, the base matrix corresponding to the encoding rate range containing the rate of the to-be-encoded bit sequence is determined as the target base matrix.

[0047] In an embodiment, when the number of rows of each base matrix in the base matrix set is equal and the number of columns of each base matrix is equal, the target base matrix is determined from the base matrix set according to the rate of the to-be-encoded bit sequence and the base rate and the rate threshold of each base matrix in the base matrix set, including at least one of the following:

[0048] When the rate of the to-be-encoded bit sequence is greater than or equal to a first rate threshold and less than a second rate threshold, the latter base matrix in the adjacent base matrices distinguished by the first rate threshold is determined as the target base matrix; the first rate threshold and the second rate threshold are two adjacent rate thresholds corresponding to the base matrix set in terms of numerical value; when the rate of the to-be-encoded bit sequence is less than the smallest rate threshold corresponding to the base matrix set, the base matrix with the smallest base rate in the base matrix set is determined as the target base matrix; when the rate of the to-be-encoded bit sequence is greater than or equal to the largest rate threshold corresponding to the base matrix set, the base matrix with the largest base rate in the base matrix set is determined as the target base matrix.

[0049] In the embodiment, when the number of rows of each base matrix in the base matrix set is equal and the number of columns of each base matrix is equal, it can be considered that the base rate corresponding to each base matrix in the base matrix set is different due to the different puncturing numbers. In order to enable the to-be-encoded bit sequence to select the target base matrix most suitable for its encoding requirement from the base matrix set, the determination of the target base matrix from the base matrix set can be divided into the following three cases based on the rate threshold used to distinguish the encoding rate range supported by different base matrices:

[0050] 1) When the rate of the to-be-encoded bit sequence is less than the smallest rate threshold corresponding to the base matrix set, it can be considered that the base rate corresponding to all the base matrices in the base matrix set is difficult to completely adapt to the encoding requirement of the to-be-encoded bit sequence, and the greater the base rate of the base matrix, the greater the error caused by the encoding of the to-be-encoded bit sequence by the base matrix. Therefore, the base matrix with the smallest base rate in the base matrix set can be determined as the target base matrix.

[0051] 2) When the code rate of the bit sequence to be encoded is greater than or equal to the maximum code rate threshold corresponding to the basic matrix set, it can be considered that the basic code rates corresponding to all basic matrices in the basic matrix set are difficult to fully adapt to the encoding requirements of the bit sequence to be encoded. Encoding the bit sequence to be encoded with a basic matrix with a smaller basic code rate will cause a greater error. Therefore, the basic matrix with the largest basic code rate in the basic matrix set can be used as the target basic matrix.

[0052] 3) Using any two adjacent code rate thresholds from the set of fundamental matrices as the first and second code rate thresholds, respectively, if the code rate of the bit sequence to be encoded is greater than or equal to the first code rate threshold and less than the second code rate threshold, then fundamental matrices whose code rates fall within the range of the first and second code rate thresholds can achieve better encoding results when encoding the bit sequence. Furthermore, since the first and second code rate thresholds can be used to distinguish between the fundamental code rate and its two adjacent fundamental matrices, and when the first and second code rate thresholds are two adjacent code rate thresholds with adjacent values, it can be considered that the latter fundamental matrix among the two adjacent fundamental matrices distinguished by the first code rate threshold is the same fundamental matrix as the former fundamental matrix among the two adjacent fundamental matrices distinguished by the second code rate threshold. In this case, this fundamental matrix can be used as the target fundamental matrix.

[0053] In some examples, it is assumed that the set of fundamental matrices contains M fundamental matrices, and each of the M fundamental matrices corresponds to one of the M fundamental code rates, R0, R1, ..., R... M-1 All are real numbers greater than 0 and less than 1, R0 <R1<,...,<R M-1 Base bitrate R i Corresponding to the fundamental matrix Hb in the fundamental matrix set i Figure 3 is an example diagram of a target base matrix selection method under different code rates provided in an embodiment of this application. As shown in Figure 3, the base code rate R i Corresponding to the fundamental matrix Hb in the fundamental matrix set i ;T i The bitrate threshold used to distinguish the i-th fundamental matrix from the (i+1)-th fundamental matrix should be located within R. i and R i+1 Between these, the target fundamental matrix corresponding to the code rate R can be determined based on the relationship between the code rate R of the bit sequence to be encoded and different code rate thresholds. For example, when T i-1 <R≤T i When selecting Hb i This is the fundamental matrix corresponding to the bitrate; when T i+1 ≥R>T i Select Hb i+1is the base matrix corresponding to this code rate; when the code rate R < T0, select Hb0 as the base matrix corresponding to this code rate; when R ≥ T M-1 , select Hb M-1 as the base matrix corresponding to this code rate.

[0054] In one example, there are M = 3 base matrices in the base matrix set, which respectively correspond to M = 3 base code rates one by one. The number of rows mb of the 3 base matrices is all equal to 4, and the number of columns nb of the 3 base matrices is all equal to 12. The total number of punctured columns Δnb corresponding to the three base matrices Hb0, Hb1, and Hb2 are 0, 1, and 2 respectively. Then the base code rates corresponding to the three base matrices Hb0, Hb1, and Hb2 are R0 = 8 / 12, R1 = 8 / 11, R2 = 8 / 10 respectively. That is, R0 is the base code rate obtained when Hb0 does not puncture any column, R1 is the base code rate obtained when Hb1 punctures one column, and R2 is the base code rate obtained when Hb2 punctures two columns. Assume that the code rate threshold T0 = 23 / 33 for distinguishing Hb0 and Hb1, and the code rate threshold T1 = 42 / 55 for distinguishing Hb1 and Hb2. If the code rate R of the bit sequence to be encoded is 17 / 25, at this time R < T0, Hb0 can be determined as the target base matrix corresponding to the bit sequence to be encoded; if the code rate R of the bit sequence to be encoded is 18 / 25, at this time T0 < R ≤ T1, Hb1 can be determined as the target base matrix corresponding to the bit sequence to be encoded; if the code rate R of the bit sequence to be encoded is 21 / 25, at this time R > T1, Hb2 can be determined as the target base matrix corresponding to the bit sequence to be encoded.

[0055] In one embodiment, the method for determining the base code rate includes:

[0056] Determine the difference between the number of columns and the number of rows of the base matrix as the first difference; determine the difference between the number of columns of the base matrix and the total number of punctured columns as the second difference; determine the ratio of the first difference to the second difference as the base code rate of the base matrix; where the total number of punctured columns is a non - negative real number less than the number of rows of the base matrix.

[0057] In some examples, assume that the number of rows of the base matrix is mb, the number of columns of the base matrix is nb, and the total number of punctured columns after puncturing the base matrix is Δnb. Then nb - mb can be determined as the first difference, nb - Δnb can be determined as the second difference, and the ratio of the first difference to the second difference is determined as the base code rate. Then the base code rate R of the base matrix can be expressed as:

[0058] In some embodiments, the base matrix includes a systematic column matrix and a parity - check column matrix. In a specific example, the base matrix Hb has the following specific structure: [Hb s , Hb P ​

[0059] wherein Hb s is a system column matrix, Hb P is a check column matrix, the system column matrix Hb s has a number of rows equal to a number of rows of the check column matrix Hb P , equal to mb; the system column matrix Hb s has a number of columns equal to kb; the check column matrix Hb P has a number of columns equal to mb; wherein kb = nb - mb, i.e. the number of columns of the system column matrix of the base matrix is equal to the difference between the number of columns and the number of rows of the base matrix. Wherein kb, nb and mb are all integers greater than 0.

[0060] In one example, kb is an integer greater than or equal to 6, which can be equal to at least one of the following: 6, 8, 9, 10, 12, 14, 16, 18, 20, 24, 28, 32.

[0061] As can be seen from the above, the number of columns of the check column matrix is equal to the number of rows of the base matrix, so the total number of puncturing should be a non-negative real number less than the number of rows of the base matrix.

[0062] In an embodiment, the determination of the code rate threshold comprises at least one of the following:

[0063] determined by a preset expression; determined by a first preset code rate threshold table; wherein the first preset code rate threshold table contains a corresponding relationship between the code rate threshold and the base code rate interval; determined by a second preset code rate threshold table; wherein the second preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate interval and the promotion value interval; determined by a third preset code rate threshold table; wherein the third preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate interval and the information bit interval in which the length of the to-be-encoded bit sequence is located; determined by a preset process; wherein the preset process is a judgment statement based on the first preset code rate threshold table, the second preset code rate threshold table or the third preset code rate threshold table.

[0064] In an embodiment, the numerical relationship satisfied by the code rate threshold in the preset expression comprises at least one of the following:

[0065] wherein |AR| is a real number less than . wherein R i is the base code rate of the i-th base matrix in the base matrix set; R i+1 is the base code rate of the i+1-th base matrix in the base matrix set; T ia code rate threshold value used to distinguish between the i-th base matrix and the i+1-th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0066] In some examples, a first preset code rate threshold table can be constructed in advance based on the correspondence between the code rate threshold value and the base code rate interval, and the first preset code rate threshold table has the following characteristics: the size of the code rate threshold table is M-1, the code rate size belongs to the interval [R i ,R i+1 ) to obtain the i-th code rate threshold T i ; the i+1-th code rate threshold in the code rate threshold table is greater than the i-th code rate threshold, and the i-th code rate threshold T i satisfies R i ≤T i <R i+1 . For example, the first preset code rate threshold table can be represented in the following table form:

[0067] In one example, the code rate threshold is obtained according to the first preset code rate threshold table, and in this example, there are M=3 base matrices in the base matrix set, which are one-to-one corresponding to M=3 base code rates, and the number of rows mb of the three base matrices is equal to 4, and the number of columns nb of the three base matrices is equal to 12. The total number of puncturing of the three base matrices Hb0, Hb1 and Hb2 corresponding to the total number of puncturing is 0, 1 and 2, respectively, and the base code rate of the three base matrices Hb0, Hb1 and Hb2 is R0=8 / 12, R1=8 / 11, R2=8 / 10. The first preset code rate threshold table is shown in the following table, the code rate threshold T0=0.70, T1=0.75; at this time, if the code rate R=0.76, then R>T1 exists, and Hb2 can be determined as the target base matrix.

[0068] In some examples, a second preset code rate threshold table can be constructed in advance based on the correspondence between the code rate threshold value and the base code rate interval and the lifting value interval, and the second preset code rate threshold table has the following characteristics: the size of the code rate threshold table is P*(M-1), P is the number of lifting value intervals, and M-1 is the number of base code rate intervals. The code rate size belongs to the base code rate interval [R i ,R i+1 ) and the lifting value belongs to the lifting value interval [Z j ,Z j+1 ) to obtain the code rate threshold T j,i ; the i+1-th code rate threshold in the j-th row of the code rate threshold table is greater than the i-th code rate threshold, that is, T j,i+1 >T j,i ; the j+1-th code rate threshold in the i-th column of the code rate threshold table is less than or equal to the j-th code rate threshold, that is, T j+1,i ≤Tj,i ; code rate threshold T i,j satisfies R i ≤T j,i <R i+1 , where i is an integer greater than or equal to 0 and less than or equal to M-2, j is an integer greater than or equal to 0 and less than or equal to P-1, Z j is a preset lifting value greater than 0. For example, the second preset code rate threshold table can be represented in the following table:

[0069] In one example, the code rate threshold is obtained according to the second preset code rate threshold table, in which there are M=3 base matrices in the base matrix set, which one-to-one correspond to M=3 base code rates, the number of rows mb of the 3 base matrices is equal to 4, and the number of columns nb of the 3 base matrices is equal to 12. The total number of puncturing corresponding to the three base matrices Hb0, Hb1 and Hb2 is 0, 1 and 2, respectively, and the base code rates corresponding to the three base matrices Hb0, Hb1 and Hb2 are R0=8 / 12, R1=8 / 11 and R2=8 / 10, respectively. The second preset code rate threshold table is shown in the following table. It can be seen that when the code rate R0≤R<R1 and the lifting value is in the interval 32≤Z<256, the code rate threshold is 0.70, and when the code rate R0≤R<R1 and the lifting value is in the interval 256≤Z<513, the code rate threshold is 0.69; when the code rate R1≤R<R2 and the lifting value is in the interval 32≤Z<256, the code rate threshold is 0.76, and when the code rate R1≤R<R2 and the lifting value is in the interval 256≤Z<513, the code rate threshold is 0.75. It can be understood that the lifting value range in the example can be other values, and the embodiments of the present application do not limit this. In an embodiment, the lifting value is an integer greater than 0, for example, it can be equal to an integer power of 2, in one example, the lifting value can be equal to 8, 16, 32, 64, 128, 256 or 512; in another example, the lifting value can be equal to 3, 6, 12, 24, 48, 96, 192 or 384; in yet another example, the lifting value is equal to p*2 q , and is less than or equal to 512, p is equal to an element in the set {2, 3, 5, 7, 9, 11, 13, 15}, and q is equal to an element in the set {0, 1, 2, 3, 4, 5, 6, 7, 8}.

[0070] In some examples, a third preset code rate threshold table can be constructed in advance based on the correspondence between the code rate threshold and the base code rate interval, and the information bit interval in which the length of the to-be-encoded bit sequence is located, and the third preset code rate threshold table has the following characteristics: the size of the code rate threshold table is P*(M-1), P is the number of information bit intervals, and M-1 is the number of base code rate intervals. The code rate size belongs to the base code rate interval [Ri R i+1 ) and the length of the information bits belongs to the information bit interval [K j , K j+1 ), the code rate threshold T j,i is obtained; the (i+1)th code rate threshold in the jth row of the code rate threshold table is greater than the ith code rate threshold, that is, T j,i+1 > T j,i ; the (j+1)th code rate threshold in the ith column of the code rate threshold table is less than or equal to the jth code rate threshold, that is, T j+1,i ≤ T j,i ; the code rate threshold T i,j satisfies R i ≤ T j,i < R i+1 . Wherein, i is an integer greater than or equal to 0 and less than or equal to M-2, j is an integer greater than or equal to 0 and less than or equal to P-1, K j is a preset information bit length greater than 0. For example, the third preset code rate threshold table can be represented in the following table form:

[0071] In one example, the code rate threshold is obtained according to the third preset code rate threshold table, in which there are M=3 base matrices in the base matrix set, which one-to-one correspond to M=3 base code rates, and the number of rows mb of the 3 base matrices are all equal to 4 and the number of columns nb of the 3 base matrices are all equal to 12. The total number of puncturing corresponding to the three base matrices Hb0, Hb1 and Hb2 is 0, 1 and 2, respectively, and the base code rates corresponding to the three base matrices Hb0, Hb1 and Hb2 are R0=8 / 12, R1=8 / 11 and R2=8 / 10, respectively. The third preset code rate threshold table is shown in the following table. When the code rate R0≤R<R1 and the information length K is in the interval 1024≤K<4096, the code rate threshold is 0.69; when the code rate R1≤R<R2 and the information length K is in the interval 1024≤K<4096, the code rate threshold is 0.75. It can be understood that the information length range in this example can be other values, and the embodiments of the present application do not limit this.

[0072] In some examples, the above-mentioned first preset code rate threshold table, second preset code rate threshold table and third preset code rate threshold table can be characterized by a judgment statement to determine the code rate threshold according to the base code rate interval, the lifting value interval and the information bit interval.

[0073] In an embodiment, in the case that there are at least two base matrices in the base matrix set which have different row numbers, different column numbers, and equal difference between column number and row number, a target base matrix is determined from the base matrix set according to the code rate of the bit sequence to be encoded, and the base code rates of the base matrices in the base matrix set and the code rate thresholds, including at least one of the following:

[0074] In the case that the code rate of the bit sequence to be encoded is greater than or equal to a third code rate threshold and less than a fourth code rate threshold, the latter base matrix in the adjacent base matrices distinguished by the third code rate threshold is determined as the target base matrix; wherein the third code rate threshold and the fourth code rate threshold are two adjacent code rate thresholds corresponding to the base matrix set; in the case that the code rate of the bit sequence to be encoded is less than the smallest code rate threshold corresponding to the base matrix set, the base matrix with the smallest base code rate in the base matrix set is determined as the target base matrix; in the case that the code rate of the bit sequence to be encoded is greater than or equal to the largest code rate threshold corresponding to the base matrix set, the base matrix with the largest base code rate in the base matrix set is determined as the target base matrix.

[0075] In the present embodiment, in the case that there are at least two base matrices in the base matrix set which have different row numbers, different column numbers, and equal difference between column number and row number, it can be considered that there is an overlapping interval in the range of the code rate that can be supported by the two adjacent base matrices in the base matrix set. At this time, a code rate threshold can be selected to distinguish the two base matrices in the overlapping interval of the code rate that can be supported by the two adjacent base matrices, and the code rate interval between the two adjacent code rate thresholds is taken as the code rate range that can be selected for the corresponding base matrix. In order to enable the bit sequence to be encoded to select a target base matrix in the base matrix set that is most suitable for its encoding requirement, determining the target base matrix in the base matrix set based on the code rate of the bit sequence to be encoded and the matrix range that each base matrix in the base matrix set can be selected is divided into the following three cases:

[0076] 1) In the case that the code rate of the bit sequence to be encoded is less than the smallest code rate threshold corresponding to the base matrix set, it can be considered that the base code rates corresponding to all the base matrices in the base matrix set are difficult to completely adapt to the encoding requirement of the bit sequence to be encoded, and the greater the base code rate of the base matrix, the greater the error caused by encoding the bit sequence to be encoded by the base matrix. Therefore, at this time, the base matrix with the smallest base code rate in the base matrix set can be taken as the target base matrix.

[0077] 2) When the code rate of the bit sequence to be encoded is greater than or equal to the maximum code rate threshold corresponding to the basic matrix set, it can be considered that the basic code rates corresponding to all basic matrices in the basic matrix set are difficult to fully adapt to the encoding requirements of the bit sequence to be encoded. Encoding the bit sequence to be encoded with a basic matrix with a smaller basic code rate will cause a greater error. Therefore, the basic matrix with the largest basic code rate in the basic matrix set can be used as the target basic matrix.

[0078] 3) Using any two adjacent code rate thresholds from the set of fundamental matrices as the third and fourth code rate thresholds, respectively, if the code rate of the bit sequence to be encoded is greater than or equal to the third code rate threshold and less than the fourth code rate threshold, then the fundamental matrix whose code rate falls within the range of the third and fourth code rate thresholds can achieve better encoding results when encoding the bit sequence. Furthermore, since the third and fourth code rate thresholds can be used to distinguish between the fundamental code rate and its two adjacent fundamental matrices, and when the third and fourth code rate thresholds are two adjacent code rate thresholds with adjacent values, the latter fundamental matrix among the two adjacent fundamental matrices distinguished by the third code rate threshold is considered to be the same fundamental matrix as the former fundamental matrix among the two adjacent fundamental matrices distinguished by the fourth code rate threshold. In this case, this fundamental matrix can be used as the target fundamental matrix.

[0079] In some examples, Figure 4 is an example diagram of a target base matrix selection method under different code rates provided by embodiments of this application. As shown in Figure 4, it is assumed that the base matrix set contains M base matrices, and the M base matrices correspond one-to-one with M base code rates, where the M base code rates are R0, R1, ..., R M-1 All are real numbers greater than 0 and less than 1, R0 <R1<,...,<R M-1 Base bitrate R i Corresponding to the fundamental matrix Hb in the fundamental matrix set i The corresponding supported code rate range can be expressed as: in, The basic matrix Hb i The minimum base bitrate that can be supported The basic matrix Hb i The maximum base bitrate that can be supported With the fundamental matrix Hb i Adjacent fundamental matrix Hb i+1 minimum base bitrate Less than the maximum base bitrate That is, the fundamental matrix Hb i With the fundamental matrix Hb i+1 There are overlapping intervals Used to distinguish the fundamental matrix Hbi The code rate threshold T i+1 of the base matrix Hb i should belong to the overlapping interval. One possible way is to make the base code rate The base code rate R i corresponding to the base matrix Hb i supported by the base matrix Hb The base code rate range supported by the base matrix Hb i+1 The base code rate range supported by the base matrix Hb The two have overlapping intervals When the code rate R satisfies , select R i corresponding to the base matrix Hb i as the target base matrix; when the code rate R satisfies , select R i+1 corresponding to the base matrix Hb i+1 as the target base matrix, wherein

[0080] In an embodiment, the determination method of the base code rate comprises:

[0081] determining the difference between the number of columns and the number of rows of the base matrix as a third difference value; determining the difference between the number of columns of the base matrix and the maximum number of puncturing as a fourth difference value; determining the ratio of the third difference value to the number of columns of the base matrix as the minimum base code rate supported by the base matrix; determining the ratio of the third difference value to the fourth difference value as the maximum base code rate supported by the base matrix; wherein the maximum number of puncturing is an integer greater than 1 and less than the number of rows of the base matrix.

[0082] In some examples, assuming that the number of rows of the base matrix is mb, the number of columns of the base matrix is nb, and the maximum number of puncturing allowed by the base matrix is Q, since theoretically all columns of the base matrix can be punctured, but the code rate after puncturing should be less than 1, so the maximum number of puncturing can be an integer greater than 1 and less than the number of rows of the base matrix. At this time, determine kb = nb - mb as the third difference value, determine nb - Q as the fourth difference value, determine the ratio of the third difference value to nb as the minimum base code rate supported by the base matrix, and determine the ratio of the third difference value to the fourth difference value as the maximum base code rate supported by the base matrix, that is, for the base matrix Hb i , the base code rate range supported thereby is

[0083] In one example, there are M=2 base matrices in the base matrix set, one-to-one corresponding to M=2 base code rates, and the boosting value is 512. The first base matrix has a row number mb0=5 and a column number nb0=13, and the base code rate R0=8 / 13. The second base matrix has a row number mb1=4 and a column number nb1=12, and the base code rate R1=8 / 12. The base code rates corresponding to the two base matrices Hb0 and Hb1 are R0=8 / 13 and R1=8 / 12. When the code rate R=R0, the base matrix Hb0 is selected; and when the code rate R=R1, the base matrix Hb1 is selected. The second base matrix Hb1 has a row number mb1=4 and a column number nb1=14, and the base code rate supported by the base matrix Hb1 is: The base code rates corresponding to the two base matrices Hb0 and Hb1 are R0=10 / 15 and R1=10 / 14. The repeated interval of the code rate ranges supported by the two base code rates is Therefore, there is a code rate threshold When the code rate R<T0, the base matrix Hb0 is selected; and when the code rate R≥T0, the base matrix Hb1 is selected.

[0084] In one example, there are M=2 base matrices in the base matrix set, one-to-one corresponding to M=2 base code rates, and the boosting value is 512. The first base matrix has a row number mb0=5 and a column number nb0=13, and the base code rate R0=8 / 13. The second base matrix has a row number mb1=4 and a column number nb1=12, and the base code rate R1=8 / 12. The base code rates corresponding to the two base matrices Hb0 and Hb1 are R0=8 / 13 and R1=8 / 12. When the code rate R=R0, the base matrix Hb0 is selected; and when the code rate R=R1, the base matrix Hb1 is selected.

[0085] In one example, there are M=2 base matrices in the base matrix set, one-to-one corresponding to M=2 base code rates, and the boosting value is 512. The first base matrix has a row number mb0=5 and a column number nb0=13, and the base code rate R0=8 / 13. The second base matrix has a row number mb1=4 and a column number nb1=12, and the base code rate R1=8 / 12. The base code rates corresponding to the two base matrices Hb0 and Hb1 are R0=8 / 13 and R1=8 / 12. When the code rate R<R0, the base matrix Hb0 is selected.

[0086] In one embodiment, the code rate threshold is determined in at least one of the following ways:

[0087] determined by a fourth preset code rate threshold table, wherein the fourth preset code rate threshold table comprises a corresponding relationship between a code rate threshold and a basic code rate repetition interval; determined by a fifth preset code rate threshold table, wherein the fifth preset code rate threshold table comprises a corresponding relationship between a code rate threshold, a basic code rate repetition interval and a boosting value interval; determined by a sixth preset code rate threshold table, wherein the sixth preset code rate threshold table comprises a corresponding relationship between a code rate threshold, a basic code rate repetition interval and an information bit interval in which the to-be-encoded bit sequence is located; determined by a preset procedure, wherein the preset procedure is represented by a judgment statement based on the fourth preset code rate threshold table, the fifth preset code rate threshold table or the sixth preset code rate threshold table.

[0088] In an embodiment, the numerical relationship satisfied by the code length threshold in the preset expression comprises at least one of the following:

[0089] wherein ΔR is a real number less than . wherein is the maximum basic code rate supported by the i-th basic matrix in the basic matrix set; is the minimum basic code rate supported by the i+1-th basic matrix in the basic matrix set; T i is the code rate threshold used to distinguish the i-th basic matrix from the i+1-th basic matrix; wherein i+1 is a positive integer less than the number of basic matrices in the basic matrix set.

[0090] In one example, the maximum number of puncturing is Q=2, there are M=3 basic matrices in the basic matrix set, which one-to-one correspond to M=3 basic code rates, and the boosting value is equal to 512. The number of rows of the first basic matrix is mb0=6, the number of columns is nb0=16, the basic code rate is R0=10 / 16, the number of rows of the second basic matrix is mb1=5, the number of columns is nb1=15, the basic code rate is R1=10 / 15, and the number of rows of the third basic matrix is mb2=4, the number of columns is nb1=14, and the basic code rate is R2=10 / 14. The code rate range supported by the basic matrix Hb0 is: The code rate range supported by the basic matrix Hb1 is: The code rate range supported by the basic matrix Hb2 is The code rate range repetition interval supported by Hb0 and Hb1 is The code rate range repetition interval supported by Hb1 and Hb2 is Based on the numerical relationship that the code length threshold satisfies in the preset expression, the code rate threshold T0=(10 / 15+10 / 14) / 2=29 / 42 and the code rate threshold T1=(10 / 14+10 / 13) / 2=135 / 182 can be calculated and determined. When the code rate R belongs to [T0, T1], Hb1 can be determined as the target base matrix.

[0091] In some examples, a fourth preset code rate threshold table can be constructed in advance based on the correspondence between the code rate threshold and the base code rate repetition interval. The fourth preset code rate threshold table has the following characteristics: the size of the code rate threshold table is M-1, the code rate size belongs to the interval The ith code rate threshold T i i+1 in the code rate threshold table is greater than the ith code rate threshold, and the ith code rate threshold T i satisfies For example, the fourth preset code rate threshold table can be represented in the following table form:

[0092] In one example, the code rate threshold is obtained according to the fourth preset code rate threshold table. In this example, the maximum puncturing number Q=2, there are M=3 base matrices in the base matrix set, which one-to-one correspond to M=3 base code rates, the lifting value is equal to 512, the number of rows mb0 of the first base matrix is 6, the number of columns nb0 is 16, the base code rate R0=10 / 16, the number of rows mb1 of the second base matrix is 5, the number of columns nb1 is 15, the base code rate R1=10 / 15, the number of rows mb2 of the third base matrix is 4, the number of columns nb1 is 14, and the base code rate R2=10 / 14. The code rate range supported by the base matrix Hb0 is: The code rate range supported by the base matrix Hb1 is: The code rate range supported by the base matrix Hb2 is The code rate range repetition interval supported by Hb0 and Hb1 is The code rate range repetition interval supported by Hb1 and Hb2 is The fourth preset code rate threshold table is shown in the following table. When the code rate is R=0.70, the code rate threshold T0=0.69; when the code rate is R=0.70, the code rate threshold T1=0.74. If the code rate R=0.70, Hb1 can be determined as the target base matrix.

[0093] In some examples, a fifth preset code rate threshold table can be constructed in advance based on the correspondence between the code rate threshold and the basic code rate repetition interval and the boosting value interval, and the fifth preset code rate threshold table has the following characteristics: the size of the code rate threshold table is P*(M-1), P is the number of the boosting value interval, and M-1 is the number of the basic code rate repetition interval. The code rate size belongs to the basic code rate repetition interval , and the boosting value belongs to the boosting value interval [Z j , j+1 , the code rate threshold T j,i is obtained; the (i+1)th code rate threshold in the jth row of the code rate threshold table is greater than the ith code rate threshold, that is, T j,i+1 > T j,i ; the (j+1)th code rate threshold in the ith column of the code rate threshold table is less than or equal to the jth code rate threshold, that is, T j+1,i ≤ T j,i ; the code rate threshold T i,j satisfies , where i is an integer greater than or equal to 0 and less than or equal to M-2, j is an integer greater than or equal to 0 and less than or equal to P-1, and Z j is a preset boosting value greater than 0. For example, the fifth preset code rate threshold table can be represented in the following table form:

[0094] In one example, the code rate threshold is obtained according to the fifth preset code rate threshold table, the maximum number of puncturing Q=2 in this example, there are M=3 basic matrices in the basic matrix set, which one-to-one correspond to M=3 basic code rates, and the boosting value is equal to 512, the number of rows of the first basic matrix mb0=6, the number of columns nb0=16, the basic code rate R0=10 / 16, the number of rows of the second basic matrix mb1=5, the number of columns nb1=15, the basic code rate R1=10 / 15, the number of rows of the third basic matrix mb2=4, the number of columns nb1=14, and the basic code rate R2=10 / 14. The code rate range supported by the basic matrix Hb0 is: The code rate range supported by the basic matrix Hb1 is: The code rate range supported by the basic matrix Hb2 is The code rate range repetition interval supported by Hb0 and Hb1 is The code rate range repetition interval supported by Hb1 and Hb2 is The fifth preset code rate threshold table is shown in the following table. When the code rate and the boosting value is in the interval 32≤Z<256, the code rate threshold is 0.70; when the code rate and the boosting value is in the interval 256≤Z<513, the code rate threshold is 0.69; when the code rate and the boosting value is in the interval 32≤Z<256, the code rate threshold is 0.74; when the code rate and the lifting value is 256≤Z<513, the code rate threshold is 0.73.

[0095] In some examples, a sixth preset code rate threshold table can be constructed in advance based on the correspondence between the code rate threshold and the basic code rate repetition interval, and the information bit interval in which the length of the to-be-encoded bit sequence is located. The sixth preset code rate threshold table has the following characteristics: the size of the code rate threshold table is P*(M-1), P is the number of information bit intervals, and M-1 is the number of basic code rate repetition intervals. The code rate size belongs to the basic code rate repetition interval and the length of the to-be-encoded bit belongs to the information bit interval [K j ,K j+1 ), the code rate threshold T j,i is obtained; the (i+1)th code rate threshold in the jth row of the code rate threshold table is greater than the ith code rate threshold, that is, T j,i+1 >T j,i ; the (j+1)th code rate threshold in the ith column of the code rate threshold table is less than or equal to the jth code rate threshold, that is, T j+1,i ≤T j,i ; the code rate threshold T i,j satisfies R i ≤T j,i <R i+1 . Wherein, i is an integer greater than or equal to 0 and less than or equal to M-2, j is an integer greater than or equal to 0 and less than or equal to P-1, K j is a preset information bit length greater than 0. For example, the sixth preset code rate threshold table can be represented in the following table form:

[0096] In an example, the code rate threshold is obtained according to the sixth preset code rate threshold table, the maximum puncturing number Q=2 in this example, there are M=3 basic matrices in the basic matrix set, which one-to-one correspond to M=3 basic code rates, and the lifting value is equal to 512, the number of rows of the first basic matrix mb0=6, the number of columns nb0=16, the basic code rate R0=10 / 16, the number of rows of the second basic matrix mb1=5, the number of columns nb1=15, the basic code rate R1=10 / 15, the number of rows of the third basic matrix mb2=4, the number of columns nb1=14, and the basic code rate R2=10 / 14. The code rate range supported by the basic matrix Hb0 is: The code rate range supported by the basic matrix Hb1 is: The code rate range supported by the basic matrix Hb2 is The code rate range repetition interval supported by Hb0 and Hb1 is The code rate range repetition interval supported by Hb1 and Hb2 is The sixth preset code rate threshold table is shown in the following table. When the code rate and the code rate threshold is 0.69 when the length K of the bit sequence to be encoded is in the interval 1024≤K<4096; and the code rate threshold is 0.75 when the length K of the bit sequence to be encoded is in the interval 1024≤K<4096. and the code rate threshold is 0.69 when the length K of the bit sequence to be encoded is in the interval 1024≤K<4096; and the code rate threshold is 0.75 when the length K of the bit sequence to be encoded is in the interval 1024≤K<4096. It can be understood that the information length range in the present example can be other values, and the embodiments of the present application do not limit this.

[0097] In some examples, the fourth preset code rate threshold table, the fifth preset code rate threshold table and the sixth preset code rate threshold table can be characterized by a judgment statement to determine the code rate threshold according to the basic code rate repetition interval, the lifting value interval and the information bit interval.

[0098] In an embodiment, the encoding requirement information further includes a requirement code length and a lifting value of the bit sequence to be encoded; the support information further includes a code length threshold of each basic matrix; wherein the requirement code length is the code length of the target encoded bit sequence. According to the encoding requirement information of the bit sequence to be encoded and the support information of each basic matrix in the basic matrix set, a target basic matrix is determined from the basic matrix set, including:

[0099] According to the requirement code length and the lifting value of the bit sequence to be encoded and the code length threshold of each basic matrix in the basic matrix set, a target basic matrix is determined from the basic matrix set; wherein the requirement code length, the lifting value and the code length threshold are all integers greater than 0.

[0100] In the present embodiment, the requirement code length can be specifically understood as the code length to which the bit sequence to be encoded is expected to be encoded, and in the embodiments of the present application, the requirement code length can be understood as the code length of the target encoded bit sequence.

[0101] In the present embodiment, the code length threshold can be specifically understood as a threshold used to distinguish the encoding code length range supported by different basic matrices.

[0102] In the present embodiment, according to the lifting value, the code length threshold used to distinguish the encoding code length range supported by different basic matrices can be determined, so as to determine the encoding code length range that each basic matrix in the basic matrix set can provide for the bit sequence to be encoded. Then, the requirement code length to which the bit sequence to be encoded needs to be encoded is compared with the encoding code length range that each basic matrix can provide, and the basic matrix corresponding to the encoding code length range containing the requirement code length of the bit sequence to be encoded is determined as the target basic matrix.

[0103] In an embodiment, according to the requirement code length and the lifting value of the bit sequence to be encoded and the code length threshold of each basic matrix in the basic matrix set, a target basic matrix is determined from the basic matrix set, including:

[0104] In a case that the required code length of the to-be-encoded bit sequence is greater than or equal to the first code length threshold and less than the second code length threshold, a latter base matrix in the adjacent base matrices distinguished by the first code length threshold is determined as the target base matrix; wherein the first code length threshold and the second code length threshold are two adjacent code length thresholds corresponding to the base matrix set under the boosting value; in a case that the required code length of the to-be-encoded bit sequence is less than the minimum code length threshold corresponding to the base matrix set, a base matrix with the minimum base code length in the base matrix set under the boosting value is determined as the target base matrix; in a case that the required code length of the to-be-encoded bit sequence is greater than or equal to the maximum code length threshold corresponding to the base matrix set, a base matrix with the maximum base code length in the base matrix set under the boosting value is determined as the target base matrix.

[0105] In the embodiment, in a case that the puncturing numbers of the base matrices in the base matrix set are different, the ranges of the supportable encoding code lengths corresponding to the base matrices do not overlap with each other. In order to enable the to-be-encoded bit sequence to select the target base matrix most suitable for the encoding requirement of the to-be-encoded bit sequence from the base matrix set, the determination of the target base matrix from the base matrix set can be divided into the following three cases based on the code length thresholds used to distinguish the ranges of the supportable encoding code lengths of different base matrices:

[0106] 1) In a case that the required code length of the to-be-encoded bit sequence is less than the minimum code length threshold corresponding to the base matrix set, it can be considered that all the base matrices in the base matrix set are difficult to completely adapt to the encoding requirement of the to-be-encoded bit sequence under the boosting value, and the error caused by encoding the to-be-encoded bit sequence by using the base matrix with the larger base code length is greater, so the base matrix with the minimum base code length in the base matrix set can be selected as the target base matrix.

[0107] 2) In a case that the required code length of the to-be-encoded bit sequence is greater than or equal to the maximum code length threshold corresponding to the base matrix set, it can be considered that all the base matrices in the base matrix set are difficult to completely adapt to the encoding requirement of the to-be-encoded bit sequence under the boosting value, and the error caused by encoding the to-be-encoded bit sequence by using the base matrix with the smaller base code length is greater, so the base matrix with the maximum base code length in the base matrix set can be selected as the target base matrix.

[0108] 3) the base matrix set is set at any two adjacent code length thresholds corresponding to the lifting value as a first code length threshold and a second code length threshold, and in the case that the required code length of the to-be-encoded bit sequence is greater than or equal to the first code length threshold and less than the second code length threshold, it can be considered that the base matrix whose base code length is located in the range of the first code length threshold and the second code length threshold can achieve better encoding effect when encoding the to-be-encoded bit sequence. At the same time, since the first code length threshold and the second code length threshold can be used to distinguish the base code length and the two adjacent base matrices thereof, and when the first code length threshold and the second code length threshold are two adjacent code length thresholds in size, it can be considered that the latter base matrix in the two adjacent base matrices distinguished by the first code length threshold is the same as the former base matrix in the two adjacent base matrices distinguished by the second code length threshold, and at this time, the base matrix can be taken as a target base matrix.

[0109] In an embodiment, the numerical relationship satisfied by the code length threshold includes:

[0110] wherein ΔN is an integer less than ; wherein N i is the base code length of the i th base matrix in the base matrix set; N i+1 is the base code length of the i+1 th base matrix in the base matrix set; F i is the code length threshold used to distinguish the i th base matrix and the i+1 th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0111] In the embodiment, the base code length can be specifically understood as the encoding code length that the base matrix can support, which is determined according to the number of columns of the base matrix, the puncturing condition of the base matrix and the lifting value.

[0112] In an embodiment, the determination manner of the base code length of the base matrix includes:

[0113] determining the difference value between the number of columns of the base matrix and the total puncturing number as a fifth difference value, and determining the product of the lifting value and the fifth difference value as the base code length of the base matrix; wherein the rounding manner includes at least one of the following: rounding up; rounding down; rounding to the nearest; wherein the absolute value of the difference between the base code lengths corresponding to any two base matrices in the base matrix set under the lifting value is greater than or equal to a second preset difference threshold.

[0114] In the embodiment, the second preset difference threshold can be specifically understood as a threshold preset according to actual conditions, which is used to ensure that the range of the encoding code length supported by each base matrix in the base matrix set is different.

[0115] In some examples, assuming that the lifting value of the bit sequence to be encoded is Z, the number of columns of the base matrix is nb, and the total number of puncturing after puncturing the base matrix is Δnb, nb-Δnb can be determined as a fifth difference value, and the product obtained by multiplying the lifting value and the fifth difference value is rounded as the base code length of the base matrix, that is, the base code length N of the base matrix can be expressed as one of the following formulas: N=floor(Z*(nb-Δnb)) N=round(Z*(nb-Δnb)) N=ceil(Z*(nb-Δnb))

[0116] wherein floor(x) represents taking the maximum integer not greater than x, round(x) represents taking the integer closest to x, and ceil(x) represents taking the minimum integer not less than x.

[0117] In an embodiment, the target encoded bit sequence is determined by encoding the bit sequence to be encoded through the target base matrix, comprising:

[0118] The lifting value matching the bit sequence to be encoded is obtained, the first encoded bit sequence is determined by encoding the bit sequence to be encoded through the lifting value and the target base matrix, and the target encoded bit sequence is determined by performing bit selection on the first encoded bit sequence.

[0119] In an embodiment, the first encoded bit sequence is determined by encoding the bit sequence to be encoded through the lifting value and the target base matrix, comprising:

[0120] The parity check matrix corresponding to the bit sequence to be encoded is determined by performing matrix extension on the target base matrix based on the lifting value, and the first encoded bit sequence is determined by encoding the bit sequence to be encoded through the parity check matrix.

[0121] In some examples, the lifting value can be used as the dimension of the standard permutation matrix, which can realize the extension of the base matrix, for example, replacing the element indicating the all-zero matrix in the base matrix with a Z*Z all-zero matrix, or replacing the element indicating the cyclic shift of the unit matrix in the base matrix with a cyclic shift matrix of the Z*Z unit matrix, and after the replacement is completed, the parity check matrix of each base matrix can be obtained.

[0122] In one example, the check matrix H of the LDPC code is a matrix with mb*Z rows and nb*Z columns, which is composed of mb*nb sub-matrices, each of which is a different power of the Z*Z standard permutation matrix (corresponding to the cyclic shift matrix of the unit matrix) or a Z*Z all-zero matrix, and the check matrix H has the following form:

[0123] As the corresponding sub-matrix is a Z*Z all-zero matrix; if is an integer greater than or equal to 0, then the corresponding sub-matrix is the s-th power of the standard permutation matrix P (i.e., the cyclic shift of the identity matrix), and the standard permutation matrix P of Z*Z is shown as follows (the identity matrix is cyclically shifted 1 bit to the right to form the standard permutation matrix):

[0124] Therefore, in the above example, each sub-matrix can be uniquely identified, if a certain sub-matrix is a zero matrix, the corresponding is represented by -1 or a null value, if a certain sub-matrix is a cyclic shift s of the identity matrix, then is equal to s. That is, the base matrix contains two kinds of elements: elements indicating zero matrices and elements indicating cyclic shifts of the identity matrix.

[0125] In some examples, Z is the dimension of the standard permutation matrix (sub-matrix), and Z is referred to as the lifting size. By replacing the elements indicating the cyclic shifts of the identity matrix in the base matrix with "1" and replacing all elements indicating zero matrices with "0", the base matrix of the LDPC code can be obtained. Therefore, the base matrix of the LDPC code only includes two elements: "0" and "1", where "0" is used to indicate that the index position is an element of a zero matrix, and "1" is used to indicate that the index position is an element of a cyclic shift of the identity matrix. For ease of description, only the elements indicating the cyclic shifts of the identity matrix in the base matrix and the row and column index positions of these elements can be described, and the remaining row and column index positions are by default elements indicating zero matrices. In addition, the elements indicating the cyclic shifts of the identity matrix can be represented by their cyclic shift values, and the elements indicating zero matrices can be described by -1 or a null value or null value.

[0126] In some examples, the input bit sequence to be encoded can be represented as a = {a0, a1, K, a K-1 K is the length of the bit sequence to be encoded, and since K can be less than kb*Z, zero padding shortening needs to be performed to perform encoding operation through the parity check matrix. Therefore, when kb*Z≥K, the padded bits are zero, and the padded bit sequence a' = {a0, a1, K, a K-1 ,0 K ,0 K+1 ,K,0 kb*Z-1} is obtained, and then the first encoded bit sequence b = {b0, b1, K, b E-1} can be output after encoding through the parity check matrix, where the length of the first encoded bit sequence is E bits.

[0127] ​In some examples, when the product of the column number kb of the systematic column matrix of the base matrix and the lifting value Z is equal to the length K of the bit sequence to be encoded, the corresponding information bits during encoding are a' = {a0, a1, K, a K-1} and the corresponding information bits during encoding are a' = {a0, a1, K, a K-1 , 0 K , 0 K+1 , K, 0 kb*Z-1} and the corresponding information bits during encoding are a' = {a0, a1, K, a K-1 , 0 K , 0 K+1 , K, 0 kb*Z-1}, and the filled kb*Z-K 0 bits can not be transmitted when the first communication node transmits the encoded data to the second communication node.

[0128] In some examples, since the base matrix has the structure of a systematic column matrix and a parity check column matrix, each parity check matrix also contains a systematic column matrix H s and a parity check column matrix H P , i.e., the parity check matrix has the following specific structure: [H s , H P ]

[0129] Since the bit sequence to be encoded can be encoded based on the target base matrix Hb and the lifting value Z to obtain a first encoded bit sequence, i.e., the parity check matrix H determined by the base matrix Hb and the lifting value Z is used to calculate the bit sequence to be encoded as follows: v = H s × a', p = (H P ) -1 × v

[0130] The first encoded bit sequence obtained above can be represented as The length of the first encoded bit sequence is E.

[0131] In some examples, the LDPC code can be shortened by selectively omitting some codeword positions while trying to maintain the excellent performance characteristics of the LDPC code. Specifically, the shortening operation involves selecting certain positions in the codeword and deciding not to transmit information in these positions. In this way, the shortened positions of the codeword are known at both the transmitting and receiving ends, and 0 is usually placed in the shortened positions of the codeword. For example, the structure of a base matrix can be represented as: where Hb s is a systematic column matrix, and Hb PThe number of columns of the system column matrix is kb, and the number of columns of the check column matrix is mb. If the shortened position is the last L columns of the system columns in the base matrix, the (kb-L)*Z to kb*Z-1 bits in the codeword are known at both the transmitting end and the receiving end. It can be understood that the (kb-L)*Z to kb*Z-1 bits are known at both the transmitting end and the receiving end, such as being equal to 0.

[0132] In the embodiment, after the shortened bits filled with zeros known at both the transmitting end and the receiving end are removed from the coded bit sequence, a first coded bit sequence with a length of E is obtained, and the first coded bit sequence only contains system bits and check bits, and does not contain shortened bits filled with zeros.

[0133] In an embodiment, because the code length required by the target coded bit sequence is often different from the first coded bit sequence, bit selection can be performed on the first coded bit sequence to determine the target coded bit sequence.

[0134] In an embodiment, the bit selection on the first coded bit sequence includes at least one of the following:

[0135] The bit selection on the first coded bit sequence is performed by the required code length of the to-be-coded bit sequence or the code rate of the to-be-coded bit sequence.

[0136] In an embodiment, the bit selection on the first coded bit sequence is performed by the code rate of the to-be-coded bit sequence, including:

[0137] The number of check column puncturing is determined according to the code rate of the to-be-coded bit sequence, the number of rows of the target base matrix, the lifting value, the length of the to-be-coded bit sequence, and the number of system bit puncturing; and the target coded bit sequence is obtained by puncturing the first coded bit sequence.

[0138] In some examples, if the code rate satisfies T i-1 <R≤T i , the target base matrix selected in the LDPC encoding process is Hb i , and after the first coded bit sequence is obtained by encoding the to-be-coded bit sequence by using the target base matrix and the lifting value Z, the target coded bit sequence with a required code length N can be obtained in the following manner:

[0139] The number of puncturing positions of the parity check column is puncParBit = mb * Z - (floor(K / R) - K + puncSysBit). Wherein mb is the number of rows of the base matrix, K is the length of the to-be-encoded bit sequence, puncSysBit is the number of puncturing of the systematic bits; determining the puncturing positions; in an example, the puncturing positions of the systematic bits are located at the first puncSysBit bit positions of the first encoded bit sequence, and the puncturing positions of the parity check bits are located at the last puncParBit bit positions of the first encoded bit sequence.

[0140] Based on the first encoded bit sequence, the elements at the puncturing positions of the systematic bits and the elements at the puncturing positions of the parity check bits are deleted to obtain a target encoded bit sequence with a length of N. Wherein the puncturing positions of the systematic bits and the puncturing positions of the parity check bits can be empty.

[0141] In an example, it is assumed that there are M = 3 base matrices in the base matrix set, which one-to-one correspond to M = 3 base code rates, and the number of rows mb of the 3 base matrices is equal to 4, and the number of columns nb of the 3 base matrices is equal to 12. The total number of puncturing Δnb corresponding to the three base matrices Hb0, Hb1 and Hb2 is 0, 1 and 2 respectively, and the base code rates corresponding to the three base matrices Hb0, Hb1 and Hb2 are R0 = 8 / 12, R1 = 8 / 11 and R2 = 8 / 10 respectively. The promotion value Z = 512, the code rate threshold T0 = 23 / 33, and the code rate threshold T1 = 42 / 55. If the code rate R of the to-be-encoded bit sequence is 17 / 25, at this time R < T0, Hb0 is determined as the target base matrix. The length K of the to-be-encoded bit sequence is 4094, the code rate R is 32 / 47, the number of puncturing of the systematic bits puncSysBit is 0, the number of puncturing positions of the parity check column puncParBit is mb * Z - (floor(K / R) - K + puncSysBit) = 128, the total length E of the to-be-encoded information bits and the parity check bits in the first encoded bit sequence is K + mb * Z = 6144, and the target encoded bit sequence is a sequence composed of the first (E - puncParBit) = 6016 bits of the first encoded bit sequence, and the length N of the target encoded bit sequence is 6016.

[0142] In another example, based on the first coded bit sequence, elements of the system bit puncturing position are deleted, elements of the parity bit puncturing position are deleted, and a target coded bit sequence with a length of N is obtained. Based on the previous example, the difference is that the number of system bit puncturing is puncSysBit=64, the number of parity column puncturing position is puncParBit=mb*Z-(floor(K / R)-K+puncSysBit)=64, the total length of the first coded bit sequence is E=6144, the target coded bit sequence is a sequence composed of the 65th to 6080th bits of the first coded bit sequence, and the length of the target coded bit sequence is N=6016.

[0143] In an embodiment, after determining the target coded bit sequence, the method further includes:

[0144] Sending all bits in the target coded bit sequence or part of the bits in the target coded bit sequence to the second communication node.

[0145] In one example embodiment, FIG. 5 is a flowchart of a data processing method provided by an embodiment of the present application. The method can be applied to selecting the most suitable LDPC code base matrix for a bit sequence that needs to be encoded and decoded. The method can be executed by a data processing device, which can be executed by software and / or hardware and integrated on a communication node. The method can be applied to a second communication node, which can be a second transmission node in the data transmission implementation environment shown in FIG. 1, or a corresponding execution subject selected by a person skilled in the art according to an actual application scenario. The embodiments of the present application do not limit this.

[0146] As shown in FIG. 5, the data processing method provided by the embodiments of the present application specifically includes S201-S203.

[0147] S201, receiving a to-be-decoded bit sequence.

[0148] In the embodiment, the to-be-decoded bit sequence is the information corresponding to all bits of the target coded bit sequence or part of the bits in the target coded bit sequence in the above embodiments.

[0149] S202, determining a target base matrix from a base matrix set according to decoding requirement information of the to-be-decoded bit sequence and support information of each base matrix in the base matrix set.

[0150] The base matrix set includes at least two base matrices.

[0151] S203, decoding the to-be-decoded bit sequence by using the target base matrix to determine a target decoded bit sequence.

[0152] In the embodiment, the target decoding bit sequence is the to-be-encoded bit sequence in the above-described embodiment.

[0153] In an embodiment, the decoding requirement information comprises a code rate of the to-be-decoded bit sequence; the support information comprises a base code rate and a code rate threshold of each base matrix; and the target base matrix is determined from the base matrix set according to the decoding requirement information of the to-be-decoded bit sequence and the support information of each base matrix in the base matrix set, comprising:

[0154] The target base matrix is determined from the base matrix set according to the code rate of the to-be-decoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set; wherein the code rate, the base code rate and the code rate threshold are all real numbers greater than 0 and less than 1; and the absolute value of the difference between the base code rates corresponding to any two base matrices in the base matrix set is greater than or equal to a first preset difference threshold.

[0155] In an embodiment, in the case where the number of rows of each base matrix in the base matrix set is equal and the number of columns of each base matrix is equal, the target base matrix is determined from the base matrix set according to the code rate of the to-be-decoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set, comprising at least one of the following:

[0156] In the case where the code rate of the to-be-decoded bit sequence is greater than or equal to a first code rate threshold and less than a second code rate threshold, the latter base matrix in the adjacent base matrices distinguished by the first code rate threshold is determined as the target base matrix; wherein the first code rate threshold and the second code rate threshold are two adjacent code rate thresholds corresponding to the base matrix set in terms of numerical size; in the case where the code rate of the to-be-decoded bit sequence is less than the smallest code rate threshold corresponding to the base matrix set, the base matrix with the smallest base code rate in the base matrix set is determined as the target base matrix; and in the case where the code rate of the to-be-decoded bit sequence is greater than or equal to the largest code rate threshold corresponding to the base matrix set, the base matrix with the largest base code rate in the base matrix set is determined as the target base matrix.

[0157] In an embodiment, the determination of the base code rate comprises:

[0158] The difference between the number of columns and the number of rows of the base matrix is determined as a first difference; the difference between the number of columns of the base matrix and the total number of puncturing is determined as a second difference; and the ratio of the first difference to the second difference is determined as the base code rate of the base matrix; wherein the total number of puncturing is a non-negative real number less than the number of rows of the base matrix.

[0159] In an embodiment, the determination of the code rate threshold comprises at least one of the following:

[0160] determined by a preset expression; determined by a first preset code rate threshold table; wherein the first preset code rate threshold table comprises a corresponding relationship between a code rate threshold and a base code rate interval; determined by a second preset code rate threshold table; wherein the second preset code rate threshold table comprises a corresponding relationship between a code rate threshold, a base code rate interval and a lifting value interval; determined by a third preset code rate threshold table; wherein the third preset code rate threshold table comprises a corresponding relationship between a code rate threshold, a base code rate interval and an information bit interval in which the length of the to-be-decoded bit sequence is located; determined by a preset procedure; wherein the preset procedure is a judgment statement based on the first preset code rate threshold table, the second preset code rate threshold table or the third preset code rate threshold table.

[0161] In an embodiment, the numerical relationship satisfied by the code rate threshold in the preset expression comprises at least one of the following:

[0162] wherein |AR| is a real number less than . wherein R i is the base code rate of the i-th base matrix in the base matrix set; R i+1 is the base code rate of the i+1-th base matrix in the base matrix set; T i is the code rate threshold used to distinguish the i-th base matrix and the i+1-th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0163] In an embodiment, in the case that there are at least two base matrices in the base matrix set whose row numbers are not equal, column numbers are not equal, and the difference between the column number and the row number is equal, the target base matrix is determined from the base matrix set according to the code rate of the to-be-decoded bit sequence, and the base code rate and the code rate threshold of each base matrix in the base matrix set, comprising at least one of the following:

[0164] In the case that the code rate of the to-be-decoded bit sequence is greater than or equal to a third code rate threshold and less than a fourth code rate threshold, the third code rate threshold is taken as the target base matrix in the latter one of the adjacent base matrices distinguished by the third code rate threshold; wherein the third code rate threshold and the fourth code rate threshold are two adjacent code rate thresholds corresponding to the base matrix set in terms of numerical size; in the case that the code rate of the to-be-decoded bit sequence is less than the smallest code rate threshold corresponding to the base matrix set, the base matrix with the smallest base code rate in the base matrix set is determined as the target base matrix; in the case that the code rate of the to-be-decoded bit sequence is greater than or equal to the largest code rate threshold corresponding to the base matrix set, the base matrix with the largest base code rate in the base matrix set is determined as the target base matrix.

[0165] In an embodiment, the determination of the base code rate comprises:

[0166] determining a difference between the number of columns and the number of rows of the base matrix as a third difference value; determining a difference between the number of columns of the base matrix and the maximum puncturing number as a fourth difference value; determining a ratio of the third difference value and the number of columns of the base matrix as a minimum base code rate supported by the base matrix; determining a ratio of the third difference value and the fourth difference value as a maximum base code rate supported by the base matrix; wherein the maximum puncturing number is an integer greater than 1 and less than the number of rows of the base matrix.

[0167] In an embodiment, the code rate threshold is determined in the following manner:

[0168] by a preset expression; by a fourth preset code rate threshold table; wherein the fourth preset code rate threshold table contains a corresponding relationship between the code rate threshold and the base code rate repetition interval; by a fifth preset code rate threshold table; wherein the fifth preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate repetition interval and the lifting value interval; by a sixth preset code rate threshold table; wherein the sixth preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate repetition interval and the information bit interval in which the length of the to-be-decoded bit sequence is located; by a preset procedure; wherein the preset procedure is a judgment statement based on the fourth preset code rate threshold table, the fifth preset code rate threshold table or the sixth preset code rate threshold table.

[0169] In an embodiment, the numerical relationship satisfied by the code length threshold in the preset expression includes at least one of the following:

[0170] wherein ΔR is a real number less than . wherein is the maximum base code rate supported by the i-th base matrix in the base matrix set; is the minimum base code rate supported by the i+1-th base matrix in the base matrix set; T i is the code rate threshold used to distinguish the i-th base matrix from the i+1-th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0171] In an embodiment, the decoding requirement information further includes a required code length of the to-be-decoded bit sequence and a lifting value; the support information further includes a code length threshold of each base matrix; wherein the required code length is the code length of the target decoding bit sequence. According to the decoding requirement information of the to-be-decoded bit sequence and the support information of each base matrix in the base matrix set, a target base matrix is determined from the base matrix set, including:

[0172] A target base matrix is determined from the base matrix set according to a required code length of the bit sequence to be decoded and a lifting value, and a code length threshold of each base matrix in the base matrix set, wherein the required code length, the lifting value and the code length threshold are all integers greater than 0.

[0173] In an embodiment, the target base matrix is determined from the base matrix set according to the required code length of the bit sequence to be decoded and the code length threshold of each base matrix in the base matrix set, including:

[0174] In a case where the required code length of the bit sequence to be decoded is greater than or equal to a first code length threshold and less than a second code length threshold, a latter base matrix in adjacent base matrices distinguished by the first code length threshold is determined as the target base matrix, wherein the first code length threshold and the second code length threshold are two adjacent code length thresholds corresponding to the base matrix set under the lifting value; in a case where the required code length of the bit sequence to be decoded is less than a smallest code length threshold corresponding to the base matrix set, a base matrix with a smallest base code length in the base matrix set under the lifting value is determined as the target base matrix; in a case where the required code length of the bit sequence to be decoded is greater than or equal to a largest code length threshold corresponding to the base matrix set, a base matrix with a largest base code length in the base matrix set under the lifting value is determined as the target base matrix.

[0175] In an embodiment, the numerical relationship satisfied by the code length threshold includes:

[0176] wherein ΔN is an integer less than wherein N i is a base code length of an i-th base matrix in the base matrix set; N i+1 is a base code length of an i+1-th base matrix in the base matrix set; F i is a code length threshold used to distinguish the i-th base matrix and the i+1-th base matrix, wherein i+1 is a positive integer less than a number of base matrices in the base matrix set.

[0177] In an embodiment, the determination of the base code length of the base matrix includes:

[0178] A difference between the number of columns of the base matrix and the total puncturing number is determined as a fifth difference value; a product of the lifting value and the fifth difference value is rounded to determine the base code length of the base matrix, wherein the rounding manner includes at least one of the following: rounding up; rounding down; rounding to the nearest; wherein an absolute value of a difference between the base code lengths corresponding to any two base matrices in the base matrix set under the lifting value is greater than or equal to a second preset difference threshold.

[0179] In an embodiment, the target decoding bit sequence is determined by decoding the bit sequence to be decoded through the target base matrix, including:

[0180] obtaining a lifting value matched with the to-be-decoded bit sequence; determining a first decoded bit sequence by decoding the to-be-decoded bit sequence through the lifting value and the target base matrix; and determining the target decoded bit sequence by bit selection on the first decoded bit sequence.

[0181] In an embodiment, the determining of the first decoded bit sequence by decoding the to-be-decoded bit sequence through the lifting value and the target base matrix comprises:

[0182] performing matrix extension on the target base matrix based on the lifting value to determine a parity check matrix corresponding to the to-be-decoded bit sequence; and determining the first decoded bit sequence by decoding the to-be-decoded bit sequence through the parity check matrix.

[0183] In an embodiment, since the length of the target decoded bit sequence is usually different from that of the first decoded bit sequence, the target decoded bit sequence can be determined by bit selection on the first decoded bit sequence.

[0184] In an embodiment, the bit selection on the first decoded bit sequence comprises at least one of the following:

[0185] bit selection on the first decoded bit sequence through a required length of the target decoded bit sequence; and bit selection on the first decoded bit sequence through a code rate of the target decoded bit sequence.

[0186] In an embodiment, the bit selection on the first decoded bit sequence through the code rate of the target decoded bit sequence comprises:

[0187] determining the required length of the target decoded bit sequence according to the code rate of the target decoded bit sequence and the length of the to-be-decoded bit sequence, and obtaining the target decoded bit sequence from the first decoded bit sequence according to the required length of the target decoded bit sequence. In one example, the first target decoded bit sequence is selected from the first decoded bit sequence.

[0188] In one example embodiment, FIG. 6 is a structural schematic diagram of a data processing apparatus provided by an embodiment of the present application, which is applied to a first communication node. As shown in FIG. 6, the apparatus comprises:

[0189] The encoding sequence acquisition module 310 is configured to acquire a to-be-encoded bit sequence; the target matrix determination module 320 is configured to determine a target base matrix from a base matrix set according to encoding requirement information of the to-be-encoded bit sequence and support information of each base matrix in the base matrix set; the target sequence determination module 330 is configured to encode the to-be-encoded bit sequence by using the target base matrix to determine a target encoded bit sequence; and the base matrix set includes at least two base matrices.

[0190] The data processing apparatus provided by the embodiment of the present application selects a target base matrix most suitable for the to-be-encoded bit sequence from a base matrix set including multiple base matrices according to the encoding requirement of the to-be-encoded bit sequence, and then encodes the to-be-encoded bit sequence by using the target base matrix, thereby improving the error correction performance of the data packet in the encoding process and increasing the robustness of data communication.

[0191] In an embodiment, the encoding requirement information includes a code rate of the to-be-encoded bit sequence; and the support information includes a base code rate and a code rate threshold of each base matrix. The target base matrix is determined from the base matrix set according to the encoding requirement information of the to-be-encoded bit sequence and the support information of each base matrix in the base matrix set, including:

[0192] The target base matrix is determined from the base matrix set according to the code rate of the to-be-encoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set; wherein the code rate, the base code rate and the code rate threshold are all real numbers greater than 0 and less than 1; and the absolute value of the difference between the base code rates of any two base matrices in the base matrix set is greater than or equal to a first preset difference threshold.

[0193] In an embodiment, in the case that the number of rows of each base matrix in the base matrix set is equal and the number of columns of each base matrix is equal, the target base matrix is determined from the base matrix set according to the code rate of the to-be-encoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set, including at least one of the following:

[0194] In the case that the code rate of the to-be-encoded bit sequence is greater than or equal to a first code rate threshold and less than a second code rate threshold, the last base matrix in the adjacent base matrix distinguished by the first code rate threshold is determined as the target base matrix; wherein the first code rate threshold and the second code rate threshold are two adjacent code rate thresholds corresponding to the base matrix set; in the case that the code rate of the to-be-encoded bit sequence is less than the smallest code rate threshold corresponding to the base matrix set, the base matrix with the smallest base code rate in the base matrix set is determined as the target base matrix; and in the case that the code rate of the to-be-encoded bit sequence is greater than or equal to the largest code rate threshold corresponding to the base matrix set, the base matrix with the largest base code rate in the base matrix set is determined as the target base matrix.

[0195] In an embodiment, the manner of determining the base code rate comprises:

[0196] determining a difference between the number of columns and the number of rows of the base matrix as a first difference value, determining a difference between the number of columns of the base matrix and the total number of puncturing as a second difference value, and determining a ratio of the first difference value to the second difference value as the base code rate of the base matrix; wherein the total number of puncturing is a non-negative real number less than the number of rows of the base matrix.

[0197] In an embodiment, the manner of determining the code rate threshold comprises at least one of:

[0198] determined by a preset expression, determined by a first preset code rate threshold table, wherein the first preset code rate threshold table contains a corresponding relationship between the code rate threshold and the base code rate interval, determined by a second preset code rate threshold table, wherein the second preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate interval and the lifting value interval, determined by a third preset code rate threshold table, wherein the third preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate interval and the information bit interval in which the length of the to-be-encoded bit sequence is located, and determined by a preset process, wherein the preset process is a judgment statement representation based on the first preset code rate threshold table, the second preset code rate threshold table or the third preset code rate threshold table.

[0199] In an embodiment, the numerical relationship satisfied by the code rate threshold in the preset expression comprises at least one of:

[0200] wherein |AR| is a real number less than . wherein R i is the base code rate of the i-th base matrix in the base matrix set; R i+1 is the base code rate of the (i+1)-th base matrix in the base matrix set; T i is the code rate threshold used to distinguish the i-th base matrix and the (i+1)-th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0201] In an embodiment, in the case that there are at least two base matrices in the base matrix set whose number of rows is not equal, whose number of columns is not equal, and whose difference between the number of columns and the number of rows is equal, the target base matrix is determined from the base matrix set according to the code rate of the to-be-encoded bit sequence, and the base code rate and the code rate threshold of each base matrix in the base matrix set, comprising at least one of:

[0202] In a case that the code rate of the to-be-encoded bit sequence is greater than or equal to a third code rate threshold and less than a fourth code rate threshold, a latter one of the adjacent base matrices distinguished by the third code rate threshold is determined as the target base matrix; the third code rate threshold and the fourth code rate threshold are two adjacent code rate thresholds corresponding to the base matrix set; in a case that the code rate of the to-be-encoded bit sequence is less than a smallest code rate threshold corresponding to the base matrix set, a base matrix with a smallest base code rate in the base matrix set is determined as the target base matrix; in a case that the code rate of the to-be-encoded bit sequence is greater than or equal to a largest code rate threshold corresponding to the base matrix set, a base matrix with a largest base code rate in the base matrix set is determined as the target base matrix.

[0203] In an embodiment, the base code rate is determined in the following manner:

[0204] A difference between the number of columns and the number of rows of the base matrix is determined as a third difference value; a difference between the number of columns of the base matrix and the maximum puncturing number is determined as a fourth difference value; a ratio of the third difference value to the number of columns of the base matrix is determined as a minimum base code rate supported by the base matrix; a ratio of the third difference value to the fourth difference value is determined as a maximum base code rate supported by the base matrix; the maximum puncturing number is an integer greater than 1 and less than the number of rows of the base matrix.

[0205] In an embodiment, the code rate threshold is determined in at least one of the following manners:

[0206] The code rate threshold is determined by a preset expression; the code rate threshold is determined by a fourth preset code rate threshold table; the fourth preset code rate threshold table contains a corresponding relationship between the code rate threshold and a base code rate repetition interval; the code rate threshold is determined by a fifth preset code rate threshold table; the fifth preset code rate threshold table contains a corresponding relationship between the code rate threshold, a base code rate repetition interval and a boosting value interval; the code rate threshold is determined by a sixth preset code rate threshold table; the sixth preset code rate threshold table contains a corresponding relationship between the code rate threshold, a base code rate repetition interval and an information bit interval in which the length of the to-be-encoded bit sequence is located; the code rate threshold is determined by a preset procedure; the preset procedure is represented by a judgment statement based on the fourth preset code rate threshold table, the fifth preset code rate threshold table or the sixth preset code rate threshold table.

[0207] In an embodiment, the numerical relationship satisfied by the code length threshold in the preset expression includes at least one of the following:

[0208] wherein ΔR is a real number less than . wherein is a maximum base code rate supported by an i-th base matrix in the base matrix set; the minimum base code rate supported by the (i+1)th base matrix in the base matrix set; T i the code rate threshold used to distinguish the ith base matrix from the (i+1)th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0209] In an embodiment, the encoding requirement information further comprises a required code length and a promotion value of the bit sequence to be encoded; the support information further comprises code length thresholds of the base matrices; wherein the required code length is the code length of the target encoded bit sequence. The target base matrix is determined from the base matrix set according to the encoding requirement information of the bit sequence to be encoded and the support information of the base matrices in the base matrix set, comprising:

[0210] The target base matrix is determined from the base matrix set according to the required code length and the promotion value of the bit sequence to be encoded and the code length thresholds of the base matrices in the base matrix set; wherein the required code length, the promotion value and the code length threshold are all integers greater than 0.

[0211] In an embodiment, the target base matrix is determined from the base matrix set according to the required code length and the promotion value of the bit sequence to be encoded and the code length thresholds of the base matrices in the base matrix set, comprising:

[0212] In the case that the required code length of the bit sequence to be encoded is greater than or equal to the first code length threshold and less than the second code length threshold, the latter base matrix in the adjacent base matrices distinguished by the first code length threshold is determined as the target base matrix; wherein the first code length threshold and the second code length threshold are two adjacent code length thresholds corresponding to the base matrix set under the promotion value; in the case that the required code length of the bit sequence to be encoded is less than the minimum code length threshold corresponding to the base matrix set, the base matrix with the minimum base code length under the promotion value in the base matrix set is determined as the target base matrix; in the case that the required code length of the bit sequence to be encoded is greater than or equal to the maximum code length threshold corresponding to the base matrix set, the base matrix with the maximum base code length under the promotion value in the base matrix set is determined as the target base matrix.

[0213] In an embodiment, the numerical relationship satisfied by the code length threshold comprises:

[0214] wherein ΔN is an integer less than ; wherein N i is the base code length of the ith base matrix in the base matrix set; N i+1 is the base code length of the (i+1)th base matrix in the base matrix set; F i is the code length threshold used to distinguish the ith base matrix from the (i+1)th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0215] In an embodiment, the manner of determining the base code length of the base matrix comprises:

[0216] The difference between the number of columns of the base matrix and the total number of puncturing is determined as a fifth difference value; the integer of the product of the lifting value and the fifth difference value is determined as the base code length of the base matrix; wherein the manner of integer includes at least one of the following: upward rounding; downward rounding; rounding to the nearest; wherein the absolute value of the difference between the base code lengths corresponding to the lifting value of any two base matrices in the base matrix set is greater than or equal to a second preset difference threshold.

[0217] In an embodiment, the target code bit sequence is determined by encoding the to-be-encoded bit sequence through the target base matrix, comprising:

[0218] The lifting value matching the to-be-encoded bit sequence is obtained; the first code bit sequence is determined by encoding the to-be-encoded bit sequence through the lifting value and the target base matrix; the target code bit sequence is determined by bit selection on the first code bit sequence.

[0219] In an embodiment, the first code bit sequence is determined by encoding the to-be-encoded bit sequence through the lifting value and the target base matrix, comprising:

[0220] The parity check matrix corresponding to the to-be-encoded bit sequence is determined by matrix extension on the target base matrix based on the lifting value; the first code bit sequence is determined by encoding the to-be-encoded bit sequence through the parity check matrix.

[0221] In an embodiment, since the code length required by the target code bit sequence is often different from the first code bit sequence, the target code bit sequence can be determined by bit selection on the first code bit sequence.

[0222] In an embodiment, the bit selection on the first code bit sequence comprises at least one of the following:

[0223] The first code bit sequence is bit selected through the required code length of the to-be-encoded bit sequence; the first code bit sequence is bit selected through the code rate of the to-be-encoded bit sequence.

[0224] In an embodiment, the first code bit sequence is bit selected through the code rate of the to-be-encoded bit sequence, comprising:

[0225] The check column puncturing number is determined according to the code rate of the to-be-encoded bit sequence, the number of rows of the target base matrix, the lifting value, the length of the to-be-encoded bit sequence, and the system bit puncturing number; the target code bit sequence is obtained by puncturing the first code bit sequence in the system column bit puncturing number of bits and the check column puncturing number of bits.

[0226] In an embodiment, after determining the target encoding bit sequence, further comprising:

[0227] sending all bits in the target encoding bit sequence, or part of the bits in the target encoding bit sequence, to the second communication node.

[0228] In one example embodiment, FIG. 7 is a structural schematic diagram of a data processing apparatus provided by an embodiment of the present application, which is applied to the second communication node. As shown in FIG. 7, the apparatus comprises:

[0229] The decoding sequence obtaining module 410 is configured to receive a to-be-decoded bit sequence; the target matrix determining module 420 is configured to determine a target base matrix from a base matrix set according to decoding requirement information of the to-be-decoded bit sequence and support information of each base matrix in the base matrix set; and the target sequence determining module 430 is configured to determine a target decoding bit sequence by decoding the to-be-decoded bit sequence through the target base matrix. The base matrix set comprises at least two base matrices.

[0230] In an embodiment, the decoding requirement information comprises a code rate of the to-be-decoded bit sequence; the support information comprises a base code rate and a code rate threshold of each base matrix; and the target base matrix is determined from the base matrix set according to the decoding requirement information of the to-be-decoded bit sequence and the support information of each base matrix in the base matrix set, which comprises:

[0231] The target base matrix is determined from the base matrix set according to the code rate of the to-be-decoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set; wherein the code rate, the base code rate and the code rate threshold are all real numbers greater than 0 and less than 1; and the absolute value of the difference between the base code rates corresponding to any two base matrices in the base matrix set is greater than or equal to a first preset difference threshold.

[0232] In an embodiment, in the case that the number of rows of each base matrix in the base matrix set is equal and the number of columns of each base matrix is equal, the target base matrix is determined from the base matrix set according to the code rate of the to-be-decoded bit sequence and the base code rate and the code rate threshold of each base matrix in the base matrix set, which comprises at least one of the following:

[0233] In a case that the code rate of the bit sequence to be decoded is greater than or equal to a first code rate threshold and less than a second code rate threshold, a latter base matrix in adjacent base matrices distinguished by the first code rate threshold is determined as the target base matrix; the first code rate threshold and the second code rate threshold are two adjacent code rate thresholds corresponding to the base matrix set; in a case that the code rate of the bit sequence to be decoded is less than a smallest code rate threshold corresponding to the base matrix set, a base matrix with a smallest base code rate in the base matrix set is determined as the target base matrix; in a case that the code rate of the bit sequence to be decoded is greater than or equal to a largest code rate threshold corresponding to the base matrix set, a base matrix with a largest base code rate in the base matrix set is determined as the target base matrix.

[0234] In an embodiment, the base code rate is determined in the following manner:

[0235] A difference between the number of columns and the number of rows of the base matrix is determined as a first difference value; a difference between the number of columns of the base matrix and the total number of puncturing is determined as a second difference value; a ratio of the first difference value to the second difference value is determined as the base code rate of the base matrix; the total number of puncturing is a non-negative real number less than the number of rows of the base matrix.

[0236] In an embodiment, the code rate threshold is determined in at least one of the following manners:

[0237] The code rate threshold is determined by a preset expression; the code rate threshold is determined by a first preset code rate threshold table; the first preset code rate threshold table contains a corresponding relationship between the code rate threshold and the base code rate interval; the code rate threshold is determined by a second preset code rate threshold table; the second preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate interval and the lifting value interval; the code rate threshold is determined by a third preset code rate threshold table; the third preset code rate threshold table contains a corresponding relationship between the code rate threshold, the base code rate interval and an information bit interval in which the length of the bit sequence to be decoded is located; the code rate threshold is determined by a preset process; the preset process is represented by a judgment statement based on the first preset code rate threshold table, the second preset code rate threshold table or the third preset code rate threshold table.

[0238] In an embodiment, the numerical relationship satisfied by the code rate threshold in the preset expression includes at least one of the following:

[0239] wherein |AR| is a real number less than . wherein R i is the base code rate of an i-th base matrix in the base matrix set; R i+1 is the base code rate of an i+1-th base matrix in the base matrix set; T ia code rate threshold value used to distinguish the i-th base matrix from the i+1-th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0240] In an embodiment, in the case that there are at least two base matrices in the base matrix set with different row numbers, different column numbers, and equal difference between column number and row number, the target base matrix is determined from the base matrix set according to the code rate of the bit sequence to be decoded, and the base code rates and the code rate threshold values of the base matrices in the base matrix set, including at least one of the following:

[0241] In the case that the code rate of the bit sequence to be decoded is greater than or equal to the third code rate threshold value and less than the fourth code rate threshold value, the third code rate threshold value is taken as the target base matrix in the latter one of the adjacent base matrices distinguished by the third code rate threshold value; wherein the third code rate threshold value and the fourth code rate threshold value are two adjacent code rate threshold values corresponding to the base matrix set; in the case that the code rate of the bit sequence to be decoded is less than the smallest code rate threshold value corresponding to the base matrix set, the base matrix with the smallest base code rate in the base matrix set is determined as the target base matrix; in the case that the code rate of the bit sequence to be decoded is greater than or equal to the largest code rate threshold value corresponding to the base matrix set, the base matrix with the largest base code rate in the base matrix set is determined as the target base matrix.

[0242] In an embodiment, the determination of the base code rate includes:

[0243] The difference between the column number and the row number of the base matrix is determined as a third difference value; the difference between the column number of the base matrix and the maximum puncturing number is determined as a fourth difference value; the ratio of the third difference value to the column number of the base matrix is determined as the minimum base code rate supported by the base matrix; the ratio of the third difference value to the fourth difference value is determined as the maximum base code rate supported by the base matrix; wherein the maximum puncturing number is an integer greater than 1 and less than the row number of the base matrix.

[0244] In an embodiment, the determination of the code rate threshold value includes at least one of the following:

[0245] determined by a preset expression; determined by a fourth preset code rate threshold table; wherein the fourth preset code rate threshold table contains the corresponding relationship between the code rate threshold value and the base code rate repetition interval; determined by a fifth preset code rate threshold table; wherein the fifth preset code rate threshold table contains the corresponding relationship between the code rate threshold value, the base code rate repetition interval, and the promotion value interval; determined by a sixth preset code rate threshold table; wherein the sixth preset code rate threshold table contains the corresponding relationship between the code rate threshold value, the base code rate repetition interval, and the information bit interval in which the length of the bit sequence to be decoded is located; determined by a preset process; wherein the preset process is a judgment statement based on the fourth preset code rate threshold table, the fifth preset code rate threshold table, or the sixth preset code rate threshold table.

[0246] In an embodiment, the numerical relationship that the code length threshold satisfies in the preset expression comprises at least one of the following:

[0247] wherein, ΔR is a real number less than . wherein, is the maximum basic code rate supported by the i-th basic matrix in the basic matrix set; is the minimum basic code rate supported by the i+1-th basic matrix in the basic matrix set; T i is the code rate threshold used to distinguish the i-th basic matrix from the i+1-th basic matrix; wherein, i+1 is a positive integer less than the number of basic matrices in the basic matrix set.

[0248] In an embodiment, the decoding requirement information further comprises a required code length and a promotion value of the to-be-decoded bit sequence; the support information further comprises the code length threshold of each basic matrix; wherein, the required code length is the code length of the target decoded bit sequence. According to the decoding requirement information of the to-be-decoded bit sequence and the support information of each basic matrix in the basic matrix set, the target basic matrix is determined from the basic matrix set, comprising:

[0249] According to the required code length and the promotion value of the to-be-decoded bit sequence and the code length threshold of each basic matrix in the basic matrix set, the target basic matrix is determined from the basic matrix set; wherein, the required code length, the promotion value and the code length threshold are all integers greater than 0.

[0250] In an embodiment, according to the required code length of the to-be-decoded bit sequence and the code length threshold of each basic matrix in the basic matrix set, the target basic matrix is determined from the basic matrix set, comprising:

[0251] In the case that the required code length of the to-be-decoded bit sequence is greater than or equal to the first code length threshold and less than the second code length threshold, the latter basic matrix in the adjacent basic matrices distinguished by the first code length threshold is determined as the target basic matrix; wherein, the first code length threshold and the second code length threshold are two adjacent code length thresholds corresponding to the basic matrix set under the promotion value; in the case that the required code length of the to-be-decoded bit sequence is less than the minimum code length threshold corresponding to the basic matrix set, the basic matrix with the minimum basic code length under the promotion value in the basic matrix set is determined as the target basic matrix; in the case that the required code length of the to-be-decoded bit sequence is greater than or equal to the maximum code length threshold corresponding to the basic matrix set, the basic matrix with the maximum basic code length under the promotion value in the basic matrix set is determined as the target basic matrix.

[0252] In an embodiment, the numerical relationship that the code length threshold satisfies comprises:

[0253] wherein ΔN is an integer less than wherein N i is the base code length of the i-th base matrix in the base matrix set; N i+1 is the base code length of the i+1-th base matrix in the base matrix set; F i is the code length threshold used to distinguish the i-th base matrix from the i+1-th base matrix; wherein i+1 is a positive integer less than the number of base matrices in the base matrix set.

[0254] In an embodiment, the base code length of the base matrix is determined in the following manner:

[0255] determining a fifth difference value as the difference between the column number of the base matrix and the total number of puncturing; determining the base code length of the base matrix as the integer of the product of the lifting value and the fifth difference value; wherein the integer is determined in at least one of the following manners: upward rounding; downward rounding; nearest rounding; wherein the absolute value of the difference between the base code lengths corresponding to the lifting value of any two base matrices in the base matrix set is greater than or equal to a second preset difference threshold.

[0256] In an embodiment, the target decoding bit sequence is determined by decoding the to-be-decoded bit sequence using the target base matrix, comprising:

[0257] obtaining a lifting value matching the to-be-decoded bit sequence; decoding the to-be-decoded bit sequence using the lifting value and the target base matrix to determine a first decoding bit sequence; performing bit selection on the first decoding bit sequence to determine the target decoding bit sequence.

[0258] In an embodiment, the first decoding bit sequence is determined by decoding the to-be-decoded bit sequence using the lifting value and the target base matrix, comprising:

[0259] performing matrix extension on the target base matrix based on the lifting value to determine a parity check matrix corresponding to the to-be-decoded bit sequence; decoding the to-be-decoded bit sequence using the parity check matrix to determine the first decoding bit sequence.

[0260] In an embodiment, since the length of the target decoding bit sequence is often different from that of the first decoding bit sequence, bit selection can be performed on the first decoding bit sequence to determine the target decoding bit sequence.

[0261] In an embodiment, the bit selection on the first decoding bit sequence comprises at least one of the following:

[0262] performing bit selection on the first decoding bit sequence based on the required length of the target decoding bit sequence; performing bit selection on the first decoding bit sequence based on the code rate of the target decoding bit sequence.

[0263] In an embodiment, the bit selection of the first decoded bit sequence is performed by a code rate of the target decoded bit sequence, including:

[0264] The required length of the target decoded bit sequence is determined according to the code rate of the target decoded bit sequence and the length of the bit sequence to be decoded, and the target decoded bit sequence is obtained from the first decoded bit sequence according to the required length of the target decoded bit sequence. In one example, the first target decoded bit sequence of the required length of the target decoded bit sequence is selected from the first decoded bit sequence.

[0265] The embodiments of the present application further provide a communication node. FIG. 8 is a structural schematic diagram of a communication node according to an embodiment of the present application. As shown in FIG. 8, the communication node according to an embodiment of the present application comprises a memory 520, a processor 510, and a computer program stored in the memory and executable on the processor, and the processor 510 implements the data processing method described above when executing the program.

[0266] The communication node can further comprise a memory 520; the processor 510 in the communication node can be one or more, and one processor 510 is taken as an example in FIG. 8; the memory 520 is used to store one or more programs; the one or more programs are executed by the one or more processors 510, so that the one or more processors 510 implement the data processing method as described in the embodiments of the present application.

[0267] The communication node further comprises a communication device 530, an input device 540 and an output device 550.

[0268] The processor 510, the memory 520, the communication device 530, the input device 540 and the output device 550 in the communication node can be connected through a bus or other means, and the connection through the bus is taken as an example in FIG. 8.

[0269] The input device 540 can be used to receive input digital or character information, and generate key signal input related to user settings and function control of the communication node. The output device 550 can include a display device such as a display screen.

[0270] The communication device 530 can include a receiver and a transmitter. The communication device 530 is configured to perform information receiving and transmitting communication according to the control of the processor 510.

[0271] The memory 520, as a computer readable storage medium, can be configured to store software programs, computer executable programs and modules, such as program instructions / modules corresponding to the data processing method (for example, the encoding sequence obtaining module 310, the target matrix determining module 320 and the target sequence determining module 330 in the data processing apparatus; or the decoding sequence obtaining module 410, the target matrix determining module 420 and the target sequence determining module 430) described in the embodiments of the present application. The memory 520 can include a program storage area and a data storage area, where the program storage area can store an operating system and application programs required by at least one function; and the data storage area can store data created according to the use of the communication node, and the like. In addition, the memory 520 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state memory device. In some examples, the memory 520 can further include a memory disposed remotely with respect to the processor 510, and the remote memory can be connected to the communication node through a network. Examples of the network include the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.

[0272] The embodiments of the present application further provide a storage medium, which stores a computer program. The computer program is executed by a processor to implement the data processing method described in any of the embodiments of the present application.

[0273] Optionally, the data processing method is applied to a first communication node, and includes: obtaining a to-be-encoded bit sequence; determining a target base matrix from a base matrix set according to encoding requirement information of the to-be-encoded bit sequence and support information of each base matrix in the base matrix set; and encoding the to-be-encoded bit sequence by using the target base matrix to determine a target encoded bit sequence; wherein the base matrix set includes at least two base matrices.

[0274] Optionally, the data processing method is applied to a second communication node, and includes: receiving a to-be-decoded bit sequence; determining a target base matrix from a base matrix set according to decoding requirement information of the to-be-decoded bit sequence and support information of each base matrix in the base matrix set; and decoding the to-be-decoded bit sequence by using the target base matrix to determine a target decoded bit sequence; wherein the base matrix set includes at least two base matrices.

[0275] The computer storage medium of the embodiments of the present application can adopt any combination of one or more computer readable media. The computer readable medium can be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium may, for example, be: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or apparatus, or any combination thereof. More specific examples (non-exhaustive list) of the computer readable storage medium include: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read only memory (ROM), an erasable programmable read only memory (EPROM), a flash memory, a fiber optic, a portable CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the above. The computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in connection with an instruction execution system, apparatus or device.

[0276] The computer readable signal medium can include a data signal propagated in baseband or propagated as a carrier wave in a propagated data signal, in which the computer readable program code is embodied. Such propagated data signal can take a variety of forms, including but not limited to electro-magnetic, optical or any suitable combination thereof. The computer readable signal medium can also be any computer readable medium that is not a storage medium and that can communicate, propagate or transport programming for use by or in connection with an instruction execution system, apparatus or device.

[0277] The program code contained on the computer readable medium can be transmitted using any suitable medium, including but not limited to wireless, wire line, optical fiber cable, radio frequency (RF), and the like, or any suitable combination thereof.

[0278] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0279] Optionally, the embodiments of the present application further provide a computer program product, comprising a computer program, which, when executed by a processor, implements the data processing method provided by any of the embodiments of the present application.

[0280] The above merely provides exemplary embodiments of the present application, but should not be used to limit the protective scope of the present application.

[0281] Those skilled in the art will appreciate that the term user terminal encompasses any appropriate type of wireless user equipment, such as a mobile phone, a portable data processing apparatus, a portable web browser, or a vehicle-mounted mobile station.

[0282] Generally, the various embodiments of the present application can be implemented in hardware or special-purpose circuits, software, logic or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in

[0283] Embodiments of the present application can be implemented by a data processor of a mobile device executing computer program instructions, for example in a processor entity, or by hardware, or by a combination of software and hardware. Computer program instructions can be in assemblies, Instruction Set Architecture (ISA), machine, machine-related, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0284] The block diagrams of any logical flow of the present application in the drawings can represent program operations, or can represent interconnecting logical circuits, modules and functions, or can represent a combination of operation steps and logical circuits, modules and functions. The computer program can be stored on a memory. The memory can have any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as a Read-Only Memory (ROM), a Random Access Memory (RAM), an optical storage device and system (a Digital Video Disc (DVD) or a Compact Disk (CD), etc. The computer readable medium can include a non-transitory storage medium. The data processor can be of any type suitable for the local technical environment, and can include a general purpose computer, a special purpose computer, a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on a multi-core processor architecture, etc.

Claims

1. A data processing method, applied to a first communication node, comprising: Obtain the bit sequence to be encoded; Based on the encoding requirement information of the bit sequence to be encoded and the support information of each basic matrix in the basic matrix set, the target basic matrix is ​​determined from the basic matrix set; The target encoded bit sequence is determined by encoding the bit sequence to be encoded using the target fundamental matrix. The set of basic matrices includes at least two basic matrices.

2. The data processing method according to claim 1, wherein, The encoding requirement information includes the code rate of the bit sequence to be encoded; the support information includes the base code rate and code rate threshold of each base matrix; The step of determining the target fundamental matrix from the fundamental matrix set based on the encoding requirement information of the bit sequence to be encoded and the support information of each fundamental matrix in the fundamental matrix set includes: The target fundamental matrix is ​​determined from the fundamental matrix set based on the code rate of the bit sequence to be encoded, and the base code rate and code rate threshold of each fundamental matrix in the fundamental matrix set. Wherein, the bitrate, the base bitrate, and the bitrate threshold are all real numbers greater than 0 and less than 1; Wherein, the absolute value of the difference between the base code rates corresponding to every two base matrices in the base matrix set is greater than or equal to a first preset difference threshold.

3. The data processing method according to claim 2, wherein, When all fundamental matrices in the set of fundamental matrices have the same number of rows and columns, determining the target fundamental matrix from the set of fundamental matrices based on the code rate of the bit sequence to be encoded, and the base code rate and code rate threshold of each fundamental matrix in the set of fundamental matrices, includes at least one of the following: If the code rate of the bit sequence to be encoded is greater than or equal to a first code rate threshold and less than a second code rate threshold, the next basic matrix in the adjacent basic matrices distinguished by the first code rate threshold is determined as the target basic matrix; wherein, the first code rate threshold and the second code rate threshold are two code rate thresholds with adjacent numerical values ​​corresponding to the set of basic matrices. If the code rate of the bit sequence to be encoded is less than the minimum code rate threshold corresponding to the set of basic matrices, the basic matrix with the minimum basic code rate in the set of basic matrices shall be determined as the target basic matrix. If the code rate of the bit sequence to be encoded is greater than or equal to the maximum code rate threshold corresponding to the set of basic matrices, the basic matrix with the largest basic code rate in the set of basic matrices is determined as the target basic matrix.

4. The data processing method according to claim 3, wherein, The method for determining the base bitrate includes: The difference between the number of columns and the number of rows of the basic matrix is ​​determined as the first difference; The difference between the number of columns in the basic matrix and the total number of holes is determined as the second difference. The ratio of the first difference to the second difference is determined as the base code rate of the base matrix; Wherein, the total number of holes is a non-negative real number less than the number of rows in the basic matrix.

5. The data processing method according to claim 3, wherein, The method for determining the bit rate threshold includes at least one of the following: Determined by a preset expression; Determined by a first preset bitrate threshold table; wherein the first preset bitrate threshold table contains the correspondence between bitrate thresholds and basic bitrate ranges; Determined by a second preset bitrate threshold table; wherein, the second preset bitrate threshold table contains bitrate thresholds and their correspondence with the base bitrate range and the boost value range; Determined by a third preset code rate threshold table; wherein, the third preset code rate threshold table contains a code rate threshold and a correspondence between it and the base code rate range and the information bit range in which the length of the bit sequence to be encoded is located; The process is determined by a preset procedure; wherein the preset procedure is characterized by a judgment statement based on a first preset bitrate threshold table, a second preset bitrate threshold table, or a third preset bitrate threshold table.

6. The data processing method according to claim 5, wherein, The numerical relationship satisfied by the bitrate threshold in the preset expression includes at least one of the following: Where |ΔR| is less than real numbers; Among them, R i R is the base code rate of the i-th fundamental matrix in the set of fundamental matrices; i+1 T is the base code rate of the (i+1)th base matrix in the set of base matrices; i This is the bitrate threshold used to distinguish the i-th basic matrix from the (i+1)-th basic matrix; where i+1 is a positive integer less than the number of basic matrices in the set of basic matrices.

7. The data processing method according to claim 2, wherein, In the case where there are at least two base matrices in the base matrix set with unequal numbers of rows and columns, and the difference between their number of columns and rows is equal, determining the target base matrix from the base matrix set based on the code rate of the bit sequence to be encoded, and the base code rate and code rate threshold of each base matrix in the base matrix set, includes at least one of the following: If the code rate of the bit sequence to be encoded is greater than or equal to the third code rate threshold and less than the fourth code rate threshold, the next basic matrix in the adjacent basic matrices distinguished by the third code rate threshold is determined as the target basic matrix; wherein the third code rate threshold and the fourth code rate threshold are two code rate thresholds with adjacent numerical values ​​corresponding to the set of basic matrices. If the code rate of the bit sequence to be encoded is less than the minimum code rate threshold corresponding to the set of basic matrices, the basic matrix with the minimum basic code rate in the set of basic matrices shall be determined as the target basic matrix. If the code rate of the bit sequence to be encoded is greater than or equal to the maximum code rate threshold corresponding to the set of basic matrices, the basic matrix with the largest basic code rate in the set of basic matrices is determined as the target basic matrix.

8. The data processing method according to claim 7, wherein, The method for determining the base bitrate includes: The difference between the number of columns and the number of rows of the basic matrix is ​​determined as the third difference; The difference between the number of columns in the basic matrix and the maximum number of holes is determined as the fourth difference. The ratio of the third difference to the number of columns in the base matrix is ​​determined as the minimum base code rate supported by the base matrix; The ratio of the third difference to the fourth difference is determined as the maximum base code rate supported by the base matrix; The maximum number of holes is an integer greater than 1 and less than the number of rows in the basic matrix.

9. The data processing method according to claim 7, wherein, The method for determining the bit rate threshold includes at least one of the following: Determined by a preset expression; Determined by a fourth preset bitrate threshold table; wherein the fourth preset bitrate threshold table contains the correspondence between bitrate thresholds and basic bitrate repetition intervals; Determined through a fifth preset bitrate threshold table; wherein, the fifth preset bitrate threshold table contains bitrate thresholds and their correspondence with the base bitrate repetition interval and boost interval; Determined through a sixth preset code rate threshold table; wherein, the sixth preset code rate threshold table contains a code rate threshold and a correspondence between it and the information bit interval where the basic code rate repetition interval and the length of the bit sequence to be encoded are located; The process is determined by a preset procedure; wherein the preset procedure is characterized by judgment statements based on a fourth preset bitrate threshold table, a fifth preset bitrate threshold table, or a sixth preset bitrate threshold table.

10. The data processing method according to claim 9, wherein, The numerical relationship satisfied by the code length threshold in the preset expression includes at least one of the following: Where ΔR is less than real numbers; in, The maximum base code rate supported by the i-th base matrix in the set of base matrices; T represents the minimum base code rate supported by the (i+1)th base matrix in the set of base matrices; i This is the bitrate threshold used to distinguish the i-th basic matrix from the (i+1)-th basic matrix; where i+1 is a positive integer less than the number of basic matrices in the set of basic matrices.

11. The data processing method according to claim 1, wherein, The encoding requirement information includes the required code length and boost value of the bit sequence to be encoded; the support information includes the code length threshold of each basic matrix; wherein, the required code length is the code length of the target encoded bit sequence; The step of determining the target fundamental matrix from the fundamental matrix set based on the encoding requirement information of the bit sequence to be encoded and the support information of each fundamental matrix in the fundamental matrix set includes: The target fundamental matrix is ​​determined from the fundamental matrix set based on the required code length and boost value of the bit sequence to be encoded, and the code length threshold of each fundamental matrix in the fundamental matrix set. Wherein, the required code length, the boost value, and the code length threshold are all integers greater than 0.

12. The data processing method according to claim 11, wherein, The step of determining the target fundamental matrix from the fundamental matrix set based on the required code length and boost value of the bit sequence to be encoded, and the code length threshold of each fundamental matrix in the fundamental matrix set, includes: When the required code length of the bit sequence to be encoded is greater than or equal to a first code length threshold and less than a second code length threshold, the next basic matrix in the adjacent basic matrices distinguished by the first code length threshold is determined as the target basic matrix; wherein, the first code length threshold and the second code length threshold are two adjacent code length thresholds corresponding to the basic matrix set under the boost value; If the required code length of the bit sequence to be encoded is less than the minimum code length threshold corresponding to the basic matrix set, the basic matrix with the minimum basic code length in the basic matrix set under the boost value is determined as the target basic matrix; If the required code length of the bit sequence to be encoded is greater than or equal to the maximum code length threshold corresponding to the set of basic matrices, the basic matrix with the largest basic code length in the set of basic matrices under the boost value is determined as the target basic matrix.

13. The data processing method according to claim 11, wherein, The numerical relationships satisfied by the code length threshold include: Where ΔN is less than Integers; Where, N i N is the base code length of the i-th base matrix in the set of base matrices; i+1 F is the base code length of the (i+1)th base matrix in the set of base matrices; i The code length threshold is used to distinguish the i-th basic matrix from the (i+1)-th basic matrix; where i+1 is a positive integer less than the number of basic matrices in the set of basic matrices.

14. The data processing method according to claim 13, wherein, The method for determining the basic code length of the basic matrix includes: The difference between the number of columns in the basic matrix and the total number of holes is determined as the fifth difference. The product of the boost value and the fifth difference is rounded down to determine the base code length of the base matrix; The rounding method includes at least one of the following: Round up; Round down; Round to the nearest whole number; Wherein, the absolute value of the difference between the base code lengths corresponding to each pair of base matrices in the base matrix set under the boost value is greater than or equal to a second preset difference threshold.

15. The data processing method according to claim 1, wherein, The step of encoding the bit sequence to be encoded using the target fundamental matrix to determine the target encoded bit sequence includes: Obtain the boost value that matches the bit sequence to be encoded; The bit sequence to be encoded is encoded using the boost value and the target fundamental matrix to determine the first encoded bit sequence; Bit selection is performed on the first encoded bit sequence to determine the target encoded bit sequence.

16. The data processing method according to claim 15, wherein, The step of encoding the bit sequence to be encoded using the boost value and the target fundamental matrix to determine the first encoded bit sequence includes: Based on the lift value, the target base matrix is ​​expanded to determine the parity check matrix corresponding to the bit sequence to be encoded. The first encoded bit sequence is determined by encoding the bit sequence to be encoded using the parity check matrix.

17. The data processing method according to claim 15, wherein, The bit selection of the first encoded bit sequence includes at least one of the following: Bit selection is performed on the first encoded bit sequence based on the required code length of the bit sequence to be encoded; Bit selection is performed on the first encoded bit sequence based on the code rate of the bit sequence to be encoded.

18. The data processing method according to claim 17, wherein, The step of selecting bits from the first encoded bit sequence based on the code rate of the bit sequence to be encoded includes: The number of parity column punctures is determined based on the bit rate of the bit sequence to be encoded, the number of rows of the target fundamental matrix, the boost value, the length of the bit sequence to be encoded, and the number of system bit punctures. The target encoded bit sequence is obtained by punching several bits of the system column bits and several bits of the parity column bits in the first encoded bit sequence.

19. The data processing method according to claim 1, further comprising, after determining the target coded bit sequence: Send all bits or a portion of the bits in the target encoded bit sequence to the second communication node.

20. A data processing method applied to a second communication node, comprising: Receive the bit sequence to be decoded; Based on the decoding requirement information of the bit sequence to be decoded and the support information of each basic matrix in the basic matrix set, the target basic matrix is ​​determined from the basic matrix set. The target decoded bit sequence is determined by decoding the bit sequence to be decoded using the target fundamental matrix. The set of basic matrices includes at least two basic matrices.

21. The data processing method according to claim 20, wherein, The decoding requirement information includes the code rate of the bit sequence to be decoded; the support information includes the base code rate and code rate threshold of each base matrix; The step of determining the target fundamental matrix from the fundamental matrix set based on the decoding requirement information of the bit sequence to be decoded and the support information of each fundamental matrix in the fundamental matrix set includes: The target fundamental matrix is ​​determined from the fundamental matrix set based on the bit rate of the bit sequence to be decoded, and the base bit rate and bit rate threshold of each fundamental matrix in the fundamental matrix set. Wherein, the bitrate, the base bitrate, and the bitrate threshold are all real numbers greater than 0 and less than 1; Wherein, the absolute value of the difference between the base code rates corresponding to every two base matrices in the base matrix set is greater than or equal to a first preset difference threshold.

22. The data processing method according to claim 20, wherein, The decoding requirement information includes the required code length and boost value of the bit sequence to be decoded; the support information includes the code length threshold of each of the basic matrices; wherein, the required code length is the code length of the target decoded bit sequence; The step of determining the target fundamental matrix from the fundamental matrix set based on the decoding requirement information of the bit sequence to be decoded and the support information of each fundamental matrix in the fundamental matrix set includes: The target fundamental matrix is ​​determined from the fundamental matrix set based on the required code length and boost value of the bit sequence to be decoded, and the code length threshold of each fundamental matrix in the fundamental matrix set. Wherein, the required code length, the boost value, and the code length threshold are all integers greater than 0.

23. A communication node, comprising: The system includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for establishing communication between the processor and the memory, wherein the program, when executed by the processor, implements the data processing method as described in any one of claims 1-22.

24. A storage medium for computer-readable storage, the storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the data processing method according to any one of claims 1-22.

25. A computer program product comprising a computer program that, when executed by a processor, implements the data processing method according to any one of claims 1-22.

Images