# US 2024/0405916 A1 · Encoding method and encoding apparatus based on systematic polar code

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

- Number: US 2024/0405916 A1
- Document ID: US20240405916A1
- Status: Published application
- Kind: A1
- Application number: 18/806,876
- Filed: 2024-08-16
- Published: 2024-12-05
- Earliest claimed: 2022-02-17
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Jiaqi GU; Jiahui LI; Mengyao MA; Zihan TANG; Wei LIN
- Web page: https://patentgrep.com/patent/US20240405916A1

## CPC

- H03M 13/13: Linear codes
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H03M 13/6312: {Error control coding in combination with data compression}
- H04L 1/0076: {Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022)}
- 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)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The method includes: obtaining an input information bit sequence; determining a target matrix based on a first polar code generation matrix and a transformation matrix; encoding the input information bit sequence based on an inverse matrix of a first matrix, to obtain a first bit sequence, where the input information bit sequence is a bit sequence corresponding to an information bit, and the first matrix is a submatrix formed by a row corresponding to the information bit and a column corresponding to the information bit that are in the target matrix; and encoding the first bit sequence based on a second matrix, to obtain a second bit sequence, where the second matrix is a submatrix formed by the row corresponding to the information bit and a column corresponding to a frozen bit that are in the target matrix.

## Claims

### Claim 1

An encoding method based on a systematic polar code, comprising:
obtaining an input information bit sequence;
determining a target matrix based on a first polar code generation matrix and a transformation matrix;
encoding the input information bit sequence based on an inverse matrix of a first matrix, to obtain a first bit sequence, wherein the input information bit sequence is a bit sequence corresponding to an information bit, and the first matrix is a submatrix formed by a row corresponding to the information bit and a column corresponding to the information bit that are in the target matrix; and
encoding the first bit sequence based on a second matrix, to obtain a second bit sequence, wherein the second matrix is a submatrix formed by the row corresponding to the information bit and a column corresponding to a frozen bit that are in the target matrix.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the target matrix is P·G, wherein G is the first polar code generation matrix, P is the transformation matrix, the first matrix is (P·G)AA, and the second matrix is (P·G)AAc, wherein A represents the information bit, and Ac represents the frozen bit.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the transformation matrix P is expressed as:
P
=
[
(
G
N
/
2
)
permute
·
G
N
/
2
0
0
I
]
,
wherein
GN/2 is a second polar code generation matrix, N/2 represents that the second polar code generation matrix is N/2×N/2-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/2)premute is a matrix obtained through first preset column transformation of GN/2, 0 is a zero matrix of N/2×N/2, and I is a unit matrix of N/2×N/2.

### Claim 4 (depends on 2)

The method according to claim 2, wherein the transformation matrix P is obtained by using a matrix S, P=G·S·G, G is the first polar code generation matrix, and the matrix S is expressed as:
S
=
[
G
N
/
2
·
(
G
N
/
2
)
permute
0
I
-
G
N
/
2
·
(
G
N
/
2
)
permute
I
]
,
wherein
GN/2 is a second polar code generation matrix, N/2 represents that the second polar code generation matrix is N/2×N/2-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/2)permute is a matrix obtained through first preset column transformation of GN/2, 0 is a zero matrix of N/2×N/2, and I is a unit matrix of N/2×N/2.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the target matrix is G·S, wherein G is the first polar code generation matrix, S is the transformation matrix, the first matrix is (G·S)AA, and the second matrix is (G·S)AAc, wherein A represents the information bit, and Ac represents the frozen bit.

### Claim 6 (depends on 5)

The method according to claim 5, wherein the transformation matrix S is expressed as:
S
=
[
G
N
/
2
·
(
G
N
/
2
)
permute
0
I
-
G
N
/
2
·
(
G
N
/
2
)
permute
I
]
,
wherein
GN/2 is a second polar code generation matrix, N/2 represents that the second polar code generation matrix is N/2×N/2-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/2)premute is a matrix obtained through first preset column transformation of GN/2, 0 is a zero matrix of N/2×N/2, and I is a unit matrix of N/2×N/2.

### Claim 7 (depends on 5)

