# US 2026/0269977 A1 · Data sending method, data receiving method, and communication apparatus

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

- Number: US 2026/0269977 A1
- Document ID: US20260269977A1
- Status: Published application
- Kind: A1
- Application number: 19/661,845
- Filed: 2026-04-29
- Published: 2026-09-10
- Earliest claimed: 2021-06-29
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Zhiyuan Tan; Pengpeng Dong; Huiying Zhu
- Web page: https://patentgrep.com/patent/US20260269977A1

## CPC

- H04L 1/0041: {Arrangements at the transmitter end}
- H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M 13/3761: {using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0065: {Serial concatenated codes}
- H04L 1/08: by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)}
- H04L 1/1819: {with retransmission of additional or different redundancy}
- H04W 28/04: Error control
- H03M 13/373: {with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes}
- H03M 13/47: Error detection, forward error correction or error protection, not provided for in groups H03M13/01 - H03M13/37
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H04L 1/0075: {Transmission of coding parameters to receiver (H04L1/0023 takes precedence)}
- H04L 1/0076: {Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022)}
- 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)
- 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 sending solution based on a maximum latency constraint T is provided. A transmitting end sends (T+B) data blocks, where first T data blocks are original data blocks, last B data blocks are B encoded data blocks, and a quantity of encoded data packets in the encoded data block is flexible and controllable. A receiving end only needs to perform joint decoding on a specific quantity of encoded data packets and a correct data packet in an incorrect data block, to recover an incorrect data packet in the incorrect data block. The solution in this application can meet a requirement of a maximum latency T, and can reduce a quantity of encoded data packets. The solution may be applied to an XR service or another service that has a low-latency requirement.

## Claims

### Claim 1

An apparatus, comprising at least one processor, configured to perform the following:
obtaining an (i+T)th data block, wherein the (i+T)th data block comprises an original data packet and an encoded data packet, the encoded data packet is obtained by encoding the original data packet in the (i+T)th data block and an original data packet in an ith data block, T represents a quantity of time units of a maximum latency allowed for the original data packet in the ith data block, and one data block is transmitted in one time unit; and
sending the (i+T)th data block.

### Claim 2 (depends on 1)

The apparatus according to claim 1, wherein that the encoded data packet is obtained by encoding the original data packet in the (i+T)th data block and an original data packet in an ith data block comprises:
the encoded data packet is obtained by encoding the original data packet in the (i+T)th data block, the original data packet in the ith data block, and an original data packet or original data packets in one or more data blocks between the ith data block and the (i+T)th data block.

### Claim 3 (depends on 1)

The apparatus according to claim 1, wherein the at least one processor is configured to perform the following:
receiving feedback information that is for an (i+T−1)th data block and that is from a receiving end, wherein the feedback information indicates that the ith data block is incorrectly decoded, and indicates a quantity of encoded data packets required for correctly decoding the ith data block; and
determining, based on the feedback information, that the ith data block is incorrectly decoded, wherein
the encoded data packet in the (i+T)th data block is obtained by encoding the original data packet in the ith data block and the original data packet in the (i+T)th data block.

### Claim 4 (depends on 1)

The apparatus according to claim 1, wherein the at least one processor is configured to perform the following:
receiving feedback information that is for an (i+T−1)th data block and that is from a receiving end, wherein the feedback information indicates that the ith data block is correctly decoded, and indicates quantities of incorrect original data packets and incorrect encoded data packets in the (i+T−1)th data block;
determining, based on the feedback information, that the ith data block is correctly decoded; and
determining an association depth w of the (i+T)th data block and a quantity of encoded data packets based on the feedback information, wherein
the encoded data packet in the (i+T)th data block is obtained by encoding the original data packet in the (i+T)th data block, an original data packet in an (i+T-w+1)th data block, and an original data packet or original data packets in one or more data blocks between the (i+T)th data block and the (i+T−w+1)th data block.

### Claim 5

An apparatus, comprising at least one processor, configured to perform the following
receiving an (i+T)th data block, wherein the (i+T)th data block comprises an original data packet and an encoded data packet, the encoded data packet and a first data packet set satisfy a coding relationship, the first data packet set comprises the original data packet in the (i+T)th data block and an original data packet in an ith data block, T represents a quantity of time units of a maximum latency allowed for the original data packet in the ith data block, and one data block is transmitted in one time unit; and
performing decoding based on the (i+T)th data block in combination with the ith data block, to recover the original data packet in the ith data block, or recover the original data packet in the ith data block and the original data packet in the (i+T)th data block.

### Claim 6 (depends on 5)

The apparatus according to claim 5, wherein the encoded data packet is obtained by encoding the original data packet in the (i+T)th data block, the original data packet in the ith data block, and an original data packet or original data packets in one or more data blocks between the ith data block and the (i+T)th data block.

### Claim 7 (depends on 5)

The apparatus according to claim 5, wherein the at least one processor is configured to perform the following:
determining that the ith data block is incorrectly decoded; and
sending feedback information for an (i+T−1)th data block, wherein the feedback information indicates that the ith data block is incorrectly decoded, and indicates a quantity of encoded data packets required for correctly decoding the ith data block.

### Claim 8 (depends on 5)

The apparatus according to claim 5, wherein the at least one processor is configured to perform the following:
determining that the ith data block is correctly decoded; and
sending feedback information for an (i+T−1)th data block, wherein the feedback information indicates that the ith data block is correctly decoded, and indicates quantities of incorrect original data packets and incorrect encoded data packets in the (i+T−1)th data block.

### Claim 9

An apparatus, comprising at least one processor, configured to perform the following
obtaining T first data blocks, wherein an ith first data block in the T first data blocks comprises ki original data packets, and versions of original data packets comprised in the T first data blocks are first redundancy versions;
encoding original data packets comprised in last (T−B) first data blocks in the T first data blocks, to obtain B second data blocks;
performing, in a finite field, addition on original data packets in the B second data blocks and B third data blocks, to obtain B fourth data blocks, wherein the B third data blocks are first B first data blocks in the T first data blocks, versions of original data packets comprised in the B third data blocks are second redundancy versions of original data packets comprised in the first B first data blocks, and a quantity of original data packets in an ith third data block in the B third data blocks is equal to a quantity of data packets in an ith second data block in the B second data blocks; and
sending the T first data blocks and the B fourth data blocks, wherein T and B are both positive integers.
