# US 2023/0056892 A1 · Method and device for transmitting data

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

- Number: US 2023/0056892 A1
- Document ID: US20230056892A1
- Status: Published application
- Kind: A1
- Application number: 17/896,298
- Filed: 2022-08-26
- Published: 2023-02-23
- Earliest claimed: 2017-03-25
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Gongzheng ZHANG; Yourui HuangFu; Lingchen HUANG; Ying CHEN; Yunfei QIAO; Rong LI
- Web page: https://patentgrep.com/patent/US20230056892A1

## CPC

- H04W 28/04: Error control
- H04L 1/0013: {Rate matching, e.g. puncturing or repetition of code symbols}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0068: {by puncturing}
- H04L 1/0069: {Puncturing patterns}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments of the application provide a method for transmitting data in a wireless communication network. A device of the network receives a bit sequence of K information bits. The device polar codes the bit sequence to obtain a first encoded sequence, wherein a length of the first encoded sequence is N, and N is greater than or equal to K. The device block interleaves the first encoded sequence to obtain an interleaved bit sequence. The device determines a transmission code rate R. When the transmission code rate R is less than the code rate threshold, the device outputs a second bit sequence. The length of the second bit sequence is M, M is smaller than N. The second bit sequence is punctured from the interleaved bit sequence by removing (N-M) bits from beginning of the interleaved bit sequence.

## Claims

### Claim 1

A communication apparatus, comprising one or more processors and one or more memories storing program instructions; wherein when the program instructions are executed by the one or more processors, the communication apparatus is configured to:
obtain a bit sequence, wherein the bit sequence comprises K bits of information, and K is a positive integer;
encode the bit sequence to obtain a first encoded sequence, wherein the first encoded sequence comprises N bits, N is greater than or equal to K, and N is an integer power of 2;
divide the first encoded sequence into S bit groups that are of equal length, wherein S is a positive integer;
interleave the first encoded sequence in bit groups based on a symmetrical sequence to obtain an interleaved bit sequence of N bits;
obtain a target code length M, wherein M is a positive integer; and
perform rate matching on the interleaved bit sequence to obtain and output a second bit sequence of M bits.

### Claim 2 (depends on 1)

The communication apparatus according to claim 1, wherein
when N<M, the rate matching manner is repetition; or
when N>M and a transmission code rate K/M is less than a code rate threshold, the rate matching is puncturing; or
when N>M and the transmission code rate K/M is greater than the code rate threshold, the rate matching is shortening.

### Claim 3 (depends on 2)

The communication apparatus according to claim 2, wherein a value of the code rate threshold is any one of the following:
0, 1/4, 1/3, 2/5, 1/2, or 1.

### Claim 4 (depends on 1)

The communication apparatus according to claim 1, wherein S=32.

### Claim 5 (depends on 1)

The communication apparatus according to claim 1, wherein the symmetrical sequence comprises a sequence, Sequence, wherein an ith element of the Sequence, Sequence (i), satisfies:
Sequence (i)=S-1-Sequence (S-1-i) and 0<=i<S.

### Claim 6 (depends on 5)

The communication apparatus according to claim 5, wherein:
if S=16, the symmetrical sequence is [0, 1, 2, 4, 8, 3, 5, 6, 9, 10, 12, 7, 11, 13, 14, 15];
if S=32, the symmetrical sequence is one of the following sequences:
[0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31], or
[0,1,2,4,8,16,3,5,6,9,10,12,17,18,20,24,7,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31], or
[0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31]; or
if S=64, the symmetrical sequence is one of the following sequences:
[0, 1, 2, 4, 8, 16, 3, 32, 5, 6, 9, 10, 17, 12, 18, 33, 20, 34, 7, 24, 36, 11, 40, 13, 19, 14, 48, 21, 35, 22, 25, 37, 26, 38, 41, 28, 42, 15, 49, 44, 50, 23, 52, 27, 39, 56, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 31, 60, 47, 55, 59, 61, 62, 63], or
[0, 1, 2, 4, 8, 16, 32, 3, 5, 6, 9, 10, 12, 17, 18, 20, 24, 33, 34, 36, 40, 48, 7, 11, 13, 14, 19, 21, 22, 25, 26, 28, 35, 37, 38, 41, 42, 44, 49, 50, 52, 56, 15, 23, 27, 29, 30, 39, 43, 45, 46, 51, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63], or
[0, 1, 2, 4, 8, 16, 3, 32, 5, 6, 9, 10, 17, 12, 18, 33, 20, 34, 7, 24, 36, 11, 40, 13, 48, 19, 14, 21, 35, 22, 25, 37, 26, 38, 28, 41, 42, 49, 44, 15, 23, 50, 52, 27, 39, 56, 29, 30, 43, 45, 51, 46, 53, 54, 57, 31, 58, 60, 47, 55, 59, 61, 62, 63].

