CN101657018A - Indicating method and base station, decoding method and terminal for wireless channel resource allocation - Google Patents

Abstract

The present invention provides a method for indicating wireless channel resource allocation, indicating a starting position and an ending position of m group(s) distributed to a terminal, and indicating a first RBG and a last RBG for a group containing at least two RBGs; when the group contains one RBG and is not the last one, indicating the RBG contained by the group and a previous RBG of a firstRBG contained by a next group; when the group only contain one RBG and is the last one, indicating the RBG and a virtual RBG; or when the group only contain one RBG and is not the first one, indicating a following RBG of the last RBG contained by a previous group, and the RBG contained by the group; when the group only contain one RBG and is the first one, indicating a virtual RBG and the RBG contained by the group. The invention also provides a corresponding decoding method, a base station and a terminal for the wireless channel resource allocation. According to the invention, no matter whatis a number m of the groups, it is nothing remains but to add one virtual RBG only, such that signalling spending is minimum.

Description

Indication method of wireless channel resource allocation, base station, decoding method and terminal

Technical Field

The present invention relates to the field of mobile communications, and in particular, to an indication method and a base station for allocating radio channel resources, a decoding method and a terminal.

Background

An LTE (Long Term Evolution) system controls transmission of a Physical Uplink Shared Channel (PUSCH) of a User Equipment (UE) in a base station centralized scheduling manner.

In the LTE system, the PUSCH of multiple user terminals in a cell is frequency division multiplexed with the uplink system bandwidth, i.e. the PUSCHs of different UEs are orthogonal in the frequency domain. And the base station indicates, through an Uplink Scheduling Grant (UL Grant), a radio channel resource allocated to the PUSCH of a certain UE.

The uplink channel resource allocation of the LTE system is in units of resource blocks. The Resource block is used to describe mapping of a Physical Channel (Physical Channel) to a Resource Element (RE). Two resource blocks are defined in the system: physical Resource Block (PRB) and Virtual Resource Block (VRB).

One physical resource block PRB occupies N in frequency domain_SC ^RBA number of consecutive subcarriers (subcarriers) occupying N in the time domain_symb ^ULA number of consecutive symbols. Wherein $N_{\mathrm{SC}}^{\mathrm{RB}}=12,$ The subcarrier spacing is 15kHz, i.e. the width of one PRB in the frequency domain is 180 kHz. For a Normal cyclic prefix (Normal CP for short), $N_{\mathrm{symb}}^{\mathrm{UL}}=7,$ for Extended cyclic prefix (Extended CP for short), $N_{\mathrm{symb}}^{\mathrm{UL}}=6,$ i.e. the length of one PRB in the time domain is one slot (0.5 ms). Thus, one PRB includes N_symb ^UL×N_SC ^RBAnd (4) a resource unit. In one slot, the index of PRB is n_PRBWherein $n_{\mathrm{PRB}}=0,...,N_{\mathrm{RB}}^{\mathrm{UL}}-1,$ N_RB ^ULthe number of PRBs corresponding to the bandwidth of the uplink system; the index pair of RE is (k, l), where, $k=0,...,N_{\mathrm{RB}}^{\mathrm{UL}}{N}_{\mathrm{sc}}^{\mathrm{RB}}-1$ in order to be indexed in the frequency domain, $l=0,...,N_{\mathrm{symb}}^{\mathrm{UL}}-1$ is a time domain index, then

Taking a conventional cyclic prefix as an example, the structure of the PRB is shown in fig. 1.

One virtual resource block VRB has the same structure and size as a PRB. Two types of VRBs are defined, distributed VRBs (virtual resource blocks of distributed type) and centralized VRBs (virtual resource blocks of localized type). When allocating resources, a pair of VRBs located in two time slots in a subframe (subframe) is allocated together, and the pair of VRBs has an index n_VRB。

Localized VRBs are mapped directly onto PRBs, i.e.

n_PRB＝n_VRB

The distributed PRBs are mapped onto the PRBs according to a certain rule, i.e.

n_PRB＝f(n_VRB，n_s)

Wherein n is_s0, 19 is the slot number within one radio frame (frame, 10 ms). The mapping of VRBs to PRBs is different on two slots within one subframe.

As shown in fig. 2, the resource allocation of the PUSCH is in a centralized (Localized) allocation manner, that is, the PUSCH of one UE occupies a continuous bandwidth in the frequency domain, and is a part of the entire uplink system bandwidth. The bandwidth includes a set of consecutive PRBs, the number of PRBs being M_RB ^PUSCHContaining the number of consecutive subcarriers of

<math> <mrow> <msubsup> <mi>M</mi> <mi>sc</mi> <mi>PUSCH</mi> </msubsup> <mo>=</mo> <msubsup> <mi>M</mi> <mi>RB</mi> <mi>PUSCH</mi> </msubsup> <mo>&CenterDot;</mo> <msubsup> <mi>N</mi> <mi>sc</mi> <mi>RB</mi> </msubsup> </mrow> </math>

And the base station allocates a group of continuous VRBs to the UE through an uplink scheduling grant signaling UL grant. Specifically, a Resource Indication Value (RIV) is given in a Resource allocation field (Resource allocation field) of the UL grant. RIV indicates the starting position RB of a group of consecutive VRBs according to a tree representation method_STARTAnd length L_CRBsWherein, RB_STARTFor the index of the starting VRB in the set of consecutive VRBs, L_CRBsThe number of VRBs contained for the set of consecutive VRBs.

An LTE-Advanced system (LTE-a system for short) is a next-generation evolution system of the LTE system. As shown in fig. 3, the LTE-a system extends a transmission bandwidth by using a carrier aggregation (carrier aggregation) technique, and each aggregated carrier is referred to as a "component carrier". The multiple component carriers may be contiguous or non-contiguous, and may be located in the same frequency band (band) or in different frequency bands.

In the LTE-a system, the PUSCH of a user equipment in one component carrier may adopt a continuous or discontinuous resource allocation manner according to the indication of system signaling. The continuous resource allocation, i.e. a centralized resource allocation manner, means that the PUSCH of the user terminal occupies a continuous bandwidth in one component carrier; the discontinuous resource allocation means that the PUSCH of the user terminal occupies multiple bands of bandwidths in one component carrier, the bandwidths are discontinuous, each band of bandwidths includes a group of continuous PRBs, and is called a cluster (cluster), as shown in fig. 4.

How to indicate the allocated channel resources through system signaling for the PUSCH allocated with discontinuous resources and save signaling overhead as much as possible becomes an urgent problem to be solved.

Downlink channel resources of the LTE system are allocated with 3 types, type 0, type 1, and type 2, where type 0 and type 1 allocate channel resources in units of Resource Block Groups (RBGs). An RBG is defined as a set of contiguous PRBs, and the size of the resource block set (RBG size, i.e. the number of PRBs involved) is a function of the system bandwidth. As shown in table 1, the LTE system bandwidth may be configured to be 1.4MHz, 3MHz, 5MHz, 10MHz, 15MHz, and 20MHz, and the number of PRBs is 6, 15, 25, 50, 75, and 100. According to different system bandwidth N_RB ^DLThe sizes of the resource block groups are also different, i.e. the granularity (granularity) of the resource allocation is different, see table 2.

TABLE 1LTE System Bandwidth

Channel bandwidth BWChannel[MHz](System Bandwidth)	1.4	3	5	10	15	20
							Transmission bandwidth configuration NRB(Transmission Bandwidth configuration)	6	15	25	50	75	100

Table 2 size of resource block group

System Bandwidth RBG Size

N_RB ^DL(#PRB) P(#PRB)

≤10 1

11-26 2

27-63 3

64-110 4

In the research on the uplink of the LTE-a system, it is proposed that the contiguous resource allocation within one component carrier is in units of PRBs, and the non-contiguous resource allocation is in units of RBGs.

When the discontinuous resources are distributed, the base station distributes a plurality of discontinuous clusters to the user terminal through an uplink scheduling authorization signaling, and each cluster comprises a group of continuous RBGs. The signaling indicates the starting and ending locations of each cluster. Wherein the start position is represented as an index of a first RBG of each cluster, and the end position is represented as an index of a last RBG of each cluster. Assuming that the number of RBGs corresponding to the system bandwidth of one component carrier is N, adopting discontinuous resource allocation, dividing the resource into m clusters on a frequency domain, and indicating the positions of the first and last RBGs of each cluster, then indicating the positions of 2m RBGs in the N RBGs in total. According to a combined formula, require

<math> <mrow> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfrac> <mrow> <mi>N</mi> <mo>!</mo> </mrow> <mrow> <mrow> <mo>(</mo> <mi>N</mi> <mo>-</mo> <mn>2</mn> <mi>m</mi> <mo>)</mo> </mrow> <mo>!</mo> <mo>&CenterDot;</mo> <mn>2</mn> <mi>m</mi> <mo>!</mo> </mrow> </mfrac> </mrow> </math>

And (4) a state. Fig. 5(1) shows an example where N is 9 and m is 2.

It should be noted that the above method requires each cluster to contain at least 2 RBGs, and cannot indicate the case where a cluster or clusters only contain 1 RBG. In order to solve this problem, m virtual RBGs are added to N RBGs, and when one or more of the m virtual RBGs are included in the 2m RBGs indicated by the signaling, this indicates that the corresponding cluster or clusters only include 1 RBG, fig. 5(2), (3), (4) and (5) are three examples where N is 9 and m is 2, and the added 2 virtual RBGs are used to indicate that 2 clusters only include 1 RBG. Then the positions of 2m RBGs in the N +2 RBGs need to be indicated, and according to the combination formula, the positions of 2m RBGs in the N +2 RBGs need to be indicated

<math> <mrow> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>2</mn> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <mi>N</mi> <mo>+</mo> <mn>2</mn> <mo>)</mo> </mrow> <mo>!</mo> </mrow> <mrow> <mrow> <mo>(</mo> <mi>N</mi> <mo>+</mo> <mn>2</mn> <mo>-</mo> <mn>2</mn> <mi>m</mi> <mo>)</mo> </mrow> <mo>!</mo> <mo>&CenterDot;</mo> <mn>2</mn> <mi>m</mi> <mo>!</mo> </mrow> </mfrac> </mrow> </math>

