# US 11,115,054 B2 · Polar code encoding method 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,115,054 B2
- Document ID: US11115054B2
- Status: Granted
- Kind: B2
- Application number: 16/688,100
- Filed: 2019-11-19
- Published: 2020-03-12
- Granted: 2021-09-07
- Earliest claimed: 2017-08-11
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Gongzheng Zhang; Huazi Zhang; Rong Li; Lingchen Huang; Yunfei Qiao
- Web page: https://patentgrep.com/patent/US11115054B2

## CPC

- H03M 13/033: {Theoretical methods to calculate these checking codes}
- H03M 13/13: Linear codes
- G06F 7/24: Sorting, i.e. extracting data from one or more carriers, rearranging the data in numerical or other ordered sequence, and rerecording the sorted data on the original carrier or on a different carrier or set of carriers {sorting methods in general}(G06F7/36 takes precedence)
- H03M 13/612: {Aspects specific to channel or signal-to-noise ratio estimation (H03M13/63 takes precedence)}
- H04L 1/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- 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)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

This application provides a polar code encoding method and apparatus. The method includes: obtaining, by a sending device, a sequence corresponding to a required mother code length; obtaining, by the sending device, a to-be-encoded bit; and performing, by the sending device, polar code encoding on the to-be-encoded bit by using the sequence corresponding to the required mother code length, to obtain an encoded bit, where the sequence is generated based on a basic sequence, and a length of the basic sequence is less than the mother code length.

## Claims

### Claim 1

A method, comprising:
obtaining, by a device, a first sequence corresponding to a required mother code length, wherein the first sequence is generated based on a basic sequence, and a length of the basic sequence is less than the mother code length;
obtaining, by the device, a to-be-encoded bit; and
performing, by the device, polar code encoding on the to-be-encoded bit using the first sequence, to obtain an encoded bit, wherein:
the basic sequence comprises a second sequence whose length is N, the first sequence has a length of 2N and is obtained by sorting reliability values of the second sequence and reliability values of a third sequence in ascending order, sequence numbers of N polarized channels in the second sequence are arranged in a predetermined order, and the predetermined order is different from an order of polarization weights of the N polarized channels;
reliability values of the N polarized channels in the second sequence arranged in the predetermined order respectively correspond to polarization weight values of the N polarized channels that are arranged in ascending order, and indexes of polarized channels of the N polarized channels corresponding to the second sequence are 0, . . . , and 2N−1; and
reliability values of N polarized channels arranged in the predetermined order in the third sequence are obtained by adding a first difference to a respective polarization weight value of each polarized channel in the second sequence, and indexes of polarized channels of the N polarized channels corresponding to the third sequence are N, . . . , and 2N−1.

### Claim 2 (depends on 1)

The method according to claim 1, wherein:
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(β)j, and the first difference is ΔWn=βn; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(βj)j, and the first difference is ΔWn=(βn)n; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(2jα+b)γ, and the first difference is ΔWn=(2n*a+b)γ; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(2j*αj+bj)γj, and the first difference is ΔWn=(2n*αn+bn)γn; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(βj+α*θj), and the first difference is ΔWn=(β)n+α*(θ)n; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*((βj)j+αj*(θj)j), and the first difference is ΔWn=(βn)n+αn* (θn)n, wherein
i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i≙Bn-1Bn-2 . . . B0, Bj∈{0,1}, j∈{0,1 . . . , n−1}, n=log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 3

An apparatus, comprising:
a processor; and
a non-transitory computer-readable storage medium storing a program to be executed by the processor, the program including instructions for:
obtaining a first sequence corresponding to a required mother code length and a to- be-encoded bit, wherein the first sequence is generated based on a basic sequence, and a length of the basic sequence is less than the mother code length; and
performing polar code encoding on the to-be-encoded bit using the first sequence corresponding to the required mother code length, to obtain an encoded bit, wherein:
the basic sequence comprises a second sequence whose length is N, the first sequence has a length 2N and is obtained by sorting reliability values of the second sequence and reliability values of a third sequence in ascending order, sequence numbers of N polarized channels in the second sequence are arranged in a predetermined order, and the predetermined order is different from an order of polarization weights of the N polarized channels;
reliability values of the N polarized channels in the second sequence arranged in the predetermined order respectively correspond to polarization weight values of the N polarized channels that are arranged in ascending order, and indexes of polarized channels of the N polarized channels corresponding to the first sequence are 0, . . . , and N−1i; and
reliability values of N polarized channels arranged in the predetermined order in the third sequence are obtained by adding a first difference to a respective polarization weight value of each polarized channel in the second sequence, and indexes of polarized channels of the N polarized channels corresponding to the second sequence are N, . . . , and 2N−1.

### Claim 4 (depends on 3)

