# US 11,310,000 B2 · Transport block segmentation for multi-level codes

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

- Number: US 11,310,000 B2
- Document ID: US11310000B2
- Status: Granted
- Kind: B2
- Application number: 16/336,823
- Filed: 2017-09-29
- Published: 2021-09-16
- Granted: 2022-04-19
- Earliest claimed: 2016-09-29
- Assignees: Cohere Technologies, Inc.
- Applicants: Cohere Technologies, Inc.
- Inventors: Christian Ibars Casas; Shachar Kons; Ronny Hadani
- Web page: https://patentgrep.com/patent/US11310000B2

## CPC

- H04L 1/246: {two-level transmission codes, e.g. binary}
- H03M 13/251: {with block coding}
- H03M 13/255: {with Low Density Parity Check [LDPC] codes}
- H03M 13/256: {with trellis coding, e.g. with convolutional codes and TCM}
- H03M 13/258: {with turbo codes, e.g. Turbo Trellis Coded Modulation [TTCM]}
- H03M 13/27: using interleaving techniques
- H03M 13/29: combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/6362: {by puncturing}
- 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

A wireless communication method for transmitting wireless signals from a transmitter includes dividing bits of the transport block into a number of code blocks, wherein each code block corresponds to a bit-level of a multi-level modulation scheme used for transmission, and wherein a size of each code block is inversely proportional to a corresponding coding rate used for coding the code block.

## Claims

### Claim 1

A wireless communication method of wireless communication in which data is transmitted in units of transport blocks, comprising:
dividing bits of a transport block into a plurality of code blocks, wherein each code block of the plurality of code blocks corresponds to a bit-level of a multi-level modulation scheme used for transmission, and wherein a size of each code block is inversely proportional to a corresponding coding rate used for coding the code block;
processing the plurality of code blocks to generate an output signal; and
transmitting the output signal.

### Claim 2 (depends on 1)

The method of claim 1, wherein processing the plurality of code blocks includes:
resizing, based on a maximum size of a code block of the plurality of code blocks, each code block to generate a plurality of resized code blocks; and
generating the output signal using the plurality of resized code blocks.

### Claim 3 (depends on 2)

The method of claim 2, wherein the resizing operation includes:
further dividing each code block into a smaller size that is less than the maximum size to generate the plurality of resized code blocks.

### Claim 4 (depends on 2)

The method of claim 2, wherein the maximum size is equal to 6144 bits.

### Claim 5 (depends on 2)

The method of claim 2, wherein the maximum size is equal to 8448 bits.

### Claim 6 (depends on 1)

The method of claim 1, wherein the multi-level modulation scheme includes an M-level amplitude modulation scheme, and wherein a number of the plurality of code blocks, C, is C=½ log2 M.

### Claim 7 (depends on 6)

The method of claim 6, wherein the size of each code block satisfies a condition:
2
⁢
⌈
K
1
+
L
2
⁢
R
1
⌉
=
2
⁢
⌈
K
2
+
L
2
⁢
R
2
⌉
=
…
=
2
⁢
⌈
K
C
+
L
2
⁢
R
C
⌉
wherein Ki represents a size of ith code block, L represents a size of a cyclic redundancy code and Ri represents a corresponding code rate used for processing the ith code block.

### Claim 8 (depends on 1)

The method of claim 1, wherein the operation of dividing bits of the transport block includes stuffing filler bits such that a same number of symbols are used for each bit level.

### Claim 9 (depends on 1)

The method of claim 1, wherein the processing the plurality of code blocks to generate the output signal includes performing in-phase and quadrature modulation on the plurality of code blocks.

### Claim 10 (depends on 1)

The method of claim 1, wherein the operation of processing the plurality of code blocks to generate the output signal includes:
concatenating the plurality of code blocks to generate a concatenated code block sequence; and
interleaving the concatenated code block sequence to generate an interleaved concatenated code block sequence, wherein the interleaving is performed at each bit level; and
mapping the interleaved concatenated code block sequence to a QAM constellation.

### Claim 11

A wireless data transmission apparatus, comprising
a first circuit at which data is received for transmission over a network;
a second circuit which organizes the data into a plurality of code blocks;
a processor that processes the plurality of code blocks to generate a quadrature amplitude modulation (QAM)-modulated output signal; and
a transmitter circuit that transmits the QAM-modulated output signal,
wherein sizes of the plurality of code blocks are selected such that at least one code block per bit level of a multi-level encoding is used, wherein each of the plurality of code blocks has a size less than or equal to a maximum size, wherein a size of each code block is inversely proportional to a corresponding coding rate used for coding the code block, and wherein coded bit levels occupy a same number of QAM symbols.

### Claim 12 (depends on 11)

The apparatus of claim 11, the processing the plurality of code blocks includes:
resizing, selectively based on a maximum size of a code block of the plurality of code blocks, the each code block to generate a plurality of resized code blocks; and
using the plurality of resized code blocks to generate the output signal.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the resizing operation includes:
further dividing each code block into a smaller size that is less than the maximum size to generate the plurality of resized code blocks.

### Claim 14 (depends on 12)

The apparatus of claim 12, wherein the maximum size is equal to 6144 bits.

### Claim 15 (depends on 12)

The apparatus of claim 12, wherein the maximum size is equal to 8448 bits.

### Claim 16 (depends on 11)

The apparatus of claim 11, wherein the plurality of code blocks corresponds to a multi-level modulation scheme that includes an M-level quadrature amplitude modulation scheme, and wherein a number of the plurality of code blocks, C, is equal to C=½ log2 M.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein the size of each code block satisfies a condition:
2
⁢
⌈
K
1
+
L
2
⁢
R
1
⌉
=
2
⁢
⌈
K
2
+
L
2
⁢
R
2
⌉
=
…
=
2
⁢
⌈
K
C
+
L
2
⁢
R
C
⌉
where Ki represents a size of ith code block, L represents a size of a cyclic redundancy code and Ri represents a corresponding code rate used for processing the ith code block.

### Claim 18 (depends on 11)

The apparatus of claim 11, wherein the operation of organizing the data includes stuffing filler bits such that a same number of symbols are used for each bit level.

### Claim 19 (depends on 11)

The apparatus of claim 11, wherein the processing the plurality of code blocks to generate the output signal includes performing in-phase and quadrature modulation on the plurality of code blocks.

### Claim 20 (depends on 11)

The apparatus of claim 11, wherein the operation of processing the plurality of code blocks to generate the output signal includes:
concatenating the plurality of code blocks to generate a concatenated code block sequence; and
interleaving the concatenated code block sequence to generate an interleaved concatenated code block sequence, wherein the interleaving is performed at each bit level; and
mapping the interleaved concatenated code block sequence to a QAM constellation.