And (4) a state.

The above method has the following disadvantages:

1) only the total state number is given, and the indication method and the decoding method corresponding to each state (each possible resource allocation position) are not given;

2) if the clustering number is m, m virtual RBGs are required to be added, and a certain number of redundant states exist. Because there is no continuity from cluster to cluster, the last RBG of the previous cluster is not adjacent to the first RBG of the next cluster, and arbitrarily selecting 2m RBGs from N or N +2 RBGs includes the case of continuity from cluster to cluster.

Disclosure of Invention

The technical problem to be solved by the present invention is to provide an indication method for wireless channel resource allocation, a base station, a decoding method and a terminal, which can indicate the resource location and save signaling.

In order to solve the above problems, the present invention provides an indication method for allocating radio channel resources, where a base station allocates m non-consecutive clusters to a terminal on a component carrier, each cluster includes one or more consecutive Resource Block Groups (RBGs), the base station sends an uplink scheduling grant signaling to the terminal, the uplink scheduling grant signaling indicates a start position and an end position of the m clusters by using a resource allocation index, the m clusters are sorted according to increasing or decreasing frequency, and a virtual RBG is added, then:

for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is the previous RBG of the first RBG contained in the next cluster of the cluster; when the cluster only contains one RBG and the cluster is the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is a virtual RBG;

or, for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not a first cluster, the starting position of the cluster is a RBG behind the last RBG contained in the previous cluster of the cluster, and the ending position of the cluster is the RBG contained in the cluster; when the cluster only contains one RBG and the cluster is the first cluster, the starting position of the cluster is a virtual RBG, and the ending position of the cluster is the RBG contained in the cluster.

Further, the method may further have the following characteristics that the base station indicates the position of the RBG by using an RBG index, the indexes of N RBGs corresponding to a bandwidth used for Physical Uplink Shared Channel (PUSCH) discontinuous resource allocation in one component carrier are 1, 2,.. and N according to an ascending or descending order of frequency, and the index of the virtual RBG is N + 1; or the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are 2, 3.

Further, the method may further have the following characteristic that the resource allocation index is obtained according to the following formula:

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

wherein r is a resource allocation index, N is the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation in the component carrier, s_kK is 0.. 2m-1 is the index of 2m RBGs corresponding to the start and end positions of the m non-consecutive clusters, s_k＜s_k+1，(s_2n，s_2n+1) N is 0, and m-1 is an index of the starting position and the ending position RBG of the nth cluster in the m clusters.

Further, the method may further have the following characteristic that the base station determines the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation in one component carrier as follows: in one component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is N_RB ^PUSCH， <math> <mrow> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>PUSCH</mi> </msubsup> <mo>&le;</mo> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>UL</mi> </msubsup> <mo>,</mo> </mrow> </math> Wherein N is_RB ^ULThe number of PRBs corresponding to the system bandwidth of a component carrier, the discontinuous resource allocation in a component carrier is in units of resource block groups, the size of a resource block group is a function of the system bandwidth of the component carrier, or a function of the bandwidth used for PUSCH discontinuous resource allocation on the component carrier, if the size of the resource block group is P PRBs, the number of RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in a component carrier is P

Wherein, if $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=0,$ The size of each RBG is P; if it is not $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P>0,$ Then is front

The size of one RBG is P, and the size of the last 1 RBG is P

And the base station informs the terminal of the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier through system information, or sends parameters related to the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier to the terminal.

Further, the method may further have the following characteristic that the base station further agrees with the terminal on the number m of clusters, or informs the terminal of the number m of clusters through system information, or sends a parameter related to the number m of clusters to the terminal through the system information, or informs the terminal of the number m of clusters on the component carrier of PUSCH discontinuous resource allocation transmission scheduled at this time through the uplink scheduling authorization signaling.

The invention also provides a decoding method for wireless channel resource allocation, a terminal receives the uplink scheduling authorization signaling, and decodes the RBG indexes s of 2m starting positions and ending positions of m clusters from the resource allocation index carried in the uplink scheduling authorization signaling_k，k＝0，...2m-1，s_k＜s_k+1The method comprises the following steps:

the terminal judges s_2m-1Whether the index of the RBG is a virtual RBG or not, if so, the last cluster only contains one RBG, and the index of the RBG is s_2m-2(ii) a Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1) (ii) a For the nth cluster, n is 0_2n+1Whether or not s is_2n+2The index of the RBG before the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2nOtherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)；

Or,

the terminal judges s₀If the index is the index of the virtual RBG, if so, the 0 th cluster only contains one RBG, and the index of the RBG is s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁) (ii) a For the nth cluster, n 1.., m-1, judge s_2nWhether or not s is_2n-1The index of the RBG next to the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2n+1Otherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)。

Further, the method may further have the following characteristic that when N RBGs corresponding to a bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted by frequency increment or decrement, and the index of the RBGs is 1, 2.

If s_2m-1N +1, the last cluster contains only 1 RBG with index s_2m-2Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1)；

For a value of n-0, the ratio,.., any cluster in m-2, if s_2n+1＝s _2n+21, then the cluster contains only 1 RBG with index s_2nn-0,.., m-2; otherwise,(s)_2n，s_2n+1) Indexes of a first RBG and a last RBG of an nth cluster;

or,

when the index of the virtual RBG is 1, N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are ordered by increasing or decreasing frequency with an index of 2, 3.

If s ₀1, the 0 th cluster contains only 1 RBG with index s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁)；

For any cluster of n-1, m-1, if s_2n＝s_2n-1+1, the cluster contains only 1 RBG with index s_2n+1 n 1, m-1, otherwise,(s)_2n，s_2n+1) The index of the first RBG and the last RBG of the nth cluster.

Further, the above method may have a feature that the terminal decodes s from the resource allocation index according to_k}_k＝0 ^2m-1：

Step 701, taking initial values i-0 and s-1, and taking the initial value of r as a resource allocation index value;

step 702, calculate the number of combinations

$p=\left(\begin{array}{c}N+1-\mathrm{<figure-callout\; id="2m"\; label="s"\; filenames="A2009101656870047H1.png,A2009101656870048H1.png"\; state="\{\{state\}\}">s</figure-callout>}\\ 2m-i\end{array}\right)$

Step 703, if p > r, s ═ s +1, and then jump to step 702; otherwise, s_iS; step 704, calculate

s＝s+1

r＝r-p

i＝i+1

Step 705, if i is less than or equal to 2m-1, jumping to step 702; otherwise, ending.

Further, the method may further have a characteristic that the terminal obtains the N value through system information, or the terminal obtains N according to a relevant parameter configured by the system information.

Further, the method may further have the following characteristic that m is a system default value, or the terminal obtains m from system information, or obtains m from a relevant parameter configured by the system information, or obtains the cluster number m of the PUSCH discontinuous resource allocation transmission of the current scheduling on the component carrier from the uplink scheduling grant signaling.

The present invention also provides a base station, the base station is configured to allocate m non-consecutive clusters to a terminal on a component carrier, each cluster includes one or more consecutive RBGs, transmit an uplink scheduling grant signaling to the terminal, indicate a start position and an end position of the m clusters using a resource allocation index in the uplink scheduling grant signaling, the m clusters are ordered in ascending or descending frequency, and if a virtual RBG is added, then:

for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is the previous RBG of the first RBG contained in the next cluster of the cluster; when the cluster only contains one RBG and the cluster is the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is a virtual RBG;

or, for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not a first cluster, the starting position of the cluster is a RBG behind the last RBG contained in the previous cluster of the cluster, and the ending position of the cluster is the RBG contained in the cluster; when the cluster only contains one RBG and the cluster is the first cluster, the starting position of the cluster is a virtual RBG, and the ending position of the cluster is the RBG contained in the cluster.

Further, the base station may further include a feature that the base station is configured to indicate a location of the RBG by using an RBG index, indexes of N RBGs corresponding to a bandwidth used for PUSCH discontinuous resource allocation in one component carrier are 1, 2,. multidot.n in an ascending or descending order of frequency, and an index of the virtual RBG is N + 1; or the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are 2, 3.

Further, the base station may further have the following feature, and the base station is configured to obtain the resource allocation index according to the following formula:

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

wherein r is a resource allocation index, N is the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation in the component carrier, s_kK is 0.. 2m-1 is the m non-consecutiveIndex s of 2m RBGs corresponding to start and end positions of a cluster_k＜s_k+1Wherein(s)_2n，s_2n+1) N is 0, and m-1 is an index of the starting position and the ending position RBG of the nth cluster in the m clusters.

Further, the base station may further have the following characteristic that the base station is further configured to determine the number of RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier as follows: in one component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is N_RB ^PUSCH， <math> <mrow> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>PUSCH</mi> </msubsup> <msubsup> <mrow> <mo>&le;</mo> <mi>N</mi> </mrow> <mi>RB</mi> <mi>UL</mi> </msubsup> <mo>,</mo> </mrow> </math> Wherein N is_RB ^ULThe number of PRBs corresponding to the system bandwidth of a component carrier, the discontinuous resource allocation in a component carrier is in units of resource block groups, the size of a resource block group is a function of the system bandwidth of the component carrier, or a function of the bandwidth used for PUSCH discontinuous resource allocation on the component carrier, if the size of the resource block group is P PRBs, the number of RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in a component carrier is P

Wherein, if $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=0,$ The size of each RBG is P; if it is not $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P>0,$ Then is front

The size of one RBG is P, and the size of the last 1 RBG is P

And the base station informs the terminal of the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier through system information, or sends parameters related to the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier to the terminal.

