CN109005536A - A conflict-free wireless network temporary identification allocation method - Google Patents

Abstract

The invention discloses a kind of distribution methods of the radio network temporary identifier of Lothrus apterus, belong to mobile communication technology field.This method carries out protocol analysis to wireless communication system first, obtains the service condition and its sum N of the control channel Elements C CE in k-th of subframe in some physical down radio frames_CCE,k；For needs in the PDCCH of certain UE of k-th of sub-frame transmission data, suitable polymerization grade L is selected to bring the total N of CCE into_CCE,kIn, obtain the total N of the proprietary search space the UE_PDCCH,k,L；Then according to the service condition of CCE, the proprietary search space sum N of the value and UE of polymerization grade L_PDCCH,k,L, obtain the proprietary search space situation of unappropriated UE.One is finally randomly choosed from the proprietary search space unappropriated UE and distributes to the UE of required transmission data, and remembers that the location index of the search space of the distribution is S_PDCCH,k,L, and substitute into the formula based on congruence calculation optimization, it calculates RNTI and distributes to the UE.Computation complexity of the present invention is low, practical, and the utilization efficiency of physical control resource is high.

Description

A conflict-free wireless network temporary identification allocation method

technical field

The invention belongs to the technical field of mobile communication, and in particular relates to a method for allocating a non-conflict wireless network temporary identifier.

Background technique

The Long Term Evolution (LTE) standard and the latest 5G Release 15 of the 3rd Generation Partnership Project (3GPP) both support the use of the Radio Network Temporary Identifier (RNTI) as A physical downlink control channel (Physical Downlink Control Channel, PDCCH) of each user equipment (User Equipment, UE) is flexibly scheduled. Each UE will be assigned one or more RNTIs during the random access process with the base station, which will be used to calculate the position of its dedicated search space in each physical downlink data frame, and then search in the dedicated search space Its proprietary PDCCH. According to the LTE standard, in each physical downlink data subframe, the mapping calculation of the RNTI to the UE-specific search space is expressed as:

Where S _{PDCCH, k, L} represent the position index of the UE-specific search space, L is the PDCCH aggregation level, k is the subframe number in the physical downlink radio frame, in LTE k=0,...9, N _{CCE, k} is the total number of control resource elements (ControlChannel Element, CCE) in the kth subframe, and the variable Y _k is defined as:

Y _k ＝(A·Y _k-1 ) mod D (2)

Where Y _-1 is the RNTI allocated to the UE by the base station, where A and D are 39827 and 65537 in LTE, respectively.

The number of search spaces of the same aggregation level in each subframe in LTE is limited, generally only a few dozen, and the number of RNTIs available for allocation is more than 60,000. This means that there is a high probability that any two different RNTIs are mapped to the same UE-specific search space in the same subframe, that is, RNTI allocation conflicts are prone to occur. RNTI allocation conflicts will easily lead to RNTI allocation failure, thereby reducing the utilization rate of CCEs and affecting the overall performance of the system. Therefore, a good RNTI allocation method that can reasonably allocate RNTIs is necessary for systems such as LTE.

There is no specific RNTI allocation scheme given in the LTE and 5G Release standards. The current RNTI allocation methods mainly use the RNTI continuous allocation method and the RNTI random allocation method. Their common feature is that if an RNTI allocation conflict occurs, the RNTI will be re-allocated blindly. . As a result, the more RNTIs are allocated, the greater the probability of collisions, and the RNTI allocation failure is prone to occur, which may lead to the ineffective use of some UE-specific search spaces, that is, CCEs are not effectively used, reducing the online user capacity of the system .

