CN109005536B - Conflict-free wireless network temporary identifier distribution method - Google Patents
Conflict-free wireless network temporary identifier distribution method Download PDFInfo
- Publication number
- CN109005536B CN109005536B CN201810894018.9A CN201810894018A CN109005536B CN 109005536 B CN109005536 B CN 109005536B CN 201810894018 A CN201810894018 A CN 201810894018A CN 109005536 B CN109005536 B CN 109005536B
- Authority
- CN
- China
- Prior art keywords
- pdcch
- rnti
- specific search
- cce
- search space
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000009826 distribution Methods 0.000 title abstract description 12
- 238000004364 calculation method Methods 0.000 claims abstract description 46
- 238000004220 aggregation Methods 0.000 claims abstract description 27
- 230000002776 aggregation Effects 0.000 claims abstract description 27
- 238000005457 optimization Methods 0.000 claims abstract description 17
- 238000004891 communication Methods 0.000 claims abstract description 10
- 230000005540 biological transmission Effects 0.000 claims description 4
- 238000005096 rolling process Methods 0.000 claims description 3
- 238000006467 substitution reaction Methods 0.000 claims description 3
- 230000004931 aggregating effect Effects 0.000 claims description 2
- 238000006116 polymerization reaction Methods 0.000 claims 1
- 238000010295 mobile communication Methods 0.000 abstract description 2
- 238000013507 mapping Methods 0.000 description 11
- 238000004088 simulation Methods 0.000 description 7
- 238000007796 conventional method Methods 0.000 description 4
- 101100184647 Azotobacter vinelandii modC1 gene Proteins 0.000 description 3
- 101150034584 MODD gene Proteins 0.000 description 3
- 101150080488 apa gene Proteins 0.000 description 3
- 238000009825 accumulation Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000001028 reflection method Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000001186 cumulative effect Effects 0.000 description 1
- GVVPGTZRZFNKDS-JXMROGBWSA-N geranyl diphosphate Chemical compound CC(C)=CCC\C(C)=C\CO[P@](O)(=O)OP(O)(O)=O GVVPGTZRZFNKDS-JXMROGBWSA-N 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- HOWHQWFXSLOJEF-MGZLOUMQSA-N systemin Chemical compound NCCCC[C@H](N)C(=O)N[C@@H](CCSC)C(=O)N[C@@H](CCC(N)=O)C(=O)N[C@@H]([C@@H](C)O)C(=O)N[C@@H](CC(O)=O)C(=O)OC(=O)[C@@H]1CCCN1C(=O)[C@H]1N(C(=O)[C@H](CC(O)=O)NC(=O)[C@H](CCCN=C(N)N)NC(=O)[C@H](CCCCN)NC(=O)[C@H](CO)NC(=O)[C@H]2N(CCC2)C(=O)[C@H]2N(CCC2)C(=O)[C@H](CCCCN)NC(=O)[C@H](CO)NC(=O)[C@H](CCC(N)=O)NC(=O)[C@@H](NC(=O)[C@H](C)N)C(C)C)CCC1 HOWHQWFXSLOJEF-MGZLOUMQSA-N 0.000 description 1
- 108010050014 systemin Proteins 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/26—Network addressing or numbering for mobility support
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0001—Arrangements for dividing the transmission path
- H04L5/0003—Two-dimensional division
- H04L5/0005—Time-frequency
- H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
- H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0058—Allocation criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Databases & Information Systems (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a conflict-free wireless network temporary identifier distribution method, and belongs to the technical field of mobile communication. The method comprises the steps of firstly carrying out protocol analysis on a wireless communication system to obtain the use condition of a control channel element CCE in a kth subframe in a certain physical downlink wireless frame and the total number N of the use conditionCCE,k(ii) a Selecting a proper aggregation level L to bring the total number N of CCEs into the PDCCH of a certain UE needing to transmit data in the kth subframeCCE,kObtaining the total number N of the UE-specific search spacesPDCCH,k,L(ii) a Then according to the CCE use condition, the value of the aggregation level L and the total number N of the UE-specific search spacesPDCCH,k,LAnd acquiring the unoccupied UE-specific search space situation. And finally randomly selecting one UE which is allocated to the data to be transmitted from the unoccupied UE-specific search space, and recording the position index of the allocated search space as SPDCCH,k,LAnd substituting the formula into a formula for calculation and optimization based on a congruence equation, and calculating the RNTI to be distributed to the UE. The invention has low calculation complexity, strong practicability and high utilization efficiency of physical control resources.
Description
Technical Field
The invention belongs to the technical field of mobile communication, and particularly relates to a conflict-free wireless network temporary identifier allocation method.
Background
Both The Long Term Evolution (LTE) standard and The currently latest 3rd Generation Partnership project (3 GPP) 5G Release 15 support flexible scheduling for The Physical Downlink Control Channel (PDCCH) of each User Equipment (UE) using Radio Network Temporary Identity (RNTI). Each UE is allocated with one or more RNTIs in the random access process with the base station to be used for calculating the position of a special search space in each physical downlink data frame, and then the special PDCCH of the UE is searched in the special search space. 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:
wherein SPDCCH，k，LPosition index indicating UE-specific search space, L being PDCCH aggregation level, k being subframe number in physical downlink radio frame, k being 0 in LTECCE，kIs the total number of control resource elements (CCEs) in the k-th subframe, and the variable YkIs defined as:
Yk＝(A·Yk-1)mod D (2)
wherein Y is-1I.e. the RNTI assigned to the UE by the base station, where a and D are 39827 and 65537, respectively, in LTE.
The number of search spaces of the same aggregation level per subframe in LTE is limited, typically only a few tens of search spaces, while the number of RNTIs available for allocation is more than sixty thousand. This means that there is a high probability that any two different RNTIs map to the same UE-specific search space of the same subframe, i.e. RNTI allocation conflicts tend to occur. RNTI allocation conflict easily causes RNTI allocation failure, so that the utilization rate of CCE is reduced, and the comprehensive performance of the system is influenced. Therefore, a good RNTI assignment method that can reasonably assign RNTIs is necessary for systems such as LTE.
The LTE and 5G Release standards do not provide a specific RNTI allocation scheme, the conventional RNTI allocation method mainly adopts an RNTI continuous allocation method, an RNTI random allocation method and the like, and the common characteristic of the RNTI continuous allocation method and the RNTI random allocation method is that RNTI is allocated again blindly if RNTI allocation conflict occurs. Therefore, the more RNTIs are allocated, the higher the probability of collision, and the RNTI allocation failure is easy to occur, so that part of the UE private search space can not be effectively used, namely CCE is not effectively used, and the online user capacity of the system is reduced.
Currently, there are few studies on RNTI assignment, and some researchers have proposed an RNTI table lookup assignment method and an RNTI interval assignment method. The RNTI table-searching allocation method which classifies RNTIs in advance according to a certain rule and lists the RNTIs reduces the probability of RNTI allocation conflict to a certain extent, but RNTI conflict still exists and is not flexible enough and occupies more storage space. The RNTI interval allocation method adopts different intervals for allocation; the RNTI interval allocation method is an allocation method with an interval of 1, and the RNTI continuous allocation method is an allocation method with an interval of 3. The interval 3 allocation method can reduce RNTI allocation collisions to some extent, but its effect is limited.
Disclosure of Invention
In order to solve the problem of high RNTI allocation conflict rate in systems such as LTE and the like, the invention provides a conflict-free wireless network temporary identifier allocation method, which can prevent RNTI allocation from conflict and effectively improve the RNTI allocation success rate and the physical control resource utilization rate.
The method comprises the following specific steps:
step one, aiming at a certain wireless communication system adopting a wireless network temporary identifier to carry out physical resource scheduling, carrying out protocol analysis according to the protocol standard of the communication system to obtain the use condition of a control channel element CCE in a k subframe in a certain physical downlink wireless frame and the total number N of the control channel element CCECCE，k；
The use case of the control channel element CCE refers to: before the current time, the base station has already 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 time.
Step two, selecting a proper aggregation level L aiming at a PDCCH of a certain UE needing to transmit data in a kth subframe; and brings in the total number N of CCEsCCE，kObtaining the total number N of the UE-specific search spacesPDCCH，k，L；
The aggregation level L has different values in different standard protocols; the worse the channel quality, the larger the value of L;
total number N of UE-specific search spacesPDCCH，k，LThe calculation formula of (a) is as follows:
step three, according to the use condition of the CCE, the value of the aggregation level L and the total number N of the UE-specific search spacesPDCCH，k，LAcquiring the condition of an unoccupied UE-specific search space;
aggregating CCEs into PDCCHs according to the value of the aggregation level L, and continuously M(L)Each PDCCH forms a UE-specific search space, and the interval between adjacent UE-specific search spaces is one PDCCH. The CCEs where at least one PDCCH is located in each UE-specific search space are all unoccupied, and the CCEs are called the unoccupied UE-specific search spaces.
Step four, randomly selecting a UE special search space from the unoccupied UE special search spaces to be allocated to the UE needing data transmission, and recording the position index of the allocated search space as SPDCCH，k，L；
Wherein SPDCCH，k，L＝0，1，...，NPDCCH，k，L-1；
Step five, indexing the position of the UE special search space SPDCCH，k，LSubstituting into a formula for calculation and optimization based on a congruence equation, and calculating the RNTI to be distributed to the UE;
the formula for calculating the RNTI based on the congruence equation calculation optimization is specifically as follows:
value Y of RNTI-1Expressed as: y is-1＝(Ek，L+m·Fk，L)mod D；
Wherein E isk，LSatisfies Ek，L＝Y′-1，k·SPDCCH，k，L，Fk，LSatisfies Fk，L＝(Y′-1，k·NPDCCH，k，L) mod D, D is a constant and is a prime number, and m has a value range of
Any value m can be taken during calculation;
Y′-1，kit is obtained by solving congruence equation ①, and congruence equation ① is as follows:
Ak·Y′-1，k≡1(mod D)
wherein A iskSatisfies Ak＝Ak+1mod D, equivalent to Ak＝[(A mod D)·Ak-1]mod D, where A is a constant less than D and is a positive integer.
If the RNTI needs to be calculated at the minimum growth distance, the value of m is calculated by the following formula:
m＝{[(s-Ek，L)modD]·Ik，L}mod D
wherein, Ik，LBy solving congruence equation ② Fk，L·Ik，L≡ 1(mod D) is obtained, s satisfies s ═ 0,1,., D-1, and the RNTI with the smallest growing distance can be calculated by incrementing s.
The solution method of the above two congruence equations is as follows:
step I, for AkAnd D, or Fk，LAnd D, respectively carrying out rolling division until the remainder is 0;
and step II, removing the quotient corresponding to the item with the remainder of 0, taking out the rest quotient in a reverse order, and expressing the rest quotient as: a isn，an-1，...，a0；
Step III, mixing an，an-1，...，a0Substitution into recursion equation bi＝an-i·bi-1+bi-2To calculate bn；
Wherein b is-1＝1，b0＝an；
Step IV, from bnAccording to the equation
OrTo obtain Y'-1，kOr Ik，LThe value of (c).
In the above variables, AkAnd Y'-1，kAssociated with subframe number k only, Ik，LOnly with respect to k and aggregation level L, with a limited number of possible values for k and L; thus, A is calculated in advancek，Y′-1，kAnd k are tabulated for all cases, and the values of these three variables are obtained by table lookup.
The invention has the advantages that:
1) the conventional method for distributing the radio network temporary identifier from the UE proprietary search space index to the RNTI reflection calculation has too high calculation complexity and low practicability; the reflection projection calculation method based on congruence equation calculation optimization provided by the invention well overcomes the problem of high calculation complexity and has strong practicability.
2) Compared with the conventional method of reflecting and transmitting the RNTI by the position index of the UE-specific search space, the method for allocating the conflict-free radio network temporary identifier has the advantages that the calculation complexity is reduced, and the method can be suitable for a millisecond-level communication system.
3) Besides the proposed RNTI distribution method, the method also comprises the optimization of reflection and transmission calculation, namely the optimization of a formula and mapping calculation based on the homological formula calculation optimization; the calculation complexity is greatly reduced, and the feasibility is higher.
4) The conflict-free radio network temporary identifier allocation method fundamentally avoids RNTI allocation conflict, realizes conflict-free RNTI allocation, has extremely low possibility of RNTI allocation failure, effectively reduces the calculation complexity of RNTI allocation, improves the utilization efficiency of physical control resources, and improves the online capacity and the comprehensive performance of system users.
Drawings
Fig. 1 is a flow chart of a method for allocating wireless network temporary identifications without conflict according to the present invention;
FIG. 2 is a diagram illustrating the distribution of UE-specific search spaces in CCE according to the present invention;
FIG. 3 is a simulation comparison graph of the calculation time consumption varying with the subframe number of the mapping method of the present invention and the conventional mapping method;
FIG. 4 is a simulation comparison graph of the present invention of the time-consuming computation with the subframe number and the total number of PDCCH search spaces, based on the congruence equation solution of the reflection computing method and the conventional reflection computing method;
figure 5 is a simulation comparison graph of the cumulative number of allocation conflicts with the change of the allocation completion rate according to the present invention and the conventional RNTI allocation method;
fig. 6 is a simulation comparison diagram of the CCE utilization ratio of the present invention with respect to a conventional RNTI assignment method as a function of time consumed for calculation.
Detailed Description
The present invention will be described in further detail below with reference to the accompanying drawings.
The invention discloses a conflict-free allocation method of a wireless network temporary identifier, which comprises the steps of randomly allocating an unoccupied UE-specific search space, then indexing the position of the UE-specific search space, and calculating RNTI and allocating the RNTI to UE by a reflection-emission calculation method based on congruence equation solution optimization (or solving the congruence equation in advance to obtain a result, and arranging a table for query).
The specific process is shown in figure 1: firstly, calculating the total number and the use condition of CCEs of the kth subframe in the current wireless frame; selecting a proper aggregation level L for a PDCCH of a UE which needs to transmit a message in the subframe; randomly selecting an effective UE specific search space for the UE according to the use condition of the CCE and the aggregation level L; and substituting the position index of the UE-specific search space into an equation based on congruence equation solution optimization to calculate the RNTI to be distributed to the UE. By adopting the invention, the RNTI allocation can be prevented from conflict, the calculation complexity of the RNTI allocation is effectively reduced, the utilization efficiency of physical control resources is improved, and the online capacity and the comprehensive performance of system users are improved.
The method comprises the following specific steps:
step one, aiming at a certain wireless communication system adopting a wireless network temporary identifier to carry out physical resource scheduling, carrying out protocol analysis according to the protocol standard of the communication system and obtaining a certain current communication systemIn a physical downlink radio frame, the use condition of a Control Channel Element (CCE) used for bearing a PDCCH in a kth subframe and the total number N of the CCEsCCE，k；
The wireless communication system includes but is not limited to two protocol standards of a 4G wireless system: TD-LTE and FDD-LTE; and upcoming 5G wireless systems.
The use case of CCE means: before the current time, the base station has already allocated resources to other users, and the newly added CCEs that can be occupied by the UE needing to transmit data at the current time.
Subframe number k is in LTE, k is 0.. 9;
step two, selecting a proper aggregation level L for a PDCCH of a certain user equipment UE needing to transmit data in the kth subframe, and bringing the aggregation level L into the total number N of CCEsCCE，kObtaining the total number N of the UE-specific search spacesPDCCH，k，L；
Aggregation levels L take the values 1, 2, 4 and 8 in 4G LTE; in a 5G R15 standard protocol, aggregation levels L are 1, 2, 4, 8 and 16, and the worse the channel quality, the larger the value of L; then the N isCCE，kThe maximum number N of PDCCHs with aggregation level L can be carried by one CCEPDCCH，k，LThe maximum number of UE-specific search spaces corresponding to an aggregation level L is also NPDCCH，k，LWherein
Step three, according to the use condition of the CCE in the step one, the value of the aggregation level L in the step two and the total number N of the UE-specific search spacesPDCCH，k，LAcquiring the condition of an unoccupied UE-specific search space;
according to the use condition of the CCE, further obtaining the condition (such as sequence number and the like) of the available UE special search space; and after the spare condition of the UE-specific search space is obtained, selecting one of the spare conditions to prepare to be allocated to the UE needing to transmit data.
In NCCE，kIn each CCE, M consecutive CCEs are counted as a PDCCH with an aggregation level L from the first CCE(L)PDCCH is a UE-specific search space, and the interval between adjacent UE-specific search spaces is a PDCCH, which can be overlapped; m(L)The values of (a) in LTE are as follows:
TABLE 1
CCEs where at least one PDCCH is located in one UE-specific search space are all unoccupied, namely the CCEs are called as unoccupied UE-specific search spaces;
step four, randomly selecting a UE special search space from the unoccupied UE special search spaces to be allocated to the UE needing data transmission, and recording the position index of the allocated search space as SPDCCH，k，L；
Wherein SPDCCH，k，L＝0，1，...，NPDCCH，k，L-1；
Step five, indexing the position of the UE special search space SPDCCH，k，LSubstituting into a formula for calculation and optimization based on a congruence equation, and calculating the RNTI to be distributed to the UE;
any given variable m has a value, and is associated with said SPDCCH，k，LJointly substituting the RNTIs into the following equation for solving optimization based on the congruence equation, namely efficiently calculating an RNTI meeting the requirement and distributing the RNTI to the UE; wherein
The formula for calculating the RNTI based on the congruence equation calculation optimization is specifically as follows:
value Y of RNTI-1Expressed as: y is-1＝(Ek，L+m·Fk，L)mod D；
Wherein E isk，LSatisfies Ek，L＝Y′-1，k·SPDCCH，k，L，Fk，LSatisfies Fk，L＝(Y′-1，k·NPDCCH，k，L) mod D, D is a constant and is a prime number; d65537 in LTE;
y'-1，kNeed to solve the congruence squareEquation ①, obtained by equation ①, is as follows:
Ak·Y′-1，k≡1(mod D)
wherein A iskSatisfies Ak＝Ak+1mod D, where a is a constant less than D and is a positive integer, in LTE a 39827;
the computational complexity of the reflection-projection calculation from the common UE-specific search space to the UE-specific RNTI is too high, and the practicability is very low; the reflection-ray calculation method based on congruence equation solution optimization provided by the invention well overcomes the problem of high calculation complexity and has strong practicability.
1) In the present invention, if the next RNTI meeting the requirement needs to be calculated with the minimum growth distance, m needs to satisfy m { [ (s-E)k，L)mod D]·Ik，LMod D, under the condition that the value range of m is met, increasing a variable s progressively to obtain the same type of RNTI increased by the minimum distance, wherein s is 0,1k，LBy solving a congruence equation Fk，L·Ik，L≡ 1(modD) ②.
2) In the present invention, A can be usedk＝[(A mod D)·Ak-1]mod D instead of Ak＝Ak+1mod D to reduce computational accuracy requirements; in addition to that, equation Ak＝[(A mod D)·Ak-1]mod D and Ak＝Ak+1mod D may also be used for equation Yk＝(A·Y-1) In mod D, equation y related to RNTI mapping calculation in systems such as LTE is greatly reducedk＝(A·Yk-1) The computational complexity of modD.
The optimization calculation method can be applied to the RNTI distribution method in the invention, and can also be applied to other calculations related to the mapping of the RNTI to the UE proprietary search space index in the system.
The solution method of the above two congruence equations can use, but is not limited to, the following methods:
step I, for AkAnd D, or Fk，LAnd D, respectively carrying out rolling division until the remainder is 0;
step II, removing the item with remainder of 0Quotient, the remaining quotient is taken out in reverse order and expressed as: a isn，an-1，...，a0；
Step III, mixing an，an-1，...，a0Substitution into recursion equation bi＝an-i·bi-1+bi-2To calculate bn；
Wherein b is-1＝1，b0＝an；
Step IV, from bnAccording to the equation
Or
To obtain Y'-1，kOr Ik，LThe value of (c).
In the above variables, AkAnd Y'-1，kAssociated with subframe number k only, Ik，LOnly with respect to k and the aggregation level L, the number of values that can be taken for k and L being limited and small, so a can be pre-calculatedk，Y′-1，kAnd k, the values of all the three variables are tabulated, and the values of the three variables are obtained by table lookup, so that the calculation efficiency of the method can be further improved.
The method of the present invention is mainly used for, but not limited to, UE-specific search spaces; the RNTI in the method includes but is not limited to: cell RNTI, Temporary Temporary C-RNTI and 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 possible values of the aggregation level L are, but not limited to, 1, 2, 4, or 8.
An example of the calculation is as follows: let k equal to 6, N CCE，650, all CCEs are temporarily unused, L2, then
Random assignment SPDCCH，6，217, m is 5, and Y'-1，kHas been calculated in advance and tabulated 2, looking up table 2 to obtainY′-1，657545, then E6，2＝978265，F6，262348, the assignable RNTI value is finally obtained:
Y-1＝(E6，2+m·F6，2)mod D＝(978265+5·62348)mod 65537＝44802
TABLE 2
| k | Ak | Y′-1，k | k | Ak | 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 |
44802 is substituted into equations (1) and (2) for verification, where equation (2) is calculated by the optimized mapping algorithm in the present invention. TABLE 2 available A630251, the verification process is as follows:
SPDCCH，6，2＝((A6·Y-1)mod D)mod NPDCCH，6，2＝((30251·44802)mod65537)mod 25＝17
from this it is concluded that the RNTI is 44802.
In order to better understand the relationship between the RNTI and the UE-specific search space, the UE-specific search space distribution in the CCE of the present invention is schematically illustrated, as shown in fig. 2, when aggregation levels of PDCCHs are all 2 or 8, adjacent UE-specific search spaces have overlapping portions, and the distance between them is the CCE length occupied by a PDCCH having an aggregation level of 2 or 8.
Compared with The conventional Mapping Method, The Mapping calculation Method SMRSM (The Simple Method of RNTI-to-Search-Spaces Mapping) provided by The invention has The advantages that The time consumption is reduced by 79.5% on average, and The time consumption is not increased along with The increase of The number of The subframe.
Compared with the conventional reflection computing method, the reflection method RMMBIE (the Reverse mapping method Based on Inverse element) Based on congruence equation solution optimization greatly reduces the computing complexity, as shown in FIG. 4, compared with the conventional reflection computing method, the simulation that the computing time consumption changes along with the subframe number and the PDCCH search space total number is compared, and the conventional reflection computing method approximately linearly increases along with the increase of the subframe number and the PDCCH search space total number, and the computing time consumption is averagely 1.14 milliseconds; the calculation time of the optimal reflection method based on the congruence equation is not changed along with the subframe number and the total number of PDCCH search spaces, the average calculation time is 2.9 microseconds, and the advantages of the method are obvious.
Compared with The conventional RNTI distribution method, which is based on simulation comparison of distribution Conflict accumulation times with distribution completion rate, The RNTI distribution method CFRAA (The Conflict-Free RNTI allocation algorithm) provided by The invention has The advantages that The RNTI distribution method CFRAA is always zero as shown in FIG. 5, and The accumulation Conflict times of The other three conventional methods are increased quickly after The completion rate is about 50%, and finally The total Conflict times are more than dozens of times; this also verifies the conflict-free nature of the present invention.
Compared with the simulation of the traditional RNTI allocation method that the CCE utilization rate changes along with the calculation time consumption, as shown in FIG. 6, the CFRAA of the method can realize that the CCE peak utilization rate reaches nearly 100% within 0.17 millisecond; and the other three conventional methods cannot achieve the CCE utilization rate of 100% in the LTE subframe duration of 1 millisecond, which shows that the method has a remarkable effect of improving the CCE utilization rate.
Finally, it is noted that the above-mentioned preferred embodiments illustrate rather than limit the invention, and that, although the invention has been described in detail with reference to the above-mentioned preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined by the appended claims.
Claims (4)
1. A method for distributing conflict-free wireless network temporary identifications is characterized by comprising the following specific steps:
step one, aiming at a certain wireless communication system adopting a wireless network temporary identifier to carry out physical resource scheduling, carrying out protocol analysis according to the protocol standard of the communication system to obtain the use condition of a control channel element CCE in a k subframe in a certain physical downlink wireless frame and the total number N of the control channel element CCECCE,k；
Step two, selecting a proper aggregation level L aiming at a PDCCH of a certain UE needing to transmit data in a kth subframe; and brings in the total number N of CCEsCCE,kObtaining the total number N of the UE-specific search spacesPDCCH,k,L；
The aggregation level L has different values in different standard protocols; the worse the channel quality, the larger the value of L;
total number N of UE-specific search spacesPDCCH,k,LThe calculation formula of (a) is as follows:
step three, according to the use condition of the CCE, the value of the aggregation level L and the total number N of the UE-specific search spacesPDCCH,k,LAcquiring the condition of an unoccupied UE-specific search space;
step four, randomly selecting a UE special search space from the unoccupied UE special search spaces to be allocated to the UE needing data transmission, and recording the position index of the allocated search space as SPDCCH,k,L；
Wherein SPDCCH,k,L＝0,1,...,NPDCCH,k,L-1；
Step five, mixingLocation index S of the UE-specific search spacePDCCH,k,LSubstituting into a formula for calculation and optimization based on a congruence equation, and calculating the RNTI to be distributed to the UE;
the formula for calculating the RNTI based on the congruence equation calculation optimization is specifically as follows:
value Y of RNTI-1Expressed as: y is-1＝(Ek,L+m·Fk,L)mod D；
Wherein E isk,LSatisfies Ek,L＝Y'-1,k·SPDCCH,k,L，Fk,LSatisfies Fk,L＝(Y'-1,k·NPDCCH,k,L) mod D, D is a constant and is a prime number, m is a variable, and the value range of m is
Any value m can be taken during calculation; ek,LIs a variable that is indexed with respect to the location of the search space; fk,LIs a variable on the search space;
Y'-1,kit is obtained by solving congruence equation ①, and congruence equation ① is as follows:
Ak·Y'-1,k≡1(mod D)
wherein A iskSatisfies Ak＝Ak+1mod D, equivalent to Ak＝[(Amod D)·Ak-1]mod D, where A is a constant less than D and is a positive integer; a. thekIs the value of the constant a corresponding to the subframe number k; a. thek+1Is a and AkVariables relating to D
If the RNTI needs to be calculated at the minimum growth distance, the value of m is calculated by the following formula:
m＝{[(s-Ek,L)mod D]·Ik,L}mod D
wherein, Ik,LBy solving congruence equation ② Fk,L·Ik,L≡ 1(mod D), where s satisfies s ═ 0,1, and D-1, and s is incremented by one, i.e., the RNTI with the minimum growth distance is calculated; s is constant and prime;
in the above variables, AkAnd Y'-1,kAssociated with subframe number k only, Ik,LWith k and polymerization only, etcLevel L is related and the number of possible values of k and L is limited; thus, A is calculated in advancek，Y'-1,kAnd k are tabulated and the values of these three variables, Y ', are obtained by a table lookup'-1,kAnd Ik,LAll are variable values in the calculation formula.
2. The method for allocating radio network temporary identities without collision as claimed in claim 1, wherein the usage of the control channel elements CCE refers to: before the current time, the base station has already 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 time.
3. The method for allocating a non-conflicting radio network temporary identifier as claimed in claim 1, wherein said step three specifically comprises: aggregating CCEs into PDCCHs according to the value of the aggregation level L, and continuously M(L)The PDCCH forms a UE-specific search space, and the interval of the adjacent UE-specific search spaces is one PDCCH; the CCEs where at least one PDCCH is located in each UE-specific search space are all unoccupied, and the CCEs are called the unoccupied UE-specific search spaces.
4. The method as claimed in claim 1, wherein in step five, the solution method of two congruence equations is as follows:
step I, for AkAnd D, or Fk,LAnd D, respectively carrying out rolling division until the remainder is 0;
and step II, removing the quotient corresponding to the item with the remainder of 0, taking out the rest quotient in a reverse order, and expressing the rest quotient as: a isn,an-1,...,a0；
Step III, mixing an,an-1,...,a0Substitution into recursion equation bi＝an-i·bi-1+bi-2To calculate bn；
Wherein b is-1＝1，b0＝an；
Step IV, from bnAccording to the equation
Or
To obtain Y'-1,kOr Ik,LThe value of (c).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810894018.9A CN109005536B (en) | 2018-08-08 | 2018-08-08 | Conflict-free wireless network temporary identifier distribution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810894018.9A CN109005536B (en) | 2018-08-08 | 2018-08-08 | Conflict-free wireless network temporary identifier distribution method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109005536A CN109005536A (en) | 2018-12-14 |
| CN109005536B true CN109005536B (en) | 2020-02-14 |
Family
ID=64595257
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810894018.9A Active CN109005536B (en) | 2018-08-08 | 2018-08-08 | Conflict-free wireless network temporary identifier distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109005536B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222756A (en) * | 2007-01-12 | 2008-07-16 | 鼎桥通信技术有限公司 | Accidental access method and system |
| CN101600197A (en) * | 2008-06-04 | 2009-12-09 | 中兴通讯股份有限公司 | The control method of interim Cell Radio Network Temporary Identifier/Identity, Cell-RNTI and device |
| CN102395205A (en) * | 2011-11-01 | 2012-03-28 | 新邮通信设备有限公司 | Method and system for increasing quantity of physical layer control channel resource |
| CN104427494A (en) * | 2013-09-05 | 2015-03-18 | 普天信息技术研究院有限公司 | RNTI (radio network temporary identifier) distribution method |
| CN104837120A (en) * | 2015-04-02 | 2015-08-12 | 四川大学 | Trunked RNTI distribution method and dispatcher or core network |
| CN105493537A (en) * | 2014-12-29 | 2016-04-13 | 华为技术有限公司 | Distribution method and equipment of cell radio network temporary identity (C-RNTI) |
| CN106559875A (en) * | 2015-09-24 | 2017-04-05 | 大唐移动通信设备有限公司 | A kind of distribution method and device of RNTI |
| CN106658429A (en) * | 2015-10-28 | 2017-05-10 | 普天信息技术有限公司 | Method and system for allocating group calling RNTI of cluster group |
| CN107295641A (en) * | 2016-03-30 | 2017-10-24 | 中兴通讯股份有限公司 | RNTI distribution methods and device |
| WO2017214983A1 (en) * | 2016-06-17 | 2017-12-21 | 华为技术有限公司 | Identification management method, device, and system |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945403B (en) * | 2010-08-06 | 2016-01-20 | 中兴通讯股份有限公司 | A kind of method and apparatus determining the proprietary search volume of user |
| CN102387497B (en) * | 2010-09-06 | 2014-09-10 | 电信科学技术研究院 | Base station and allocation method of radio network temporary identities |
| CN102612153B (en) * | 2011-01-21 | 2015-01-07 | 上海贝尔股份有限公司 | Method and equipment for carrying out CCE (Control Channel Element) resource allocation in communication system |
| CN103874096B (en) * | 2012-12-18 | 2017-12-26 | 中兴通讯股份有限公司 | The transmission and detection method of a kind of Downlink Control Information, transmitting terminal and receiving terminal |
| CN111405665B (en) * | 2013-12-11 | 2023-12-12 | 北京三星通信技术研究有限公司 | Resource allocation method and device of physical downlink control channel |
-
2018
- 2018-08-08 CN CN201810894018.9A patent/CN109005536B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222756A (en) * | 2007-01-12 | 2008-07-16 | 鼎桥通信技术有限公司 | Accidental access method and system |
| CN101600197A (en) * | 2008-06-04 | 2009-12-09 | 中兴通讯股份有限公司 | The control method of interim Cell Radio Network Temporary Identifier/Identity, Cell-RNTI and device |
| CN102395205A (en) * | 2011-11-01 | 2012-03-28 | 新邮通信设备有限公司 | Method and system for increasing quantity of physical layer control channel resource |
| CN104427494A (en) * | 2013-09-05 | 2015-03-18 | 普天信息技术研究院有限公司 | RNTI (radio network temporary identifier) distribution method |
| CN105493537A (en) * | 2014-12-29 | 2016-04-13 | 华为技术有限公司 | Distribution method and equipment of cell radio network temporary identity (C-RNTI) |
| CN104837120A (en) * | 2015-04-02 | 2015-08-12 | 四川大学 | Trunked RNTI distribution method and dispatcher or core network |
| CN106559875A (en) * | 2015-09-24 | 2017-04-05 | 大唐移动通信设备有限公司 | A kind of distribution method and device of RNTI |
| CN106658429A (en) * | 2015-10-28 | 2017-05-10 | 普天信息技术有限公司 | Method and system for allocating group calling RNTI of cluster group |
| CN107295641A (en) * | 2016-03-30 | 2017-10-24 | 中兴通讯股份有限公司 | RNTI distribution methods and device |
| WO2017214983A1 (en) * | 2016-06-17 | 2017-12-21 | 华为技术有限公司 | Identification management method, device, and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109005536A (en) | 2018-12-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7489434B2 (en) | Apparatus and method for managing a blind search - Patents.com | |
| CN102065543B (en) | Control channel unit allocation method and device | |
| CN108633052B (en) | Resource allocation method, device and equipment | |
| CN113966587B (en) | Method, device and system for downlink data reception and HARQ-ACK transmission in wireless communication system | |
| CN104717748A (en) | Physical downlink control channel (PDCCH) resource allocation method and device | |
| EP3589048B1 (en) | Data sending method and apparatus, and data receiving method and apparatus | |
| US9307524B2 (en) | Method for communicating in mobile system | |
| CN108401292B (en) | Control information transmission method, control information receiving device, base station and terminal | |
| CN106454695B (en) | Information transmission method and device in machine type communication system | |
| CN104734809A (en) | Resource mapping method and blind detection method based on same | |
| JP6744332B2 (en) | Data transmission method and device | |
| US9756645B2 (en) | ENB, UE and method for physical resource block allocation in MTC UE | |
| CN113692057B (en) | Network slice resource allocation method and system | |
| CN113645705B (en) | Frequency domain resource allocation method and device | |
| US9961677B2 (en) | Method for transmitting downlink control information, method for determining a search space and apparatuses thereof | |
| CN109005536B (en) | Conflict-free wireless network temporary identifier distribution method | |
| US20210349754A1 (en) | Device and Method of Performing Content Channel Generation | |
| CN105874836B (en) | Method, device and system for controlling information processing | |
| CN105979529A (en) | Channel access method for improving capacity and protecting Wi-Fi (Wireless Fidelity) fairness in LTE-U (Long Term Evolution-Unlicensed) dense network | |
| CN109803380A (en) | Resource allocation methods and communication base station | |
| CN110391889B (en) | Method and device for determining time slot format | |
| CN106559875B (en) | RNTI (radio network temporary identifier) allocation method and device | |
| CN110830401A (en) | Method and device for determining modulation coding order table type | |
| CN103179673A (en) | Resource scheduling method and device | |
| RU2786411C2 (en) | Communication method and communication device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |