CN102271416B - Method and device for generating random access limit set leader sequences in LTE (Long Term Evolution) system - Google Patents

Abstract

The invention discloses a method for generating random access limit set leader sequences in an LTE (Long Term Evolution) system. The method comprises the following steps: a physical layer establishes a mapping relation table 1 between an index and corresponding Ns and a mapping relation table 2 between the index and corresponding dus under different configurations of an NCSconfig and stores the table 1 and the table 2 in a memory device; the physical layer receives leader sequence generating parameters dispatched by an upper level; an NCS is obtained according to the NCSconfig, leader code formats and set type parameters and index= indexinit is set; if a limit set is adopted, an N and a du which correspond to the index are found out from the table 1 and the table 2; a Cv and a u are calculated according to the N and the du; and a final random access leader sequence (xu, v(n)) is generated according to the Cv and the u. The invention further discloses a device which is adaptable to the method. With the adoption of the method and the device disclosed by the invention, the time for generating the random access leader sequences can be effectively reduced, thus the efficiency of the system is increased.

Description

The LTE system inserts restriction set targeting sequencing generation method and device at random

Technical field

(be called for short, LTE) system's access technology at random specially refers to generation method and device that a kind of LTE system inserts the restriction set targeting sequencing at random to the present invention relates to Long Term Evolution.

Background technology

Inserting at random in the LTE system and play important effect, is that subscriber equipment (is called for short, UE) initially connects, switches, selects to rebuild and found, when idle pulley is transformed into connection mode, recover again unique strategy of uplink synchronous and ascending resource request.The random access resource of the random access procedure assigned dedicated that whether can initiate to UE according to the base station of evolution (being called for short eNode B), random access procedure can be divided into based on competitive way with based on non-competing mode.

For the physical layer of UE, the primary work that inserts at random is exactly the generation and the transmission of random access leader sequence.In the generation and process of transmitting of random access leader sequence, physical layer at first will be obtained Physical Random Access Channel from high level and (be called for short PRACH) parameter configuration, lead code form, initial logic root sequence number (abbreviation, index _Init), the cyclic shift configuration of root sequence (is called for short N _CSconfig), and collection type information such as (restriction set/unrestricted collection); Next is to obtain lead code (to be called for short C _Preamble), when eNode B did not have the lead code of assigned dedicated, UE just selected a lead code at random from 64 of cell allocation available lead codes; The parameter configuration and the C that provide according to high level then _PreambleThe computation cycles shift value, then (be called for short, ZC) the root sequence is carried out cyclic shift generation targeting sequencing, sends this targeting sequencing with certain power at last by Zadoff-Chu.

Random access leader sequence x according to definition among the standard 3GPP TS 36.211 _{U, v}(n) be:

x _u，v(n)＝x _u((n+C _v)modN _ZC) 0≤n≤N _ZC-1

Wherein, x _u(n) be the ZC sequence, be defined as:

$x_u\left(n\right)=e^{-j\frac{\mathrm{\πun}(n+1)}{N_{\mathrm{ZC}}}},$ 0≤n≤N _ZC-1

C _vCyclic shift for sequence is defined as:

UE adopts restriction set or unrestricted collection, lead code form 0～3 corresponding restriction set and unrestricted collection, and the only corresponding unrestricted collection of lead code format 4 based on the collection type parameter decision that high level provides.

The targeting sequencing method is as shown in Figure 1 in the prior art:

1, physical layer receives the high-rise collection type parameter that issues, lead code form, index _Init, N _CSconfig, N _ZC, and C _Preamble

2, according to N _CSconfig, lead code form and collection type parameter obtain N _CS, restriction set or unrestricted collection are adopted in decision according to the collection type parameter; If adopt unrestricted collection, then get into step 3, otherwise, set index=index _Init, get into step 6;

3, to N _CSJudge; If N _CSEqual 0, then get into step 4, otherwise, step 5 got into;

4, C _v=0, logic root sequence number index=index _Init+ C _Preamble, obtain physics root sequence number according to index and (be called for short, u), get into step 15;

5, calculate the targeting sequencing number that the u of unrestricted collection can generate (abbreviation, N),

Calculating parameter v then, v=(C _PreambleModN)-1, C _v=vN _CSThen calculate index,

