# US 2019/0173499 A1 · Information processing method, device, and communications system

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

- Number: US 2019/0173499 A1
- Document ID: US20190173499A1
- Status: Published application
- Kind: A1
- Application number: 16/262,921
- Filed: 2019-01-31
- Published: 2019-06-06
- Earliest claimed: 2017-01-05
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co.,Ltd.
- Inventors: Chen Zheng; Liang Ma; Jie Xiong; Xin Zeng; Xiaojian Liu; Yuejun Wei
- Web page: https://patentgrep.com/patent/US20190173499A1

## CPC

- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/1148: {Structural properties of the code parity-check or generator matrix}
- H03M 13/6306: {Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy (H03M13/3761, H03M13/3769 and H03M13/635 take precedence)}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0061: {Error detection codes}
- H04L 1/0063: {Single parity check}
- H04L 1/18: Automatic repetition systems, e.g. Van Duuren systems
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/1874: {Buffer management}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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

This application discloses an information processing method. A communication device obtains an input sequence. The input sequence has a quantity B of information bits. The communication devices transforms the input sequence into one or more code blocks. The communication device encodes each of the code blocks individually, to obtain one or more encoded code blocks. Each of the code blocks has a code block length less than or equal to a maximum code block length. Each of the code blocks includes a segment of the input sequence and may include one or more cyclic redundancy check (CRC) bits corresponding to the segment of the input sequence. The encoded code blocks can meet various channel coding requirements.

## Claims

### Claim 1

An information processing method in a communication system, comprising:
obtaining, by a communication device, an input sequence, wherein the input sequence comprises a quantity B of information bits, and B≥1;
transforming, by the communication device, the input sequence into a quantity C of code blocks, wherein C is an integer greater than or equal to 1; and
encoding, by the communication device, each of the C code blocks individually, to obtain C encoded code blocks;
wherein each of the C code blocks has a code block length less than or equal to a maximum code block length of Z bits;
wherein each of the C code blocks comprises a segment of the input sequence and a quantity L of cyclic redundancy check (CRC) bits corresponding to the segment of the input sequence; and
wherein L is greater than or equal to 0.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the quantity of code blocks C is determined by:
C=┌B/(Z−L)┐,
where ┌x┐ represents rounding number x to upper integer;
wherein at least one of the C code blocks comprises a quantity K3 of bits, K3 is a combined length of the segment of the input sequence and the L CRC bits, and K3 is determined by:
K3=┌(B+C·L)/C┐.

### Claim 3 (depends on 2)

The method according to claim 2, wherein when (B+C·L) is divisible by C, each of the C code blocks comprises K3 bits.

### Claim 4 (depends on 2)

The method according to claim 2, wherein the code block(s) comprising K3 bits further comprise(s) a quantity F3 of filler bit(s), F3 is greater than 0, and
F3+K3=I3,
wherein I3 is a minimum value of code block lengths greater than K3 in a code block length set.

### Claim 5 (depends on 2)

The method according to claim 2, wherein the code block(s) comprising K3 bits further comprise(s) a quantity F3 of filler bit(s), F3 is greater than 0, and
F3+K3=I3,
wherein I3 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum value in lifting factors greater than or equal to ┌K3/X┐.

### Claim 6 (depends on 2)

The method according to claim 2, wherein the code block(s) comprising K3 bits further comprise(s) a quantity F3 of filler bit(s), F3 is greater than 0, and
F3+K3=I3,
wherein I3 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum lifting factor that makes I3 meet I3≥K3.

### Claim 7 (depends on 4)

The method according to claim 4, wherein in the code block(s) comprising K3 bits, the F3 filler bit(s) is/are placed after the L CRC bits.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the quantity of code blocks C is determined by:
C=┌B/(Z−L)┐,
where ┌x┐ represents rounding number x to upper integer;
wherein when (B+C·L) is divisible by C, at least one of the C code blocks comprises a quantity K3 of bits, K3 is a combined length of the segment of the input sequence and the L CRC bits, and K3 is determined by:
K3=(B+C·L)/C.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the quantity of code blocks C is determined by:
C=┌B/(Z−L)┐,
where ┌x┐ represents rounding number x to upper integer;
wherein at least one of the C code blocks comprises a quantity K4 of bits, K4 is a combined length of the segment of the input sequence and the L CRC bits, and K4 is determined by:
K4=└(B+C·L)/C┘,
where └x┘ represents rounding number x to lower integer.

### Claim 10 (depends on 9)

The method according to claim 9, wherein the code block(s) comprising K4 bits further comprise(s) a quantity F4 of filler bit(s), F4 is greater than 0, and
F4+K4=I4,
wherein I4 is a minimum value of code block lengths greater than K4 in a code block length set.

### Claim 11 (depends on 9)

The method according to claim 9, wherein the code block(s) comprising K4 bits further comprise(s) a quantity F4 of filler bit(s), F4 is greater than 0, and
F4+K4=I4,
wherein I4 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum value in lifting factors greater than or equal to ┌K4/X┐.

### Claim 12 (depends on 9)

The method according to claim 9, wherein the code block(s) comprising K4 bits further comprise(s) a quantity F4 of filler bit(s), F4 is greater than 0, and
F4+K4=I4,
wherein I4 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum lifting factor that makes I4 meet I4≥K4.

### Claim 13 (depends on 1)

The method according to claim 1, wherein the code block length equals to a product of a lifting factor z and a quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks.

### Claim 14 (depends on 1)

The method according to claim 1, wherein L=24.

### Claim 15 (depends on 1)

The method according to claim 1, wherein when B≤Z, C=1.

### Claim 16 (depends on 1)

The method according to claim 1, wherein when B≤Z, C=1 and L=0.

### Claim 17

An apparatus, comprising:
a memory configured to store program instructions; and
a processor coupled to the memory and configured to execute the program instructions;
wherein, when executed by the processor, the program instructions cause the apparatus to:
obtain an input sequence, wherein the input sequence comprises a quantity B of information bits, and B≥1;
transform the input sequence into a quantity C of code blocks, wherein C is an integer greater than or equal to 1; and
encode each of the C code blocks individually, to obtain C encoded code blocks;
wherein each of the C code blocks has a code block length less than or equal to a maximum code block length of Z bits;
wherein each of the C code blocks comprises a segment of the input sequence and a quantity L of cyclic redundancy check (CRC) bits corresponding to the segment of the input sequence; and
wherein L is greater than or equal to 0.

### Claim 18 (depends on 17)

The apparatus according to claim 17, wherein the quantity of code blocks C is determined by:
C=┌B/(Z−L)┐,
where ┌x┐ represents rounding number x to upper integer;
wherein at least one of the C code blocks comprises a quantity K3 of bits, K3 is a combined length of the segment of the input sequence and the L CRC bits, and K3 is determined by:
K3=┌(B+C·L)/C┐.

### Claim 19 (depends on 18)

The apparatus according to claim 18, wherein when (B+C·L) is divisible by C, each of the C code blocks comprises K3 bits.

### Claim 20 (depends on 18)

The apparatus according to claim 18, wherein the code block(s) comprising K3 bits further comprise(s) a quantity F3 of filler bit(s), F3 is greater than 0, and
F3+K3=I3,
wherein I3 is a minimum value of code block lengths greater than K3 in a code block length set.

### Claim 21 (depends on 18)

The apparatus according to claim 18, wherein the code block(s) comprising K3 bits further comprise(s) a quantity F3 of filler bit(s), F3 is greater than 0, and
F3+K3=I3,
wherein I3 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum value in lifting factors greater than or equal to ┌K3/X┐.

### Claim 22 (depends on 18)

The apparatus according to claim 18, wherein the code block(s) comprising K3 bits further comprise(s) a quantity F3 of filler bit(s), F3 is greater than 0, and
F3+K3=I3,
wherein I3 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum lifting factor that makes I3 meet I3≥K3.

### Claim 23 (depends on 20)

The apparatus according to claim 20, wherein the code block(s) comprising K3 bits, the F3 filler bit(s) is/are placed after the L CRC bits.

### Claim 24 (depends on 17)

The apparatus according to claim 17, wherein the quantity of code blocks C is determined by:
C=┌B/(Z−L)┐,
wherein when (B+C·L) is divisible by C, at least one of the C code blocks comprises a quantity K3 of bits, K3 is a combined length of the segment of the input sequence and the L CRC bits, and K3 is determined by:
K3=(B+C·L)/C.

### Claim 25 (depends on 17)

The apparatus according to claim 17, wherein the quantity of code blocks C is determined by:
C=┌B/(Z−L)┐,
where ┌x┐ represents rounding number x to upper integer;
wherein at least one of the C code blocks comprises a quantity K4 of bits, K4 is a combined length of the segment of the input sequence and the L CRC bits, and K4 is determined by:
K4=└(B+C·L)/C┘,
where ┌x┐ represents rounding number x to lower integer.

### Claim 26 (depends on 25)

The apparatus according to claim 25, wherein the code block(s) comprising K4 bits further comprise(s) a quantity F4 of filler bit(s), F4 is greater than 0, and
F4+K4=I4,
wherein I4 is a minimum value of code block lengths greater than K4 in a code block length set.

### Claim 27 (depends on 25)

The apparatus according to claim 25, wherein the code block(s) comprising K4 bits further comprise(s) a quantity F4 of filler bit(s), F4 is greater than 0, and
F4+K4=I4,
wherein I4 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum value in lifting factors greater than or equal to ┌K4/X┐.

### Claim 28 (depends on 25)

The apparatus according to claim 25, wherein the code block(s) comprising K4 bits further comprise(s) a quantity F4 of filler bit(s), F4 is greater than 0, and
F4+K4=I4,
wherein I4 is a product of a lifting factor z and a value X;
wherein X is quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks; and
wherein the lifting factor z is a minimum lifting factor that makes I4 meet I4≥K4.

### Claim 29 (depends on 17)

The apparatus according to claim 17, wherein the code block length equals to a product of a lifting factor z and a quantity of information-bit-columns in a low-density parity-check (LDPC) base matrix for encoding each of the code blocks.

### Claim 30 (depends on 17)

The apparatus according to claim 17, wherein L=24.
