Low-density parity check code processing method and device, equipment and storage medium

Abstract

The invention discloses a low density parity check (LDPC) processing method and device, electronic equipment and a storage medium. The method comprises the following steps: acquiring first information corresponding to each first frame in at least one first frame when to-be-coded information is transmitted; the transmission frame length of the first frame is smaller than or equal to a first preset threshold value; encoding the first information in a first verification mode to obtain a first code word corresponding to each first frame; the first verification mode represents a verification mode corresponding to the LDPC under a preset communication protocol; encoding the first code word in a second verification mode to obtain a transmission code word corresponding to the to-be-encoded information; the second verification mode represents the verification mode corresponding to each first frame.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a method, device, electronic device and storage medium for processing low-density parity-check codes. Background Art

[0002] The coding scheme under the 5th Generation Mobile Communication Technology (5G) protocol has the property of bit rate compatibility and can be transmitted under a variety of different frame length conditions, but the transmission performance is not good enough when the transmission frame length is short. At the same time, during the transmission process, the encoding and decoding of different frames are completely independent of each other. Although the parallelism and encoding and decoding speed are increased, the transmitted information is not fully utilized to a certain extent. Summary of the invention

[0003] To solve the related technical problems, the embodiments of the present application provide a method, device, electronic device and storage medium for processing a low-density parity-check code.

[0004] The technical solution of the embodiment of the present application is implemented as follows:

[0005] The embodiment of the present application provides a method for processing a low density parity check code (LDPC), including:

[0006] Acquire first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted; the transmission frame length of the first frame is less than or equal to a first preset threshold;

[0007] The first information is encoded using a first verification method to obtain a first codeword corresponding to each first frame; the first verification method represents a verification method corresponding to the LDPC under a preset communication protocol;

[0008] The first codeword is encoded using a second verification method to obtain a transmission codeword corresponding to the information to be encoded; the second verification method represents the verification method corresponding to each first frame.

[0009] In the above solution, the step of obtaining first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted includes:

[0010] Performing a first decomposition process on the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded;

[0011] The first information corresponding to each first frame is determined based on the information sequence.

[0012] In the above solution, encoding the first codeword using a second verification method includes:

[0013] Performing combination processing on the first codewords to obtain a combined second codeword;

[0014] The second codeword is encoded using a second check method to obtain the transmission codeword.

[0015] In the above scheme, the second verification mode includes bit information corresponding to the global code of each first frame and verification information corresponding to the global code, and the method further includes:

[0016] The second verification mode is determined based on the bit information and the verification information.

[0017] In the above scheme, the method further includes:

[0018] Acquire attribute information corresponding to each first frame according to the bit information;

[0019] Determine a parameter corresponding to the global code based on the attribute information;

[0020] The check information is generated according to the parameters and a preset single parity check code (Single Parity Codes, SPC).

[0021] In the above scheme, when the transmission codeword is a sending codeword, the method further includes:

[0022] Obtaining a received codeword corresponding to the sent codeword;

[0023] Determine second information corresponding to each second frame in at least one second frame based on the received codeword; the transmission frame length of the second frame is less than or equal to a second preset threshold;

[0024] Decoding the second information using a third verification method to obtain a third codeword corresponding to each second frame; the third verification method includes a codeword corresponding to the LDPC under the preset communication protocol;

[0025] The third codeword is decoded using a fourth verification method to obtain decoding information corresponding to the received codeword; the fourth verification method includes a verification method corresponding to the LDPC under a preset communication protocol and a verification method corresponding to each first frame.

[0026] In the above solution, the determining, based on the received codeword, second information corresponding to each second frame in at least one second frame includes:

[0027] Performing a second decomposition process on the received codeword to obtain at least two information sequences corresponding to the received codeword;

[0028] The second information corresponding to each second frame is determined based on the information sequence.

[0029] In the above scheme, the method further includes:

[0030] Determine whether the third codeword has a verification relationship that does not satisfy a preset verification method;

[0031] In the case that the third codeword does not fail to satisfy the verification relationship corresponding to the preset verification method, using the third codeword as the decoding information;

[0032] In the case that the third codeword does not satisfy the check relationship corresponding to the preset check method, a fourth codeword in the third codeword that satisfies the check relationship corresponding to the preset check method is decoded using a fourth check method to obtain decoding information corresponding to the received codeword.

[0033] In the above scheme, the method further includes:

[0034] The decoded information is displayed to a user.

[0035] The embodiment of the present application further provides a low-density parity-check code processing device, comprising:

[0036] An acquisition unit, used to acquire first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted; the transmission frame length of the first frame is less than or equal to a first preset threshold;

[0037] A first encoding unit, configured to encode the first information using a first verification method to obtain a first codeword corresponding to each first frame; the first verification method represents a verification method corresponding to the LDPC under a preset communication protocol;

[0038] The second encoding unit is used to encode the first code word using a second verification method to obtain a transmission code word corresponding to the information to be encoded; the second verification method represents the verification method corresponding to each first frame.

[0039] The embodiment of the present application further provides an LDPC processing device, including:

[0040] A memory for storing executable instructions;

[0041] The processor is used to implement any step of the above-mentioned method when executing the executable instructions stored in the memory.

[0042] The embodiment of the present application also provides a computer-readable storage medium storing executable instructions for implementing any step of the above-described method when executed by a processor.

