CN101534542A - Method, device and system for adjusting random access leader sequence - Google Patents

Abstract

The invention discloses a method, a device and a system for adjusting random access leader sequence. The method includes: calculating a special access leader sequence average using times for non-completion random access in the random access leader sequence; obtaining amount forecast value in the special access leader sequence according with the average using time of the special access leader sequence; adjusting the special access leader sequence amount in present according with the special access leader sequence amount. An embodiment of the invention also provides an adjusting device and a system. The embodiment can adjust the random access leader sequence according with accessing condition of the user equipment which can increase successful rate for the user equipment accessing, and increase system capacitance simultaneously.

Description

Method, device and system for adjusting random access leader sequence

Technical Field

The present invention relates to the field of communications, and in particular, to a method, an apparatus, and a system for adjusting a random access preamble sequence.

Background

The RA (Random Access) technology is an important technology in a Long Term Evolution (LTE) system, and is mainly used to provide uplink timing synchronization information for User Equipment (UE) and allocate resources to the UE on a network side. Random access in the LTE system is classified into contention random access and non-contention random access.

For the competitive random access, the UE selects a random access leader sequence from a random access leader sequence group of the cell, initiates the random access, when the network side detects the random access leader sequence of the UE, sends a random access response message, the random access response message simultaneously contains uplink scheduling information, and then the UE sends a message to be transmitted according to the uplink scheduling information.

For non-contention random access, the difference from contention random access is that the network side first sends a dedicated access preamble sequence to the UE, and then the UE initiates an access procedure using the dedicated random access preamble.

The existing set of RA preamble sequences for each cell is determined by the base station (eNodeB) and then the UE is informed by system message broadcast.

In the process of implementing the invention, the inventor finds that:

the existing random access preamble sequence allocation technology generally adopts a method of allocating a fixed number of random access preamble sequences. Because the time for the UE to initiate access in the actual network is random and is in continuous change, the access success rate of the UE in the system is affected by the existing fixed allocation method, thereby reducing the system capacity.

Disclosure of Invention

In order to improve the UE access success rate and increase the system capacity, embodiments of the present invention provide a method, an apparatus, and a system for adjusting a random access preamble sequence.

The technical scheme is as follows:

a method for adjusting a random access preamble sequence comprises the following steps:

calculating the average use times of a special access leader sequence for non-competitive random access in the random access leader sequence;

obtaining a predicted value of the number of the special access leader sequences according to the average using times of the special access leader sequences;

and adjusting the number of the special access leader sequences configured currently according to the predicted value of the number of the special access leader sequences.

An apparatus for adjusting a random access preamble sequence, comprising:

the calculating module is used for calculating the average using times of the special access leader sequence for non-competitive random access in the random access leader sequence;

an obtaining module, configured to obtain a predicted value of the number of dedicated access preamble sequences according to the average usage times of the dedicated access preamble sequences;

and the adjusting module is used for adjusting the number of the special access leader sequences configured currently according to the special access leader sequence number predicted value.

A system for adjusting a random access preamble sequence comprises the device.

The technical scheme provided by the embodiment of the invention has the beneficial effects that:

the method comprises the steps of calculating the average using times of the special access leader sequence for non-competitive random access, obtaining the predicted value of the number of the special access leader sequence for the non-competitive random access, adjusting the random access leader sequence according to the predicted value, realizing the dynamic adjustment of the random access leader sequence, improving the success rate of UE access and increasing the system capacity.

Drawings

Fig. 1 is a flowchart of a method for adjusting a random access preamble sequence according to an embodiment of the present invention;

fig. 2 is a packet diagram of a random access preamble sequence according to an embodiment of the present invention;

fig. 3 is a flowchart of a method for adjusting a random access preamble sequence according to a second embodiment of the present invention;

fig. 4 is a schematic structural diagram of an apparatus for adjusting a random access preamble sequence according to a third embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Example one

Referring to fig. 1, a flowchart of a method for configuring a random access preamble sequence provided in this embodiment is shown, where the method includes:

101: calculating the average use times of a special access leader sequence for non-competitive random access in the random access leader sequence;

102: obtaining a predicted value of the number of the special access leader sequences according to the average using times of the special access leader sequences;

103: and adjusting the number of the special access leader sequences configured currently according to the predicted value of the number of the special access leader sequences.

