Construction method and electronic device of regular QC-LDPC code

By initializing the cyclic shift value matrix and assigning values ​​based on preset conditions, and searching for the long-range conditions with the dimension information of the cyclic permutation matrix, the problem of long-term search time in the QC-LDPC code construction is solved, and the code construction speed is improved.

CN112398482BActive Publication Date: 2024-12-06ZTE CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201910744688.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-08-13
Publication Date
2024-12-06
Estimated Expiration
2039-08-13

AI Technical Summary

Technical Problem

In the prior art, when constructing regular QC-LDPC codes, the search time of the cyclic shift value matrix is ​​longer, resulting in a slower code construction speed. Especially in the case of high code rate and long circumference, it is difficult to effectively reduce the search time.

Method used

By initializing the elements of the first row and the first column in the cyclic shift value matrix of the regular QC-LDPC code to 0, and obtaining the value that meets the preset conditions, assigning the value to the second row element, reducing the number of searches for elements to be assigned to the value , based on the dimension information of the cyclic permutation matrix, the value that satisfies the boundary condition is searched, and the check matrix is ​​constructed.

Benefits of technology

The search time of the cyclic shift value matrix is ​​significantly reduced, and the construction speed of regular QC-LDPC codes is improved, especially in the case of high code rate and large circumference, which greatly accelerates the code construction process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112398482B_ABST
    Figure CN112398482B_ABST
Patent Text Reader

Abstract

The embodiment of the present invention relates to the field of communications, and discloses a construction method and electronic device for a regular QC-LDPC code. The method includes: initializing each element in the first row and the first column of a cyclic shift value matrix to 0; obtaining K numerical values ​​that meet a preset condition; the preset condition includes that one numerical value is 0 and there is no repeated number in the set composed of the difference between any two numerical values; assigning K numerical values ​​to the K elements in the second row of the cyclic shift value matrix respectively; the first element in the second row is assigned to 0; searching for a value that meets the girth condition for each element to be assigned based on the dimension information of the cyclic permutation matrix; each element to be assigned refers to each element other than the first row, the second row, and the first column; constructing a check matrix of a regular QC-LDPC code based on the cyclic shift value matrix. The technical solution provided by the present application can reduce the search time of the cyclic shift value matrix, thereby improving the construction speed of the regular QC-LDPC code.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of communications, and in particular to a construction method and electronic device for a regular QC-LDPC code. Background Art

[0002] Quasi-cyclic low-density parity check (QC-LDPC) code is the most representative and widely studied and applied type of LDPC code. It is a combination of QC code and LDPC code, and has both the excellent error correction performance of LDPC code and the structured characteristics of QC code.

[0003] Among the many QC-LDPC code classes, the most common type is the QC-LDPC code based on the Circulant Permutation Matrice (CPM) form, whose check matrix H is in the form of Figure 1 As shown, each element I(s i,j ) represents an identity matrix or a cyclic shift matrix of the identity matrix, or an all-zero matrix; the element I(s i,j ) in the cyclic shift value s i,j Extracted to form the cyclic shift value matrix H s , thus the design of the large-size check matrix H can be transformed into a smaller-size cyclic shift value matrix H s The design matrix H s The form of Figure 2 QC-LDPC codes without all-zero submatrices in the check matrix are also called (J, K) regular QC-LDPC codes, where J and K refer to the column weight and row weight of the check matrix H, respectively, i.e., the cyclic shift value matrix H s The length of the shortest cycle in the Tanner graph corresponding to the check matrix of the QC-LDPC code is defined as the girth. In order to obtain good decoding performance, the girth of the constructed check matrix is ​​required to be as large as possible. Summary of the invention

[0004] The purpose of the embodiments of the present invention is to provide a construction method and electronic device for a regular QC-LDPC code, which can reduce the search time of a cyclic shift value matrix, thereby improving the construction speed of a regular QC-LDPC code.

[0005] To solve the above technical problems, an embodiment of the present invention provides a construction method of a regular QC-LDPC code, comprising: initializing each element of the first row and the first column in a cyclic shift value matrix of a regular QC-LDPC code to 0; obtaining K numerical values ​​that meet a preset condition; wherein the value of K is equal to the number of columns of the cyclic shift value matrix; the preset condition includes that one of the numerical values ​​is 0, and there is no repeated number in the set composed of the difference between any two of the numerical values; assigning the K numerical values ​​to the K elements of the second row in the cyclic shift value matrix respectively; wherein the first element of the second row is assigned to 0; searching for a value that meets the preset girth condition for each element to be assigned based on the dimension information of the cyclic permutation matrix of the regular QC-LDPC code to obtain the cyclic shift value matrix; wherein each element to be assigned refers to each element in the cyclic shift value matrix except the first row, the second row, and the first column; and constructing a check matrix of the regular QC-LDPC code based on the cyclic shift value matrix.

[0006] An embodiment of the present invention also provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method for constructing a regular QC-LDPC code.

[0007] An embodiment of the present invention further provides a computer-readable storage medium storing a computer program, wherein the computer program implements the construction method of the regular QC-LDPC code when executed by a processor.

[0008] Compared with the prior art, the embodiment of the present invention first initializes each element of the first row and the first column in the cyclic shift value matrix of the regular QC-LDPC code to 0; then obtains multiple values ​​that meet the preset conditions and assigns the multiple values ​​to each element of the second row in the cyclic shift value matrix, the preset conditions include that one of the values ​​is 0, and there is no repeated number in the set composed of the difference between any two values; in this case, it can be ensured that the first two rows of the matrix will not have a certain length of loop, so as to first determine the value of each element in the second row. Then, the value of each element to be assigned is searched based on the dimension information of the cyclic permutation matrix, wherein each element to be assigned refers to each element in the cyclic shift value matrix except the first row, the second row, and the first column. That is, the element to be assigned that needs to be assigned by searching starts from the second element of the third row instead of starting from the second row. Compared with the prior art, the number of elements to be assigned that need to be searched for assignment is reduced, thereby reducing the search time of the cyclic shift value matrix and improving the construction speed of the regular QC-LDPC code. Especially in the case of high code rate and large girth, the search time can be greatly reduced, thereby greatly improving the construction speed of regular QC-LDPC codes.

[0009] In addition, the obtaining of K values ​​that meet the preset condition includes: determining a difference set according to the number of columns, and selecting K difference set elements from the difference set; determining a minimum value among the K difference set elements, and subtracting the minimum value from each of the K difference set elements to obtain the K values. This embodiment provides a specific method for quickly finding K values ​​that meet the condition.