Further, the base station may further have the following characteristic that the base station is further configured to agree with the terminal on the number m of clusters, or inform the terminal of the number m of clusters through system information, or send a parameter related to the number m of clusters to the terminal through system information, or inform the terminal of the number m of clusters on the component carrier through the uplink scheduling authorization signaling, where the PUSCH discontinuous resource is allocated and transmitted in the current scheduling.

The invention also provides a terminal, which is used for receiving the uplink scheduling authorization signaling and decoding the RBG indexes s of 2m starting positions and ending positions of m clusters from the resource allocation index carried in the uplink scheduling authorization signaling_k，k＝0，...2m-1，s_k＜s_k+1And is also used for:

judgment s_2m-1Whether the index of the RBG is a virtual RBG or not, if so, the last cluster only contains one RBG, and the index of the RBG is s_2m-2(ii) a Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1) (ii) a For the nth cluster, n is 0_2n+1Whether or not s is_2n+2The index of the RBG before the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2nOtherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)；

Or,

judgment s₀If the index is the index of the virtual RBG, if so, the 0 th cluster only contains one RBG, and the index of the RBG is s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁) (ii) a For the nth cluster, n 1.., m-1, judge s_2nWhether or not s is_2n-1The index of the RBG next to the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2n+1Otherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)。

Further, the terminal may further have the following feature, and the terminal is configured to decode the indexes of the first RBG and the last RBG of each cluster as follows:

when N RBGs corresponding to a bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted by frequency in an ascending or descending manner with an index of 1, 2.. N, and an index of a virtual RBG is N +1, then:

if s_2m-1N +1, the last cluster contains only 1 RBG with index s_2m-2Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1)；

For any cluster of n-0, 1, m-2, if s_2n+1＝s _2n+21, then the cluster contains only 1 RBG with index s_2nn-0,.., m-2; otherwise,(s)_2n，s_2n+1) Indexes of a first RBG and a last RBG of an nth cluster;

or,

when the index of the virtual RBG is 1, N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are ordered by increasing or decreasing frequency with an index of 2, 3.

If s ₀1, the 0 th cluster contains only 1 RBG with index s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁)；

For any cluster of n-1, m-1, if s_2n＝s_2n-1+1, the cluster contains only 1 RBG with index s_2n+1 n 1, m-1, otherwise,(s)_2n，s_2n+1) The index of the first RBG and the last RBG of the nth cluster.

Further, the terminal may also have a feature of being further configured to decode { s } from the resource allocation index according to_k}_k＝0 ^2m-1：

Step 701, taking initial values i-0 and s-1, and taking the initial value of r as a resource allocation index value;

step 702, calculate the number of combinations

$p=\left(\begin{array}{c}N+1-\mathrm{<figure-callout\; id="2m"\; label="s"\; filenames="A2009101656870047H1.png,A2009101656870048H1.png"\; state="\{\{state\}\}">s</figure-callout>}\\ 2m-i\end{array}\right)$

Step 703, if p > r, s ═ s +1, and then jump to step 702; otherwise, s_i＝s；

Step 704, calculate

s＝s+1

r＝r-p

i＝i+1

Step 705, if i is less than or equal to 2m-1, jumping to step 702; otherwise, ending.

Further, the terminal may further have a feature that the terminal is further configured to obtain the N value through system information or obtain N according to related parameters configured by the system information.

Further, the terminal may further have a characteristic that the terminal is configured to use a system default value m, or obtain m from system information, or obtain m from a relevant parameter configured by the system information, or obtain a cluster number m of PUSCH discontinuous resource allocation transmission on the component carrier in the current scheduling from the uplink scheduling grant signaling.

The indication method of the discontinuous resource allocation provided by the invention can represent all possible resource allocation conditions under the determined clustering number, and has no limit on the position and the size of the cluster. Meanwhile, the premise that clusters are not continuous is fully utilized, no matter the number m of clusters is, only 1 virtual RBG needs to be added, so that the signaling overhead is minimum.

Drawings

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:

fig. 1 is a schematic diagram of a physical resource block structure of an LTE system (taking a conventional cyclic prefix as an example);

fig. 2 is a schematic diagram of a physical uplink shared channel structure of an LTE system (taking a conventional cyclic prefix as an example);

fig. 3 is a schematic diagram of carrier aggregation for LTE-a system;

fig. 4 is a schematic diagram of PUSCH discontinuous resource allocation in one component carrier of an LTE-a system;

fig. 5 is an exemplary schematic diagram of N-9, m-2;

FIG. 6 is a flowchart of the resource allocation index decoding algorithm of the present invention;

FIG. 7 is a flowchart of the resource allocation index decoding algorithm of the present invention (II).

Detailed Description

The present invention will be described in detail below with reference to examples and the accompanying drawings.

In the present invention, the binomial coefficient (or called combination number) is defined as

<math> <mrow> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mfrac> <mrow> <mi>n</mi> <mo>!</mo> </mrow> <mrow> <mi>k</mi> <mo>!</mo> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mi>k</mi> <mo>)</mo> </mrow> <mo>!</mo> </mrow> </mfrac> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mi>k</mi> <mo>></mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

Wherein n and k are all non-negative integers, n! Denotes the factorial of n, 0! 1.

The method for indicating the wireless channel resource allocation comprises the following steps:

the base station distributes m discontinuous clusters for the terminal on a component carrier, each cluster comprises one or more continuous Resource Block Groups (RBGs), the base station sends an uplink scheduling authorization signaling to the terminal, indicates the starting position and the ending position of the m discontinuous clusters distributed for the terminal, and adds a virtual RBG, the m clusters are sorted according to the ascending or descending frequency, and the indication of the starting position and the ending position of the m clusters is as follows:

the method (I): for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is the previous RBG of the first RBG contained in the next cluster of the cluster; when the cluster only contains one RBG and the cluster is the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is a virtual RBG;

alternatively, method (ii): for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not the first cluster, the starting position of the cluster is a RBG behind the last RBG of the previous cluster of the cluster, and the ending position of the cluster is the RBG contained in the cluster; when the cluster only contains one RBG and the cluster is the first cluster, the starting position of the cluster is a virtual RBG, and the ending position of the cluster is the RBG contained in the cluster.

Wherein the indicating the location of the RBG using the RBG index comprises:

in the method (one), the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted in a frequency increasing or decreasing manner to be 1, 2.

In the method (two), the index of the virtual RBG is 1, and the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted by increasing or decreasing frequency to be 2, 3.

m clusters of 2m RBG indices, using s_k}_k＝0 ^2m-1，1≤s_k≤N+1，s_k＜s_k+1Index of 2m RBGs representing the m clusters,(s)_2n，s_2n+1) n-0, m-1 is the RBG index of the start and end positions of the nth cluster, the 0 th cluster is the first cluster, and the m-1 th cluster is the last cluster.

Further, the uplink scheduling grant signaling indicates the starting position and the ending position of m non-consecutive clusters allocated to the terminal by using a Resource allocation Index r, where the Resource Allocation Index (RAI) or Resource Indication Value (RIV) r is obtained according to the following formula:

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

possible values of r are <math> <mrow> <mn>0</mn> <mo>,</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>,</mo> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mn>1</mn> <mo>.</mo> </mrow> </math>

And N is the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier. { s_k}_k＝0 ^2m-1Index of 2m RBGs for m clusters,(s)_2n，s_2n+1) n-0., m-1 is an index of the RBG of the start position and the end position of the nth cluster. In the present invention, r is not limited to the above formula, and { s } is used instead_k}_k＝0 ^2m-1Get r and uniquely decode s_k}_k＝0 ^2m-1The method of (3) can be applied to the present invention.

In LTE-A system, one component carrier is used for PUSCH discontinuous resourcesThe number of PRBs corresponding to the source-allocated bandwidth range is N_RB ^PUSCH， <math> <mrow> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>PUSCH</mi> </msubsup> <mo>&le;</mo> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>UL</mi> </msubsup> <mo>,</mo> </mrow> </math> Wherein N is_RB ^ULThe number of PRBs corresponding to the system bandwidth of one component carrier. In the uplink of the LTE-a system, the non-contiguous resource allocation within a component carrier is in units of Resource Block Groups (RBGs), the size of a resource block group (RBG size) being a function of the system bandwidth of the component carrier or a function of the bandwidth on the component carrier for PUSCH non-contiguous resource allocation. If the size of the resource block group is P PRBs, the number of RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier is P

Wherein, if $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=0,$ The size of each RBG is P; if it is not $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P>0,$ Then is front

The size of one RBG is P, and the size of the last 1 RBG is P

N is known to the base station and may be notified to the user terminal through System Information (System Information), or parameters related to N may be transmitted to the user terminal through the System Information, and the user terminal may obtain N according to the related parameters configured by other System Information.

Assuming that a user equipment uses non-continuous resource allocation, the user equipment is divided into m clusters in the frequency domain, each cluster comprises a group of continuous RBGs,

m may be a default value of the system, and is known to both the base station and the user terminal, for example, m is 2; or cell-specific or carrier-specific, the base station informs the user equipment through system information, or the user equipment obtains m according to related parameters configured by the system information, for example, m is a function of the system bandwidth of one component carrier or a function of the bandwidth used for PUSCH discontinuous resource allocation on one component carrier, and when allocating discontinuous resources, the user equipment determines the number of clusters on one component carrier according to the corresponding bandwidth; m may also be terminal-specific (UE-specific), and the base station informs, through the uplink scheduling grant signaling, the user terminal of the number m of clusters on a certain component carrier of the PUSCH discontinuous resource allocation transmission scheduled this time, for example, indicating m as 2 or 3 with 1bit in the uplink scheduling grant signaling.

Thus, each cluster, whether containing 1 or more RBGs, requires an RBG indicating a start position and an RBG indicating an end position. For m discontinuous clusters, the positions of 2m RBGs in N +1 RBGs need to be indicated, and according to a combined formula, the positions of 2m RBGs in N +1 RBGs need to be indicated