[0043] The processing method, device, electronic device and storage medium of low-density parity check code provided by the embodiment of the present application, wherein the method comprises: obtaining first information corresponding to each first frame in at least one first frame when information to be encoded is transmitted; the transmission frame length of the first frame is less than or equal to a first preset threshold; encoding the first information using a first check method to obtain a first codeword corresponding to each first frame; the first check method represents the check method corresponding to the LDPC under a preset communication protocol; encoding the first codeword using a second check method to obtain a transmission codeword corresponding to the information to be encoded; the second check method represents the check method corresponding to each first frame. The scheme of the embodiment of the present application obtains information of at least one frame whose transmission frame length is less than or equal to the first preset threshold when information to be encoded is transmitted, and adopts a check method corresponding to the LDPC under a preset communication protocol to obtain a codeword corresponding to the frame, and encodes the codeword using a check method corresponding to the frame to obtain a transmission codeword corresponding to the information to be encoded, that is, when the transmission frame length is short, the information of the transmitted frame is fully utilized, and the information is encoded using the check method corresponding to the LDPC and the check method corresponding to the frame, which greatly improves the transmission reliability and throughput under short frame conditions. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 A schematic diagram of a LDPC processing method flow is provided for an embodiment of the present application;

[0045] Figure 2 It is a flowchart of a decoding method of GC-LDPC code integrating 5G in an embodiment of the present application;

[0046] Figure 3 This is a schematic diagram for comparing the throughput of a GC-LDPC code under a high code rate in an embodiment of the present application;

[0047] Figure 4 This is a schematic diagram for comparing the throughput of a GC-LDPC code under a code rate in an embodiment of the present application;

[0048] Figure 5 This is a schematic diagram for comparing the throughput of a GC-LDPC code under a low code rate in an embodiment of the present application;

[0049] Figure 6 A schematic diagram of a low-density parity-check code processing device according to an embodiment of the present application;

[0050] Figure 7 A schematic diagram of a hardware entity structure of an electronic device in an embodiment of the present application. DETAILED DESCRIPTION

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

[0052] Among the technologies for improving the reliability of communication systems, error correction codes have been deeply studied and widely used. Among them, under different data transmission conditions, with the continuous iteration of decoding, the performance of LDPC codes can approach the Shannon limit and has a wide range of application scenarios. Among them, the LDPC code under the 5G standard has the characteristics of code rate compatibility, a wide range of code lengths and code rates, and is a short code construction method with relatively superior performance. This codeword has a quasi-cyclic structure. When constructing, first select and intercept the corresponding base matrix and expansion factor Z according to the required code length and code rate. Subsequently, each element in the base matrix H is replaced with the corresponding square matrix with a side length of Z to obtain the check matrix of the LDPC code. During encoding, the check matrix is ​​used to encode the required information bit sequence of a certain length into a codeword after information bit puncturing, information bit shortening, and check bit puncturing.

[0053] Globally Coupled Low-Density Parity-Check (GC-LDPC) code describes a quasi-cyclic LDPC code structure with a global coupling structure and gives its encoding and decoding method. This quasi-cyclic LDPC code can be divided into two parts: the upper part is composed of many smaller matrices arranged and combined in sequence along the main diagonal, and these small matrices are recorded as local codes; while the lower part is the global code, and different local codes are coupled by adding additional check relations. Regular codes are often constructed using algebraic methods. As local and global codes of global coupling codes, their performance has a lot of room for improvement.

[0054] Single Parity Codes (SPC) is a general term for odd parity codes and even parity codes. It is a basic error detection code, consisting of n-1 information elements and 1 check element, which can be expressed as (n-1, n). Its implementation method is to add a check bit '0' or '1' to the left or right of the information sequence, so that the number of '1' in the new sequence is an even number (even parity) or an odd number (odd parity).

[0055] Although the current coding scheme under the 5G protocol has the property of code rate compatibility and can be transmitted under a variety of different frame length conditions, there is still room for improvement in transmission performance when the transmission frame length is short. At the same time, during the transmission process, the encoding and decoding of different frames are completely independent of each other. Although the parallelism and encoding and decoding speed are increased, the transmitted information is not fully utilized to a certain extent. In the GC-LDPC code in the related technology, with the help of the global coupling structure, the correct decoded short frames can be used to correct the wrong frames, but both the local code performance and the overall performance still have a lot of room for improvement. In order to solve these two problems and improve the transmission reliability and throughput under short frame conditions, the coding scheme in the 5G protocol can be combined with the global coupling code.

[0056] Based on this, the embodiment of the present application provides a method for processing a low-density parity check code, which is applied to an electronic device. The function implemented by the method can be implemented by calling a program code by a processor in the electronic device. Of course, the program code can be stored in a computer storage medium. It can be seen that the electronic device at least includes a processor and a storage medium. As an example, the electronic device can be a mobile phone, a computer, a terminal, an information transceiver device, a tablet device, a personal digital assistant, etc.

[0057] Figure 1 A schematic diagram of a LDPC processing method flow is provided for an embodiment of the present application; Figure 1 As shown, the method includes:

[0058] Step 101: obtaining first information corresponding to each first frame in at least one first frame when information to be encoded is transmitted; the transmission frame length of the first frame is less than or equal to a first preset threshold;

[0059] Step 102: Encode the first information using a first verification method to obtain a first codeword corresponding to each first frame; the first verification method represents a verification method corresponding to the LDPC under a preset communication protocol;

[0060] Step 103: Encode the first codeword using a second verification method to obtain a transmission codeword corresponding to the information to be encoded; the second verification method represents the verification method corresponding to each first frame.

[0061] In step 101, the information to be encoded may be determined according to actual conditions, and is not limited here. The information to be encoded may be an information sequence to be encoded. In practical applications, the information sequence to be encoded may be denoted as u.

[0062] The transmission frame length of the first frame is less than or equal to a first preset threshold; wherein the first preset threshold can be determined according to actual conditions and is not limited here. The transmission frame length of the first frame is less than or equal to the first preset threshold, which can be understood as the first frame being a short frame.

