Method for constructing basis matrix, processing device and storage medium

Abstract

A method, processing device, and storage medium for constructing a base matrix for a permutation matrix of a QC-LDPC code. The method includes determining the number of columns Ns corresponding to systematic bits in a base matrix and the number of rows Nrow of the base matrix based on the code rate of the permutation matrix; determining a maximum row weight dc of the base matrix and a total weight range of the base matrix, wherein the row weight of each row in the base matrix is ​​dc or dc-1; determining a first range of rows with a row weight of dc-1 and a second range of rows with a row weight of dc in the base matrix based on the total weight range of the base matrix and the number of rows Nrow of the base matrix; performing padding processing on the systematic bit portion of each row in an initial base matrix corresponding to the base matrix based on the number of rows Nrow of the base matrix, the total weight range, the first range, and the second range to obtain an intermediate base matrix; performing a convergence calculation on the intermediate base matrix to determine whether the intermediate base matrix has converged, and determining the intermediate base matrix as the constructed base matrix in response to the convergence of the intermediate base matrix. This method can efficiently construct a base matrix.

Claims

1. A method for constructing a basis matrix for a permutation matrix of a QC-LDPC code, comprising: Determine, according to the code rate of the permutation matrix, the number of columns Ns corresponding to the systematic bits in the base matrix and the number of rows Nrow of the base matrix; Determining a maximum row weight dc of the base matrix and a total weight range of the base matrix, wherein the row weight of each row in the base matrix is ​​dc or dc-1; Determine, according to the total weight range of the basis matrix and the number of rows Nrow of the basis matrix, a first range of the number of rows with a row weight of dc-1 and a second range of the number of rows with a row weight of dc in the basis matrix; performing padding processing on a systematic bit portion of each row in an initial basis matrix corresponding to the basis matrix according to the number of rows Nrow of the basis matrix, the total weight range, the first range, and the second range to obtain an intermediate basis matrix; A convergence calculation is performed on the intermediate basis matrix to determine whether the intermediate basis matrix converges, and in response to the intermediate basis matrix converges, the intermediate basis matrix is ​​determined to be the basis matrix.

2. The method according to claim 1, further comprising: In response to the intermediate basis matrix not converging, resetting at least part of the parameters of the intermediate basis matrix, re-filling the system bits of each row of the reset intermediate basis matrix to obtain a new intermediate basis matrix, performing the convergence calculation on the new intermediate basis matrix again, and in response to the new intermediate basis matrix converging, determining the new intermediate basis matrix as the basis matrix.

3. The method according to claim 1 or 2, wherein: Performing the convergence calculation includes: Get the signal-to-noise ratio and number of iterations, The convergence calculation is performed using a density evolution tool according to the signal-to-noise ratio and the number of iterations.

4. The method according to claim 1, wherein The code rate of the permutation matrix is ​​1 / 6, 1 / 4 or 1 / 3, For 1 / 6 code rate, Ns = 4, Nrow = 20; For 1 / 4 code rate, Ns = 6, Nrow = 18; For 1 / 3 code rate, Ns = 8, Nrow = 16.

5. The method according to claim 4, wherein The total weight of the basis matrix ranges from 79 to 88; For 1 / 6 bit rate, dc = 5 or 4; For 1 / 4 bit rate, dc = 5; For 1 / 3 bit rate, dc = 6 or 5.

6. The method according to claim 4, wherein: The first range includes an upper limit M of the number of rows with a row weight of dc-1, and the second range includes an upper limit N of the number of rows with a row weight of dc.

7. The method according to claim 6, wherein: For 1 / 6 bit rate, dc = 5: M = 20, N = 8 / 7 / 6 / 5 / 4 / 3 / 2 / 1 / 0; For 1 / 6 bit rate, dc = 4: M = 1, N = 20; For 1 / 4 bit rate, dc = 5: M = 18, N = 16 / 15 / 14 / 13 / 12 / 11 / 10 / 9 / 8 / 7; For 1 / 3 code rate, dc = 6: M = 16, N = 8 / 7 / 6 / 5 / 4 / 3 / 2 / 1 / 0; For 1 / 3 code rate, dc = 5: M = 1, N = 16.

8. The method according to claim 1, wherein According to the number of rows Nrow of the base matrix, the total weight range, the first range, and the second range, perform a filling process on the systematic bit part of each row in the initial base matrix corresponding to the base matrix to obtain the intermediate base matrix, including: Obtain the initial base matrix, Starting from the first row to the last row of the initial base matrix, process each row of the initial base matrix so that the row weight of each row of the intermediate base matrix is dc or dc - 1, and make the intermediate base matrix satisfy the number of rows Nrow of the base matrix, the total weight range, the first range, and the second range.

9. The method according to claim 8, wherein The systematic bit part of the initial base matrix is completely blank or at least some elements have been filled.

10. The method according to claim 8 or 9, wherein: During the processing, record the number of rows with row weights of dc and dc - 1 as parameter Ndc and parameter Ndc1 respectively, and the initial values of parameter Ndc and parameter Ndc1 are both 0; Process each row of the initial base matrix so that the row weight of each row of the intermediate base matrix is dc or dc - 1, including: In response to the current value of parameter Ndc < N and the current value of parameter Ndc1 < M, randomly select one from {dc, dc - 1} as the row weight d of the current row and correspondingly increment the value of parameter Ndc or parameter Ndc1 by 1; or, in response to the current value of parameter Ndc ≥ N, select dc - 1 as the row weight d of the current row and correspondingly increment the value of parameter Ndc1 by 1; or, in response to the current value of parameter Ndc1 ≥ M, select dc as the row weight d of the current row and correspondingly increment the value of parameter Ndc by 1; Obtain the current row weight dcurr of the current row, determine that the row weight to be supplemented in the current row is ds = d – dcurr, and randomly select ds positions for filling at the non - filled positions in the systematic bit part of the current row.

11. The method according to claim 10, wherein: Process row by row starting from the first row to the last row of the initial base matrix.

12. The method according to any one of claims 1-2 and 4-9, wherein: The form of the base matrix is as follows: ， Where x represents the cyclic value to be designed, and the part occupied by x is the systematic bit.

13. A processing device for constructing a base matrix of a permutation matrix for QC - LDPC codes, including: A processing unit, A memory on which one or more computer program modules are stored; Wherein, when the one or more computer program modules are configured to be executed by the processing unit, the method as described in any one of claims 1 - 12 is implemented.

14. A non-transitory readable storage medium, wherein: Computer instructions are stored on the non - transitory readable storage medium, wherein when the computer instructions are executed by a processor, the method as described in any one of claims 1 - 12 is implemented.

Images