In this embodiment, the number of dedicated access preamble sequences used for non-contention random access is obtained by calculating the average number of times of use of the dedicated access preamble sequences used for non-contention random access, and the random access preamble sequences are adjusted according to the number of dedicated access preamble sequences, so as to achieve dynamic adjustment of the random access preamble sequences, improve the UE access success rate, and increase the system capacity.

The embodiment of the invention takes an LTE system as background. In the LTE system, each cell has 64 Random Access (RA) preamble sequences, and fig. 2 shows a grouping diagram of the RA preamble sequences. These 64 RA preamble sequences fall into two broad categories: a dedicated access preamble sequence for non-contention random access, and a non-dedicated access preamble sequence for contention random access. The non-dedicated access preamble sequences for contention access are divided into A, B groups, wherein when the size of the message 3(message 3) that the UE needs to transmit is small, the sequence in group a is selected, and when the size of the message 3 that the UE needs to transmit is large, the sequence in group B is selected.

The following describes a configuration method of random access preamble sequences specifically by way of the second embodiment, and the method can dynamically adjust the grouping of the random access preamble sequences, so that the network can dynamically adjust the number of each group of preamble sequences in the random access preamble sequences according to the change condition of the load in the current cell.

Example two

Referring to fig. 3, a flowchart of a method for configuring a random access preamble sequence according to this embodiment is provided. In this embodiment, the RA preamble sequence group of each cell is determined by the eNodeB, and includes a dedicated access preamble sequence, and after the numbers of the non-dedicated access preamble sequence group a and the non-dedicated access preamble sequence group B are determined by the eNodeB, the UE is notified by system message broadcast. When the access load changes, the grouping of the RA preamble sequence is dynamically adjusted according to the load change. Among the factors that may cause access load variation may be: the type of the accessed UE, the number of times of accessing the UE and the like. The method comprises the following steps:

201: and calculating the average using times of the special access preamble sequence for non-competitive random access.

Wherein, the average number of times of using the dedicated access preamble sequence for non-contention random access can be calculated as follows:

after each Random Access Channel (RACH) slot is finished, the number of dedicated Access preamble sequences currently used can be counted and recorded as. Calculating the average usage times of the dedicated access preamble sequence within a preset time period T (the preset time T can be configured by the network side): the quotient of the sum of the numbers of currently used dedicated access preamble sequences in all RACH slots within a preset time T and the total number of RACH slots within the preset time T may be represented as:

<math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>De</mi> <mo>)</mo> </mrow> </msup> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>&Element;</mo> <mi>v</mi> </mrow> </munder> <msubsup> <mi>X</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>De</mi> <mo>)</mo> </mrow> </msubsup> </mrow> <msub> <mi>N</mi> <mi>s</mi> </msub> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow></math>

wherein, X^(De)Representing the average number of times of use of the dedicated access preamble sequence within a preset time T; v denotes all RACH slots; n is a radical of_sRepresenting the total number of RACH time slots in a preset time T;

represents the sum of the number of dedicated access preamble sequences currently used in all RACH slots.

The condition of the access load can be known by calculating the average use times of the access preamble sequence, and if the average use times is larger, the access load is indicated to be larger (the number of the accessed UEs is larger) or the access times of the same load is indicated to be larger (the access times of a single UE is larger).

202: and acquiring the number of the new special access leader sequences according to the calculated average use times of the special access leader sequences.

Wherein, the number of the new special access leader sequences, namely the number of the special access leader sequences is the predicted value (the same below); according to the average using times X of the special access leader sequence obtained by calculation^(De)Acquiring the number C of new special access leader sequences_DThe method can comprise the following steps:

when X is present^(De)Margin parameter P with dedicated access preamble sequence₁The sum is less than the maximum parameter P of the special access leader sequence_maxAnd X^(De)And P₁The sum is greater than the minimum parameter P of the special access preamble sequence_minNamely:

P_min<X^(De)+P₁<P_max (2)

when the condition is satisfied, the number of new special access leader sequences C_DAverage number of usage of dedicated access preamble sequence X^(De)Margin parameter P with dedicated access preamble sequence₁And (c) the sum, i.e.:

C_D＝X^(De)+P₁ (3)

when X is present^(De)Margin parameter P with dedicated access preamble sequence₁The sum of the parameters is more than or equal to the maximum parameter P of the special access leader sequence_maxNamely:

X^(De)+P₁>＝P_max(4)

