# US 2018/0026763 A1 · Resource Allocation Instruction 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/0026763 A1
- Document ID: US20180026763A1
- Status: Published application
- Kind: A1
- Application number: 15/547,070
- Filed: 2016-01-12
- Published: 2018-01-25
- Earliest claimed: 2015-01-30
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Wen ZHANG; Shuqiang XIA; Bo DAI; Jing SHI
- Web page: https://patentgrep.com/patent/US20180026763A1

## CPC

- H04L 5/0046: {Determination of the number of bits transmitted on different sub-channels}
- H04L 1/1614: {using bitmaps}
- H04W 4/70: Services for machine-to-machine communication [M2M] or machine type communication [MTC]
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L 5/0042: {Intra-user or intra-terminal allocation}
- H04W 88/02: Terminal devices
- 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

The document discloses a method and device for indicating a resource allocation. The method includes: determining a number of required indication bits according to the following parameters: a number N of allocable resources in a system, and a maximum number M of allocated resources supported by UE, herein 2≦M<N; and indicating the resource allocation by adopting a binary number, herein a bit number of the binary number is equal to the determined number of the indication bits.

## Claims

### Claim 1

A method for indicating a resource allocation, comprising:
determining a number of required indication bits according to the following parameters:
a number N of allocable resources in a system, and
a maximum number M of allocated resources supported by User Equipment, UE, wherein 2≦M<N; and
indicating the resource allocation by adopting a binary number, wherein a bit number of the binary number is equal to the determined number of the indication bits.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating one or more in any M continuous resources by adopting the binary number, wherein the binary number is obtained by converting a decimal number r, or obtained by converting a decimal number R which is obtained according to r, and the r and the R are as follows:
when
s
0
≤
N
-
M
,
r
=
2
M
-
1

s
0
+
(
∑
i
=
1
m
-
1

2
v


1
i
)
,
and v1i and si−s0 being in a predetermined one-to-one corresponding relationship and v1iε{0, 1, 2 . . . , M−2};
when
s
0
>
N
-
M
,
r
=
2
M
-
1

(
N
-
M
+
1
)
+
(
∑
i
=
0
m
-
1

2
v


2
i
)
-
1
,
and v2i and si−N being in a predetermined one-to-one corresponding relationship and v2iε{0, 1, 2 . . . , M−2};
wherein si is an index of a resource allocated to the UE, and i=0, 1 . . . m−1, and m is a number of resources allocated to the UE, and si<si+1 is met;
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant, and “mod” represents a modulo operation;
or,
when
s
0
<
N
-
M
,
r
=
2
M
-
1

s
0
+
(
∑
i
=
1
m
-
1

2
v


3
i
)
,
and v3i and si−s0 being in a predetermined one-to-one corresponding relationship and v3i ε{0, 1, 2 . . . , M−2};
when
s
0
≥
N
-
M
,
r
=
2
M
-
1
*
(
N
-
M
)
+
(
∑
i
=
0
m
-
1

2
v


4
i
)
-
1
,
and v4i and si−N being in a predetermined one-to-one corresponding relationship and v4iε{0, 1, 2 . . . , M−1}; and
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant.

### Claim 3 (depends on 2)

