# US 11,909,417 B2 · Data processing method and device

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

- Number: US 11,909,417 B2
- Document ID: US11909417B2
- Status: Granted
- Kind: B2
- Application number: 17/825,567
- Filed: 2022-05-26
- Published: 2022-11-24
- Granted: 2024-02-20
- Earliest claimed: 2017-01-09
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Saijin Xie; Jun Xu; Jin Xu; Mengzhu Chen
- Web page: https://patentgrep.com/patent/US11909417B2

## CPC

- H03M 13/136: {Reed-Muller [RM] codes}
- H03M 13/091: {Parallel or block-wise CRC computation}
- H03M 13/13: Linear codes
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0061: {Error detection codes}
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take 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)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A data processing method and apparatus. The data process method includes: determining, by a transmitting node, a code block length N0 for encoding an information bit sequence to be transmitted according to a data characteristic for representing the information bit sequence to be transmitted and a preset parameter corresponding to the data characteristic; performing, by the transmitting node, polar encoding on the information bit sequence to be transmitted according to the code block length N0; and transmitting, by the transmitting node, a code block obtained through the polar encoding to a receiving node.

## Claims

### Claim 1

A method, comprising:
determining, by a transmitting node, a code block length N0 for polar encoding of an information bit sequence according to a data characteristic, wherein the data characteristic comprises a link direction, the link direction comprising a downlink direction or an uplink direction;
determining, by the transmitting node, a code block number C according to the code block length N0 and a practical code block length N, wherein the code block length N0 satisfies a generation matrix of the polar encoding Gn0=F⊗n0, where ⊗ denotes a kronecker power,
F
=
[
1
0
1
1
]
,
n0 is a positive integer, and n0=log2N0;
generating one or more code blocks according to the code block length N0 by performing, by the transmitting node, the polar encoding of the information bit sequence; and
transmitting, by the transmitting node, the one or more code blocks obtained through performing the polar encoding.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining, by the transmitting node, the code block number C according to a fixed increment Δ, and wherein:
when N>N0+Δ, the transmitting node performs code block segmentation on the information bit sequence, and the code block number is C=2, and
when N≤N0+Δ, the code block number is C=1, and the code block segmentation is not performed.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
determining, by the transmitting node prior to performing the polar encoding, the code block number C according to a length of the information bit sequence, wherein when K is the length of the information bit sequence, and Kmax is a length of a preset maximum information bit sequence:
when K>Kmax the transmitting node performs code block segmentation on the information bit sequence, and C=2; and
when K<Kmax, the code block number is C=1, and the code block segmentation is not performed.

### Claim 4 (depends on 1)

The method of claim 1, wherein the data characteristic comprises a channel type, the channel type comprising a physical downlink control channel (PDCCH), a physical broadcast channel (PBCH), or a physical uplink control channel (PUCCH).

### Claim 5 (depends on 1)

The method of claim 1, comprising performing, by the transmitting node, the polar encoding on the information bit sequence according to the code block number C, which comprises:
when the code block number is C=2, dividing, by the transmitting node, the information bit sequence into C vector segments; performing the polar encoding on each of the C vector segments to obtain a code block of length C*N0; and determining M bits from the code block of length C*N0 to obtain a code block with a length of M bits.

### Claim 6 (depends on 5)

The method of claim 5, wherein the dividing, by the transmitting node, the information bit sequence into the C vector segments comprises:
equally dividing, by the transmitting node, the information bit sequence into C sub-information bit sequences.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
concatenating, by the transmitting node after processing the information bit sequence to obtain the C code blocks, the C code blocks by:
interleaving each of the C code blocks, and connecting the interleaved C code blocks end to end.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
dividing, by the transmitting node prior to processing the information bit sequence to obtain the C code blocks, the information bit sequence into C information bit sequences; and
performing cyclic redundancy check (CRC) encoding on each of the C information bit sequences.

### Claim 9

