CN103634918B - The resource allocation methods of TTI bundling in LTE system - Google Patents

Abstract

The resource allocation methods of TTI bundling in a kind of LTE system, including step 1, in cell configuration or reconfigure, obtains bandwidth of cell and the relevant configuration information of PUCCH and PRACH；Step 2, calculates the physical resource position of PUCCH and PRACH according to configuration information；Step 3, determines, according to bandwidth of cell, the maximum RB number that MSG3 can take；Step 4, calculates the resource range of distribution of MSG3 and TTI Bundling user in scheduling process；Step 5, carries out the RB distribution of MSG3 and TTI Bundling user in scheduling according to the result in step 4.Ascending physical signal resource is divided from frequency band to be come by limiting respective resource range of distribution by the present invention, thus the resource allocation conflict caused because of the Time Inconsistency each accounted for when solving resource distribution, simplify the resource allocation process in scheduling process simultaneously.

Description

Resource allocation method for TTI bundling in LTE system

Technical Field

The present invention relates to the field of mobile communications, and in particular, to a physical resource allocation method for guaranteeing TTI bundling (uplink subframe bundling) in an LTE (Long Term Evolution) system.

Background

In the LTE system, when a user is at the edge of a cell, the uplink transmission power of the user is limited due to poor channel quality, so that the uplink rate of the user at the edge of the cell is very low. In order to solve the problem, the LTE system allocates the same physical resource to 4 consecutive TTIs (Transmission Time Interval, in the LTE system, one TTI is 1 ms) of the edge user in a manner of Bundling uplink subframes, so that the user transmits the same uplink data in the 4 consecutive TTIs with different redundancy versions (versions are 0,2,3,1, respectively), and the base station obtains a gain by combining and decoding the different redundancy versions when demodulating the data, thereby greatly improving the accuracy of uplink data demodulation and further improving the throughput of the edge user.

In the LTE system, physical resources are organized in the form of Resource Blocks (RBs), and the number of RBs indicates the specific physical Resource location. The different physical channels are also divided on the basis of RBs, one RB being 15KHz in frequency domain and one TTI in time. The channels occupying the Uplink Physical resource include a PUCCH (Physical Uplink control Channel), a PRACH (Physical Random Access Channel), and a PUSCH (Physical Uplink Shared Channel). The PUCCH and the PUSCH always exist in the time domain, the TTI occupied by the PRACH in the time domain is configured according to the high layer, meanwhile, in the frequency domain, the PUCCH occupies partial RBs at two ends of a frequency band, the number of the occupied RBs is configured according to the high layer, the PRACH fixedly occupies 6 RBs, but the initial RB at the occupied specific position is configured by the high layer; the remaining RBs are occupied by PUSCH. In uplink scheduling, assuming that the current time is N, scheduling needs to allocate an uplink RB at time N +4 to a general user, allocate an uplink RB at time N +6 to MSG3 (message 3) in the random access process, and simultaneously need to allocate the same RBs of consecutive 4 TTIs from N +4 to N +7 to users of TTI Bundling. How to ensure that the users of TTI Bundling do not conflict with the PRACH channel and the resources of MSG3 when allocating RBs from N +4 to N +7 becomes a problem to be solved.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provide a resource allocation method of TTI Bundling in an LTE system, which ensures that the resource allocation of TTI Bundling users in LTE uplink scheduling does not conflict with other resource requests and resolves the possible resource conflicts of 4 TTIs from N +4 to N +7 in scheduling to N +4 time.

The technical scheme of the invention provides a resource allocation method of TTI bundling in an LTE system, which comprises the following steps:

step 1, acquiring cell bandwidth and relevant configuration information of PUCCH and PRACH in cell configuration or reconfiguration;

step 2, calculating the physical resource positions of the PUCCH and the PRACH according to the configuration information;

step 3, determining the maximum RB number which can be occupied by the MSG3 according to the cell bandwidth;