[0010] In addition, the obtaining of K values ​​that meet the preset condition includes: selecting K consecutively arranged sequence elements from the Lucas sequence; determining the minimum value of the K sequence elements, and subtracting the minimum value from the K sequence elements to obtain the K values. This embodiment provides another specific method for quickly finding K values ​​that meet the condition.

[0011] In addition, the girth condition includes: the girth of the check matrix is ​​8, or 10, or 12. This embodiment is applied to the construction of a regular QC-LDPC code with a check matrix having a large girth.

[0012] In addition, the dimension information includes an initial value and a step size of the dimension; the dimension information of the cyclic permutation matrix based on the regular QC-LDPC code searches for a value that satisfies a preset girth condition for each element to be assigned, including: determining multiple candidate values ​​according to the dimension; performing girth detection on each element to be assigned according to the multiple candidate values, and judging whether there is an alternative value that makes each element to be assigned meet the girth condition under the dimension; if there is an alternative value that makes each element to be assigned meet the girth condition, obtaining the cyclic shift value matrix after all elements are assigned; if there is no alternative value that makes each element to be assigned meet the girth condition, updating the dimension using the step size, and repeating the step of searching for a value that satisfies the preset girth condition for each element to be assigned in the cyclic shift value matrix based on the dimension information of the cyclic permutation matrix based on the regular QC-LDPC code. This embodiment provides a specific search method for searching using dimensional information.

[0013] In addition, in the girth detection of each of the elements to be assigned according to the multiple candidate values, for each of the candidate values, when it is determined that the candidate value does not exist in the cyclic shift value matrix, the candidate value is assigned to the element to be assigned and the girth detection is performed. In this embodiment, by determining whether the candidate value already exists in the cyclic shift value matrix, the candidate value that will inevitably lead to detection failure can be eliminated first, thereby reducing the number of searches and further improving the search speed.

[0014] In addition, the girth detection is performed on each of the elements to be assigned based on the multiple alternative values ​​to determine whether there is an alternative value that makes each of the elements to be assigned meet the girth condition under the dimension, including: for each of the elements to be assigned, the alternative value that meets the girth condition is added to the optional value set of the element to be assigned; and the assignment step is entered; the assignment step includes, if the optional value set of the element to be assigned is not an empty set, selecting an optional value from the optional value set and assigning it to the element to be assigned; if all the elements to be assigned are assigned, determining whether there is an alternative value that makes each of the elements to be assigned meet the girth condition under the dimension. Condition; if the optional value set of the element to be assigned is an empty set and the element to be assigned is not the first element to be assigned, the current value of the previous element to be assigned of the element to be assigned is removed from the optional value set of the previous element to be assigned, and the assignment step is performed on the previous element to be assigned; if the optional value set of the element to be assigned is an empty set and the element to be assigned is the first element to be assigned, it is determined that there is no alternative value under the dimension that makes each element to be assigned satisfy the girth condition; wherein, the value satisfying the girth condition is searched for each element to be assigned in order from left to right and from top to bottom. This embodiment provides a specific search method for each element to be assigned.

[0015] In addition, the construction of the check matrix of the regular QC-LDPC code based on the cyclic shift value matrix is ​​specifically to construct the check matrix of the regular QC-LDPC code according to the cyclic shift value matrix and the dimension based on which the values ​​of each element to be assigned that satisfies the peri-production condition are searched. This embodiment provides a specific method for constructing a check matrix. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] One or more embodiments are exemplarily described by pictures in the corresponding drawings, and these exemplified descriptions do not constitute limitations on the embodiments. Elements with the same reference numerals in the drawings represent similar elements, and unless otherwise stated, the figures in the drawings do not constitute proportional limitations.

[0017] Figure 1 It is the check matrix expression of QC-LDPC code based on "circular permutation matrix";

[0018] Figure 2 It is the cyclic shift value matrix expression of QC-LDPC code based on "cyclic permutation matrix";

[0019] Figure 3 is a flow chart of a method for constructing a regular QC-LDPC code according to a first embodiment of the present invention;

[0020] Figure 4 is a specific flow chart of step 104 according to the first embodiment of the present invention;

[0021] Figure 5 is a flow chart of a method for constructing a regular QC-LDPC code according to a second embodiment of the present invention;

[0022] Figure 6 is a flowchart of a method for constructing a regular QC-LDPC code according to a third embodiment of the present invention;

[0023] Figure 7 is a block diagram of an electronic device according to a fourth embodiment of the present invention. DETAILED DESCRIPTION

[0024] To make the purpose, technical scheme and advantages of the embodiments of the present invention clearer, the embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings. However, it will be appreciated by those skilled in the art that in the embodiments of the present invention, many technical details are proposed in order to enable the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical scheme claimed in the present application can be implemented. The division of the following embodiments is for the convenience of description, and should not constitute any limitation on the specific implementation of the present invention. The various embodiments can be combined and referenced with each other without contradiction.

[0025] The first embodiment of the present invention relates to a method for constructing a regular QC-LDPC code. The specific process is as follows Figure 3 shown.

[0026] Step 101: Initialize each element in the first row and the first column of the cyclic shift value matrix of the regular QC-LDPC code to 0.

[0027] Step 102, obtaining K values ​​that meet preset conditions; wherein the value of K is equal to the number of columns of the cyclic shift value matrix; the preset conditions include that one of the values ​​is 0, and there is no repeated number in the set consisting of the difference between any two values.

[0028] Step 103: assign K numerical values ​​to the K elements in the second row of the cyclic shift value matrix respectively; wherein the first element in the second row is assigned a value of 0.

[0029] Step 104, based on the dimension information of the circulant permutation matrix of the regular QC-LDPC code, searching for values ​​satisfying the girth condition for each element to be assigned a value, so as to obtain a circulant shift value matrix; wherein each element to be assigned a value refers to each element in the circulant shift value matrix except the first row, the second row, and the first column.

[0030] Step 105: construct a check matrix of a regular QC-LDPC code based on the cyclic shift value matrix.

[0031] The implementation details of the regular QC-LDPC code method of this implementation are specifically described below. The following content is only the implementation details provided for ease of understanding and is not necessary for implementing this solution.

[0032] The construction of a regular QC-LDPC code is to construct a check matrix of a regular QC-LDPC code; usually, the value of each element in the cyclic shift value matrix is ​​determined based on a given number of rows, number of columns, and girth, so as to construct a check matrix according to the cyclic shift value matrix. In this embodiment and the following embodiments, the letters J, K, and G represent the number of rows, number of columns, and girth, respectively; that is, this embodiment provides a construction method of a (J, K) regular QC-LDPC code with a girth of G.