Obtain corresponding u according to index, get into step 15;

6, obtain corresponding u based on index;

7, calculate the Doppler frequency shift 1/T of u _SEQCorresponding cyclic shift value (is called for short d _u):

Wherein, p is for satisfying (pu) modN _ZC=1 minimum nonnegative integer;

8, to d _uValue is judged: if d _uN satisfies condition _CS≤d _u＜N _ZC/ 3, then get into step 9; If d _uN satisfies condition _ZC/ 3≤d _u≤(N _ZC-N _CS)/2 then get into step 10; Otherwise, get into step 11;

9, according to d _u, N _ZCAnd N _CSCalculating group number (be called for short,

), the distance of two adjacent groups original position (is called for short d _Start), cyclic shift number in every group (be called for short, ) and less group in the cyclic shift number (be called for short,

):

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

Calculate the targeting sequencing number N of the physics root sequence u generation of restriction set,

gets into step 12 then;

10, according to d _u, N _ZCAnd N _CSCalculate

d _Start,

With Value:

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

Calculate N then,

gets into step 12 then;

11, N=1 gets into step 12 then;

12, compare C _PreambleMagnitude relationship with N: if N＞C _Preamble, then get into step 13; Otherwise, get into step 14;

13, make parameter v equal C _Preamble, then with parameter v, physics root sequence u, d _StartWith

The substitution formula

Calculate C _vValue gets into step 15 then;

14, with C _PreambleValue be revised as C _Preamble-N, and index=index+1, and return step 6;

15,, generate ZC root sequence, then according to ZC root sequence and cyclic shift C according to physics root sequence number u _vGenerate targeting sequencing.

Parameter and symbol description that the aforementioned calculation process is relevant:

N _ZC: the ZC sequence length; Table 5.7.2-1 has stipulated lead code form and N among the standard 3GPP TS 36.211 _ZCCorresponding relation.For lead code form 0～3, N _ZC=839; For lead code format 4, N _ZC=139.

N _CS: the zero correlation length of field of random access sequence; Table 5.7.2-2 has stipulated N with table 5.7.2-3 among the standard 3GPP TS 36.211 _CSconfig, collection type parameter and lead code form and N _CSCorresponding relation.

U: physics root sequence number; Table 5.7.2-4 and table 5.7.2-5 have stipulated the corresponding relation of logic root sequence number and lead code form and u among the standard 3GPP TS 36.211.

T _SEQ: targeting sequencing length; Table 5.7.1-1 has stipulated lead code form and T among the standard 3GPP TS 36.211 _SEQCorresponding relation.

symbol: represent downward rounding operation.

Can know from above description, at the cyclic shift C that inserts the restriction set targeting sequencing at random of prior art _vIn the calculating, when the leading code value that obtains when physical layer is big, just can not utilize a required targeting sequencing of physics root sequence generation.At this moment, then need repeatedly call formula and carry out interative computation, multiplication that intermediate demand is a large amount of and add operation, computation complexity is higher, thereby has increased the time that random access leader sequence generates, and has reduced system effectiveness.

Summary of the invention

In view of this, the present invention proposes a kind of LTE system and insert restriction set targeting sequencing generation method at random, to solve the long problem of random access leader sequence rise time that prior art exists.

LTE of the present invention system inserts the restriction set targeting sequencing at random and generates the method and technology scheme and be:

1, physical layer is based upon different N _CSconfigConfiguration is the mapping relations tabulation table1 of the N of index difference correspondence down, and the corresponding respectively d of index _uMapping relations tabulations table2 and be saved in the memory;

2, physical layer receives the high-rise collection type parameter that issues, lead code form, index _Init, N _CSconfig, N _ZC, and C _Preamble

3, according to N _CSconfig, lead code form and collection type parameter obtain N _CS, index=index is set _Init

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uOtherwise, generate unrestricted collection targeting sequencing according to the prior art scheme;

5, physical layer is according to N and d _uCalculate C _vAnd u;

6, according to C _vAnd u generates final random access leader sequence x _{U, v}(n).

Said physical layer is according to N and d _uCalculate C _vAnd u further comprises:

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, obtain corresponding u according to index; Execution in step 504; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

