CN101674277A - Method for generating a reference signal sequence using grouping - Google Patents

Abstract

Method for generating reference signal sequence using grouping is explained. In this method, base sequences are grouped such that each group contains at least one base sequence of each length, so UE(s) can use various length sequences as a reference signal. And in this method, inter cell interference caused by using various length sequence as a reference signal sequence can be minimized by grouping sequences having the high cross correlation relation.

Description

Utilize grouping to generate the method for reference signal sequence

The application is that the original bill application number is dividing an application of 200880003910.8 application for a patent for invention (international application no: PCT/KR2008/000629, the applying date: on February 1st, 2008, denomination of invention: utilize grouping to generate the method for reference signal sequence).

Technical field

The present invention relates to be used to generate the method for reference signal sequence, more particularly, relate to having the method for dividing into groups, be used to generate the method for reference signal sequence and use Zadoff-Chu (ZC) sequence to generate the method for reference signal sequence with the sequence of the corresponding variable-length of one or more Resource Block sizes.

Background technology

Following explanation is mainly discussed around 3GPP LTE system, but the invention is not restricted to this system, and exemplary 3GPP LTE system only is in order to allow those skilled in the art can more be expressly understood the present invention.

There are many sequences that are used to send signal, but (3rd GenerationPartnership Project Long Term Evolution: third generation partner program Long Term Evolution) in the system, (Constant Amplitude Zero Auto-Correlation: permanent envelope zero auto-correlation) sequence has formed the basic sequence that sends signal to CAZAC at 3GPP LTE.The CAZAC sequence can be used for various channels with extract ID or control information (such as, main SCH) and the uplink/downlink synchronization channel (SCH) of S-SCH (Secondary SCH: auxilliary SCH) comprise P-SCH (Primary SCH:, be used to send the pilot channel of reference signal).Simultaneously, the CAZAC sequence can be used in the scrambling (scrambling).

Mainly contain two kinds of CAZAC sequences (that is, GCL CAZAC sequence and Zadoff-ChuCAZAC sequence) and be used as the CAZAC sequence.This CAZAC sequence of two types concerns the connection that is relative to each other by conjugate complex number.That is to say, can access GCL CAZAC sequence by Zadoff-Chu CAZAC sequence is carried out the conjugate complex number computing.Zadoff-Chu CAZAC sequence is expressed as follows:

[formula 1]

$c(k;N,M)=\exp \left(\frac{\mathrm{j\πMk}(k+1)}{N}\right)$ (N is an odd number)

[formula 2]

$c(k;N,M)=\exp \left(\frac{\mathrm{j\πM}{k}^2}{N}\right)$ (N is an even number)

Wherein, k represents the index of sequence composition, the length of the CAZAC sequence that N indicates to generate, and M represents serial ID or sequence index.

When using c (k; N M) represents the Zadoff-Chu CAZAC sequence that provided by formula 1 and formula 2 and when having the GCL CAZAC sequence of conjugate complex number relation with Zadoff-Chu CAZAC sequence, and these sequences can have following three features.

[formula 3]

| C (k; N; M) |=1 (for all k, N, M)

[formula 4]

[formula 5]

R _{M1, M2; N}(d)=p is (for all M ₁, M ₂And N)

Formula 3 means that the size of CAZAC sequence is 1 all the time, is represented by the delta function and formula 4 shows the auto-correlation function of CAZAC sequence.In this case, this auto-correlation is based on circular correlation.Equally, formula 5 shows cross-correlation and is always constant.

In these two kinds of CAZAC sequences, following explanation mainly concentrates on Zadoff-ChuCAZAC sequence (after this being called " ZC sequence ").

In 3GPP LTE system, as reference sequences, the length of this ZC sequence should equal the size of Resource Block with this ZC sequence.Simultaneously, not only use a Resource Block size sequence, can also use the reference signal sequence that has with the corresponding length of a plurality of Resource Block sizes.

For single-cell environment, (Frequency Division Multiplexing: method frequency division multiplexing) sends reference signal to carry out multiplexing to the signal from a plurality of subscriber equipmenies (UE) by centralized FDM.But for the environment of many sub-districts, (CodeDivision Multiplexing: method code division multiplexing) sends reference signal to distinguish the signal from neighbor cell by additional (additional) CDM.In this was multiplexing, it was feasible that two kinds of methods are arranged.A kind of CDM method that is to use ZC sequence with different root index, and another kind is to use and has same root index (M) but differentially used the CDM method of the ZC sequence of cyclic shift.

When the length of the reference signal of the ZC sequence of using these types was identical, the cross correlation value under two kinds of situations was all little.But, when the reference signal with different length as arriving from the interference of neighbor cell and being sent out or when on frequency range crossover taking place, cross correlation value will be very big by identical frequency range.

Summary of the invention

Technical problem

Therefore, the present invention aims to provide a kind of method that is used to generate reference signal sequence, and this method makes the minimum interference that is caused by the signal with different length from neighbor cell.

For this method, the present invention also provides a kind of method, and this method can be divided into groups to sequence efficiently so that each group is made up of the sequence with high cross correlation value, and supports the sequence of variable-length is used as reference signal.

Equally, the invention provides a kind of method of the generation reference signal sequence based on above-mentioned grouping.

Technical scheme

In order to realize these purposes and other advantage, according to purpose of the present invention, as implementing and extensively describe ground herein, a kind of method of dividing into groups with the sequence of the corresponding variable-length of one or more Resource Block sizes to having of being used for is provided, this method may further comprise the steps: so that comprise the mode of at least one sequence of every kind of length in each group described sequence is divided into groups, wherein, sequence after the grouping is the basic sequence that is used to use with the variable corresponding cyclic shift of cyclic shift value, and the described basic sequence that will carry out described cyclic shift is as reference signal sequence.

Preferably, described group quantity is 30.

And, carry out described grouping by this way, that is, each group comprises a basic sequence with 1 to 5 times of corresponding every kind of length of described Resource Block size, and comprises 6 times or two basic sequences of more times of corresponding every kind of length with described Resource Block size.

And, preferably, utilize Zadoff-Chu (ZC) sequence to define to have 3 times or the basic sequence of more times of corresponding length with described Resource Block size, and utilize other sequence except the ZC sequence to define to have the basic sequence with 1 times or 2 times corresponding length of described Resource Block size.

In another aspect of the present invention, provide a kind of method that generates reference signal sequence.In an execution mode aspect this, this method may further comprise the steps: definition has one or more the basic sequence with the corresponding variable-length of one or more Resource Block sizes; And the described basic sequence to definition is used and the variable corresponding cyclic shift of cyclic shift value, wherein, described basic sequence is divided into groups, and each group comprises at least one basic sequence of every kind of length.