[0033] The present embodiment does not impose any restrictions on the specific values ​​of the preset number of rows J, number of columns K, and girth G. In one example, the preset girth may be 8, 10, or 12; that is, the present embodiment may be used to search for (J, K) regular QC-LDPC codes with large girth.

[0034] In step 101, a cyclic shift value matrix H with J rows and K columns is created according to the given number of rows J and the number of columns K. s , and the cyclic shift value matrix H s Initialize each element in. During initialization, the cyclic shift value matrix H s All elements in the first row and the first column are assigned a value of 0, and the remaining elements can be assigned a value of the system default to be assigned. For example, if the system defaults to -1 to indicate to be assigned, then the remaining elements can be assigned a value of -1.

[0035] In step 102 and step 103, K values ​​satisfying the preset conditions are obtained, and the K values ​​correspond to the cyclic shift value matrix H s The K elements in the second row must meet the preset conditions, that is, one of the values ​​must be 0 and there must be no duplicate numbers in the set consisting of the difference between any two values.

[0036] For example, K = 4, and the K values ​​are a1, a2, a3, and a4, where the difference between a1 and a2 is b12, the difference between a1 and a3 is b13, the difference between a1 and a4 is b14, the difference between a2 and a3 is b23, the difference between a2 and a4 is b24, and the difference between a3 and a4 is b34. Then there is no repeated number in the set {b12, b13, b14, b23, b24, b34}, that is, b12, b13, b14, b23, b24, and b34 are not equal. Moreover, one of a1, a2, a3, and a4 is 0; when assigning values ​​to the elements in the second row, assign 0 to the first element in the second row, and the remaining three to the other three elements in the second row.

[0037] Among them, 0 can be placed at the first place among the K values, or the K values ​​can be arranged in order from small to large; at this time, when assigning values ​​to each element in the second row, each element in the second row can be assigned values ​​in the order of the arrangement of the K values.

[0038] In an example, Figure 4 As shown, step 104 includes the following sub-steps:

[0039] Sub-step 1041, determining multiple candidate values ​​according to the dimension.

[0040] Sub-step 1042, performing girth detection on each element to be assigned based on multiple candidate values, and determining whether there is a candidate value under the dimension that makes each element to be assigned meet the girth condition; if so, proceed to sub-step 1043; if not, proceed to sub-step 1044;

[0041] Sub-step 1043, obtaining a cyclic shift value matrix after all elements have been assigned values.

[0042] Sub-step 1044, update the dimension using the step size; and repeat step 104.

[0043] In this embodiment, the dimension information includes an initial value and a step size of the dimension, wherein the initial value of the dimension is an integer greater than 1. In this embodiment, the letters P and Step represent the dimension and the step size, respectively. When step 104 is first executed, the initial value of the dimension is used to determine multiple candidate values.

[0044] In sub-step 1041, multiple alternative values ​​are determined according to the dimension P, and the multiple alternative values ​​are arranged in sequence and are: 1, 2, ..., P-1; that is, an alternative value set PM can be determined according to the dimension P, and the alternative value set includes multiple alternative values ​​arranged from small to large, which can be expressed as PM = {1, 2, 3, ..., p-1}.

[0045] In sub-step 1042, when the girth of each element to be assigned is checked in turn according to multiple alternative values, the girth of each element to be assigned can be checked in order from left to right and from top to bottom; that is, the checking order is the 2nd element in the third row, the 3rd element in the third row, ..., the Kth element in the third row; the 2nd element in the fourth row, the 3rd element in the fourth row, ..., the Kth element in the fourth row; ...; the 2nd element in the Jth row, the 3rd element in the Jth row, ..., the Kth element in the Jth row.

[0046] Among them, sub-step 1042 can be implemented in the following specific manner.

[0047] In step a, in the girth detection for each element to be assigned, each candidate value is sequentially taken from the candidate value set PM; and for each candidate value, only when it is determined that the candidate value does not exist in the cyclic shift value matrix, the candidate value is assigned to the element to be assigned and the girth detection is performed. That is, for each candidate value, it is determined whether the candidate value exists in the cyclic shift value matrix; if the candidate value does not exist in the cyclic shift value matrix, the candidate value is assigned to the element to be assigned and the girth detection is performed; if the candidate value already exists in the cyclic shift value matrix, the candidate value will not be assigned to the element to be assigned for girth detection.

[0048] Among them, whether the alternative value exists in the cyclic shift value matrix refers to whether the alternative value is the same as the value of any element in the cyclic shift value matrix. If the alternative value is the same as the value of one of the elements, it means that the alternative value already exists in the cyclic shift value matrix; if the alternative value is not the same as the value of any element, it means that the alternative value does not exist in the cyclic shift value matrix.

[0049] If the candidate value already exists in the cyclic shift value matrix, then using the candidate value to perform girth detection on the element to be assigned will definitely fail to meet the girth condition; therefore, in this example, by determining whether the candidate value already exists in the cyclic shift value matrix, the candidate value that will inevitably lead to detection failure can be eliminated first, thereby reducing the number of searches and further improving the search speed. It should be noted that in other examples, in sub-step 1042, multiple candidate values ​​can also be assigned to the element to be assigned in sequence and girth detection can be performed.

[0050] The girth detection in this embodiment means that when the element to be assigned is assigned the candidate value, it is determined whether the girth of the check matrix at this time is greater than or equal to the preset girth G; if it is, it means that the candidate value can make the element to be assigned meet the girth condition, that is, the candidate value is an optional value of the element to be assigned; if it is not (that is, there is a ring smaller than the girth G in the check matrix at this time), then it means that the candidate value is not an optional value of the element to be assigned. Among them, all rings of various lengths less than G can be searched. For example, if G is 10, all rings of lengths 4, 6, and 8 are searched to determine whether they exist; this can ensure that no ring smaller than G appears, that is, the girth is greater than or equal to G.

[0051] Among the multiple candidate values, there may be several candidate values ​​that can make the element to be assigned meet the girth condition, and one of the candidate values ​​that make the element to be assigned meet the girth condition can be selected and assigned to the element to be assigned. In this embodiment, an optional value set Cand_S is created in advance for the element to be assigned. i,j , where S i,j Represents the element to be assigned, 2≦i≦J-1, 1≦j≦K-1, i and j are both integers; add the alternative values ​​that meet the girth condition to the optional value set Cand_S corresponding to the element to be assigned i,j ; Until all candidate values ​​have completed the girth test of the element to be assigned.

