# US 2018/0027525 A1 · Resource Allocation Method and Device and Information Feedback Method and Device

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

- Number: US 2018/0027525 A1
- Document ID: US20180027525A1
- Status: Published application
- Kind: A1
- Application number: 15/546,008
- Filed: 2016-02-01
- Published: 2018-01-25
- Earliest claimed: 2015-01-30
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Shuqiang XIA; Wen ZHANG; Bo DAI; Jing SHI; Huiying FANG; Xianming CHEN; Kun LIU
- Web page: https://patentgrep.com/patent/US20180027525A1

## CPC

- H04L 5/0055: {Physical resource allocation for ACK/NACK (for physical mapping arrangements in ARQ protocols H04L1/1861)}
- H04W 72/04: Wireless resource allocation
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 1/1861: {Physical mapping arrangements (for ACK signaling see also H04L5/0053)}
- H04L 1/1896: {ARQ related signaling}
- H04W 28/06: Optimizing {the usage of the radio link}, e.g. header compression, information sizing {, discarding information (system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365)}
- H04L 5/0091: {Signalling for the administration of the divided path, e.g. signalling of configuration information}
- H04W 4/70: Services for machine-to-machine communication [M2M] or machine type communication [MTC]
- 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

Provided are a resource allocation method and device and an information feedback method and device. The resource allocation method includes: a resource allocation sending end sends information about resources allocated to a resource allocation receiving end to the resource allocation receiving end through a first portion and a second portion of total indication amount Q bits, the first portion contains first indication amount Q1 bits, and the second portion contains second indication amount Q2 bits, the number of resources allocated to the resource allocation receiving end is K, resource indexes corresponding to the K resources are Si, i∈[0, 1, 2 . . . K−1], Si<Si+1, 1≦K≦M, and M is the number of virtual continuous resources allowed to be allocated by the resource allocation receiving end.

## Claims

### Claim 1

A resource allocation method, comprising:
Sending, by a resource allocation sending end, information about resources allocated to a resource allocation receiving end to the resource allocation receiving end through a first portion and a second portion of total indication amount Q bits,
wherein the first portion contains first indication amount Q1 bits and the second portion contains second indication amount Q2 bits,
a number of resources allocated to the resource allocation receiving end is K, resource indexes corresponding to the K resources are Si, i∈[0, 1, 2 . . . K−1], Si<Si+1, 1≦K≦M, and M is a number of virtual continuous resources allowed to be allocated by the resource allocation receiving end.

### Claim 2 (depends on 1)

The method according to claim 1, wherein,
the M virtual continuous resources are any virtual continuous resources in resources with a total number of N,
wherein resource indexes of the resources with the total number of N are sequentially 0, 1 . . . N−1, and M is a positive integer greater than or equal to 2.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the step of sending information about resources allocated to a resource allocation receiving end to the resource allocation receiving end through a first portion and a second portion of total indication amount Q bits comprises:
determining values of the first indication amount Q1 bits of the first portion and values of the second indication amount Q2 bits of the second portion according to a smallest resource index S0 or a largest resource index SK−1; and
sending information about resources allocated to the resource allocation receiving end to the resource allocation receiving end through the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion,
and
the step of sending information about resources allocated to a receiving end to the receiving end comprises:
indicating that resources corresponding to bits with values which are 1 are the resources allocated to the resource allocation receiving end through the bits with values which are 1 in the second indication amount Q2 bits of the second portion.

### Claim 4 (depends on 3)

The method according to claim 3, wherein the step of determining values of the first indication amount Q1 bits of the first portion and values of the second indication amount Q2 bits of the second portion comprises:
predetermining the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion according to the smallest resource index S0; or
predetermining the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion according to the largest resource index SK−1.

### Claim 5 (depends on 3)