At present, there are few studies on RNTI allocation. Some scholars have proposed the RNTI look-up table allocation method and the RNTI interval allocation method. The RNTI lookup table allocation method that pre-classifies and lists RNTIs according to certain rules reduces the probability of RNTI allocation conflicts to a certain extent, but RNTI conflicts still exist, and it is not flexible enough and takes up more storage space. The RNTI interval allocation method uses different intervals for allocation; the RNTI interval allocation method and the RNTI continuous allocation method are essentially the same type of allocation method, the RNTI continuous allocation method is an allocation method with an interval of 1, and the RNTI continuous allocation method is an interval 3 allocation methods. Although the interval 3 allocation method can reduce RNTI allocation conflicts to a certain extent, its effect is limited.

Contents of the invention

In order to solve the problem of high RNTI allocation conflict rate in LTE and other systems, the present invention proposes a conflict-free wireless network temporary identifier allocation method, which can prevent RNTI allocation from conflicts, effectively improve the RNTI allocation success rate and physical control resource utilization.

Specific steps are as follows:

Step 1. For a wireless communication system that uses a wireless network temporary identifier for physical resource scheduling, perform protocol analysis according to the protocol standard of the communication system, and obtain the control channel element CCE in the kth subframe in a certain physical downlink wireless frame The usage of and its total number N _CCE,k ;

The usage of the control channel element CCE refers to: before the current moment, the base station has allocated resources to other UEs, and the newly added CCEs that can be occupied by the UE that needs to transmit data at the current moment.

Step 2. For the PDCCH of a certain UE that needs to transmit data in the k subframe, select an appropriate aggregation level L; and bring it into the total number N _CCE,k of CCEs to obtain the total number N _PDCCHs,k of the UE-specific search space _{, L} ;

The aggregation level L has different values in different standard protocols; the worse the channel quality, the larger the value of L;

The total number of UE-specific search spaces N _{PDCCH, k, and L} are calculated as follows:

Step 3, according to the use of CCE, the value of the aggregation level L and the total number of UE-specific search spaces N _{PDCCH, k, L} , obtain the situation of the unoccupied UE-specific search space;

According to the value of the aggregation level L, the CCEs are aggregated into a PDCCH, and M ^(L) consecutive PDCCHs constitute a UE-specific search space, and the interval between adjacent UE-specific search spaces is one PDCCH. In each UE-specific search space, at least one CCE where the PDCCH is located is not occupied, which is called an unoccupied UE-specific search space.

Step 4, from unoccupied UE-specific search spaces, randomly select a UE-specific search space to allocate to the UE that needs to transmit data, and record the position index of the allocated search space as S _{PDCCH, k, L} ;

Where S _{PDCCH, k, L} = 0, 1, ..., N _{PDCCH, k, L} -1;

Step 5, substituting the position index S _{PDCCH, k, L} of the UE-specific search space into the formula based on the calculation and optimization of the congruence equation, calculating the RNTI and assigning it to the UE;

The formula for calculating the RNTI based on the calculation and optimization of the congruence equation is as follows:

The value Y _-1 of RNTI is expressed as: Y _-1 = (E _{k, L} + m·F _{k, L} ) mod D;

Wherein, E _{k, L} satisfies E _{k, L} = Y′ _{-1, k} · S _{PDCCH, k, L} , F _{k, L} satisfies F _{k, L} = (Y′ _{-1, k} · N _{PDCCH, k, L} )mod D, D is a constant and a prime number, and the value range of m is Any value of m can be taken during calculation;

Y′ _{-1, k} needs to be obtained by solving the congruence equation ①, and the congruence equation ① is as follows:

A _k · Y′ _{-1, k} ≡ 1 (mod D)

A _k satisfies A _k =A ^k+1 mod D, which is equivalent to A _k =[(A mod D)·A _k-1 ] mod D, where A is a constant smaller than D and is a positive integer.

If the RNTI needs to be calculated with the minimum growth interval, the value of m is calculated by the following formula:

m={[(sE _{k, L} ) mod D]·I _{k, L} } mod D

Among them, I _{k and L} are obtained by solving the congruence equation ② F _{k, L} · I _{k, L} ≡ 1 (mod D), s satisfies s=0, 1, ..., D-1, and can be calculated by incrementing s RNTI with minimum growth pitch.

