# US 2018/0026754 A1 · Method for realizing sending of hybrid automatic repeat request information, and data receiving end

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

- Number: US 2018/0026754 A1
- Document ID: US20180026754A1
- Status: Published application
- Kind: A1
- Application number: 15/547,593
- Filed: 2016-02-01
- Published: 2018-01-25
- Earliest claimed: 2015-01-30
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Shuqiang XIA
- Web page: https://patentgrep.com/patent/US20180026754A1

## CPC

- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 1/1861: {Physical mapping arrangements (for ACK signaling see also H04L5/0053)}
- H04L 5/0055: {Physical resource allocation for ACK/NACK (for physical mapping arrangements in ARQ protocols H04L1/1861)}
- H04L 5/14: Two-way operation using the same type of signal, i.e. duplex
- H04L 5/1469: {using time-sharing}
- H04W 84/042: {Public Land Mobile systems, e.g. cellular systems}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method is described for sending of Hybrid Automatic Repeat reQuest (HARQ) information, and a data receiving end. The method includes: a data receiving end sends HARQ information determined through detection results for received transport blocks to a data sending end according to the number of scheduling resources and the feedback number of expected maximum feedback Acknowledgements (ACK). The number of bits of HARQ is determined by the number of scheduling resources and the feedback number, and HARQ information is determined according to the detection results for the received transport blocks, and feedback is conducted on the determined number of bits of the HARQ.

## Claims

### Claim 1

A method for sending of Hybrid Automatic Repeat reQuest (HARQ) information, comprising:
sending, by a data receiving end, HARQ information to a data sending end according to a number of scheduling resources and a feedback number of expected maximum feedback Acknowledgements (ACKs), wherein the HARQ information is determined through detection results for received transport blocks.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the sending HARQ information to a data sending end according to a number of scheduling resources and a feedback number of expected maximum feedback ACKs, wherein the HARQ information is determined through detection results for received transport blocks comprises:
determining, by the data receiving end, the number of bits of HARQ according to the number of scheduling resources and the feedback number of expected maximum feedback ACKs; and
determining, by the data receiving end, HARQ information according to the detection results for the received transport blocks, and sending the HARQ information to the data sending end by using the determined number of bits of HARQ;
wherein the feedback number is M, and the number of scheduling resources is N; and the N is a positive integer greater than or equal to 3, and the M is a positive integer less than the N.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the M is a value pre-determined by the data receiving end and the data sending end.

### Claim 4 (depends on 2)

The method according to claim 2, wherein the M is:
a maximum value greater than or equal to the number of scheduling resources used for receiving the transport blocks by the data receiving end, or,
a maximum value greater than or equal to the number of scheduling resources used for sending the transport blocks by the data sending end.

### Claim 5 (depends on 1)