when the condition is satisfied, the number C of the new special access leader sequence for non-competitive random access_DMaximum parameter P for dedicated access preamble sequence_maxNamely:

C_D＝P_max (5)

when X is present^(De)Margin parameter P with dedicated access preamble sequence₁The sum of the minimum parameters P is less than or equal to the minimum parameter P of the special access preamble sequence_minNamely:

X^(De)+P₁<＝P_min (6)

when the condition is satisfied, the number C of the new special access leader sequence for non-competitive random access_DMinimum parameter P for dedicated access preamble sequence_minNamely:

C_D＝P_min (7)

wherein, the margin parameter P of the special access preamble sequence₁The parameters are configured for the network, and can be adjusted according to the actual situation.

It can be understood that the calculated average usage number of the dedicated access preamble sequences can also be directly used as the number of new dedicated access preamble sequences.

203: number C of new special access leader sequence to be obtained_DAnd comparing the number with the number of the special access leader sequences currently configured, judging whether the number of the special access leader sequences currently configured in the random access leader sequences needs to be adjusted, if so, executing 205, otherwise, executing 204.

The conditions for adjusting the number of the special access leader sequences configured currently in the random access leader sequences are as follows:

number of special access leader sequence C for non-competitive random access_DNumber of dedicated access preamble sequences corresponding to the current configuration

The difference is beyond the range of the preamble error parameter TOL, i.e.:

$C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}>=+\mathrm{TOL}$ or $C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}<=-\mathrm{TOL}---\left(8\right)$

That is, when the condition of the formula (8) is satisfied, the number of the dedicated access preamble sequences currently configured in the random access preamble sequences is determined and determined to be required to be adjusted. Wherein, the number of the special access preamble sequences configured currently

Is configured by the eNodeB; the TOL is a network configuration parameter, and the value range can be 0-4.

204: the number of the currently configured dedicated access preamble sequences is not adjusted.

Wherein, when the formula (8) in 203 is not satisfied, it is C_DAnd

if the difference is in the TOL range, the number of the special access leader sequences for non-competitive random access configured currently is not adjusted, and a new C is added_DNumber of dedicated access preamble sequences for non-contention random access set to current configuration

205: the number of special access leader sequences configured currently

Adjusting to a new number of dedicated access preamble sequences C_D。

Wherein, when the formula (8) in 203 is satisfied, the number of the dedicated access preamble sequences for the non-contention random access is adjusted, and specifically, according to the decision result in 202, the number of the currently configured dedicated access preamble sequences is adjusted

Adjusting to a new number of dedicated access preamble sequences C_D。

It should be noted that, in step 203, the TOL is introduced, and the number C of the new dedicated access preamble sequences is determined_DWhether the difference between the number of the special access preamble sequences and the number of the special access preamble sequences configured currently is large enough or not can be kept unchanged if the difference is within a certain range. This has the advantage of avoiding frequent changes in the data configuration and improving the stability of the system.

Another implementation is as follows: instead of making the determination of step 203, step 206 may be performed directly, i.e.: directly adjusting the number of the special access preamble sequences currently configured to (or replacing with) the new number C of the special access preamble sequences_D. The advantage of this is that the step of judging can be saved, and the complexity of system implementation is reduced.

206: and the total number of the random access leader sequences is differed from the number of the new special access leader sequences to obtain the number of the non-special access leader sequences for competing the random access.

Wherein, the total number of the random access preamble sequences in the embodiment of the present invention is 64.

And obtaining the number of the new non-special access leader sequences through the content.

Further optionally, the number of the group a non-dedicated access preamble sequences and the number of the group B non-dedicated access preamble sequences in the non-dedicated access preamble sequences may also be adjusted, specifically as follows:

207: and calculating the average use times of the non-special access preamble sequences for the competitive random access.

Since the non-dedicated access preamble sequences are divided into the group a and the group B, the average number of times of use of the non-dedicated access preamble sequences can be calculated for the group a and the group B, respectively.

(a) The specific calculation of the average use times of the group A non-dedicated access leader sequence is as follows:

after each RACH time slot is finished, counting the number of the currently used A group random access preamble sequences, and recording the number asCalculating the average using times of the group A random access leader sequences in a preset time T: the quotient of the sum of the currently used group a random access preamble sequences in all RACH slots and the total RACH slot number in the preset time T may be represented as:

<math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>A</mi> <mo>)</mo> </mrow> </msup> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>&Element;</mo> <mi>v</mi> </mrow> </munder> <msubsup> <mi>X</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>A</mi> <mo>)</mo> </mrow> </msubsup> </mrow> <msub> <mi>N</mi> <mi>s</mi> </msub> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow></math>

wherein, X^(A)Representing the average use times of the A group non-dedicated access leader sequence in a preset time T; v denotes all RACH slots; n is a radical of_sRepresenting the total number of RACH time slots in a preset time T;

represents the sum of the number of currently used group a non-dedicated access preamble sequences in all RACH slots.

(b) Calculating the average use times of the B group non-special access leader sequences as follows:

<math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>B</mi> <mo>)</mo> </mrow> </msup> <mo>=</mo> <mfrac> <mrow> <munder> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>&Element;</mo> <mi>v</mi> </mrow> </munder> <msubsup> <mi>X</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>B</mi> <mo>)</mo> </mrow> </msubsup> </mrow> <msub> <mi>N</mi> <mi>s</mi> </msub> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow></math>

wherein, X^(B)Representing the average use times of the B group non-dedicated access leader sequence in a preset time T; v denotes all RACH slots; n is a radical of_sRepresenting the total number of RACH time slots in a preset time T;

represents the sum of the number of currently used B-group non-dedicated access preamble sequences in all RACH slots.

208: acquiring the number of new A group non-special access leader sequences according to the number of the non-special access leader sequences, the average use times of the A group non-special access leader sequences and the average use times of the B group non-special access leader sequences;

wherein, the number of the new A group non-special access leader sequences for the competitive random access, namely the predicted value C of the number of the A group non-special access leader sequences_A(the same applies below), can be obtained by the following formula:

C_A＝round((64-C_D)·X^(A)/(X^(A)+X^(B))) (11)

where round denotes rounding the number in brackets, C_DIndicates the number of new dedicated access preamble sequences, X^(A)Represents the average usage number of the A group non-special access preamble sequences within a preset time T, X^(B)Indicating the average usage number of the B-group non-dedicated access preamble sequences within a preset time T.

Number of new B group non-special access leader sequences for competitive random access, namely number predicted value C of B group non-special access leader sequences_B(the same applies below), can be obtained by the following formula: c_B＝64-C_D-C_A。

209: and judging whether the number of the currently configured A group non-special access leader sequences in the random access leader sequence needs to be adjusted, if so, executing 210, and otherwise, executing 211.

Wherein the expression is

$C_D+X_{\mathrm{Curr}}^{\left(A\right)}<64$ And is <math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>A</mi> <mo>)</mo> </mrow> </msup> <mo>&le;</mo> <msubsup> <mi>X</mi> <mi>Curr</mi> <mrow> <mo>(</mo> <mi>A</mi> <mo>)</mo> </mrow> </msubsup> </mrow></math> And is <math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>B</mi> <mo>)</mo> </mrow> </msup> <mo>&le;</mo> <mn>64</mn> <mo>-</mo> <msub> <mi>C</mi> <mi>D</mi> </msub> <mo>-</mo> <msubsup> <mi>X</mi> <mi>Curr</mi> <mrow> <mo>(</mo> <mi>A</mi> <mo>)</mo> </mrow> </msubsup> </mrow></math> (12)

The condition for adjusting the number of currently configured group A non-dedicated access preamble sequences is not satisfied at the same time, that is: and if the expressions are simultaneously satisfied, not adjusting the number of the currently configured A group non-dedicated access leader sequences.

Wherein, C_DIndicates the number of new dedicated access preamble sequences,

to representNumber of currently configured A-group non-dedicated access leader sequences, X, for contention random access^(A)Represents the average usage number of the A group non-special access preamble sequences within a preset time T, X^(B)Representing the average use times of the B group non-dedicated access leader sequence in a preset time T;

210: and adjusting the number of the currently configured A group non-dedicated access preamble sequences to the number of the new A group non-dedicated access preamble sequences.

If equation (12) in 209 cannot be satisfied simultaneously, the number of currently allocated group a non-dedicated access preamble sequences is adjusted in accordance with equation (11) in 208

Adjusting to new A group non-special access preamble sequence number C_A。

Then, the new number C of the B group non-dedicated access preamble sequences for the contention random access_BIt can be obtained by the following formula: c_B＝64-C_D-C_A。

211: the number of currently configured A group non-dedicated access leader sequences is not adjusted.