### Claim 7 (depends on 1)

The communication apparatus according to claim 1, wherein the communication apparatus is a microchip, or a base station, or a user terminal.

### Claim 8

A method for processing data by a communication apparatus, comprising:
obtaining a bit sequence, wherein the bit sequence comprises K bits of information, and K is a positive integer;
encoding the bit sequence to obtain a first encoded sequence, wherein the first encoded sequence comprises N bits, N is greater than or equal to K, and N is an integer power of 2;
dividing the first encoded sequence into S bit groups that are of equal length, wherein S is a positive integer;
interleaving the first encoded sequence in bit groups based on a symmetrical sequence to obtain an interleaved bit sequence of N bits;
obtaining a target code length M, wherein M is a positive integer; and
performing rate matching on the interleaved bit sequence to obtain and output a second bit sequence of M bits.

### Claim 9 (depends on 8)

The method according to claim 8, wherein:
when N<M, the rate matching manner is repetition; or
when N>M and a transmission code rate K/M is less than a code rate threshold, the rate matching is puncturing; or
when N>M and the transmission code rate K/M is greater than the code rate threshold, the rate matching is shortening.

### Claim 10 (depends on 9)

The method according to claim 9, wherein a value of the code rate threshold is any one of the following:
0, 1/4, 1/3, 2/5, 1/2, or 1.

### Claim 11 (depends on 8)

The method according to claim 8, wherein S=32.

### Claim 12 (depends on 8)

The method according to claim 8, wherein the symmetrical sequence comprises a sequence, Sequence, wherein an ith element of the Sequence, Sequence (i), satisfies:
Sequence (i) =S-1-Sequence (S-1-i) and 0<=i<S.

### Claim 13 (depends on 12)

The method according to claim 12, wherein:
if S=16, the symmetrical sequence is [0, 1, 2, 4, 8, 3, 5, 6, 9, 10, 12, 7, 11, 13, 14, 15];
if S=32, the symmetrical sequence is one of the following sequences:
[0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31], or
[0,1,2,4,8,16,3,5,6,9,10,12,17,18,20,24,7,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31], or
[0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31]; or
if S=64, the symmetrical sequence is one of the following sequences:
[0, 1, 2, 4, 8, 16, 3, 32, 5, 6, 9, 10, 17, 12, 18, 33, 20, 34, 7, 24, 36, 11, 40, 13, 19, 14, 48, 21, 35, 22, 25, 37, 26, 38, 41, 28, 42, 15, 49, 44, 50, 23, 52, 27, 39, 56, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 31, 60, 47, 55, 59, 61, 62, 63], or
[0, 1, 2, 4, 8, 16, 32, 3, 5, 6, 9, 10, 12, 17, 18, 20, 24, 33, 34, 36, 40, 48, 7, 11, 13, 14, 19, 21, 22, 25, 26, 28, 35, 37, 38, 41, 42, 44, 49, 50, 52, 56, 15, 23, 27, 29, 30, 39, 43, 45, 46, 51, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63], or
[0, 1, 2, 4, 8, 16, 3, 32, 5, 6, 9, 10, 17, 12, 18, 33, 20, 34, 7, 24, 36, 11, 40, 13, 48, 19, 14, 21, 35, 22, 25, 37, 26, 38, 28, 41, 42, 49, 44, 15, 23, 50, 52, 27, 39, 56, 29, 30, 43, 45, 51, 46, 53, 54, 57, 31, 58, 60, 47, 55, 59, 61, 62, 63].