<math> <mrow> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>!</mo> </mrow> <mrow> <mrow> <mo>(</mo> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <mn>2</mn> <mi>m</mi> <mo>)</mo> </mrow> <mo>!</mo> <mo>&CenterDot;</mo> <mn>2</mn> <mi>m</mi> <mo>!</mo> </mrow> </mfrac> </mrow> </math>

And (4) a state.

The invention also provides a decoding method for wireless channel resource allocation, after receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index therein and the following steps to obtain the specific positions of m discontinuous clusters allocated by the base station:

decoding from r yields the starting and ending position indices s for m non-consecutive clusters_k}_k＝0 ^2m-1The index of the nth cluster is(s)_2n，s_2n+1)，n＝0，...，m-1；

Method (one) in the corresponding resource allocation indication method:

judgment s_2m-1Whether the index of the RBG is a virtual RBG or not, if so, the last cluster only contains one RBG, and the index of the RBG is s_2m-2(ii) a Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1) (ii) a For the nth cluster, n is 0_2n+1Whether or not s is_2n+2The index of the RBG before the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2nOtherwise, the nth cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2n，s_2n+1)；

Or, a method (ii) in the corresponding resource allocation indication method:

judgment s₀If the index is the index of the virtual RBG, if so, the 0 th cluster only contains one RBG, and the index of the RBG is s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁) (ii) a For the nth cluster, n 1.., m-1, judge s_2nWhether or not s is_2n-1Of indicated RBGThe index of the latter RBG, if yes, the nth cluster only contains one RBG with the index of s_2n+1Otherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)。

In the method (one) of the corresponding resource allocation indication methods, when N RBGs corresponding to a bandwidth used for PUSCH discontinuous resource allocation in one component carrier are ordered by increasing or decreasing frequency with an index of 1, 2.

If s_2m-1N +1, that is, the last RBG indicated by the signaling is a virtual RBG, the last cluster (m-1 th cluster) contains only 1 RBG with the index s_2m-2The first RBG of the last cluster indicated by the signaling;

if s_2n+1＝s_2n+21 n-0.,. m-2, that is, the index (k 2n +1, which is an odd number) of the last RBG of any one cluster (nth cluster) in the previous m-1 cluster indicated by the signaling is smaller than the index (k 2n +2, which is an even number) of the next RBG adjacent to the last RBG by 1, the cluster only contains 1 RBG whose index is s_2nn-0.., m-2, the first RBG of the cluster indicated by the signaling;

otherwise,(s)_2n，s_2n+1) n-0., m-1 is the index of the first and last RBG of the nth cluster;

the specific flow chart is shown in fig. 6, and includes:

step 601, decoding from r to obtain { s }_k}_k＝0 ^2m-1；

Step 602, judging whether the last RBG is a virtual RBG; if yes, go to step 603, otherwise, go to step 604;

step 603, s_2m-1N +1, that is, the last RBG indicated by the signaling is a virtual RBG, the last cluster (m-1 th cluster) contains only 1 RBG with the index s_2m-2The first RBG of the last cluster indicated by the signaling; step 605 is transferred;

step 604, the last cluster (m-1) at least contains 2 RBGs, and the indexes of the first and last RBGs of the m-1 cluster are(s)_2m-2，s_2m-1)；

Step 605, determining whether the index (k ═ 2n +1, which is an odd number) of the last RBG of any one cluster (nth cluster) in the previous m-1 clusters is smaller than the index (k ═ 2n +2, which is an even number) of the next RBG adjacent to the index (k ═ 2n +2, which is an even number) by 1; if yes, go to step 606; otherwise, go to step 607;

step 606, if yes, i.e. s_2n+1＝s_2n+21 n-0.., m-2, then the cluster contains only 1 RBG indexed s_2nn-0.., m-2, i.e., the first RBG of the cluster indicated by the signaling, ends;

step 607, the cluster at least comprises 2 RBGs,(s)_2n，s_2n+1) n-0,.. m-2 is the index of the first and last RBG of the nth cluster, ending.

In the above steps, the order of steps 602-604 and 605-607 can be changed.

In method (two) of the corresponding resource allocation indication method, when the index of the virtual RBG is 1, the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted by increasing or decreasing frequency to be 2, 3.. N +1, then:

if s₀If 1, that is, the first RBG indicated by the signaling is a virtual RBG, the 0 th cluster only contains 1 RBG with the index s₁I.e. the last RBG of cluster 0 indicated by the signaling;

if s_2n＝s_2n-1If +1 n is 1, so, m-1, that is, the index (k 2n, which is an even number) of the first RBG of any one cluster (nth cluster) in the m-1 cluster after the signaling instruction is greater than the index (k 2n-1, which is an odd number) of the previous RBG adjacent to the first RBG by 1, the cluster only contains 1 RBG whose index is s_2n+1n-1, i.e., the last RBG of the cluster indicated by the signaling;

otherwise,(s)_2n，s_2n+1) n-0., m-1 is the index of the first and last RBG of the nth cluster;

the specific process comprises the following steps:

step 801, decode from r to obtain s_k}_k＝0 ^2m-1；

Step 802, judging whether the first RBG is a virtual RBG; if yes, go to step 803, otherwise, go to step 804;

step 803, s₀If 1, that is, the first RBG indicated by the signaling is a virtual RBG, the 0 th cluster only contains 1 RBG with the index s₁I.e. the first RBG of cluster 0 indicated by the signaling; turning to step 805;

step 804, the 0 th cluster at least comprises 2 RBGs, and the indexes of the first RBG and the last RBG of the 0 th cluster are respectively(s)₀，s₁)；

Step 805, determining whether the index (k ═ 2n, even number) of the first RBG of any one (nth cluster) of the m-1 clusters is greater than the index (k ═ 2n-1, odd number) of the immediately preceding RBG by 1; if yes, go to step 806; otherwise, go to step 807;

step 806, if yes, i.e. s_2n＝s_2n-11.. m-1, then the cluster contains only 1 RBG indexed s_2n+1n-1, m-1, the last RBG of the cluster indicated by the signaling, ends;

step 807, the cluster comprises at least 2 RBGs(s)_2n，s_2n+1) n 1, m-1 is the index of the first and last RBG of the nth cluster, ending.

In the above steps, the sequence of steps 802-804 and 805-807 can be changed.

Decoding from the resource allocation index r yields s_k}_k＝0 ^2m-1Wherein r isThe resource allocation index in the uplink scheduling grant signaling received by the user terminal, N is the number of RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier, m is the number of clusters, and the flowchart of the decoding algorithm is shown in fig. 7, which specifically includes:

step 701, taking initial values i-0 and s-1, and taking the initial value of r as a resource allocation index value;

step 702, calculate the number of combinations

$p=\left(\begin{array}{c}N+1-\mathrm{<figure-callout\; id="2m"\; label="s"\; filenames="A2009101656870047H1.png,A2009101656870048H1.png"\; state="\{\{state\}\}">s</figure-callout>}\\ 2m-i\end{array}\right)$

Step 703, if p > r, s ═ s +1, and then jump to step 702; otherwise, s_i＝s；

Step 704, calculate

s＝s+1

r＝r-p

i＝i+1

Step 705, if i is less than or equal to 2m-1, jumping to step 702; otherwise, ending.

The terminal can also store a comparison table, and the corresponding comparison table is searched according to the resource allocation index r, the RBG number N and the clustering number m to obtain the starting position and the ending position of the m clusters.

Example one

In an LTE-A system, the system bandwidth of one component carrier is assumed to be 20MHz, and the corresponding PRB number is assumed to be $N_{\mathrm{RB}}^{\mathrm{UL}}=100;$ Within the component carrier, for PUSCH non-contiguous resourcesThe number of PRBs corresponding to the bandwidth range of the source allocation is $N_{\mathrm{RB}}^{\mathrm{PUSCH}}=N_{\mathrm{RB}}^{\mathrm{UL}}=100;$ The size of the resource block group is P ═ 4, and the number of RBGs corresponding to the system bandwidth of the component carrier (i.e. the bandwidth used for PUSCH discontinuous resource allocation) is

And, because of

$N_{\mathrm{RB}}^{\mathrm{UL}}\mathrm{mod}P=100\mathrm{<figure-callout\; id="4"\; label="mod"\; filenames="A2009101656870046H1.png"\; state="\{\{state\}\}">mod</figure-callout>}4=0$

Each RBG is 4 PRBs in size.

The base station informs the user terminal of the PRB number corresponding to the system bandwidth of a certain component carrier wave through the system information $N_{\mathrm{RB}}^{\mathrm{UL}}=100.$ The user terminal determines the size of a resource block group RBG on the component carrier as P-4 according to the system bandwidth of the component carrier, and calculates the number of RBGs corresponding to the bandwidth for distributing the PUSCH discontinuous resources as

When the resources are not continuously allocated, the system defaults to m being 3, namely 3 clusters are allocated on the frequency domain.

Example two

In an LTE-A system, the system bandwidth of one component carrier is assumed to be 15MHz, and the corresponding PRB number is assumed to be $N_{\mathrm{RB}}^{\mathrm{UL}}=75,$ In the component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is $N_{\mathrm{RB}}^{\mathrm{PUSCH}}=N_{\mathrm{RB}}^{\mathrm{UL}}=75;$ The size of the resource block group is P ═ 4, and the number of RBGs corresponding to the system bandwidth of the component carrier (i.e. the bandwidth used for PUSCH discontinuous resource allocation) is

And, because of

$N_{\mathrm{RB}}^{\mathrm{UL}}\mathrm{mod}P=75\mathrm{<figure-callout\; id="4"\; label="mod"\; filenames="A2009101656870046H1.png"\; state="\{\{state\}\}">mod</figure-callout>}4=3>0$