The solution of the above two congruence equations is as follows:

Step 1, A _k and D, or F _{k, L} and D are respectively removed and divided until the remainder is 0;

Step II, remove the quotient corresponding to the item whose remainder is 0, take out the remaining quotient in reverse order and express it as: a _n , a _n-1 ,..., a ₀ ;

Step III, substituting a _n , a _n-1 , ..., a ₀ into the recursive equation bi = a _ni · bi _{-1 +} bi _-2 to calculate b _n ;

where b ₋₁ =1, b ₀ =a _n ;

Step IV, by b _n according to the equation or Get the value of Y' _-1,k or I _k,L .

Among the above variables, A _k and Y′ _{-1, k} are only related to the subframe number k, I _{k, L} are only related to k and the aggregation level L, and the number of possible values of k and L is limited; therefore, the pre-computed List the values of A _k , Y′ _{-1, k} and k in all cases, and obtain the values of these three variables by looking up the table.

The advantages of the present invention are:

1), a conflict-free allocation method of wireless network temporary identifiers, the calculation complexity of the conventional UE-specific search space index to RNTI reverse mapping calculation is too high, and the practicability is very low; and the congruence-based The inverse mapping calculation method optimized for equation calculation overcomes the problem of high computational complexity and is very practical.

2), a conflict-free wireless network temporary identifier allocation method, compared with the conventional method of calculating RNTI by demapping the position index of the UE-specific search space, the computational complexity is reduced, and it can be adapted to millisecond-level communication system.

3), a conflict-free allocation method of wireless network temporary identifiers, in addition to the proposed RNTI allocation method, there is also optimization of inverse mapping calculations, that is, optimization of formulas and mapping calculations based on congruence calculations; greatly reducing In addition to the computational complexity, the feasibility is higher.

4), a conflict-free wireless network temporary identifier allocation method, which fundamentally avoids RNTI allocation conflicts, realizes conflict-free RNTI allocation, makes the possibility of RNTI allocation failure extremely low, and effectively reduces the cost of RNTI allocation The computational complexity improves the utilization efficiency of physical control resources, improves the online capacity and comprehensive performance of system users.

Description of drawings

Fig. 1 is a flow chart of a method for distributing a wireless network temporary identifier without conflict in the present invention;

FIG. 2 is a schematic diagram of the UE-specific search space distribution in the CCE of the present invention;

Fig. 3 is a simulation comparison diagram of the mapping method of the present invention and the conventional mapping method regarding the change of the calculation time with the subframe number;

Fig. 4 is a simulation comparison diagram of the present invention based on the inverse mapping calculation method for solving the congruence equation and the conventional inverse mapping calculation method on the calculation time consumption changing with the subframe number and the total number of PDCCH search spaces;

Fig. 5 is a simulation comparison diagram of the present invention and the traditional RNTI allocation method about the cumulative number of allocation conflicts changing with the allocation completion rate;

FIG. 6 is a simulation comparison diagram between the present invention and the traditional RNTI allocation method on the variation of CCE utilization rate with the calculation time consumption.

Detailed ways

The present invention will be further described in detail below in conjunction with the accompanying drawings.

The present invention discloses a method for allocating temporary identifiers of wireless networks without conflicts. First, an unoccupied UE-specific search space is randomly allocated, and then the position index of the UE-specific search space is used to solve the problem based on the congruence equation. The optimal (or solve the congruence equation in advance to obtain the result, and list it for query) inverse mapping calculation method calculates the RNTI and assigns it to the UE to complete the RNTI allocation.

The specific process is shown in Figure 1: First, calculate the total number and usage of the CCEs of the kth subframe in the current radio frame; select an appropriate aggregation level L for the PDCCH of the UE that needs to transmit messages in the subframe; The use of the CCE and the aggregation level L randomly select an effective UE-specific search space for the UE; substitute the position index of the UE-specific search space into the equation based on the solution optimization of the congruence equation to calculate the RNTI allocation to the UE. By adopting the invention, RNTI allocation can be freed from conflicts, and the calculation complexity of RNTI allocation can be effectively reduced, the utilization efficiency of physical control resources is improved, and the online capacity and comprehensive performance of system users are improved.