A transmitting node, comprising:
at least one processor configured to:
determine a code block length No for polar encoding of an information bit sequence according to a data characteristic, wherein the data characteristic comprises a link direction, the link direction comprising a downlink direction or an uplink direction;
determine a code block number C according to the code block length No and a practical code block length N, wherein the code block length No satisfies a generation matrix of the polar encoding Gn0=F⊗n0, where ⊗ denotes a kronecker power,
F
=
[
1
0
1
1
]
,
n0 is a positive integer, and n0=log2N0;
generate one or more code blocks according to the code block length No by performing, by the transmitting node, the polar encoding of the information bit sequence; and
transmit, via a transmitter, the one or more code blocks obtained through performing the polar encoding.

### Claim 10 (depends on 9)

The transmitting node of claim 9, wherein the at least one processor is configured to:
determine the code block number C according to a fixed increment Δ, and wherein:
when N>N0+Δ, the at least one processor configured to perform code block segmentation on the information bit sequence, and the code block number is C=2, and
when N≤N0+Δ, the code block number is C=1, and the code block segmentation is not performed.

### Claim 11 (depends on 9)

The transmitting node of claim 9, wherein the at least one processor is configured to:
determine, prior to performing the polar encoding, the code block number C according to a length of the information bit sequence, wherein when K is the length of the information bit sequence, and Kmax is a length of a preset maximum information bit sequence:
when K>Kmax the at least one processor configured to perform code block segmentation on the information bit sequence, and C=2; and
when K<Kmax, the code block number is C=1, and the code block segmentation is not performed.

### Claim 12 (depends on 9)

The transmitting node of claim 9, wherein the data characteristic comprises a channel type, the channel type comprising a physical downlink control channel (PDCCH), a physical broadcast channel (PBCH), or a physical uplink control channel (PUCCH).

### Claim 13 (depends on 9)

The transmitting node of claim 9, wherein the at least one processor is configured to perform the polar encoding on the information bit sequence according to the code block number C, which comprises:
when the code block number is C=2, dividing the information bit sequence into C vector segments; performing the polar encoding on each of the C vector segments to obtain a code block of length C*N0; and determining M bits from the code block of length C*N0 to obtain a code block with a length of M bits.

### Claim 14 (depends on 13)

The transmitting node of claim 13, wherein the at least one processor is configured to divide the information bit sequence into the C vector segments, which comprises:
equally dividing the information bit sequence into C sub-information bit sequences.

### Claim 15 (depends on 9)

The transmitting node of claim 9, wherein the at least one processor is configured to:
concatenate, after processing the information bit sequence to obtain the C code blocks, the C code blocks by:
interleaving each of the C code blocks, and connecting the interleaved C code blocks end to end.

### Claim 16 (depends on 9)

The transmitting node of claim 9, wherein the at least one processor is configured to:
divide, prior to processing the information bit sequence to obtain the C code blocks, the information bit sequence into C information bit sequences; and
perform cyclic redundancy check (CRC) encoding on each of the C information bit sequences.

### Claim 17

A method, comprising:
receiving, by a receiving node, one or more code blocks obtained through performing polar encoding,
wherein the one or more code blocks are generated according to a code block length N0 by performing the polar encoding of an information bit sequence, the code block length N0 is determined according to a data characteristic, and a code block number C is determined according to the code block length N0 and a practical code block length N, wherein the data characteristic comprises a link direction, the link direction comprising a downlink direction or an uplink direction, wherein the code block length N0 satisfies a generation matrix of the polar encoding Gn0=F⊗n0, where ⊗ denotes a kronecker power,
F
=
[
1
0
1
1
]
,
n0 is a positive integer, and n0=log2N0.

### Claim 18

A receiving node, comprising:
at least one processor configured to receive, via a receiver, one or more code blocks obtained through performing polar encoding,
wherein the one or more code blocks are generated according to a code block length N0 by performing the polar encoding of an information bit sequence, the code block length N0 is determined according to a data characteristic, and a code block number C is determined according to the code block length No and a practical code block length N, wherein the data characteristic comprises a link direction, the link direction comprising a downlink direction or an uplink direction, wherein the code block length N0 satisfies a generation matrix of the polar encoding Gn0=F⊗n0, where ⊗ denotes a kronecker power,
F
=
[
1
0
1
1
]
,
n0 is a positive integer, and n0=log2N0.