WO2016119592A1 - Resource allocation instruction method and device - Google Patents

Abstract

Disclosed are a resource allocation instruction method and device, the method comprising: determining the number of required instruction bits according to the following parameters: the number N of allocable resources in a system, and the maximum number M of the allocated resources supported by a UE, wherein 2 ≤ M < N; and instructing resource allocation by employing a binary number, the digit of the binary number being equal to the determined number of the instruction bits.

Description

Method and device for indicating resource allocation Technical field

This application relates to, but is not limited to, the field of wireless communications.

Background technique

Machine Type Communication (MTC) User Equipment (UE), also known as Machine to Machine (M2M) user communication equipment, is the main application form of the Internet of Things.

In recent years, due to the high spectrum efficiency of Long-Term Evolution (LTE)/Long-Term Evolution Advance (LTE-Advance or LTE-A), more and more mobile operators LTE/LTE-A is selected as the evolution direction of the broadband wireless communication system. MTC multi-class data services based on LTE/LTE-A will also be more attractive.

MTC devices are typically low-cost devices with features such as a small RF (radio frequency) bandwidth and a single receive antenna. The RF transmit and receive bandwidth is typically 1.4 MHz. Only data of up to 6 PRBs (physical resource blocks) can be sent or received. In the resource indication method of the related art, the bitmap (bitmap) mode can only be used when the bandwidth is less than 10 RBs (resource blocks); the resource allocation "type 1" is a bitmap mode based on RBG (resource block group). The resource allocation "type 2" is a continuous resource allocation mode and cannot indicate multiple consecutive RBs of any consecutive 6 RBs. It can be seen that the resource indication method of the related art cannot implement flexible scheduling of the MTC UE, and since the RB allocated to the MTC UE does not exceed the limit of six consecutive RBs, the number of bits (bits) theoretically indicating the resource allocation of the MTC UE may be It is smaller than the number of bits required by the resource indication method that directly uses the related technology.

Summary of the invention

The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.

This document provides a resource allocation indication scheme, which can implement flexible scheduling of UEs and overhead. Smaller.

A method for indicating resource allocation, including:

Determine the number of required indication bits according to the following parameters:

The number of resources that can be allocated in the system N;

The maximum number M of allocated resources supported by the UE, where 2≤M<N;

An indication of resource allocation using a binary number, the number of bits of the binary number being equal to the determined number of indication bits.

Optionally, the indicating the resource allocation by using the binary number includes: indicating one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or obtained by using r. The decimal number R is converted; the r and R are:

When s ₀ ≤ NM,

There is a predetermined one-to-one correspondence between v1 _i and s _i -s ₀ , and v1 _i ∈ {0, 1, 2, ..., M-2};

When s ₀ >NM,

There is a predetermined one-to-one correspondence between v2 _i and s _i -N, and v2 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant, "mod" is a modulo operation;

or,

When s ₀ <NM,

There is a predetermined one-to-one correspondence between v3 _i and s _i -s ₀ , and v3 _i ∈ {0, 1, 2, ..., M-2};

When s ₀ ≥ NM,

There is a predetermined one-to-one correspondence between v4 _i and s _i -N, and v4 _i ∈ {0, 1, 2, ..., M-1};

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, v1 _i = s _{i -} s ₀ -1, v2 _i = s _i - N + M-1 or v2 _i = N-1-s _i ;

V3 _i =s _i -s ₀ -1, v4 _i =s _i -N+M or v4 _i =N-1-s _i .

Optionally, the indication of resource allocation by using a binary number includes: using a binary number One or more of any consecutive M resources, the binary number being converted by a decimal number r, or converted by a decimal number R obtained according to r; the r and R are:

When s _m-1 ≤ M-1,

When s _m-1 >M-1,

There is a predetermined one-to-one correspondence between v5 _i and s _m-1 -s _i , and v5 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When s _m-1 <M-1,

When s _m-1 ≥ M-1,

There is a predetermined one _-to- one correspondence between v6 _i and s _i -s _m-1 , and v6 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Alternatively, v5 _i = s _m-1 -s _i -1 or v5 _i = M-1 + s _{i -} s _m-1 ;

V6 _i =s _m-1 -s _i -1 or v6 _i =M-1+s _i -s _m-1 .

Optionally, the indicating the resource allocation by using the binary number includes: indicating one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or obtained by using r. The decimal number R is converted; the r and R are:

When x ≤ NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource of the index x+1, x+2, ..., x+M-1 Binary bits after map mapping;

When x>NM,

Wherein b ₁ , b ₂ , . . . , b _M-1 is a binary bit corresponding to a bit-map mapping of resources whose indices are N-M+1, . . . , N-1;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When x < NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource whose index is x+1, x+2, ..., x+M-1 -map mapped binary bits;

When x≥NM,

among them;

Where b ₁ , b ₂ , . . . , b _M are binary bits after bit-map mapping of resources indexed NM, N-M+1, . . . , N-1;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, the indicating the resource allocation by using the binary number includes: indicating one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or obtained by using r. The decimal number R is converted; the r and R are:

When x ≤ M-1,

Where x is the largest resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-1 is a bit-map mapping of resources with indices of 0, 1, ..., M-1 Binary bit

When x>M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 ;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When x < M-1,

Where x is the maximum value of the resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-2 is a bit-map mapping of resources with indices of 0, 1, ..., M-2 After the binary bit;

When x≥M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 ;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, the indication of resource allocation by using a binary number includes: using a binary number Showing m consecutive resources allocated to the UE, where 1≤m≤M, the binary number is converted by a decimal number r, or converted by a decimal number R obtained according to r; the r and R are:

When x≤N-M, r=x×M+L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE; when x>NM,

Where C is a constant;

or,

When x < N-M, r = x × M + L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x≥NM,

Where C is a constant.

Optionally, the indication of resource allocation by using a binary number includes: indicating, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, the binary number is converted by a decimal number r, or Converted according to the decimal number R obtained by r; the r and R are:

When x ≤ M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

When x>M-1,

Where C is a constant;

or,

When x < M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

When x≥M-1,

Where C is a constant;

L is the number of RBs allocated to the UE.

Optionally, the indication of performing resource allocation by using a binary number includes: indicating, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, the binary number is determined by decimal The number r is obtained; the r is:

r=N(L-1)+x, 1≤L≤M, where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE, N∈{15,25,50,75,100 A positive integer in }, M is a positive integer not greater than 7.

Optionally, the number of the required indication bits is

Optionally, the number of the required indication bits is

A pointing device for resource allocation, comprising:

Determine the module, set to: determine the number of required indication bits according to the following parameters:

The number of resources that can be allocated in the system N;

The maximum number M of allocated resources supported by the UE, where 2≤M<N;

The indication module is configured to: indicate an allocation of resources by using a binary number, where the number of bits of the binary number is equal to the determined number of indication bits.

Optionally, the indication module is configured to: indicate one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or converted by a decimal number R obtained according to r. Obtained; the r and R are:

When s ₀ ≤ NM,

There is a predetermined one-to-one correspondence between v1 _i and s _i -s ₀ , and v1 _i ∈ {0, 1, 2, ..., M-2};

When s ₀ >NM,

There is a predetermined one-to-one correspondence between v2 _i and s _i -N, and v2 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant, "mod" is a modulo operation;

Or,

When s ₀ <NM,

There is a predetermined one-to-one correspondence between v3 _i and s _i -s ₀ , and v3 _i ∈ {0, 1, 2, ..., M-2};

When s ₀ ≥ NM,

There is a predetermined one-to-one correspondence between v4 _i and s _i -N, and v4 _i ∈ {0, 1, 2, ..., M-1};

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, v1 _i = s _{i -} s ₀ -1, v2 _i = s _i - N + M-1 or v2 _i = N-1-s _i ;

V3 _i =s _i -s ₀ -1, v4 _i =s _i -N+M or v4 _i =N-1-s _i .

Optionally, the indication module is configured to: indicate one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or converted by a decimal number R obtained according to r. Obtained; the r and R are:

When s _m-1 ≤ M-1,

When s _m-1 >M-1,

There is a predetermined one-to-one correspondence between v5 _i and s _m-1 -s _i , and v5 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When s _m-1 <M-1,

When s _m-1 ≥ M-1,

There is a predetermined one _-to- one correspondence between v6 _i and s _i -s _m-1 , and v6 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Alternatively, v5 _i = s _{m-1 -} s _i -1 or v5 ₁ = M-1 + s _{i -} s _m-1 ;

V6 _i =s _m-1 -s _i -1 or v6 _i =M-1+s _i -s _m-1 .

Optionally, the indication module is configured to: indicate one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or obtained by using r. The converted decimal number R is obtained; the r and R are:

When x ≤ NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource of the index x+1, x+2, ..., x+M-1 Binary bits after map mapping;

When x>NM,

Wherein b ₁ , b ₂ , . . . , b _M-1 is a binary bit corresponding to a bit-map mapping of resources whose indices are N-M+1, . . . , N-1;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When x < NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource whose index is x+1, x+2, ..., x+M-1 -map mapped binary bits;

When x≥NM,

among them;

Where b ₁ , b ₂ , . . . , b _M are binary bits after bit-map mapping of resources indexed NM, N-M+1, . . . , N-1;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, the indication module is configured to: indicate one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or converted by a decimal number R obtained according to r. Obtained; the r and R are:

When x ≤ M-1,

Where x is the largest resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-1 is a bit-map mapping of resources with indices of 0, 1, ..., M-1 Binary bit

When x>M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 ;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

Or,

When x < M-1,

Where x is the maximum value of the resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-2 is a bit-map mapping of resources with indices of 0, 1, ..., M-2 After the binary bit;

When x≥M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 ;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, the indication module is configured to: indicate, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, the binary number is converted by a decimal number r, or obtained by according to r The decimal number R is converted; the r and R are:

When x≤N-M, r=x×M+L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x>NM,

Where C is a constant;

or,

When x < N-M, r = x × M + L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x≥NM,

Where C is a constant.

Optionally, the indication module is configured to: indicate, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, the binary number is converted by a decimal number r, or obtained by according to r The decimal number R is converted; the r and R are:

When x ≤ M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

When x>M-1,

Where C is a constant;

or,

When x < M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

When x≥M-1,

Where C is a constant;

L is the number of RBs allocated to the UE.

Optionally, the indication module is configured to: indicate, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, and the binary number is converted by a decimal number r; the r is:

r=N(L-1)+x, 1≤L≤M, where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE, N∈{15,25,50,75,100 A positive integer in }, M is a positive integer not greater than 7.

Optionally, the number of required indication bits determined by the determining module is

Optionally, the number of required indication bits determined by the determining module is

A computer readable storage medium storing computer executable instructions for performing the method of any of the above.

The embodiment of the present invention can be used to indicate resource allocation of uplink and downlink. The proposed method can implement flexible scheduling of the UE, and the overhead is small. The proposed method is not limited to the allocation for the physical layer RB, and can be used for the allocation of any kind of resources, including frequency domain resources, or time domain resources, or code resources or a mixture of the above.

