# US 2019/0173494 A1 · Method and Apparatus for Generating Low-Density Parity-Check Code Basis Matrix

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0173494 A1
- Document ID: US20190173494A1
- Status: Published application
- Kind: A1
- Application number: 16/251,182
- Filed: 2019-01-18
- Published: 2019-06-06
- Earliest claimed: 2016-07-20
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Chen ZHENG; Yuejun WEI; Liang MA; Xin ZENG
- Web page: https://patentgrep.com/patent/US20190173494A1

## CPC

- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/1157: {Low-density generator matrices [LDGM]}
- H03M 13/1177: {Regular LDPC codes with parity-check matrices wherein all rows and columns have the same row weight and column weight, respectively}
- H03M 13/118: {Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure (H03M13/1165 takes precedence)}
- H03M 13/635: {Error control coding in combination with rate matching}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- Y02D 30/70: in wireless communication networks
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

The present disclosure relates to methods and apparatuses for generating a low-density parity-check code basis matrix. One example method includes obtaining a low-density parity-check code mother matrix, and generating a 1st matrix to a qth matrix one by one, where q is a preset positive integer. A Pth matrix in the 1st matrix to the qth matrix is generated in the following manner: selecting a to-be-replaced matrix element in a (P−1)th matrix, where the to-be-replaced matrix element is a matrix element having a value that is not −1 in the (P−1)th matrix, determining a Pth shift factor corresponding to the to-be-replaced matrix element, and replacing the to-be-replaced matrix element in the (P−1)th matrix with the Pth shift factor to obtain the Pth matrix whose cycle length property is better than a cycle length property of the (P−1)th matrix.

## Claims

### Claim 1

A method for generating a low-density parity-check code basis matrix, comprising:
obtaining a low-density parity-check code mother matrix; and
generating a 1st matrix to a qth matrix one by one, wherein q is a preset positive integer, and wherein a Pth matrix in the 1st matrix to the qth matrix is generated in the following manner:
selecting a to-be-replaced matrix element in a (P−1)th matrix, wherein the to-be-replaced matrix element is a matrix element having a value that is not −1 in the (P−1)th matrix;
determining a Pth shift factor corresponding to the to-be-replaced matrix element in the (P−1)th matrix; and
replacing the to-be-replaced matrix element in the (P−1)th matrix with the Pth shift factor to obtain the Pth matrix, wherein:
a cycle length property of the Pth matrix is better than a cycle length property of the (P−1)th matrix;
the cycle length property of the Pth matrix is determined by cycle length properties of matrices comprised in a Pth matrix set, and the Pth matrix set comprises matrices obtained by expanding the Pth matrix based on preset lifting factors; and
the cycle length property of the (P−1)th matrix is determined by cycle length properties of matrices comprised in a (P−1)th matrix set, and the (P−1)th matrix set comprises matrices obtained by expanding the (P−1)th matrix based on preset lifting factors.

### Claim 2 (depends on 1)

The method according to claim 1, wherein that a cycle length property of the Pth matrix is better than a cycle length property of the (P−1)th matrix comprises:
quantities of 4-cycles to L-cycles with an approximate cycle extrinsic message degree (ACE) being less than a first preset value in the Pth matrix set are respectively the same as quantities of 4-cycles to L-cycles with the ACE being less than the first preset value in the (P−1)th matrix set, quantities of 4-cycles to L-cycles in the Pth matrix set are respectively the same as quantities of 4-cycles to L-cycles in the (P−1)th matrix set, and (L+2)-cycles with the ACE being less than a second preset value in the Pth matrix set are fewer than (L+2)-cycles with the ACE being less than the second preset value in the (P−1)th matrix set, wherein L is an even number less than a preset value.

### Claim 3 (depends on 1)

The method according to claim 1, wherein that a cycle length property of the Pth matrix is better than a cycle length property of the (P−1)th matrix comprises:
quantities of 4-cycles to L-cycles in the Pth matrix set are respectively the same as quantities of 4-cycles to L-cycles in the (P−1)th matrix set, quantities of 4-cycles to (L+2)-cycles with an approximate cycle extrinsic message degree (ACE) being less than a second preset value in the Pth matrix set are respectively the same as quantities of 4-cycles to (L+2)-cycles with the ACE being less than the second preset value in the (P−1)th matrix set, and (L+2)-cycles in the Pth matrix set are fewer than (L+2)-cycles in the (P−1)th matrix set, wherein L is an even number less than a preset value.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the determining a Pth shift factor corresponding to a to-be-replaced matrix element in the (P−1)th matrix comprises:
obtaining a Pkth shift factor corresponding to the to-be-replaced matrix element in the (P−1)th matrix;
replacing the to-be-replaced matrix element in the (P−1)th matrix with the Pkth shift factor to generate a Pkth matrix; and
if a cycle length property of the Pkth matrix is better than the cycle length property of the (P−1)th matrix, using the Pkth shift factor as the Pth shift factor.