In this case, by length being served as reasons less than the specified (N of the largest prime number of corresponding reference signal sequence size _ZC ^RS) the ZC sequence carry out cyclic extensions and define described basic sequence.Can also be by length being served as reasons greater than the specified (N of the minimum prime number of corresponding reference signal sequence size _ZC ^RS) the ZC sequence carry out brachymemma and define described basic sequence.

In this execution mode, preferably, described group quantity is 30 equally.

And each described group comprises a basic sequence with 1 to 5 times of corresponding every kind of length of described Resource Block size, and with 6 times or two basic sequences of more times of corresponding every kind of length of described Resource Block size.

And, Zadoff-Chu (ZC) sequence that utilization has specific ZC sequence index (q) defines 3 times or the basic sequence of more times of corresponding length that has with described Resource Block size, and utilizes other sequence except the ZC sequence to define to have the basic sequence with 1 times or 2 times corresponding length of described Resource Block size.

And preferably, described specific ZC sequence index (q) is the basic sequence number index (function v) in group index (u) and this group.

And, defined basic sequence of carrying out cyclic shift can be used for the uplink reference signals sequence.

For above execution mode, described Resource Block size can be corresponding to the size of 12 subcarriers in frequency domain equally.

In another aspect of this invention, a kind of method of utilizing Zadoff-Chu (ZC) sequence to generate reference signal sequence, in an execution mode aspect this, this method may further comprise the steps: utilize q ZC root sequence to define specific basic sequence, wherein described basic sequence is divided into groups, and " q " is the basic sequence number index (function v) in group index (u) and this group; And the basic sequence of definition is used the corresponding cyclic shift of cyclic shift value with variable-length to generate described reference signal sequence.

In one case, determine described specific ZC sequence index (q) by one in the following formula,

$\left(1\right),q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\·{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein, $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},u\∈\{\mathrm{0,1},...,29\},v\∈\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\},$

$\left(2\right),q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\·{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein, $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},u\∈\{\mathrm{0,1},...,29\},v\∈\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\},$ Perhaps

$\left(3\right),q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\·{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein, $y=\mathrm{round}\left(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}\right)\·(u+1),u\∈\{\mathrm{0,1},...,29\},v\∈\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

Wherein, N _ZC ^RSBe by the length of coming appointment less than the largest prime number of the size of corresponding reference signal sequence, N _{Reference, zc} ^RSBe corresponding reference burst size, " round (z) " is the function that is rounded near the nearest integer of z, and " floor (z) " is the function that obtains being not more than the maximum integer of z.But, for another embodiment of the invention, N _ZC ^RSCan be by the length of coming appointment greater than the minimum prime number of corresponding reference signal sequence.

In another case, determine described specific ZC sequence index (q) by one in the following formula,

$\left(1\right),q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\·{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein, $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},u\∈\{\mathrm{0,1},...,29\},v\∈\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

$\left(2\right),q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\·{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein, $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},u\∈\{\mathrm{0,1},...,29\},v\∈\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\},$ Perhaps

$\left(3\right),q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\·{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein, $y=\mathrm{floor}(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}+0.5)\·(u+1),u\∈\{\mathrm{0,1},...,29\},v\∈\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}.$

Wherein, N _ZC ^RSBe by the length of coming appointment less than the largest prime number of the size of corresponding reference signal sequence, N _{Reference, zc} ^RSBe corresponding reference burst size, " round (z) " is the function that is rounded near the nearest integer of z, and " floor (z) " is the function that obtains being not more than the maximum integer of z.But, for another embodiment of the invention, N _ZC ^RSCan be by the length of coming appointment greater than the minimum prime number of corresponding reference signal sequence.But,, can specify N by the minimum prime number of size greater than the described basic sequence of definition for another embodiment of the invention _ZC ^RS

In an embodiment of this invention, described basic sequence number index that can each group is interior (maximum quantity v) is 2, and, determine described specific ZC sequence index (q) by one of following formula then,

(1)

q＝round(y)+v·(-1) ^floor(2y)

Wherein, $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},u\∈\{\mathrm{0,1},...,29\},v\∈\left\{\mathrm{0,1}\right\}$

(2)

q＝round(y)+v·(-1) ^floor(2y)

Wherein, $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},u\∈\{\mathrm{0,1},...,29\},v\∈\left\{\mathrm{0,1}\right\},$ Perhaps

(3)

q＝round(y)+v·(-1) ^floor(2y)

Wherein, $y=\mathrm{round}\left(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}\right)\·(u+1),u\∈\{\mathrm{0,1},...,29\},v\∈\left\{\mathrm{0,1}\right\}.$

Perhaps determine the ZC sequence index (q) that this is specific by one of following formula,

(1)

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein, $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}，v∈{0，1}

(2)

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein, $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\·(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},u\∈\{\mathrm{0,1},...,29\},v\∈\left\{\mathrm{0,1}\right\},$ Perhaps

(3)

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein, $y=\mathrm{floor}(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}+0.5)\·(u+1),u\∈\{\mathrm{0,1},...,29\},v\∈\left\{\mathrm{0,1}\right\}.$

Preferably, can be with N _{Reference, zc} ^RSBe set to 31 or 37, but also can be with N _{Reference, zc} ^RSBe set to other value.

Beneficial effect

These execution modes according to this invention, because will be used to the basic sequence of application cycle displacement divides into groups, and each group comprises at least one basic sequence of every kind of length, when giving a sub-district or Node B with specific set of dispense, UE can be used as reference signal sequence with the sequence of every kind of length.

In addition, because each group comprises the basic sequence with high cross-correlation relation, so, if give a sub-district or Node B, then can make intercell interferenceization with each set of dispense.

Description of drawings

Fig. 1 shows the concept map of the sequence generating method that is used to illustrate brachymemma.

Fig. 2 shows and is used for the concept map that the generation method of filling (padding) part is adopted in explanation.

Fig. 3 to 5 shows the concept map that sequence is divided into groups according to an embodiment of the invention.

Embodiment

Below, at length introduce preferred implementation of the present invention with reference to the accompanying drawings.Should be appreciated that, be intended to introduce illustrative embodiments of the present invention, rather than be intended to introduce and realize unique execution mode of the present invention with the disclosed detailed description of accompanying drawing.