Other aspects will be apparent upon reading and understanding the drawings and detailed description.

BRIEF abstract

FIG. 1 is a schematic flowchart of a method for indicating resource allocation according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of a resource allocation indication device according to an embodiment of the present invention.

Embodiments of the invention

The mode of the present invention will be described below with reference to the accompanying drawings and embodiments.

It should be noted that the embodiments of the present invention and the various features in the embodiments may be combined with each other if they do not conflict. Additionally, although logical sequences are shown in the flowcharts, in some cases the steps shown or described may be performed in a different order than the ones described herein.

A method for indicating resource allocation, as shown in FIG. 1, includes:

Step 101: Determine the number of required indication bits (bits) according to the following parameters:

The number of resources that can be allocated in the system N;

The maximum number M of allocated resources supported by the UE, where 2≤M<N;

Step 102: Perform an indication of resource allocation by using a binary number, where the number of bits of the binary number is equal to the determined number of indication bits.

Optionally, the indicating the resource allocation by using the binary number includes: indicating one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or obtained by using r. The decimal number R is converted; the r and R are one of the following:

(1) When s ₀ ≤ NM,

When s ₀ >NM,

Or v _i =N-1-s _i ;

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 .

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant and "mod" is a modulo operation.

Or when s ₀ <NM,

When s ₀ ≥ NM,

Or v _i =N-1-s _i ;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

In the embodiment of the present invention, the v _i has two optional calculation methods. When the base station allocates the RB for the UE, one of the calculations may be arbitrarily used.

(2) When s _m-1 ≤ M-1,

When s _m-1 >M-1,

v _i =s _m-1 -s _i -1 or v _i =M-1+s _i -s _m-1 ;

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Or when s _m-1 <M-1,

When s _m-1 ≥ M-1,

v _i =s _m-1 -s _i -1 or v _i =M-1+s _i -s _m-1 ;

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant. or;.

(3) When x≤NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource of the index x+1, x+2, ..., x+M-1 The binary bits after the map is mapped.

When x>NM,

Wherein, b ₁ , b ₂ , ..., b _M-1 are binary bits corresponding to bit-map mapping of resources whose indices are N-M+1, . . . , N-1.

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Or when x < NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource whose index is x+1, x+2, ..., x+M-1 -map mapped binary bits.

When x≥NM,

Where b ₁ , b ₂ , ..., b _M are binary bits after bit-map mapping of resources whose indices are NM, N-M+1, ..., N-1.

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

(4) When x ≤ M-1,

Where x is the largest resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-1 is a bit-map mapping of resources with indices of 0, 1, ..., M-1 Binary bits.

When x>M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 .

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Or when x<M-1,

Where x is the maximum value of the resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-2 is a bit-map mapping of resources with indices of 0, 1, ..., M-2 After the binary bit.

When x≥M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 .

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, the indication of performing resource allocation includes: the indication of performing resource allocation by using a binary number includes: indicating, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, the binary number It is obtained by converting the decimal number r, or by converting the decimal number R obtained according to r; the r and R are one of the following:

(5) When x ≤ N-M, r = x × M + L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x>NM,

Where C is a constant.

Or when x < N-M, r = x × M + L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x≥NM,

Where C is a constant.

(6) When x ≤ M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE.

When x>M-1,

Where C is a constant.

Or when x < M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE.

When x≥M-1,

Where C is a constant.

(7) r=N(L-1)+x, 1≤L≤M, where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE, N∈{15,25, A positive integer in 50, 75, 100}, M is a positive integer not greater than 7.

Optionally, for the foregoing (1) to (4), the number of the required indication bits may be

Optionally, for the foregoing (5) to (7), the number of the required indication bits may be

As shown in FIG. 2, a resource allocation indicating device includes:

The determining module 21 is configured to: determine the number of required indication bits according to the following parameters:

The number of resources that can be allocated in the system N;

The maximum number M of allocated resources supported by the UE, where 2≤M<N;

The indication module 22 is configured to: perform an indication of resource allocation by using a binary number, where the number of bits of the binary number is equal to the determined number of indication bits.

Optionally, the indicating module 22 is configured to: indicate one or more of any consecutive M resources by using a binary number, where the binary number is converted by a decimal number r, or by a decimal number R obtained according to r. Converted; the r and R can be any of the following:

(1) When s ₀ ≤ NM,

There is a predetermined one-to-one correspondence between v1 _i and s _i -s ₀ , and v1 _i ∈ {0, 1, 2, ..., M-2};

When s ₀ >NM,

There is a predetermined one-to-one correspondence between v2 _i and s _i -N, and v2 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant, "mod" is a modulo operation;

or,

When s ₀ <NM,

There is a predetermined one-to-one correspondence between v3 _i and s _i -s ₀ , and v3 _i ∈ {0, 1, 2, ..., M-2};

When s ₀ ≥ NM,

There is a predetermined one-to-one correspondence between v4 _i and s _i -N, and v4 _i ∈ {0, 1, 2, ..., M-1};

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Further, v1 _i = s _{i -} s ₀ -1, v2 _i = s _i - N + M-1 or v2 _i = N-1-s _i ;

V3 _i =s _i -s ₀ -1, v4 _i =s _i -N+M or v4 _i =N-1-s _i .

(2) When s _m-1 ≤ M-1,

When s _m-1 >M-1,

There is a predetermined one-to-one correspondence between v5 ₁ and s _m-1 -s _i , and v5 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When s _m-1 <M-1,