[0063] Acquiring the first information corresponding to each first frame in at least one first frame when transmitting the information to be encoded can be understood as dividing the information to be encoded into at least one first frame, transmitting the first information corresponding to each first frame in the at least one first frame, and then acquiring the first information. The number of at least one first frame can be denoted as c; the first information can be determined according to actual conditions and is not limited here. As an example, the first information can be an information bit. As an example, the information to be encoded can be an information sequence to be encoded, denoted as u, and the information sequence u to be encoded is split into [u1..., u c ], corresponding to the information bits sent in each short frame during transmission.

[0064] In step 102, the first verification method represents the verification method corresponding to the LDPC under the preset communication protocol; wherein, the preset communication protocol can be determined according to the actual situation and is not limited here. As an example, the preset communication protocol can be a 5G protocol. The first verification method can be determined according to the actual situation and is not limited here. As an example, the first verification method can be a check matrix, and the check matrix can be a form of a local code that conforms to the LDPC code under the 5G protocol; the local code can be recorded as H local，i ; Among them, 1≤i≤c; c can be understood as the number of short frames.

[0065] For ease of understanding, an example is given here to construct the check matrix of the LDPC code using a global coupling code, setting the local code to a 5G code, and using a single parity check as the global code for coupling.

[0066] Assume that a GC-LDPC codeword contains c short frames, and its codeword can be expressed as w = [v1, v2, ..., v c , p]. Any segment v in the codeword i , 1≤i≤c, are all codewords of LDPC code under 5G protocol, and their corresponding check matrix is ​​the local code H local，i The form of LDPC code under the 5G protocol is consistent; p is the additional check bit added by global coupling. The check matrix corresponding to the codeword of the GC-LDPC code satisfies the following formula (1):

[0067]

[0068] Let H global=[H global，m H global，p ], is the global code part that couples all local codes. global，m The corresponding codeword v=[v1,v2,...,v c ], i.e., the information bit of the input global code; H global，p is the check part of the global code, corresponding to p in the codeword. In this scheme, a single parity check method is used to construct H global . Assume that any short frame v i , the information bit length in 1≤i≤c is k i , the frame length is n i , the overall codeword length of the global coupling code is Take M global =max(k1, ..., k c ) is H global The number of rows. Let the matrix Then the element h i，j The value can be expressed as the following formula (2):

[0069]

[0070] In practical applications, the unit matrix can be directly used to complete the coupling of information bits in all short frames. qlobal，m =I, use SPC to generate the check digit of the global code part.

[0071] The first information is encoded using a first check method to obtain a first codeword corresponding to each first frame, which can be encoded using H local，i Encoding is performed to obtain a first codeword corresponding to each first frame. As an example, the first information may be an information bit in each short frame, and the information bit may be recorded as u i , 1≤i≤c; the first codeword can be understood as the codeword sent by the short frame, which can be recorded as v i ; Using H for the first information local，i Encoding to obtain the first codeword corresponding to each first frame can be understood as encoding the information bit u in each short frame. i , 1≤i≤c, using the corresponding local code check matrix H local，i Encode and get the codeword v sent by the short frame i .

[0072] In step 103, the second verification mode represents the verification mode corresponding to each first frame; wherein, the second verification mode can be determined according to actual conditions, and is not limited here. As an example, the second verification mode can be a global code verification mode; the global code verification mode can be understood as a global code part that couples all local codes; the global code verification mode can be recorded as H global .