### Claim 5 (depends on 4)

The method according to claim 4, further comprising:
if the cycle length property of the Pkth matrix is not better than the cycle length property of the (P−1)th matrix, obtaining a Pk+1th shift factor corresponding to the to-be-replaced matrix element in the (P−1)th matrix;
replacing the to-be-replaced matrix element in the (P−1)th matrix with the Pk+1th shift factor to generate a Pk+1th matrix; and
if a cycle length property of the Pk+1th matrix is better than the cycle length property of the (P−1)th matrix, using the Pk+1th shift factor as the Pth shift factor.

### Claim 6

An apparatus for generating a low-density parity-check code basis matrix, comprising:
a memory; and
at least one processor, the at least one processor configured to:
obtain a low-density parity-check code mother matrix; and
generate a 1st matrix to a qth matrix one by one, wherein q is a preset positive integer, and wherein a Pth matrix in the 1st matrix to the qth matrix is generated in the following manner:
selecting a to-be-replaced matrix element in a (P−1)th matrix, wherein the to-be-replaced matrix element is a matrix element with a value not being −1 in the (P−1)th matrix;
determining a Pth shift factor corresponding to the to-be-replaced matrix element in the (P−1)th matrix; and
replacing the to-be-replaced matrix element in the (P−1)th matrix with the Pth shift factor to obtain the Pth matrix, wherein:
a cycle length property of the Pth matrix is better than a cycle length property of the (P−1)th matrix;
the cycle length property of the Pth matrix is determined by cycle length properties of matrices comprised in a Pth matrix set, and the Pth matrix set comprises matrices obtained by expanding the Pth matrix based on preset lifting factors; and
the cycle length property of the (P−1)th matrix is determined by cycle length properties of matrices comprised in a (P−1)th matrix set, and the (P−1)th matrix set comprises matrices obtained by expanding the (P−1)th matrix based on the preset lifting factors.

### Claim 7 (depends on 6)

The apparatus according to claim 6, wherein that a cycle length property of the Pth matrix is better than a cycle length property of the (P−1)th matrix comprises:
quantities of 4-cycles to L-cycles with an approximate cycle extrinsic message degree (ACE) being less than a first preset value in the Pth matrix set are respectively the same as quantities of 4-cycles to L-cycles with the ACE being less than the first preset value in the (P−1)th matrix set, quantities of 4-cycles to L-cycles in the Pth matrix set are respectively the same as quantities of 4-cycles to L-cycles in the (P−1)th matrix set, and (L+2)-cycles with the ACE being less than a second preset value in the Pth matrix set are fewer than (L+2)-cycles with the ACE being less than the second preset value in the (P−1)th matrix set, wherein L is an even number less than a preset value.

### Claim 8 (depends on 6)

The apparatus according to claim 6, wherein that a cycle length property of the Pth matrix is better than a cycle length property of the (P−1)th matrix comprises:
quantities of 4-cycles to L-cycles in the Pth matrix set are respectively the same as quantities of 4-cycles to L-cycles in the (P−1)th matrix set, quantities of 4-cycles to (L+2)-cycles with an approximate cycle extrinsic message degree (ACE) being less than a second preset value in the Pth matrix set are respectively the same as quantities of 4-cycles to (L+2)-cycles with the ACE being less than the second preset value in the (P−1)th matrix set, and (L+2)-cycles in the Pth matrix set are fewer than (L+2)-cycles in the (P−1)th matrix set, wherein L is an even number less than a preset value.

### Claim 9 (depends on 6)

The apparatus according to claim 6, wherein the at least one processor is further configured to:
obtain a Pkth shift factor corresponding to the to-be-replaced matrix element in the (P−1)th matrix;
replace the to-be-replaced matrix element in the (P−1)th matrix with the Pkth shift factor to generate a Pkth matrix; and
if a cycle length property of the Pkth matrix is better than the cycle length property of the (P−1)th matrix, use the Pkth shift factor as the Pth shift factor.

### Claim 10 (depends on 9)

The apparatus according to claim 9, wherein the at least one processor is further configured to:
if the cycle length property of the Pkth matrix is not better than the cycle length property of the (P−1)th matrix, obtain a Pk+1th shift factor corresponding to the to-be-replaced matrix element in the (P−1)th matrix;
replace the to-be-replaced matrix element in the (P−1)th matrix with the Pk+1th shift factor to generate a Pk+1th matrix; and
if a cycle length property of the Pk+1th matrix is better than the cycle length property of the (P−1)th matrix, use the Pk+1th shift factor as the Pth shift factor.