When s _m-1 ≥ M-1,

There is a predetermined one _-to- one correspondence between v6 _i and s _i -s _m-1 , and v6 _i ∈ {0, 1, 2, ..., M-2};

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Further, v5 _i = s _{m-1 -} s _i -1 or v5 _i = M-1 + s _{i -} s _m-1 ;

V6 _i =s _m-1 -s _i -1 or v6 _i =M-1+s _i -s _m-1 .

(3) When x≤NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource of the index x+1, x+2, ..., x+M-1 Binary bits after map mapping;

When x>NM,

Wherein b ₁ , b ₂ , . . . , b _M-1 is a binary bit corresponding to a bit-map mapping of resources whose indices are N-M+1, . . . , N-1;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When x < NM,

Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is a bit of the resource whose index is x+1, x+2, ..., x+M-1 -map mapped binary bits;

When x≥NM,

among them;

Where b ₁ , b ₂ , . . . , b _M are binary bits after bit-map mapping of resources indexed NM, N-M+1, . . . , N-1;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

(4) When x ≤ M-1,

Where x is the largest resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-1 is a bit-map mapping of resources with indices of 0, 1, ..., M-1 Binary bit

When x>M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 ;

R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

or,

When x < M-1,

Where x is the maximum value of the resource index allocated to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-2 is a bit-map mapping of resources with indices of 0, 1, ..., M-2 After the binary bit;

When x≥M-1,

Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are binary bits after bit-map mapping of resources with indices x-M+1, x-M+2, ..., x-1 ;

R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.

Optionally, the indication module 22 is configured to: indicate, by using a binary number, m consecutive resources allocated to the UE, where 1≤m≤M, the binary number is converted by a decimal number r, or by The obtained decimal number R is obtained; the r and R may be any of the following:

(5) When x ≤ N-M, r = x × M + L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x>MM,

Where C is a constant;

or,

When x < M-M, r = x × M + L-1;

Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

When x≥NM,

Where C is a constant.

(6) When x ≤ M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

When x>M-1,

Where C is a constant;

Or,

When x < M-1,

Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

When x≥M-1,

Where C is a constant.

(7) r=N(L-1)+x, 1≤L≤M, where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE, N∈{15,25, A positive integer in 50, 75, 100}, M is a positive integer not greater than 7.

Wherein, in the above (1) to (4), the number of required indication bits determined by the determining module is

Wherein, for the above (5) to (7), the number of required indication bits determined by the determining module is

Embodiment 1:

An embodiment of the present invention provides a method for indicating resource allocation, such as an RB or a carrier resource in an LTE system, or a time domain resource, such as a subframe or a frame, or a code resource, or a plurality of Any combination of resources, the embodiment of the present invention is described by resource allocation of RBs in LTE. The actual application is not limited to the allocation of RBs.

The resource allocation indication method in this embodiment is used to indicate one or more of any M (M<N) consecutive resources among the N resources, wherein the continuous refers to logical continuity, logically consecutive M The resources correspond to M physical resources one by one, and the corresponding physical resources may be continuous or discontinuous. For example, if M=3, and virtual resources 0, 1, and 2 correspond to physical resource blocks 1, 5, and 7, respectively, the three consecutive virtual resource blocks correspond to three non-physical consecutive physical resource blocks.

The resource allocation indication method of this embodiment will be described below by the allocation of the physical layer RB.

Assume that the number of RBs that can be allocated in the system is N, and the index of the RBs is 0, 1, 2, ..., N-1. The number of RBs that can be allocated in the system can be equal to the number of RBs corresponding to the system bandwidth, or can be smaller than The number of RBs corresponding to the system bandwidth. For example, the system bandwidth is 20MHz, and the number of RBs that can be allocated can be only a part of them, such as RB#0~RB#39. The maximum number of allocated RBs supported by the UE is M, and M<N, M≥2. The resource allocation indication method may allocate any one or more of any M consecutive RBs to the UE, where the continuation refers to logical continuity, and the physical resources may be continuous or not consecutive. The resource allocation indication method may also be used to allocate any logically consecutive m RBs to the UE, where 1≤m≤M. The number of bits required for the resource allocation indication method is

Here

Indicates rounding up. The number of RBs allocated to the MTC UE is m, 1 ≤ m ≤ M, and the indexes of the m RBs are s _i , i=0, 1...m-1, and satisfy s _i <s _i+1 . For example, the RB index assigned to the UE is 7, 8, 10, then s ₀ = 7, s ₁ = 8, and s ₂ = 10.

Resource allocation corresponds to a decimal number r,

When s ₀ ≤ NM,

Here v _i =s _i -s ₀ -1 is just an example, and may be v _i =Ms _i +s ₀ -1 or others, as long as there is a one-to-one correspondence between v _i and s _i -s ₀ , And v _i ∈ {0, 1, 2, ..., M-2} can be. This correspondence is preset. w=s ₀ is just an example. It can also be w=NMs ₀ or other forms, as long as there is a one-to-one correspondence between w and s ₀ , and w∈{0,1,2,..., NM}. The above formula has only the first part when m=1, that is, r=2 ^M-1 ×s ₀ .

When s ₀ >NM,

Or v _i =N-1-s _i ,

Here, v _i =s _i -N+M-1 is an example, and may be v _i =N-1-s _i or others as long as there is a one-to-one correspondence between v _i and s _i -N, and v _i ∈{0,1,2...,M-2}. This correspondence is preset.

