# US 11,444,640 B2 · Encoding method and device, and apparatus

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

- Number: US 11,444,640 B2
- Document ID: US11444640B2
- Status: Granted
- Kind: B2
- Application number: 17/135,061
- Filed: 2020-12-28
- Published: 2021-06-24
- Granted: 2022-09-13
- Earliest claimed: 2016-07-29
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Xiaocheng Liu; Ying Chen; Rong Li
- Web page: https://patentgrep.com/patent/US11444640B2

## CPC

- H03M 13/13: Linear codes
- H03M 13/033: {Theoretical methods to calculate these checking codes}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H03M 13/6362: {by puncturing}
- H04L 1/0009: {by adapting the channel coding (H04L1/1812 takes precedence)}
- 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 present disclosure relates to encoding method and devices. One example method includes determining N to-be-encoded bits, where the N to-be-encoded bits include information bits and frozen bits, obtaining a first polarization weight vector including polarization weights of N polarized channels, where the N to-be-encoded bits correspond to the N polarized channels, determining positions of the information bits based on the first polarization weight vector, and performing polar encoding on the N to-be-encoded bits to obtain polar-encoded bits.

## Claims

### Claim 1

A communications method, comprising:
determining, by a communications apparatus, N bits to be encoded based on a target code length M, wherein the N bits comprise a plurality of frozen bits and K information bits, and wherein N is greater than or equal to M;
determining, by the communications apparatus in the N bits, N−M positions for deleting N−M bits corresponding to the N−M positions;
determining, by the communications apparatus in the N bits, K positions for allocating the K information bits based on a vector, wherein the vector comprises sequence numbers of N polarized channels corresponding to the N bits, and wherein the sequence numbers of the N polarized channels are sorted in an ascending order in the vector according to reliabilities of the N polarized channels;
performing, by the communications apparatus, polar encoding on the N bits to obtain polar-encoded bits;
performing, by the communications apparatus, rate matching on the polar-encoded bits by deleting the N−M bits corresponding to the N−M positions; and
outputting, by the communications apparatus, the rate matched polar-encoded bits for wireless transmission to a different communication apparatus.

### Claim 2 (depends on 1)

The method according to claim 1, wherein N=2└log2(M−1)┘+1, where the symbol └ ┘ denotes a flooring function.

### Claim 3 (depends on 1)

The method according to claim 1, wherein determining the K positions for allocating the K information bits comprises:
determining K positions corresponding to K most reliable polarized channels of the N polarized channels for allocating the K information bits.

### Claim 4 (depends on 1)

The method according to claim 1, wherein reliability for each of the N polarized channels, represented by Wi, is calculated as:
W
i
=
∑
j
=
0
n
-
1
⁢
B
j
*
(
2
j
+
ϕ
)
α
,
where
iBn−1Bn−2 . . . B0, i is a channel index number, Bn−1Bn−2 . . . B0 represents a binary representation of i, Bn−1 represents a most significant bit, B0 represents a least significant bit, Bj∈{0,1}, j∈{0, 1, . . . , n−1}, i∈{0, 1, . . . , N−1}, N=2n, n is a positive integer, and ϕ and α are constants.

### Claim 5 (depends on 4)

The method according to claim 4, wherein ϕ=0 and α=¼.

### Claim 6

A communications apparatus, comprising:
at least one processor; and
one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising:
determining N bits to be encoded based on a target code length M, wherein the N bits comprise a plurality of frozen bits and K information bits, and wherein N is greater than or equal to M;
determining, in the N bits, N−M positions for deleting N−M bits corresponding to the N−M positions;
determining, in the N bits, K positions for allocating the K information bits based on a vector, wherein the vector comprises sequence numbers of N polarized channels corresponding to the N bits, and wherein the sequence numbers of the N polarized channels are sorted in an ascending order in the vector according to reliabilities of the N polarized channels;
performing polar encoding on the N bits to obtain polar-encoded bits;
performing rate matching on the polar-encoded bits by deleting the N−M bits corresponding to the N−M positions; and
outputting the rate matched polar-encoded bits for wireless transmission to a different communication apparatus.

### Claim 7 (depends on 6)

The communications apparatus according to claim 6, wherein N=2└log2(M−1)┘+1, where the symbol └ ┘ denotes a flooring function.

### Claim 8 (depends on 6)

The communications apparatus according to claim 6, wherein determining the K positions for allocating the K information bits comprises:
determining K positions corresponding to K most reliable polarized channels of the N polarized channels for allocating the K information bits.

### Claim 9 (depends on 6)

The communications apparatus according to claim 6, wherein reliability for each of the N polarized channels, represented by Wi, is calculated as:
W
i
=
∑
j
=
0
n
-
1
⁢
B
j
*
(
2
j
+
ϕ
)
α
,
where
iBn−1Bn−2 . . . B0, i is a channel index number, Bn−1Bn−2 . . . B0 represents a binary representation of i, Bn−1 represents a most significant bit, B0 represents a least significant bit, Bj∈{0,1}, j∈{0, 1, . . . , n−1}, i∈{0, 1, . . . , N−1}, N=2n, n is a positive integer, and ϕ and α are constants.

### Claim 10 (depends on 9)

The communications apparatus according to claim 9, wherein ϕ=0 and α=¼.

### Claim 11

A computer-readable storage medium storing one or more computer-executable instructions executable by at least one processor to perform operations comprising:
determining N bits to be encoded based on a target code length M, wherein the N bits comprise a plurality of frozen bits and K information bits, and wherein N is greater than or equal to M;
determining, in the N bits, N−M positions for deleting N−M bits corresponding to the N−M positions;
determining, in the N bits, K positions for allocating the K information bits based on a vector, wherein the vector comprises sequence numbers of N polarized channels corresponding to the N bits, and wherein the sequence numbers of the N polarized channels are sorted in an ascending order in the vector according to reliabilities of the N polarized channels;
performing polar encoding on the N bits to obtain polar-encoded bits;
performing, rate matching on the polar-encoded bits by deleting the N−M bits corresponding to the N−M positions; and
outputting the rate matched polar-encoded bits for wireless transmission to a communication apparatus.

### Claim 12 (depends on 11)

The computer-readable storage medium according to claim 11, N=2└log2(M−1)┘+1, where the symbol └ ┘ denotes a flooring function.

### Claim 13 (depends on 11)

The computer-readable storage medium according to claim 11, wherein determining the K positions for allocating the K information bits comprises:
determining K positions corresponding to K most reliable polarized channels of the N polarized channels for allocating the K information bits.

### Claim 14 (depends on 11)

The computer-readable storage medium according to claim 11, wherein reliability for each of the N polarized channels, represented by Wi, is calculated as:
W
i
=
∑
j
=
0
n
-
1
⁢
B
j
*
(
2
j
+
ϕ
)
α
,
where
iBn−1Bn−2 . . . B0, i is a channel index number, Bn−1Bn−2 . . . B0 represents a binary representation of i, Bn−1 represents a most significant bit, B0 represents a least significant bit, Bj∈{0,1}, j∈{0, 1, . . . , n−1}, i∈{0, 1, . . . , N−1}, N=2n, n is a positive integer, and ϕ and α are constants.

### Claim 15 (depends on 11)

The computer-readable storage medium according to claim 11, wherein ϕ=0 and α=¼.