The method according to claim 5, wherein the transformation matrix S is obtained by using a matrix P, S=G·P·G, G is the first polar code generation matrix, and the matrix P is expressed as:
P
=
[
(
G
N
/
2
)
premute
·
G
N
/
2
0
0
I
]
,
wherein
GN/2 is a second polar code generation matrix, N/2 represents that the second polar code generation matrix is N/2×N/2-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/2)permute is a matrix obtained through first preset column transformation of GN/2, 0 is a zero matrix of N/2×N/2, and I is a unit matrix of N/2×N/2.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the transformation matrix comprises a first transformation matrix and a second transformation matrix.

### Claim 9 (depends on 8)

The method according to claim 8, wherein the target matrix is P2·P1·G, wherein G is the first polar code generation matrix, P1 is the first transformation matrix, P2 is the second transformation matrix, the first matrix is (P2·P1·G)AA, and the second matrix is (P2·P1·G)AAc, wherein A represents the information bit, and Ac represents the frozen bit.

### Claim 10 (depends on 9)

The method according to claim 9, wherein the first transformation matrix P1 is expressed as:
P
1
=
[
A
0
0
B
]
,
wherein
A
=
[
(
G
N
/
4
)
permute
⁢
1
·
G
N
/
4
0
0
I
]
,
B
=
[
(
G
N
/
4
)
permute
⁢
2
·
G
N
/
4
0
0
I
]
,
GN/4 is a third polar code generation matrix, N/4 represents that the third polar code generation matrix is N/4×N/4-dimensional, N represents that the first systematic polar code generation matrix is N×N-dimensional, (GN/4)premute1 is a matrix obtained through second preset column transformation of GN/4, 0 is a zero matrix, I is a unit matrix of N/4×N/4, and (GN/4)premute2 is a matrix obtained through third preset column transformation of GN/4.

### Claim 11 (depends on 9)

The method according to claim 9, wherein the second transformation matrix P2 is expressed as:
P
2
=
[
C
0
0
I
]
,
wherein
C
=
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
·
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
-
1
,
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
is a matrix obtained through fourth preset column transformation of
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
,
GN/4 is the third polar code generation matrix, N/4 represents that the third polar code generation matrix is N/4×N/4-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, 0 is the zero matrix, and I is a unit matrix of N/2×N/2.

### Claim 12 (depends on 9)

The method according to claim 9, wherein the first transformation matrix P1 and the second transformation matrix P2 are obtained by using a matrix S1 and a matrix S2, P1·P2=G·S1·S2·G, G is the first polar code generation matrix, and the matrix S1 is expressed as:
S
1
=
[
D
0
I
-
D
I
]
,
wherein
D
=
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
-
1
,
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
,
GN/4 is the third polar code generation matrix, N/4 represents that the third polar code generation matrix is N/4×N/4-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/4)premute1 is the matrix obtained through the second preset column transformation of GN/4,
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
is the matrix obtained through the fourth preset column transformation
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
,
0 is the zero matrix, and I is a unit matrix; and
the matrix S2 is expressed as:
S
2
=
[
J
0
K
M
]
,
wherein
⁢
J
=
[
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
1
0
I
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
1
I
]
,
K
=
[
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
2
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
1
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
2
0
]
,
M
=
[
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
2
0
I
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
2
I
]
,
and (GN/4)permute2 is the matrix obtained through the third preset column transformation of GN/4.

### Claim 13 (depends on 8)

The method according to claim 8, wherein the target matrix is G·S2·S1, wherein G is the first polar code generation matrix, S1 is the first transformation matrix, S2 is the second transformation matrix, the first matrix is (G·S2·S1)AA, and the second matrix is (G·S2·S1)AAc, wherein A represents the information bit, and Ac represents the frozen bit.

### Claim 14 (depends on 13)

The method according to claim 13, wherein the first transformation matrix S1 is expressed as:
S
1
=
[
D
0
I
-
D
I
]
,
wherein
D
=
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
-
1
·
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
,
GN/4 is a third polar code generation matrix, N/4 represents that the third polar code generation matrix is N/4×N/4-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/4)premute1 is a matrix obtained through second preset column transformation of GN/4,
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
is a matrix obtained through fourth preset column transformation of
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
,
0 is a zero matrix, and I is a unit matrix of N/2×N/2.