step 4, calculating resource allocation ranges of MSG3 and TTI Bundling users in the scheduling process according to the physical resource positions of the PUCCH and the PRACH obtained in the step 2 and the maximum RB number which can be occupied by the MSG3 obtained in the step 3;

and 5, carrying out RB allocation of the MSG3 and the TTI Bundling user according to the result in the step 4 in the scheduling.

And, the related configuration information of the PUCCH and PRACH obtained in step 1 comprises the number of RBs occupied by the PUCCHStarting RB position n of PRACH channel_prach。

Furthermore, in the step 2, the step of,

the physical resource position of the PUCCH is calculated as the upper boundary RB position of the PUCCH occupying the bandwidth low-frequency band partCalculating the position of a lower boundary RB of a high-frequency band part of a PUCCH occupied bandwidthRB numbering occupied by PUCCH is from 0 toAndto

The physical resource position of the PRACH is calculated according to the initial RB number n of the PRACH channel_prachAnd occupying the consecutive number of RBsThe RB number occupied by PRACH is n_prachTo

Furthermore, in step 3, the maximum number of RBs that MSG3 can occupyThe MSG3_ NUM is the number of MSG3 processed most in one TTI, the MSG3_ RB is the number of RBs required to be occupied by one MSG3, and the MSG3_ RB is preset according to the cell bandwidth.

In step 4, the resource allocation range of the MSG3 and TTI Bundling user is calculated as follows,

firstly, calculating the size of the PUSCH divided into 2 continuous frequency bands by the PRACH according to the configuration of the PRACH,

$N_{\mathrm{RB}}^{\mathrm{hole}1}=n_{\mathrm{prach}}-n_{\mathrm{part}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{hole}2}=n_{\mathrm{part}2}^{\mathrm{pucch}}-n_{\mathrm{prach}}-N_{\mathrm{RB}}^{\mathrm{PRACH}}$

wherein,andrespectively represents the number of RBs in the resource blocks hole1 and hole2 which can be used by the 2 continuous frequency bands;

then, the allocation ranges of the MSG3 and the TTI Bundling are calculated in the following way,

if the number of RBs of the resource block hole1 that can be used in the first contiguous frequency band is less than 6, i.e. the first contiguous frequency bandThen:

$n_{\mathrm{msg}3}=n_{\mathrm{prach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=\mathrm{MSG}3\_\mathrm{RB}\×\mathrm{MSG}3\_\mathrm{NUM}$

$n_{\mathrm{bundling}}=n_{\mathrm{msg}3}+N_{\mathrm{RB}}^{\mathrm{MSG}3}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}2}-N_{\mathrm{RB}}^{\mathrm{MSG}3}$

if the number of RBs of the resource block hole2 that can be used by the second contiguous frequency band is less than 6, i.e. the number of RBs of the second contiguous frequency band is less thanThen:

$n_{\mathrm{msg}3}=n_{\mathrm{part}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=\mathrm{MSG}3\_\mathrm{RB}\×\mathrm{MSG}3\_\mathrm{NUM}$

$n_{\mathrm{bundling}}=n_{\mathrm{msg}3}+N_{\mathrm{RB}}^{\mathrm{MSG}3}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}1}-N_{\mathrm{RB}}^{\mathrm{MSG}3}$

when none of the above 2 conditions is satisfied,

if the number of RBs of the resource block hole1 that can be used by the first contiguous band is less than or equal to the number of RBs of the resource block hole2 that can be used by the second contiguous band,