[0073] As an example, the encoding of the first codeword using the second check method may be combining the first codewords to obtain the combined second codeword; and encoding the second codeword using the second check method to obtain the transmission codeword. In practical applications, all short frame transmission codewords are combined to obtain v = [v1, ..., v c Then, using the global code check matrix H global Encode v again and finally get the transmission codeword w = [v1, v2, ..., v c , p].

[0074] The present application obtains information of at least one frame whose transmission frame length is less than or equal to a first preset threshold value when the information to be encoded is transmitted, applies a check method corresponding to LDPC under a preset communication protocol to the information, obtains a codeword corresponding to the frame, encodes the codeword using a check method corresponding to the frame, and obtains a transmission codeword corresponding to the information to be encoded. That is, when the transmission frame length is short, the information of the transmitted frame is fully utilized, and the information is encoded using a check method corresponding to LDPC and a check method corresponding to the frame, thereby greatly improving the transmission reliability and throughput under short frame conditions.

[0075] In one embodiment, the obtaining of first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted includes:

[0076] Performing a first decomposition process on the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded;

[0077] The first information corresponding to each first frame is determined based on the information sequence.

[0078] The first decomposition process can be determined according to the actual situation and is not limited here. As an example, the first decomposition process can be understood as a split process. The information to be encoded can be recorded as u; the specific number of the at least two information sequences can be determined according to the actual situation and is not limited here. In practical applications, the at least two information sequences can be recorded as [u1..., u c ].

[0079] Performing a first decomposition process on the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded can be understood as performing a split process on the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded; as an example, splitting the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded can be splitting u to obtain [u1..., u c ].

[0080] Determine the first information corresponding to each first frame based on the information sequence; wherein the first frame can be understood as a short frame; the first information can be understood as an information bit; as an example, determining the first information corresponding to each first frame based on the information sequence can be understood as based on [u1..., u c ]Send the information bits corresponding to each short frame.

[0081] In practical applications, the information sequence u to be encoded is split into [u1..., u c ], corresponding to the information bits sent in each short frame during transmission.

[0082] In one embodiment, encoding the first codeword using a second check method includes:

[0083] Performing combination processing on the first codewords to obtain a combined second codeword;

[0084] The second codeword is encoded using a second check method to obtain the transmission codeword.

[0085] The first codeword may be a transmission codeword; the second codeword may be denoted as v, where v=[v1, ..., v c ]; The second verification method may include a global code check matrix, which can be denoted as H global ; The transmission codeword can be recorded as w, where w = [v1, v2, ..., v c , p].

[0086] In practical applications, all short frame transmission codewords are combined to obtain v = [v1, ..., v c Then, using the global code check matrix H global Encode v again and finally get the transmission codeword w = [v1, v2, ..., v c , p].

[0087] In this embodiment, 5G code can be used as the local code to construct GC-LDPC code for application in a system that transmits in short frames. Compared with direct transmission, a coding scheme for global decoding of multi-frame received data is added when channel conditions are poor, which can more efficiently utilize the information of the received codeword and improve the reliability and throughput of transmission.

[0088] In one embodiment, the second verification mode includes bit information corresponding to the global code of each first frame and verification information corresponding to the global code, and the method further includes:

[0089] The second verification mode is determined based on the bit information and the verification information.

[0090] In this embodiment, the second verification method includes bit information corresponding to the global code of each first frame and verification information corresponding to the global code; wherein the bit information can be recorded as H global，m ; The H global，m The corresponding codeword v=[v1,v2,...,v c ]; can be understood as the information bit of the input global code. The check information can be recorded as H global，p , the H global，p is the check part of the global code, corresponding to p in the codeword, which is an extra check bit added by global coupling. The second check method can be recorded as H global .

[0091] Determining the second verification mode based on the bit information and the verification information can be understood as based on H global，m and H global，p Combine them to get H global ; The H global =[H global，m , H global，p ], is the global code part that couples all local codes. global，m The corresponding codeword v=[v1,v2,...,v c ], i.e., the information bit of the input global code; H global，p It is the check part of the global code, corresponding to p in the codeword.

[0092] In one embodiment, the method further comprises:

[0093] Acquire attribute information corresponding to each first frame according to the bit information;

[0094] Determine a parameter corresponding to the global code based on the attribute information;

[0095] The check information is generated according to the parameter and a preset single parity check code SPC.

[0096] The attribute information may be determined according to actual conditions and is not limited here. As an example, the attribute information may include information bit length, frame length, etc. The information bit length may be denoted as k i ; The frame length can be recorded as n i The parameters corresponding to the global code can be determined according to actual conditions and are not limited here. As an example, the parameters corresponding to the global code may include the length corresponding to the global code, etc. The length corresponding to the global code can be recorded as n. In practical applications, any short frame can be recorded as v i , the information bit length in 1≤i≤c is k i , the frame length is n i , the overall codeword length of the global coupling code is

[0097] Generating the verification information according to the parameters and the preset SPC can be understood as constructing the verification information according to the parameters and the preset SPC; wherein the SPC can be determined according to actual conditions and is not limited here. As an example, the verification information can be a check matrix, which can be recorded as H global ; Constructing the check information according to the parameters and the preset SPC can be understood as constructing H according to the parameters using a single parity check method. global .

[0098] In practical applications, any short frame v i , the information bit length in 1≤i≤c is k i , the frame length is n i , the overall codeword length of the global coupling code is Take M global =max(k1, ..., k c ) is H global Number of rows. Matrix Then the element h i，j The value can be expressed by referring to the above formula (2). That is, the unit matrix is ​​directly used to complete the coupling of information bits in all short frames. At the same time, H global，m =I, use SPC to generate the check digit of the global code part.

[0099] In one embodiment, when the transmission codeword is a sending codeword, the method further includes:

[0100] Obtaining a received codeword corresponding to the sent codeword;

[0101] Determine second information corresponding to each second frame in at least one second frame based on the received codeword; the transmission frame length of the second frame is less than or equal to a second preset threshold;

[0102] Decoding the second information using a third verification method to obtain a third codeword corresponding to each second frame; the third verification method includes a codeword corresponding to the LDPC under the preset communication protocol;

[0103] The third codeword is decoded using a fourth verification method to obtain decoding information corresponding to the received codeword; the fourth verification method includes a verification method corresponding to the LDPC under a preset communication protocol and a verification method corresponding to each first frame.

[0104] In this embodiment, obtaining the received codeword corresponding to the transmitted codeword can be understood as the receiving end receiving the received code corresponding to the transmitted codeword; as an example, the received code can be understood as the superposition of the transmitted codeword and noise, and the transmitted codeword can be recorded as w, where w=[v1, v2, ..., v c , p]; the received code can be recorded as r, where r=w+n, wherein n can be understood as noise.

[0105] The transmission frame length of the second frame is less than or equal to the second preset threshold; wherein the second preset threshold can be determined according to actual conditions and is not limited here. The transmission frame length of the second frame is less than or equal to the second preset threshold, which can be understood as the second frame being a received short frame, which can be recorded as r i , 1≤i≤c.

[0106] As an example, determining the second information corresponding to each second frame in at least one second frame based on the received codeword may include performing a second decomposition process on the received codeword to obtain at least two information sequences corresponding to the received codeword; and determining the second information corresponding to each second frame based on the information sequence.

[0107] The second information is decoded using a third check method to obtain a third codeword corresponding to each second frame; the third check method includes a codeword corresponding to the LDPC under the preset communication protocol; wherein the third check method can be determined according to actual conditions and is not limited here. As an example, the third check method can be a check matrix method; the check matrix method can include a local code in a form that conforms to the LDPC code under the 5G protocol, and the local code can be recorded as H local，c The third codeword can be written as The second information is decoded by using the third verification method to obtain the third code word corresponding to each second frame, which can be understood as decoding the second information by using the local code H local，c Decode to obtain the third codeword corresponding to each second frame; in practical application, for each received short frame r i , 1≤i≤c, use the corresponding local code Hlocal，c Decode and get the decoding result 1≤i≤c.

[0108] The third codeword is decoded by adopting the fourth check method to obtain the decoding information corresponding to the received codeword; the fourth check method includes the check method corresponding to the LDPC under the preset communication protocol and the check method corresponding to each first frame. Among them, the fourth check method can be determined according to the actual situation, and is not limited here. As an example, the fourth check method can be a check matrix method; the check matrix method can include a check matrix H, and the check matrix H can refer to the previous formula (1). The third codeword is decoded by adopting the fourth check method to obtain the decoding information corresponding to the received codeword, which can be understood as decoding the third codeword by adopting the check matrix H to obtain the decoding information corresponding to the received codeword; it mainly corrects the error frame that cannot be corrected by local code decoding.

[0109] In one embodiment, determining the second information corresponding to each second frame in at least one second frame based on the received codeword includes:

[0110] Performing a second decomposition process on the received codeword to obtain at least two information sequences corresponding to the received codeword;

[0111] The second information corresponding to each second frame is determined based on the information sequence.

[0112] In this embodiment, the received codeword is subjected to a second decomposition process to obtain at least two information sequences corresponding to the received codeword; wherein the second decomposition process may be determined according to actual conditions and is not limited here. As an example, the second decomposition process may include a segmentation process. The received codeword is subjected to a second decomposition process to obtain at least two information sequences corresponding to the received codeword, which may be a segmentation process to obtain at least two information sequences corresponding to the received codeword. Specifically, the received codeword r=w+n is assumed to be the superposition of the transmitted codeword and noise. It is divided into [r1, r2..., r c ,q], each part of which is a transmitted codeword [v 1， v2, ..., v c , p] is the receiving result after the corresponding part is superimposed with noise.

[0113] Determining the second information corresponding to each second frame based on the information sequence can be understood as determining the information sequence corresponding to each second frame based on the information sequence.

[0114] In one embodiment, the method further comprises:

[0115] Determine whether the third codeword has a verification relationship that does not satisfy a preset verification method;

[0116] In the case that the third codeword does not fail to satisfy the verification relationship corresponding to the preset verification method, using the third codeword as the decoding information;

[0117] In the case that the third codeword does not satisfy the check relationship corresponding to the preset check method, a fourth codeword in the third codeword that satisfies the check relationship corresponding to the preset check method is decoded using a fourth check method to obtain decoding information corresponding to the received codeword.

[0118] The check relationship corresponding to the preset check method can be determined according to the actual situation, which is not limited here. As an example, the preset check method can be the check matrix H local，c The check relationship corresponding to the preset check method can be the check matrix H local，c The verification relationship.

[0119] In the case that the third codeword does not fail to satisfy the check relationship corresponding to the preset check method, it can be understood that all short frames are correctly decoded.

[0120] In the case where the third codeword does not satisfy the check relationship corresponding to the preset check method, it can be understood that all short frames are not correctly decoded.

[0121] The fourth codeword in the third codeword that satisfies the check relationship corresponding to the preset check method is decoded using the fourth check method to obtain the decoding information corresponding to the received codeword. It can be understood that the fourth codeword in the third codeword that satisfies the check relationship corresponding to the preset check method is decoded using global decoding to obtain the decoding information corresponding to the received codeword. For ease of understanding, an example is given here to determine the decoding result. Whether it conforms to the check matrix H local，c If all the short frames are correctly decoded, the third codeword is used as the decoding information; if all the short frames are not correctly decoded, the received soft quantity of the short frames that are correctly decoded is solidified according to the decoding result and the modulation mode, and the received codeword r is globally decoded using the replaced received information and the entire check matrix G, and an attempt is made to correct the error frames that cannot be corrected by local code decoding.

[0122] For any LDPC code of length n, let its transmitted codeword be w and its received codeword be Its check matrix is ​​H. When decoding, soft decision decoding (such as SPA decoding) is generally used, and its input is the log-likelihood ratio L corresponding to the codeword r r =[L r，j ], recorded as

[0123]

[0124] Assume that in step 3, the decoding result is The correctly decoded short frame is The corresponding codeword length is remember Before using H for overall decoding, the soft decision decoding input from the channel is set according to the short frame that has been successfully decoded, which is recorded as

[0125]

[0126] Then, L′ r，j As the input of soft decision decoding, the whole codeword r is decoded using the check matrix H.

[0127] In one embodiment, the method further comprises:

[0128] The decoded information is displayed to a user.

[0129] In this embodiment, displaying the decoding information to the user can be understood as displaying the decoding information to the user through a device; wherein the device can be determined according to actual conditions and is not limited here. As an example, the device can include an electronic device; the electronic device can be a terminal, a computer, etc. In actual applications, displaying the decoding information to the user can be understood as ending the decoding and outputting the decoding result.

[0130] For better understanding, the processing method of low-density parity check code is exemplified here, which is specifically a coding method of global coupled LDPC code integrating 5G. Assuming that a codeword of a GC-LDPC code contains c short frames, its codeword can be expressed as w=[v 1， v2, ..., v c , p]. Any segment v in the codeword i 1≤i≤c, all of which are codewords of LDPC code under 5G protocol, and their corresponding check matrix is ​​the local code H local，i The form of LDPC code under the 5G protocol is consistent with that of the LDPC code; p is the extra check bit added by global coupling. The check matrix corresponding to the codeword of the GC-LDPC code can satisfy the above formula (1).

[0131] Let H global =[H global，m , H global，p ], is the global code part that couples all local codes. global，m The corresponding codeword v=[v1,v2,...,v c ], i.e., the information bit of the input global code; H global，pis the check part of the global code, corresponding to p in the codeword. In this scheme, a single parity check method is used to construct H global . Assume that any short frame v i , the information bit length in 1≤i≤c is k i , the frame length is n i , the overall codeword length of the global coupling code is Take M global =max(k1, ..., k c ) is H global The number of rows. Let the matrix Then the element h i，j The value can be expressed as the above formula (2).

[0132] In practical applications, the unit matrix can be directly used to complete the coupling of information bits in all short frames. global，m =I, use SPC to generate the check digit of the global code part.

[0133] This application uses a global coupling code to construct a check matrix for the LDPC code, sets the local code to a 5G code, and uses a single parity check as the global code for coupling.

[0134] For ease of understanding, here is an example of a coding scheme for GC-LDPC code integrating 5G, including the following steps:

[0135] Step 1: Split the information sequence u to be encoded into [u1..., u c ], corresponding to the information bits sent by each short frame during transmission;

[0136] Step 2: For each information bit u in a short frame i , 1≤i≤c, using the corresponding local code check matrix H local，i Encode and get the codeword v sent by the short frame i ;

[0137] Step 3: Combine all the short frame transmission codewords to obtain v = [v1, ..., v c Then, using the global code check matrix H global Encode v again and finally get the transmission codeword w = [v1, v2, ..., v c , p].

[0138] For ease of understanding, here is an example of a decoding scheme for GC-LDPC code that integrates 5G. This content can be combined with Figure 2 To understand, Figure 2 This is a flowchart of a decoding method for a GC-LDPC code integrating 5G in an embodiment of the present application, comprising the following steps:

[0139] Step 1: Assume that the received codeword r=w+n is the superposition of the transmitted codeword and noise. Divide it into [r1, r2..., r c ,q], each part of which is a transmitted codeword [v1, v2, ..., v c , p] is the receiving result after the corresponding part is superimposed with noise.

[0140] Step 2: For each received short frame r i , 1≤i≤c, use the corresponding local code H local，c Decode and get the decoding result

[0141] Step 3: Determine the decoding result Whether it conforms to the check matrix H local，c If all short frames are decoded correctly, jump to step 6; otherwise, go to step 4.

[0142] Step 4: solidify the received soft data of the correctly decoded short frame according to the decoding result and modulation mode, and use the replaced received information and the entire check matrix H to globally decode the received codeword r, and try to correct the error frame that cannot be corrected by local code decoding.

[0143] For any LDPC code of length n, let its transmitted codeword be w and its received codeword be Its check matrix is ​​H. When decoding, soft decision decoding (such as SPA decoding) is generally used, and its input is the log-likelihood ratio L corresponding to the codeword r r =[L r，j ], please refer to the previous formula (3).

[0144] Assume that in step 3, the decoding result is The correctly decoded short frame is The corresponding codeword length is remember Therefore, before using H overall decoding, the soft decision decoding input from the channel is set according to the short frame that has been successfully decoded, which can refer to the previous formula (4).

[0145] Then, L′ r，j As the input of soft decision decoding, the whole codeword r is decoded using the check matrix H.

[0146] Step 5, end decoding and output the decoding result.

[0147] The embodiment of the present application uses 5G code as the local code to construct GC-LDPC code for application in a system that transmits in short frames. Compared with direct transmission, a decoding scheme for globally decoding multi-frame received data when channel conditions are poor is added, which can more efficiently utilize the information of the received codeword and improve the reliability and throughput of transmission; and using 5G code as the local code can improve the overall and local decoding performance.

[0148] For further understanding, a specific application embodiment is illustrated here.

[0149] Example 1: A 5G code with information bit number m of 528, expansion factor Z = 24, basic codeword length N of 768, and code rate r = 0.88 is used as the local code. In order to simulate the fluctuation of frame length when short frames are used for transmission in the actual transmission process, different local codes are punctured with check bits of different lengths, so that the local codes have codeword lengths randomly distributed between NZ and N+Z while the information bit length remains unchanged. After puncturing, the 12 local codes are coupled through SPC to form the check matrix H of the GC-LDPC code.

[0150] At the transmitting end, the GC-LDPC code is encoded according to the above encoding scheme. Then, according to the 5G standard, each short frame is punctured and the check bit is punctured, and modulated by BPSK.

[0151] At the receiving end, according to the above decoding scheme, the received codeword r = [r1, r2..., r c ,q] for two-step decoding. In the two-step decoding process, SPA decoding is used, and the maximum number of iterations is set to 30. The performance curves of 5G local code and global decoding are obtained by simulation. For the convenience of comparison, throughput is used as the comparison indicator between the two.

[0152] Example 2: The number of information bits m is 528, the expansion factor Z = 24, the codeword length N is 840, and the code rate The 5G code of 1G is used as the local code, and 10 local codes are coupled in the same way as in the above example to obtain the GC-LDPC code. The performance of the local code and the GC-LDPC code are then compared using the same modulation and decoding method.

[0153] Example 3: The number of information bits m is 352, the expansion factor Z = 16, the codeword length N is 1088, and the code rate The 5G code is used as the local code. In the same way as in the above example, the 7 local codes are coupled to obtain the GC-LDPC code. The performance of the local code and the GC-LDPC code are then compared using the same modulation and decoding method.

[0154] From the three sets of results, it can be seen that when the local code is a 5G short code, the GC-LDPC code described in this article can be coupled under a variety of different code rates to generate throughput gains under certain channel conditions. When the code rate is relatively high, the gain is more obvious, and the signal-to-noise ratio range of the gain is larger.

[0155] This content can be combined Figure 3 , Figure 4 , Figure 5 To understand, Figure 3 This is a schematic diagram for comparing the throughput of a GC-LDPC code under a high code rate in an embodiment of the present application; Figure 4 This is a schematic diagram for comparing the throughput of a GC-LDPC code under a code rate in an embodiment of the present application; Figure 5 This is a schematic diagram comparing the throughput of whether to use GC-LDPC code at a low code rate in an embodiment of the present application.

[0156] The embodiment of the present application uses a global coupling code to construct the check matrix of the LDPC code, sets the local code to the 5G code, and uses a single parity check as the global code and couples it. In this proposal, the receiving end can receive each short frame received according to the 5G standard, and at the same time, when the channel conditions are poor, globally decode the overall codeword composed of multiple frames of received data, thereby taking into account the reliability and complexity of the transmission. Simulation results show that under a variety of different code lengths and code rates, the use of global decoding can increase the reliability and throughput of transmission within a certain range.

[0157] Compared with the existing technology, the advantages of this application are mainly reflected in the following aspects:

[0158] First: This application uses 5G code as the local code to construct GC-LDPC code for application in systems with short frame transmission. Compared with direct transmission, it adds a decoding scheme for global decoding of multi-frame received data when channel conditions are poor, which can more efficiently utilize the information of the received codeword and improve the reliability and throughput of transmission.

[0159] Second: Compared with the traditional GC-LDPC code based on regular codes, the use of 5G code as the local code in this application can improve the overall and local decoding performance.

[0160] In order to implement the method of the embodiment of the present application, the embodiment of the present application further provides an LDPC processing device 600, which is arranged on an electronic device. Figure 6 Schematic diagram of a low-density parity-check code processing device according to an embodiment of the present application; Figure 6 As shown, including:

[0161] An acquisition unit 601 is used to acquire first information corresponding to each first frame in at least one first frame when information to be encoded is transmitted; the transmission frame length of the first frame is less than or equal to a first preset threshold;

[0162] A first encoding unit 602 is used to encode the first information using a first verification method to obtain a first codeword corresponding to each first frame; the first verification method represents a verification method corresponding to the LDPC under a preset communication protocol;

[0163] The second encoding unit 603 is used to encode the first codeword using a second verification method to obtain a transmission codeword corresponding to the information to be encoded; the second verification method represents the verification method corresponding to each first frame.

[0164] Here, in one embodiment, the acquisition unit 601 is further used to perform a first decomposition process on the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded; and determine the first information corresponding to each first frame based on the information sequence.

[0165] Here, in one embodiment, the second encoding unit 603 is further used to perform combination processing on the first codewords to obtain a combined second codeword; and encode the second codeword using a second check method to obtain the transmission codeword.

[0166] Here, in one embodiment, the second verification method includes bit information corresponding to the global code of each first frame and verification information corresponding to the global code; the device also includes a determination unit for determining the second verification method based on the bit information and the verification information.

[0167] Here, in one embodiment, the device further includes a generating unit; wherein,

[0168] The acquisition unit 601 is further configured to acquire attribute information corresponding to each first frame according to the bit information;

[0169] The determining unit is further configured to determine a parameter corresponding to the global code based on the attribute information;

[0170] The generating unit is used to generate the check information according to the parameter and a preset single parity check code SPC.

[0171] Here, in one embodiment, when the transmission codeword is a sending codeword, the device further includes a first decoding unit and a second decoding unit; wherein,

[0172] The acquisition unit 601 is further configured to acquire a received codeword corresponding to the sent codeword;

[0173] The determining unit is further used to determine, based on the received codeword, second information corresponding to each second frame in at least one second frame; the transmission frame length of the second frame is less than or equal to a second preset threshold;

[0174] The first decoding unit is used to decode the second information using a third verification method to obtain a third codeword corresponding to each second frame; the third verification method includes a codeword corresponding to the LDPC under the preset communication protocol;

[0175] The second decoding unit is used to decode the third codeword using a fourth verification method to obtain decoding information corresponding to the received codeword; the fourth verification method includes a verification method corresponding to the LDPC under a preset communication protocol and a verification method corresponding to each first frame.

[0176] Here, in one embodiment, the device also includes a judgment unit, which is used to judge whether the third code word has a check relationship that does not satisfy the preset check method; if the third code word does not have a check relationship that does not satisfy the preset check method, the third code word is used as the decoding information; if the third code word has a check relationship that does not satisfy the preset check method, a fourth code word in the third code word that satisfies the check relationship corresponding to the preset check method is decoded using a fourth check method to obtain the decoding information corresponding to the received code word.

[0177] Here, in one embodiment, the device further includes a display unit for displaying the decoded information to a user.

[0178] It should be noted that: the low-density parity-check code processing device provided in the above embodiment only uses the division of the above program modules as an example when processing the low-density parity-check code. In actual applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the device is divided into different program modules to complete all or part of the processing described above. In addition, the low-density parity-check code processing device provided in the above embodiment and the low-density parity-check code processing method embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0179] Based on the hardware implementation of the above-mentioned program module, an embodiment of the present application also provides an electronic device, including a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and when the processor executes the program, the steps in the low-density parity-check code processing method provided in the above-mentioned embodiment are implemented.

[0180] Correspondingly, an embodiment of the present application provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps in the method for processing a low-density parity-check code provided in the above embodiment are implemented.

[0181] It should be noted here that the description of the above storage medium and device embodiments is similar to the description of the above method embodiments, and has similar beneficial effects as the method embodiments. For technical details not disclosed in the storage medium and device embodiments of this application, please refer to the description of the method embodiments of this application for understanding.

[0182] It should be noted that Figure 7 is a schematic diagram of a hardware entity structure of an electronic device in an embodiment of the present application, such as Figure 7 As shown, the hardware entity of the electronic device 700 includes: a processor 701 and a memory 703 . Optionally, the electronic device 700 may also include a communication interface 702 .

[0183] It can be understood that the memory 703 can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), synchronous static random access memory (SSRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM, SyncLink Dynamic Random Access Memory), and direct RAM bus random access memory (DRRAM, Direct Rambus Random Access Memory).The memory 703 described in the embodiments of the present application is intended to include but is not limited to these and any other suitable types of memories.

[0184] The method disclosed in the above embodiment of the present application can be applied to the processor 701, or implemented by the processor 701. The processor 701 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor 701 or an instruction in the form of software. The above processor 701 may be a general-purpose processor, a digital signal processor (DSP, Digital Signal Processor), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The processor 701 can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. In combination with the steps of the method disclosed in the embodiment of the present application, it can be directly embodied as a hardware decoding processor to execute, or it can be executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, which is located in the memory 703, and the processor 701 reads the information in the memory 703 and completes the steps of the above method in combination with its hardware.

[0185] In an exemplary embodiment, the device may be implemented by one or more application specific integrated circuits (ASIC), DSP, programmable logic device (PLD), complex programmable logic device (CPLD), field programmable gate array (FPGA), general processor, controller, microcontroller (MCU), microprocessor, or other electronic components to execute the aforementioned method.

[0186] It should be understood that "one embodiment" or "an embodiment" mentioned throughout the specification means that specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, "in one embodiment" or "in an embodiment" appearing throughout the specification does not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It should be understood that in various embodiments of the present application, the size of the sequence number of the above-mentioned processes does not mean the order of execution, and the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application. The above-mentioned sequence numbers of the embodiments of the present application are only for description and do not represent the advantages and disadvantages of the embodiments.

[0187] It should be noted that, in this application, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0188] The methods disclosed in several method embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments.