The above formula is expressed by s ₀ ≤ NM and s ₀ > NM. In fact, the equal sign can also be placed on the side of s ₀ > NM, and the formula is given below.

When s ₀ <NM,

Here v _i =s _i -s ₀ -1 is just an example, and may be v _i =Ms _i +s ₀ -1 or others, as long as there is a one-to-one correspondence between v _i and s _i -s ₀ , And v _i ∈ {0, 1, 2, ..., M-2} can be. This correspondence is preset. w=s ₀ is just an example, and can be other forms as long as there is a one-to-one correspondence between w and s ₀ , and w ∈ {0, 1, 2, ..., NM-1}.

When s ₀ ≥ NM,

Or v _i =N-1-s _i ,

Here v _i =s _i -N+M is an example, and may be v _i =N-1-s _i or others as long as there is a one-to-one correspondence between v _i and s _i -N, and v _i ∈{0,1,2...,M-1} can be. This correspondence is preset.

In practice, the eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, and assume that the binary number is c ₀ , c ₁ , . . . , c _Q-1 , then

For example, r=15 and Q=8, then the corresponding binary number is 00001111.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where "mod" represents the modulo operation, r The value is as above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

The eNB determines a decimal number according to the foregoing method, and then sends the binary number corresponding to the decimal number to the UE. After receiving the UE, the RB allocated by the eNB to the UE is determined according to the binary number.

Embodiment 2:

This embodiment is the same as the problem solved by the first embodiment. It is assumed that the number of RBs that can be allocated in the system is N, and the indexes of the RBs are 0, 1, 2, ..., N-1, and the maximum number of allocated RBs supported by the UE is M, and M < N, M ≥ 2. The resource allocation indication method may allocate any one or more of any M consecutive RBs to the UE, where the continuation refers to logical continuity, and the physical resources may be continuous or not consecutive. The resource allocation indication method may also be used to allocate any consecutive m RBs to the UE, where 1≤m≤M. The number of bits required for the resource allocation indication method is

The number of RBs allocated to the MTC UE is m, 1 ≤ m ≤ M, and the indexes of the m RBs are s _i , i=0, 1...m-1, and satisfy s _i <s _i+1 . The resource allocation corresponds to a decimal number r,

When s _m-1 ≤ M-1,

When s _m-1 >M-1,

Or v _i =M-1+s _i -s _m-1 ,w=s _m-1 -M+2

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

Where v _i =s _m-1 -s _i -1 is only an example, as long as there is a one _-to- one correspondence between v _i and s _m-1 -s _i , and v _i ∈ {0, 1, 2,... ..., M-2}. The correspondence is preset. w=s _m-1 -M+2 is just an example, and can be other forms as long as there is a one _-to- one correspondence between w and s _m-1 , and w∈{2,3,... , N-M+1}. When the above formula is m=1, the calculation formula of r does not include

Part, r=2 ^M-1 *w-2.

The above formula is expressed by s _m-1 ≤ M-1 and s _m-1 > M-1. In fact, the equal sign can also be placed on the side of s _m-1 > M-1, given below Formula.

When s _m-1 <M-1,

When s _m-1 ≥ M-1,

Or v _i =M-1+s _i -s _m-1 , w=s _m-1 -M+2.

Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

Where v _i =M-1+s _i -s _M-1 is only an example, as long as there is a one _-to- one correspondence between v _i and s _i -s _m-1 , and v _i ∈ {0, 1, 2 ,......, M-2}. The correspondence is preset. When the above formula is m=1, the calculation formula of r does not include

Part, r=2 ^M-1 *w-2

In practice, the eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, and assume that the binary number is c ₀ , c ₁ , . . . , c _Q-1 , then

For example, r=15 and Q=8, then the corresponding binary number is 00001111.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where r takes the value as described above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

The eNB determines a decimal number according to the foregoing method, and then sends the binary number corresponding to the decimal number to the UE. After receiving the UE, the RB allocated by the eNB to the UE is determined according to the binary number.

Embodiment 3:

This embodiment is the same as the problem solved by the first embodiment. It is assumed that the number of RBs that can be allocated in the system is N, and the indexes of the RBs are 0, 1, 2, ..., N-1, and the maximum number of allocated RBs supported by the UE is M, and M < N, M ≥ 2. The resource allocation indication method may allocate any one or more of any M consecutive RBs to the UE, where the continuation refers to logical continuity, and the physical resources may be continuous or not consecutive. The resource allocation indication method may also be used to allocate any consecutive m RBs to the UE, where 1≤m≤M. The number of bits required to indicate the method of resource allocation is

The minimum index of the RBs allocated for the MTC UE is x.

When x≤N-M,

The RBs whose indices are x+1, x+2, ..., x+M-1 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise they correspond to "0". Let the corresponding binary bits be: b ₁ , b ₂ , ..., b _M-1 . Each index of the index x+1, x+2, ..., x+M-1 has a one _-to- one correspondence with each bit in the binary b ₁ , b ₂ , ..., b _M-1 The correspondence is preset. For example, x+i corresponds to b _i , and x+i may correspond to b _M-1-i . The actual application is not limited to such a corresponding manner, as long as it is one-to-one correspondence.

Assign the resource allocation to a decimal number r

When x>N-M,

The RBs with the index of N-M+1, . . . , N-1 are bit-map mapped, and the RBs allocated to the MTC UEs correspond to “1”, otherwise corresponding to “0”, and the corresponding binary bits are: b ₁ . b ₂ , ..., b _M-1 , the index is N-M+1, ..., the RB of N-1 is one between each bit in the binary b ₁ , b ₂ , ..., b _M-1 Correspondingly, the correspondence is preset.