It should be noted that step 210 may be directly executed without the determination of step 209, that is: and directly adjusting the number of the currently configured A group non-dedicated access preamble sequences to the number of the new A group non-dedicated access preamble sequences.

In the above description, the group B non-dedicated access preamble sequences are calculated first, and then the group a non-dedicated access preamble sequences are calculated according to the determined group B non-dedicated access preamble sequences. The following implementations may also be employed: the number of the new group B non-dedicated access leader sequences can also be obtained by calculation (the group B non-dedicated access leader sequences are calculated firstly, and then the group A non-dedicated access leader sequences are calculated according to the determined group B non-dedicated access leader sequences). The principle is similar to the principle of acquiring the number of the new group A non-dedicated access leader sequences, namely, the number can be acquired by the following formula:

C_B＝round((64-C_D)·X^(B)/(X^(A)+X^(B))) (13)

wherein, C_BIndicates the number of new B-group non-dedicated access preamble sequences, round indicates rounding the number in brackets, C_DIndicates the number of new dedicated access preamble sequences, X^(A)Represents the average usage number of the A group non-special access preamble sequences within a preset time T, X^(B)Indicating the average usage number of the B-group non-dedicated access preamble sequences within a preset time T.

Then, the new number C of the A group non-dedicated access preamble sequences for the contention random access_AIt can be obtained by the following formula: c_A＝64-C_D-C_B。

The expression is expressed as follows:

$C_D+X_{\mathrm{Curr}}^{\left(B\right)}<64$ and is <math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>B</mi> <mo>)</mo> </mrow> </msup> <mo>&le;</mo> <msubsup> <mi>X</mi> <mi>Curr</mi> <mrow> <mo>(</mo> <mi>B</mi> <mo>)</mo> </mrow> </msubsup> </mrow></math> And is <math> <mrow> <msup> <mi>X</mi> <mrow> <mo>(</mo> <mi>A</mi> <mo>)</mo> </mrow> </msup> <mo>&le;</mo> <mn>64</mn> <mo>-</mo> <msub> <mi>C</mi> <mi>D</mi> </msub> <mo>-</mo> <msubsup> <mi>X</mi> <mi>Curr</mi> <mrow> <mo>(</mo> <mi>B</mi> <mo>)</mo> </mrow> </msubsup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>14</mn> <mo>)</mo> </mrow> </mrow></math>

The condition for adjusting the number of currently configured B-group non-dedicated access preamble sequences is not satisfied at the same time, that is: and if the expression (14) is simultaneously satisfied, not adjusting the number of the currently configured B group non-dedicated access preamble sequences.

When the formula (14) can not be simultaneously established, the number of the currently configured B group non-special access preamble sequences is determined according to the formula (13)

Adjusting to a new number C of B-group non-dedicated access preamble sequences_B。

The new number of the A group non-dedicated access leader sequences C for the contention random access_AIt can be obtained by the following formula: c_A＝64-C_D-C_B。

It is also understood that the currently configured number of B-group non-dedicated access preamble sequences may be directly used without the determination of formula (14)

Adjusting to a new number C of B-group non-dedicated access preamble sequences_B。

In the present embodiment, if C is above_DOr C_AThe number of the leader sequences is different from the number of the leader sequences of the current system message broadcast, so that the number of the new non-special access leader sequences of the system message broadcast is 64-C_DWherein, the number of the new A group non-special access leader sequence is C_ANew number of non-dedicated access preamble sequences C of group B_BIs 64-C_D-C_A。

The technical solution provided in this embodiment is to calculate the average number of times of using the dedicated access preamble sequence X for the non-contention random access^(De)And through X^(De)Acquiring new dedicated access for non-contention random accessNumber of leader sequences C_DThen according to the new special access leader sequence number C_DAnd adjusting the number of the special access leader sequences which are configured currently. By the method, when the UE accessed to the network changes, the random access leader sequence is adjusted according to the access condition of the UE, so that the access success rate of the UE can be improved, and the system capacity is increased. For example, if the number of UEs requiring non-contention random access is increased, the number of dedicated access preamble sequences is correspondingly increased, so that the access success rate of the corresponding UE can be increased, and the number of UEs completing random access is increased, that is, the capacity of the system is increased.