The method according to claim 3, wherein,
when S0≦N−M, the first portion is a first preset binary number corresponding to the resource index S0 and expressed by the first indication amount Q1 bits;
when S0≦N−M and K=1, the values of the second indication amount Q2 bits of the second portion are all 0;
when S0≦N−M and K>1, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being S0+1, S0+2 . . . S0+M−1 one to one, and when Si∈{S0+1, S0+2 . . . S0+M−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index S, is 1 and values of other bits are 0; and
when S0>N−M, the first portion is a second preset binary number expressed by the first indication amount Q1 bits; and
the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being N−M+1, N−M+2 . . . N−1 one to one, and when Si∈{N−M+1, N−M+2 . . . N−1}, i=0, 1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0,
wherein the first preset binary number is different from the second preset binary number.,
and,
the first preset binary number expressed by the first indication amount Q1 bits is ((S0+C) % (2Q1−1))binary,
wherein C is any integral constant.

### Claim 6

(canceled)

### Claim 7

(canceled)

### Claim 8

(canceled)

### Claim 9 (depends on 4)

The method according to claim 4, wherein a bit value of the first portion is a first preset binary number corresponding to the resource index S0 and expressed by the first indication amount Q1 bits; or a second preset binary number corresponding to the resource index SK−1 and expressed by the first indication amount Q1 bits,
and,
the first preset binary number is ((S0+C) % (2Q1−1))binary or (S0)binary;
the second preset binary number is ((SK−1+C) % (2Q1−1))binary or (SK−1)binary,
wherein C is any integral constant,
when the first preset binary number is ((S0+C) % (2Q1−1))binary, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being S0+1, S0+2 . . . S0+M−1 one to one, and when Si∈{S0+1, S0+2 . . . S0+M−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0; and
when the second preset binary number is ((SK−1+C) % (2Q1−1))binary, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being SK−1−1, SK−1−2 . . . SK−1−M+1 one to one, and when Si∈{SK−1−1, SK−1−2 . . . SK−1−M+1}, i=0, 1 . . . K−2, a value of the second portion corresponding to the resource index Si is 1 and values of other bits are 0,
and
when the first preset binary number is ((S0+C) % (2Q1−1))binary, for the other bits with values which are not 1 in the second indication amount Q2 bits of the second portion,
when S0+i>N−1, i=1, 2 . . . M−1, a value of a bit corresponding to S0+i is the first preset binary number; and
when the second preset binary number is ((SK−1+C) % (2Q1−1))binary, for the other bits with values which are not 1 in the second indication amount Q2 bits of the second portion,
when SK−1−1<0, i=1, 2 . . . M−1 a value of a bit corresponding to SK−1−1 is the second preset binary number.

### Claim 10

(canceled)

### Claim 11

(canceled)

### Claim 12

(canceled)

### Claim 13 (depends on 2)

The method according to claim 2, wherein,
the total indication amount Q is greater than or equal to ┌log2(N−M+2)┐+M−1; the first indication amount Q1 is greater than or equal to ┌log2 (N−M+2)┐; and the second indication amount Q2 is greater than or equal to M−1; or
the total indication amount Q is greater than or equal to ┌log2 (N)┐+M−1; the first indication amount Q1 is greater than or equal to ┌log2(N)┐; and the second indication amount Q2 is greater than or equal to M−1.

### Claim 14

(canceled)

### Claim 15

An information feedback method, comprising:
Sending, by a Hybrid Automatic Repeat Request, HARQ, information sending end, HARQ information through a first portion and a second portion of total feedback indication amount Q bits,
wherein the first portion contains first indication amount Q1 bits and the second portion contains second indication amount Q2 bits,
a number of detection results which are ACK in the HARQ information is K, 0≦K≦M, a resource index corresponding to an ith ACK is allocated to be Si, wherein i∈[0, 1, 2 . . . K−1], Si<Si+1 and M is a maximum number of virtual continuous resources about which HARQ information is allowed to be fed back by an HARQ information receiving end.

### Claim 16 (depends on 15)

The method according to claim 15, wherein,
the M virtual continuous resources are any virtual continuous resources in resources with a total number of N,
wherein resource indexes of the resources with the total number of N are sequentially 0, 1 . . . N−1, and M is a positive integer greater than or equal to 2.

### Claim 17 (depends on 16)

The method according to claim 16, wherein the step of sending Hybrid Automatic Repeat Request, HARQ, information through a first portion and a second portion of total indication amount Q bits comprises:
according to a resource index S0 corresponding to a 0th ACK or a resource index SK−1 corresponding to a (K−1)th ACK,
determining values of the first indication amount Q1 bits of the first portion and values of the second indication amount Q2 bits of the second portion of the total feedback indication amount Q bits; and
sending HARQ information through the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion.

### Claim 18

(canceled)

### Claim 19 (depends on 17)

The method according to claim 17, wherein,
when K≠0 and S0≦N−M, the first portion is a fifth preset binary number corresponding to the resource index S0 and expressed by the first indication amount Q1 bits;
when K=1 and S0≦N−M, the values of the second indication amount Q2 bits of the second portion are all 0;
when K>1 and S0≦N−M, the values of the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being S0+1, S0+2 . . . S0+M−1 one to one, and when Si∈{S0+1, S0+2 . . . S0+M−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0;
when K≠0 and S0>N−M, the first portion is a sixth preset binary number expressed by the first indication amount Q1 bits;
when S0>N−M, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being N−M+1, N−M+2 . . . N−1 one to one, and when Si∈{N−M+1, N−M+2 . . . N−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0; and
when K=0, the first portion is a seventh preset binary number expressed by the first indication amount Q1 bits,
wherein every two of the fifth preset binary number, the sixth preset binary number and the seventh preset binary number are different,
and
the fifth preset binary number expressed by the first indication amount Q1 bits is ((S0+C) % (2Q1−1))binary or (S0)binary,
wherein C is any integral constant.

### Claim 20

(canceled)

### Claim 21

(canceled)

### Claim 22

(canceled)

### Claim 23

(canceled)

### Claim 24

(canceled)

### Claim 25

(canceled)

### Claim 26

(canceled)

### Claim 27

(canceled)

### Claim 28

(canceled)

### Claim 29

(canceled)

### Claim 30

(canceled)

### Claim 31

(canceled)

### Claim 32

(canceled)

### Claim 33

(canceled)

### Claim 34

(canceled)

### Claim 35

A resource allocation device, comprising: a determination indication unit, configured to send information about resources allocated to a resource allocation receiving end to the resource allocation receiving end through a first portion and a second portion of total indication amount Q bits,
wherein the first portion contains first indication amount Q1 bits and the second portion contains second indication amount Q2 bits,
a number of resources allocated to the resource allocation receiving end is K, resource indexes corresponding to the K resources are Si, i∈[0, 1, 2 . . . K−1], Si<Si+1, 1≦K≦M, and M is a number of virtual continuous resources allowed to be allocated by the resource allocation receiving end.

### Claim 36 (depends on 35)

The device according to claim 35, wherein the determination indication unit comprises a value determination module and a determination indication module, wherein,
the value determination module is configured to determine values of the first indication amount Q1 bits of the first portion and values of the second indication amount Q2 bits of the second portion according to a smallest resource index S0 or a largest resource index SK−1; and
the determination indication module is configured to send information about resources allocated to the resource allocation receiving end to the resource allocation receiving end through the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion,
and,
the determination indication module is configured to:
indicate that resources corresponding to bits with values which are 1 are the resources allocated to the resource allocation receiving end through the bits with values which are 1 in the second indication amount Q2 bits of the second portion.

### Claim 37 (depends on 36)

The device according to claim 36, wherein the value determination module is configured to:
predetermine the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion according to the smallest resource index S0; or
predetermine the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion according to the largest resource index SK−1.

### Claim 38 (depends on 36)

The device according to claim 36, wherein the value determination module is configured as that:
when S0≦N−M, the first portion is a first preset binary number corresponding to the resource index S0 and expressed by the first indication amount Q1 bits;
when S0≦N−M and K=1, the values of the second indication amount Q2 bits of the second portion are all 0;
when S0≦N−M and K>1, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being S0+1, S0+2 . . . S0+M−1 one to one, and when Si∈{S0+1, S0+2 . . . S0+M−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0; and
when S0>N−M, the first portion is a second preset binary number expressed by the first indication amount Q1 bits; and
the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being N−M+1, N−M+2 . . . N−1 one to one, and when Si∈{N−M+1, N−M+2 . . . N−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0,
wherein the first preset binary number is different from the second preset binary number.

### Claim 39

(canceled)

### Claim 40 (depends on 36)

The device according to claim 36, wherein the value determination module is configured as that:
a bit value of the first portion is a first preset binary number corresponding to the resource index S0 and expressed by the first indication amount Q1 bits; or a second preset binary number corresponding to the resource index SK−1 and expressed by the first indication amount Q1 bits,
and,
the value determination module is configured as that:
the first preset binary number is ((S0+C) % (2Q1−1))binary or (S0)binary;
the second preset binary number is ((SK−1+C) % (2Q1−1))binary or (SK−1)binary,
wherein C is any integral constant,
when the first preset binary number is ((S0+C) % (2Q1−1))binary, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being S0+1, S0+2 . . . S0+M−1 one to one, and when Si∈{S0+1, S0+2 . . . S0+M−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0; and
when the second preset binary number is ((SK−1+C) % (2Q1−1))binary, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being SK−1−1, SK−1−2 . . . SK−1−M+1 one to one, and when Si∈{SK−1+1, SK−1−2 . . . SK−1−M+1}, i=0, 1 . . . K−2, a value of the second portion corresponding to the resource index Si is 1 and values of other bits are 0.

### Claim 41

(canceled)

### Claim 42

(canceled)

### Claim 43

(canceled)

### Claim 44

An information feedback device, comprising a feedback indication unit,
configured to send Hybrid Automatic Repeat Request, HARQ, information through a first portion and a second portion of total feedback indication amount Q bits,
wherein the first portion contains first indication amount Q1 bits and the second portion contains second indication amount Q2 bits,
a number of detection results which are ACK in the HARQ information is K, 0≦K≦M, a resource index corresponding to an ith ACK is allocated to be Si, wherein i∈[0, 1, 2 . . . K−1], Si<Si+1 and M is a maximum number of virtual continuous resources about which HARQ information is allowed to be fed back by an HARQ information receiving end.

### Claim 45 (depends on 44)

The device according to claim 44, wherein the feedback indication unit comprises a feedback assignment module and a feedback indication module, wherein,
the feedback assignment module is configured to, according to a resource index S0 corresponding to a 0th ACK or a resource index SK−1 corresponding to a (K−1)th ACK, determine values of the first indication amount Q1 bits of the first portion and values of the second indication amount Q2 bits of the second portion of the total feedback indication amount Q bits; and
the feedback indication module is configured to send HARQ information through the values of the first indication amount Q1 bits of the first portion and the values of the second indication amount Q2 bits of the second portion,
and,
the feedback assignment module is configured as that:
when K≠0 and S0≦N−M, the first portion is a fifth preset binary number corresponding to the resource index S0 and expressed by the first indication amount Q1 bits;
when K=1 and S0≦N−M, the values of the second indication amount Q2 bits of the second portion are all 0;
when K>1 and S0≦N−M, the values of the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being S0+1, S0+2 . . . S0+M−1 one to one, and when Si∈{S0+1, S0+2 . . . S0+M−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0;
when K≠0 and S0>N−M, the first portion is a sixth preset binary number expressed by the first indication amount Q1 bits;
when S0>N−M, the second indication amount Q2 bits of the second portion correspond to resources with resource indexes being N−M+1, N−M+2 . . . N−1 one to one, and when Si∈{N−M+1, N−M+2 . . . N−1}, i=1, 2 . . . K−1, a value of a bit corresponding to the resource index Si is 1 and values of other bits are 0; and
when K=0, the first portion is a seventh preset binary number expressed by the first indication amount Q1 bits,
wherein every two of the fifth preset binary number, the sixth preset binary number and the seventh preset binary number are different.

### Claim 46

(canceled)

### Claim 47

(canceled)

### Claim 48

(canceled)

### Claim 49

(canceled)

### Claim 50

(canceled)

### Claim 51

(canceled)

### Claim 52

(canceled)

### Claim 53

(canceled)

### Claim 54

(canceled)

### Claim 55

(canceled)

### Claim 56

(canceled)

### Claim 57

(canceled)

### Claim 58

(canceled)

### Claim 59

(canceled)

### Claim 60 (depends on 1)

A computer storage medium, storing computer-executable instructions, wherein the computer-executable instructions are used for executing the method according to claim 1.

### Claim 61 (depends on 15)

A computer storage medium, storing computer-executable instructions, wherein the computer-executable instructions are used for executing the method according to claim 15.