Specific steps are as follows:

Step 1. For a wireless communication system that uses a wireless network temporary identifier for physical resource scheduling, perform protocol analysis according to the protocol standard of the communication system, and obtain the kth subframe used to carry the PDCCH in a current physical downlink wireless frame The usage of control channel element CCE and its total number N _CCE,k ;

The wireless communication system includes but is not limited to two protocol standards of the 4G wireless system: TD-LTE and FDD-LTE; and the upcoming 5G wireless system.

The usage of the CCEs refers to the resources allocated by the base station to other users before the current moment, and the newly added CCEs that can be occupied by the UE that needs to transmit data at the current moment.

Subframe number k is in LTE, k=0,...9;

Step 2. For the PDCCH of a user equipment UE that needs to transmit data in the kth subframe, select an appropriate aggregation level L, and bring it into the total number N _{CCE, k} of CCEs to obtain the total number N _PDCCHs of the UE-specific search space _{, k, L} ;

In 4G LTE, the values of aggregation level L are 1, 2, 4, and 8; in the 5G R15 standard protocol, the values of aggregation level L are 1, 2, 4, 8, and 16. The worse the channel quality, the L The larger the value is; then the maximum number of N _{CCEs, k} CCEs that can carry PDCCHs with an aggregation level of L is N _{PDCCH, k, L} , and the corresponding maximum number of UE-specific search spaces with an aggregation level of L is also N _{PDCCH, k, L} , where

Step 3, according to the use of CCE in step 1, the value of the aggregation level L in step 2 and the total number of UE-specific search spaces N _{PDCCH, k, L} , obtain the situation of the unoccupied UE-specific search space;

According to the use of the CCE, further obtain the available UE-specific search space (such as sequence number, etc.); after obtaining the vacancy of the UE-specific search space, select one of them arbitrarily, and prepare to allocate it to the UE that needs to transmit data.

In N _{CCE, among k} CCEs, starting from the first CCE, each L CCE is counted as a PDCCH with an aggregation level of L, consecutive M ^(L) PDCCHs are a UE-specific search space, and adjacent UEs The dedicated search space interval is a PDCCH, and they may overlap; the value of M ^(L) in LTE is as follows:

Table 1

In a UE-specific search space, at least one CCE where the PDCCH is located is not occupied, which is called an unoccupied UE-specific search space;

Step 4, from unoccupied UE-specific search spaces, randomly select a UE-specific search space to allocate to the UE that needs to transmit data, and record the position index of the allocated search space as S _{PDCCH, k, L} ;

Where S _{PDCCH, k, L} = 0, 1, ..., N _{PDCCH, k, L} -1;

Step 5, substituting the position index S _{PDCCH, k, L} of the UE-specific search space into the formula based on the calculation and optimization of the congruence equation, calculating the RNTI and assigning it to the UE;

A value of the variable m is arbitrarily given, and together with the _{SPDCCH, k, and L} , it is substituted into the following equation based on solving and optimizing the congruence equation, an RNTI that meets the requirements can be efficiently calculated and allocated to the UE; in The formula for calculating the RNTI based on the calculation and optimization of the congruence equation is as follows:

The value Y _-1 of RNTI is expressed as: Y _-1 = (E _{k, L} + m·F _{k, L} ) mod D;

Wherein, E _{k, L} satisfies E _{k, L} = Y′ _{-1, k} · S _{PDCCH, k, L} , F _{k, L} satisfies F _{k, L} = (Y′ _{-1, k} · N _{PDCCH, k, L} ) mod D, D is a constant and a prime number; D=65537 in LTE;

The Y′ _{-1, k} needs to be obtained by solving the congruence equation ①, and the congruence equation ① is as follows:

A _k · Y′ _{-1, k} ≡ 1 (mod D)

Wherein A _k satisfies A _k =A ^k+1 mod D, where A is a constant less than D and is a positive integer, and A=39827 in LTE;

The calculation complexity of the reverse mapping calculation from the ordinary UE-specific search space to the UE-specific RNTI is too high, and the practicability is very low; and the reverse mapping calculation method based on the solution of the congruence equation proposed by the present invention is well overcome. Problems with high computational complexity are very practical.

1) In the present invention, if the next RNTI that meets the requirements needs to be calculated with the minimum growth distance, then m needs to satisfy m={[(sE _{k, L} ) mod D]·I _{k, L} } mod D, when m is satisfied Under the value range of , increasing the variable s can be calculated to obtain the same kind of RNTI with minimum spacing growth, where s=0, 1, ..., D-1, the I _{k, L} need to solve the congruence equation F _{k , L} · I _{k, L} ≡ 1(modD)② obtained.

2) In the present invention, A _k =[(A mod D)·A _k-1 ] mod D can be used to replace A _k =A ^k+1 mod D to reduce calculation accuracy requirements; in addition, equation A _k = [(A mod D) · A _k-1 ] mod D and A _k = A ^k+1 mod D can also be used in the equation Y _k = (A · Y _-1 ) mod D to drastically reduce LTE etc. The calculation complexity of the equation y _k =(A·Y _k-1 ) mod D related to the calculation of RNTI mapping in the system.

The optimization calculation method can not only be applied to the RNTI allocation method in the present invention, but also can be applied to other calculations related to the mapping from RNTI to UE-specific search space index in the system.

The solution method of the above two congruence equations can be used but not limited to the following methods:

Step 1, A _k and D, or F _{k, L} and D are respectively removed and divided until the remainder is 0;

Step II, remove the quotient corresponding to the item whose remainder is 0, take out the remaining quotient in reverse order and express it as: a _n , a _n-1 ,..., a ₀ ;

Step III, substituting a _n , a _n-1 , ..., a ₀ into the recursive equation bi = a _ni · bi _{-1 +} bi _-2 to calculate b _n ;

where b ₋₁ =1, b ₀ =a _n ;

Step IV, by b _n according to the equation or Get the value of Y' _-1,k or I _k,L .

Among the above variables, A _k and Y′ _{-1, k} are only related to subframe number k, I _{k, L} are only related to k and aggregation level L, and the number of possible values of k and L is limited and small Therefore, the values of the three variables A _k , Y′ _{-1, k} and k can be pre-calculated and tabulated, and the values of these three variables can be obtained by looking up the table, which can further improve the calculation efficiency of the method of the present invention.

The method of the present invention is mainly used for but not limited to the UE-specific search space; the RNTI in the method includes but not limited to: Cell RNTI, Temporary C-RNTI, Semi-Persistent Scheduling C-RNTI.

In the present invention, the value range of the subframe number k is but not limited to k=0, . . . 9, and the possible value of the aggregation level L is but not limited to 1, 2, 4 or 8.

The calculation example is as follows: Suppose k=6, N _{CCE, 6} =50, all CCEs are not used yet, L=2, then Random assignment S _{PDCCH, 6, 2} = 17, m = 5, and Y' _{-1, k} has been calculated in advance and table 2, look up table 2 to get Y' -1, 6 = ₅₇₅₄₅ , then E ₆ , 2 = 978265, F 6, ₂ = 62348, finally get the assignable RNTI value:

Y ₋₁ = (E _6,2 + m · F 6, ₂ ) mod D = (978265+5 · 62348) mod 65537 = 44802

Table 2

k A _k Y' _-1,k k A _k Y' _-1,k 0 39827 61772 5 8291 15825 1 63455 19233 6 30251 57545 2 50028 6140 7 39906 8397 3 9282 17461 8 64012 39666 4 45534 58483 9 16624 16333