Below, detail specifications comprises providing more fully understands particular content of the present invention.But it should be apparent to those skilled in the art that not to need these concrete contents to carry out the present invention.Fuzzy in order to prevent that notion of the present invention from taking place, omitted the structure and the device of known technology, perhaps will illustrate based on the major function of each structure and device form according to block diagram.Equally, the same reference numerals of using as far as possible in the whole text in drawing and description refers to identical or similar part.

As mentioned above, the present invention aims to provide a kind of method that generates reference signal sequence, the minimum interference that this method causes the signal with different length from neighbor cell.

For realizing this purpose, the length of CAZAC sequence is described.

At present, in 3GPP LTE system, the size of Resource Block (RB) that is used to send the various types of OFDM symbols that comprise the reference signal symbol is corresponding to the size of 12 subcarriers.Therefore, when generating ZC at the uplink reference signals sequence, the size of ZC sequence will be corresponding to the size of 12 subcarriers.

For the situation of CAZAC sequence, by determining to distinguish the quantity of CAZAC sequence index (M) each other with the quantity of the relatively prime mutual prime rwmber of sequence length (N).Therefore, when generation length was 12 ZC sequence, the quantity with ZC sequence of different sequence index was 4.But if generate the ZC sequence based on prime length (N), the quantity that then has the ZC sequence of different sequence index is N-1, and this makes the quantity of ZC sequence maximize.Therefore, provide the whole bag of tricks that is used to generate the CAZAC sequence based on prime length.

The sequence generating method of brachymemma at first, is described.

Fig. 1 shows the concept map of the sequence generating method that is used to illustrate brachymemma.

As shown in Figure 1, when the length of required CAZAC sequence is " L ", generated " X " (wherein, the CAZAC sequence of X＞L) that has prime length.Simultaneously, the length that generates is punctured into length " L " for the CAZAC sequence of " X ", that is to say, the sequence of length " X-L " is partly clipped.

By this method, make the quantity maximization of CAZAC sequence.But, because clipped the sequence that partly generates, reduced to a certain extent the CAZAC sequence of utilizing formula 4 and formula 5 explanations from/their cross correlation.Simultaneously, when having eliminated the sequence with relatively poor correlation properties, the actual quantity of sequence reduces.In addition, owing to brachymemma, also reduced the good PAPR characteristic of CAZAC sequence.

Therefore, method based on other type of the generation CAZAC sequence of prime number has been proposed.One of these methods are to generate and to have prime length " X " (wherein, the CAZAC sequence of X＜L), and the CAZAC sequence of the part of length " L-X " being added to this generation.The part of adding the sequence of this generation to can be called filling part (padding part), this method can be called the generation method that adopts filling part thus.

Fig. 2 shows the concept map that is used to illustrate the generation method that adopts filling part.

As shown in Figure 2, when the length of required CAZAC sequence is " L ", generated the CAZAC sequence of length for " X " (X is the largest prime number less than " L ").Simultaneously, the sequence of adding length to this generation for the filling part of " L-X ".

In the method in such method, filling part can be formed by 0.By the method, can make the quantity maximization of CAZAC sequence.In addition, when carrying out the differentiation (distinction) of sequence about the length " C1 " of Fig. 2, can keep the CAZAC sequence from/their cross correlation.

Simultaneously, preferably, filling part can be the cyclic extensions of CAZAC sequence.That is to say, can carry out recursive copying by first and generate filling part (C2), and add it sequence of generation to the CAZAC sequence that generates.By such operation, even when carrying out the differentiation of sequence about whole sequence length (L), the sequence that is generated also can have good in-their cross correlation.Therefore, the method further is better than filling part as 0 said method.

Use the CAZAC sequence to generate the present invention of reference signal sequence mainly based on the generation method of using the filling part that generates by above-mentioned cyclic extensions.But the present invention is not limited to this generation method, that is to say, the present invention can and use generation method by 0 filling part of forming based on the sequence generating method of brachymemma.

Based on this, the presence of intercell interference that causes having the sequence of different length by use describes.

When with the CAZAC sequence when the reference signal sequence, the cross correlation value between presence of intercell interference and two sequences is proportional.Therefore, in the example below, with the index of ZC sequence consider relevantly by the original reference signals that sends by specific resources zone and from neighbor cell, have the length that is different from this original reference signals and the arrival sequence that sends by identical resource area between the cross correlation value that causes of crossover.

More particularly, in following example, consideration length is the sequence of 1RB, 2RB and 3RB.Simultaneously, our hypothesis is by generating the sequence that length is 1RB and 2RB to having by carrying out cyclic extensions less than the ZC sequence of the length of the largest prime number appointment of the Resource Block size of correspondence.Simultaneously, we utilize the sequence method of formation of brachymemma to generate the sequence of length for 3RB at hypothesis.That is to say,, can generate sequence based on prime length with corresponding Resource Block size by one in above-mentioned three kinds of generation methods.

At first, the situation of consideration when the sequence with 1RB length in the same asset zone crossover takes place with the sequence with 2RB length.Sequence with 1RB length can followingly be represented with the sequence with 2RB length:

[formula 6]

${\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1)=e^{-j\frac{\mathrm{\&pi;}}{N_1}{s}_{1}k(k+1)},$ k＝0，...，N-1