[0052] Then, enter the assignment step, which includes the following sub-steps b and c.

[0053] Step b, determine Cand_S i,j Is it an empty set? If Cand_S i,j is not an empty set, then from Cand_Si,j Select any optional value from the list and assign it to the element S to be assigned. i,j Then, the assigned element S is treated according to the above multiple alternative values i,j The next element to be assigned is subjected to girth detection until all elements to be assigned are detected. If all elements to be assigned are assigned, it is determined that there are candidate values ​​under the dimension that make each element to be assigned meet the girth condition, and the process proceeds to sub-step 1043.

[0054] Step c, if Cand_S i,j is an empty set, indicating that S i,j The current assignment of the previous element affects S i,j Optional value selection, at this time, to return to S i,j The previous element of i,j The current value of the previous element from S i,j Remove the optional value set of the previous element and set S i,j The previous element of is used as the element to be assigned again, and the assignment step is repeated, that is, return to step b. i,j is the second element in the third row, then S i,j If there is no previous element, it is determined that there is no candidate value under the dimension that satisfies the girth condition for each element to be assigned, and the process proceeds to sub-step 1044, where the dimension is added to the step length as a new dimension to update the dimension. After the dimension is updated, the process returns to step 104.

[0055] That is, if there is no candidate value that satisfies the girth condition for each element to be assigned under the current dimension, then after updating the dimension, step 104 is repeated to search under the updated dimension. As long as the candidate value that satisfies the girth condition for each element to be assigned has not been searched, step 104 will be repeatedly executed until the value that satisfies the girth condition for each element to be assigned is searched; thereby, the cyclic shift value matrix of the regular QC-LDPC code after each element to be assigned is obtained; at the same time, the dimension of the cyclic permutation matrix can be obtained, that is, the cyclic shift value matrix searched under the dimension.

[0056] In step 105, based on the searched cyclic shift value matrix and in combination with the dimension of the cyclic permutation matrix, that is, the dimension of the cyclic permutation matrix on which the cyclic shift value matrix is ​​based is searched, a check matrix of a (J, K) regular QC-LDPC code with a girth of G is constructed, that is, a (J, K) regular QC-LDPC code with a girth of G is constructed.

[0057] In this embodiment, when the obtained K values ​​meet the preset condition, and after the K values ​​are used to assign values ​​to the elements of the second row, it can be ensured that the first row and the second row will not generate rings of length 4 and 8; wherein, a ring of length 6 may only appear in the third row, so when assigning values ​​to the elements of the second row, it is not necessary to consider a ring of length 6. In the search for each element to be assigned, it is possible to avoid the value that causes the check matrix to have a ring of length less than the girth G (that is, if the girth G is greater than 6, the ring of length 6 can be avoided).

[0058] Compared with the prior art, in this embodiment, each element of the first row and the first column in the cyclic shift value matrix of the regular QC-LDPC code is first initialized to 0; then multiple values ​​that meet the preset conditions are obtained and the multiple values ​​are respectively assigned to each element of the second row in the cyclic shift value matrix, and the preset conditions include that one of the values ​​is 0, and there is no repeated number in the set composed of the difference between any two values; in this case, it can be ensured that the first two rows of the matrix will not have a certain length of loop, so as to first determine the value of each element in the second row. Then, the value of each element to be assigned is searched based on the dimension information of the cyclic permutation matrix, wherein each element to be assigned refers to each element in the cyclic shift value matrix except the first row, the second row, and the first column. That is, the element to be assigned that needs to be assigned by searching starts from the second element of the third row instead of starting from the second row. Compared with the prior art, the number of elements to be assigned that need to be searched for assignment is reduced, thereby reducing the search time of the cyclic shift value matrix and improving the construction speed of the regular QC-LDPC code. Especially in the case of high code rate and large girth, the search time can be greatly reduced, thereby greatly improving the construction speed of regular QC-LDPC codes.

[0059] Especially in the case of high code rate and large girth, when the column weight is fixed, as the code rate increases, the size of the check matrix will also increase accordingly, so it is necessary to search for more cyclic shift values ​​that meet the girth condition; and when the code rate is fixed, as the girth increases, the girth condition that needs to be met will become more and more stringent, and the search for each cyclic shift value will be more complicated. Therefore, for the case of high code rate and large girth, the present application can greatly reduce the search time.

[0060] The following is a practical example of constructing a (J, K) regular QC-LDPC code with a girth of G according to the method of this embodiment. It should be noted that the division of each step in the following practical example is just a different way of describing it clearly. When implementing, it can be combined into one step or some steps can be split and decomposed into multiple steps. Figure 3 , Figure 4 The steps in include the same logical relationship.

[0061] Example 1: construct a (3, 6) regular QC-LDPC code with a girth of 8.

[0062] Step 1: Based on the input parameters, we know that J is 3, K is 6, and the girth is 8. Create a 3*6 cyclic shift value matrix H. s , and initialize it, the initialized H s As shown below.

[0063]

[0064] Step 2: Based on the number of columns K being 6, select multiple values ​​{1, 5, 11, 24, 25, 27} from the (31, 6, 1) difference set, subtract the minimum value "1" from these 6 values, and use the obtained {0, 4, 10, 23, 24, 26} as the elements of the second row of the cyclic shift value matrix. At this time, H s As shown below.

[0065]

[0066] It should be noted that the 6 values ​​selected from the (31, 6, 1) difference set are not unique, and any 6 values ​​can be selected from the (31, 6, 1) difference set; the above is just an example.

[0067] Step 3: The initial value of the dimension P of the circulant permutation matrix is ​​27, and the step length Step is 1. s The third row of elements is traversed and searched as follows.

[0068] Step 3.1: According to the cyclic shift value matrix H s For the second row of elements in , the used markers Choose_0, Choose_4, Choose_10, Choose_23, Choose_24, and Choose_26 of the adopted values ​​0, 4, 10, 23, 24, and 26 are all set to true, and those that are not adopted are set to false. The initial value of the search position i is set to 1, and the search return marker Return_i is set to false.

[0069] Step 3.2: From the second element S in the third row 2,i=1 Start by determining the optional values ​​that satisfy the girth condition for each element from left to right, and put these values ​​into the optional value set Cand_S 2,i , until i equals 6. The specific working process includes:

[0070] Step 3.2.1, starting from i=1, first determine whether the search return flag Return_i is true. If it is false, it means that the element S can be searched. 2,iSearch for optional values ​​and jump to step 3.2.2; if it is true, it means that no optional value that meets the girth condition can be found in this element, and it is necessary to return to the previous element S 2,i-1 Reassign the search value and jump to step 3.2.4.

[0071] Step 3.2.2: The initial value of the dimension P is 27, so the set {1, 2, 3, ..., 26} is determined based on the dimension; the values ​​in the set {1, 2, 3, ..., 26} are assigned to j one by one. If j is already in the matrix H s If Choose_j is true, then skip this value and proceed directly to the next value. If Choose_j is false, assign j to S 2,i , and perform girth detection. If the girth length in the cyclic shift value matrix is ​​not less than the specified girth size 8, that is, Judge_cycle is true, it means that j is an optional value, and the value is placed in the optional value set Cand_S 2,i Then the next value is detected; if a ring smaller than 8 appears in the matrix, it means that the value j is not selectable, and the next value is detected directly. After traversing all elements in the set {1, 2, 3, ..., 26}, go to step 3.2.3.

[0072] Step 3.2.3: Determine the current optional value set Cand_S 2,i Is it an empty set? If not, size(Cand_S 2,i ) is not equal to 0, then from the set Cand_S 2,i Randomly select a number and assign it to S 2,i , mark the used value Choose_S 2,i Set to true, i increments by 1, and then jumps to step 3.2.1 to proceed to the next element S 2,i+1 Optional value to search for. If Cand_S 2,i is an empty set, that is, size(Cand_S 2,i )=0, indicating the previous element S 2,i-1 The existing assignment affects S 2,i The optional value selection specifies that the search return mark Return_i is true, i is decremented by 1, and jumps to step 3.2.1.

[0073] Step 3.2.4: S 2,i Used value flag Choose_S 2,i Set to false, and then determine the optional value set Cand_S 2,i Is it an empty set? If not, size(Cand_S 2,i) is not equal to 0, then from the set Cand_S 2,i Randomly select a number and assign it to S 2,i , mark the used value Choose_S 2,i Set to true, i increments by 1, and then jumps to step 3.2.1 to perform S 2,i+1 Optional value to search for. If Cand_S 2,i is an empty set, that is, size(Cand_S 2,i )=0, determine whether the value of i is 1 at this time: if it is, it means that no cyclic shift value matrix that meets the conditions can be found under the current value of p, add the current value of p to the step length Step and reassign it to p, then jump to step 3.1 to restart the search; if not, it means that the previous element S 2,i-2 The value of S 2,i-1 and S 2,i , set the search return flag Return_i to false, Return_(i-1) to true, decrement i by 1, and then jump to step 3.2.1.

[0074] Step 3.3: When the cyclic shift value matrix H s When the values ​​of all elements in the third row are determined, it means that a suitable cyclic shift value matrix has been found, and the traversal search can be directly exited.

[0075] Step 4: traverse the searched circular shift value matrix H s , the current value of p is output, and the cyclic shift value matrix H s The format is as follows.

[0076]

[0077] The value of P is 27.

[0078] Step 5: According to the cyclic shift value matrix H s The values ​​of and P are used to obtain the check matrix.

[0079] Example 2: construct a (3, 8) regular QC-LDPC code with a girth of 10.

[0080] Step 1: Based on the input parameters, we know that J is 3, K is 8, and the girth is 10. Create a 3*8 cyclic shift value matrix H. s , and initialize it, the initialized H s As shown below.

[0081]

[0082] Step 2: Based on the number of columns K being 8, select multiple values ​​{1, 6, 7, 9, 19, 38, 42, 49} from the (57, 8, 1) difference set, subtract the minimum value "1" from these 8 values, and use the obtained {0, 5, 6, 8, 18, 37, 41, 48} as the elements of the second row of the cyclic shift value matrix. At this time, H s As shown below.

[0083]

[0084] It should be noted that the 8 values ​​selected from the difference set (57, 8, 1) are not unique, and any 8 values ​​can be selected from the difference set (57, 8, 1); the above is just an example.

[0085] Step 3: The initial value of the dimension P of the circulant permutation matrix is ​​49, and the step length Step is 1. s The third row of elements is traversed and searched as follows.

[0086] Step 3.1: According to the cyclic shift value matrix H s For the second row of elements in , the used markers Choose_0, Choose_5, Choose_6, Choose_8, Choose_18, Choose_37, Choose_41, and Choose_48 of the adopted values ​​0, 5, 6, 8, 18, 37, 41, and 48 are all set to true, and those not adopted are set to false. The initial value of the search position i is set to 1, and the search return marker Return_i is set to false.

[0087] Step 3.2: From the second element S in the third row 2,i=1 Start by determining the optional values ​​that satisfy the girth condition for each element from left to right, and put these values ​​into the optional value set Cand_S 2,i , until i equals 8. The specific working process includes:

[0088] Step 3.2.1, starting from i=1, first determine whether the search return flag Return_i is true. If it is false, it means that the element S can be searched. 2,i Search for optional values ​​and jump to step 3.2.2; if it is true, it means that no optional value that meets the girth condition can be found in this element, and it is necessary to return to the previous element S 2,i-1 Reassign the search value and jump to step 3.2.4.

[0089] Step 3.2.2: The initial value of the dimension P is 49. Therefore, the set {1, 2, 3, ..., 48} is determined according to the dimension. The elements in the set {1, 2, 3, ..., 48} are assigned to j one by one. If j is already in the matrix H s If Choose_j is true, then skip this value and proceed directly to the next value. If Choose_j is false, assign j to S 2,i , and perform girth detection. If the girth length in the cyclic shift value matrix is ​​not less than the specified girth size 10, that is, Judge_cycle is true, it means that j is an optional value, and the value is placed in the optional value set Cand_S 2,i Then the next value is detected; if a ring smaller than 10 appears in the matrix, it means that the value j is not selectable, and the next value is detected directly. After traversing all elements in the set {1, 2, 3, ..., 48}, go to step 3.2.3.

[0090] Step 3.2.3: Determine the current optional value set Cand_S 2,i Is it an empty set? If not, size(Cand_S 2,i ) is not equal to 0, then from the set Cand_S 2,i Randomly select a number and assign it to S 2,i , mark the used value Choose_S 2,i Set to true, i increments by 1, and then jumps to step 3.2.1 to proceed to the next element S 2,i+1 Optional value to search for. If Cand_S 2,i is an empty set, that is, size(Cand_S 2,i )=0, indicating the previous element S 2,i-1 The existing assignment affects S 2,i The optional value selection specifies that the search return mark Return_i is true, i is decremented by 1, and jumps to step 3.2.1.