504, according to v and d _uCalculate C _v

Said according to v and d _uCalculate C _vFurther comprise:

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0.

The invention allows for a kind of LTE system and insert restriction set targeting sequencing generating apparatus at random, comprising:

Receiving element is with said C _vAnd the u computing unit is connected; Generate parameter from high-rise receiving preamble sequences; And send to C _vAnd u computing unit;

The mapping table memory cell is with said C _vAnd the u computing unit is connected, storage set up in advance in different N _CSconfigThe mapping relations tabulation table1 that the corresponding respectively N of the down different index of configuration reaches, and the corresponding respectively d of different index _uMapping relations tabulations table2;

C _vAnd the u computing unit, be connected with said mapping table memory cell with said receiving element, obtain the high-rise targeting sequencing that issues from said receiving element and generate parameter, and from the mapping table memory cell, inquire about corresponding N and d according to said targeting sequencing generation parameter _u, utilize the N and the d that inquire _uCalculate C _vReach u and output to the targeting sequencing computing unit;

The targeting sequencing computing unit is with said C _vReach the u computing unit and be connected, from C _vAnd the u computing unit obtains C _vAnd u, generate targeting sequencing x _{U, v}(n);

Said targeting sequencing generates parameter and comprises, collection type parameter, lead code form, index _Init, N _CSconfig, N _ZCAnd C _Preamble

Index and N and the d of technical scheme of the present invention through setting up in advance _uThe mapping relations table obtains N and d through the mode of tabling look-up when calculating the restriction set targeting sequencing _u, again according to N and d _uConfirm corresponding C _vAnd u, finally according to C _vGenerating corresponding targeting sequencing with u has effectively avoided at prior art C _vWith repeatedly call formula in the u computational process and carry out interative computation, the computation complexity problem of higher has reduced the time that random access leader sequence generates, and has improved system effectiveness.

Description of drawings

Fig. 1 is that prior art LTE system random access leader sequence generates method flow diagram

Fig. 2 is that LTE of the present invention system random access leader sequence generates method flow diagram

Fig. 3 is a LTE of the present invention system random access leader sequence generating apparatus structure chart

Embodiment

For further specifying technical scheme of the present invention, provide specific embodiment below and also describe in detail in conjunction with the accompanying drawings.

Specific embodiment 1

1, physical layer is based upon different N _CSconfigThe down different index of configuration are the mapping relations tabulation table1 of the N of correspondence respectively, and the corresponding respectively d of different index _uMapping relations tabulations table2 and be saved in the memory;

In the present embodiment, said table1 comprises that value is that all index of 0～837 are respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is 0～837 the pairing d of all index difference _u

2, physical layer receives the high-rise collection type parameter that issues, lead code form, index _Init, N _CSconfig, N _ZC, and C _Preamble

3, according to N _CSconfig, lead code form and collection type parameter obtain N _CS, index=index is set _Init

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uExecution in step 5; Otherwise, execution in step 6;

5, physical layer is according to N and d _uCalculate C _vAnd u;

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, obtain corresponding u, execution in step 504 according to index; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

504, according to v and d _uCalculate C _vExecution in step 7;

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

6, physical layer is calculated pairing u of said index and C under the unrestricted collection condition according to the computational methods of prior art _v

7, according to C _vAnd u generates final random access leader sequence x _{U, v}(n).

701, calculate x according to the u that is obtained _u(n);

$x_u\left(n\right)=e^{-j\frac{\mathrm{\πun}(n+1)}{N_{\mathrm{ZC}}}},$ 0≤n≤N _ZC-1

702, according to x _u(n) and C _vCalculate x _{U, v}(n).

x _u，v(n)＝x _u((n+C _v)modN _ZC) 0≤n≤N _ZC-1

Specific embodiment 2

1, physical layer is based upon different N _CSconfigThe down different index of configuration are the mapping relations tabulation table1 of the N of correspondence respectively, and the corresponding respectively d of different index _uMapping relations tabulations table2 and be saved in the memory;

In the present embodiment, said table1 comprises that value is that all index of even number are respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of even number _u

Step 2～3 are identical with specific embodiment 1;

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uOtherwise, execution in step 6;