### Claim 14 (depends on 8)

The method according to claim 8, wherein the communication apparatus is a microchip, or a base station, or a user terminal.

### Claim 15

A non-transitory computer-readable storage medium, configured to store computer instructions, when the computer instructions are executed in a computer, the computer is enabled to:
obtain a bit sequence, wherein the bit sequence comprises K bits of information, and K is a positive integer;
encode the bit sequence to obtain a first encoded sequence, wherein the first encoded sequence comprises N bits, N is greater than or equal to K, and N is an integer power of 2;
divide the first encoded sequence into S bit groups that are of equal length, wherein S is a positive integer;
interleave the first encoded sequence in bit groups based on a symmetrical sequence, to obtain an interleaved bit sequence of N bits;
obtain a target code length M, wherein M is a positive integer; and
perform rate matching on the interleaved bit sequence to obtain and output a second bit sequence of M bits.

### Claim 16 (depends on 15)

The non-transitory computer-readable storage medium according to claim 15, wherein:
when N<M, the rate matching manner is repetition; or
when N>M, and a transmission code rate K/M is less than a code rate threshold, the rate matching is puncturing; or
when N>M and the transmission code rate K/M is greater than the code rate threshold, the rate matching is shortening.

### Claim 17 (depends on 16)

The non-transitory computer-readable storage medium according to claim 16, wherein a value of the code rate threshold is any one of the following:
0, 1/4, 1/3, 2/5, 1/2, or 1.

### Claim 18 (depends on 15)

The non-transitory computer-readable storage medium according to claim 15, wherein S=32.

### Claim 19 (depends on 15)

The non-transitory computer-readable storage medium according to claim 15, wherein the symmetrical sequence comprises a sequence, Sequence, wherein an ith element of the Sequence, Sequence (i), satisfies:
Sequence (i)=S-1-Sequence (S-1-i) and 0<=i<S.

### Claim 20 (depends on 19)

The non-transitory computer-readable storage medium according to claim 19, wherein:
if S=16, the symmetrical sequence is [0, 1, 2, 4, 8, 3, 5, 6, 9, 10, 12, 7, 11, 13, 14, 15];
if S=32, the symmetrical sequence is one of the following sequences:
[0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31], or
[0,1,2,4,8,16,3,5,6,9,10,12,17,18,20,24,7,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31], or
[0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31]; or
if S=64, the symmetrical sequence is one of the following sequences:
[0, 1, 2, 4, 8, 16, 3, 32, 5, 6, 9, 10, 17, 12, 18, 33, 20, 34, 7, 24, 36, 11, 40, 13, 19, 14, 48, 21, 35, 22, 25, 37, 26, 38, 41, 28, 42, 15, 49, 44, 50, 23, 52, 27, 39, 56, 29, 43, 30, 45, 51, 46, 53, 54, 57, 58, 31, 60, 47, 55, 59, 61, 62, 63], or
[0, 1, 2, 4, 8, 16, 32, 3, 5, 6, 9, 10, 12, 17, 18, 20, 24, 33, 34, 36, 40, 48, 7, 11, 13, 14, 19, 21, 22, 25, 26, 28, 35, 37, 38, 41, 42, 44, 49, 50, 52, 56, 15, 23, 27, 29, 30, 39, 43, 45, 46, 51, 53, 54, 57, 58, 60, 31, 47, 55, 59, 61, 62, 63], or
[0, 1, 2, 4, 8, 16, 3, 32, 5, 6, 9, 10, 17, 12, 18, 33, 20, 34, 7, 24, 36, 11, 40, 13, 48, 19, 14, 21, 35, 22, 25, 37, 26, 38, 28, 41, 42, 49, 44, 15, 23, 50, 52, 27, 39, 56, 29, 30, 43, 45, 51, 46, 53, 54, 57, 31, 58, 60, 47, 55, 59, 61, 62, 63].