# US 2020/0403638 A1 · Devices and methods for generating block punctured polar codes

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

- Number: US 2020/0403638 A1
- Document ID: US20200403638A1
- Status: Published application
- Kind: A1
- Application number: 16/998,290
- Filed: 2020-08-20
- Published: 2020-12-24
- Earliest claimed: 2018-02-22
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Mikhail Sergeevich KAMENEV; Iuliia Borisovna KAMENEVA; Jie JIN; Oleg Feat'evich KURMAEV
- Web page: https://patentgrep.com/patent/US20200403638A1

## CPC

- H03M 13/13: Linear codes
- H03M 13/6362: {by puncturing}
- 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

The device and method disclosed herein are configured for generating a polar code of length N and dimension K on the basis of an original polar code being defined by a code sequence S having Nmax bit indices sorted from least reliable to most reliable sub-channels. The device comprises a processing unit configured to: (a) generate an auxiliary code sequence having Nmax/2 bit indices by removing bit indices greater than or equal to Nmax/2 from the code sequence S; (b) remove from the auxiliary code sequence the last NR bit indices to generate a modified auxiliary code sequence; and (c) generate the polar code of length N and dimension K by puncturing the original polar code on the basis of a puncturing set defined by the last p=Nmax−N bit indices of the modified auxiliary code sequence.

## Claims

### Claim 1

A device for generating a polar code of length N and dimension K on the basis of an original polar code being defined by a code sequence S having Nmax bit indices, wherein the device comprises a processor configured to:
(a) generate an auxiliary code sequence having Nmax/2 bit indices by removing bit indices greater than or equal to Nmax/2 from the code sequence S;
(b) remove from the auxiliary code sequence the last NR bit indices to generate a modified auxiliary code sequence, wherein NR denotes the number of removed bits and wherein the processing unit is configured to determine the number of removed bits NR on the basis of Nmax, N and a predefined code rate R; and
(c) generate the polar code of length N and dimension K by puncturing the original polar code on the basis of a puncturing set defined by the last p=Nmax−N bit indices of the modified auxiliary code sequence.

### Claim 2 (depends on 1)

The device of claim 1, wherein the processor is configured to determine the number of removed bits NR on the basis of the following equation:
NR=round(ap+b),
wherein round( . . . ) denotes a rounding function and a and b denote parameters, which depend on Nmax and the predefined code rate R.

### Claim 3 (depends on 1)

The device of claim 1, wherein the processor is configured to determine the number of removed bits NR on the basis of the following equation:
NR=max(0,round(ap+b)),
wherein round( . . . ) denotes a rounding function, max(. . . ) denotes the maximum function and a and b denote parameters, which depend on Nmax and the predefined code rate R.

### Claim 4 (depends on 2)

The device of claim 2, wherein the device furhher comprises a memory unit and wherein the processor is configured to determine the parameters a and b on the basis of a look-up table stored in the memory unit.

### Claim 5 (depends on 4)

The device of claim 4, wherein the processor is configured to determine the parameters a and b on the basis of auxiliary parameters a′ and b′ provided in the look-up table and the following equations:
a=f(R)a′,
b=f(R)b′,
wherein f(R) denotes a function of the predefined code rate R and wherein the auxiliary parameters a′ and b′ depend on Nmax.

### Claim 6 (depends on 5)

The device of claim 5, wherein the processor is configured to determine the auxiliary parameters a′ and b′ on the basis of the look-up table and the look-up table is:
Nmax
b′
a′
64
32.455
−0.87273
128
77.319
−1.2332
256
138.56
−1.1028
512
275.89
−1.1111
1024
572.83
−1.1649

### Claim 7 (depends on 5)

The device of claim 5, wherein the processor is configured to determine the parameters a and b on the basis of the auxiliary parameters a′ and b′ provided in the look-up table and the following equations:
a=R2a′,
b=R2b′.

### Claim 8

A method for generating a polar code of length N and dimension K on the basis of an original polar code being defined by a code sequence S having Nmax bit indices, wherein the method comprises:
(a) generating an auxiliary code sequence having Nmax/2 bit indices by removing bit indices greater than or equal to Nmax/2 from the code sequence S;
(b) removing from the auxiliary code sequence the last NR bit indices to generate a modified auxiliary code sequence, wherein NR denotes the number of removed bits and wherein the number of removed bits NR are determined on the basis of Nmax, N and a predefined code rate R; and
(c) generating the polar code of length N and dimension K by puncturing the original polar code on the basis of a puncturing set defined by the last p=Nmax−N bit indices of the modified auxiliary code sequence.