$n_{\mathrm{msg}3}=n_{\mathrm{part}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=N_{\mathrm{RB}}^{\mathrm{hole}1}$

$n_{\mathrm{bundling}}=n_{\mathrm{prach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}2}$

if not, then,

$n_{\mathrm{msg}3}=n_{\mathrm{prach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=N_{\mathrm{RB}}^{\mathrm{hole}2}$

$n_{\mathrm{bundling}}=n_{\mathrm{part}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}1}$

wherein n is_msg3Indicates the starting RB number allocated by MSG3,indicates the length that MSG3 can be allocated; n is_bundlingIndicates the starting RB number of the TTI Bundling allocation,indicating the length that TTI Bundling can be allocated.

Furthermore, step 5, comprises performing the following sub-steps per TTI,

step 1051, initializing relevant information of uplink scheduling;

step 1052, processing the scheduling of the TTI Bundling user to which resources have been allocated in the current TTI, including first determining a resource requirement flag of the TTI Bundling user,

if the resource demand flag is true, deducting current available RB resource information in advance according to the RB position allocated for the first time, then judging the difference value Bundling _ diff between the current TTI and the TTI allocated to the resource for the first time of the TTI Bundling user, and if the Bundling _ diff is greater than or equal to 4, setting the resource demand flag to be false;

if the Bundling _ diff is less than 4, allocating the RB resource of the current TTI to the TTI according to the RB resource position allocated to the first TTI of the TTI Bundling user;

if the resource demand flag is false, polling the next TTI Bundling user to which resources have been allocated in the current TTI until all relevant users are queried, and entering step 1053;

step 1053, processing resource scheduling for MSG3, including determining n determined in step 4_msg3Andif the limited resources have available RB resources, allocating the RB resources for the MSG3 and then entering the step 1053, otherwise, directly entering the step 1054;

step 1054, processing the scheduling of user data, including the data scheduling of TTI Bundling users and non-TTI Bundling users, and aiming at the data scheduling of TTI Bundling users, firstly judging whether the following 2 conditions are satisfied,

the condition 1 is that the current scheduling time modulo 4 is equal to 0, which represents the first resource allocation of the same resource requirement of continuous 4 TTIs of a TTI Bundling user;

condition 2 is n determined in step 4_bundlingAndamong the defined resources are also RB resources that can be used,

if the two conditions are met simultaneously, resource allocation is carried out, after allocation is successful, the resource demand flag position of the user for TTI Bundling is set to be true, and the step 1055 is carried out;

otherwise, go to step 1055 directly;

step 1055, encapsulate the interface message between layers;

step 1056, the current TTI scheduling is finished.

Through the technical scheme, the resource allocation processing in the scheduling process only needs to allocate the RB resources according to the frequency band range which can be used by each resource allocation processing, and the current needed RB resources are not considered to be allocated to other resource requesters at the last scheduling time or a plurality of scheduling times due to time inconsistency. Compared with the prior art, the invention has the following beneficial characteristics:

1) the resource allocation method for TTI Bundling ensures that uplink scheduling in an LTE system only needs to consider whether resources at the time of N +4 are available for TTI Bundling users, and if available, the resources at the time of N +5 to N +7 are also available, so that a resource allocation process in scheduling can be simplified.

2) According to the resource allocation method for TTI Bundling, the complexity of the allocation range mode of calculating MSG3 and TTI Bundling users is extremely low, various configurations of high layers can be adapted, and the influence of the addition of the method on the scheduling and the time performance of a system can be ignored.

3) According to the resource allocation method for TTI Bundling, related parameters of the number of RBs occupied by the MSG3 can be configured according to actual needs, respective allocation ranges can be determined according to needs, and the resource allocation method for TTI Bundling has practical value.

Drawings

FIG. 1 is an overall flow diagram of an embodiment of the present invention;

fig. 2 is a sub-flowchart of resource allocation for TTI Bundling users in uplink scheduling according to an embodiment of the present invention.

Detailed Description

The invention divides the uplink physical resource from the frequency band by limiting the respective resource allocation range, thereby solving the resource allocation conflict caused by the inconsistency of the respective occupied time during the resource allocation. The following provides a detailed description of embodiments of the invention, taken in conjunction with the accompanying drawings.