Further, the present embodiment calculates the average number of times of using the non-dedicated access preamble sequence for the contention random access by X^(A)And X^(B)And through X^(A)And X^(B)Acquiring new non-special access leader sequence number C for competitive random access_AOr C_BAnd then according to the number C of the new non-special access leader sequence_AOr C_BAnd correspondingly adjusting the number of the currently configured A group or B group non-dedicated access preamble sequences. By the method, when the UE accessed to the network changes, the random access leader sequence is adjusted according to the access condition of the UE, so that the access success rate of the UE can be improved, and the system capacity is increased.

In the embodiment of the invention, the preset time T and the margin parameter P of the special access leader sequence₁Maximum parameter P of dedicated access preamble sequence_maxMinimum parameter P of dedicated access preamble sequence_minAll the parameters are network configuration parameters and can be adjusted according to actual conditions.

It should be particularly noted that, the embodiment of the present invention is only described with an LTE system as an example, and therefore, an eNodeB is taken as an example of a network side device, but the method provided in the embodiment of the present invention is not limited to the LTE system, and is also applicable to other communication systems.

EXAMPLE III

Referring to fig. 4, a schematic structural diagram of an adjusting apparatus for a random access preamble sequence provided in this embodiment is shown. The apparatus, which may be an eNodeB, includes:

a calculating module 301, configured to calculate an average usage number of dedicated access preamble sequences for non-contention random access in the random access preamble sequences;

an obtaining module 302, configured to obtain a predicted value of the number of dedicated access preamble sequences according to the average number of times of use of the dedicated access preamble sequences;

an adjusting module 303, configured to adjust the number of the currently configured dedicated access preamble sequences according to the predicted value of the number of the dedicated access preamble sequences.

Further, the apparatus further comprises:

the processing module is used for making a difference between the total number of the random access leader sequences and the predicted value of the number of the special access leader sequences to obtain the number of the non-special access leader sequences for competing random access; and adjusting the number of the currently configured non-special access leader sequences according to the obtained number of the non-special access leader sequences.

Further, the processing module may include:

the first calculating unit is used for calculating the average using times of the A group non-special access leader sequence for competitive random access;

the second calculating unit is used for calculating the average using times of the B group non-special access leader sequences for competitive random access;

a first obtaining unit, for obtaining the predicted value of the number of the group A non-special access leader sequences or the predicted value of the number of the group B non-special access leader sequences according to the obtained number of the non-special access leader sequences, the average using times of the group A non-special access leader sequences and the average using times of the group B non-special access leader sequences;

and the first adjusting unit correspondingly adjusts the number of the currently configured A group non-special access leader sequences or the number of the currently configured B group non-special access leader sequences according to the A group non-special access leader sequence number predicted value or the B group non-special access leader sequence number predicted value.

Further, the obtaining module 302 may include:

the first setting unit is used for setting the average use times of the special access leader sequence obtained by calculation as a predicted value of the number of the special access leader sequence; or,

a second acquisition unit for P_min<X^(De)+P₁<P_maxWhen the establishment is successful, obtaining the predicted value C of the number of the special access leader sequences_DPredicting value C_D＝X^(De)+P₁(ii) a Or,

when X is present^(De)+P₁>＝P_maxWhen the establishment is successful, obtaining the predicted value C of the number of the special access leader sequences_DPredicting value C_D＝P_max(ii) a Or,

when X is present^(De)+P₁<＝P_minWhen the establishment is successful, obtaining the predicted value C of the number of the special access leader sequences_DPredicting value C_D＝P_min；

Wherein, P_minMinimum parameter, X, representing dedicated access preamble sequence^(De)Indicating the average number of usage of dedicated access preamble sequences, P₁A margin parameter, P, representing a dedicated access preamble sequence_maxRepresents the maximum parameter of the dedicated access preamble sequence.

Further, the adjusting module 303 includes:

a second adjusting unit, configured to adjust the number of the currently configured dedicated access preamble sequences to a predicted value of the number of the dedicated access preamble sequences; or,

a third adjusting unit for predicting value C when the number of dedicated access preamble sequences_DSatisfies the following conditions:

$C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}>=+\mathrm{TOL}$ or $C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}<=-\mathrm{TOL}$ Then, the number of the special access leader sequence configured currently is adjusted to the predicted value C of the number of the special access leader sequence used for the non-competitive random access_D(ii) a Wherein,

the number of the special access preamble sequences configured currently is shown, and TOL shows the error parameter of the preamble sequence.