### Claim 9 (depends on 8)

The method of claim 8, wherein the number of removed bits NR is determined on the basis of the following equation:
NR=round(ap+b),
wherein round( . . . ) denotes a rounding function and a and b denote parameters, which depend on Nmax and the predefined code rate R.

### Claim 10 (depends on 8)

The method of claim 8, wherein the number of removed bits NR is determined on the basis of the following equation:
NR=max(0,round(ap+b)),
wherein round( . . . ) denotes a rounding function, max( . . . ) denotes the maximum function and a and b denote parameters, which depend on Nmax and the predefined code rate R.

### Claim 11 (depends on 9)

The method of claim 9, wherein the parameters a and b are determined on the basis of a look-up table.

### Claim 12 (depends on 11)

The method of claim 11, wherein the parameters a and b are determined on the basis of auxiliary parameters a′ and b′ provided in the look-up table and the following equations:
a=f(R)a′,
b=f(R)b′,
wherein f(R) denotes a function of the predefined code rate R and wherein the auxiliary parameters a′ and b′ depend on Nmax.

### Claim 13 (depends on 12)

The method of claim 12, wherein the auxiliary parameters a′ and b′ on the basis of the look-up table and the look-up table is:
Nmax
b′
a′
64
32.455
−0.87273
128
77.319
−1.2332
256
138.56
−1.1028
512
275.89
−1.1111
1024
572.83
−1.1649

### Claim 14 (depends on 12)

The method of claim 12, wherein the parameters a and b are determined on the basis of the auxiliary parameters a′ and b′ provided in the look-up table and the following equations:
a=R2a′,
b=R2b′.

### Claim 15

A non-transitory computer storage medium storing a program code, when the program code is executed by a computer, the program code causes the computer to perform:
(a) generating an auxiliary code sequence having Nmax/2 bit indices by removing bit indices greater than or equal to Nmax/2 from the code sequence S;
(b) removing from the auxiliary code sequence the last NR bit indices to generate a modified auxiliary code sequence, wherein NR denotes the number of removed bits and wherein the number of removed bits NR are determined on the basis of Nmax, N and a predefined code rate R; and
(c) generating the polar code of length N and dimension K by puncturing the original polar code on the basis of a puncturing set defined by the last p=Nmax−N bit indices of the modified auxiliary code sequence.

### Claim 16 (depends on 15)

The computer storage medium of claim 15, wherein the number of removed bits NR is determined on the basis of the following equation:
NR=round(ap+b),
wherein round( . . . ) denotes a rounding function and a and b denote parameters, which depend on Nmax and the predefined code rate R.

### Claim 17 (depends on 15)

The computer storage medium of claim 15, wherein the number of removed bits NR is determined on the basis of the following equation:
NR=max(0,round(ap+b)),
wherein round( . . . ) denotes a rounding function, max( . . . ) denotes the maximum function and a and b denote parameters, which depend on Nmax and the predefined code rate R.

### Claim 18 (depends on 16)

The computer storage medium of claim 16, wherein the parameters a and b are determined on the basis of a look-up table.

### Claim 19 (depends on 18)

The computer storage medium program of claim 18, wherein the parameters a and b are determined on the basis of auxiliary parameters a′ and b′ provided in the look-up table and the following equations:
a=f(R)a′,
b=f(R)b′,
wherein f(R) denotes a function of the predefined code rate R and wherein the auxiliary parameters a′ and b′ depend on Nmax.

### Claim 20 (depends on 19)

The computer storage medium of claim 19, wherein the auxiliary parameters a′ and b′ on the basis of the look-up table and the look-up table is:
Nmax
b′
a′
64
32.455
−0.87273
128
77.319
−1.2332
256
138.56
−1.1028
512
275.89
−1.1111
1024
572.83
−1.1649

### Claim 21 (depends on 20)

The computer storage medium of claim 20, wherein the parameters a and b are determined on the basis of the auxiliary parameters a′ and b′ provided in the look-up table and the following equations:
a=R2a′,
b=R2b′.
