# US 2025/0096957 A1 · Information transmission method and apparatus

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

- Number: US 2025/0096957 A1
- Document ID: US20250096957A1
- Status: Published application
- Kind: A1
- Application number: 18/959,118
- Filed: 2024-11-25
- Published: 2025-03-20
- Earliest claimed: 2022-05-26
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Ke Liu; Xianbin Wang; Huazi Zhang; Jiajie Tong; Rong Li; Jun Wang
- Web page: https://patentgrep.com/patent/US20250096957A1

## CPC

- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 5/0001: {Arrangements for dividing the transmission path (two-way operation using the same type of signal, i.e. duplex H04L5/14)}
- H04L 1/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- H04L 1/1607: Details of the supervisory signal
- H04L 1/1671: {the supervisory signal being transmitted together with control information}
- H04L 1/18: Automatic repetition systems, e.g. Van Duuren systems
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments of this application provide an information transmission method and an apparatus. The transmit end sends a first coded bit sequence based on a to-be-transmitted coded bit sequence. The receive end receives and decodes a first to-be-decoded sequence, and sends first indication information if the decoding fails, where the first indication information includes information about a location, in the to-be-transmitted coded bit sequence, of at least one sent coded bit in the to-be-transmitted coded bit sequence. The transmit end receives the first indication information, and sends a second coded bit sequence based on the first indication information, where the second coded bit sequence includes the at least one sent coded bit in the to-be-transmitted coded bit sequence and/or at least one unsent coded bit in the to-be-transmitted coded bit sequence.

## Claims

### Claim 1

An information transmission method, comprising:
sending, by a first communication apparatus, a first coded bit sequence based on a to-be-transmitted coded bit sequence, wherein the to-be-transmitted coded bit sequence comprises the first coded bit sequence;
receiving, by the first communication apparatus, first indication information, wherein the first indication information comprises information about a location, in the to-be-transmitted coded bit sequence, of at least one sent coded bit in the to-be-transmitted coded bit sequence; and
sending, by the first communication apparatus, a second coded bit sequence based on the first indication information, wherein the to-be-transmitted coded bit sequence comprises the second coded bit sequence, and the second coded bit sequence comprises the at least one sent coded bit in the to-be-transmitted coded bit sequence and/or at least one unsent coded bit in the to-be-transmitted coded bit sequence.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising:
retransmitting, by the first communication apparatus, a coded bit sequence at least once based on the to-be-transmitted coded bit sequence, wherein
the first coded bit sequence is an initially transmitted coded bit sequence, and the second coded bit sequence is a coded bit sequence retransmitted for the first time; or the first coded bit sequence is a coded bit sequence retransmitted for the (q−1)th time, and the second coded bit sequence is a coded bit sequence retransmitted for the qth time, wherein q is a positive integer greater than 1.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the information about the location is an index value of the location of the at least one sent coded bit in the to-be-transmitted coded bit sequence.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the information about the location is indication information of at least one resource sub-segment corresponding to the at least one sent coded bit, and the at least one resource sub-segment is located in a resource segment corresponding to the to-be-transmitted coded bit sequence.

### Claim 5 (depends on 1)

The method according to claim 1, wherein a proportion of sent coded bits in the second coded bit sequence does not exceed a preset value δ.

### Claim 6 (depends on 1)