Assign the resource allocation to a decimal number r

The above formula is expressed by x ≤ N-M and x > N-M. In fact, the equal sign can also be placed on the side of x>N-M, and the formula is given below.

When x<N-M,

The RBs whose indices are x+1, x+2, ..., x+M-1 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise they correspond to "0". Let the corresponding binary bits be: b ₁ , b ₂ , ..., b _M-1 . Each index of the index x+1, x+2, ..., x+M-1 has a one _-to- one correspondence with each bit in the binary b ₁ , b ₂ , ..., b _M-1 The correspondence is preset. For example, x+i corresponds to b _i , and x+i may correspond to b _M-1-i . The actual application is not limited to such a corresponding manner, as long as it is one-to-one correspondence.

Assign the resource allocation to a decimal number r

When x≥N-M,

The RBs of the NM, N-M+1, ..., N-1 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise corresponding to "0", the corresponding binary bits are: b ₁ , b ₂ , ..., b _M , index is NM, N-M+1, ..., N-1 RB and binary b ₁ , b ₂ , ..., b is between each bit in _M Correspondingly, the correspondence is preset.

Assign the resource allocation to a decimal number r

In practice, the eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, and assume that the binary number is c ₀ , c ₁ , . . . , c _Q-1 , then

For example, r=15 and Q=8, then the corresponding binary number is 00001111.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where r takes the value as described above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

The eNB determines a decimal number according to the foregoing method, and then sends the binary number corresponding to the decimal number to the UE. After receiving the UE, the RB allocated by the eNB to the UE is determined according to the binary number.

Embodiment 4:

This embodiment is the same as the problem solved by the first embodiment. It is assumed that the number of RBs that can be allocated in the system is N, and the indexes of the RBs are 0, 1, 2, ..., N-1, and the maximum number of allocated RBs supported by the UE is M, and M < N, M ≥ 2. The resource allocation indication method may allocate any one or more of any M consecutive RBs to the UE, where the continuation refers to logical continuity, and the physical resources may be continuous or not consecutive. The resource allocation indication method may also be used to allocate any consecutive m RBs to the UE, where 1≤m≤M. The number of bits required to indicate the method of resource allocation is

The maximum index of the RBs allocated for the MTC UE is x.

When x ≤ M-1,

The RBs of the index 0, 1, ..., M-1 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise corresponding to "0", the corresponding binary bits are: b ₀ , b ₁ , b ₂ , ..., b _M-1 , index is 0, 1, ..., between RB of _M-1 and each bit in binary b ₀ , b ₁ , b ₂ , ..., b _M-1 There is a one-to-one correspondence, and the correspondence is preset.

Assign the resource allocation to a decimal number r

When x>M-1,

The RBs whose indices are x-M+1, x-M+2, ..., x-1 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise they correspond to "0". Let the corresponding binary bits be: b ₀ , b ₁ , b ₂ , ..., b _M-2 . The index is x-M+1, x-M+2, ..., x-1 for each RB and each of the bits b ₀ , b ₁ , b ₂ , ..., b _M-2 The correspondence is one-to-one, and the correspondence is preset. The actual application is not limited to a certain corresponding mode, as long as it is a one-to-one correspondence.

Assign the resource allocation to a decimal number r

The above formula is expressed by x ≤ M-1 and x > M-1. In fact, the equal sign can also be placed on the side of x>M-1. The formula is given below.

When x < M-1,

The RBs of the index 0, 1, ..., M-2 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise corresponding to "0", the corresponding binary bits are: b ₀ , b ₁ , b ₂ , ..., b _M-2 , index is 0, 1, ..., between M 2 RB and binary b ₀ , b ₁ , b ₂ , ..., b _M-2 There is a one-to-one correspondence, and the correspondence is preset.

Assign the resource allocation to a decimal number r

When x≥M-1,

The RBs whose indices are x-M+1, x-M+2, ..., x-1 are bit-map mapped, and the RBs allocated to the MTC UE correspond to "1", otherwise they correspond to "0". Let the corresponding binary bits be: b ₀ , b ₁ , b ₂ , ..., b _M-2 . The index is x-M+1, x-M+2, ..., x-1 for each RB and each of the bits b ₀ , b ₁ , b ₂ , ..., b _M-2 The correspondence is one-to-one, and the correspondence is preset. The actual application is not limited to a certain corresponding mode, as long as it is a one-to-one correspondence.

Assign the resource allocation to a decimal number r

In practice, the eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, and assume that the binary number is c ₀ , c ₁ , . . . , c _Q-1 , then

For example, r=15 and Q=8, then the corresponding binary number is 00001111.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where r takes the value as described above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

The eNB determines a decimal number according to the foregoing method, and then sends the binary number corresponding to the decimal number to the UE. After receiving the UE, the RB allocated by the eNB to the UE is determined according to the binary number.

Embodiment 5:

This embodiment provides a method of resource allocation indication. It is assumed that the number of RBs that can be allocated in the system is N, and the indexes of the RBs are 0, 1, 2, ..., N-1, and the maximum number of allocated RBs supported by the UE is M, and M < N, M ≥ 2. The resource allocation indication method may allocate any consecutive m RBs to the UE, where 1≤m≤M, where continuity refers to logical continuity, and physical resources may be continuous or not consecutive. The number of bits required to indicate the method of resource allocation is

Assuming that the starting RB index (ie, the smallest index) allocated to the UE is x, and the number of RBs allocated to the UE is L, then the resource allocation corresponds to a decimal number r:

When x≤N-M, r=x×M+L-1;

When x>NM,

The above formula is expressed by x ≤ N-M and x > N-M. In fact, the equal sign can also be placed on the side of x>N-M, and the formula is given below.

When x < N-M, r = x × M + L-1;

When x≥NM,

In practice, the eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, which is similar to the previous embodiment, and details are not described herein again.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then

Where r is as described above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

The eNB determines a decimal number according to the foregoing method, and then sends the binary number corresponding to the decimal number to the UE. After receiving the UE, the RB allocated by the eNB to the UE is determined according to the binary number.

Example 6:

This embodiment provides a method of resource allocation indication. It is assumed that the number of RBs that can be allocated in the system is N, and the indexes of the RBs are 0, 1, 2, ..., N-1, and the maximum number of allocated RBs supported by the UE is M, and M < N, M ≥ 2. The resource allocation indication method may allocate any consecutive m RBs to the UE, where 1≤m≤M, where continuity refers to logical continuity, and physical resources may be continuous or not consecutive. The number of bits required to indicate the method of resource allocation is

Assuming that the maximum RB index assigned to the UE is x and the number of RBs allocated to the UE is L, then the resource allocation corresponds to a decimal number r:

When x ≤ M-1,

When x>M-1,

The above formula is expressed by x ≤ M-1 and x > M-1. In fact, the equal sign can also be placed on the side of x>M-1. The formula is given below.

When x < M-1,

When x≥M-1,

In practice, the eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, which is similar to the previous embodiment, and details are not described herein again.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then

Where r is as described above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

The eNB determines a decimal number according to the foregoing method, and then sends the binary number corresponding to the decimal number to the UE. After receiving the UE, the RB allocated by the eNB to the UE is determined according to the binary number.

Example 7:

This embodiment provides a method of resource allocation indication. It is assumed that the number of RBs that can be allocated in the system is N, and the indexes of the RBs are 0, 1, 2, ..., N-1, and the maximum number of allocated RBs supported by the UE is M, and M < N, M ≥ 2. The resource allocation indication method may allocate any consecutive m RBs to the UE, where 1≤m≤M. The number of bits required to indicate the method of resource allocation is

Assuming that the starting RB index (ie, the smallest index) allocated to the UE is x, and the number of RBs allocated to the UE is L, then the resource allocation corresponds to a decimal number r:

r=N(L-1)+x;

In the resource allocation indication, N may take a positive integer in the set {15, 25, 50, 75, 100}, and M may take a positive integer not greater than 7.

The method for indicating the resource allocation described above is modified to form a new resource allocation indication method. Assuming that the resource allocation in the new indication method is represented by a decimal number R, then

Where r is as described above. The eNB may notify the UE of the binary number of the Qbit corresponding to the decimal number, as described above, and details are not described herein.

In the embodiment of the present invention, when indicating the same resource in a system, one of r or R is selected for indication according to a default or a predetermined manner, and r is selected in the above manner. That is to say, when a resource in a system is indicated, the decimal number used is calculated in a uniquely determined manner.

One of ordinary skill in the art will appreciate that all or a portion of the steps of the above-described embodiments can be implemented using a computer program flow, which can be stored in a computer readable storage medium, such as on a corresponding hardware platform (eg, System, device, device, device, etc.) In execution, one or a combination of the steps of the method embodiments is included.

Alternatively, all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve.

The devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.

When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium. The above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.

Industrial applicability

The embodiments of the present invention can be used to indicate resource allocation of uplink and downlink, implement flexible scheduling of the UE, and have low overhead. Moreover, the embodiments of the present invention are not limited to the allocation for the physical layer RB, and may be used for allocation of any kind of resources, including frequency domain resources, or time domain resources, or code resources or a mixture of the above.

Claims (14)

1. A method for indicating resource allocation, including:

   Determine the number of required bit bits according to the following parameters:

   The number of resources that can be allocated in the system N;

   The maximum number M of allocated resources supported by the UE, where 2≤M<N;

   An indication of resource allocation using a binary number, the number of bits of the binary number being equal to the determined number of indication bits.
2. The method of claim 1, wherein the indication of resource allocation using a binary number comprises: using a binary number to indicate one or more of any consecutive M resources, the binary number being converted by a decimal number r, Or by the decimal number R obtained according to r; the r and R are:

   When s ₀ ≤ NM,

   

   There is a predetermined one-to-one correspondence between v1 _i and s _i -s ₀ , and v1 _i ∈ {0, 1, 2, ..., M-2};

   When s ₀ >NM,

   

   There is a predetermined one-to-one correspondence between v2 _i and s _i -N, and v2 _i ∈ {0, 1, 2, ..., M-2};

   Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ;

   R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant, "mod" is a modulo operation;

   or,

   When s ₀ <NM,

   

   There is a predetermined one-to-one correspondence between v3 _i and s _i -s ₀ , and v3 _i ∈ {0, 1, 2, ..., M-2};

   When s ₀ ≥ NM,

   

   There is a predetermined one-to-one correspondence between v4 _i and s _i -N, and v4 _i ∈ {0, 1, 2, ..., M-1};

   R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.
3. The method of claim 2 wherein:

   V1 _i =s _i -s ₀ -1, v2 _i =s _i -N+M-1 or v2 _i =N-1-s _i ;

   V3 _i =s _i -s ₀ -1, v4 _i =s _i -N+M or v4 _i =N-1-s _i .
