# US 10,374,753 B2 · Polar code rate matching method and polar code rate matching apparatus

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

- Number: US 10,374,753 B2
- Document ID: US10374753B2
- Status: Granted
- Kind: B2
- Application number: 15/274,188
- Filed: 2016-09-23
- Published: 2017-01-12
- Granted: 2019-08-06
- Earliest claimed: 2014-03-24
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Hui Shen; Bin Li; Jun Chen
- Web page: https://patentgrep.com/patent/US10374753B2

## CPC

- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H03M 13/13: Linear codes
- H03M 13/2757: {Interleaver with an interleaving rule not provided for in the subgroups H03M13/2703 - H03M13/2753}
- H03M 13/2789: {Interleaver providing variable interleaving, e.g. variable block sizes}
- H03M 13/2792: {Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/6306: {Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy (H03M13/3761, H03M13/3769 and H03M13/635 take precedence)}
- H03M 13/6362: {by puncturing}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)

## Abstract

Embodiments of the present invention provide a polar code rate matching method and a polar code rate matching apparatus. The method includes: performing matrix-based BRO interleaving on a non-systematic polar code output by a polar code encoder, to obtain interleaved bits; and determining, based on the interleaved bits, a rate-matched output sequence. According to the embodiments of the present invention, matrix-based BRO interleaving is performed on a non-systematic polar code, to obtain a rate-matched output sequence, so that a sequence structure after interleaving is more random, which can reduce an FER, thereby improving HARQ performance and ensuring reliability of data transmission.

## Claims

### Claim 1

A polar code rate matching method, comprising:
performing, by a rate matching apparatus, matrix-based bit reversal order (BRO) interleaving on a non-systematic polar code output by a polar code encoder, to obtain interleaved bits;
determining, by the rate matching apparatus, based on the interleaved bits, a rate-matched output sequence;
transmitting, by the rate matching apparatus, the rate-matched output sequence;
wherein performing matrix-based BRO interleaving on the non-systematic polar code output by the polar code encoder, to obtain interleaved bits comprises:
writing, by the rate matching apparatus, bits of the non-systematic polar code by row, to form a first matrix of M1 rows×M2 columns, wherein M1 and M2 are positive integers;
performing, by the rate matching apparatus, a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation with a size of M2;
performing, by the rate matching apparatus, a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation with a size of M1;
reading, by the rate matching apparatus, bits according to a column of the third matrix, and using the bits as the interleaved bits;
or
writing, by the rate matching apparatus, bits of the non-systematic polar code by column to form a first matrix of M1 rows×M2 columns, wherein M1 and M2 are positive integers;
performing, by the rate matching apparatus, a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation with a size of M2;
performing, by the rate matching apparatus, a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation with a size of M1; and
reading, by the rate matching apparatus, bits, according to a row of the third matrix, and using the bits as the interleaved bits.

### Claim 2

A polar code rate matching method, comprising:
dividing, by a rate matching apparatus, a systematic polar code output by a polar code encoder into system bits and parity check bits;
performing, by the rate matching apparatus, matrix-based bit reversal order (BRO) interleaving on the system bits to obtain a first group of interleaved bits;
performing, by the rate matching apparatus, matrix-based BRO interleaving on the parity check bits to obtain a second group of interleaved bits;
determining, by the rate matching apparatus, based on the first group of interleaved bits and the second group of interleaved bits, a rate-matched output sequence;
wherein performing matrix-based BRO interleaving on the system bits to obtain a first group of interleaved bits comprises:
writing, by the rate matching apparatus, the system bits by row to form a first matrix of M1 rows×M2 columns;
performing, by the rate matching apparatus, a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation with a size of M2;
performing, by the rate matching apparatus, a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation with a size of M1, and
reading, by the rate matching apparatus, bits according to a column of the third matrix, and using, by the rate matching apparatus, the bits as the first group of interleaved bits, wherein M1 and M2 are positive integers;
or
writing, by the rate matching apparatus, the system bits by column to form a first matrix of M1 rows×M2 columns;
performing, by the rate matching apparatus, a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation with a size of M2;
performing, by the rate matching apparatus, a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation with a size of M1;
reading, by the rate matching apparatus, bits according to a row of the third matrix; and
using, by the rate matching apparatus, the bits as the first group of interleaved bits, wherein M1 and M2 are positive integers.

### Claim 3 (depends on 2)

The method according to claim 2, wherein performing matrix-based BRO interleaving on the parity check bits to obtain a second group of interleaved bits comprises:
writing, by the rate matching apparatus, the parity check bits by row to form a first matrix of M1 rows×M2 columns;
performing, by the rate matching apparatus, a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation with a size of M2;
performing, by the rate matching apparatus, a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation with a size of M1;
reading, by the rate matching apparatus, bits according to a column of the third matrix, and using the bits as the second group of interleaved bits, wherein M1 and M2 are positive integers; or
writing, by the rate matching apparatus, the parity check bits by column to form a first matrix of M1 rows×M2 columns;
performing, by the rate matching apparatus, a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation with a size of M2;
performing, by the rate matching apparatus, a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation with a size of M1; and
reading, by the rate matching apparatus, bits according to a row of the third matrix, and using the bits as the second group of interleaved bits, wherein M1 and M2 are positive integers.

### Claim 4

A polar code rate matching apparatus, comprising:
a non-transitory memory configured to store instructions; and
a processor coupled to the memory and configured to execute the instructions stored in the memory to cause the apparatus to:
perform matrix-based bit reversal order (BRO) interleaving on a non-systematic polar code output by a polar code encoder, to obtain interleaved bits,
determine, based on the interleaved bits, a rate-matched output sequence,
write bits of the non-systematic polar code by row to form a first matrix of M1 rows×M2 columns, wherein M1 and M2 are positive integers,
perform a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation of M2 bits,
perform a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation of M1 bits, and
read bits according to a column of the third matrix; or
write bits of the non-systematic polar code by column to faun a first matrix of M1 rows×M2 columns, wherein M1 and M2 are positive integers,
perform a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation of M2 bits,
perform a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation of M1 bits, and
read bits according to a row of the third matrix.

### Claim 5

A rate matching apparatus, comprising:
a non-transitory memory configured to store instructions; and
a processor coupled to the memory and configured to execute the instructions stored in the memory to cause the apparatus to:
divide a systematic polar code output by a polar code encoder into system bits and parity check bits,
perform matrix-based bit reversal order (BRO) interleaving on the system bits to obtain a first group of interleaved bits, and perform matrix-based BRO interleaving on the parity check bits to obtain a second group of interleaved bits,
determine, based on the first group of interleaved bits and the second group of interleaved bits, a rate-matched output sequence,
write to-be-interleaved bits by row to form a first matrix of M1 rows×M2 columns, wherein M1 and M2 are positive integers,
perform a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation of M2 bits,
perform a second substitution operation on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation of M1 bits, and
read bits according to a column of the third matrix; or
write to-be-interleaved bits by column to form a first matrix of M1 rows×M2 columns, wherein M1 and M2 are positive integers,
perform a first substitution operation on a column of the first matrix to obtain a second matrix, wherein the first substitution operation is a BRO operation of M2 bits,
perform a second substitution on a row of the second matrix to obtain a third matrix, wherein the second substitution operation is a BRO operation of M1 bits, and
read bits according to a row of the third matrix.