In specific implementation, the automatic operation of the technical scheme can be realized by adopting a software technology. Referring to fig. 1, the embodiment of the present invention solves the problem of resource allocation of TTI Bundling by determining an occupied range of each resource requester on a frequency band, and includes the following steps:

step 101, in cell configuration or reconfiguration, obtaining cell bandwidth, PUCCH and PRACH related configuration information.

Embodiments obtain cell bandwidth during cell configuration or reconfigurationNumber of RBs occupied by PUCCHStarting RB position n of PRACH channel_prach。

102, calculating the resource position occupied by the PUCCH, and calculating the resource position occupied by the PRACH;

the physical resource location of the PUCCH and the PRACH may be calculated from the information in the configuration.

Embodiments calculate resource bits occupied by PUCCHThe method comprises respectively calculating RB information at two ends of an occupied frequency band of the PUCCH according to the formulas (1) and (2), wherein the occupied RB is numbered from 0 toAndto

$n_{\mathrm{part}2}^{\mathrm{pucch}}=N_{\mathrm{RB}}^{\mathrm{UL}}-n_{\mathrm{part}1}^{\mathrm{pucch}}---\left(2\right)$

Wherein,the upper border RB position of the bandwidth lowband portion is occupied for PUCCH,the lower boundary RB position of the bandwidth high band portion is occupied for PUCCH,

the embodiment calculates the resource position occupied by the PRACH channel according to the initial RB number n of the PRACH channel_prachAnd occupation continuationNumber of RBs ofObtained, i.e. occupied RB numbering of where from n_prachTo

Step 103, determining the maximum number of processing MSGs 3 in one TTI, and determining the maximum number of RBs that MSG3 can occupy according to the cell bandwidth.

The maximum number of occupied RBs to determine MSG3 may be calculated by the number of MSG3 resource requests processed most per TTI and the number of RBs occupied by one MSG3, and the number of MSG3 processed most per TTI is related to the cell bandwidth.

Embodiments determine the maximum range of MSG3 that can be allocatedThe number of MSG3_ NUM of MSG3 that is processed most in one TTI and the number of RBs that a MSG3 message needs to occupy are MSG3_ RB, where MSG3_ RB 3 is recommended, MSG3_ NUM 1 at 5MHz bandwidth and MSG3_ NUM 5 at 10/15/20MHz bandwidth.

And step 104, calculating resource allocation ranges of users of MSG3 and TTIBundling in the scheduling process according to the resource information of the PUCCH, the PRACH and the MSG 3.

When the resource allocation range of MSG3 and TTI Bundling users is calculated, the PRACH is considered to occupy the RB positions every TTI no matter how many the PRACH is configured in terms of time. The calculated allocation ranges for MSG3 and TTI Bundling users generally must not be less than 6 RBs (in the case of smaller bandwidths, e.g. 5M bandwidth, the limit can be relaxed such that the allocation ranges for MSG3 and TTI Bundling users must not be less than 3 RBs).

The specific calculation of the example is as follows:

firstly, calculating the size of a PUSCH channel divided into 2 continuous frequency bands by the PRACH according to the configuration of the PRACH through formulas (3) and (4);andthe number of RBs in the available resource block 1 (hole 1) and the available resource block 2 (hole 2) of the 2 contiguous bands are respectively represented.

$N_{\mathrm{RB}}^{\mathrm{hole}1}=n_{\mathrm{prach}}-n_{\mathrm{part}1}^{\mathrm{pucch}}---\left(3\right)$

$N_{\mathrm{RB}}^{\mathrm{hole}2}=n_{\mathrm{part}2}^{\mathrm{pucch}}-n_{\mathrm{prach}}-N_{\mathrm{RB}}^{\mathrm{PRACH}}---\left(4\right)$

Then, the distribution ranges of the MSG3 and the TTI Bundling are calculated by the following algorithm to ensure that the calculated MSG3 and TTI Bundling are ensuredThe allocation range of ng users must not be less than 6 RBs. Wherein n is_msg3Indicates the starting RB number allocated by MSG3,indicating the length of MSG3 that can be allocated; n is_bundlingIndicates the starting RB number of the TTI Bundling allocation,represents the length of the TTI Bundling allocable;