[0091] Step 3.2.4: S 2,i Used value flag Choose_S 2,i Set to false, and then determine the optional value set Cand_S 2,i Is it an empty set? If not, size(Cand_S 2,i ) is not equal to 0, then from the set Cand_S 2,i Randomly select a number and assign it to S 2,i , mark the used value Choose_S 2,i Set to true, i increments by 1, and then jumps to step 3.2.1 to perform S 2,i+1Optional value to search for. If Cand_S 2,i is an empty set, that is, size(Cand_S 2,i )=0, determine whether the value of i is 1 at this time: if it is, it means that no cyclic shift value matrix that meets the conditions can be found under the current value of p, add the current value of p plus the step length step and reassign it to p, then jump to step 3.1 to restart the search; if not, it means that the previous element S 2,i-2 The value of S 2,i-1 and S 2,i , set the search return flag Return_i to false, Return_(i-1) to true, decrement i by 1, and then jump to step 3.2.1.

[0092] Step 3.3: When the cyclic shift value matrix H s When the values ​​of all elements in the third row are determined, it means that a suitable cyclic shift value matrix has been found, and the traversal search can be directly exited.

[0093] Step 4: traverse the searched circular shift value matrix H s , the current value of p is output, and the cyclic shift value matrix H s The format is as follows.

[0094]

[0095] The value of P is 299.

[0096] Step 5: According to the cyclic shift value matrix H s The values ​​of and P are used to obtain the check matrix.

[0097] Example 3: construct a (3, 12) regular QC-LDPC code with a girth of 12.

[0098] Step 1: Based on the input parameters, we know that J is 3, K is 12, and the girth is 12. Create a 3*12 cyclic shift value matrix H. s , and initialize it, the initialized H s As shown below.

[0099]

[0100] Step 2: According to the number of columns K being 12, select multiple values ​​{1, 11, 16, 40, 41, 43, 52, 60, 74, 78, 121, 128} from the difference set (133, 12, 1), subtract the minimum value "1" from these 12 values, and use the obtained {0, 10, 15, 39, 40, 42, 51, 59, 73, 77, 120, 127} as the elements of the second row of the cyclic shift value matrix. At this time, H sAs shown below.

[0101]

[0102] It should be noted that the 12 values ​​selected from the difference set (133, 12, 1) are not unique, and any 12 values ​​can be selected from the difference set (133, 12, 1); the above is just an example.

[0103] Step 3: The initial value of the dimension P of the circulant permutation matrix is ​​128, and the step length Step is 1. s The third row of elements is traversed and searched as follows.

[0104] Step 3.1: According to the cyclic shift value matrix H s For the second row of elements in , the used markers Choose_0, Choose_10, Choose_15, Choose_39, Choose_40, Choose_42, Choose_51, Choose_59, Choose_73, Choose_77, Choose_120, and Choose_127 of the adopted values ​​0, 10, 15, 39, 40, 42, 51, 59, 73, 77, 120, and 127 are all set to true, those not adopted are set to false, the initial value of the search position i is set to 1, and the search return marker Return_i is set to false.

[0105] Step 3.2: From the second element S in the third row 2,i=1 Start by determining the optional values ​​that satisfy the girth condition for each element from left to right, and put these values ​​into the optional value set Cand_S 2,i , until i equals 12. The specific working process includes:

[0106] Step 3.2.1, starting from i=1, first determine whether the search return flag Return_i is true. If it is false, it means that the element S can be searched. 2,i Search for optional values ​​and jump to step 3.2.2; if it is true, it means that no optional value that meets the girth condition can be found in this element, and it is necessary to return to the previous element S 2,i-1 Reassign the search value and jump to step 3.2.4.

[0107] Step 3.2.2: The initial value of the dimension P is 128. Therefore, the set {1, 2, 3, ..., 127} is determined according to the dimension. The elements in the set {1, 2, 3, ..., 127} are assigned to j one by one. If j is already in the matrix H sIf Choose_j is true, then skip this value and proceed directly to the next value. If Choose_j is false, assign j to S 2,i , and perform girth detection. If the girth length in the cyclic shift value matrix is ​​not less than the specified girth size 12, that is, Judge_cycle is true, it means that j is an optional value, and the value is placed in the optional value set Cand_S 2,i Then the next value is detected; if a ring smaller than 12 appears in the matrix, it means that the value j is not selectable, and the next value is detected directly. After traversing all elements in the set {1, 2, 3, ..., 127}, go to step 3.2.3.

[0108] Step 3.2.3: Determine the current optional value set Cand_S 2,i Is it an empty set? If not, size(Cand_S 2,i ) is not equal to 0, then from the set Cand_S 2,i Randomly select a number and assign it to S 2,i , mark the used value Choose_S 2,i Set to true, i increments by 1, and then jumps to step 3.2.1 to proceed to the next position S 2,i+1 Optional value to search for. If Cand_S 2,i is an empty set, that is, size(Cand_S 2,i )=0, indicating the previous element S 2,i-1 The existing assignment affects S 2,i The optional value selection specifies that the search return mark Return_i is true, i is decremented by 1, and jumps to step 3.2.1.

[0109] Step 3.2.4: S 2,i Used value flag Choose_S 2,i Set to false, and then determine the optional value set Cand_S 2,i Is it an empty set? If not, size(Cand_S 2,i ) is not equal to 0, then from the set Cand_S 2,i Randomly select a number and assign it to S 2,i , mark the used value Choose_S 2,i Set to true, i increments by 1, and then jumps to step 3.2.1 to perform S 2,i+1 Optional value to search for. If Cand_S 2,i is an empty set, that is, size(Cand_S 2,i)=0, determine whether the value of i is 1 at this time: if it is, it means that no cyclic shift value matrix that meets the conditions can be found under the current value of p, add the current value of p plus the step length step and reassign it to p, then jump to step 3.1 to restart the search; if not, it means that the previous element S 2,i-2 The value of S 2,i-1 and S 2,i , set the search return flag Return_i to false, Return_(i-1) to true, decrement i by 1, and then jump to step 3.2.1.

[0110] Step 3.3: When the matrix H s When the values ​​of all elements in the third row are determined, it means that a suitable cyclic shift value matrix has been found, and the traversal search can be directly exited.