### Claim 15 (depends on 13)

The method according to claim 13, wherein the second transformation matrix S2 is expressed as:
S
2
=
[
J
0
K
M
]
,
wherein
⁢
J
=
[
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
1
0
I
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
1
I
]
,
K
=
[
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
2
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
1
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
2
0
]
,
M
=
[
G
N
/
A
·
(
G
N
/
4
)
permute
⁢
2
0
I
-
G
N
/
4
·
(
G
N
/
4
)
permute
⁢
2
I
]
,
GN/4 is the third polar code generation matrix, N/4 represents that the third systematic polar code generation matrix is N/4×N/4-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/4)permute1 is the matrix obtained through the second preset column transformation of GN/4, (GN/4)permute2 is a matrix obtained through third preset column transformation of GN/4, 0 is the zero matrix, and I is a unit matrix of N/4×N/4.

### Claim 16 (depends on 9)

The method according to claim 9, wherein the first transformation matrix S1 and the second transformation matrix S2 are obtained by using a matrix P1 and a matrix P2, S1·S2=G·P1·P2·G, G is the first polar code generation matrix, and the matrix P1 is expressed as:
P
1
=
[
A
0
0
B
]
,
wherein
A
=
[
(
G
N
/
4
)
permute
⁢
1
·
G
N
/
4
0
0
I
]
,
B
=
[
(
G
N
/
4
)
permute
⁢
2
·
G
N
/
4
0
0
I
]
,
GN/4 is the third polar code generation matrix, N/4 represents that the third polar code generation matrix is N/4×N/4-dimensional, N represents that the first polar code generation matrix is N×N-dimensional, (GN/4)permute1 is the matrix obtained through the second preset column transformation of GN/4, (GN/4)permute2 is the matrix obtained through the third preset column transformation of GN/4, 0 is the zero matrix, and I is a unit matrix; and
the matrix P2 is expressed as:
P
2
=
[
C
0
0
I
]
,
wherein
C
=
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
·
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
-
1
,
and
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
permute
⁢
3
is the matrix obtained through the fourth preset column transformation of
[
(
G
N
/
4
)
permute
⁢
1
0
G
N
/
4
G
N
/
4
]
.

### Claim 17 (depends on 1)

The method according to claim 1, wherein the target matrix is T·G, wherein G is the first polar code generation matrix, T is the transformation matrix and is an upper triangular matrix, the first matrix is (T·G)AA, and the second matrix is (T·G)AAc, wherein A represents the information bit, and Ac represents the frozen bit.

### Claim 18

An encoding apparatus based on a systematic polar code, comprising:
an obtaining unit, configured to obtain an input information bit sequence;
a processing unit, configured to determine a target matrix based on a first polar code generation matrix and a transformation matrix; and
an encoding unit, configured to: encode the input information bit sequence based on an inverse matrix of a first matrix, to obtain a first bit sequence, wherein the input information bit sequence is a bit sequence corresponding to an information bit, and the first matrix is a submatrix formed by a row corresponding to the information bit and a column corresponding to the information bit that are in the target matrix; and
encode the first bit sequence based on a second matrix, to obtain a second bit sequence, wherein the second matrix is a submatrix formed by the row corresponding to the information bit and a column corresponding to a frozen bit that are in the target matrix.

### Claim 19 (depends on 18)

The encoding apparatus according to claim 18, wherein the target matrix is P·G, wherein G is the first polar code generation matrix, P is the transformation matrix, the first matrix is (P·G)AA, and the second matrix is (P·G)AAC, wherein A represents the information bit, and Ac represents the frozen bit.

### Claim 20 (depends on 18)

The encoding apparatus according to claim 18, wherein the target matrix is G·S, wherein G is the first polar code generation matrix, S is the transformation matrix, the first matrix is (G·S)AA, and the second matrix is (G·S)AAc, wherein A represents the information bit, and Ac represents the frozen bit.