4. The method of claim 1, wherein the indication of resource allocation using a binary number comprises: using a binary number to indicate one or more of any consecutive M resources, the binary number being converted by a decimal number r, Or by the decimal number R obtained according to r; the r and R are:

   When s _m-1 ≤ M-1,

   

   When s _m-1 >M-1,

   

   There is a predetermined one-to-one correspondence between v5 _i and s _m-1 -s _i , and v5 _i ∈ {0, 1, 2, ..., M-2};

   Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

   R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

   or,

   When s _m-1 <M-1,

   

   When s _m-1 ≥ M-1,

   

   There is a predetermined one _-to- one correspondence between v6 _i and s _i -s _m-1 , and v6 _i ∈ {0, 1, 2, ..., M-2};

   Where s _i is an index of resources allocated to the UE, where i=0, 1...m-1, m is the number of resources allocated to the UE, and satisfies s _i <s _i+1 ,

   R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.
5. The method of claim 4 wherein:

   V5 _i =s _m-1 -s _i -1 or v5 _i =M-1+s _i -s _m-1 ;

   V6 _i =s _m-1 -s _i -1 or v6 _i =M-1+s _i -s _m-1 .
6. The method of claim 1, wherein the indication of resource allocation using a binary number comprises: using a binary number to indicate one or more of any consecutive M resources, the binary number being converted by a decimal number r, Or by the decimal number R obtained according to r; the r and R are:

   When x ≤ NM,

   

   Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is the index x+1, x+2,..., x+M- a resource of 1 performs bit map bit-map mapping of binary bits;

   When x>NM,

   

   Wherein b ₁ , b ₂ , . . . , b _M-1 is a binary bit corresponding to a bit-map mapping of resources whose indices are N-M+1, . . . , N-1;

   R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

   or,

   When x < NM,

   

   Where x is the starting resource index assigned to the UE, b ₁ , b ₂ , ..., b _M-1 is the index x+1, x+2,..., x+M Binary bits of the -1 resource after bit-map mapping;

   When x≥NM,

   

   among them;

   Where b ₁ , b ₂ , . . . , b _M are binary bits after bit-map mapping of resources indexed NM, N-M+1, . . . , N-1;

   R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.
7. The method of claim 1, wherein the indication of resource allocation using a binary number comprises: using a binary number to indicate one or more of any consecutive M resources, the binary number being converted by a decimal number r, Or by the decimal number R obtained according to r; the r and R are:

   When x ≤ M-1,

   

   Where x is the largest resource index assigned to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-1 is a resource with an index of 0, 1, ..., M-1 Binary bits after bit-map mapping;

   When x>M-1,

   

   Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are resources with indexes x-M+1, x-M+2, ..., x-1 Bit-map mapped binary bits;

   R = (r + C) mod ((N - M + 2) * 2 ^M-1 -1), where C is a constant;

   or,

   When x < M-1,

   

   Where x is the maximum value of the resource index assigned to the UE, b ₀ , b ₁ , b ₂ , ..., b _M-2 is the index of 0, 1, ..., M-2 Binary bits after the resource is bit-map mapped;

   When x≥M-1,

   

   Where b ₀ , b ₁ , b ₂ , ..., b _M-2 are resources with indexes x-M+1, x-M+2, ..., x-1 Bit-map mapped binary bits;

   R = (r + C) mod ((N - M + 2) * 2 ^{M - 1} -1), where C is a constant.
8. The method according to claim 1, wherein said indication of resource allocation by using a binary number comprises: indicating, by a binary number, m consecutive resources allocated to the UE, wherein 1 ≤ m ≤ M, said binary number being The decimal number is converted by r, or by the decimal number R obtained from r; the r and R are:

   When x≤N-M, r-x×M+L-1;

   Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE; when x>NM,

   

   

   Where C is a constant;

   or,

   When x < N-M, r = x × M + L-1;

   Where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE;

   When x≥NM,

   

   

   Where C is a constant.
9. The method according to claim 1, wherein said indication of resource allocation by using a binary number comprises: indicating, by a binary number, m consecutive resources allocated to the UE, wherein 1 ≤ m ≤ M, said binary number being The decimal number is converted by r, or by the decimal number R obtained from r; the r and R are:

   When x ≤ M-1,

   

   Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

   When x>M-1,

   

   

   Where C is a constant;

   or,

   When x < M-1,

   

   Where x is the maximum resource index allocated to the UE, and L is the number of resources allocated to the UE;

   When x≥M-1,

   

   

   Where C is a constant;

   L is the number of RBs allocated to the UE.
10. The method according to claim 1, wherein said indication of resource allocation by using a binary number comprises: indicating, by a binary number, m consecutive resources allocated to the UE, wherein 1 ≤ m ≤ M, said binary number being The decimal number r is converted; the r is:

    r=N(L-1)+x, 1≤L≤M, where x is the starting resource index assigned to the UE, and L is the number of resources allocated to the UE, N∈{15,25,50,75,100 A positive integer in }, M is a positive integer not greater than 7.
11. The method according to any one of claims 2 to 7, wherein the number of required indication bits is

    
12. The method according to any one of claims 8 to 10, wherein the number of required indication bits is

    
13. A pointing device for resource allocation, comprising:

    Determine the module, set to: determine the number of required indication bits according to the following parameters:

    The number of resources that can be allocated in the system N;

    The maximum number M of allocated resources supported by the UE, where 2≤M<N;

    The indication module is configured to: indicate an allocation of resources by using a binary number, where the number of bits of the binary number is equal to the determined number of indication bits.
14. A computer readable storage medium storing computer executable instructions for performing the method of any of claims 1-12.

Images