[0189] The features disclosed in several product embodiments provided in this application can be arbitrarily combined without conflict to obtain new product embodiments.

[0190] The features disclosed in several method or device embodiments provided in this application can be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0191] The above is only an implementation method of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A method for processing a low-density parity-check code LDPC, characterized in that: include: Acquire first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted; The transmission frame length of the first frame is less than or equal to a first preset threshold; Encoding the first information by using a first verification method to obtain a first codeword corresponding to each first frame; The first verification method represents a verification method corresponding to the LDPC under a preset communication protocol; Encoding the first codeword using a second verification method to obtain a transmission codeword corresponding to the information to be encoded; The second verification mode represents a verification mode corresponding to each first frame.

2. The method according to claim 1, characterized in that The obtaining of first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted includes: Performing a first decomposition process on the information to be encoded to obtain at least two information sequences corresponding to the information to be encoded; The first information corresponding to each first frame is determined based on the information sequence.

3. The method according to claim 1, characterized in that The encoding of the first codeword by using a second verification method includes: Performing combination processing on the first codewords to obtain a combined second codeword; The second codeword is encoded using a second check method to obtain the transmission codeword.

4. The method according to claim 1, characterized in that: The second verification mode includes bit information corresponding to the global code of each first frame and verification information corresponding to the global code, and the method further includes: The second verification mode is determined based on the bit information and the verification information.