The embodiment calculates the average usage times X of the special access preamble sequence for non-competitive random access^(De)And through X^(De)Acquiring new special access leader sequence number C for non-competitive random access_DThen according to the new special access leader sequence number C_DAdjusting the number of special access leader sequences configured currently;

further, the average using times X of the non-special access preamble sequence used for the competitive random access are calculated^(A)And X^(B)And through X^(A)And X^(B)Acquiring new non-special access leader sequence number C for competitive random access_AOr C_BAnd then according to the number C of the new non-special access leader sequence_AOr C_BAnd correspondingly adjusting the number of the currently configured A group or B group non-dedicated access preamble sequences. By the method, when the UE accessed to the network changes, the random access leader sequence is accessed according to the access condition of the UEThe UE access success rate can be improved by adjusting, and meanwhile, the system capacity is increased.

The embodiment of the invention also provides a system for adjusting the random access leader sequence, which can comprise the device for adjusting the random access leader sequence.

It should be particularly noted that, the embodiments of the present invention are described by taking an LTE system as an example, and therefore, an eNodeB is taken as an example of a network side device, but the method provided by the embodiments of the present invention is not limited to the LTE system, and is also applicable to other communication systems.

Those skilled in the art will appreciate that the figures are schematic representations of one embodiment and that the blocks or flow diagrams in the figures are not necessarily required to practice the present invention.

Those skilled in the art will appreciate that the modules in the devices in the embodiments may be distributed in the devices in the embodiments according to the description of the embodiments, and may be correspondingly changed in one or more devices different from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.

The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

The embodiment of the present invention may be implemented by software, and the corresponding software may be stored in a readable storage medium, such as a hard disk, an optical disk, or a floppy disk of a computer.

The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (12)

1. A method for adjusting a random access preamble sequence, the method comprising:

calculating the average use times of a special access leader sequence for non-competitive random access in the random access leader sequence;

obtaining a predicted value of the number of the special access leader sequences according to the average using times of the special access leader sequences;

and adjusting the number of the special access leader sequences configured currently according to the predicted value of the number of the special access leader sequences.

2. The method of claim 1, further comprising:

the total number of the random access leader sequences and the predicted value of the number of the special access leader sequences are differed to obtain the number of the non-special access leader sequences for competing random access;

and adjusting the number of the currently configured non-special access leader sequences according to the obtained number of the non-special access leader sequences.

3. The method of claim 2, wherein the non-dedicated access preamble sequences for contention random access comprise a group A non-dedicated access preamble sequences and a group B non-dedicated access preamble sequences;

the adjusting the number of the currently configured non-dedicated access preamble sequences according to the obtained number of the non-dedicated access preamble sequences comprises:

acquiring a predicted value of the number of the group A non-special access leader sequences or a predicted value of the number of the group B non-special access leader sequences according to the obtained number of the non-special access leader sequences and the proportional relation between the average using times of the group A non-special access leader sequences and the average using times of the group B non-special access leader sequences for competing random access;

and correspondingly adjusting the number of the currently configured A group non-special access leader sequences or the number of the currently configured B group non-special access leader sequences according to the predicted value of the number of the A group non-special access leader sequences or the predicted value of the number of the B group non-special access leader sequences.

4. The method according to claim 1, wherein obtaining the predicted value of the number of dedicated access preamble sequences according to the average number of times of use of the dedicated access preamble sequences specifically comprises:

taking the calculated average using times of the special access leader sequence as a predicted value of the number of the special access leader sequence; or,

when P is present_min<X^(De)+P₁<P_maxWhen the special access leader sequence number is established, obtaining the special access leader sequence number predicted value C_DComprises the following steps: c_D＝X^(De)+P₁；

When X is present^(De)+P₁>＝P_maxWhen the special access leader sequence number is established, obtaining the special access leader sequence number predicted value C_DComprises the following steps: c_D＝P_max；

When X is present^(De)+P₁<＝P_minWhen the special access leader sequence number is established, obtaining the special access leader sequence number predicted value C_DComprises the following steps: c_D＝P_min；

Wherein, P_minMinimum parameter, X, representing dedicated access preamble sequence^(De)Represents the average number of usage of the dedicated access preamble sequence, P₁A margin parameter, P, representing a dedicated access preamble sequence_maxRepresents the maximum parameter of the dedicated access preamble sequence.

5. The method according to claim 4, wherein the adjusting the number of currently configured dedicated access preamble sequences according to the predicted value of the number of dedicated access preamble sequences specifically comprises:

adjusting the number of the special access leader sequences configured currently to be a predicted value of the number of the special access leader sequences; or,

when the number of the special access leader sequence is predicted value C_DSatisfies the following conditions:

$C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}>=+\mathrm{TOL}$ or $C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}<=-\mathrm{TOL}$ Then, the number of the special access leader sequence configured currently is adjusted to the predicted value C of the number of the special access leader sequence_D(ii) a Wherein,

the number of the special access preamble sequences configured currently is shown, and TOL shows the error parameter of the preamble sequence.

6. The method according to any of claims 1 to 5, wherein the random access preamble sequence is a random access preamble sequence in a Long term evolution system.

7. An apparatus for adjusting a random access preamble sequence, the apparatus comprising:

the calculating module is used for calculating the average using times of the special access leader sequence for non-competitive random access in the random access leader sequence;

an obtaining module, configured to obtain a predicted value of the number of dedicated access preamble sequences according to the average usage times of the dedicated access preamble sequences;

and the adjusting module is used for adjusting the number of the special access leader sequences configured currently according to the special access leader sequence number predicted value.

8. The apparatus of claim 7, further comprising:

the processing module is used for making a difference between the total number of the random access leader sequences and the predicted value of the number of the special access leader sequences to obtain the number of the non-special access leader sequences for competitive random access; and adjusting the number of the currently configured non-special access leader sequences according to the obtained number of the non-special access leader sequences.

9. The apparatus of claim 8, wherein the processing module comprises:

the first calculating unit is used for calculating the average using times of the A group non-special access leader sequence for competitive random access;

the second calculating unit is used for calculating the average using times of the B group non-special access leader sequences for competitive random access;

a first obtaining unit, configured to obtain a predicted value of the number of the group a non-dedicated access preamble sequences or a predicted value of the number of the group B non-dedicated access preamble sequences according to the obtained number of the non-dedicated access preamble sequences, the average number of times of use of the group a non-dedicated access preamble sequences, and the average number of times of use of the group B non-dedicated access preamble sequences;

and the first adjusting unit correspondingly adjusts the number of the currently configured A group non-special access leader sequences or the number of the currently configured B group non-special access leader sequences according to the A group non-special access leader sequence number predicted value or the B group non-special access leader sequence number predicted value.

10. The apparatus of claim 7, wherein the obtaining module comprises:

the first setting unit is used for setting the average use times of the special access leader sequence obtained by calculation as a predicted value of the number of the special access leader sequence; or,

a second acquisition unit for P_min<X^(De)+P₁<P_maxWhen the special access leader sequence number is established, obtaining the predicted value C of the special access leader sequence number_DThe predicted value C_D＝X^(De)+P₁(ii) a Or,

when X is present^(De)+P₁>＝P_maxWhen the special access leader sequence number is established, obtaining the predicted value C of the special access leader sequence number_DThe predicted value C_D＝P_max(ii) a Or,

when X is present^(De)+P₁<＝P_minAcquiring the special access preamble sequence when the special access preamble sequence is establishedColumn number prediction value C_DThe predicted value C_D＝P_min；

Wherein, P_minMinimum parameter, X, representing dedicated access preamble sequence^(De)Represents the average number of usage of the dedicated access preamble sequence, P₁A margin parameter, P, representing a dedicated access preamble sequence_maxRepresents the maximum parameter of the dedicated access preamble sequence.

11. The apparatus of claim 10, wherein the adjustment module comprises:

a second adjusting unit, configured to adjust the number of the currently configured dedicated access preamble sequences to the predicted value of the number of the dedicated access preamble sequences; or,

a third adjusting unit, configured to determine a predicted value C of the number of dedicated access preamble sequences when the predicted value C is smaller than the predetermined threshold_DSatisfies the following conditions:

$C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}>=+\mathrm{TOL}$ or $C_D-X_{\mathrm{curr}}^{\left(\mathrm{De}\right)}<=-\mathrm{TOL}$ Then, the number of the special access leader sequence configured currently is adjusted to the special access leader sequence number predicted value C for the non-competitive random access_D(ii) a Wherein,the number of the special access preamble sequences configured currently is shown, and TOL shows the error parameter of the preamble sequence.

12. A system for adjusting a random access preamble sequence, comprising the apparatus for adjusting a random access preamble sequence according to any one of claims 7 to 11.

Images