The first 18 RBGs are 4 PRBs in size, and the last 1 RBG is

The base station informs the user terminal of the PRB number corresponding to the system bandwidth of a certain component carrier wave through the system information $N_{\mathrm{RB}}^{\mathrm{UL}}=75.$ The user terminal determines the size of a resource block group RBG on the component carrier as P-4 according to the system bandwidth of the component carrier, and calculates the number of RBGs corresponding to the bandwidth for distributing the PUSCH discontinuous resources as

When the discontinuous resource is allocated, the user terminal determines that the number m of the clusters on the component carrier is 2 according to the system bandwidth of the component carrier, that is, the component carrier is divided into 2 clusters in the frequency domain.

EXAMPLE III

In an LTE-A system, the system bandwidth of one component carrier is assumed to be 10MHz, and the corresponding PRB number is assumed to be $N_{\mathrm{RB}}^{\mathrm{UL}}=50;$ In the component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is $N_{\mathrm{RB}}^{\mathrm{PUSCH}}=N_{\mathrm{RB}}^{\mathrm{UL}}=50;$ The size of the resource block group is P ═ 3, and the number of RBGs corresponding to the system bandwidth of the component carrier (i.e. the bandwidth used for PUSCH discontinuous resource allocation) is

And, because of

$N_{\mathrm{RB}}^{\mathrm{UL}}\mathrm{mod}P=50\mathrm{<figure-callout\; id="3"\; label="mod"\; filenames="A2009101656870046H1.png"\; state="\{\{state\}\}">mod</figure-callout>}3=2>0$

The first 16 RBGs are 3 PRBs in size, and the last 1 RBG is

The base station informs the user terminal of the PRB number corresponding to the system bandwidth of a certain component carrier wave through the system information $N_{\mathrm{RB}}^{\mathrm{UL}}=50.$ The user terminal determines the size of the resource block group RBG on the component carrier as P-3 according to the system bandwidth of the component carrier, and calculates the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation as

The base station informs the user terminal through system information, when the discontinuous resource is allocated, the number of clusters on the component carrier, or the clusters m on all the component carriers of the cell is 2, that is, 2 clusters are divided on the frequency domain.

Example four

In an LTE-A system, the system bandwidth of one component carrier is assumed to be 5MHz, and the corresponding PRB number is assumed to be $N_{\mathrm{RB}}^{\mathrm{UL}}=25;$ In the component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is $N_{\mathrm{RB}}^{\mathrm{PUSCH}}=N_{\mathrm{RB}}^{\mathrm{UL}}=25;$ The size of the resource block group is P ═ 2, and the number of RBGs corresponding to the system bandwidth of the component carrier (i.e. the bandwidth used for PUSCH discontinuous resource allocation) is P ═ 2

And, because of

$N_{\mathrm{RB}}^{\mathrm{UL}}\mathrm{mod}P=25\mathrm{<figure-callout\; id="2"\; label="mod"\; filenames="A2009101656870046H1.png,A2009101656870047H1.png"\; state="\{\{state\}\}">mod</figure-callout>}2=1>0$

The first 12 RBGs are 2 PRBs in size, and the last 1 RBG is

The base station informs the user terminal of the PRB number corresponding to the system bandwidth of a certain component carrier wave through the system information $N_{\mathrm{RB}}^{\mathrm{UL}}=25.$ The user terminal determines the size of the resource block group RBG on the component carrier as P2 according to the system bandwidth of the component carrier, and calculates the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation as

The base station informs the user terminal of how many clusters the PUSCH discontinuous resource allocation transmission scheduled this time is divided into on a certain component carrier through an uplink scheduling authorization signaling; or, in the uplink scheduling grant signaling, 1bit is used to indicate that m is 2 or 3.

EXAMPLE five

In an LTE-A system, the system bandwidth of one component carrier is assumed to be 20MHz, and the corresponding PRB number is assumed to be $N_{\mathrm{RB}}^{\mathrm{UL}}=100;$ In the component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is $N_{\mathrm{RB}}^{\mathrm{PUSCH}}=80<N_{\mathrm{RB}}^{\mathrm{UL}};$ The size of the resource block group is P-4, and the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation in the component carrier is

And, because of

$N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=80\mathrm{<figure-callout\; id="4"\; label="mod"\; filenames="A2009101656870046H1.png"\; state="\{\{state\}\}">mod</figure-callout>}4=0$

Each RBG is 4 PRBs in size.

The base station informs the user terminal of the PRB number corresponding to the system bandwidth of a certain component carrier wave through the system information $N_{\mathrm{RB}}^{\mathrm{UL}}=100,$ And informs the user terminal of a parameter PUSCH-hoppingOffset through system information, $N_{\mathrm{RB}}^{\mathrm{HO}}=20.$ the user terminal calculates the PRB number corresponding to the bandwidth range used for PUSCH discontinuous resource allocation in the component carrier wave as

$N_{\mathrm{RB}}^{\mathrm{PUSCH}}=N_{\mathrm{RB}}^{\mathrm{UL}}-N_{\mathrm{RB}}^{\mathrm{HO}}-N_{\mathrm{<figure-callout\; id="2"\; label="RB\; HO\; mod"\; filenames="A2009101656870046H1.png,A2009101656870047H1.png"\; state="\{\{state\}\}">RB</figure-callout>}}^{\mathrm{HO}}\mathrm{mod}2=80$

The user terminal determines the size of a resource block group RBG on the component carrier wave as P-4 according to the bandwidth used for PUSCH discontinuous resource allocation on the component carrier wave, and can calculate to obtain the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation as

When the discontinuous resource is allocated, the user terminal determines that the number m of the clusters on the component carrier is 2 according to the bandwidth used for PUSCH discontinuous resource allocation on the component carrier, that is, 2 clusters are allocated on the frequency domain.

EXAMPLE six

In an LTE-A system, the system bandwidth of one component carrier is assumed to be 10MHz, and the corresponding PRB number is assumed to be $N_{\mathrm{RB}}^{\mathrm{UL}}=50;$ In the component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is $N_{\mathrm{RB}}^{\mathrm{PUSCH}}=40<N_{\mathrm{RB}}^{\mathrm{UL}};$ The size of the resource block group is P-3, and the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation in the component carrier is

And, because of

$N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=40\mathrm{<figure-callout\; id="3"\; label="mod"\; filenames="A2009101656870046H1.png"\; state="\{\{state\}\}">mod</figure-callout>}3=1>0$

The first 13 RBGs are 3 PRBs in size, and the last 1 RBG is

The base station informs the user terminal of the PRB number corresponding to the system bandwidth of a certain component carrier wave through the system information $N_{\mathrm{RB}}^{\mathrm{UL}}=50,$ And informs the user terminal of a parameter PUSCH-hoppingOffset through system information, $N_{\mathrm{RB}}^{\mathrm{HO}}=10.$ the user terminal calculates the PRB number corresponding to the bandwidth range used for PUSCH discontinuous resource allocation in the component carrier wave as

$N_{\mathrm{RB}}^{\mathrm{PUSCH}}=N_{\mathrm{RB}}^{\mathrm{UL}}-N_{\mathrm{RB}}^{\mathrm{HO}}-N_{\mathrm{<figure-callout\; id="2"\; label="RB\; HO\; mod"\; filenames="A2009101656870046H1.png,A2009101656870047H1.png"\; state="\{\{state\}\}">RB</figure-callout>}}^{\mathrm{HO}}\mathrm{mod}2=40$

The user terminal determines the size of a resource block group RBG on the component carrier wave as P-3 according to the bandwidth used for PUSCH discontinuous resource allocation on the component carrier wave, and can calculate to obtain the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation as

The base station informs the user terminal of how many clusters the PUSCH discontinuous resource allocation transmission scheduled this time is divided into on a certain component carrier through an uplink scheduling authorization signaling; or, in the uplink scheduling grant signaling, 1bit is used to indicate that m is 2 or 3.

EXAMPLE seven

In the LTE-a system, the number of RBGs corresponding to a bandwidth range for PUSCH discontinuous resource allocation in one component carrier is assumed to be N-25. The indices of the 25 RBGs are 1, 25 in ascending or descending order of frequency.

Adding 1 virtual RBG on the basis of 25 RBGs, wherein the index of the virtual RBG is 26.

Assume that a user terminal employs discontinuous resource allocation and is divided into 2 clusters (0 th cluster and 1 st cluster) in the frequency domain.

The RBGs indicating the start position and the end position of each cluster, i.e. 4 RBGs,

the positions of 4 RBGs in the 26 RBGs are required to be indicated, and according to a combination formula, the positions of the 4 RBGs in the 26 RBGs are required to be indicated

$\left(\begin{array}{c}26\\ 4\end{array}\right)=14950$

And (4) a state.

The following describes the representation method and decoding method of the present invention by taking the case of allocating 2 clusters of resources with different positions and sizes as an example.

(A)

Suppose that the 0 th cluster contains 1, 2, 3 RBGs and the 1 st cluster contains 5, 6, 7, 8, 9, 10, 11 RBGs.

RBGs indicating the start position and the end position of each cluster, i.e., 4 RBGs, 1, 3, 5, 11, respectively, need to be indicated.

The indices of the 4 RBGs are ordered incrementally as

{s₀，s₁，s₂，s₃}＝{1，3，5，11}

Wherein(s)₀，s₁) And(s)₂，s₃) The indexes of the RBGs of the start position and the end position of the 0 th cluster and the 1 st cluster, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>3</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>26</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>4</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}26-1\\ 4\end{array}\right)+\left(\begin{array}{c}26-3\\ 3\end{array}\right)+\left(\begin{array}{c}26-5\\ 2\end{array}\right)+\left(\begin{array}{c}26-11\\ 1\end{array}\right)$

$=14646$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 2 discontinuous clusters allocated by the base station:

step 601, decoding from r to obtain { s }₁，s₂，s₃}＝{1，3，5，11}；

Step 602, determine whether the last RBG is a virtual RBG, s₃Turning to step 604, if 11 ≠ 26;

step 604, the last cluster (cluster 1) at least contains 2 RBGs, and the indexes of the RBGs at the starting position and the ending position are(s)₂，s₃)＝(5，11)；

Step 605, determine if the index of the last RBG of cluster 0 is 1, s less than the index of the next RBG adjacent to it₁＝3≠s ₂1, turning to step 607;

step 607, cluster 0 contains at least 2 RBGs,(s)₀，s₁) The index (1, 3) is the RBG index of the start position and the end position of the 0 th cluster, and ends.

In the above steps, the order of steps 602-604 and 605-607 can be changed.

(II)

Assume that cluster 0 contains 12 RBGs and cluster 1 contains 24, 25 RBGs.

An RBG indicating the start position and the end position of each cluster is required, wherein the 0 th cluster contains only 1 RBG, and thus the RBG of the start position of the cluster is 12 and the RBG of the end position is the previous RBG (index 23) of the RBG (index 24) of the start position of the next cluster (1 st cluster). The 4 RBGs to be indicated are 12, 23, 24, 25, respectively.

The indexes of the 4 RBGs are sorted into

{s₀，s₁，s₂，s₃}＝{12，23，24，25}

Wherein(s)₀，s₁) And(s)₂，s₃) The indexes of the RBGs of the start position and the end position of the 0 th cluster and the 1 st cluster, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>3</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>26</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>4</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}26-12\\ 4\end{array}\right)+\left(\begin{array}{c}26-23\\ 3\end{array}\right)+\left(\begin{array}{c}26-24\\ 2\end{array}\right)+\left(\begin{array}{c}26-25\\ 1\end{array}\right)$

$=1004$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 2 discontinuous clusters allocated by the base station:

step 601, decoding from r to obtain { s }₀，s₁，s₂，s₃}＝{12，23，24，25}；

Step 602, determine whether the last RBG is a virtual RBG, s₃Turning to step 604, if 25 ≠ 26;

step 604, the last cluster (cluster 1) at least contains 2 RBGs, and the indexes of the RBGs at the starting position and the ending position of the cluster 1 are(s)₂，s₃)＝(24，25)；

Step 605, determine if the index of the last RBG of cluster 0 is 1, s less than the index of the next RBG adjacent to it₁＝s ₂1, go to step 606;

step 606, if yes, i.e. s₁＝s ₂1, then the cluster contains only 1 RBG with index s₀12, i.e. the first RBG of the cluster indicated by the signaling, end;

in the above steps, the order of steps 602-604 and 605-607 can be changed.

(III)

Suppose that cluster 0 contains RBGs of 7, 8, 9, 10, 11, 12, 13, 14 and cluster 1 contains RBGs of 18.

An RBG indicating the start position and the end position of each cluster is required, wherein the last cluster (cluster 1) contains only 1 RBG, and thus the RBG at the start position of the cluster is 18 and the RBG at the end position is a virtual RBG (index 26). The 4 RBGs that need to be indicated are 7, 14, 18, 26, respectively.

The indices of the 4 RBGs are ordered incrementally as

{s₀，s₁，s₂，s₃}＝{7，14，18，26}

Wherein(s)₀，s₁) And(s)₂，s₃) The indexes of the RBGs of the start position and the end position of the 0 th cluster and the 1 st cluster, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>3</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>26</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>4</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}26-7\\ 4\end{array}\right)+\left(\begin{array}{c}26-14\\ 3\end{array}\right)+\left(\begin{array}{c}26-18\\ 2\end{array}\right)+\left(\begin{array}{c}26-26\\ 1\end{array}\right)$

$=4124$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 2 discontinuous clusters allocated by the base station:

step 601, decoding from r to obtain { s }₀，s₁，s₂，s₃}＝{7，14，18，26}；

Step 602, determine whether the last RBG is a virtual RBG, s₃Turning to step 603 when the value is 26;

step 603, s₃That is, the last RBG indicated by the signaling is a virtual RBG, the last cluster (1 st cluster) contains only 1 RBG with the index s₂18, the first RBG of the last cluster indicated by the signaling; step 605 is transferred;

step 605, determine if the index of the last RBG of cluster 0 is 1, s less than the index of the next RBG adjacent to it₁＝14≠s ₂1, turning to step 607;

step 607, the cluster at least comprises 2 RBGs,(s)₀，s₁) The index (7, 14) is the RBG index of the start position and the end position of the 0 th cluster, and ends.

In the above steps, the order of steps 602-604 and 605-607 can be changed.

(IV)

Assume that the 0 th cluster contains an RBG of 6 and the 1 st cluster contains an RBG of 17.

An RBG indicating a start position and an end position of each cluster is required, wherein the 0 th cluster contains only 1 RBG, and thus the RBG of the start position of the cluster is 6 and the RBG of the end position is a previous RBG (index is 16) of the RBG (index is 17) of the start position of the next cluster (1 st cluster); the last cluster (cluster 1) contains only 1 RBG, so the RBG at the start position of the cluster is 17 and the RBG at the end position is a virtual RBG (index 26). The 4 RBGs that need to be indicated are 6, 16, 17, 26, respectively.

The indices of the 4 RBGs are ordered incrementally as

{s₀，s₁，s₂，s₃}＝{6，16，17，26}

Wherein(s)₀，s₁) And(s)₂，s₃) The indexes of the RBGs of the start position and the end position of the 0 th cluster and the 1 st cluster, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>3</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>26</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>4</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}26-6\\ 4\end{array}\right)+\left(\begin{array}{c}26-16\\ 3\end{array}\right)+\left(\begin{array}{c}26-17\\ 2\end{array}\right)+\left(\begin{array}{c}26-26\\ 1\end{array}\right)$

$=5001$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 2 discontinuous clusters allocated by the base station:

step 601, decoding from r to obtain { s }₀，s₁，s₂，s₃}＝{6，16，17，26}；

Step 602, determine whether the last RBG is a virtual RBG, s₃26, the RBG is virtualized, go to step 603;

step 603, s₃That is, the last RBG indicated by the signaling is a virtual RBG, the last cluster (1 st cluster) contains only 1 RBG with the index s₂17, the first RBG of the last cluster indicated by the signaling; step 605 is transferred;

step (ii) of605, determine if the index of the last RBG of the 0 th cluster is 1, s smaller than the index of the next RBG adjacent to the last RBG₁＝s ₂1, go to step 606;

step 606, s₁＝s ₂1, then the cluster contains only 1 RBG with index s₀6, namely the first RBG of the cluster indicated by the signaling, and ends;

in the above steps, the order of steps 602-604 and 605-607 can be changed.

Example eight

In the LTE-a system, the number of RBGs corresponding to a bandwidth range for PUSCH discontinuous resource allocation in one component carrier is assumed to be N-14. The indices of the 14 RBGs are 2, 14, 15 in ascending or descending order of frequency.

Adding 1 virtual RBG on the basis of 14 RBGs, wherein the index of the virtual RBG is 1.

Assume that a user terminal employs discontinuous resource allocation and is grouped into 3 clusters in the frequency domain.

The RBGs of the start position and the end position of each cluster need to be indicated, that is, 6 RBGs need to be indicated, the positions of 6 RBGs in 15 RBGs need to be indicated in total, and according to a combination formula, the RBGs need to be indicated

$\left(\begin{array}{c}15\\ 6\end{array}\right)=5005$

And (4) a state.

The following describes the representation method and decoding method of the present invention by taking 3 clusters of resource allocation cases with different positions and sizes as an example.

(A)

Suppose that the 0 th cluster contains 2, 3 RBGs, the 1 st cluster contains 5, 6, 7, 8, 9, 10, 11 RBGs, and the 2 nd cluster contains 13, 14 RBGs.

RBGs indicating the start position and the end position of each cluster, i.e., 6 RBGs, 2, 3, 5, 11, 13, 14, respectively, need to be indicated.

The indexes of the 6 RBGs are ordered in an increasing way as

{s₀，s₁，s₂，s₃，s₄，s₅}＝{2，3，5，11，13，14}

Wherein(s)₀，s₁)，(s₂，s₃)，(s₄，s₅) The indexes of the RBGs of the start position and the end position of the 0 th, 1 st, and 2 nd clusters, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>5</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>15</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>6</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}15-2\\ 6\end{array}\right)+\left(\begin{array}{c}15-3\\ 5\end{array}\right)+\left(\begin{array}{c}15-5\\ 4\end{array}\right)+\left(\begin{array}{c}15-11\\ 3\end{array}\right)+\left(\begin{array}{c}15-13\\ 2\end{array}\right)+\left(\begin{array}{c}15-14\\ 1\end{array}\right)$

$=2724$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 3 discontinuous clusters allocated by the base station:

step 801, decode from r to obtain s₀，s₁，s₂，s₃，s₄，s₅}＝{2，3，5，11，13，14}；

Step 802, determine if the first RBG is a virtual RBG, s₀Turning to step 804, if 2 is not equal to 1;

step 804, the 0 th cluster at least comprises 2 RBGs, and the starting position and the end of the 0 th clusterThe RBG index of the end position is s₀，s₁)＝(2，3)；

Step 805, determine whether the index of the first RBG of any cluster (cluster 1 and cluster 2) in the next 2 clusters is 1, s larger than the index of the previous RBG adjacent to the first RBG₂＝5≠s₁+1，s₄＝13≠s₃+1, go to step 807;

in step 807, both cluster 1 and cluster 2 contain at least 2 RBGs,(s)₂，s₃)＝(5，11)he(s₄，s₅) The index of the RBGs of the start position and the end position of the 1 st cluster and the 2 nd cluster, respectively, ends (13, 14).

In the above steps, the sequence of steps 802-804 and 805-807 can be changed.

(II)

Assume that the 0 th cluster contains 3 RBGs, the 1 st cluster contains 5, 6 RBGs, and the 2 nd cluster contains 13 RBGs.

An RBG indicating a start position and an end position of each cluster is required, wherein the 0 th cluster contains only 1 RBG, and thus the RBG at the start position of the cluster is a virtual RBG (index 1) and the RBG at the end position is the RBG contained in the cluster (index 3); the 2 nd cluster contains only 1 RBG, and therefore, the RBG at the start position of the cluster is the next RBG (index 7) to the last RBG of the previous cluster of the cluster, and the end position of the cluster is the RBG (index 13) contained in the cluster. The 6 RBGs that need to be indicated are 1, 3, 5, 6, 7, 13, respectively.

The indexes of the 6 RBGs are ordered in an increasing way as

{s₀，s₁，s₂，s₃，s₄，s₅}＝{1，3，5，6，7，13}

Wherein(s)₀，s₁)，(s₂，s₃)，(s₄，s₅) The indexes of the RBGs of the start position and the end position of the 0 th, 1 st, and 2 nd clusters, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>5</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>15</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>6</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}15-1\\ 6\end{array}\right)+\left(\begin{array}{c}15-3\\ 5\end{array}\right)+\left(\begin{array}{c}15-5\\ 4\end{array}\right)+\left(\begin{array}{c}15-6\\ 3\end{array}\right)+\left(\begin{array}{c}15-7\\ 2\end{array}\right)+\left(\begin{array}{c}15-13\\ 1\end{array}\right)$

$=4119$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 3 discontinuous clusters allocated by the base station:

step 801, decode from r to obtain s₀，s₁，s₂，s₃，s₄，s₅}＝{1，3，5，6，7，13}；

Step 802, determine if the first RBG is a virtual RBG, s₀Turning to step 803 if the value is 1;

step 803, s₀If 1, that is, the first RBG indicated by the signaling is a virtual RBG, the 0 th cluster only contains 1 RBG with the index s₁3, namely the RBG of the termination position of the 0 th cluster indicated by the signaling; turning to step 805;

step 805, determine whether the index of the first RBG of any cluster (cluster 1 and cluster 2) in the next 2 clusters is 1, s larger than the index of the previous RBG adjacent to the first RBG₄＝7＝s₃+1, go to step 806; s₂＝5≠s₁+1, go to step 807;

step 806, s₄＝7＝s₃+1, the cluster contains only 1 RBG with index s₄13, the last RBG of the cluster indicated by the signaling;

step 807, the cluster comprises at least 2 RBGs(s)₂，s₃) (5, 6) is the 1 st clusterThe index of the RBG of the start position and the end position of (b), and end.

In the above steps, the order of steps 802-804 and 805-807 can be changed, and the order of 806-807 can be changed.

(III)

Assume that the 0 th cluster contains 10 RBGs, the 1 st cluster contains 12 RBGs, and the 2 nd cluster contains 15 RBGs.

An RBG indicating a start position and an end position of each cluster is required, wherein the 0 th cluster contains only 1 RBG, and thus the RBG at the start position of the cluster is a virtual RBG (index 1) and the RBG at the end position is the RBG contained in the cluster (index 10); the 1 st cluster only contains 1 RBG, therefore, the RBG at the starting position of the cluster is the next RBG (index is 11) of the last RBG of the previous cluster of the cluster, and the ending position of the cluster is the RBG (index is 12) contained by the cluster; the 2 nd cluster contains only 1 RBG, and therefore, the RBG at the start position of the cluster is the next RBG (index 13) to the last RBG of the previous cluster of the cluster, and the end position of the cluster is the RBG (index 15) contained in the cluster. The 6 RBGs to be indicated are 1, 10, 11, 12, 13, 15, respectively.

The indexes of the 6 RBGs are sorted into

{s₀，s₁，s₂，s₃，s₄，s₅}＝{1，10，11，12，13，15}

Wherein(s)₀，s₁)，(s₂，s₃)，(s₄，s₅) The indexes of the RBGs of the start position and the end position of the 0 th, 1 st, and 2 nd clusters, respectively.

The resource allocation index r is

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mn>5</mn> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mn>15</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>6</mn> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$=\left(\begin{array}{c}15-1\\ 6\end{array}\right)+\left(\begin{array}{c}15-10\\ 5\end{array}\right)+\left(\begin{array}{c}15-11\\ 4\end{array}\right)+\left(\begin{array}{c}15-12\\ 3\end{array}\right)+\left(\begin{array}{c}15-13\\ 2\end{array}\right)+\left(\begin{array}{c}15-15\\ 1\end{array}\right)$

$=3007$

The base station includes the index in the uplink scheduling grant signaling sent to the user equipment for allocating the discontinuous resource in one component carrier.

After receiving the uplink scheduling authorization signaling sent by the base station, the user terminal decodes according to the resource allocation index and the following steps to obtain the specific positions of 3 discontinuous clusters allocated by the base station:

step 801, decode from r to obtain s₀，s₁，s₂，s₃，s₄，s₅}＝{1，10，11，12，13，15}；

Step 802, determine if the first RBG is a virtual RBG, s₀Turning to step 803 if the value is 1;

step 803, s₀If 1, that is, the first RBG indicated by the signaling is a virtual RBG, the 0 th cluster only contains 1 RBG with the index s₁10, namely the RBG of the termination position of the 0 th cluster indicated by the signaling; turning to step 805;

step 805, determine whether the index of the first RBG of any cluster (cluster 1 and cluster 2) in the next 2 clusters is 1, s larger than the index of the previous RBG adjacent to the first RBG₂＝11＝s₁+1，s₄＝13＝s₃+1, go to step 806;

step 806, s₂＝11＝s₁+1, the cluster contains only 1 RBG with index s₃12, i.e. the RBG of the end position of the cluster indicated by the signaling; s₄＝13＝s₃+1, the cluster contains only 1 RBG with index s₅I.e. the RBG of the termination position of the cluster indicated by the signaling, ends.

In the above steps, the order of steps 802-803 and 805-806 can be changed.

The above description is only an example of the present invention, and is not intended to limit the present invention, and it is obvious to those skilled in the art that various modifications and variations can be made in the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.

Claims (20)

1. An indication method for wireless channel resource allocation, a base station allocates m non-continuous clusters to a terminal on a component carrier, each cluster comprises one or more continuous Resource Block Groups (RBGs), the base station sends an uplink scheduling grant signaling to the terminal, a resource allocation index is used in the uplink scheduling grant signaling to indicate a start position and an end position of the m clusters, the m clusters are sorted by increasing or decreasing frequency, characterized in that, if a virtual RBG is added, then:

for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is the previous RBG of the first RBG contained in the next cluster of the cluster; when the cluster only contains one RBG and the cluster is the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is a virtual RBG;

or, for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not a first cluster, the starting position of the cluster is a RBG behind the last RBG contained in the previous cluster of the cluster, and the ending position of the cluster is the RBG contained in the cluster; when the cluster only contains one RBG and the cluster is the first cluster, the starting position of the cluster is a virtual RBG, and the ending position of the cluster is the RBG contained in the cluster.

2. The method of claim 1, wherein a base station indicates the positions of the RBGs using RBG indexes, wherein the indexes of N RBGs corresponding to a bandwidth for Physical Uplink Shared Channel (PUSCH) discontinuous resource allocation in one component carrier are 1, 2,. multidot.N in ascending or descending order of frequency, and the index of the virtual RBG is N + 1; or the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are 2, 3.

3. The method of claim 2, wherein the resource allocation index is derived according to the following equation:

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

wherein r is a resource allocation index, N is the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation in the component carrier, s_kK is 0.. 2m-1 is the index of 2m RBGs corresponding to the start and end positions of the m non-consecutive clusters, s_k＜s_k+1，(s_2n，s_2n+1) N is 0, and m-1 is an index of the starting position and the ending position RBG of the nth cluster in the m clusters.

4. The method of claim 1, wherein the base station determines the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation in one component carrier as follows: in one component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is N_RB ^PUSCH， <math> <mrow> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>PUSCH</mi> </msubsup> <mo>&le;</mo> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>UL</mi> </msubsup> <mo>,</mo> </mrow> </math> Wherein N is_RB ^ULThe number of PRBs corresponding to the system bandwidth of a component carrier, the discontinuous resource allocation in a component carrier is configured by taking a resource block group as a unit, the size of the resource block group is a function of the system bandwidth of the component carrier, or a function of the bandwidth for PUSCH discontinuous resource allocation on the component carrier, if the size of the resource block group is P PRBs, one component carrier is configuredThe RBG number corresponding to the bandwidth internally used for PUSCH discontinuous resource allocation is

Wherein, if $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=0,$ The size of each RBG is P; if it is not $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P>0,$ Then is front

The size of one RBG is P, and the size of the last 1 RBG is P

And the base station informs the terminal of the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier through system information, or sends parameters related to the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier to the terminal.

5. The method of claim 1, wherein the base station further agrees the number m of clusters with the terminal, or informs the terminal of the number m of clusters through system information, or sends a parameter related to the number m of clusters to the terminal through system information, or informs the terminal of the number m of clusters on the component carrier of the PUSCH discontinuous resource allocation transmission scheduled at this time through the uplink scheduling grant signaling.

6. A decoding method for wireless channel resource allocation is characterized in that a terminal receives an uplink scheduling authorization signaling, and RBG indexes s of 2m starting positions and ending positions of m clusters are decoded from a resource allocation index carried in the uplink scheduling authorization signaling_k，k＝0，...2m-1，s_k＜s_k+1The method comprises the following steps:

the terminal judges s_2m-1Whether the index of the RBG is a virtual RBG or not, if so, the last cluster only contains one RBG, and the index of the RBG is s_2m-2(ii) a Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1) (ii) a For the nth cluster, n is 0_2n+1Whether or not s is_2n+2The index of the RBG before the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2nOtherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)；