Substitute 44802 into equations (1) and (2) for verification, wherein equation (2) is calculated by the optimized mapping algorithm in the present invention. Query Table 2 to obtain A ₆ =30251, and the verification process is as follows:

S _{PDCCH, 6, 2} = ((A ₆ ·Y _-1 ) mod D) mod N _{PDCCH, 6, 2} = ((30251 · 44802) mod 65537) mod 25 = 17

This proves that RNTI is 44802 to meet the requirements.

In order to better understand the relationship between the RNTI and the UE-specific search space, a schematic diagram of the distribution of the UE-specific search space in the CCE of the present invention, as shown in Figure 2, when the aggregation levels of the PDCCHs are both 2 or 8, adjacent There are overlapped UE-specific search spaces, and their distance is the CCE length occupied by a PDCCH with an aggregation level of 2 or 8.

The mapping calculation method proposed in the present invention has lower computational complexity than the conventional mapping method, which brings great benefits to the present invention and other calculations related to RNTI mapping. As shown in Figure 3, the present invention proposes The mapping calculation method SMRSM (The Simple Method of RNTI-to-Search-Spaces Mapping) compares the time consumption of the conventional mapping method with the change of the subframe number, and the present invention reduces the time consumption by an average of 79.5%, and the time consumption is not It will become larger as the subframe number increases.

Compared with conventional inverse mapping calculation methods, the reverse mapping method RMMBIE (The Reverse Mapping Method Based on Inverse Element) of the present invention based on congruence equation solution optimization greatly reduces the computational complexity, as shown in Figure 4, which is the present invention based on the same The simulation comparison between the inverse mapping calculation method for solving the residual equation and the conventional inverse mapping calculation method on the calculation time-consuming changes with the subframe number and the total number of PDCCH search spaces shows that the conventional inverse mapping method will increase with the subframe number and the total number of PDCCH search spaces. increase and approximately linear increase, the average calculation time consumption is 1.14 milliseconds; while the calculation time consumption of the optimized inverse mapping method based on the congruence equation solution does not change with the subframe number and the total number of PDCCH search spaces, and the calculation time consumption averages 2.9 microseconds seconds, its advantages are obvious.

The simulation comparison of the RNTI allocation method CFRAA (The Conflict-Free RNTI Algorithm) proposed by the present invention and the traditional RNTI allocation method on the change of the cumulative number of allocation conflicts with the allocation completion rate, as shown in Figure 5, shows that the number of RNTI conflicts in the present invention is always Keep at zero, while the cumulative number of conflicts of the other three conventional methods rises rapidly after the completion rate is about 50%, and the final total number of conflicts is more than dozens of times; this also verifies the non-conflict feature of the present invention.

The simulation comparison between the present invention and the traditional RNTI allocation method about the CCE utilization rate changing with the time-consuming calculation, as shown in Figure 6, shows that the method CFRAA of the present invention can achieve nearly 100% of the CCE peak utilization rate in 0.17 milliseconds; while other The three conventional methods cannot achieve 100% CCE utilization in the LTE subframe duration of 1 millisecond, which indicates that the present invention has a significant effect on improving the CCE utilization.

Finally, it should be noted that the above preferred embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail through the above preferred embodiments, those skilled in the art should understand that it can be described in terms of form and Various changes may be made in the details without departing from the scope of the invention defined by the claims.

Claims (4)

1. a kind of distribution method of the radio network temporary identifier of Lothrus apterus, which is characterized in that specific step is as follows:

Step 1: the wireless communication system of physical resource scheduling is carried out using radio network temporary identifier for some, according to this The consensus standard of communication system carries out protocol analysis, obtains the control letter in k-th of subframe in some physical down radio frames The service condition and its sum N of road Elements C CE_CCE,k；

Step 2: for needing to select suitable polymerization grade L in the PDCCH of certain UE of k-th of sub-frame transmission data；And band Enter the total N of CCE_CCE,kIn, obtain the total N of the proprietary search space the UE_PDCCH,k,L；