In the present embodiment, said physical layer finds index corresponding N and d from said table1 and table2 _uComprise:

If index is an odd number, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index-1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of logic root sequence number index-1 among the table2 _uAs the corresponding d of index _u

Otherwise, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of physics root sequence number index among the table2 _uAs the corresponding d of index _u

5, physical layer is according to N and d _uCalculate C _vAnd u;

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, execution in step 504; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, and obtains the corresponding u of index, from said table1 and table2, finds u corresponding N and d _uReturn step 501;

Said index corresponding N and the d of from said table1 and table2, finding _uMethod identical with step 4;

504, according to v and d _uCalculate C _vExecution in step 7;

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Step 6～7 are identical with specific embodiment 1.

Specific embodiment 3

1, physical layer is based upon different N _CSconfigThe down different index of configuration are the mapping relations tabulation table1 of the N of correspondence respectively, and the corresponding respectively d of different index _uMapping relations tabulations table2 and be saved in the memory;

In the present embodiment, said table1 comprises that value is that all index of odd number are respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of odd number _u

Step 2～3 are identical with specific embodiment 1;

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uOtherwise, execution in step 6;

In the present embodiment, said physical layer finds index corresponding N and d from said table1 and table2 _uComprise:

If index is an even number, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index+1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of logic root sequence number index+1 among the table2 _uAs the corresponding d of index _u

Otherwise, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of physics root sequence number index among the table2 _uAs the corresponding d of index _u

5, physical layer is according to N and d _uCalculate C _vAnd u;

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, execution in step 504; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, and obtains the corresponding u of index, from said table1 and table2, finds u corresponding N and d _uReturn step 501;

Said index corresponding N and the d of from said table1 and table2, finding _uMethod identical with step 4;

504, according to v and d _uCalculate C _vExecution in step 7;

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Step 6～7 are identical with specific embodiment 1.

Specific embodiment 4

1, physical layer is based upon different N _CSconfigThe down different index of configuration are the mapping relations tabulation table1 of the N of correspondence respectively, and the corresponding respectively d of different index _uMapping relations tabulations table2 and be saved in the memory;

In the present embodiment, said table1 comprises that value is odd number and corresponding d _uSatisfy N _CS≤d _u≤(N _ZC-N _CSThe index of)/2 is respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of odd number _u

Step 2～3 are identical with specific embodiment 1;

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uOtherwise, execution in step 6;

In the present embodiment, said physical layer finds index corresponding N and d from said table1 and table2 _uComprise:

If 401 index are even number, search the pairing d of logic root sequence number index+1 among the table2 _uAs the corresponding d of index _uOtherwise execution in step 404;

402, judge the d that is obtained _uValue, if N _CS≤d _u≤(N _ZC-N _CS)/2, execution in step 403; Otherwise N=1; Execution in step 5;

403, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index+1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Execution in step 5;

404, search the pairing d of index among the table2 _uAs the corresponding d of index _u

405, judge the d that is obtained _uValue, if N _CS≤d _u≤(N _ZC-N _CS)/2, execution in step 406; Otherwise N=1; Execution in step 5;

406, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as u among the table1 _CSconfigFollowing corresponding N;

5, physical layer is according to N and d _uCalculate C _vAnd u;

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, obtain u according to index; Execution in step 504; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

Said index corresponding N and the d of from state table1 and table2, finding _uMethod identical with step 4;

504, according to v and d _uCalculate C _vExecution in step 7;

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Step 6～7 are identical with specific embodiment 1.

Specific embodiment 5

1, physical layer is based upon different N _CSconfigThe down different index of configuration are the mapping relations tabulation table1 of the N of correspondence respectively, and the corresponding respectively d of different index _uMapping relations tabulations table2 and be saved in the memory;

In the present embodiment, said table1 comprises that value is even number and corresponding d _uSatisfy N _CS≤d _u≤(N _ZC-N _CSThe index of)/2 is respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of even number _u

Step 2～3 are identical with specific embodiment 1;

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uOtherwise, execution in step 6;

In the present embodiment, said physical layer finds index corresponding N and d from said table1 and table2 _uComprise:

If 401 index are odd number, search the pairing d of logic root sequence number index-1 among the table2 _uAs the corresponding d of index _uOtherwise execution in step 404;

402, judge the d that is obtained _uValue, if N _CS≤d _u≤(N _ZC-N _CS)/2, execution in step 403; Otherwise N=1; Execution in step 5;

403, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index-1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Execution in step 5;

404, search the pairing d of index among the table2 _uAs the corresponding d of index _u

405, judge the d that is obtained _uValue, if N _CS≤d _u≤(N _ZC-N _CS)/2, execution in step 406; Otherwise N=1; Execution in step 5;

406, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as u among the table1 _CSconfigFollowing corresponding N;

5, physical layer is according to N and d _uCalculate C _vAnd u;

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, obtain u according to index; Execution in step 504; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

Said index corresponding N and the d of from state table1 and table2, finding _uMethod identical with step 4;

504, according to v and d _uCalculate C _vExecution in step 7;

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Step 6～7 are identical with specific embodiment 1.

Specific embodiment 6

1, physical layer is based upon different N _CSconfigThe down different index of configuration are the mapping relations tabulation table1 of the N of correspondence respectively, and the corresponding respectively d of different index _uMapping relations tabulations table2 and be saved in the memory;

In the present embodiment, all corresponding d of said table1 _uSatisfy N _CS≤d _u≤(N _ZC-N _CSThe index of)/2 is respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises all index pairing d respectively _u

Step 2～3 are identical with specific embodiment 1;

If 4 collection type parameter regulations adopt restriction set, physical layer finds index corresponding N and d from said table1 and table2 _uOtherwise, execution in step 6;

In the present embodiment, said physical layer finds index corresponding N and d from said table1 and table2 _uComprise:

401, search the pairing d of index among the table2 _uAs the corresponding d of index _u

402, judge the d that is obtained _uValue, if N _CS≤d _u≤(N _ZC-N _CS)/2, execution in step 403; Otherwise N=1; Execution in step 5;

403, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as u among the table1 _CSconfigFollowing corresponding N;

5, physical layer is according to N and d _uCalculate C _vAnd u;

501, physical layer compares N and C _PreambleSize;

If 502 N are greater than C _Preamble, set v=C _Preamble, obtain u according to index; Execution in step 504; Otherwise, execution in step 503;

503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

Said index corresponding N and the d of from state table1 and table2, finding _uMethod identical with step 4;

504, according to v and d _uCalculate C _vExecution in step 7;

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}=2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-2d_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Step 6～7 are identical with specific embodiment 1.

Specific embodiment 7

Present embodiment is a kind of preferred implementation that LTE of the present invention system inserts restriction set targeting sequencing generating apparatus at random, and apparatus structure is as shown in Figure 3, comprising:

Receiving element is with said C _vAnd the u computing unit is connected; Generate parameter from high-rise receiving preamble sequences; And send to C _vAnd u computing unit;

The mapping table memory cell is with said C _vAnd the u computing unit is connected, storage set up in advance in different N _CSconfigThe mapping relations tabulation table1 that the corresponding respectively N of the down different index of configuration reaches, and the corresponding respectively d of different index _uMapping relations tabulations table2;

C _vAnd the u computing unit, be connected with the mapping table memory cell with said receiving element, obtain the high-rise targeting sequencing that issues from said receiving element and generate parameter, and from the mapping table memory cell, inquire about corresponding N and d according to said targeting sequencing generation parameter _u, utilize the N and the d that inquire _uCalculate C _vReach u and output to the targeting sequencing computing unit;

The targeting sequencing computing unit is with said C _vReach the u computing unit and be connected, from C _vAnd the u computing unit obtains C _vAnd u, generate targeting sequencing x _{U, v}(n);

Said targeting sequencing generates parameter and comprises, collection type parameter, lead code form, index _Init, N _CSconfig, N _ZCAnd C _Preamble

Wherein, table1 that stores in the said mapping table memory cell and table2 can adopt the described mapping relations tabulation of any embodiment in the specific embodiment of the invention 1～3; Said C _vAnd the u computing unit calculates C _vAnd the method for u can adopt the table1 of use same format in the specific embodiment 1～3 and the computational methods among the table2 embodiment according to the concrete form of table1 that is stored and table2 respectively.