${\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{2\mathrm{RB}}(k;s_2)=e^{-j\frac{\mathrm{\&pi;}}{N_2}{s}_{2}k(k+1)},$ k＝0，...，2N-1

Here, S ₁And S ₂Expression and the relatively prime index of sequence length (N or 2N).In this example, because employing cyclic extensions method generates sequence with 1RB length and the sequence with 2RB length so S ₁Can be 1,2 ..., 10, and S ₂Can be 1,2 ..., 22.Simultaneously, N ₁Can be 11, and N ₂Can be 23.

Based on this, the cross correlation value (c (d that when the sequence with 1RB length in preceding 12 subcarriers zone of the sequence with 2RB length crossover takes place with the sequence with 2RB length, generates; S ₁, S ₂)) can be expressed as follows:

[formula 7]

$c(d;s_1,s_2)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}{\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1){\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{2\mathrm{RB}}^{*}(k+d;s_2)$

For?d＝0，

$c(0;{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1,s_2)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}\exp (-j\frac{\mathrm{\&pi;}}{N_1}{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1\mathrm{mod}(k,N-1)(\mathrm{mod}(k,N-1)+1))\exp \left(j\frac{\mathrm{\&pi;}}{N_2}{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2\mathrm{mod}(k,2N-1)(\mathrm{mod}(k,2N-1)+1)\right)$

$=\left[\underset{k=0}{\overset{10}{\mathrm{\&Sigma;}}}\exp \right\{\mathrm{j\&pi;k}(k+1)(\frac{{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2}{23}-\frac{{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1}{11})\left\}\right]+\exp (j\frac{\mathrm{\&pi;}}{23}{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2\&CenterDot;11\&CenterDot;12)$

According to formula 7, should be appreciated that, if sequence index (S ₁And S ₂) combination satisfy

Near 0 condition, then the sequence by these sequence index indications produces high cross-correlation.

Therefore, an embodiment of the invention propose by this way sequence to be divided into groups, that is, the sequence that comprises in each group has high cross-correlation relation each other.Simultaneously, if consider the sequence of 1RB length and the sequence of 2RB length, then advise satisfying

Divide into groups near the combination of the sequence index of 0 condition.

But for the more general conditions that is identified for sequence is divided into groups, we consider some other examples.

When crossover takes place in back 12 subcarriers zone of 2RB sequence in the 1RB sequence, the cross correlation value of two sequences (c (d; S ₁, S ₂)) can be expressed as follows:

[formula 8]

$c(d;s_1,s_2)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}{\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1){\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{2\mathrm{RB}}^{*}(k+12+d;s_2)$

For?d＝0，

$c(d;s_1,s_2)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}\exp (-j\frac{\mathrm{\&pi;}}{N_1}{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1\mathrm{mod}(k,N-1)(\mathrm{mod}(k,N-1)+1))\exp \left(j\frac{\mathrm{\&pi;}}{N_2}{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2\mathrm{mod}(k+12,2N-1)(\mathrm{mod}(k+12,2N-1)+1)\right)$

$=\left[\underset{k=0}{\overset{10}{\mathrm{\&Sigma;}}}\exp \right\{\mathrm{j\&pi;k}(k+1)(\frac{{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2}{23}-\frac{{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1}{11})+\frac{{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2}{23}\&CenterDot;12\&CenterDot;(2k+13)\left\}\right]+1$

According to formula 8, also can reach a conclusion, if sequence index (S ₁And S ₂) combination satisfy

Near 0 condition, then the sequence of being represented by these sequence index produces high cross-correlation.Therefore, if consider the sequence of 1RB length and the sequence of 2RB length, the position that crossover then takes place does not change the branch set condition.

Then, we consider that the situation of crossover takes place the sequence when the sequence of 1RB length and 3RB length in the same asset zone.

At first, the sequence of the sequence of 1RB length and 3RB length can be expressed as follows:

[formula 9]

${\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1)=e^{-j\frac{\mathrm{\&pi;}}{N_1}{s}_{1}k(k+1)},$ k＝0，...，N-1

$g_{3\mathrm{RB}}(k;s_3)=e^{-j\frac{\mathrm{\&pi;}}{N_3}{s}_{3}k(k+1)},$ k＝0，...，3N-1

Here, S ₁And S ₃Expression and the relatively prime index of sequence length (N or 3N).In this example, owing to adopt the cyclic extensions method to generate the sequence of 1RB length, and adopt the sequence of truncated sequence method of formation generation 3RB length so S ₁Can be 1,2 ..., 10, and S ₂Can be 1,2 ..., 36.Simultaneously, N1 can be 11, and N2 can be 37.

Based on this, if 1RB length sequences and 3RB length sequences in initial 12 subcarriers zone of 3RB length sequences crossover take place, then the cross correlation value between two sequences can be expressed as follows:

[formula 10]

$c(d;s_1,s_3)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}{\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1)g_{3\mathrm{RB}}^{*}(k+d;s_3)$

For?d＝0，

$c(0;{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1,s_3)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}\exp (-j\frac{\mathrm{\&pi;}}{N_1}{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1\mathrm{mod}(k,N-1)(\mathrm{mod}(k,N-1)+1))\exp \left(j\frac{\mathrm{\&pi;}}{N_3}{s}_{3}k(k+1)\right)$

$=\left[\underset{k=0}{\overset{10}{\mathrm{\&Sigma;}}}\exp \right\{\mathrm{j\&pi;k}(k+1)(\frac{s_3}{37}-\frac{{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1}{11})\left\}\right]+\exp (j\frac{\mathrm{\&pi;}}{37}{s}_3\&CenterDot;11\&CenterDot;12)$

According to formula 10, should be appreciated that, if sequence index (S ₁And S ₃) combination satisfy

Near 0 condition, then the sequence by these sequence index indications produces high cross-correlation.Therefore, if consider the sequence of 1RB length and the sequence of 3RB length, then advise satisfying

Divide into groups near the combination of the sequence index of 0 condition.

Simultaneously, in order to confirm and the relation that the position of crossover occurs that we consider to take place in second 12 subcarriers zone of 3RB length sequences when the 1RB length sequences situation of crossover.In this case, the cross correlation value of two sequences can be expressed as follows:

[formula 11]

$c(d;s_1,s_3)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}{\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1)g_{3\mathrm{RB}}^{*}(k+12+d;s_3)$

For?d＝0，

$c(0;{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1,s_3)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}\exp (-j\frac{\mathrm{\&pi;}}{N_1}{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1\mathrm{mod}(k,N-1)(\mathrm{mod}(k,N-1)+1))\exp \left(j\frac{\mathrm{\&pi;}}{N_3}{s}_3(k+12)(k+13)\right)$

$=\left[\underset{k=0}{\overset{10}{\mathrm{\&Sigma;}}}\exp \right[\mathrm{j\&pi;}\{k(k+1)(\frac{s_3}{37}-\frac{{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1}{11})+\frac{{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2}{37}\&CenterDot;12\&CenterDot;(2k+13)\}\left]\right]+\exp (j\frac{\mathrm{\&pi;}}{37}{s}_3\&CenterDot;23\&CenterDot;24)$

Simultaneously, when the 1RB length sequences in last 12 subcarriers zone of 3RB length sequences crossover took place, cross correlation value can be expressed as follows:

[formula 12]

$c(d;s_1,s_3)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}{\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">g</figure-callout>}}_{1\mathrm{RB}}(k;s_1)g_{3\mathrm{RB}}^{*}(k+24+d;s_3)$

For?d＝0，

$c(0;{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1,s_3)=\underset{k=0}{\overset{N-1}{\mathrm{\&Sigma;}}}\exp (-j\frac{\mathrm{\&pi;}}{N_1}{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1\mathrm{mod}(k,N-1)(\mathrm{mod}(k,N-1)+1))\exp \left(j\frac{\mathrm{\&pi;}}{N_3}{s}_3(k+24)(k+25)\right)$

$=\left[\underset{k=0}{\overset{10}{\mathrm{\&Sigma;}}}\exp \right[\mathrm{j\&pi;}\{k(k+1)(\frac{s_3}{37}-\frac{{\mathrm{<figure-callout\; id="1"\; label="s"\; filenames="A2009101690380058H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_1}{11})+\frac{{\mathrm{<figure-callout\; id="2"\; label="s"\; filenames="A2009101690380058H1.png,A2009101690380059H1.png"\; state="\{\{state\}\}">s</figure-callout>}}_2}{37}\&CenterDot;24\&CenterDot;(2k+25)\}\left]\right]+\exp (j\frac{\mathrm{\&pi;}}{37}{s}_3\&CenterDot;35\&CenterDot;36)$

According to formula 11 and formula 12, also can reach a conclusion, if sequence index (S ₁And S ₃) combination satisfy

Near 0 condition, then the sequence by these sequence index indications produces high cross-correlation.Therefore, if consider the sequence of 1RB length and the sequence of 3RB length, the position that crossover then takes place does not change the branch set condition.

According to above example, the present invention's suggestion: when considering that length is N ₁And N ₂Two sequences the time, as follows sequence is carried out grouping, that is, two sequence index in being grouped into same group all sequences index satisfy

Near 0 condition.Here, N ₁And N ₂It can be largest prime number less than the reference signal sequence that generates.Simultaneously, S ₁And S ₂The root index of expression ZC sequence can be respectively at 1～(N ₁-1) and 1～(N ₂-1) selects in the scope.

Based on this notion, we have considered the more general group technology of every kind of length sequences.

Fig. 3 to 5 shows the concept map that sequence is divided into groups according to an embodiment of the invention.

According to this execution mode, in every kind of length sequences such as 1RB, 2RB, 3 RB as shown in Figure 3, the sequence of packets that index can be satisfied above-mentioned high cross-correlation condition is same group.Simultaneously, can be with same sub-district of being assigned to of each sequence set or Node B.

Usually, be that unit carries out FDM with sub-district or Node B, therefore can in a sub-district or Node B, will use the minimum interference that sequence caused of different length.Therefore, arrive same sub-district or Node B, can use the intercell interferenceization that sequence caused of different length by the sequence allocation that will have high cross-correlation relation.

Simultaneously, another embodiment of the invention proposes by making each group comprise that the mode of at least one sequence of every kind of length carries out grouping.By such operation, if sequence set is assigned to same sub-district or Node B, the UE that then can support to be positioned at this sub-district or Node B adopts the reference signal sequence of every kind of length.But can define concrete group technology by different modes.

At first, distributing to the quantity of the sequence of a group can be proportional with the quantity corresponding to the RB of reference signal sequence length.Among Fig. 3, a sequence of 1RB length sequences, two sequences of 2RB length sequences, three sequences of 3RB length sequences etc. are made up.

Secondly, the quantity that is assigned as one group sequence can be constant.Among Fig. 4, it is same group with a sequence of packets of every kind of RB length sequences.

Equally, present embodiment can be defined as by this way and carry out grouping, that is, be assigned to one group sequence quantity neither with the proportional constant that also do not keep of sequence length.Fig. 5 shows the example of by this way sequence being divided into groups, and is about to two sequences of two sequences, 3RB length sequences of a sequence, the 2RB length sequences of 1RB length sequences and three sequences of 4RB length sequences etc. and is grouped into one group.

With top similar,, then can define the maximum quantity of every group sequence if each group comprises at least one sequence of every kind of RB length.When the maximum quantity of sequence that defined every group, can in the sequence quantitative limits, select the method for the root index of ZC sequence be defined as follows.

If every kind of RB length sequences is selected a sequence, and if at this group selection index be S ₁With length be N ₁A particular sequence, then can every kind RB length select a sequence (have index S ₂), wherein this index makes (S ₂/ N ₂-S ₁/ N ₁) near 0, N wherein ₂It is the corresponding sequence length of RB length with this consideration.Simultaneously, if every specific RB length sequences has been selected two sequences, and if at this group selection index be S ₁With length be N ₁A particular sequence, then can select two sequences so that (S to this RB length ₂/ N ₂-S ₁/ N ₁) near 0.This can further reduce the maximal sequence quantity " x " of every kind of RB length.

Equally, another kind of group technology can be defined as follows.If every kind of RB length sequences is selected a sequence, and if at this group selection index be S ₁With length be N ₁A particular sequence, then at first make (S ₂/ N ₂-S ₁/ N ₁) select the sequence of specific quantity (y) in the middle of the sequence near particular value, then, from this y sequence, select and index is S ₁Sequence have a sequence of high cross-correlation relation.Simultaneously, if every specific RB length sequences is selected two sequences, and if at this group selection index be S ₁With length be N ₁A particular sequence, then at first make (S ₂/ N ₂-S ₁/ N ₁) the sequence of item near particular value in the middle of select the sequence of specific quantity (y), then, from this y sequence, select and index is S ₁Sequence have two sequences of high cross-correlation relation.This can further reduce the maximal sequence quantity " x " of every kind of RB length.

In above-mentioned example, at first having selected index is S ₁With length be N ₁A particular sequence, and this particular sequence becomes the benchmark of selecting all the other sequences.This consensus sequence can be defined as the sequence of 1RB length, the sequence of 2RB length, the sequence of 3RB length etc.But in the following description, we suppose that consensus sequence is the sequence of 3RB length.Therefore simultaneously, because the quantity of the sequence index of every 3RB length is 30, the quantity according to the group that sequence is divided into groups of this execution mode of the present invention can be 30.

The quantity of root index of considering the sequence of 3RB length is 30, and the quantity of the root index of selecting at particular group can be determined as follows:

[formula 13]

Round (quantity/30 of the root index of the sequence of specific RB length)

Here, " round (z) " is rounded to (round off) near the function of the nearest integer of z.

Through type 13 can be selected a sequence for 3RB length and 4RB.Simultaneously can select two sequences for 5～6RB length.In addition, can select 3 or more a plurality of sequence respectively for length greater than 6RB length.Simultaneously, according to an embodiment of the invention, can to length less than the sequence of 3RB length define by different way (such as, do not use the ZC sequence).By such operation, the quantity of the sequence selected at 1RB length and 2RB length can be defined as 1.

In a word, according to present embodiment, the quantity of every group of sequence can be defined as follows

[formula 14]

{1RB，2RB，3RB，4RB，5RB，6RB，8RB，9RB，10RB，12RB，15RB，16RB，18RB，20RB，24RB，25RB，...}＝{1，1，1，1，2，2，3，3，4，5，6，6，7，8，9，9，...}

Based on this, following table 1～5 shows by each group and comprises the example of carrying out sequence of packets according to the mode of the quantity of the sequence of formula 14, and simultaneously, the sequence of every group selection satisfies above-mentioned high cross-correlation relation.

[table 1]

[table 2]

[table 3]

[table 4]

[table 5]

In table 1～5, because defined 1RB length and 2RB length by different way, so the sequence of 1RB length and 2RB length is not shown.

Simultaneously, in other example, consider that the quantity of root index of the sequence of 3RB length is 30, the quantity of the root index that can select at particular group is determined as follows.

[formula 15]

Floor (quantity/30 of the root index of the sequence of specific RB length)

Here, floor (z) is the function that obtains being not more than the maximum integer of z.

Through type 15 can be selected a sequence for 3RB～5RB length.Simultaneously can select two sequences for 6～8RB length.In addition, for length, can select 3 or more a plurality of sequence respectively greater than 9RB length.Simultaneously, according to an embodiment of the invention, can to length less than the sequence of 3RB length define by different way (such as, do not use the ZC sequence).By such operation, the quantity of the sequence selected at 1RB length and 2RB length can be defined as 1.

In a word, according to present embodiment, the quantity of every group of sequence can be defined as follows:

[formula 16]

{1RB，2RB，3RB，4RB，5RB，6RB，8RB，9RB，10RB，12RB，15RB，16RB，18RB，20RB，24RB，25RB，...}＝{1，1，1，1，1，2，2，3，3，4，5，6，7，7，9，9，...}

Based on this, following table 6～8 shows by each group and comprises the example of carrying out sequence of packets according to the mode of the quantity of the sequence of formula 16, and simultaneously, the sequence of every group selection satisfies above-mentioned high cross-correlation relation.

[table 6]

[table 7]

[table 8]

Similar with table 1～5, in table 6～8, because defined 1RB length and 2RB length by different way, so the sequence of 1RB length and 2RB length is not shown.

In other execution mode of the present invention, because a variety of causes can pre-determine the maximum quantity of every group sequence.Following table 9 and 10 shows the example when the maximum quantity with every group sequence is restricted to 5 sequences.

[table 9]

[table 10]

Simultaneously, in other example, the maximum quantity of sequence can be pre-determined is 4.Following table 11 and 12 shows this situation.

[table 11]

[table 12]

Simultaneously, in other example, the maximum quantity of sequence can be pre-determined is 3.Following table 13 and 14 shows this situation.

[table 13]

[table 14]

Simultaneously, in other example, the maximum quantity of sequence can be pre-determined is 2.Following table 15 and 16 shows this situation.

[table 15]

[table 16]

Simultaneously, in other example, the maximum quantity of sequence can be pre-determined is 1.Following table 17 shows this situation.

[table 17]

Consider the complexity of structure and support UE to use the flexibility of the reference signal sequence of variable-length, an embodiment of the invention propose to carry out as follows the example of grouping, promptly each group comprise with 1 to 5RB length in the corresponding basic sequence of every kind of length and with 6RB or corresponding two basic sequences of every kind of length in the length more.This is corresponding to table 15 and table 16.

Here, basic sequence means that it is employed and the corresponding cyclic shift of various cyclic shift value by the ZC sequence of root index indication.Simultaneously, the basic sequence of having carried out cyclic shift can be used as reference signal sequence.

Last table 1～17th is when utilizing (S ₁/ N ₁-S ₂/ N ₂) situation when selecting (a plurality of) root index.But in other execution mode of the present invention, can select the root index by the cross correlation value computing of reality.Under table 18～20 corresponding to table 6～8, different is to select the root index by the cross correlation value computing of reality.

[table 18]

[table 19]

[table 20]

In this case, be 5 if the maximum quantity of the sequence of each group is pre-determined, then can shown in following table 21 and 22, carry out grouping.Table 21 and 22 also is a situation of selecting basic sequence by the computing cross-correlation of reality.

[table 21]

[table 22]

In other example, be 4 if the maximum quantity of the sequence of each group is pre-determined, then can shown in following table 23 and 24, carry out grouping.Table 23 and 24 also is a situation of selecting basic sequence by the computing cross-correlation of reality.

[table 23]

[table 24]

In other example, be 3 if the maximum quantity of the sequence of each group is pre-determined, then can shown in following table 25 and 26, carry out grouping.Table 25 and 26 also is a situation of selecting basic sequence by the computing cross-correlation of reality.

[table 25]

[table 26]

In other example, be 2 if the maximum quantity of the sequence of each group is pre-determined, then can as shown in table 27 belowly carry out grouping.Table 27 also is a situation of selecting basic sequence by the computing cross-correlation of reality.

[table 27]

In other example, be 1 if the maximum quantity of the sequence of each group is pre-determined, then can as shown in table 28 belowly carry out grouping.Table 28 also is a situation of selecting basic sequence by the computing cross-correlation of reality.

[table 28]

For above-mentioned situation, can come his-and-hers watches to recombinate according to the quantity of the sequence of every group and every kind length allocation.

For other example of the present invention, above each table can be expanded to the length of 100RB, following table shows this example.In this example, (v) be set to 1, the maximum quantity of root index number that will be longer than 5RB length (v) is set to 2 simultaneously with 5RB length or less than the maximum quantity of the root index number of 5RB length.

[table 29]

[table 30]

[table 31]

[table 32]

Based on these notions, the invention provides the following ZC sequence of utilizing and generate the method for reference signal sequence.

In order to generate reference signal sequence, an embodiment of the invention have defined the specific basic sequence that is used to the application cycle displacement.In this execution mode, utilize ZC sequence to define basic sequence with specific root index (after this, being called " q ").Simultaneously, select specific basic sequence from basic sequence set, each basic sequence set comprises the basic sequence with above-mentioned high cross-correlation relation.Therefore, if plan to select to have the specific basic sequence of index " q ", should consider that then the basic sequence number index (after this, being called " v ") in group index (after this, being called " u ") and each group is selected " q ".That is to say that " q " should be the function of " u " and " v ".

Simultaneously, after having selected to have the specific basic sequence of root index " q ", can use and the corresponding cyclic shift of various cyclic shift value selected basic sequence then.

If more specifically consider the relation between " q ", " u " and " v ", then can obtain " q " by following formula.Following formula 17 and formula 18 are used to select index " q " to satisfy (S ₁/ N ₁-S ₂/ N ₂) item approaches 0 condition.

[formula 17]

$q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

[formula 18]

$q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

Here, N _ZC ^RSBe the target ZC sequence generation length that is used to generate q ZC root sequence (root ZC sequence), by specifying N less than the largest prime number of corresponding reference signal sequence size _ZC ^RSThat is to say, generate basic sequence by the cyclic extensions method.

Simultaneously, N _{Reference, ZC} ^RSBe by length (for example, 3RB length) less than the largest prime number appointment of reference sequences size.If divide into groups based on 3RB length, then N _{Reference, ZC} ^RSBe 31." round (z) " is the function that is rounded near the nearest integer of z.Floor (z) is the function that obtains being not more than the maximum integer of z.

Simultaneously, according to another embodiment of the present invention,, then can specify N by minimum prime number greater than the corresponding reference signal sequence size if generate the ZC sequence based on truncation method _ZC ^RSAnd, in this case, N _{Reference, ZC} ^RSCan be by length (for example, 3RB length) greater than the minimum prime number appointment of reference sequences size.If divide into groups based on 3RB length, then N _{Reference, ZC} ^RSBe 37.

Simultaneously, according to " m " individual element (x of the individual ZC sequence of formula 17 and 18, the " q " _q(m)) can be expressed as follows:

[formula 19]

$x_q\left(m\right)=e^{-j\frac{\mathrm{\&pi;qm}(m+1)}{N_{\mathrm{ZC}}^{\mathrm{RS}}}},0\&le;m\&le;N_{\mathrm{ZC}}^{\mathrm{RS}}-1$

Because " round (y) " in fact equates with " floor (y+0.5) ", so formula 17 and 18 has identical implication.In formula 17 and 18, (1) ^{Floor (round (y)-y)}If an expression " y " is 0.5 or bigger value at its decimal place place, then can be with (1) ^{Floor (round (y)-y)}Be calculated as " 1 ", and if " y " is the value less than 0.5 at its decimal place place, then can be with (1) ^{Foor (round (y)-y)}Be calculated as " 1 ".Therefore, can use (1) ^{Floor (y-round (y))+1}Any other equivalence item that perhaps has identical meanings replaces (1) ^{Floor (round (y)-y)}

In above-mentioned example, when based on 3RB length when carrying out grouping greater than the length of 3RB length, simultaneously when generating the ZC sequence based on the cyclic extensions method, N _{Reference, ZC} ^RSCan be 31.Equally, when generating the ZC sequence based on truncation method, N _{Reference, ZC} ^RSCan be 37.Equally, when based on 4RB length when carrying out grouping greater than the length of 4RB length, simultaneously when generating the ZC sequence based on the cyclic extensions method, N _{Reference, ZC} ^RSCan be 47.Equally, when generating the ZC sequence based on truncation method, N _{Reference, ZC} ^RSCan be 49.And, can easily this method be applied to other grouping based on length.

Can through type 17 and formula 18 obtain above-mentioned table.Following example is the part according to formula 17 and formula 18 selection root index.

At first, if N _{Reference, ZC}=31, then when 1) N _Zc=47,2) N _Zc=71,3) N _Zc, select the method for first group (" u "=0) as follows at=211 o'clock.In following example, used formula 18.

1)N _{reference，ZC}＝31， $N_{\mathrm{ZC}}^{\mathrm{RS}}=47,$ U＝0，V＝0；y＝47/31，

Therefore, for 4RB length, the first basic sequence number (v=0) in first group (u=0) is 2 (q=2).

2)N _{reference，ZC}＝31， $N_{\mathrm{ZC}}^{\mathrm{RS}}=71,$ U＝0，V＝0；y＝71/31，

Therefore, for 6RB length, the first basic sequence number (v=0) in first group (u=0) is 2 (q=2).

3)N _{reference，ZC}＝31， $N_{\mathrm{ZC}}^{\mathrm{RS}}=211,$ U＝0，V＝0；y＝211/31，

Therefore, for 18RB length, the first basic sequence number (v=0) in first group (u=0) is 7 (q=7).

For above-mentioned situation, selected index (q) is corresponding to the data that generate based on 3RB length in table 6～8.

In other example, if N _{Reference, ZC}=47 (based on the 4RB length) are then when 1) N _Zc=59,2) N _Zc=107,3) N _Zc, be used to select the method for second group (" u "=1) as follows at=139 o'clock.In following example, used formula 18.

1)N _{reference，ZC}＝47， $N_{\mathrm{ZC}}^{\mathrm{RS}}=59,$ U＝1，V＝0；y＝59/47*2，

Therefore, for 5RB length, the first basic sequence number (v=0) in second group (u=1) is 3 (q=3).

2)N _{reference，ZC}＝47， $N_{\mathrm{ZC}}^{\mathrm{RS}}=107,$ U＝1，V＝0；y＝107/47*2，

Therefore, for 9RB length, the first basic sequence number (v=0) in second group (u=1) is 5 (q=5).

3)N _{reference，ZC}＝47， $N_{\mathrm{ZC}}^{\mathrm{RS}}=139,$ U＝1，V＝0；y＝139/47*2，

Therefore, for 12RB length, the first basic sequence number (v=0) in second group (u=1) is 6 (q=6).

In other execution mode of the present invention, can replace formula 17 and formula 18 as follows.

[formula 20]

$q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

[formula 21]

$q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

Because " round (y) " is in fact equal with " floor (y+0.5) ", therefore, formula 20 has identical implication with formula 21.

In other execution mode of the present invention, can replace formula 17 and formula 18 as follows.

[formula 22]

$q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein $y=\mathrm{round}\left(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}\right)\&CenterDot;(u+1),u\&Element;\{\mathrm{0,1},...,29\},$ $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

[formula 23]

$q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein $y=\mathrm{floor}(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}+0.5)\&CenterDot;(u+1),u\&Element;\{\mathrm{0,1},...,29\},$ $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

These formulas are corresponding to the various group technologies that describe at above-mentioned table.

If can be grouped in that the maximum quantity of one group sequence pre-determines is 2, then can simplify formula 17-18, formula 20-21 and formula 22-23 as follows respectively.

[formula 24]

q＝round(y)+v·(-1) ^floor(2y)

Wherein $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}，v?∈{0，1}

[formula 25]

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein $y=\frac{N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}，v?∈{0，1}

[formula 26]

q＝round(y)+v·(-1) ^floor(2y)

Wherein $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},$ u∈{0，1，...，29}，v∈{0，1}

[formula 27]

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein $y=\frac{(N_{\mathrm{zc}}^{\mathrm{RS}}-1)\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}-1},$ u∈{0，1，...，29}，v∈{0，1}

[formula 28]

q＝round(y)+v·(-1) ^floor(2y)

Wherein $y=\mathrm{round}\left(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}\right)\&CenterDot;(u+1),$ u∈{0，1，...，29}，v∈{0，1}

[formula 29]

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein $y=\mathrm{floor}(\frac{N_{\mathrm{zc}}^{\mathrm{RS}}}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}+0.5)\&CenterDot;(u+1),$ u∈{0，1，...，29}，v∈{0，1}

Formula 17-18, formula 20-21 and formula 22-23 are used for selecting to satisfy (S ₁/ N ₁-S ₂/ N ₂) item approaches the ZC root index of 0 condition.And formula 24-29 is used for selecting ZC root index under the maximum quantity with every group of sequence of every kind of length is restricted to 2 situation.

But, if we further conclude these formulas so that (S ₁/ N ₁-S ₂/ N ₂) approach particular value (T), then can obtain following formula.In this case, value " T " can be 0,1/2 ,-1/2,1/3 ,-1/3.Value " T " can have other value in addition.

In the formula below, formula 30 and formula 31 are used for can having selection ZC root index under the peaked situation at the maximum quantity of every group of sequence of every kind of length.And formula 32 and formula 33 are used for maximum quantity in every group of sequence of every kind of length and are restricted under 2 the situation and select ZC root index.

[formula 30]

$q=\mathrm{round}\left(y\right)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{round}\left(y\right)-y)+v}$

Wherein $y=N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(T+\frac{(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}),$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

[formula 31]

$q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein $y=N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(T+\frac{(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}),$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

[formula 32]

q＝round(y)+v·(-1) ^floor(2y)

Wherein $y=N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(T+\frac{(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}),$ u∈{0，1，...，29}，v∈{0，1}

[formula 33]

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein $y=N_{\mathrm{zc}}^{\mathrm{RS}}\&CenterDot;(T+\frac{(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}}),$ u∈{0，1，...，29}，v∈{0，1}

It should be apparent to those skilled in the art that under the situation that does not break away from spirit of the present invention and inner characteristic and can realize the present invention according to other specific mode.Therefore, above-mentioned execution mode all is regarded as illustrative rather than restrictive in every respect.Scope of the present invention should be determined that all modifications that falls into simultaneously in the equivalent scope of the present invention all comprises within the scope of the invention by the reasonable explanation of claims.

[industrial Applicability A]

Between the residential quarter that the sequence of using variable length can be brought according to the embodiment of the present invention, Minimum interference. Simultaneously, if give specific residential quarter or joint with each packet by packet basis sequence allocation Point B, then UE can be used as reference signal with the sequence of variable length.

These methods are applicable to 3GPP LTE (3rd Generation Partnership Project Long Term Evolution: third generation affiliate plans Long Term Evolution) in the system. But, this area The technical staff can understand easily, these methods can be applied to the sequence of variable length is used Any radio communication system of signal sequence for referencial use.

Claims (10)

1, a kind of method of utilizing Zadof-Chu (ZC) sequence at transmit leg transmission reference signal sequence, this method may further comprise the steps:

Utilize q ZC root sequence in a plurality of basic sequences to obtain basic sequence, wherein described a plurality of basic sequences are divided into groups, and " q " is the basic sequence number index (function v) in sequence set index (u) and the sequence set;

To the basic sequence that is obtained use with the corresponding cyclic shift of variable cyclic shift value to generate described reference signal sequence; And

Described reference signal sequence is sent to the recipient.

2, method according to claim 1, wherein, the quantity of " u " is 30, and the quantity of specifying " v " based on the length of described basic sequence.

3, method according to claim 1 wherein, is determined specific ZC sequence index (q) by following formula,

$q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein, $y=\frac{N_{\mathrm{ZC}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

Wherein, N _ZC ^RSBe the ZC root sequence generation length of in generating q ZC root sequence, using, specify N by largest prime number less than the length of the basic sequence that is obtained _ZC ^RS, N _{Reference, zc} ^RSBe specific benchmark prime number, and floor (z) is the function that obtains being not more than the maximum integer of z.

4, method according to claim 1 wherein, is determined described specific ZC sequence index (q) by following formula,

$q=\mathrm{floor}(y+0.5)+\mathrm{floor}\left(\frac{v+1}{2}\right)\&CenterDot;{(-1)}^{\mathrm{floor}(\mathrm{floor}(y+0.5)-y)+v}$

Wherein, $y=\frac{N_{\mathrm{ZC}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}， $v\&Element;\{\mathrm{0,1},...,\mathrm{floor}(N_{\mathrm{ZC}}^{\mathrm{RS}}/30)-1\}$

Wherein, N _ZC ^RSBe the ZC root sequence generation length of in generating q ZC root sequence, using, specify N by minimum prime number greater than the length of the basic sequence that is obtained _ZC ^RS, N _{Reference, zc} ^RSBe specific benchmark prime number, and floor (z) is the function that obtains being not more than the maximum integer of z.

5, method according to claim 1, wherein, the maximum number of the basic sequence in each sequence set is 2, and

Wherein, determine the index (q) of described ZC sequence by following formula

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein, $y=\frac{N_{\mathrm{ZC}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}，v∈{0，1}

Wherein, N _ZC ^RSBe the ZC root sequence generation length of in generating q ZC root sequence, using, specify N by largest prime number less than the length of the basic sequence that is obtained _ZC ^RS, N _{Reference, zc} ^RSBe specific benchmark prime number, and floor (z) is the function that obtains being not more than the maximum integer of z.

6, method according to claim 1, wherein, the maximum number of the basic sequence in each sequence set is 2, and

Wherein, determine the index (q) of specific Z C sequence by following formula

q＝floor(y+0.5)+v·(-1) ^floor(2y)

Wherein, $y=\frac{N_{\mathrm{ZC}}^{\mathrm{RS}}\&CenterDot;(u+1)}{N_{\mathrm{reference},\mathrm{zc}}^{\mathrm{RS}}},$ u∈{0，1，...，29}，v∈{0，1}

Wherein, N _ZC ^RSBe the ZC root sequence generation length of in generating q ZC root sequence, using, specify N by minimum prime number greater than the length of the basic sequence that is obtained _ZC ^RS, N _{Reference, zc} ^RSBe specific benchmark prime number, and floor (z) is the function that obtains being not more than the maximum integer of z.

7, method according to claim 3, wherein, described specific benchmark prime number is 31.

8, method according to claim 5, wherein, described specific benchmark prime number is 31.

9, method according to claim 4, wherein, described specific benchmark prime number is 37.

10, method according to claim 6, wherein, described specific benchmark prime number is 37.

Images