[0111] Step 4: traverse the searched circular shift value matrix H s , the current value of p is output, the matrix H s The format is as follows.

[0112]

[0113] The value of P is 5220.

[0114] Step 5: According to the cyclic shift value matrix H s The values ​​of and P are used to obtain the check matrix.

[0115] The second embodiment of the present invention relates to a method for constructing a regular QC-LDPC code. The second embodiment is substantially the same as the first embodiment, with the main difference being that in the second embodiment of the present invention, a specific method for quickly finding a value that satisfies a condition is provided.

[0116] like Figure 5 FIG. 4 is a flow chart of a method for constructing a regular QC-LDPC code in the second embodiment;

[0117] Step 201, initializing each element of the first row and the first column in the cyclic shift value matrix of the regular QC-LDPC code to 0. Step 201 is substantially the same as step 101, and will not be described in detail here.

[0118] Step 202, obtaining K values ​​that meet preset conditions; wherein the value of K is equal to the number of columns of the cyclic shift value matrix; the preset conditions include that one of the values ​​is 0, and there is no repeated number in the set consisting of the difference between any two values.

[0119] Step 202 includes the following sub-steps.

[0120] Sub-step 2021, determining a difference set according to the number of columns, and selecting K difference set elements from the difference set.

[0121] Specifically, the number of columns is K, so the difference set (v, k, λ) is obtained, wherein the difference set obtained according to the number of columns K contains multiple elements, and v is the largest element in this difference set. In this embodiment, let k=K, λ=1. Among them, k=K, which means that K difference set elements are randomly selected from the difference set obtained according to the number of columns K; λ=1, which means that the difference between any two difference set elements in the K difference set elements taken out only appears once; that is, the K difference set elements satisfy the following conditions: there are no repeated numbers in the set composed of the difference between any two difference set elements. For example, the number of columns K is 8, and the elements {1, 6, 7, 9, 19, 38, 42, 49} in the (57, 8, 1) difference set are selected, where v=57.

[0122] Sub-step 2022, determining the minimum value among the K difference set elements, and subtracting the minimum value from the K difference set elements respectively to obtain K numerical values.

[0123] Specifically, in order to ensure that the first element of the second row is 0, the K difference set elements are respectively subtracted from the minimum value of the K difference set elements, thereby obtaining K values, one of which is 0. Among them, the K values ​​are obtained by subtracting the same value from the K difference set elements, so the condition is satisfied: there are no repeated numbers in the set consisting of the difference between any two values.

[0124] Generally, when taking out K difference set elements from a difference set, K difference set elements arranged continuously can be taken out; at this time, the K difference set elements taken out are arranged in order from small to large; therefore, the K numerical values ​​are also arranged in order from small to large and the first numerical value is 0; at this time, when assigning values ​​to each element in the second row, each element in the second row can be assigned values ​​in the order of arrangement of the K numerical values.

[0125] Step 203, assign K values ​​to the K elements of the second row in the cyclic shift value matrix respectively, wherein the first element of the second row is assigned 0. Step 203 is substantially the same as step 103, and will not be described in detail here.

[0126] Step 204, based on the dimension information of the circulant permutation matrix of the regular QC-LDPC code, searches for values ​​that satisfy the girth condition for each element to be assigned, so as to obtain a cyclic shift value matrix; wherein each element to be assigned refers to each element in the cyclic shift value matrix except the first row, the second row, and the first column. Step 204 is substantially the same as step 104, and will not be described in detail here.

[0127] Step 205: construct a check matrix of a regular QC-LDPC code based on the cyclic shift value matrix. Step 205 is substantially the same as step 105 and will not be described in detail here.

[0128] In this embodiment, K values ​​satisfying a preset condition are obtained based on the difference, so that K values ​​satisfying the condition can be found quickly.

[0129] The third embodiment of the present invention relates to a method for constructing a regular QC-LDPC code. The third embodiment is different from the second embodiment in that the third embodiment of the present invention provides another specific method for quickly finding a value that meets a condition.

[0130] like Figure 6 FIG. 4 is a flow chart of a method for constructing a regular QC-LDPC code in a third embodiment;

[0131] Step 301: Initialize each element in the first row and the first column of the cyclic shift value matrix of the regular QC-LDPC code to 0.

[0132] Step 301 is substantially the same as step 101 and will not be described in detail here.

[0133] Step 302, obtaining K values ​​that meet preset conditions; wherein the value of K is equal to the number of columns of the cyclic shift value matrix; the preset conditions include that one of the values ​​is 0, and there is no repeated number in the set consisting of the difference between any two values.

[0134] Step 302 includes the following sub-steps.

[0135] Sub-step 3021, selecting K consecutive sequence elements from the Lucas sequence.

[0136] Among them, the Lucas sequence is a known sequence, and K consecutive sequence elements are selected from the Lucas sequence; due to the characteristics of the Lucas sequence itself, the consecutive K sequence elements meet the following conditions: there are no repeated numbers in the set composed of the difference between any two sequence.

[0137] Sub-step 3022, determining the minimum value among the K sequence elements, and subtracting the minimum value from the K sequence elements respectively to obtain K numerical values.

[0138] Specifically, in order to ensure that the first element of the second row is 0, the minimum value of the K sequence elements is subtracted from each of the K sequence elements, thereby obtaining K values, one of which is 0. The K values ​​are obtained by subtracting the same value from the K sequence elements, thus satisfying the condition that there are no duplicate numbers in the set consisting of the difference between any two values.

[0139] The K consecutive sequence elements taken out from the Lucas sequence are arranged in ascending order; therefore, the K numerical values ​​are also arranged in ascending order and the first numerical value is 0; at this time, when assigning values ​​to the elements in the second row, the elements in the second row can be assigned values ​​in the order of the arrangement of the K numerical values.

[0140] Step 303, assign K values ​​to the K elements of the second row in the cyclic shift value matrix respectively, wherein the first element of the second row is assigned 0. Step 303 is substantially the same as step 103, and will not be described in detail here.

[0141] Step 304, based on the dimension information of the circulant permutation matrix of the regular QC-LDPC code, search for values ​​that meet the girth condition for each element to be assigned, so as to obtain a cyclic shift value matrix; wherein each element to be assigned refers to each element in the cyclic shift value matrix except the first row, the second row, and the first column. Step 304 is substantially the same as step 104, and will not be described in detail here.

[0142] Step 305: construct a check matrix of a regular QC-LDPC code based on the cyclic shift value matrix. Step 305 is substantially the same as step 105 and will not be described in detail here.