5. The method according to claim 4, characterized in that The method further comprises: Acquire attribute information corresponding to each first frame according to the bit information; Determine a parameter corresponding to the global code based on the attribute information; The check information is generated according to the parameter and a preset single parity check code SPC.

6. The method according to any one of claims 1 to 5, characterized in that: In the case where the transmission codeword is a sending codeword, the method further includes: Obtaining a received codeword corresponding to the sent codeword; Determine second information corresponding to each second frame in at least one second frame based on the received codeword; the transmission frame length of the second frame is less than or equal to a second preset threshold; Decoding the second information using a third verification method to obtain a third codeword corresponding to each second frame; the third verification method includes a codeword corresponding to the LDPC under the preset communication protocol; The third codeword is decoded using a fourth verification method to obtain decoding information corresponding to the received codeword; the fourth verification method includes a verification method corresponding to the LDPC under a preset communication protocol and a verification method corresponding to each first frame.

7. The method according to claim 6, characterized in that The determining, based on the received codeword, second information corresponding to each second frame in at least one second frame comprises: Performing a second decomposition process on the received codeword to obtain at least two information sequences corresponding to the received codeword; The second information corresponding to each second frame is determined based on the information sequence.

8. The method according to claim 6, characterized in that The method further comprises: Determine whether the third codeword has a verification relationship that does not satisfy a preset verification method; In the case that the third codeword does not fail to satisfy the verification relationship corresponding to the preset verification method, using the third codeword as the decoding information; In the case that the third codeword does not satisfy the check relationship corresponding to the preset check method, a fourth codeword in the third codeword that satisfies the check relationship corresponding to the preset check method is decoded using a fourth check method to obtain decoding information corresponding to the received codeword.

9. The method according to claim 6, characterized in that The method further comprises: The decoded information is displayed to a user.

10. A processing device for low-density parity-check code LDPC, characterized in that: include: An acquisition unit, used to acquire first information corresponding to each first frame in at least one first frame when the information to be encoded is transmitted; The transmission frame length of the first frame is less than or equal to a first preset threshold; A first encoding unit, configured to encode the first information by using a first verification method to obtain a first code word corresponding to each first frame; The first verification method represents a verification method corresponding to the LDPC under a preset communication protocol; The second encoding unit is used to encode the first code word using a second verification method to obtain a transmission code word corresponding to the information to be encoded; the second verification method represents the verification method corresponding to each first frame.

11. A low-density parity check code LDPC processing device, characterized in that: include: a first processor and a first memory for storing a computer program executable on the processor, Wherein, when the first processor is used to run the computer program, the steps of the method described in any one of claims 1 to 9 are executed.

12. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 9 are implemented.

Images