# US 2026/0088931 A1 · Method and apparatus for generating code blocks in communication system

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

- Number: US 2026/0088931 A1
- Document ID: US20260088931A1
- Status: Published application
- Kind: A1
- Application number: 19/337,575
- Filed: 2025-09-23
- Published: 2026-03-26
- Earliest claimed: 2024-09-25
- Assignees: Electronics and Telecommunications Research Institute
- Applicants: Electronics and Telecommunications Research Institute
- Inventors: Giyoon PARK; Seokki KIM; Eun-Jeong SHIN; Nam II KIM
- Web page: https://patentgrep.com/patent/US20260088931A1

## CPC

- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method of a transmitter may comprise: generating a transport block; generating a plurality of first code blocks from the transport block; generating a plurality of second code blocks by encoding the plurality of first code blocks; generating byte-aligned third code blocks by selecting coded bits from encoded bits of each of the plurality of second code blocks; and concatenating the third code blocks.

## Claims

### Claim 1

A method of a transmitter, comprising:
generating a transport block;
generating a plurality of first code blocks from the transport block;
generating a plurality of second code blocks by encoding the plurality of first code blocks;
generating byte-aligned third code blocks by selecting coded bits from encoded bits of each of the plurality of second code blocks; and
concatenating the third code blocks.

### Claim 2 (depends on 1)

The method of claim 1, wherein the generating of the plurality of second code blocks comprises: performing low density parity check (LDPC) encoding on the plurality of first code blocks to generate the plurality of second code blocks.

### Claim 3 (depends on 1)

The method of claim 1, further comprising: before the generating of the plurality of second code blocks, adding cyclic redundancy check (CRC) parity bits to each of the plurality of first code blocks.

### Claim 4 (depends on 1)

The method of claim 1, wherein the generating of the byte-aligned third code blocks comprises: selecting the coded bits based on at least one of a redundancy version index, a limited buffer rate matching (LBRM) index, or an LBRM transport block size.

### Claim 5 (depends on 1)

The method of claim 1, further comprising: after the generating of the byte-aligned third code blocks, interleaving bits of each of the plurality of third code blocks to generate an interleaved plurality of third code blocks.

### Claim 6 (depends on 1)

The method of claim 1, wherein the generating of the byte-aligned third code blocks comprises: dividing G coded bits to make the third code blocks byte-aligned, wherein G is a positive integer.

### Claim 7 (depends on 6)

The method of claim 6, wherein the dividing of the G coded bits comprises:
calculating a temporary intermediate value N that is a divisor of G;
calculating a multiplication factor u to make a multiple of an alignment unit M by multiplying the temporary intermediate value N;
selecting γ0 first base bits from the G coded bits and equally distributing the first base bits to C third code blocks;
selecting γ1 second base bits from first remaining bits obtained by subtracting the first base bits from the coded bits, and equally distributing the second base bits to code blocks having a non-dominant number of bits; and
distributing second remaining bits obtained by subtracting the second base bits from the first remaining bits to a last third code block,
wherein C is a number of the plurality of third code blocks and is a positive integer, and N, M, u, γ0, and γ1 are positive integers.

### Claim 8 (depends on 7)

The method of claim 7, wherein the calculating of the temporary intermediate value N comprises: calculating the temporary intermediate value N as a product of a modulation order and a number of transmission layers to which the transport block is mapped.

### Claim 9 (depends on 7)

The method of claim 7, wherein the calculating of the multiplication factor u comprises: calculating the multiplication factor u using M/gcd(M,N), where gcd is a greatest common divisor of two inputs.

### Claim 10 (depends on 7)

The method of claim 7, wherein C is determined based on a code block group transmission information (CBGTI) field included in downlink control information (DCI), when the CBGTI field is present in the DCI.

### Claim 11 (depends on 1)

The method of claim 1, further comprising: transmitting at least one concatenated code block to a receiver.

### Claim 12

A transmitter comprising a processor, wherein the processor causes the transmitter to perform:
generating a transport block;
generating a plurality of first code blocks from the transport block;
generating a plurality of second code blocks by encoding the plurality of first code blocks;
generating byte-aligned third code blocks by selecting coded bits from encoded bits of each of the plurality of second code blocks; and
concatenating the third code blocks.

### Claim 13 (depends on 12)

The transmitter of claim 12, wherein in the generating of the plurality of second code blocks, the processor causes the transmitter to perform: performing low density parity check (LDPC) encoding on the plurality of first code blocks to generate the plurality of second code blocks.

### Claim 14 (depends on 12)

The transmitter of claim 12, wherein the processor further causes the transmitter to perform: before the generating of the plurality of second code blocks, adding cyclic redundancy check (CRC) parity bits to each of the plurality of first code blocks.

### Claim 15 (depends on 12)

The transmitter of claim 12, wherein in the generating of the byte-aligned third code blocks, the processor causes the transmitter to perform: selecting the coded bits based on at least one of a redundancy version index, a limited buffer rate matching (LBRM) index, or an LBRM transport block size.

### Claim 16 (depends on 12)

The transmitter of claim 12, wherein the processor further causes the transmitter to perform: after the generating of the byte-aligned third code blocks, interleaving bits of each of the plurality of third code blocks to generate an interleaved plurality of third code blocks.

### Claim 17 (depends on 12)

The transmitter of claim 12, wherein in the generating of the byte-aligned third code blocks, the processor causes the transmitter to perform: dividing G coded bits to make the third code blocks byte-aligned, wherein G is a positive integer.

### Claim 18 (depends on 12)

The transmitter of claim 12, wherein in the dividing of the G coded bits, the processor causes the transmitter to perform:
calculating a temporary intermediate value N that is a divisor of G;
calculating a multiplication factor u to make a multiple of an alignment unit M by multiplying the temporary intermediate value N;
selecting γ0 first base bits from the G coded bits and equally distributing the first base bits to C third code blocks;
selecting γ1 second base bits from first remaining bits obtained by subtracting the first base bits from the coded bits, and equally distributing the second base bits to code blocks having a non-dominant number of bits; and
distributing second remaining bits obtained by subtracting the second base bits from the first remaining bits to a last third code block,
wherein C is a number of the plurality of third code blocks and is a positive integer, and N, M, u, γ0, and γ1 are positive integers.

### Claim 19 (depends on 18)

The transmitter of claim 18, wherein in the calculating of the temporary intermediate value N, the processor causes the transmitter to perform: calculating the temporary intermediate value N as a product of a modulation order and a number of transmission layers to which the transport block is mapped.

### Claim 20 (depends on 18)

The transmitter of claim 18, wherein in the calculating of the multiplication factor u, the processor causes the transmitter to perform: calculating the multiplication factor u using M/gcd(M,N), where gcd is a greatest common divisor of two inputs.