The method according to claim 2, wherein
v1i=si−s0−1, and v2i=si−N+M−1 or v2i=N−1−si; and
v3i=si−s0−1, and v4i=si−N+M or v4i=N−1−si.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating one or more in any M continuous resources by adopting the binary number, wherein the binary number is obtained by converting a decimal number r or obtained by converting a decimal number R which is obtained according to r, and the r and the R are as follows:
when
s
m
-
1
≤
M
-
1
,
r
=
(
∑
i
=
0
m
-
1

2
s
i
)
-
1
;
when
s
m
-
1
>
M
-
1
,
r
=
2
M
-
1
*
(
s
m
-
1
-
M
+
2
)
+
(
∑
i
=
0
m
-
2

2
v


5
i
)
-
1
,
and v5i and sm−1−si being in a predetermined one-to-one corresponding relationship and v5iε{0, 1, 2, . . . , M−2};
wherein si is an index of a resource allocated to the UE, and i=0, 1 . . . m−1, and m is a number of resources allocated to the UE, and si<si+1 is met;
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant;
or,
when
s
m
-
1
<
M
-
1
,
r
=
(
∑
i
=
0
m
-
1

2
s
i
)
-
1
;
when
s
m
-
1
≥
M
-
1
,
r
=
2
M
-
1
*
(
s
m
-
1
-
M
+
2
)
+
(
∑
i
=
0
m
-
2

2
v


6
i
)
-
1
,
and v6i and si−sm−1 being in a predetermined one-to-one corresponding relationship, and v6iε{0, 1, 2, . . . , M−2};
wherein si is an index of a resource allocated to the UE, and i=0, 1 . . . m−1, and m is a number of resources allocated to the UE, and si<si+1 is met; and
R=(r+C)mod((N−M+2)*2M−1−1,
wherein C is a constant.

### Claim 5 (depends on 4)

The method according to claim 4, wherein
v5i=sm−1−si−1 or v5i=M−1+si−sm−1; and
v6i=sm−1−si−1 or v6i=M−1+si−sm−1.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating one or more in any M continuous resources by adopting the binary number, wherein the binary number is obtained by converting a decimal number r, or obtained by converting a decimal number R which is obtained according to r, and the r and the R are as follows:
when
x
≤
N
-
M
,
r
=
2
M
-
1
*
x
+
(
∑
i
=
1
M
-
1


b
i
*
2
i
-
1
)
,
wherein x is an index of a starting resource allocated to the UE, and b1, b2, . . . , bM−1 are binary bits obtained by performing a bitmap mapping on resources of which indexes are x+1, x+2, . . . , x+M−1;
when
x
>
N
-
M
,
r
=
2
M
-
1
*
(
N
-
M
+
1
)
+
(
∑
i
=
1
M
-
1


b
i
*
2
i
-
1
)
-
1
;
wherein b1, b2, . . . , bM−1 are corresponding binary bits obtained by performing the bitmap mapping on resources of which indexes are N−M+1, . . . , N−1;
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant;
or,
when
x
<
N
-
M
,
r
=
2
M
-
1
*
x
+
(
∑
i
=
1
M
-
1


b
i
*
2
i
-
1
)
;
wherein x is an index of a starting resource allocated to the UE, and b1, b2, . . . , bM−1 are binary bits obtained by performing a bitmap mapping on resources of which indexes are x+1, x+2, . . . , x+M−1;
when
x
≥
N
-
M
,
r
=
2
M
-
1
*
(
N
-
M
)
+
(
∑
i
=
1
M


b
i
*
2
i
-
1
)
-
1
,
wherein b1, b2, . . . , bM are binary bits obtained by performing the bitmap mapping on resources of which indexes are N−M, N−M+1, . . . , N−1; and
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating one or more in any M continuous resources by adopting the binary number, wherein the binary number is obtained by converting a decimal number r or obtained by converting a decimal number R which is obtained according to r, and the r and the R are as follows:
when
x
≤
M
-
1
,
r
=
(
∑
i
=
0
M
-
1


b
i
*
2
i
)
-
1
;
wherein x is a maximum index of resources allocated to the UE, and b0, b1, b2, . . . , bM−1 are binary bits obtained by performing a bitmap mapping on resources of which indexes are 0, 1, . . . , M−1;
when
x
>
M
-
1
,
r
=
2
M
-
1
*
(
x
-
M
+
2
)
+
(
∑
i
=
0
M
-
2


b
i
*
2
i
)
-
1
;
wherein b0, b1, b2, . . . , bM−2 are binary bits obtained by performing the bitmap mapping on resources of which indexes are x−M+1, x−M+2, . . . , x−1;
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant;
or,
when
x
<
M
-
1
,
r
=
(
∑
i
=
0
M
-
2


b
i
*
2
i
)
-
1
;
wherein x is a maximum value of indexes of resources allocated to the UE, and b0, b1, b2, . . . , bM−2 are binary bits obtained by performing a bitmap mapping on resources of which indexes are 0, 1, . . . , M−2;
when
x
≥
M
-
1
,
r
=
2
M
-
1
×
(
x
-
M
+
2
)
+
(
∑
i
=
0
M
-
2


b
i
*
2
i
)
-
1
;
wherein b0, b1, b2, . . . , bM−2 are binary bits obtained by performing the bitmap mapping on resources of which indexes are x−M+1, x−M+2, . . . , x−1; and
R=(r+C)mod((N−M+2)*2M−1−1),
wherein C is a constant.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating m continuous resources allocated to the UE by adopting the binary number, wherein 1≦m≦M, and the binary number is obtained by converting a decimal number r or obtained by converting a decimal number R which is obtained according to r, and the r and the R are as follows:
when x≦N−M, r=x×M+L−1;
wherein x is an index of a starting resource allocated to the UE, and L is a number of resources allocated to the UE;
when
x
>
N
-
M
,
r
=
(
N
-
M
+
1
)
×
M
+
∑
i
=
0
N
-
1
-
x


(
i
)
+
L
-
1
;
R
=
(
r
+
C
)


mod


(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
,
wherein C is a constant;
or,
when x<N−M, r=x×M+L−1;
wherein x is an index of a starting resource allocated to the UE, and L is a number of resources allocated to the UE;
when
x
≥
N
-
M
,
r
=
(
N
-
M
)
×
M
+
∑
i
=
0
N
-
1
-
x


(
i
)
+
L
-
1
;

and
R
=
(
r
+
C
)


mod


(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
,
wherein C is a constant.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating m continuous resources allocated to the UE by adopting the binary number, wherein 1≦m≦M, and the binary number is obtained by converting a decimal number r or obtained by converting a decimal number R which is obtained according to r, and the r and the R are as follows:
when x≦M−1, r=Σi=0x(i)+L−1;
wherein x is a maximum index of resources allocated to the UE, and L is a number of the resources allocated to the UE;
when
x
>
M
-
1
,
r
=
M
×
(
M
+
1
)
2
+
(
x
-
M
)
×
M
+
L
-
1
;
R
=
(
r
+
C
)


mod


(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
,
wherein C is a constant;
or,
when x<M−1, r=Σi=0x(i)+L−1;
wherein x is a maximum index of resources allocated to the UE, and L is a number of the resources allocated to the UE;
when
x
≥
M
-
1
,
r
=
M
×
(
M
-
1
)
2
+
(
x
-
M
+
1
)
×
M
+
L
-
1
;

and
R
=
(
r
+
C
)


mod


(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
,
wherein C is a constant, and
L is a number of RBs allocated to the UE.

### Claim 10 (depends on 1)

The method according to claim 1, wherein the indicating the resource allocation by adopting a binary number comprises: indicating m continuous resources allocated to the UE by adopting the binary number, wherein 1≦m≦M, and the binary number is obtained by converting a decimal number r, and the r is as follows:
r=N(L−1)+x, 1≦L≦M,
wherein x is an index of a starting resource allocated to the UE, and L is a number of resources allocated to the UE, and N is a positive integer and Nε{15, 25, 50, 75, 100}, and M is a positive integer no more than 7.

### Claim 11 (depends on 2)

The method according to claim 2, wherein the number of the required indication bits is Q=|log2((N−M+2)*2M−1−1).

### Claim 12 (depends on 8)

The method according to claim 8, wherein the number of the required indication bits is
Q
=
⌈
log
2

(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
⌉
.

### Claim 13

A device for indicating a resource allocation, comprising:
a determining module, configured to determine a number of required indication bits according to the following parameters:
a number N of allocable resources in a system, and
a maximum number M of allocated resources supported by User Equipment, UE, wherein 2≦M<N; and
an indicating module, configured to indicate the resource allocation by adopting a binary number, wherein a bit number of the binary number is equal to the determined number of the indication bits.

### Claim 14 (depends on 1)

A computer-readable storage medium, storing a computer-executable instruction, wherein the computer-executable instruction is used to execute the method according to claim 1.

### Claim 15 (depends on 4)

The method according to claim 4, wherein the number of the required indication bits is Q=|log2((N−M+2)*2M−1−1)|.

### Claim 16 (depends on 6)

The method according to claim 6, wherein the number of the required indication bits is Q=|log2((N−M+2)*2M−1−1)|.

### Claim 17 (depends on 7)

The method according to claim 7, wherein the number of the required indication bits is Q=|log2((N−M+2)*2M−1−1)|.

### Claim 18 (depends on 9)

The method according to claim 9, wherein the number of the required indication bits is
Q
=
⌈
log
2

(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
⌉
.

### Claim 19 (depends on 10)

The method according to claim 10, wherein the number of the required indication bits is
Q
=
⌈
log
2

(
M
×
(
N
-
M
+
1
)
+
M

(
M
-
1
)
2
)
⌉