Or,

the terminal judges s₀If the index is the index of the virtual RBG, if so, the 0 th cluster only contains one RBG, and the index of the RBG is s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁) (ii) a For the nth cluster, n 1.., m-1, judge s_2nWhether or not s is_2n-1The index of the RBG next to the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2n+1Otherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)。

7. The method of claim 6,

when N RBGs corresponding to a bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted by frequency in an ascending or descending manner with an index of 1, 2.. N, and an index of a virtual RBG is N +1, then:

if s_2m-1N +1, thenThe last cluster contains only 1 RBG with index s_2m-2Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1)；

For any cluster of n-0, 1, m-2, if s_2n+1＝s_2n+21, then the cluster contains only 1 RBG with index s_2nn-0,.., m-2; otherwise,(s)_2n，s_2n+1) Indexes of a first RBG and a last RBG of an nth cluster;

or,

when the index of the virtual RBG is 1, N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are ordered by increasing or decreasing frequency with an index of 2, 3.

If s₀1, the 0 th cluster contains only 1 RBG with index s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁)；

For any cluster of n-1, m-1, if s_2n＝s_2n-1+1, the cluster contains only 1 RBG with index s_2n+1n 1, m-1, otherwise,(s)_2n，s_2n+1) The index of the first RBG and the last RBG of the nth cluster.

8. The method of claim 7, wherein the terminal decodes s from the resource allocation index according to_k}_k＝0 ^2m-1：

Step 701, taking initial values i-0 and s-1, and taking the initial value of r as a resource allocation index value;

step 702, calculate the number of combinations

$p=\left(\begin{array}{c}N+1-s\\ 2m-i\end{array}\right)$

Step 703, if p > r, s ═ s +1, and then jump to step 702; otherwise, s_i＝s；

Step 704, calculate

s＝s+1

r＝r-p

i＝i+1

Step 705, if i is less than or equal to 2m-1, jumping to step 702; otherwise, ending.

9. The method according to claim 6, 7 or 8, wherein the terminal obtains the value of N through system information, or the terminal derives N according to related parameters configured by the system information.

10. The method according to claim 6, 7 or 8, wherein m is a system default value, or the terminal obtains m from system information, or derives m from related parameters configured by the system information, or the terminal obtains the clustering number m of the currently scheduled PUSCH discontinuous resource allocation transmission on the component carrier from the uplink scheduling grant signaling.

11. A base station, configured to allocate m non-consecutive clusters to a terminal on a component carrier, where each cluster includes one or more consecutive RBGs, send an uplink scheduling grant signaling to the terminal, where a resource allocation index is used in the uplink scheduling grant signaling to indicate a starting position and an ending position of the m clusters, and the m clusters are ordered in ascending or descending frequency, where adding a virtual RBG:

for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is the previous RBG of the first RBG contained in the next cluster of the cluster; when the cluster only contains one RBG and the cluster is the last cluster, the starting position of the cluster is the RBG contained in the cluster, and the ending position of the cluster is a virtual RBG;

or, for each cluster, when the cluster comprises at least two RBGs, the starting position is the first RBG contained in the cluster, and the ending position is the last RBG contained in the cluster; when the cluster only contains one RBG and the cluster is not a first cluster, the starting position of the cluster is a RBG behind the last RBG contained in the previous cluster of the cluster, and the ending position of the cluster is the RBG contained in the cluster; when the cluster only contains one RBG and the cluster is the first cluster, the starting position of the cluster is a virtual RBG, and the ending position of the cluster is the RBG contained in the cluster.

12. The base station of claim 11, wherein the base station is configured to indicate the location of the RBG by using an RBG index, the index of N RBGs corresponding to a bandwidth for PUSCH discontinuous resource allocation in one component carrier is 1, 2,.. multidot.n in ascending or descending order of frequency, and the index of the virtual RBG is N + 1; or the indexes of N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are 2, 3.

13. The base station of claim 12, wherein the base station is configured to obtain the resource allocation index according to the following formula:

<math> <mrow> <mi>r</mi> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <mi>N</mi> <mo>+</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>s</mi> <mi>k</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mi>k</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

wherein r is a resource allocation index, N is the RBG number corresponding to the bandwidth used for PUSCH discontinuous resource allocation in the component carrier, s_kK is 0.. 2m-1 is the index of 2m RBGs corresponding to the start and end positions of the m non-consecutive clusters, s_k＜s_k+1Wherein(s)_2n，s_2n+1) N is 0, and m-1 is an index of the starting position and the ending position RBG of the nth cluster in the m clusters.

14. The base station of claim 11, wherein the base station is further configured to determine the number of RBGs corresponding to the bandwidth for PUSCH discontinuous resource allocation in one component carrier as follows: in one component carrier, the number of PRBs corresponding to the bandwidth range for PUSCH discontinuous resource allocation is N_RB ^PUSCH， <math> <mrow> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>PUSCH</mi> </msubsup> <mo>&le;</mo> <msubsup> <mi>N</mi> <mi>RB</mi> <mi>UL</mi> </msubsup> <mo>,</mo> </mrow> </math> Wherein N is_RB ^ULThe number of PRBs corresponding to the system bandwidth of a component carrier, the discontinuous resource allocation in a component carrier is configured by taking a resource block group as a unit, the size of the resource block group is a function of the system bandwidth of the component carrier, or a function of the bandwidth for PUSCH discontinuous resource allocation on the component carrier, if the size of the resource block group is P PRBs, one component carrier is configuredThe RBG number corresponding to the bandwidth internally used for PUSCH discontinuous resource allocation is

Wherein, if $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P=0,$ The size of each RBG is P; if it is not $N_{\mathrm{RB}}^{\mathrm{PUSCH}}\mathrm{mod}P>0,$ Then is frontThe size of one RBG is P, and the size of the last 1 RBG is P

And the base station informs the terminal of the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier through system information, or sends parameters related to the RBG number corresponding to the bandwidth for the PUSCH discontinuous resource allocation in one component carrier to the terminal.

15. The base station of claim 11, wherein the base station is further configured to agree with the terminal on the number of clusters m, or inform the terminal of the number of clusters m through system information, or send a parameter related to the number of clusters m to the terminal through system information, or inform the terminal of the number of clusters m on the component carrier through the uplink scheduling grant signaling.

16. A terminal, characterized in that the terminal is configured to receive an uplink scheduling grant signaling, and decode RBG indexes s of 2m starting positions and ending positions of m clusters from a resource allocation index carried in the uplink scheduling grant signaling_k，k＝0，...2m-1，s_k＜s_k+1And is also used for:

judgment s_2m-1Whether the index of the RBG is a virtual RBG or not, if so, the last cluster only contains one RBG, and the index of the RBG is s_2m-2(ii) a Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1) (ii) a For the nth cluster, n is 0_2n+1Whether or not s is_2n+2The index of the RBG before the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2nOtherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)；

Or,

judgment s₀If the index is the index of the virtual RBG, if so, the 0 th cluster only contains one RBG, and the index of the RBG is s₁(ii) a Otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁) (ii) a For the nth cluster, n 1.., m-1, judge s_2nWhether or not s is_2n-1The index of the RBG next to the indicated RBG, if yes, the nth cluster only contains one RBG, and the index of the RBG is s_2n+1Otherwise, the nth cluster contains at least two RBGs, the indices of the first and last RBGs(s)_2n，s_2n+1)。

17. The terminal of claim 16, wherein the terminal is configured to decode the indices of the first RBG and the last RBG of each cluster as follows:

when N RBGs corresponding to a bandwidth used for PUSCH discontinuous resource allocation in one component carrier are sorted by frequency in an ascending or descending manner with an index of 1, 2.. N, and an index of a virtual RBG is N +1, then:

if s_2m-1N +1, the last cluster contains only 1 RBG with index s_2m-2Otherwise, the last cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)_2m-2，s_2m-1)；

For any cluster of n-0, 1, m-2, if s_2n+1＝s_2n+21, then the cluster contains only 1 RBG with index s_2nn-0,., m-2; otherwise,(s)_2n，s_2n+1) Indexes of a first RBG and a last RBG of an nth cluster;

or,

when the index of the virtual RBG is 1, N RBGs corresponding to the bandwidth used for PUSCH discontinuous resource allocation in one component carrier are ordered by increasing or decreasing frequency with an index of 2, 3.

If s0 is 1, then the 0 th cluster contains only 1 RBG, whose index is s 1; otherwise, the 0 th cluster at least comprises two RBGs, and the indexes of the first RBG and the last RBG are(s)₀，s₁)；

For any cluster of n-1, m-1, if s_2n＝s_2n-1+1, the cluster contains only 1 RBG with index s_2n+1n 1, m-1, otherwise,(s)_2n，s_2n+1) The index of the first RBG and the last RBG of the nth cluster.

18. The terminal of claim 17, wherein the terminal is further configured to decode { s } from the resource allocation index according to_k}_k＝0 ^2m-1：

Step 701, taking initial values i-0 and s-1, and taking the initial value of r as a resource allocation index value;

step 702, calculate the number of combinations

$p=\left(\begin{array}{c}N+1-s\\ 2m-i\end{array}\right)$

Step 703, if p > r, s ═ s +1, and then jump to step 702; otherwise, s_i＝s；

Step 704, calculate

s＝s+1

r＝r-p

i＝i+1

Step 705, if i is less than or equal to 2m-1, jumping to step 702; otherwise, ending.

19. The terminal according to claim 16, 17 or 18, wherein the terminal is further configured to obtain the N value through system information, or derive N according to related parameters configured by the system information.

20. The terminal according to claim 16 or 17 or 18, wherein the terminal is configured to use a system default value m, or obtain m from system information, or obtain m from related parameters configured by system information, or obtain m from the uplink scheduling grant signaling, or obtain the clustering number m of the currently scheduled PUSCH discontinuous resource allocation transmission on the component carrier.

Images