The method according to claim 1, wherein
M
<
⌊
N
-
1
2
⌋
,
wherein └ ┘ represents round-down.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the number of bits of HARQ is K, K=┌log2(Σi=0M(CNi)┐, wherein ┌ ┐ represents round-up.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the feedback number of expected maximum feedback ACKs is sent to the data receiving end in a signaling mode.

### Claim 8 (depends on 1)

The method according to claim 1, further comprising: determining, by the data receiving end, the number of scheduling resources and/or the feedback number of expected maximum feedback ACKs according to resource configuration information.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the determining, by the data receiving end, HARQ information according to the detection results for the received transport blocks comprises:
detecting, by the data receiving end, the received transport blocks, and taking scheduling resource index information corresponding to detection results indicating ACKs or NACKs as the determined HARQ information.

### Claim 10 (depends on 6)

The method according to claim 6, further comprising: when the detection results are that the number of ACKs is Q and a scheduling resource index corresponding to an ith ACK or NACK is Si,
mapping scheduling resource indexes corresponding to different detection results indicating ACKs or NACKs to an integer r, and sending r, served as the determined HARQ information, to the data sending end; wherein
when
0
≤
Q
≤
M
,
r


is

:


(
∑
i
=
0
Q
-
1

(
C
N
i
+
C
N
-
S
i
Q
-
i
)
+
⌊
Q
M
⌋
+
C
)

mod

(
2
K
-
1
)


or

(
∑
i
=
0
Q
-
1

(
C
N
i
+
C
N
-
S
i
Q
-
i
)
+
⌊
Q
N
⌋
+
C
)

mod

(
2
K
-
1
)
,
wherein N scheduling resource indexes are 1, 2, . . . , N, and Si is a positive integer mutually different in a monotonic function, and
iε[0, 1, . . . , and C is an integer constant; and
when Q>M, randomly selecting, by the data receiving end, M scheduling resource indexes from {S0, S1 . . . SQ-1}, wherein the M randomly-selected scheduling resource indexes are: D0, D1 . . . DM-1, and Di is a positive integer mutually different in a monotonic function; and
mapping the M scheduling resource indexes to an integer r, and sending the integer r, served as the determined HARQ information, to the data sending end,
wherein r is: (Σi=0M-1(CNi+CN-DiM-i)+C)mod(2K−1),
wherein the randomly selecting, by the data receiving end, M scheduling resource indexes from {S0, S1 . . . SQ-1} comprises:
selecting, by the data receiving end, M scheduling resource indexes from {S0, S1 . . . SQ-1} according to a scheduling resource index selection range pre-determined by the data sending end and the data receiving end; or
wherein the randomly selecting, by the data receiving end, M scheduling resource indexes from {S0, S1, . . . SQ-1} comprises:
selecting, by the data receiving end, M minimum or maximum scheduling resource indexes from {S0, S1 . . . SQ-1} according to a scheduling resource index selection range pre-determined by the data sending end and the data receiving end.

### Claim at position 11

11-13. (canceled)

### Claim 14 (depends on 3)

The method according to claim 3, further comprising: when Q≦M and M is greater than or equal to 2,
determining, by the data receiving end, that the number of bits of HARQ information to be fed back is K according to N and M, wherein K≧┌log2(N−M+2)┐+M−1.

### Claim 15 (depends on 14)

The method according to claim 14, further comprising: after determining that the number of bits of HARQ information to be fed back is K,
mapping scheduling resource indexes corresponding to different detection results indicating ACKs or an NACKs to an integer r, and sending r, served as the determined HARQ information, to the data sending end;
wherein r is: (R+C1)mod(2K-1);
wherein
R
=
2
M
-
1
*
(
u
-
1
)
+
(
∑
i
=
g

(
u
)
Q
-
1

2
Vi
)
+
g

(
u
)
-
1
+
⌈
Q
M
⌉
,
u=min(s0,N−M+2);
g

(
u
)
=
{
1
,
u
≤
N
-
M
+
1
0
,
u
>
N
-
M
+
1
;
and
vi=(si−u−g(u)+C2)mod(M−1); and
C1 and C2 are integer constants.

### Claim 16 (depends on 10)

The method according to claim 10, further comprising:
representing the integer r by using K binary bits respectively, and sending the integer r to the data sending end;
and
further comprising: before the r is sent to the data sending end,
coding and/or modulating and/or interleaving the r.

### Claim 17

(canceled)

### Claim 18

A data receiving end for sending of Hybrid Automatic Repeat reQuest (HARQ) information, comprising: a determination unit and a feedback sending unit, wherein
the determination unit is configured to determine a number of bits of HARQ according to a number of scheduling resources and a feedback number of expected maximum feedback Acknowledgements (ACKs); and
the feedback sending unit is configured to determine HARQ information according to detection results for received transport blocks, and send the HARQ information to a data sending end by using the determined number of bits of HARQ;
wherein the feedback number is M, and the number of scheduling resources is N; and the N is a positive integer greater than or equal to 3, and the M is a positive integer less than the N.

### Claim 19 (depends on 18)

The data receiving end according to claim 18, further comprising a receiving unit, configured to receive the feedback number of expected maximum feedback ACKs sent in a signaling mode.

### Claim 20 (depends on 18)

The data receiving end according to claim 18, wherein the feedback sending unit is configured to,
detect the received transport blocks, and take scheduling resource index information corresponding to detection results indicating ACKs or NACKs as the determined HARQ information; and
send the HARQ information to the data sending end by the determined number of bits of HARQ to be fed back.

### Claim 21 (depends on 18)

The data receiving end according to claim 18, further comprising an information determination unit, configured to determine the number of scheduling resources and/or the feedback number of expected maximum feedback ACKs according to resource configuration information.

### Claim 22 (depends on 18)

The data receiving end according to claim 18, further comprising an index mapping unit, configured to, when the detection results are that the number of ACKs is Q and a scheduling resource index corresponding to an ith ACK is Si,
map scheduling resource indexes corresponding to different detection results indicating ACKs or NACKs to an integer r, and send r, served as the determined HARQ information, to the data sending end, such that the data sending end performs a query according to the value of r to obtain scheduling resource indexes corresponding to ACKs of detection results; and
map scheduling resource indexes corresponding to ACKs of different detection results to mutually-different integers r, and send r, served as the determined HARQ information, to the data sending end;
wherein when
0
≤
Q
≤
M
,
r


is

:


(
∑
i
=
0
Q
-
1

(
C
N
i
+
C
N
-
S
i
Q
-
i
)
+
⌊
Q
M
⌋
+
C
)

mod

(
2
K
-
1
)
,
or

(
∑
i
=
0
Q
-
1

(
C
N
i
+
C
N
-
S
i
Q
-
i
)
+
⌊
Q
N
⌋
+
C
)

mod

(
2
K
-
1
)
;
wherein N scheduling resource indexes are 1, 2, . . . , N, and Si is a positive integer mutually different in a monotonic function, and
iε[0, 1, . . . , and C is an integer constant; and
wherein the index mapping unit is further configured to,
when Q>M, randomly select M scheduling resource indexes from {S0, S1 . . . SQ-1}, wherein the M randomly-selected scheduling resource indexes are: D0, D1 . . . DM-1, and Di is a positive integer mutually different in a monotonic function; and
map the M scheduling resource indexes to a mutually-different integer r, and send the integer r, served as the determined HARQ information, to the data sending end,
wherein the r is: (Σi=0M-1(CNi+CN-DiM-i)+C)mod(2K-1),
wherein the index mapping unit is further configured to,
when Q>M, randomly select M scheduling resource indexes from {S0, S1 . . . SQ-1} according to a scheduling resource index selection range pre-determined by the data sending end and the data receiving end; or
wherein the index mapping unit is further configured to,
when Q>M, randomly select M maximum or minimum scheduling resource indexes from {S0, S1 . . . SQ-1} according to a scheduling resource index selection range pre-determined by the data sending end and the data receiving end;
or
the data receiving end further comprising an index mapping unit, configured to, after determining that the feedback number of bits of HARQ information is K,
map scheduling resource indexes corresponding to different detection results indicating ACKs or NACKs to an integer r, and send the r, served as the determined HARQ information, to the data sending end, such that the data sending end performs an query according to a value of r to obtain scheduling resource index corresponding to ACKs of the detection results;
wherein the r is: (R+C1)mod(2K-1);
wherein
R
=
2
M
-
1
*
(
u
-
1
)
+
(
∑
i
=
g

(
u
)
Q
-
1

2
Vi
)
+
g

(
u
)
-
1
+
⌈
Q
M
⌉
;
u=min(s0,N−M+2);
g

(
u
)
=
{
1
,
u
≤
N
-
M
+
1
0
,
u
>
N
-
M
+
1
;
and
vi=(si−u−g(u)+C2)mod(M−1); and
C1 and C2 are integer constants.

### Claim at position 21

23-26. (canceled)

### Claim 27 (depends on 1)

A computer storage medium in which a computer-executable instruction is stored, wherein the computer-executable instruction is used for executing the method according to claim 1.

### Claim 28 (depends on 15)

The method according to claim 15, further comprising:
representing the integer r by using K binary bits respectively, and sending the integer r to the data sending end;
and
further comprising: before the r is sent to the data sending end,
coding and/or modulating and/or interleaving the r.