The apparatus according to claim 3, wherein:
a polarization weight of an ith polarized channel in the second sequence is W1=Σj=0n-1Bj*(β)j, and the first difference is ΔWn=βn; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(βj)j, and the first difference is ΔWn=(βn)n; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(2j*α+b)γ, and the first difference is ΔWn=(2n*α+b)γ; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(2j*αj+bj)γj, and the first difference is ΔWn=(2n*αn+bn)γn; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(βj+α*θj), and the first difference is ΔWn=(β)n+α*(θ)n; or
a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*((βj)j+αj*(θj)j), and the first difference is ΔWn=(βn)n+a n*(θn)n, wherein
i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i≙Bn-1Bn-2. . . B0, Bj∈{0,1}, j∈{0,1, . . ., n-1 }, n=log2(N), α and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 5

A method, comprising:
obtaining, by a device, a first sequence corresponding to a required mother code length, wherein the first sequence is generated based on a basic sequence, and a length of the basic sequence is less than the mother code length;
obtaining, by the device, a to-be-decoded bit; and
decoding, by the device, the to-be-decoded bit using the first sequence corresponding to the required mother code length, to obtain a decoded bit, wherein:
the basic sequence comprises a second sequence whose length is N, the first sequence has a length 2N and is obtained by sorting reliability values of the second sequence and reliability values of a third sequence in ascending order, sequence numbers of N polarized channels in the second sequence are arranged in a predetermined order, and the predetermined order is different from an order of polarization weights of the N polarized channels;
reliability values of the N polarized channels in the second sequence arranged in the predetermined order respectively correspond to polarization weight values of the N polarized channels that are arranged in ascending order, and indexes of polarized channels of the N polarized channels corresponding to the first sequence are 0, . . . , and N−1; and
reliability values of N polarized channels arranged in the predetermined order in the third sequence are obtained by adding a first difference to a respective polarization weight value of each polarized channel in the second sequence, and indexes of polarized channels of the N polarized channels corresponding to the third sequence are N, . . . , and 2N−1.

### Claim 6 (depends on 5)

The method according to claim 5, wherein a polarization weight of an ith polarized channel in the second sequence is Wi=Σj=0n-1Bj*(β)j, and the first difference is ΔWn=βn;
wherein i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i ≙Bn-1Bn-2 . . . B0, Bj ∈{0,1}, j ∈{0,1, . . . , n-1}, n =log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 7 (depends on 5)

The method according to claim 5, wherein a polarization weight of an ith polarized channel in the first sequence is Wi=Σj=0n-1Bj*(βj)*(βj)j, and the first difference is ΔWn=(βn)n;
wherein i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i≙Bn-1Bn-2 . . . B0, Bj ∈{0,1}, j ∈ {0,1, . . . , n−1}, n=log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 8 (depends on 5)

The method according to claim 5, wherein a polarization weight of an ith polarized channel in the first sequence is Wi=Σj=0n-1Bj*(2j*α+b)γ, and the first difference is ΔWn=(2n*α+b)γ;
wherein i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i ≙Bn-1Bn-2. . . B0, Bj∈{0,1}, j ∈{0,1, . . ., n−1}, n=log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 9 (depends on 5)

The method according to claim 5, wherein a polarization weight of an ith polarized channel in the first sequence is Wi=Σj=0n-1Bj*(2j*αj+bj)γj, and the first difference is ΔWn=(2n*αn+bn)γn;
wherein i is an index of a polarized channel, i is an integer greater than or equal to 0 and less than N, i ≙Bn-1Bn-2. . . B0, Bj∈{0,1}, j ∈{0,1, . . . , n−1}, n=log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 10 (depends on 5)

The method according to claim 5, wherein a polarization weight of an ith polarized channel in the first sequence is Wi=Σj=0n-1Bj*(βj+α*θj), and the first difference is ΔWn=(β)n+α*(θ)n;
wherein i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i ≙Bn-1Bn-2 . . . B0, Bj ∈{0,1}, j ∈{0,1, . . . , n−1}, n=log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].

### Claim 11 (depends on 5)

The method according to claim 5, wherein a polarization weight of an ith polarized channel in the first sequence is Wi=Σj=0n-1Bj*((βj)j+αj*(θj)j), and the first difference is ΔWn=(βn)n+αn*(θn)n;
wherein i is an index of a polarized channel, i is an integer greater than or equal to o and less than N, i ≙Bn-1Bn-2 . . . B0, Bj ∈{0,1}, j ∈{0, 1, . . . , n−1}, n=log2(N), β and θ are fixed values whose value ranges are [0,2], α and γ are fixed values whose value ranges satisfy α×γ∈[0,2], b is a fixed value whose value range is [−1,1], and a is a fixed value whose value range is [−1,1].