For polymerization grade L in different standard agreements, value is different；Channel quality is poorer, and L value is bigger；

The total N of the proprietary search space UE_PDCCH,k,LCalculation formula it is as follows:

Step 3: according to the service condition of CCE, the proprietary search space sum N of the value and UE of polymerization grade L_PDCCH,k,L, obtain The unappropriated proprietary search space situation of UE；

Step 4: from the proprietary search space unappropriated UE, randomly choose needed for the proprietary search space UE distributes to The UE of data is transmitted, and remembers that the location index of the search space of the distribution is S_PDCCH,k,L；

Wherein S_PDCCH,k,L=0,1 ..., N_PDCCH,k,L-1；

Step 5: by the location index S of the proprietary search space the UE_PDCCH,k,LSubstitute into the formula based on congruence calculation optimization In, it calculates RNTI and distributes to the UE；

The formula based on congruence calculation optimization for calculating RNTI is specific as follows:

The value Y of RNTI_-1It indicates are as follows: Y_-1=(E_k,L+m·F_k,L)modD；

Wherein, E_k,LMeet E_k,L=Y'_-1,k·S_PDCCH,k,L, F_k,LMeet F_k,L=(Y'_-1,k·N_PDCCH,k,L) modD, D be constant and Value range for prime number, m isIt calculates and former takes a m value；

Y'_-1,kIt need to 1. be obtained by solving congruence, congruence is 1. as follows:

A_k·Y'_-1,k≡1(modD)

Wherein A_kMeet A_k=A^k+1ModD is equivalent to A_k=[(AmodD) A_k-1] modD, wherein A is the constant for being less than D It and is positive integer；

If necessary to which when increasing distance computation RNTI with minimum, the value of m is calculated by following formula:

M={ [(s-E_k,L)modD]·I_k,L}modD

Wherein, I_k,LBy solving congruence 2. F_k,L·I_k,L≡ 1 (modD) is obtained, and s meets s=0,1 ..., D-1, is incremented by s The minimum RNTI for increasing spacing is calculated；

In above-mentioned variable, A_kAnd Y'_-1,kOnly, I related with subframe number k_k,LIt is only related with k and polymerization grade L, and k and L It can value limited amount；Therefore A is precomputed_k, Y'_-1,kValue and list with k all situations, obtain these three by tabling look-up The value of variable.

2. a kind of distribution method of the radio network temporary identifier of Lothrus apterus as described in claim 1, which is characterized in that described The service condition of control channel Elements C CE refer to: before current time, base station is already allocated to the resource of other UE, and The newly-increased CCE that need to can be occupied in the UE that current time transmits data.

3. a kind of distribution method of the radio network temporary identifier of Lothrus apterus as described in claim 1, which is characterized in that described The step of three specifically: according to the value of polymerization grade L, CCE is aggregated into PDCCH, continuous M^(L)A PDCCH constitutes a UE Proprietary search space is divided into a PDCCH between the proprietary search space adjacent UE；At least one in each proprietary search space UE CCE where a PDCCH is unoccupied, the referred to as unappropriated proprietary search space UE.

4. a kind of distribution method of the radio network temporary identifier of Lothrus apterus as described in claim 1, which is characterized in that described The step of five in, the method for solving of two congruences is as follows:

Step I, to A_kAnd D or F_k,LIt carries out tossing about to be divided by until remainder is 0 respectively with D；

Step II, removing remainder is quotient corresponding to 0, and remaining quotient's backward is taken out and indicated are as follows: a_n,a_n-1,...,a₀；

Step III, by a_n,a_n-1,...,a₀Substitute into recursive equation b_i=a_n-i·b_i-1+b_i-2In calculate b_n；

Wherein b_-1=1, b₀=a_n；

Step IV, by b_nAccording to equationOrObtain Y'_-1,k Or I_k,LValue.