[0143] In this embodiment, K values ​​satisfying a preset condition are obtained based on the Lucas sequence, and the K values ​​satisfying the condition can be found quickly.

[0144] The step division of the above methods is only for the purpose of clear description. When implemented, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs without changing the core design of the algorithm and process are all within the scope of protection of this patent.

[0145] A fourth embodiment of the present invention relates to an electronic device, such as Figure 7 As shown, including:

[0146] at least one processor 701; and,

[0147] A memory 702 that is communicatively connected to the at least one processor 701; wherein,

[0148] The memory 702 stores instructions that can be executed by the at least one processor 701, and the instructions are executed by the at least one processor 701 so that the at least one processor 701 can execute the construction method of the regular QC-LDPC code described in any of the above embodiments.

[0149] The memory 702 and the processor 701 are connected in a bus manner, and the bus may include any number of interconnected buses and bridges, and the bus connects various circuits of one or more processors 701 and the memory 702 together. The bus can also connect various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface between the bus and the transceiver. The transceiver can be one element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices on a transmission medium. The data processed by the processor 701 is transmitted on a wireless medium via an antenna, and further, the antenna also receives data and transmits the data to the processor 701.

[0150] The processor 701 is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management and other control functions. The memory 702 can be used to store data used by the processor 701 when performing operations.

[0151] A fifth embodiment of the present invention relates to a computer-readable storage medium storing a computer program, which implements the above method embodiment when executed by a processor.

[0152] That is, those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium, including several instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0153] Those skilled in the art will appreciate that the above-mentioned embodiments are specific examples for implementing the present invention, and in actual applications, various changes may be made thereto in form and detail without departing from the spirit and scope of the present invention.

Claims

1. A method for constructing a regular QC-LDPC code, characterized in that: include: Initialize each element of the first row and the first column in the cyclic shift value matrix of the regular QC-LDPC code to 0; Acquire K values ​​that meet preset conditions; wherein the value of K is equal to the number of columns of the cyclic shift value matrix; the preset conditions include that one of the values ​​is 0, and there is no repeated number in the set consisting of the difference between any two of the values; Assigning the K values ​​to the K elements of the second row in the cyclic shift value matrix respectively; wherein the first element of the second row is assigned a value of 0; Searching for a value that satisfies a preset girth condition for each element to be assigned based on the dimension information of the cyclic permutation matrix of the regular QC-LDPC code, so as to obtain the cyclic shift value matrix; wherein each of the elements to be assigned refers to each element in the cyclic shift value matrix except the first row, the second row, and the first column; A check matrix of the regular QC-LDPC code is constructed based on the cyclic shift value matrix.

2. The method for constructing a regular QC-LDPC code according to claim 1, characterized in that: The obtaining of K values ​​that meet a preset condition includes: Determine a difference set according to the number of columns, and select K difference set elements from the difference set; A minimum value among the K difference set elements is determined, and the minimum value is subtracted from each of the K difference set elements to obtain the K numerical values.

3. The method for constructing a regular QC-LDPC code according to claim 1, characterized in that: The obtaining of K values ​​that meet a preset condition includes: Select K consecutive sequence elements from the Lucas sequence; A minimum value among the K number sequence elements is determined, and the minimum value is subtracted from each of the K number sequence elements to obtain the K numerical values.

4. The method for constructing a regular QC-LDPC code according to claim 1, characterized in that: The girth condition includes: the girth of the check matrix is ​​8, 10, or 12.

5. The method for constructing a regular QC-LDPC code according to claim 1, characterized in that: The dimension information includes an initial value and a step size of the dimension; the dimension information of the circulant permutation matrix based on the regular QC-LDPC code searches for a value that satisfies a preset girth condition for each element to be assigned, including: determining a plurality of candidate values ​​according to the dimension; Perform girth detection on each of the elements to be assigned a value according to the multiple candidate values, and determine whether there is a candidate value under the dimension that enables each of the elements to be assigned a value to meet the girth condition; If there is an alternative value that makes each of the elements to be assigned a value satisfy the girth condition, obtaining the cyclic shift value matrix after all elements are assigned a value; If there is no alternative value that makes each of the elements to be assigned satisfy the girth condition, the dimension is updated using the step size, and the step of searching for a value that satisfies the preset girth condition for each element to be assigned based on the dimension information of the circulant permutation matrix of the regular QC-LDPC code is repeated.

6. The method for constructing a regular QC-LDPC code according to claim 5, characterized in that: In the girth detection for each of the elements to be assigned according to the multiple candidate values, for each of the candidate values, when it is determined that the candidate value does not exist in the cyclic shift value matrix, the candidate value is assigned to the element to be assigned and the girth detection is performed.

7. The method for constructing a regular QC-LDPC code according to claim 5, characterized in that: The performing girth detection on each of the elements to be assigned a value according to the multiple candidate values, and judging whether there is a candidate value under the dimension that enables each of the elements to be assigned a value to satisfy the girth condition, includes: For each of the elements to be assigned, the candidate values ​​satisfying the girth condition are added to the optional value set of the element to be assigned; and the assignment step is entered; the assignment step includes: If the optional value set of the element to be assigned is not an empty set, selecting an optional value from the optional value set and assigning it to the element to be assigned; if all the elements to be assigned are assigned, determining whether there is an alternative value under the dimension that makes each element to be assigned meet the girth condition; If the optional value set of the element to be assigned is an empty set and the element to be assigned is not the first element to be assigned, remove the current value of the previous element to be assigned of the element to be assigned from the optional value set of the previous element to be assigned, and perform the assignment step on the previous element to be assigned; If the optional value set of the element to be assigned is an empty set and the element to be assigned is the first element to be assigned, then determining that there is no alternative value under the dimension that enables each element to be assigned to satisfy the girth condition; The value satisfying the girth condition is searched for each of the elements to be assigned a value in order from left to right and from top to bottom.

8. The method for constructing a regular QC-LDPC code according to claim 5, characterized in that: The constructing the check matrix of the regular QC-LDPC code based on the cyclic shift value matrix is ​​specifically, constructing the check matrix of the regular QC-LDPC code according to the cyclic shift value matrix and the dimension based on which the value of each element to be assigned that satisfies the girth condition is searched.

9. An electronic device, characterized in that: include: at least one processor; as well as, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the construction method of the regular QC-LDPC code as described in any one of claims 1 to 8.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method for constructing a regular QC-LDPC code according to any one of claims 1 to 8 is implemented.