The method according to claim 1, wherein a quantity of at least one sent coded bit in the second coded bit sequence meets the following condition:
n
k
″
=
{
0
,
0
>
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
⌊
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
⌋
,
0
≤
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
≤
n
k
n
k
,
n
k
<
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
,
n″k is the quantity of the at least one sent coded bit in the to-be-transmitted coded bit sequence comprised in the second coded bit sequence, Nk−1 represents a quantity of coded bits sent by the first communication apparatus before the second coded bit sequence, N″k−1 represents a quantity of coded bits repeatedly sent by the first communication apparatus before the second coded bit sequence, nk is a quantity of coded bits comprised in the second coded bit sequence, and δ′ is a threshold corresponding to a proportion of repeatedly sent coded bits in all coded bit sequences sent by the first communication apparatus based on the to-be-transmitted coded bit sequence, wherein the proportion of repeatedly sent coded bits in all the coded bit sequences sent by the first communication apparatus based on the to-be-transmitted coded bit sequence does not exceed δ′.

### Claim 7 (depends on 6)

The method according to claim 6, wherein δ′ is greater than or equal to a preset threshold.

### Claim 8

An information transmission method, comprising:
receiving, by a second communication apparatus, a first to-be-decoded sequence, wherein the first to-be-decoded sequence is a sequence formed by a first coded bit sequence transmitted through a channel, wherein the first coded bit sequence is sent by a first communication apparatus based on a to-be-transmitted coded bit sequence;
decoding, by the second communication apparatus, the first to-be-decoded sequence;
determining, by the second communication apparatus, first indication information if the decoding fails, wherein the first indication information comprises information about a location, in the to-be-transmitted coded bit sequence, of at least one sent coded bit in the to-be-transmitted coded bit sequence;
sending, by the second communication apparatus, the first indication information; and
receiving, by the second communication apparatus, a second to-be-decoded sequence, wherein the second to-be-decoded sequence is a sequence formed by a second coded bit sequence transmitted through a channel, wherein the second coded bit sequence is sent by the first communication apparatus based on the first indication information.

### Claim 9 (depends on 8)

The method according to claim 8, wherein the first coded bit sequence is a coded bit sequence initially transmitted by the first communication apparatus, and the second coded bit sequence is a coded bit sequence retransmitted by the first communication apparatus for the first time; or the first coded bit sequence is a coded bit sequence retransmitted by the first communication apparatus for the (q−1)th time, and the second coded bit sequence is a coded bit sequence retransmitted by the first communication apparatus for the qth time, wherein q is a positive integer greater than 1.

### Claim 10 (depends on 8)

The method according to claim 8, wherein the information about the location is an index value of the location of the at least one sent coded bit in the to-be-transmitted coded bit sequence.

### Claim 11 (depends on 10)

The method according to claim 10, wherein the method further comprises:
obtaining, by the second communication apparatus, a log-likelihood ratio LLR sequence corresponding to the first to-be-decoded sequence, wherein an LLR in the LLR sequence corresponds to a coded bit in the to-be-transmitted coded bit sequence; and
the determining, by the second communication apparatus, first indication information comprises:
determining, by the second communication apparatus, the first n″k LLRs with smaller amplitudes from the LLR sequence, wherein n″k is a positive integer, and n″k coded bits corresponding to the n″k LLRs are the at least one sent coded bit in the to-be-transmitted coded bit sequence; and
determining, by the second communication apparatus, the first indication information based on locations of the n″k coded bits corresponding to the n″k LLRs in the to-be-transmitted coded bit sequence.

### Claim 12 (depends on 8)

The method according to claim 8, wherein the information about the location is information about at least one resource sub-segment corresponding to the at least one sent coded bit, and the at least one resource sub-segment is located in a resource segment corresponding to the to-be-transmitted coded bit sequence.

### Claim 13 (depends on 12)

The method according to claim 12, wherein the method further comprises:
obtaining, by the second communication apparatus, a channel estimation result corresponding to the first to-be-decoded sequence, wherein a channel estimation value in the channel estimation result corresponds to a coded bit in the to-be-transmitted coded bit sequence; and
the determining, by the second communication apparatus, first indication information comprises:
determining, by the second communication apparatus based on the channel estimation result, a channel estimation average value corresponding to each resource sub-segment in the resource segment corresponding to the to-be-transmitted coded bit sequence;
determining, by the second communication apparatus, M resource sub-segments with smaller channel estimation average values from the resource segment corresponding to the to-be-transmitted coded bit sequence, wherein M is a positive integer; and
determining, by the second communication apparatus, the first indication information based on the M resource sub-segments.

### Claim 14 (depends on 8)

The method according to claim 8, wherein a proportion of sent coded bits in the second coded bit sequence does not exceed a preset value δ.

### Claim 15 (depends on 8)

The method according to claim 8, wherein a quantity of at least one sent coded bit in the second coded bit sequence meets the following condition:
n
k
″
=
{
0
,
0
>
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
⌊
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
⌋
,
0
≤
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
≤
n
k
n
k
,
n
k
<
δ
′
(
N
k
-
1
+
n
k
)
-
N
k
-
1
″
1
+
δ
′
,
wherein
n″k is the quantity of at least one sent coded bit in the to-be-transmitted coded bit sequence comprised in the second coded bit sequence, Nk−1 represents a quantity of coded bits sent by the first communication apparatus before the second coded bit sequence, N″k−1 represents a quantity of coded bits repeatedly sent by the first communication apparatus before the second coded bit sequence, nk is a quantity of coded bits comprised in the second coded bit sequence, and δ′ is a threshold corresponding to a proportion of repeatedly sent coded bits in all coded bit sequences sent by the first communication apparatus based on the to-be-transmitted coded bit sequence, wherein the proportion of repeatedly sent coded bits in all the coded bit sequences sent by the first communication apparatus based on the to-be-transmitted coded bit sequence does not exceed δ′.

### Claim 16 (depends on 15)

The method according to claim 15, wherein δ′ is greater than or equal to a preset threshold.

### Claim 17

An information transmission method, comprising:
sending, by a first communication apparatus, a third coded bit sequence;
receiving, by the first communication apparatus, a first decoding result;
determining, by the first communication apparatus based on the first decoding result and an information bit in the third coded bit sequence, a coded bit that encounters a decoding error from the third coded bit sequence;
determining, by the first communication apparatus, at least one coded bit in the third coded bit sequence based on the coded bit that encounters a decoding error; and
sending, by the first communication apparatus, second indication information, wherein the second indication information comprises information about a location of the at least one coded bit.

### Claim 18 (depends on 17)

The method according to claim 17, wherein the determining, by the first communication apparatus, at least one coded bit in the third coded bit sequence based on the coded bit that encounters a decoding error comprises:
when a quantity of coded bits that encounter a decoding error is less than T, using, by the first communication apparatus, the coded bit that encounters a decoding error as the at least one coded bit; or
when a quantity of coded bits that encounter a decoding error is greater than or equal to T, selecting, by the first communication apparatus, T coded bits from the coded bits that encounter a decoding error, and using the T coded bits as the at least one coded bit, wherein
T is a preset threshold.

### Claim 19 (depends on 18)

The method according to claim 18, wherein the second indication information further comprises an indicator bit; and
when the quantity of coded bits that encounter a decoding error is less than T, a value of the indicator bit is a first value; or
when the quantity of coded bits that encounter a decoding error is greater than or equal to T, a value of the indicator bit is a second value, wherein
the first value is different from the second value.

### Claim 20 (depends on 17)

The method according to claim 17, further comprising:
setting T to a maximum value that enables
N
-
1
≥
log
2
⁢
∑
i
=
1
T
⁢
(
k
i
)
to be true, wherein N is an information bit length of the second indication information, and k is a quantity of information bits in a first coded bit sequence.