if the number of RBs of the resource block hole1 that can be used in the first contiguous frequency band is less than 6, i.e. the first contiguous frequency bandThen:

$n_{\mathrm{msg}3}=n_{\mathrm{prach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=\mathrm{MSG}3\_\mathrm{RB}\×\mathrm{MSG}3\_\mathrm{NUM}$

$n_{\mathrm{bundling}}=n_{\mathrm{msg}3}+N_{\mathrm{RB}}^{\mathrm{MSG}3}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}2}-N_{\mathrm{RB}}^{\mathrm{MSG}3}$

if the number of RBs of the resource block hole2 that can be used by the second contiguous frequency band is less than 6, i.e. the number of RBs of the second contiguous frequency band is less thanThen:

$n_{\mathrm{msg}3}=n_{\mathrm{prat}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=\mathrm{MSG}3\_\mathrm{RB}\×\mathrm{MSG}3\_\mathrm{NUM}$

$n_{\mathrm{bundling}}=n_{\mathrm{msg}3}+N_{\mathrm{RB}}^{\mathrm{MSG}3}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}1}-N_{\mathrm{RB}}^{\mathrm{MSG}3}$

when none of the above 2 conditions are met:

if the number of RBs of the resource block hole1 capable of being used by the first continuous band is less than or equal to the number of RBs of the resource block hole2 capable of being used by the second continuous band:

$n_{\mathrm{msg}3}=n_{\mathrm{part}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=N_{\mathrm{RB}}^{\mathrm{hole}1}$

$n_{\mathrm{bundling}}=n_{\mathrm{prach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}2}$

otherwise:

$n_{\mathrm{msg}3}=n_{\mathrm{puach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=N_{\mathrm{RB}}^{\mathrm{hole}2}$

$n_{\mathrm{bundling}}=n_{\mathrm{part}1}^{\mathrm{pucch}}$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}1}$

and 105, distributing RB resources for MSG3 according to the range of MSG3 in uplink scheduling, distributing RB resources for users of TTI Bundling according to the range of TTIBundling in uplink scheduling, and limiting the RB distribution of MSG3 and TTI Bundling users according to the result in 105 in scheduling.

When resources are allocated to TTI Bundling users, the possible conflict problem between the physical resources of 4 continuous TTIs and the MSG3 is solved by dividing the allocation range of the two types of resource requesters on the frequency band; this possible resource conflict problem is caused by the non-uniform time of the respective requirements. As shown in fig. 2, in the uplink scheduling task, the specific steps executed in each TTI are as follows:

step 1051: initializing relevant information of uplink scheduling, which can be referred to in the prior art;

step 1052: and processing the scheduling of the TTI Bundling user which is already allocated with resources in the current TTI. For the TTI bundling user, the system allocates resources of 4 consecutive TTIs to the user in a certain TTI, where the TTI bundling user to which resources have been allocated by the TTI refers to the TTI bundling user to which resources of 4 consecutive TTIs have been allocated by the system.

In the method, the specific allocation of the same RB resource of 4 continuous TTIs of the TTI Bundling user is realized by the first (namely, the first TTI of the 4 TTIs) resource allocation and the resource deduction of the last 3 TTIs, and the step processes the resource deduction process of the last 3 TTIs. The first resource allocation is shown in step 1054, where its resource requirement flag is first needed,

if the flag bit is true, the TTI Bundling user needs to occupy the RB resource in the current TTI, the current available RB resource information can be deducted in advance according to the RB position allocated for the first time, then the difference value Bundling _ diff between the current TTI and the TTI allocated to the resource for the first time of the TTI Bundling user is judged, if the Bundling _ diff is greater than or equal to 4, the flag bit is false, namely 4 continuous TTI resources of the TTI Bundling user are completely allocated; if the Bundling _ diff is less than 4 (namely, the Bundling _ diff =1 or 2 or 3), allocating the RB resource of the current TTI to the TTI Bundling user according to the RB resource position allocated to the first TTI of the TTI Bundling user;

if the flag bit is false, polling the next TTI Bundling user to which resources have been allocated in the current TTI, processing the same manner as above until all relevant users finish querying, and then entering step 1053.

Step 1053: processing resource scheduling for MSG3, when allocating resources for MSG3, if n is determined in step 104_msg3Andif there are available RB resources in the limited resources, the ms g3 can allocate RBs, otherwise, step 1054 is directly performed, and if there are available RB resources and the MSG3 resource allocation is successful, the RB resources occupied by the ms g3 need to be deducted from the RB allocation information, and then step 1054 is performed.

Step 1054: and processing the data scheduling of the user, wherein the data scheduling of the user with TTI Bundling and the data scheduling of the user without TTI Bundling are included.

The data scheduling of users other than TTI Bundling may employ existing techniques. In the step, resource allocation for the TTI Bundling user needs to meet 2 conditions, where the condition 1 is that modulo 4 is equal to 0 at the current scheduling time, which means that the TTI Bundling user is the first resource allocation with the same resource requirements for continuous 4 TTIs (i.e. the first TTI allocation in 4 TTIs); condition 2 is n determined in step 104_bundlingAndthere are also RB resources available in the defined resources that can allocate RBs for the ttibounding user. If the two conditions cannot be satisfied simultaneously, the procedure proceeds to step 1055 without TTI Bundling user allocation. If the two requirements are met simultaneously, resource allocation is carried out, after the allocation is successful, the resource demand flag position of the user for TTI Bundling is set to be true, and the resource demand flag position is set to be true in the RBThe RB resource occupied by the allocation information is deducted, and then step 1055 is performed.

Step 1055: encapsulating inter-layer interface messages, see prior art.

Step 1056: the current TTI scheduling is finished, see prior art.

The process mainly comprises the steps of firstly carrying out the steps 101-104, and determining the assignable ranges of MSG3 and TTIBundling in the process of configuration tasks; then, step 105 is performed to allocate resources in the scheduling task according to the determined range.

For ease of reference, specific examples of applications of the embodiments are provided: cell bandwidthNumber of RBs occupied by PUCCHStarting position n of PRACH_prachWhen 3, then:

$n_{\mathrm{part}2}^{\mathrm{pucch}}=N_{\mathrm{RB}}^{\mathrm{UL}}-n_{\mathrm{part}1}^{\mathrm{pucch}}=47$

when cell bandwidth is wideWhen the number of the MSG3_ RB is 3, the number of the MSG3_ NUM is 5;

at this time, the length of 2 consecutive frequency bands into which the PUSCH is divided by the PRACH is:

$N_{\mathrm{RB}}^{\mathrm{hole}1}=n_{\mathrm{prach}}-n_{\mathrm{part}1}^{\mathrm{pucch}}=0$

$N_{\mathrm{RB}}^{\mathrm{hole}2}=n_{\mathrm{part}2}^{\mathrm{pucch}}-n_{\mathrm{prach}}-N_{\mathrm{RB}}^{\mathrm{PRACH}}=38$

then:

$n_{\mathrm{msg}3}=n_{\mathrm{prach}}+N_{\mathrm{RB}}^{\mathrm{PRACH}}=9$

$N_{\mathrm{RB}}^{\mathrm{MSG}3}=\mathrm{MSG}3\_\mathrm{RB}*\mathrm{MSG}3\_\mathrm{NUM}=15$

$n_{\mathrm{bundling}}=n_{\mathrm{msg}3}+N_{\mathrm{RB}}^{\mathrm{MSG}3}=24$

$N_{\mathrm{RB}}^{\mathrm{BUND}}=N_{\mathrm{RB}}^{\mathrm{hole}2}-N_{\mathrm{RB}}^{\mathrm{MSG}3}=24$

that is to say, the PRACH occupies RB nos. 3 to 8 in the entire uplink frequency band, the allocation range of MSG3 is RB No. 9 to 23, and the TTI Bundling user is allocated RB nos. 24 to 47, then during scheduling, the RBs are allocated according to their own allocation ranges by MSG3 and TTI Bundling, if the TTI Bundling user obtains RB No. 24 to 26 in the first resource allocation, in the next consecutive 3 TTIs, it is only necessary to use RB nos. 24 to 26 for the user before scheduling other data, and the situation that RB nos. 24 to 26 have been allocated to MSG3 for use due to the advance allocation of MSG3 and the unknown allocated RB is not present, because the RB allocation of MSG3 can only be allocated among RB nos. 9 to 23, thereby solving the collision problem and simplifying the resource allocation process.

The foregoing is a more detailed description of the present invention that is presented in conjunction with specific embodiments, and the practice of the invention is not to be considered limited to those descriptions. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (6)

1. A resource allocation method of TTI bundling in LTE system is characterized in that the method comprises the following steps:

step 1, acquiring cell bandwidth and relevant configuration information of PUCCH and PRACH in cell configuration or reconfiguration;

step 2, calculating the physical resource positions of the PUCCH and the PRACH according to the configuration information;

step 3, determining the maximum RB number which can be occupied by the MSG3 according to the cell bandwidth;

step 4, calculating resource allocation ranges of MSG3 and TTI Bundling users in the scheduling process according to the physical resource positions of the PUCCH and the PRACH obtained in the step 2 and the maximum RB number which can be occupied by the MSG3 obtained in the step 3;

and 5, carrying out RB allocation of the MSG3 and the TTI Bundling user according to the result in the step 4 in the scheduling.

2. The resource allocation method for TTI bundling in LTE system according to claim 1, wherein: the relevant configuration information of the PUCCH and the PRACH obtained in the step 1 comprises the number of RBs occupied by the PUCCHStarting RB position n of PRACH channel_prach。

3. The resource allocation method for TTI bundling in LTE system according to claim 2, wherein: in step 2, the physical resource position of the PUCCH is calculated by calculating the position of an upper boundary RB of a bandwidth low-frequency band part occupied by the PUCCHCalculating the position of a lower boundary RB of a high-frequency band part of a PUCCH occupied bandwidthRB numbering occupied by PUCCH is from 0 toAndto

The physical resource position of the PRACH is calculated according to the initial RB number n of the PRACH channel_prachAnd occupying the consecutive number of RBsThe RB number occupied by PRACH is n_prachTo n_prach+5。

4. The resource allocation method for TTI bundling in LTE system according to claim 3, wherein: in step 3, the maximum number of RBs that MSG3 can occupyThe MSG3_ NUM is the number of MSG3 processed most in one TTI, the MSG3_ RB is the number of RBs required to be occupied by one MSG3, and the MSG3_ RB is preset according to the cell bandwidth.

5. The resource allocation method for TTI bundling in LTE system according to claim 4, wherein: in step 4, the resource allocation range of the MSG3 and TTI Bundling user is calculated as follows,

firstly, calculating the size of the PUSCH divided into 2 continuous frequency bands by the PRACH according to the configuration of the PRACH,

$N_{RB}^{hole1}=n_{prach}-n_{part1}^{pucch}$

$N_{RB}^{hole2}=n_{part2}^{pucch}-n_{prach}-N_{RB}^{PRACH}$

wherein,andrespectively represents the number of RBs in the resource blocks hole1 and hole2 which can be used by the 2 continuous frequency bands;

then, the allocation ranges of the MSG3 and the TTI Bundling are calculated in the following way,

if the number of RBs of the resource block hole1 that can be used in the first contiguous frequency band is less than 6, i.e. the first contiguous frequency bandThen:

$n_{msg3}=n_{prach}+N_{RB}^{PRACH}$

$N_{RB}^{MSG3}=MSG3\_RB\×MSG3\_NUM$

$n_{bundling}=n_{msg3}+N_{RB}^{MSG3}$

$N_{RB}^{BUND}=N_{RB}^{hole2}-N_{RB}^{MSG3}$

if the number of RBs of the resource block hole2 that can be used by the second contiguous frequency band is less than 6, i.e. the number of RBs of the second contiguous frequency band is less thanThen:

$n_{msg3}=n_{part1}^{pucch}$

$N_{RB}^{MSG3}=MSG3\_RB\×MSG3\_NUM$

$n_{bundling}=n_{msg3}+N_{RB}^{MSG3}$

$N_{RB}^{BUND}=N_{RB}^{hole1}-N_{RB}^{MSG3}$

when none of the above 2 conditions is satisfied,

if the number of RBs of the resource block hole1 that can be used by the first contiguous band is less than or equal to the number of RBs of the resource block hole2 that can be used by the second contiguous band,

$n_{msg3}=n_{part1}^{pucch}$

$N_{RB}^{MSG3}=N_{RB}^{hole1}$

$n_{bundling}=n_{prach}+N_{RB}^{PRACH}$

$N_{RB}^{BUND}=N_{RB}^{hole2}$

if not, then,

$n_{msg3}=n_{prach}+N_{RB}^{PRACH}$

$N_{RB}^{MSG3}=N_{RB}^{hole2}$

$n_{bundling}=n_{part1}^{pucch}$

$N_{RB}^{BUND}=N_{RB}^{hole1}$

wherein n is_msg3Indicates the starting RB number allocated by MSG3,indicates the length that MSG3 can be allocated; n is_bundlingIndicates the starting RB number of the TTI Bundling allocation,indicating the length that TTI Bundling can be allocated.

6. The resource allocation method for TTI bundling in LTE system according to claim 5, wherein: step 5, comprising performing the following sub-steps at each TTI,

step 1051, initializing relevant information of uplink scheduling;

step 1052, processing the scheduling of the TTI Bundling user to which resources have been allocated in the current TTI, including first determining a resource requirement flag of the TTI Bundling user,

if the resource demand mark is true, deducting the current available RB resource information in advance according to the RB position allocated for the first time, then judging the difference value Bundling _ diff between the current TTI and the TTI allocated to the resource for the first time of the TTI Bundling user,

if the bundling _ diff is greater than or equal to 4, setting the resource demand flag as false;

if the Bundling _ diff is less than 4, allocating the RB resource of the current TTI to the TTI according to the RB resource position allocated to the first TTI of the TTI Bundling user;

if the resource demand flag is false, polling the next TTI Bundling user to which resources have been allocated in the current TTI until all relevant users are queried, and entering step 1053;

step 1053, processing resource scheduling for MSG3, including determining n determined in step 4_msg3Andif the limited resources have available RB resources, allocating the RB resources for the MSG3 and then entering the step 1053, otherwise, directly entering the step 1054;

step 1054, processing the scheduling of user data, including the data scheduling of TTI Bundling users and non-TTI Bundling users, and aiming at the data scheduling of TTI Bundling users, firstly judging whether the following 2 conditions are satisfied,

the condition 1 is that the current scheduling time modulo 4 is equal to 0, which represents the first resource allocation of the same resource requirement of continuous 4 TTIs of a TTI Bundling user;

condition 2 is n determined in step 4_bundlingAndamong the defined resources are also RB resources that can be used,

if the two conditions are met simultaneously, resource allocation is carried out, after allocation is successful, the resource demand flag position of the user for TTI Bundling is set to be true, and the step 1055 is carried out;

otherwise, go to step 1055 directly;

step 1055, encapsulate the interface message between layers;

step 1056, the current TTI scheduling is finished.