One of ordinary skill in the art obviously should be known and understood, and the above embodiment that the inventive method is lifted only is used to explain the inventive method, and is not limited to the inventive method.Though effectively described the present invention through embodiment, also there are many variations in the present invention and do not break away from spirit of the present invention.Under the situation of spirit that does not deviate from the inventive method and essence thereof, those skilled in the art work as can make various corresponding changes or distortion based on the inventive method, but these corresponding changes or distortion all belong to the claim protection domain of the inventive method.

Claims (7)

1. a LTE system inserts restriction set targeting sequencing generation method at random, it is characterized in that, comprising:

Step 1, physical layer are based upon different cyclic shift configuration N _CSconfigConfiguration is the mapping relations tabulation table1 of the targeting sequencing number N of logic root sequence number index difference correspondence down, and the corresponding respectively Doppler frequency shift correspondence cyclic shift value d of different index _uMapping relations tabulations table2 and be saved in the memory;

Step 2, physical layer receive the high-rise collection type parameter that issues, lead code form, initial logic root sequence number index _Init, N _CSconfig, ZC sequence length N _ZCAnd lead code C _Preamble

Step 3, according to N _CSconfig, lead code form and collection type parameter obtain the zero correlation length of field N of random access sequence _CS, index=index is set _Init

If step 4 collection type parameter regulation adopts restriction set, physical layer finds index corresponding N and d from said table1 and table2 _u

Step 5, physical layer are according to N and d _uCalculate the cyclic shift C of sequence _vAnd physics root sequence number u;

Step 501, physical layer be N and C relatively _PreambleSize;

If step 502 N is greater than C _Preamble, setup parameter v=C _PreambleObtain corresponding u according to index; Execution in step 504; Otherwise, execution in step 503;

Step 503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

Step 504, according to v and d _uCalculate C _v

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}={2d}_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-{2d}_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Wherein, said

Be cyclic shift number in every group; Said d _StartDistance for the two adjacent groups original position;

Step 6, according to C _vAnd u generates final random access leader sequence x _{U, v}(n).

2. a kind of LTE according to claim 1 system inserts restriction set targeting sequencing generation method at random, it is characterized in that:

Said table1 comprises that value is that all index of even number are respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of even number _u

Said physical layer finds index corresponding N and d from said table1 and table2 _uComprise,

If index is an odd number, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index-1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of logic root sequence number index-1 among the table2 _uAs the corresponding d of index _u

Otherwise, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of physics root sequence number index among the table2 _uAs the corresponding d of index _u

3. a kind of LTE according to claim 1 system inserts restriction set targeting sequencing generation method at random, it is characterized in that:

Said table1 comprises that value is that all index of odd number are respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of odd number _u

Said physical layer finds index corresponding N and d from said table1 and table2 _uComprise,

If index is an even number, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index+1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of logic root sequence number index+1 among the table2 _uAs the corresponding d of index _u

Otherwise, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as index among the table1 _CSconfigFollowing corresponding N; Search the pairing d of physics root sequence number index among the table2 _uAs the corresponding d of index _u

4. a kind of LTE according to claim 1 system inserts restriction set targeting sequencing generation method at random, it is characterized in that:

Said table1 comprises the d that all are corresponding _uSatisfy N _CS≤d _u≤(N _ZC-N _CSThe index of)/2 is respectively at N _CSconfigPairing N under=0～14 situation; All index of said table2 are pairing d respectively _u

Said physical layer finds index corresponding N and d from said table1 and table2 _uComprise,

Search the pairing d of index among the table2 _uAs the corresponding d of index _u

If N _CS≤d _u≤(N _ZC-N _CS)/2, the N that issues according to high level _CSconfigSearch the N that the pairing N of index issues at high level as u among the table1 _CSconfigFollowing corresponding N;

Otherwise, N=1.

5. a kind of LTE according to claim 1 system inserts restriction set targeting sequencing generation method at random, it is characterized in that:

Said table1 comprises that value is odd number and corresponding d _uSatisfy N _CS≤d _u≤(N _ZC-N _CSThe index of)/2 is respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of odd number _u

Said physical layer finds index corresponding N and d from said table1 and table2 _uComprise,

If index is an even number, search the pairing d of logic root sequence number index+1 among the table2 _uAs the corresponding d of index _u

If N _CS≤d _u≤(N _ZC-N _CS)/2, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index+1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Otherwise N=1;

If index is an odd number, search the pairing d of index among the table2 _uAs the corresponding d of index _u

If N _CS≤d _u≤(N _ZC-N _CS)/2, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index issues at high level as index among the table1 _CSconfigFollowing corresponding N; Otherwise N=1.

6. a kind of LTE according to claim 1 system inserts restriction set targeting sequencing generation method at random, it is characterized in that:

Said table1 comprises that value is even number and corresponding d _uSatisfy N _CS≤d _u≤(N _ZC-N _CSThe index of)/2 is respectively at N _CSconfigPairing N under=0～14 situation; Said table2 comprises that value is the pairing d of all index difference of even number _u

Said physical layer finds index corresponding N and d from said table1 and table2 _uComprise,

If index is an odd number, search the pairing d of logic root sequence number index-1 among the table2 _uAs the corresponding d of index _u

If N _CS≤d _u≤(N _ZC-N _CS)/2, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index-1 issues at high level as index among the table1 _CSconfigFollowing corresponding N; Otherwise N=1;

If index is an even number, search the pairing d of index among the table2 _uAs the corresponding d of index _u

If N _CS≤d _u≤(N _ZC-N _CS)/2, the N that issues according to high level _CSconfigSearch the N that the pairing N of logic root sequence number index issues at high level as index among the table1 _CSconfigFollowing corresponding N; Otherwise N=1.

7. a LTE system inserts restriction set targeting sequencing generating apparatus at random, it is characterized in that, comprising:

Receiving element is with C _vAnd the u computing unit is connected; Generate parameter from high-rise receiving preamble sequences; And send to C _vAnd u computing unit;

The mapping table memory cell is with said C _vReach the u computing unit and be connected, what storage was set up in advance disposes N in different cyclic shifts _CSconfigThe mapping relations tabulation table1 that the configuration targeting sequencing number N that Different Logic root sequence number index is corresponding respectively down reaches, and the corresponding respectively corresponding cyclic shift value d of Doppler frequency shift of different index _uMapping relations tabulations table2;

C _vAnd the u computing unit, be connected with the mapping table memory cell with said receiving element, obtain the high-rise targeting sequencing that issues from said receiving element and generate parameter, and from the mapping table memory cell, inquire about corresponding N and d according to said targeting sequencing generation parameter _u, utilize the N and the d that inquire _uComputation cycles displacement C _vReach physics root sequence number u and output to the targeting sequencing computing unit;

The targeting sequencing computing unit is with said C _vReach the u computing unit and be connected, from C _vAnd the u computing unit obtains C _vAnd u, generate targeting sequencing x _{U, v}(n);

Wherein, said targeting sequencing generates parameter and comprises, collection type parameter, lead code form, initial logic root sequence number index _Init, N _CSconfig, ZC sequence length N _ZCWith lead code C _Preamble

Wherein, said C _vAnd the u computing unit calculates C _vAnd the concrete grammar of u comprises,

Step 501, comparison N and C _PreambleSize;

If step 502 N is greater than C _PreambleSetup parameter v=C _PreambleObtain corresponding u according to index; Execution in step 504; Otherwise, execution in step 503;

Step 503, with C _PreambleValue be revised as C _Preamble-N adds 1 with index, from said table1 and table2, finds index corresponding N and d _uReturn step 501;

Step 504, according to v and d _uCalculate C _v

If N _CS≤d _u＜N _ZC/ 3,

$d_{\mathrm{start}}={2d}_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If N _ZC/ 3≤d _u≤(N _ZC-N _CS)/2,

$d_{\mathrm{start}}=N_{\mathrm{ZC}}-{2d}_u+n_{\mathrm{shift}}^{\mathrm{RA}}{N}_{\mathrm{CS}}$

If d _uDo not satisfy N _CS≤d _u≤(N _ZC-N _CS)/2, C _v=0;

Wherein, said

Be cyclic shift number in every group; Said d _StartDistance for the two adjacent groups original position.

Images