CN103220109A - Sequence distribution in communication system, processing method and processing device - Google Patents

Abstract

The invention provides sequence distribution in a communication system, a processing method and a corresponding device. Sequences in each sequence group are divided into a plurality of sub groups; sequences in each sub group are selected from a candidate sequence set corresponding to the sub group according to certain rules; a system enables determined sequences to be distributed to cells, as for a sub group i, a function fi (.) corresponding to the sub group is determined, and a definitional domain of the function is the candidate sequence set corresponding to the sub group; and sequences of the sub group i in a sequence group k are selected from and determined by n sequences, which enable a value of a function d(fi(.), Gk) to be smaller, of the candidate sequence set, wherein the k is a group number of the sequence group, the i is a serial number of the sub group, the n is a natural number, d (a, b) is a function of two variables, and the Gk is a quantity determined by the group number k. A situation that the sequence relative to sequence strength in a certain length occurs in other sequence groups is avoided, strong interference is accordingly reduced, a form for storing large-scale sequence groups is not needed, and system complexity is reduced.

Description

Sequence allocation in the communication system, the method and apparatus of processing

Technical field

The present invention relates to the communications field, sequence allocation technology in particularly a kind of communication system.

Background technology

In communication system, a class sequence (CAZAC, constant amplitude zero auto-correlation) of normal amplitude zero autocorrelation performance is a kind of very important communication resource.Its characteristic is specially:

The mould of amplitude is a constant value, for example can be normalized to 1.

Null cycle autocorrelation, except with self correlation maximum, other cyclic shift auto-correlation of this sequence self is zero.

Because the CAZAC sequence has above-mentioned character,, also be the CAZAC sequence in the sequence of frequency domain therefore through after Fourier (Fourier) conversion.Sequence with this characteristic is suitable as the reference signal in the communication, carries out channel estimating etc.

For example, single-carrier frequency division multiple access (SC-FDMA, single carrier frequency division multiple access) in the system, in a symbol time, the unit of CAZAC sequence is launched on a plurality of subcarriers in order, if the sequence of the signal of the known emission of receiver just can be utilized the signal that receives, carry out the estimation of channel.Because the signal of emission amplitude on each subcarrier on the frequency domain equates that therefore, receiver can estimate the channel fading on each subcarrier more liberally.Simultaneously, because the normal amplitude characteristic of CAZAC sequence on time domain, the peak-to-average force ratio of transmitted waveform is less, is easy to the transmitter emission.

Again for example, the arbitrary access front signal in the SC-FDMA system can adopt the CAZAC sequence.The targeting sequencing of accidental access signal can be modulated on the subcarrier in frequency domain, transforms on the time domain by Fourier transform and launches.Like this, utilize good auto-correlation of CAZAC sequence and cross correlation, the interference ratio between different sub-districts and different users' the arbitrary access front signal is less.

Because the CAZAC signal sees it all is the CAZAC signal on time domain and frequency domain, so the CAZAC signal also can directly be modulated into the signal emission on the time domain that takies certain bandwidth.

The CAZAC sequence has a variety of, and doffer-first (Zadoff-Chu) sequence pricked in a kind of title comparatively commonly used.Except that the Zadoff-Chu sequence, also has GCL sequence (Generalized Chirplike Sequence), Milewski sequence etc.With the Zadoff-Chu sequence is example, the generating mode of Zadoff-Chu sequence, and perhaps the expression formula of Zadoff-Chu sequence is as follows:

Formula (1)

Wherein, r is the parameter that sequence generates, and is the number coprime with N, and q is an integer arbitrarily.When getting different r values, obtain different sequences.R is called the basic sequence index, the cyclic shift that q is corresponding different, and promptly the r value has determined basic sequence, the q value has determined the different cyclic shift of same basic sequence.The sequence that the different cyclic shifts of a sequence generate is called the cyclically shifted sequences that is generated by same basic sequence.For two different r values, r=u for example, r=v, when (u-v) and N were coprime, the cross-correlation of these two sequences was very little, has good cross correlation.When N itself is a prime number, r=1,2 ..., N-1 has generated N-1 different CAZAC sequence, and the cross correlation between these sequences is fine.In the top example, when N was prime number, the absolute value of normalized cross-correlation was between two sequences The conjugation of Zadoff-Chu sequence also is the CAZAC sequence.

In common cellular communication system, when a cell selecting after the emission of sequence modulation, the another one sub-district will select another to have the sequence of low their cross correlation.For example: when using the Zadoff-Chu sequence, when N is a prime number, the r value that different cell selecting is different can guarantee to hang down cross-correlation, disturbs less.

The modulation signal of sub-district emission can also adopt the fragment of former sequence, and perhaps circulation repeats, and also can keep the good auto-correlation of former sequence and the characteristic of cross-correlation basically.Particularly, when the number of subcarrier of carrying sequence is not a prime number in the sub-district, just choose the sequence of the prime number length around this subcarrier number,, launch then by blocking or sequence that the method for cyclic extension obtains wanting of sequence.Below description in, omitted blocking or the operation of cyclic extension to sequence.

When the signal of a plurality of sequences of different districts emission takies identical running time-frequency resource, with reference to figure 1, the sequence of sub-district A and sub-district B emission has equal length.For example, can select length is two different Zadoff-Chu sequences of prime number N, the basic sequence index of two sequences not simultaneously, the correlation of two sequences is lower, so the interference ratio between the transmitting of different districts is less.

With reference to figure 2, when the signal of the sequence of modulating takies different running time-frequency resources, the certain user of sub-district A is the signal of transmitting sequence modulation on the Radio Resource of B1 in bandwidth, synchronization, the certain user of sub-district B is the signal of transmitting sequence modulation on the Radio Resource of B2 in bandwidth, and two-part running time-frequency resource overlaps.There is the same sub-carrier width each sub-district in Fig. 2 system, 36 subcarriers are arranged in the B1 bandwidth, 144 subcarriers are arranged in the B2 bandwidth, because sequence is mapped on the subcarrier, the length correspondence of subcarrier the length of sequence, then obvious two sub-districts need to select the sequence of different length separately.At this moment, long sequence may take place disturb more intense situation mutually with short sequence.The planning of sequence has just become relative complex.The sequence of having only two kinds of length in the example of Fig. 2, the different Radio Resource that takies according to user's emission in the reality varies in size, and the sequence of different length is more, and complexity is very high.

The above-mentioned modulation signal that takies the sequence of different running time-frequency resources often takes place in the SC-FDMA system.Because the channel estimating that sequence as the reference signal, provides data demodulates to need is launched so be accompanied by the bandwidth resources of data.And the user's data bandwidth often is carved with different bandwidth and position when the difference according to certain scheduling rule, therefore, the sequence of the reference signal of different districts takies the mode of running time-frequency resource, also can time changing, and cause the interference of each minizone to be subjected to the influence of different length serial correlation.And even more serious be, because system can utilize the displacement correlation properties of sequence usually, obtain the orthogonal sequence of a plurality of yards branches by being shifted different circulation timei, distribute to different users, in case between the sequence of two kinds of length strong jamming has taken place, using so can mutual strong jamming between the user of sequence of these two kinds of length.

Certainly, the sequence mode that takies running time-frequency resource is not limited to top example.For example, can also modulate the sequence of different length, the problem of correlation between the length sequence then also can occur with same sample frequency on time domain.Can also be that sequence takies subcarrier in frequency domain with different subcarrier spacings, perhaps with the different time sampling point situation of holding time sampled point at interval.In other words, sequence is not to be modulated on all subcarrier/sampled points, but above fixed number subcarrier/sampled point is modulated at.

In sum, when sequence takies running time-frequency resource by different way, the problem relative complex of the interference between the sub-district.Especially, when having the sequence of different length, not only to plan respectively, also will consider the interfering problem between length is different in multi-cell system the sequence the sequence of every kind of length.

Summary of the invention

The technical problem that the present invention will solve provides the method and apparatus of the sequence allocation in a kind of communication system, avoids the sequence that takies different running time-frequency resources between the different sequence set to produce strong jamming.

Another problem that the present invention will solve is: the method and apparatus of the series processing in a kind of communication system is provided, need not to store the restored list that the sequence of sequence set to be allocated constitutes, thereby save the communication resource.

For addressing the above problem, embodiment of the present invention provides the method for sequence allocation in a kind of communication system, and this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the above-mentioned method of choosing is specially: the sequence among the child group i among the sequence set k is by making function d (f in the described collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence chosen formation, and wherein, k is the group number of sequence set, i is the sequence number that son is organized, n is a natural number, (a b) is a binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of son group i correspondence, and this domain of function is the described collection of candidate sequences of this child group i correspondence;

Described sequence set is distributed to sub-district/user/channel.

The embodiment of the invention also provides a kind of method of handling sequence, and this method comprises:

The group number k of the sequence set that receiving system is distributed;

By selecting to make function d (f in the collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein i be the sub sequence number of organizing, and n is a natural number, (a b) is binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of son group i correspondence, and this domain of function is the described collection of candidate sequences of this child group i correspondence;

Generate corresponding sequence according to the sequence in the child group that constitutes, on the running time-frequency resource of child group i correspondence, launch or receive.

The embodiment of the invention also provides a kind of series processing device, and this device comprises

Sequence selection unit: be used for the group number k of the sequence set that receiving system distributes, select to make in the collection of candidate sequences function d (f _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein i be the sub sequence number of organizing, and n is a natural number, wherein (a b) is a binary function to d, and k is the group number of sequence set, G _kBe an amount of determining by group number k, function f _i() is the function of son group i correspondence, and this domain of function is the described collection of candidate sequences of this child group i correspondence;

Series processing unit: be used for generating corresponding sequence, and on the running time-frequency resource of child group i correspondence, handle according to the sequence of the described son group i that constitutes.

The embodiment of the invention also provides the method for sequence allocation in a kind of communication system, and this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the above-mentioned method of choosing is specially: at least to a sequence set k, and at least two son group i wherein, the sequence of j is by making function d (f in the described collection of candidate sequences _i(), f _j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is a natural number, d (f _i(), f _j()) be a binary function, function f _i() or f _j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence;

Described sequence set is distributed to sub-district/user/channel.

The embodiment of the invention also provides the processing unit of sequence in a kind of communication system, and this device comprises:

The second sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, at least two son group i among the described sequence set k, the sequence of j is by making function d (f in the collection of candidate sequences corresponding with this child group _i(), f _j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is a natural number, d (f _i(), f _j()) be a binary function, function f _i() or f _j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence;

The second series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.

The method that the embodiment of the invention also provides a kind of communication sequence to distribute, this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, described collection of candidate sequences specifically is the time of basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that cyclically shifted sequences takies with respect to the distance of reference running time-frequency resource position;

Described sequence set is distributed to sub-district/user/channel.

The embodiment of the invention also provides the processing unit of sequence in a kind of communication system, and this device comprises:

The 3rd sequence selection unit: the group number k that is used for the sequence set of receiving system distribution, from the collection of candidate sequences corresponding, choose the sequence that obtains in each son group with this child group, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position;

The 3rd series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.

The embodiment of the invention also provides the method for sequence allocation in a kind of communication system, and this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the method of above-mentioned generation is specially: the sequence in the group group need carry out that cyclic shift expands or when blocking, take the method that symmetry expands or symmetry is blocked to the sequence in the collection of candidate sequences;

Described sequence set is distributed to sub-district/user/channel.

In above-mentioned sequence allocating method, emission, method of reseptance and the device, the sequence in each sequence set is divided into a plurality of son groups, the mode that the corresponding a kind of running time-frequency resource of each son group takies; Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the correlation of the sequence between the rule of choosing has guaranteed not on the same group is lower, make like this disturb between the different sequence of length little.On the other hand, in each method and apparatus of the present invention, the method that receives or choose by calculating emission the time is determined sequence, does not therefore need to store the form that the sequence of large-scale sequence set constitutes, thereby has reduced the complexity of system.

Description of drawings

The emission of different districts sequence takies identical running time-frequency resource in Fig. 1 prior art, uses the schematic diagram of equal length sequence;

The different districts transmitting sequence takies partly overlapping running time-frequency resource in Fig. 2 prior art, uses the schematic diagram of the different sequence of length;

Fig. 3 is the schematic flow sheet of launching technique in the embodiment of the present invention;

Fig. 4 is u in the embodiment of the present invention, the computational process schematic diagram that v determines;

Fig. 5 is the structural representation of emitter in the embodiment of the present invention;

Fig. 6 is the schematic flow sheet of method of reseptance in the embodiment of the present invention;

Fig. 7 is the schematic flow sheet of receiving system in the embodiment of the present invention;

Fig. 8 is the schematic diagram of non-centrosymmetry running time-frequency resource occupancy mode in the embodiment of the present invention;

Fig. 9 is the schematic diagram of center symmetry running time-frequency resource occupancy mode in the embodiment of the present invention;

The schematic diagram of the running time-frequency resource occupancy mode that Figure 10 blocks for the embodiment of the present invention medium-high frequency;

The schematic diagram of the running time-frequency resource occupancy mode that Figure 11 blocks for the embodiment of the present invention medium and low frequency;

Figure 12 is the schematic diagram of the running time-frequency resource occupancy mode of embodiment of the present invention medium-high frequency cyclic extension;

Figure 13 is the schematic diagram of the running time-frequency resource occupancy mode of embodiment of the present invention medium and low frequency cyclic extension.

Embodiment

For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.

Huawei Tech Co., Ltd on December 30th, 2006, apply in State Intellectual Property Office of the People's Republic of China, still undocumented Chinese patent application number is in 200610173364.5 the patent application, a kind of technical scheme is provided, can have utilized the method for sequence of packets to solve the interference problem of the sequence that different running time-frequency resource occupancy modes causes.This method is: the interior sequence of group is made up of a plurality of sequences of the different running time-frequency resource occupancy modes of correspondence; The sequence that will have strong correlation is classified as a group, and the correlation between on the same group is not relatively low, carries out the distribution of sequence set then in the minizone and uses.Because the sequence that strong correlation occurs is all in same group, and the sequence in same group is only used in this sub-district, correlation is lower between the sequence set that different districts uses, and occurs strong correlation when having avoided different districts to use the different sequence of length like this.

The sequence that will have strong correlation is classified as a group, and general way can be stored the formation of all sequences of each group.When a community user or channel will use certain sequence of certain the running time-frequency resource occupancy mode of correspondence in the sequence set of distributing to oneself, in the corresponding sequence set of storage, find out the sequence of use.But the formation of sequence set needs a form that prestores, and when the scale of sequence set became big, this storage will take very large space, and searched also very time-consuming.These extra storages have increased complexity, have wasted hardware resource.

Embodiment one

In the specific embodiment of the invention, system distributes to sub-district/user/channel with sequence set, and wherein, the sequence in each sequence set is divided into a plurality of sequence groups; The mode that the corresponding a kind of running time-frequency resource of each sequence group takies, mode that running time-frequency resource takies in the communication system and sequence group are corresponding one by one; Sequence in each son group is chosen generation according to certain rule from the collection of candidate sequences of this height group correspondence.User or channel be according to sequence set of being distributed and the concrete running time-frequency resource occupancy mode that transmits that adopted, and selects sequence in the sequence group of the running time-frequency resource occupancy mode correspondence that transmits in the sequence set of distribution and launch or receive.

Above-mentioned certain rule is specially: for any one son group i, determine a corresponding function f of son group _i(), this domain of function are the collection of candidate sequences of this child group correspondence; Wherein by making function d (f in this collection of candidate sequences _i(), G _k) value in minimum, inferior minimum so that n less sequence determined the sequence among the child group i among the sequence set k, and wherein, i is the sequence number that son is organized, and k is the group number of sequence set, and n is a natural number, (a b) is a binary function, G to d _kIt is an amount of determining by group number k.This rule is from collection of candidate sequences selects n sequence, makes the d (f of all other sequences _i(), G _k) all than the d (f of this n sequence _i(), G _k)) big.

Below with the Zadoff-Chu sequence a in the CAZAC sequence _{R, N}(z) rule of above-mentioned sequence allocation is described for example:

Each sequence set is made up of M son, son group 1,2, and .., the collection of candidate sequences of M is respectively that length is N ₁, N ₂..., N _MThe Zadoff-Chu sequence.Wherein, length is N _iThe Zadoff-Chu sequence

Total N _i-1 different basic sequence is by r _i=1,2 ..., N _i-1 determines.Concrete, son group i (is that length is N _iThe child group i of Zadoff-Chu sequence correspondence) corresponding function is

This domain of function is the collection of candidate sequences of this child group i correspondence, wherein r _iBe the index of Zadoff-Chu sequence in this collection of candidate sequences, N _iBe the length of the Zadoff-Chu sequence in this collection of candidate sequences.

To sequence set k=1,2 ..., choose label p ₁The child group as with reference to son group, define aforementioned G _kFor

N _P1Be the length with reference to son group sequence, c _kDetermine by sequence set k

The basic sequence index of long sequence.Especially, can choose c _k=k, then G _kFor

If aforementioned functions d (a b) is defined as | and a-b|, so, the label among the sequence set k is p ₁The child group in satisfy Minimum sequence is meant and is designated as

, length is

Sequence At this moment

The sequence of child group i=m among the sequence set k is that length is N _m, satisfy

Minimum, inferior minimum, so that n less sequence, promptly satisfied

A less n sequence, n is the natural number that depends on k and m.

Above-mentioned execution mode also illustrates at least a sequence set k, at least two son group i wherein, the sequence of j, as above i=m, j=p ₁, by making function d (f in the described collection of candidate sequences _i(), f _j()), as above Value in minimum, inferior minimum, so that n less sequence chosen generation, n is the natural number that depends on k, i, j.

Below, be example with non-CAZAC sequence again, introduce present embodiment.For example Gauss (Gauss) sequence also has good auto-correlation and their cross correlation.The generation formula of Gauss sequence is:

$b_{{\mathrm{\α}}_l,{\mathrm{\α}}_{l-1},...,{\mathrm{\α}}_0}\left(n\right)=\exp (-2\mathrm{\πj}({\mathrm{\α}}_l{n}^l+{\mathrm{\α}}_{l-1}{n}^{l-1}+...+{\mathrm{\α}}_0)),n=\mathrm{0,1,2},...,N$ Formula (2)

N in the formula (2) ^lBe the higher order term of Gauss sequence, l is high-order.When l=2, can get α ₂=r/N, wherein N is an integer.Work as N=2N ₁, a ₁=r (N ₁Mod2)/during N+2r/Np, it is r that the Gauss sequence is equivalent to index, N ₁The Zadoff-Chu sequence

When l＞2, different a _l=r/ (Nl), r=1,2 ..., the Gauss sequence set that N-1 is corresponding different, every group has a plurality of sequences, by the low order factor alpha _L-1, α _L-2... determine that at this moment the Gauss sequence is not the CAZAC sequence, but have good auto-correlation and their cross correlation equally.Use a in the embodiment of the present invention _{R, N}(n) expression α _lA plurality of sequences of=r/ (lN)

One of them sequence definition is a basic sequence.

To Gauss sequence a _{R, N}(z), the function of son group i correspondence is for being defined as

This domain of function is the collection of candidate sequences of this child group i correspondence, wherein r _iBe the index of Gauss sequence in this collection of candidate sequences, N _iBe the length of the Gauss sequence in this collection of candidate sequences.

The function d of Gauss sequence correspondence (a, b) can be d (a, b)=| (a-b) modu1|, wherein modu1 operation be defined as the value that makes behind the mould belong to (1/2,1/2].

Especially, for Zadoff-Chu sequence (special case that is equivalent to the Gauss sequence), as basic sequence index r=-(N-1)/2 ... ,-1,0,1 ..., (N-1)/2 o'clock, because | a-b|＜1, therefore can not adopt this modu1 operation.

But to general Gauss sequence, r=1 for example, 3,5 ..., N ₁-2, N ₁+ 2 ..., 2N ₁-1, N=2N ₁, l=2, α ₂=r/ (2N ₁), α ₁=0, The Gauss sequence, just need to adopt d (a, b)=| (a-b) modu1|.Be α ₂=r _i/ (2N _i) corresponding sequence and α ₂=r _j/ (2N _j) d (f of corresponding sequence _i, f _j) be $d(f_i,f_j)=|r_i/N_i-r_j/N_{\mathrm{<figure-callout\; id="1"\; label="j\; mod\; u"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">j</figure-callout>}}\mathrm{mod}u1|=\left|\frac{(r_i{N}_j-r_j{N}_i)\mathrm{mod}u{N}_i{N}_j}{N_i{N}_j}\right|,$ ModuN wherein _iN _jOperation is defined as the value that makes behind the mould and belongs to (1/ (2N _iN _j), 1/ (2N _iN _j)].When l=3, α ₃=r _i/ (3N _i) corresponding sequence and α ₃=r _j/ (3N _j) d (f of corresponding sequence _i, f _j) be d (f _i, f _j)=| (r _i/ N _i-r _j/ N _j) modu1|, l=4,5, similarly handle during ...

The Gauss sequence can also have another definition mode, works as α _l=r _iDuring/N, use

The Gauss sequence that expression is corresponding, the then aforementioned f of function _iBe defined as

Function d (a, b) be defined as d (a, b)=| (a-b) modu1/l|, wherein modu1/l operation makes-1/ (2l)＜(a-b) modu1/l≤1/ (2l).Then the sequence set of the definition of two kinds of Gauss sequences generation is identical.

In another embodiment, the mode that running time-frequency resource takies is that sequence modulation is that then this function that is spaced apart the child group correspondence of s is on the Radio Resource of s at subcarrier spacing (or time-domain sampling is at interval):

Wherein s is subcarrier (or time-domain sampling) gap size of Radio Resource.To the Gauss sequence, function is

L is the high-order in the Gauss sequence.

The above-mentioned group with reference to son set according to multiple factor, can select the child group of some sequence lengths, as reference group.Preferable, can selective system in the child group of sequence length minimum as with reference to the son group.The number of the available sequences group in the system is identical with sequence number under this length, and therefore short sequence can not repeat in different sequence set.For example, if be 11 according to the shortest sequence length of resource occupation mode correspondence in the system, then in the said method

At this moment, there are 10 sequence set available in the system.

Also can choose the longest child group of sequence length in the sequence set for reference to the son group.For example, maximum length sequence length is 37 in the sequence set, and selection sequence length is a sub-group of son group conduct reference of 37, at this moment

There are 36 sequence set to use.Owing to work as r ₂Satisfy-1/ (2N ₁)＜r ₂/ N ₂＜1/ (2N ₁) time, if do not limit r ₁Value be r ₁=1,2 ..., N _1-1, then make | r ₂/ N ₂-r ₁/ N ₁| minimum r ₁Be 0, and r in fact ₁Be 0 not corresponding Zadoff-Chu sequence, therefore, can remove feasible-1/ (2N ₁)＜r ₂/ N ₂＜1/ (2N ₁) r ₂, promptly need to remove r ₂=+1 ,-1, have 34 groups of sequences like this.Because sequence number the shortest in the sequence set is less than 36, the shortest sequence is used repeatedly.

In addition, reference can be a system default for child group, also can be that system sets and be notified to the user as required.After the selected sequence with reference to son group j, the sequence in the son group i then is to make d (f _i(), f _j()) less n sequence and with reference to the selected sequence of son group j, belong to same sequence set.Select different sequence, just produced different sequence set with reference to son group j.

Illustrate the sequence set that constitutes according to the method described above below.

Have 3 son groups in the present embodiment, it is 11,23 and 37 Zadoff-Chu sequence that the sequence candidates set is respectively length, three kinds of resource occupation modes of correspondence.Select

, then one have 10 sequence set.Select and make (r _m/ N _m-r ₁/ N ₁) the sequence of absolute value minimum be grouped into respectively in each sequence set, each son group has only a sequence, sequence will obtain following form with the index expression of basic sequence:

Table 1

Above group technology make r _m/ N _m-r ₁/ N ₁=(N ₁r _m-N _mr ₁)/(N ₁N _m) the absolute value minimum, promptly make N ₁r _m-N _mr ₁The absolute value minimum.By checking, the correlation between the sequence in the table 1 in each sequence set is all very high.

In the above-mentioned execution mode, aforementioned functions d (a, b) be defined as d (a, b)=| a-b| also can be defined as in other embodiments

(a, b) infinity in the definition can guarantee some sequence is removed function d.

It is pointed out that aforementioned functions Different child group to different sequence set or same-individual sequence set can be different.For example (all son groups of another one sequence set adopt another one d (a, b) function to d of all son group employings of a sequence set for a, b) function.Perhaps (another one can adopt other d (a, b) function for child group to d of a son group employing for a, b) function.

Specifically, u in the function, v get different values, just obtain different metric function.U=0 for example, v=+ ∞, perhaps u=-∞, v=0, perhaps u=-1/ (2 * 11)+1/ (23 * 4), v=1/ (2 * 11)-1/ (23 * 4), perhaps u=a, v=b, a, b determine by sequence set k and son group i, or the like.

Specific to

Above-mentioned embodiment in, when The time, present embodiment is exactly: choose feasible

Sequence be grouped into respectively in each sequence set, all satisfy between any two sequences between the different sequence set | r _i/ N _i-r _j/ N _j|＞1/C _i, N wherein _i＜N _jIt is described in detail in detail below:

First kind, u=0, v=+ ∞, perhaps u=-∞, v=0 is and makes the sequence of folk prescription to minimum.The selection positive direction, be equivalent to and get

Minimum sequence selects being equivalent to of negative direction to get

Minimum sequence.For example, be N at needed length _mThe time, calculate with Minimum positive negative test is respectively that difference is 0.036 r _mWith difference be-0.025 r ' _m, certainly, be with length

Sequence

Strongest correlation be r ' _mIf, but system's regulation choosing

The sequence of positive direction, that just selects r _m.Its beneficial effect be all lengths sequence with

The sequence that obtains relatively, their function difference between any two | r _i/ N _i-r _j/ N _j| littler.

Second kind, can also select $u=-1/\left(2N_{p_1}\right)+1/\left(4N_{p_2}\right),$ $v=1/\left(2N_{p_1}\right)-1/\left(4N_{p_2}\right),$ Wherein

Be the sequence length of short sequence,

For only greater than

Sequence length.Lifting a real example below illustrates:

Have 4 son groups in the present embodiment, the sequence candidates set is respectively N ₁=11, N ₂=23, N ₃=37, N ₄=47 Zadoff-Chu sequence, choose feasible | r _i/ N _i-k/N ₁|＜1/ (2N ₁)-1/ (4N ₂), promptly | r _i/ N _i-k/N ₁| the sequence of＜1/ (2 * 11)-1/ (4 * 23) is grouped into respectively in the child group in each sequence set, will obtain following form, and wherein sequence is with the index expression of basic sequence:

Table 2

All satisfy between any two sequences in the table 2 between the different sequence set | r _i/ N _i-r _j/ N _j|＞1/ (2N _i), N wherein _i＜N _j, the correlation between two such sequences is all lower.

The third, is to the different son group i of different sequence set k and same sequence set, u, v can be different.

With

Expression is the sequence length of short sequence,

The sequence length of expression maximum length sequence, length is

Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be

Being numbered of sequence set at basic sequence place Length is

Index be k the basic sequence place sequence set be numbered q _k, length is

Index be being numbered of sequence set at the basic sequence place of k+1

Length is

The basic sequence place the child group be numbered p ₁, length is

The basic sequence place the child group be numbered p _m, length is

The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i,

Step 1001, to sequence set q ₁Child group p ₁,

Wherein $1/N_{p_l}-1/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}+1/\left(2N_{p_1}\right)\&le;{\mathrm{\&delta;}}_u<1/2\left(N_{p_1}\right);$

To sequence set

Child group p ₁,

Wherein $-1/\left(2N_{p_1}\right)<{\mathrm{\&delta;}}_v\&le;(N_{p_l}-1)/N_{p_l}-(N_{p_1}-1)/-N_{p_1}-1/\left(2N_{p_1}\right).$

Sequence set q _kChild group p ₁

With sequence set q _K+1Child group p1

Be respectively:

$v_{q_k,{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">p</figure-callout>}}_1}=1/D,$ $u_{q_{k+1},{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">p</figure-callout>}}_1}=-1/D,$ Wherein $1/D\&le;1/\left(2N_{p_1}\right).$

Step 1002, with reference to Fig. 4, sequence set q _kChild group p _i

With sequence set q _K+1Child group p _i

I ∈ S is respectively:

${\mathrm{right}}_{q_k,p_{i-1}}=v_{q_k,p_{i-1}}+k/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ ${\mathrm{left}}_{q_{k+1},p_{i-1}}=u_{q_{k+1},p_{i-1}}+(k+1)/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}$

To sequence length be Basic sequence, according to

Different values, made And

When obtaining minimum value Promptly obtain belonging to sequence set q _K+1, length is

, the most close sequence set q _K+1Left margin

Basic sequence

When $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}}\&le;0$ The time, promptly $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}$ Less than sequence set q _kRight margin

In order to guarantee sequence set q _kBe adjacent sequence set q _K+1Between low cross correlation, $v_{q_k,p_i}=v_{q_k,p_{i-1}}+r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}};$ When $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}}>0$ The time, promptly $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}$ Greater than sequence set q _kRight margin

$v_{q_k,p_i}=v_{q_k,p_{i-1}};$

To sequence length be

Basic sequence, according to

Different values, made $r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}}\&le;0$ And $|r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}}|$ When obtaining minimum value

Promptly obtain belonging to sequence set q _k, length is

, the most close sequence set q _kRight margin

Basic sequence

When $r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}}\&GreaterEqual;0$ The time, promptly $r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}$ Greater than sequence set q _K+1Left margin

In order to guarantee sequence set q _kBe adjacent sequence set q _K+1Between low cross correlation, $u_{q_{k+1},p_i}=u_{q_{k+1},p_{i-1}}+r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}};$ When $r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}}<0$ The time, promptly

Less than sequence set q _K+1Left margin

Sequence set

Child group p _i

With sequence set q ₁Child group p _i

I ∈ S is respectively:

${\mathrm{right}}_{q_{N_{P_1}-1},p_{i-1}}=v_{q_{N_{p_1-1}},p_{i-1}}+(N_{p_1}-1)/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ ${\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}+1/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}$

${{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}=v_{q_{N_{p_1}-1},p_{i-1}}-1/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ ${{\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}}^{\&prime;}={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}+({\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}+1)/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}$

To sequence length be

Basic sequence, according to

Different values, made $r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}\&GreaterEqual;0$ And $|r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}|$ When obtaining minimum value

When ${\mathrm{<figure-callout\; id="1"\; label="r\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">r</figure-callout>}}_{q_{}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}\&le;0$ The time, $v_{q_{N_{P_1-1}},p_i}=v_{q_{N_{p_1}-1},p_{i-1}}+{\mathrm{<figure-callout\; id="1"\; label="r\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">r</figure-callout>}}_{q_{}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;};$ When ${\mathrm{<figure-callout\; id="1"\; label="r\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">r</figure-callout>}}_{q_{}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}>0$ The time, $v_{q_{N_{p_1}-1},p_i}=v_{q_{N_{p_1}-1},p_{i-1}};$

To sequence length be

Basic sequence, according to

Different values, made $r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}\&le;0$ And $|r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}|$ When obtaining minimum value

When $r_{q_{N_{p_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{{\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}}^{\&prime;}\&GreaterEqual;0$ The time, ${\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}+r_{q_{N_{p_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i_{-1}}}-{{\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}}^{\&prime;};$ When $r_{q_{N_{P_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{{\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}}^{\&prime;}<0$ The time, ${\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="HDA00002836133200022.png,HDA00002836133200041.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}};$

Especially, can get

Step 1003, sequence set q _kChild group p _i

With

I ∈ I-S is respectively:

$u_{q_k,p_i}=u_{q_k,p_m},$ $v_{q_k,p_i}=v_{q_k,p_m},$

Wherein I and S are two index sets, described set I={2 ..., l}, l are the number of the sequence length in the collection of candidate sequences, and described S set is the subclass of set I or set I, and m is the element of S set intermediate value maximum.

Get δ in the following Example _u=0, δ _v=0,

q _k=k, p _i=i.

Example one

Have 4 son groups in the present embodiment, the sequence candidates set is respectively N ₁=11, N ₂=23, N ₃=37, N ₄=47 Zadoff-Chu sequence is an example with the 4th sequence set, promptly during k=4, step 1101, obtains v _{4, i}And u _{5, i}I ∈ 1,2,3,4} is specially:

Antithetical phrase group 1, v _4,1=1/ (2 * 11), u _5,1=-1/ (2 * 11).

Antithetical phrase group 2, right _4,1=v _4,1+ 4/11=1/ (2 * 11)+4/11, left _5,1=u _5,1+ 5/11=-1/ (2 * 11)+5/11; The r that does not satisfy condition _5,1And r _4,1So v _4,2=v _4,1, i.e. v _4,2=1/ (2 * 11); u _5,2=u _5,1, i.e. u _5,2=-1/ (2 * 11).

Antithetical phrase group 3, right _4,2=v _4,2+ 4/11=1/ (2 * 11)+4/11, lefft _5,2=u _5,2+ 5/11=-1/ (2 * 11)+5/11;

To N ₂=23, change r ₂, obtain working as r _5,2=10 o'clock r _5,2/ N ₂-left _5,2＞0 and | r _5,2/ N ₂-left _5,2| obtain minimum value, because r _5,2/ N ₂-1/2 (N ₂)-right _4,2＞0, so v _4,3=v _4,2, i.e. v _4,3=1/ (2 * 11);

To N ₂=23, change r ₂, obtain working as r _4,2=9 o'clock r _4,2/ N ₂-right _4,2＜0 and | r _4,2/ N ₂-right _4,2| obtain minimum value, because r _4,2/ N ₂+ 1/ (2N ₂)-left _5,2＞0, so u _5,3=u _5,2+ r _4,2/ N ₂+ 1/ (2N ₂)-left _5,2=-1/ (2 * 11)+9/23+1/ (2 * 23)-(1/ (2 * 11)+5/11)=-21/ (2 * 11 * 23).

Antithetical phrase group 4, right _4,3=v _4,3+ 4/11=1/ (2 * 11)+4/11, left _5,3=u _5,3+ 5/11=-21/ (2 * 11 * 23)+5/11;

To N ₃=37, change r ₃, obtain working as r _5,3=16 o'clock r _5,3/ N ₃-left _5,3＞0|r _5,3/ N ₃-left _5,3| obtain minimum value, because r _5,3/ N ₃-1/ (2N ₃)-right _4,3＞0, so v _4,4=v _4,3, i.e. v _4,4=1/ (2 * 11);

To N ₃=37, change r ₃, obtain working as r _4,3=15 o'clock r _4,3/ N ₃-right _4,3＜0 and | r _4,3/ N ₃-right _4,3| obtain minimum value, because r _4,3/ N ₃+ 1/ (2N ₃)-left _5,3So＞0 u _5,4=u _5,3+ r _4,3/ N ₃+ 1/ (2N ₃)-left _5,3=-21/ (2 * 11 * 23)+15/37+1/ (2 * 37)-(21/ (2 * 11 * 23)+5/11)=-29/ (2 * 11 * 37).

The rest may be inferred, obtains the u of all son groups of all sequences group, and v obtains following table:

Table 3

Step 1102, choose and make u _{K, i}≤ (r _i/ N _i-k/N ₁)≤v _{K, i}Sequence be grouped among the child group i of sequence set k, sequence will obtain following form with the index expression of basic sequence:

Table 4

Example two

When the number of sequence set neutron group more for a long time, can find u, the calculating of v, calculate certain height group after, the u of the child group of other longer sequence, v no longer changes.Concrete, for the system bandwidth of 5M, N ₁=11, N ₂=23, N ₃=37, N ₄=47, N ₅=59, N ₆=71, N ₇=97, N ₈=107, N ₉=113, N ₁₀=139, N ₁₁=179, N ₁₂=191, N ₁₃=211, N ₁₄=239, N ₁₅=283, N ₁₆=293.With the 4th sequence set is example, i.e. k=4, v _{4, j}And u _{5, i}I ∈ 1,2,3 ..., 16} is following obtaining:

Antithetical phrase group 1, v _4,1=1/ (2 * 11), u _5,1=-1/ (2 * 11).

Antithetical phrase group 2, right _4,1=v _4,1+ 4/11=1/ (2 * 11)+4/11, left _5,1=u _5,1+ 5/11=-1/ (2 * 11)+5/11; The r that does not satisfy condition _5,1And r _4,1, so v _4,2=v _4,1, i.e. v _4,2=1/ (2 * 11); u _5,2=u _5,1, i.e. u _5,2=-1/ (2 * 11).

Antithetical phrase group 3, right _4,2=v _4,2+ 4/11=1/ (2 * 11)+4/11, left _5,2=u _5,2+ 5/11=-1/ (2 * 11)+5/11;

To N ₂=23, change r ₂, obtain working as r _5,2=10 o'clock r _5,2/ N ₂-left _5,2＞0 and | r _5,2/ N ₂-left _5,2| obtain minimum value, because r _5,2/ N ₂-1/2 (N ₂)-right _4,2＞0, so v _4,3=v _4,2, i.e. v _4,3=1/ (2 * 11);

To N ₂=23, change r ₂, obtain working as r _4,2=9 o'clock r _4,2/ N ₂-right _4,2＜0 and | r _4,2/ N ₂-right _4,2| obtain minimum value, because r _4,2/ N ₂+ 1/ (2N ₂)-left _5,2＞0, so u _5,3=u _5,2+ r _4,2/ N ₂+ 1/ (2N ₂)-left _5,2=-1/ (2 * 11)+9/23+1/ (2 * 23)-(1/ (2 * 11)+5/11)=-21/ (2 * 11 * 23).

Antithetical phrase group 4, right _4,3=v _4,3+ 4/11=1/ (2 * 11)+4/11, left _5,3=u _5,3+ 5/11=-21/ (2 * 11 * 23)+5/11;

To N ₃=37, change r ₃, obtain working as r _5,3=16 o'clock r _5,3/ N ₃-left _5,3＞0 and | r _5,3/ N ₃-left _5,3| obtain minimum value, because r _5,3/ N ₃-1/ (2N ₃)-right _4,3＞0, so v _4,4=v _4,3, i.e. v _4,4=1/ (2 * 11);

To N ₃=37, change r ₃, obtain working as r _4,3=15 o'clock r _4,3/ N ₃-right _4,3＜0 and | r _4,3/ N ₃-right _4,3| obtain minimum value, because r _4,3/ N ₃+ 1/ (2N ₃)-left _5,3So＞0 u _5,4=u _5,3+ r _4,3/ N ₃+ 1/ (2N ₃)-left _5,3=-21/ (2 * 11 * 23)+15/37+1/ (2 * 37)-(21/ (2 * 11 * 23)+5/11)=-29/ (2 * 11 * 37).

Antithetical phrase group 5, v _4,5=v _4,4, i.e. v _4,5=1/ (2 * 11); u _5,5=u _5,4, i.e. u _5,5=-29/ (2 * 11 * 37).

Antithetical phrase group 6, v _4,6=v _4,5, i.e. v _4,6=1/ (2 * 11); u _5,6=u _5,5, i.e. u _5,6=-29/ (2 * 11 * 37).

Antithetical phrase group 7, v _4,7=v _4,6, i.e. v _4,7=1/ (2 * 11); u _5,7=u _5,6, i.e. u _5,7=-29/ (2 * 11 * 37).

Further calculate and find, antithetical phrase group 8,9,10 ..., 16u, the v value also all no longer changes.

The rest may be inferred, can obtain other sequence set u of all son groups, v.By the arbitrary son group i that calculates sequence set five v is arranged _{5, i}=1/ (2 * 11), the u that obtains in conjunction with aforementioned calculation _{5, i}, choose and make u _{5, i}≤ (r _i/ N _i-5/N ₁)≤v _{5, i}Sequence be grouped among the child group i of the 5th sequence set, sequence will obtain following form with the index expression of basic sequence:

Table 5

According to above-mentioned u _{K, i}, v _{K, i}Calculating find, only calculate N ₄=47, i.e. S={2,3,4} and calculates N ₁₆=293, i.e. S=I={2,3 ..., 16} can determine identical u _{K, i}, v _{K, i}Therefore can only calculate the 4th son group, promptly adopt S={2,3,4}, the u of all son groups of acquisition all sequences group, v is to reduce amount of calculation.

The actual u that uses, v can quantize the result who obtains according to above-mentioned algorithm, to reach the precision that needs.

In the top embodiment, describedly choose n sequence, following two kinds of situations specifically arranged:

Preferable, n is 1, that is to say, in last example, selects and makes (r _m/ N _m-k/N ₁) a minimum sequence is grouped among the son group m.

Preferable, n is the natural number greater than 1, the value of n is organized N according to son _mWith reference group N ₁The length difference determine.That is to say (r _m/ N _m-k/N ₁) minimum r _mNear the sequence of several basic sequence index correspondences is grouped in the son group, general r in minimum _mNear immediate n, the selection of concrete n still will be seen N ₁, N _mThe length difference.For example, work as N _mBe N ₁4 times of left and right sides the time, just can select 2 r _mBe grouped in this group.General, can select

For example can select again Wherein

Expression is not more than the integer of the maximum of z.In the sequence group of this moment, more than one of the sequence possibility of certain length.After system distributed like this, the user was when using sequence, and any one in n the sequence can selecting to distribute launched, for example feasible (r _m/ N _m-k/N ₁) minimum, inferior minimum ..., or the like.

More excellent, n can be an amount of being determined by sequence set k and son group i.For example, n≤Q, wherein Q is for satisfying

The number of sequence,

Be the length with reference to son group sequence, c _kDetermine by sequence set k The basic sequence index of long sequence.U wherein _{K, i}=-1/ (2N ₁), v _{K, i}=1/ (2N ₁), perhaps u _{K, i}=-1/ (2N ₁)+1/ (4N ₂), v _{K, i}=1/ (2N ₁)-1/ (4N ₂), perhaps u _{K, i}=-1/2 ^θ, v _{K, i}=1/2 ^θ, θ is an integer, or the like.Work as u _{K, i}With v _{K, i}When smaller, u for example _{K, i}=-1/ (2N ₁)+1/ (4N ₂), v _{K, i}=1/ (2N ₁)-1/ (4N ₂) time, can guarantee that the correlation between any two sequences between the different sequence set is all lower.

In the concrete realization, ask feasible | r _m/ N _m-k/N ₁| minimum, inferior minimum ... r _mIndex can be generalized into general method.It is known Integer N ₁, N ₂, e, need ask integer f to make | e/N ₁-f/N ₂| the f that value is minimum, obviously f is and eN ₂/ N ₁Immediate integer w is down and rounds

Round perhaps

Less n is w ± 1, w ± 2 .....Transmitter and receiver can calculate according to this method, but not storage.

Since when the correlation of two sequences that Zadoff-Chu sequence length is different is strong, | r _m/ N _m-r ₁/ N ₁| necessarily smaller.Above distribution method in, guaranteed not two son group i on the same group, between the j sequence | r _i/ N _i-r _j/ N _j| value certain bigger, therefore, the correlation of the sequence between on the same group is not lower, disturbs little.Further, to the sequence of some length, we can therefrom choose a part and distribute, other sequence does not adopt in system, like this, can avoid appearing in other sequence set, thereby reduce strong jamming with the sequence of the sequence of organizing with reference to son time strong correlation.

In the embodiment that above-mentioned each sequence set is distributed, can carry out the generation of sequence set to the sequence of a part of running time-frequency resource occupancy mode correspondence in the system, promptly can not be whole.For example the mode that running time-frequency resource can be taken is divided into a plurality of ranks according to the length of sequence, comprises the sequence in the certain-length scope in each rank, to each other sequence of level, carries out the generation and the distribution of above-mentioned sequence set.

In the embodiment that above-mentioned each sequence set is distributed, concrete, can adopt the dynamic method of salary distribution, promptly wait variable to change the sequence of using in time; Can adopt the static method of salary distribution, promptly the sequence of Shi Yonging is not done variation yet.Particularly, can adopt the mode of static allocation separately, perhaps adopt the mode of dynamic assignment separately, perhaps adopt the aforesaid dynamic and static method of salary distribution simultaneously.It is described in detail in detail below:

Preferable, when the Radio Resource that takies when sequence is fewer, can adopt dynamic sequence set distribution method.Because the length of this time series is smaller, thereby the number of sequence set is fewer.Such as the method for " jumping " sequence set, be in the embodiment of example in above-mentioned Zadoff-Chu sequence, in some pseudorandom modes, select the numbering r of a set of reference sequences at random in the moment of emission pilot tone ₁, and then be r according to the index that as above rule calculates the sequence in the child group of the needs length that belongs to same sequence set _kSequence.

Preferable, when the Radio Resource that takies when sequence is many, can adopt the static allocation mode.Such as, in above-mentioned Zadoff-Chu sequence is in the embodiment of example, and the use if the number N of sequence set enough satisfies the demands is then distributed to N sequence set each sub-district and used, do not need to change in time, can satisfy the requirement of presence of intercell interference equalization yet.Preferable, can be divided into two grades to the Radio Resource that takies in the system, grade is the sequence of many Radio Resources of taking, adopt the different sequence set of static allocation, another grade is the sequence of the fewer Radio Resource that takies, adopts the mode of dynamic pseudo-random to carry out the distribution of sequence set.For example, take the sequence that surpasses 144 subcarriers, sequence length is the sequence more than or equal to 144 usually, adopts the different sequence set of static allocation; Sequence correspondence in each sequence set is less than the Radio Resource of 144 subcarriers, and sequence length is the sequence less than 144 usually, adopts the mode of dynamic pseudo-random to carry out the distribution of sequence set.

When in the son group a plurality of sequence being arranged, comprise the sequence of basic sequence and different time cyclic shift, except distributing to the different user, can also distribute to different districts, for example the different sector under base station.Especially, when a sub-district needs more sequence, when for example supporting that many antennas are launched, every antenna all will have a different sequence, at this moment can limit the minimum length of the sequence of use, increasing the number of basic sequence in the son group, thereby the cyclic shift of more basic sequence or basic sequence in the child group can be distributed to the sub-district.Further, when the child group in the sequence set has a plurality of sequence, can further divide into groups, distribute to different sub-district/users/channel sequence set.

Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.

Embodiment two

Consistent with the method that above-mentioned network based certain rule is distributed to the sub-district with sequence set, introduce a kind of communication sequence launching technique below, with reference to figure 3, detailed process is:

The group number k of the sequence set that step 201 receiving system is distributed.

Step 202 is by selecting to make function d (f in the collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein n is a natural number, and wherein i is the sequence number that son is organized, (a b) is a binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of the definite child group i correspondence of system, and this domain of function is the described collection of candidate sequences of this child group i correspondence.

Step 203 is being launched on corresponding running time-frequency resource according to the corresponding transmitting sequence of the sequence generation of the child group i of described formation.

Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.Each function in the said method specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.

In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need storage, realize simple.

One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to finish by program, described program can be stored in the computer read/write memory medium, this program is when carrying out, comprise that step is consistent with above-mentioned steps 201-step 203, described storage medium, as: ROM/RAM, magnetic disc, CD etc.

Embodiment three

A kind of emitter of using above-mentioned sequence launching technique is provided below, and with reference to figure 5, this device comprises:

Sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, by selecting to make function d (f in the collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein i be the sub sequence number of organizing, and n is a natural number, wherein (a b) is a binary function to d, and k is the group number of sequence set, G _kBe an amount of determining by group number k, function f _i() is the function of the definite child group i correspondence of system, and this domain of function is the described collection of candidate sequences of this child group i correspondence.

Sequence transmitter unit: be used for sequence selection or the corresponding transmitting sequence of generation, and on corresponding running time-frequency resource, launching according to the child group i of described formation.

Relevant function in the described device can with aforementioned distribution method in discuss consistent, do not give unnecessary details at this.Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.

In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need storage, realize simple.

Embodiment four

Consistent with the method that above-mentioned network based certain rule is distributed to the sub-district with sequence set, introduce a kind of communication sequence method of reseptance below, with reference to figure 6, detailed process is as follows:

The group number k of the sequence set that step 401 receiving system receiving system is distributed.

Step 402 is by selecting to make function d (f in the collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein n is the natural number that depends on i, and wherein i is the sequence number that son is organized, (a b) is a binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of the definite child group i correspondence of system, and this domain of function is the described collection of candidate sequences of this child group i correspondence.

Step 403 generates corresponding sequence according to the sequence of the child group i of above-mentioned formation and is receiving on corresponding running time-frequency resource.The processing that receives generally comprises the sequence of generation and the related operation of the signal that receives.

Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.Each function in the said method specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.

In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need the corresponding relation of the sequence of storage resources and son group, realize simple.

One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to finish by program, described program can be stored in the computer read/write memory medium, this program is when carrying out, comprise that step is consistent with above-mentioned steps 401-step 403, described storage medium, as: ROM/RAM, magnetic disc, CD etc.

Embodiment five

A kind of receiving system of using above-mentioned sequential reception method is provided below, and with reference to figure 7, this device comprises

Sequence selection unit: the group number k that is used for the sequence set of receiving system receiving system distribution; By selecting to make function d (f in the collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein n is a natural number, and wherein i is the sequence number that son is organized, (a b) is a binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of the definite child group i correspondence of system, and this domain of function is the described collection of candidate sequences of this child group i correspondence.

Sequential reception unit: generate corresponding sequence and on corresponding running time-frequency resource, receiving according to the sequence of the child group i of above-mentioned formation.The processing that receives generally comprises the sequence of generation and the related operation of the signal that receives.

Usually, above-mentioned reception operation is specially, to obtain channel estimation value or to obtain related operation of time synchronized or the like.Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to Gauss sequence or other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.Each function in the said apparatus specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.

In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need storage, realize simple.

Embodiment six

This embodiment is different with the sequence allocating method of aforementioned first group of embodiment, is that the cyclically shifted sequences to one or more basic sequence divides into groups.

During assigned sequence, a general sequence set comprises a plurality of cyclically shifted sequences of a plurality of basic sequences, this cyclically shifted sequences can be basic sequence in time or frequency cocycle displacement obtain.In this case, in the time need distributing to the different user of a different sub-district (for example a plurality of sectors of a base station) or a sub-district/channel to different cyclically shifted sequences, with regard to needing further the signal of the cyclic shift of these basic sequences is divided into groups, make the different cyclically shifted sequences of same basic sequence belong to different groups, not not nearly orthogonal between any two sequences on the same group, thereby reduce the interference of sub-district/user/interchannel.

The distribution method of this embodiment is specially:

Sequence in each sequence set is divided into a plurality of son groups, the mode that the corresponding a kind of running time-frequency resource of each son group takies (for example, take the subcarrier of different numbers, perhaps take the position of different frequency resources), sequence set is distributed to the sub-district, and the sequence in each son group is chosen from the collection of candidate sequences corresponding with this child group and is obtained, and the above-mentioned method of choosing is specially: at least to a sequence set k, at least two son group i wherein, the sequence of j is by making function d (f in the described collection of candidate sequences _i(), f _j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is a natural number, (a b) is a binary function, function f to d _m() is the function of son group m correspondence, and this domain of function is the described collection of candidate sequences of this child group m correspondence.

Be example with the Zadoff-Chu sequence below, be described in detail.It is pointed out that this programme also is suitable for for the Gauss sequence.

The mode that the sequence that sends in the reality takies running time-frequency resource has multiple situation, and in order to describe the solution of the present invention in detail, at first simple example is explained the mode that different running time-frequency resources take below.

With situation shown in Figure 9 is example, the running time-frequency resource occupancy mode is: sequence from left to right is mapped on the frequency resource at center, short sequence and long sequence all take the subcarrier that is positioned at core, and this occupancy mode simplified summary is the mode that centrosymmetric running time-frequency resource takies.Among the figure under the A mode, sequence takies a Resource Block (being called for short RB, Resourse Block), and for example when the 1RB correspondence comprises 12 subcarriers, corresponding employing length is 11 Zadoff-Chu sequence; And under the B mode among the figure, sequence takies 2 RB, and when promptly taking 24 subcarriers, corresponding employing length is 23 Zadoff-Chu sequence.

Be example with situation shown in Figure 8 again, take a RB, i.e. 12 subcarriers, can be 12 subcarriers (occupancy mode of follow-up abbreviation left side RB) that take the low frequency shown in the light grey part in Fig. 8 left side, also may be 12 subcarriers (occupancy mode of follow-up abbreviation the right RB) that take the high frequency shown in the Dark grey part of Fig. 8 right side.

When adopting length is N _i, the basic sequence index is r _iThe Zadoff-Chu sequence time, for centrosymmetric resource occupation mode, above-mentioned function f _m() is specially f in the present embodiment _i(x)=((2xr _i) modN _i)/N _i, wherein x is the cyclic shift index, and corresponding cyclic shift amount is the sequence of x, has represented that it is the shift sequence that the cyclic shift of x obtains that basic sequence is carried out shift amount, and the sequence of cyclic shift index x and cyclic shift x is corresponding one by one.That is to say, determined that cyclic shift index x has just determined that corresponding cyclic shift amount is the sequence of x.Collection of candidate sequences is the cyclically shifted sequences that basic sequence generates.At the situation that takies different frequency resource mode in above-mentioned sequence, sequence allocating method is specifically described below.When sequence modulation was on frequency domain, the cyclic shift index in the function was a frequency domain, and transform domain is a time-domain.When sequence modulation was on time-domain, the cyclic shift index in the function was a time-domain, and transform domain is a frequency domain.Be that example describes on frequency domain with sequence modulation below.

First kind of situation: with reference to figure 9, the situation of promptly centrosymmetric resource occupation mode, at this moment, described with respect to center symmetry resource occupation mode apart from F _iBe 0 (individual subcarrier).Thereby, above-mentioned function f _iBe specially ((2Offset _iR _i) mod N _i)/N _i, Offset wherein _iIt is exactly the cyclic shift index of frequency domain; Work as r _i, r _jOdd even not simultaneously, from two son group i, the candidate sequence of j is concentrated to select and is made d (f _i, f _j) minimum sequence is grouped into same sequence set, (a b) is specially above-mentioned function d

Promptly make | f _i-f _j| get nonzero value, and in nonzero value minimum worth cyclic shift index.When odd even was identical, selecting the cyclic shift index was two cyclically shifted sequences of zero, promptly d (a, b)=| a-b| promptly makes | f _i-f _j| minimum.

For instance, be N to length ₁And N ₂Two sequences group, determine the criterion of sequence in a group, be exactly to make | ((2Offset ₁R ₁) modN ₁)/N ₁-((2Offset ₂R ₂) mod N ₂)/N ₂| minimum.Offset wherein ₁Be that length is N under the resource occupation mode of Fig. 9 ₁, the basic sequence index is r ₁The frequency domain cyclic shift index of sequence, Offset ₂Be that length is N under the resource occupation mode of Fig. 9 ₂, the basic sequence index is r ₂The frequency domain cyclic shift index of sequence.Obviously, Offset ₁=Offset ₂The=0th, feasible | ((2Offset ₁R ₁) modN ₁)/N ₁-((2Offset ₂R ₂) mod N ₂)/N ₂| minimum is zero.

General, work as r ₁, r ₂When odd even was identical, promptly two all was odd number, perhaps two when all being even number, selected to make | ((2 (Offset ₁R ₁) modN ₁)/N ₁-((2 (Offset ₂R ₂) mod N ₂)/N ₂| minimum value is zero cyclic shift amount Offset ₁, Offset ₂And work as r ₁, r ₂Odd even is selected feasible not simultaneously | ((2 (Offset ₁) r ₁) mod N ₁)/N ₁-((2 (Offset ₂) r ₂) modN ₂)/N ₂| be cyclic shift amount Offset minimum in the nonzero value ₁, Offset ₂This be because, when odd even is identical, the Zadoff-Chu sequence of two different lengths is not carried out any displacement, is exactly strong correlation on frequency domain, when odd even not simultaneously, on frequency domain, be shifted.

Index r when same group basic sequence ₁, r ₂Satisfy some feature, for example | r ₁N ₂-r ₂N ₁|＞N ₁N ₂/ 2, r ₁, r ₂When odd even was identical, the cyclic shift amount of employing satisfied the minimum value that function reaches non-zero, and odd even adopts Offset not simultaneously ₁=Offset ₂=0, r for example ₁=1, r ₂=5, N ₁=11, N ₂=23 and r ₁=2, r ₂=7, N ₁=11, N ₂=23 o'clock.Can limit in the system to adopt and make | r ₁N ₂-r ₂N ₁|＜N ₁N ₂Those basic sequence indexs of/2.

Here the index span of basic sequence is r _i=1,2 ..., N _i-1, perhaps r _i=-(N _i-1)/2 ... ,-1,0,1 ..., (N _i-1)/2.

When the index of basic sequence is got r arbitrarily _i+ nN _i, n=0, ± 1, ± 2, in one, (a b) is function d

Feasible-1/2＜a-b of modu1 operation≤1/2 wherein.

Ask feasible | ((2 (Offset ₁) r ₁) modN ₁)/N ₁-((2 (Offset ₂) r ₂) modN ₂)/N ₂| the Offset of minimum in the nonzero value ₁, Offset ₂Can be undertaken by mode relatively, promptly calculate different Offset ₁, Offset ₂Value, its make | ((2 (Offset ₁) r ₁) modN ₁)/N ₁-((2 (Offset ₂) r ₂) modN ₂)/N ₂| obtain minimum nonzero value.Utilize, fix an Offset ₁, make the Offset of nonzero value minimum ₂, can simple calculations obtain.Concrete, known three Integer N ₁, N ₂, e makes | e/N ₁-f/N ₂| the minimum integer f of value is and eN ₂/ N ₁Immediate integer is down and rounds

Round perhaps

Transmitter and receiver can calculate according to this method, but not storage.

Above-mentioned rule can be divided into following step:

0601) determine to make | (amod N ₁)/N ₁-(bmod N ₂)/N ₂| minimum a, b:

0602) according to Offset ₁-F ₁=a/2/r ₁ModN ₁, Offset ₂-F ₂=b/2/r ₂Mod N ₂, determine Offset ₁, Offset ₂Value, the computing of wherein (/) is carried out in the residue system that contracts, and works as N ₁, N ₂When coprime, non-zero minimum is 1/ (N ₁N ₂).

Above-mentioned function f _m() is specially f _i(x)=((2 (x-F _i) r _i) modN _i)/N _iEmbodiment, at N ₁, N ₂When coprime, utilize Elementary Number Theory, step 0601 is calculated in the following method.Detailed process is: use division algorithm to try to achieve m, n makes mN ₂+ nN ₁=1, a=mmod N then ₁, b=-n ₂ModN ₂

Lift a real example below, Fig. 9, the sequence of supposing to take 1 RB is a length N ₁=11, the basic sequence index is r ₁=6; The sequence that takies 2 RB is a length N ₂=23, the index of basic sequence is r ₂=13.So, use division algorithm, try to achieve a=10, b=21, feasible (amodN according to step 0601 ₁) N ₂-(bmod N ₂) N ₁=1.According to step 0602, calculate 10/2/6mod11=10 then, 14/2/13mod23=7, therefore, Offset ₁=10, Offset ₂=7.Promptly in the centrosymmetric resource occupation mode, length is 11, the basic sequence index is 6 sequence and length is 23, the basic sequence index is 13 sequence, and dividing other cyclic shift amount is 10 and 7.Obviously-10, the-7th, other a pair of cyclic shift, satisfy | ((2Offset ₁R ₁) modN ₁)/N ₁-((2Offset ₂R ₂) modN ₂)/N ₂| minimum.Transmitter and receiver can adopt division algorithm to determine cyclic shift, has also avoided a large amount of storages.

Second kind of situation: with reference to figure 8, for non-centrosymmetrical running time-frequency resource occupancy mode, its with respect to the symmetrical resource occupation mode in center apart from F _iBe not equal to 0, a pair of cyclically shifted sequences that center symmetry resource occupation mode is obtained increases the adjustment amount of cyclic shift again, generates the sequences of two son groups in the same sequence set.The adjustment amount of cyclic shift is by the distance decision between non-centrosymmetrical resource and the centrosymmetric resource.

Be real example in the resource occupation mode that takies left side RB among Fig. 8 below.The cyclic shift of the 11 long sequences of the RB on Fig. 8 left side is Offset ₁, the cyclically shifted sequences of the occupancy mode correspondence of 2RB is Offset among Fig. 8 ₂, F ₁Be the running time-frequency resource position of left side RB correspondence and the tape symbol distance of centrosymmetric resource location as shown in Figure 9, the positive different direction of negative indication, unit is a subcarrier.F in the example of Fig. 8 ₁=-6, represent to move to left 6 subcarriers, perhaps F ₁=-5 also can, this is because length 11 and the possible flexibility that RB subcarrier number 12 does not match and causes of Zadoff-Chu sequence.F ₂Be the tape symbol distance of the occupancy mode of 2RB with respect to the symmetrical resource in center, concrete, be exactly the cyclic shift OFfset of 11 long sequences of the RB on Fig. 8 left side ₁The length of=10,2 RB correspondences is that the cyclic shift of 23 sequence is Offset ₂=7-(6)=13.Promptly increased-F with respect to the cyclic shift amount of center to 2 RB correspondences of the resource of one-tenth ₁=-(-6) individual subcarrier.

The Offset that said method is determined _iBe the frequency domain displacement, in general, also can realize frequency domain displacement, Offset by transform domain (time domain) displacement _iCorresponding time domain displacement is Offset _iR ₁/ N ₁This is because the frequency domain displacement necessarily is equivalent to a time domain displacement.The target that is meant of frequency domain displacement expression is shifted, and what the time domain displacement was represented is the displacement of element.For example, a ₁, a ₂, a ₃, a ₄, a ₅1 unit of index displacement is a ₂, a ₃, a ₄, a ₅, a ₁, 1 unit of element displacement is a ₅, a ₁, a ₂, a ₃, a ₄

Owing to work as r _i, r _jOdd even not simultaneously, d (f _i, f _j) minimum value be not null value, therefore, can also further on time domain, finely tune, i.e. one of them sequence 1/ (2N that is shifted again _iN _j), f for example _i-f _j=± 1/ (N _iN _j) time, r _iCorresponding sequence adjustment Make that the correlation of the length sequence after being shifted is maximum, the sequence of Sheng Chenging is as the sequences of two son groups of same sequence set like this.

Can also further consider to sequence block or time domain that cyclic extension causes on adjustment amount.In the system of reality, the size of wireless resource block possibility, for example 12 subcarriers are not a prime number.If, wish adopting the Zadoff-Chu sequence of prime number length, then may need to carry out to be the Zadoff-Chu sequence truncation of prime number to long, for example 13, perhaps cyclic extension, for example 11.Concrete, to length 13 Zadoff-Chu sequence (a ₀, a ₁..., a ₁₂) block the back for (a ₀, a ₁.., a ₁₁).To length 11 Zadoff-Chu sequence (b ₀, b ₁..., b ₁₀) cyclic extension one-tenth (b ₀, b ₁..., b ₁₀, b ₀).Owing to block or cyclic extension, may cause the aforementioned same group definite cyclic shift of sequence on time domain to do fine setting again, to generate the different sub sequence of organizing of same sequence set.

The method of determining adjustment amount is: establish r ₁, N ₁, r ₂, N ₂Two Zadoff-Chu sequences determining, Offset ₁, Offset ₂, be to try to achieve according to the rule of function minimum, when being placed on the centrosymmetric frequency domain resource, do not block or the frequency domain shift amount of two sequences when expanding, then the adjustment amount of Que Dinging is-(((r ₁A) modN ₁)/N ₁+ (r ₂B) modN ₂/ N ₂)/2.Wherein b is owing to after blocking back or expansion, r ₁, N ₁The distance of the mirror image resources mapping of corresponding sequence, a is r ₁, N ₁Frequency domain cyclic shift amount between the sequence of the mirror image resources mapping of the sequence of decision poor.

Concrete, as shown in figure 10, the sequence of 13 length is blocked an element at high frequency; Symmetry as shown in figure 11,13 long sequences are blocked an element at low frequency, b=1 at this moment, a=-1.The length that is Figure 11 is that to move down length that 1 subcarrier obtains Figure 10 be the resource (b=1) that 12 sequence takies for resource that 12 sequence takies, the frequency domain shift amount of sequence own increases a=-1 again, and the length of Figure 11 is that 12 sequence is 12 sequence with regard to the length that becomes Figure 10.

Work as r ₁=1, N ₁=13, r ₂=2, N ₂=23 o'clock, when being placed on the centrosymmetric frequency resource, shift amount on the frequency is respectively 2,19, suppose IFFT length 512, with the base unit of a sampled point (promptly 1/512) as displacement, cyclic shift 2*1/13*512 on then corresponding the time domain, (19*2mod23)/and 23*512,13 long sequences pass through on the time domain again-the time domain adjustment amount of 1/13/23/2*512=-0.85, at this time cyclically shifted sequences is a strongest correlation.But, to 13 long sequences, after a value of high frequency blocked, become on the time domain to adjust-0.85-(1/13+2/23)/a 2*512=-3 sampled point, be only strongest correlation.Promptly increase an adjustment amount.

Obviously, when sequence that the low frequency that adopts Figure 11 blocks and a that blocks of high frequency, b relatively, corresponding a, b is opposite sign just in time, i.e. a=1, b=-1, the adjustment amount of calculating are-0.85-(1/13-2/23)/2*512=2.

To the situation of cyclic extension, as Figure 12, at this moment 11 long sequence high frequencies expand an element.As Figure 13,11 long sequence low frequencies expand an element, and then the sequence of Figure 13 need upwards be moved a subcarrier b=-1 to frequency domain resource, and the sequence frequency domain shift amount of self increases by 1 again, a=1, and then the sequence of the sequence of the expansion of Figure 13 and Figure 12 overlaps fully.

Obviously, when adopting the cyclic extension of low frequency of sequence of Figure 13 and a of high frequency situation about expanding, b relatively, a, b is opposite sign respectively, a=-1, b=+1.

General, block or cyclic extension can be not only a subcarrier, can be a plurality of subcarriers.When blocking or expand a plurality of subcarrier, can adopt the method that symmetry is blocked or symmetry expands, promptly can many sections one of high frequency (or low frequency) or expand one more, high and low frequency block or to expand quantity the most approaching, if for example block 3 values, then low frequency blocks 1, and high frequency blocks 2, perhaps low frequency blocks 2, and high frequency blocks 1.Then above-mentioned fixed to blocking and expand a of a subcarrier, the value of b stands good, a=-1 when promptly blocking, b=+1, a=+1 during expansion, b=-1.When adopting asymmetric expansion, can calculate according to the distance of mirror image resources mapping.The i.e. a that increases of the frequency domain cyclic shift of sequence amount as required own, resource shift amount b obtains the identical sequence of minute surface resource and determines a, b.

Because blocking or expanding of symmetry is identical to the influence of cyclic shift adjustment amount, and smaller, therefore, can adopt blocking or expanding of symmetry in the more excellent system.The steps include: the sequence in each sequence set is divided into a plurality of son groups the mode that the corresponding a kind of running time-frequency resource of each son group takies; Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the method of above-mentioned generation is specially: the sequence in the group group need carry out that cyclic shift expands or when blocking, take the method that symmetry expands or symmetry is blocked to the sequence in the collection of candidate sequences; It is logical that described sequence set is distributed to sub-district/user/letter.

Said method has determined to belong to the cyclically shifted sequences of at least two different lengths of same group, in other execution mode, when the sequence of multiple length is arranged in the system, can choose any one sequence as fixing sequence, other sequence all compares with this fixed sequence program, determines the cyclic shift (promptly determining cyclically shifted sequences in twos) of sequence by above-mentioned rule.For example, the shortest sequence that grouping may be used in can selective system is as fixing sequence.The longest sequence that grouping may be used in also can selective system is as fixing sequence.

In this execution mode, in case a sequence of fixing running time-frequency resource occupancy mode, index r ₁, length is N ₁, determine cyclic shift after, this is the cyclic shift Offset of the sequence of running time-frequency resource occupancy mode fixedly ₀Just fixing.Other sequence again with this fixedly the cyclically shifted sequences of the sequence of running time-frequency resource occupancy mode compare, the cyclic shift amount of determining comprises the fixing shift amount Offset of the sequence of running time-frequency resource occupancy mode ₁Cyclic shift amount Offset with other sequence u self _u, sequence u is except carrying out cyclic shift Offset _uIn addition, also need shift reverse Offset in time ₁' r ₁/ N ₁, Offset wherein ₁' be the relative shift amount of fixed resource, i.e. Offset ₁-Offset ₀, fixing Offset ₀=0, this moment Offset ₁'=Offset ₁This be because, frequency-domain index cyclic shift c and the time field element cyclic shift cr ₁/ N ₁Equivalence, so sequence u shift reverse Offset ₁' r ₁/ N ₁With the fixing correlation of the sequence of running time-frequency resource occupancy mode, do not carry out the shift reverse and the fixing sequence frequency domain cyclic shift Offset of running time-frequency resource occupancy mode with, sequence u ₁' the correlation of sequence, both are identical.

Utilize said method to determine a cyclically shifted sequences group, can be called benchmark cyclically shifted sequences group, can utilize the characteristic of sequence nearly orthogonal on time domain of different length in the reality, obtain other a plurality of cyclically shifted sequences groups with this benchmark cyclically shifted sequences group, method is exactly to be shifted in the time domain cocycle.

Below, provide a concrete example above-mentioned definite benchmark cyclically shifted sequences group and definite method of other cyclically shifted sequences group are described.For N ₁=11, N ₂=23, have the group of 10 basic sequences, as following table.Basic sequence in every group can be divided into a plurality of different cyclically shifted sequences groups again.Hypothetical sequence is as shown in Figure 9 a center symmetry resource occupation mode to the occupancy mode of resource, utilizes the bright rule of we, determines to make metric function | ((2Offset ₁R ₁) modN ₁)/N ₁-((2Offset ₂R ₂) modN ₂)/N ₂| minimum cyclic shift value, can select to make that metric is two cyclic shifts of-1, can select also to make that metric is two cyclic shifts of+1.For example to the sequence set of k=1, r ₁, r ₂Expression basic sequence index, Offset ₁, Offset ₂The cyclic shift amount that expression is determined by the present invention's rule, this moment, two sequences can obtain strongest correlation, and the metric function minimum is-1, and corresponding correlation is 10.9256, it is very approaching that this value is compared with desirable auto-correlation 11, thereby correlation is very strong.So the sequence in the benchmark cyclically shifted sequences group in this example is exactly: length is 11, the basic sequence index is 1, the cyclic shift on the frequency domain is 6 sequence and, length is 23, the basic sequence index is 2, the cyclic shift on the frequency domain is 12 sequence.After obtaining benchmark cyclically shifted sequences group, the signal sampling point of hypothetical sequence on time domain has 12 now, and then two of this group sequences can produce other 5 groups of sequences in time domain cocycle displacement 2,4,6,8,10 respectively.The cyclic shift of concrete time domain can be mapped on the subcarrier by resource occupation in sequence, after generation obtains time-domain signal then, carries out on time domain.

Use sequence N again ₁=23, N ₂=37 are the example explanation, and following relation is in groups then arranged:

Last list notation is in the row of " correlation ", the expression of two correlations is arranged, in this sequence set, the cyclic shift of two sequences of strongest correlation, not to make a pair of cyclic shift of metric minimum, wherein the correlation on the left side is the correlation of a pair of cyclically shifted sequences that makes that tolerance is minimum, the right be getable maximum correlation value in all possible frequency domain cyclic shift.Can obviously find out, these sequence set that runic shows in table, the method according to this invention design, the correlation of two cyclically shifted sequences of same group is big not enough.Find that by analyzing this occurs in | r ₁/ N ₁-r ₂/ N ₂| during bigger situation, r in the table for example ₁=1, r ₂=2 o'clock, | 1/23-2/37|=9/ (2337), work as in the table | r ₁/ N ₁-r ₂/ N ₂|≤7/N ₁N ₂The time, the sequence set of the present invention's design satisfies the strong correlation requirement fully, all compares near desirable autocorrelation value 23.Therefore, be that 23 sequence and length are 37 sequence to length, although can be combined into 22 basic sequence groups, can only limit and select for use | r ₁/ N ₁-r ₂/ N ₂|≤7/N ₁N ₂14 basic sequence groups, just go up the group of non-runic sign in the table.For each selected basic sequence group, the group technology of cyclically shifted sequences of the present invention is suitable fully.The cyclically shifted sequences of the present invention basic sequence of rule in groups can be selected to satisfy by system, promptly selects to make | r ₁/ N ₁-r ₂/ N ₂| some less basic sequence groups.Again for example, for 11 long sequence and 23 long sequences, for the basic sequence index r of one 11 length ₁Represent sequence, the basic sequence index r of two 23 length can be arranged ₂The sequence of expression is respectively feasible | r ₁/ N ₁-r ₂/ N ₂| minimum and time minimum sequence, belong to same basic sequence group, can find to have only feasible | r ₁/ N ₁-r ₂/ N ₂| the sequence of one 23 minimum length and corresponding length are the basic sequence group of 11 sequence composition, in the time of just can further dividing into groups to cyclically shifted sequences, and our rule of the deferred gratification of strongest correlation.To length 11 sequence (basic sequence index r ₁Expression) and length be 37 sequence (basic sequence index r ₂Expression), then the basic sequence group can have one long be 11 sequence and 2 long be 37 sequence, these two long is 37 sequence, is respectively feasible | r ₁/ N ₁-r ₂/ N ₂| minimum and time minimum sequence.To the cyclically shifted sequences of this sequence set, further grouping, that utilizes then that our rule finds out belongs to same group cyclically shifted sequences, is strong correlation.Therefore, general, in order to guarantee the correct of cyclically shifted sequences rule of classification, need the formation of basic sequence group be limited.

The sequence at the non-strong correlation of these that rule of classification obtains according to the present invention peak also can be considered to use in system.Cyclic shift corresponding relation between these sequences still adopts rule of the present invention to determine, needs to stand the interference that these non-strong correlation sequences cause in the system.Strong correlation between these sequences is not to show as a peak value, but shows as in the interval relevant all than higher.

Compared with prior art, following beneficial effect is arranged in this embodiment: in this embodiment the length sequence, the cyclically shifted sequences that causes strong correlation of the sequence of perhaps general corresponding different frequency resource occupation mode is placed in same group, the interference between the sequence on the same group is not smaller, perhaps nearly orthogonal.Like this, distribute different groups to give sub-district or user or channel, just can reach and disturb the purpose that reduces.And take method of the present invention, the machine of transmitting and receiving can generate cyclically shifted sequences according to rule in groups, avoids the form of the side of emission and recipient's storage sequence group corresponding relation, reduces implementation complexity.

Embodiment seven

In this embodiment, different with previous embodiment, present embodiment is reference with the cyclically shifted sequences of a certain running time-frequency resource occupancy mode correspondence, determine other the cyclically shifted sequences of running time-frequency resource occupancy mode correspondence in the system with this, as the cyclically shifted sequences with long sequence correspondence in the center symmetry resource occupation mode shown in Figure 9 is reference, determines the cyclically shifted sequences of the short sequence correspondence on different RB among Fig. 8.Concrete method is:

Sequence in each sequence set is divided into a plurality of son groups, the mode that the corresponding a kind of running time-frequency resource of each son group takies, sequence set is distributed to the sub-district, sequence in each son group is chosen from the collection of candidate sequences corresponding with this child group and is obtained, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position.

In this embodiment, the process of described definite described cyclically shifted sequences is specially:

C represents running time-frequency resource position that the cyclically shifted sequences of the occupancy mode correspondence of described different running time-frequency resource the takies distance with respect to reference running time-frequency resource position, r ₂, N ₂The basic sequence index and the length of the running time-frequency resource of expression reference,

Then choosing transform domain cyclic shift amount is-(cr ₂) modN ₂/ N ₂Sequence constitute described cyclically shifted sequences.When sequence modulation was on frequency domain, transform domain was a time domain.When sequence modulation during in time domain, transform domain is a frequency domain.

Running time-frequency resource position with reference to running time-frequency resource position the longest sequence correspondence in can selective system.

Running time-frequency resource occupancy mode with Fig. 8 and Fig. 9 is an example, suppose resource occupation mode as a reference with Fig. 9, and will grow be 23, the cyclic shift amount is 7 sequence cyclically shifted sequences as a reference, the cyclically shifted sequences of Fig. 8 left side RB correspondence then, by the length of the correspondence of center symmetry RB be 11, the frequency domain cyclic shift amount determined is Offset ₁Sequence, on time domain, carry out oppositely (cr ₂) modN ₂/ N ₂Cyclic shift obtain, wherein, r ₂Be the pairing basic sequence index of sequence that 2RB uses, N ₂Be the sequence length of 2RB correspondence, the relative distance of running time-frequency resource position is c=6.In the previous example, with 1/32 unit as displacement, then frequency domain cocycle displacement 6 is equivalent to time domain superior displacement (613) mod23/2332=12.52.Because to grow sequence sequence as a reference, promptly the fixing cyclic shift of long sequence and short sequence 12.52 sampled points of shift reverse in time, makes that short sequence and the length sequence after the displacement is strong correlation as a reference.The sequence of such cyclic shift on time domain is as belonging to same group sequence with long sequence.When specific implementation, step is: the resource location of a selected reference and corresponding cyclically shifted sequences thereof, obtain the distance c of the shared running time-frequency resource position of the cyclically shifted sequences of occupancy mode correspondence of current running time-frequency resource, according to (cr with respect to reference running time-frequency resource position ₂) modN ₂/ N ₂Calculate the cyclic shift amount that the sequence on this resource location will be carried out in time domain, then the time domain sequences that is obtained by the sequence of shining upon is carried out a reverse displacement on this resource location, shift amount is (cr ₂) modN ₂/ N ₂So just obtained belonging to same group time-domain cyclic shift sequence, can carry out the distribution of corresponding cyclically shifted sequences group according to the needs of system more at last with long sequence.

Determine that for the cyclic shift of the sequence of Fig. 8 the right RB can adopt similar method, the distance of this time-frequency domain resources position is c=-6.Negative sign wherein represents that positive sign is represented to be shifted to low frequency to the high frequency displacement.At this moment the RB owing to the right moves 6 subcarriers to obtain on the centrosymmetric resource, and is relevant the strongest in order to make, and moves 6 subcarriers on the resource of the sequence of 2RB also will circulate, and the index that is equivalent to the sequence of 2RB moves-6.Therefore, negative sign represents that positive sign is represented to be shifted to low frequency to the high frequency displacement.

We have determined one group of sequence like this, comprise the sequence of 2RB correspondence, the sequence of left side 1RB correspondence, and the sequence of the right 1RB correspondence, these sequences are determined with cyclic shift amount separately.Generally determined one group of sequence, the sequence of other group then, sequence amount of while cyclic shift on time domain by this group is determined, the sequence of each length 8 sampled points of cyclic shift all on time domain for example, so total sampled point number is 32 o'clock, just can generate 4 different sequence set, corresponding cyclic shift is 8 respectively, 16,24 sampled points, and the initial sequence set of determining (being shifted 0).

Among the present invention, shift amount can be unit with 1/S, and wherein S is total number of sampled point, in the specific implementation, can round up less than the shift amount of a unit.Can consider that also method such as accurate interpolation realizes accurate shift amount, in this case, 1/S only is a unit, and as the least unit that rounds up, it all is not of equal value that S can get arbitrary value, and for example S gets 1.

Embodiment eight

A kind of processing unit of sequence is provided below, and a kind of processing unit of sequence, this device are used for the emission or the reception of sequence, and this device comprises:

The second sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, at least two son group i among the described sequence set k, the sequence of j is by making function d (f in the collection of candidate sequences corresponding with this child group _i(), f _j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is a natural number, d (f _i(), f _j()) be a binary function, function f _i() or f _j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence.

The second series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.

In the another kind of execution mode, the above-mentioned second sequence selection unit can adopt division algorithm to determine cyclic shift, has also avoided a large amount of storages.Concrete, the second sequence selection unit further comprises:

The cyclic shift determination module is used to adopt division algorithm to determine cyclic shift; With the cyclically shifted sequences generation module, generate corresponding cyclically shifted sequences according to the cyclic shift of determining.

Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission; Usually, above-mentioned reception operation is specially, and obtains channel estimation value or obtains related operation of time synchronized or the like.Each function in the said apparatus specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.

Embodiment nine

A kind of processing unit of sequence is provided below, it is characterized in that, this device comprises:

The 3rd sequence selection unit: the group number k that is used for the sequence set of receiving system distribution, from the collection of candidate sequences corresponding, choose the sequence that obtains in each son group with this child group, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position.

The 3rd series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.

Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission; Usually, above-mentioned reception operation is specially, and obtains channel estimation value or obtains related operation of time synchronized or the like.Each function in the said apparatus specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.

Aforementioned each series processing device, sequence selection unit wherein adopt certain rule directly to choose the sequence that satisfies the interference requirement, do not need the tabulation of storage sequence corresponding relation, compared with prior art, save the communication resource.

Though pass through with reference to some of the preferred embodiment of the invention, the present invention is illustrated and describes, but those of ordinary skill in the art should be understood that and can do various changes to it in the form and details, and without departing from the spirit and scope of the present invention.

Claims (54)

1. the method for sequence allocation in the communication system is characterized in that this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the above-mentioned method of choosing is specially: the sequence among the child group i among the sequence set k is by making function d (f in the described collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence chosen formation, and wherein, k is the group number of sequence set, i is the sequence number that son is organized, n is a natural number, (a b) is a binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of son group i correspondence, and this domain of function is the described collection of candidate sequences of this child group i correspondence;

Described sequence set is distributed to sub-district/user/channel.

2. method according to claim 1 is characterized in that,

Described sequence is to prick doffer-first Zadoff-Chu sequence or Gauss Gauss sequence.

3. method according to claim 2 is characterized in that,

Described function f _i() is specially

R wherein _iBe the index of basic sequence in this collection of candidate sequences, N _iBe the length of the sequence in this collection of candidate sequences; Perhaps,

When described son group i correspondence is spaced apart the Radio Resource of s, described function f _i() is specially:

R wherein _iBe the index of basic sequence in this collection of candidate sequences, N _iBe the length of the sequence in this collection of candidate sequences, s is the gap size of Radio Resource, and l is the top step number of gaussian sequence.

4. method according to claim 3 is characterized in that,

Described G _kFor $G_k=f_{p_1}\left(\right\{a_{c_k,N_{p_1}}\left(z\right){\}}_{z=\mathrm{0,1},...,N_{p_1-1}})=c_k/N_{p_1},$

Be the length with reference to son group sequence, c _kDetermine by sequence set k

The basic sequence index of long sequence; The child group of sequence length maximum in child group that described reference group is a sequence length minimum in the sequence set or the sequence set.

5. method according to claim 1 is characterized in that,

Described n is 1, and perhaps described n is according to k and the definite amount of i.

6. according to any described method of claim 1-5, it is characterized in that,

Described function d (a b) is | a-b|;

Perhaps described function d (a b) is | (a-b) modu1|;

Perhaps described function

Perhaps described function

7. method according to claim 6 is characterized in that, this method further comprises according to following method determines described u, v:

$u=1-/\left(2N_{p_1}\right)+1/\left(4N_{p_2}\right),$ $v=1/\left(2N_{p_1}\right)-1/\left(4N_{p_2}\right),$ Wherein

Be the sequence length of short sequence,

For only greater than

Sequence length.

8. method according to claim 6 is characterized in that this method further comprises

Determine described u according to following method, v:

To sequence set q ₁Child group p ₁,

Wherein $1/N_{p_l}-1/N_{p_1}+1/\left(2N_{p_1}\right)\&le;{\mathrm{\&delta;}}_u<1/2\left(N_{p_1}\right);$

To sequence set

Child group p ₁,

Wherein $-1/\left(2N_{p_1}\right)<{\mathrm{\&delta;}}_v\&le;(N_{p_l}-1)/N_{p_l}-(N_{p_1}-1)/-N_{p_1}-1/\left(2N_{p_1}\right);$

Wherein,

Expression is the sequence length of short sequence,

The sequence length of expression maximum length sequence, length is Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be

Being numbered of sequence set at basic sequence place

Length is

The basic sequence place the child group be numbered p ₁

9. method according to claim 6 is characterized in that this method further comprises

Determine described u according to following method, v:

Sequence set q _kChild group p ₁

For:

Sequence set q _K+1Child group p1

For:

Wherein,

Expression is the sequence length of short sequence, and length is

The basic sequence place the child group be numbered p ₁, length is Index be k the basic sequence place sequence set be numbered q _k, length is

Index be k+1 the basic sequence place sequence set be numbered q _K+1, and

$1/D\&le;1/\left(2N_{p_1}\right).$

10. method according to claim 6 is characterized in that this method further comprises

Determine described v according to following method:

To sequence length be Basic sequence, according to

Different values, made $r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}}\&GreaterEqual;0$ And

When obtaining minimum value

Sequence set q _kChild group p _i For: when $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}}\&le;0$ The time, $v_{q_k,p_i}=v_{q_k,p_{i-1}}+r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}};$ When $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i_{-1}}}>0$ The time, $v_{q_k,p_i}=v_{q_k,p_{i-1}};$

Wherein,

Expression is the sequence length of short sequence, and length is

Index be k the basic sequence place sequence set be numbered q _k, length is

Index be k+1 the basic sequence place sequence set be numbered q _K+1, length is The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i,

And

${\mathrm{left}}_{q_{k+1},p_{i-1}}=u_{q_{k+1},p_{i-1}}+(k+1)/N,$ $k=1,...,N_{p_1}-2,$ I ∈ S, S are an index set, and described S set is the subclass of set I or set I, described set I={2,3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

11. method according to claim 6 is characterized in that, this method further comprises

Determine described u according to following method:

To sequence length be

Basic sequence, according to

Different values, made

And

When obtaining minimum value

Sequence set q _K+1Child group p _i

For: when

The time, $u_{q_{k+1},p_i}=u_{q_{k+1},p_{i-1}}+r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}};$ When $r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}}<0$ The time, $u_{q_{k+1},p_i}=u_{q_{k+1},p_{i-1}};$

Wherein,

Expression is the sequence length of short sequence, and length is

Index be k the basic sequence place sequence set be numbered q _k, length is

Index be k+1 the basic sequence place sequence set be numbered q _K+1, length is

The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i, And

${\mathrm{left}}_{q_{k+1},p_{i-1}}=u_{q_{k+1},p_{i-1}}+(k+1)/N,$ $k=1,...,N_{p_1}-2,$ I ∈ S, S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

12. method according to claim 6 is characterized in that, this method further comprises

Determine described v according to following method:

To sequence length be

Basic sequence, according to

Different values, made And When obtaining minimum value

Sequence set Child group p _i For: when $r_{q_1,p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}\&le;0$ The time, $v_{q_{N_{P_1}-1},p_i}=v_{q_{N_{p_1}-1},p_{i-1}}+r_{q_1,p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;};$ When $r_{q_1,p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}>0$ The time, $v_{q_{N_{p_1}-1},p_i}=v_{q_{N_{p_1}-1},p_{i-1}};$

Wherein, use

Expression is the sequence length of short sequence, and length is Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be Being numbered of sequence set at basic sequence place

Length is The basic sequence place the child group be numbered p _I-1, length is The basic sequence place the child group be numbered p _i, $N_{p_{i-1}}<N_{p_i},$ And ${{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}=v_{q_{N_{p_1}-1},p_{i-1}}-1/N_{p_1},$

I ∈ S, described S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

13. method according to claim 6 is characterized in that, this method further comprises

Determine described u according to following method:

Sequence set q ₁Child group p _i

For:

To sequence length be

Basic sequence, according to

Different values, made

And When obtaining minimum value

Sequence set q ₁Child group p _i

For working as $r_{q_{N_{p_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{{\mathrm{left}}_{q_1,p_{i-1}}}^{\&prime;\&GreaterEqual;}0$ The time, $u_{q_1,p_i}=u_{q_1,p_{i-1}}+r_{q_{N_{p_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i_{-1}}}-{{\mathrm{left}}_{q_1,p_{i-1}}}^{\&prime;};$ When $r_{q_{N_{P_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{{\mathrm{left}}_{q_1,p_{i-1}}}^{\&prime;}<0$ The time, $u_{q_1,p_i}=u_{q_1,p_{i-1}};$

Wherein, use

Expression is the sequence length of short sequence, and length is

Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be

Being numbered of sequence set at basic sequence place Length is

The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i, $N_{p_{i-1}}<N_{p_i},$ ${\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}=v_{q_{N_{p_1}-1},p_{i-1}}+(N_{p_1}-1)/N_{p_1},$

I ∈ S, described S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

14. method according to claim 6 is characterized in that, this method further comprises

Determine described u according to following method, v:

Sequence set q _kChild group p _i With

Be respectively:

$u_{q_k,p_i}=u_{q_k,p_m},$ $v_{q_k,p_i}=v_{q_k,p_m},$

Wherein,

Expression is the sequence length of short sequence, and length is Index be k the basic sequence place sequence set be numbered q _k, length is

The basic sequence place the child group be numbered p _m, length is

The basic sequence place the child group be numbered p _i, and

I ∈ I-S, described I and described S are two index sets, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences, and described S set is the subclass of set I or set I, and m is the element of S set intermediate value maximum.

15. method according to claim 6 is characterized in that,

Described n≤Q, wherein Q is for satisfying

The number of sequence, u _{K, i}And v _{K, i}U and v for the child group i among the sequence set k.

16. a method of handling sequence is characterized in that,

The group number k of the sequence set that receiving system is distributed;

By selecting to make function d (f in the collection of candidate sequences _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein i be the sub sequence number of organizing, and n is a natural number, (a b) is binary function, G to d _kBe an amount of determining by group number k, function f _i() is the function of son group i correspondence, and this domain of function is the described collection of candidate sequences of this child group i correspondence;

Generate corresponding sequence according to the sequence in the child group that constitutes, on the running time-frequency resource of child group i correspondence, launch or receive.

17. method according to claim 16 is characterized in that,

Described sequence is to prick doffer-first Zadoff-Chu sequence or Gauss Gauss sequence.

18. method according to claim 17 is characterized in that,

Described function f _i() is specially

R wherein _iBe the index of basic sequence in this collection of candidate sequences, N _iBe the length of the sequence in this collection of candidate sequences; Perhaps,

When described son group i correspondence is spaced apart the Radio Resource of s, described function f _i() is specially:

R wherein _iBe the index of basic sequence in this collection of candidate sequences, N _iBe the length of the sequence in this collection of candidate sequences, s is the gap size of Radio Resource, and l is the top step number of gaussian sequence.

19. method according to claim 18 is characterized in that,

Described G _kFor $G_k=f_{p_1}\left(\right\{a_{c_k,N_{p_1}}\left(z\right){\}}_{z=\mathrm{0,1},...,N_{p_1-1}})=c_k/N_{p_1},$ Be the length with reference to son group sequence, c _kDetermine by sequence set k

The basic sequence index of long sequence; The child group of sequence length maximum in child group that described reference group is a sequence length minimum in the sequence set or the sequence set.

20. method according to claim 16 is characterized in that,

Described n is 1, and perhaps described n is according to k and the definite amount of i.

21. according to any described method of claim 16-20, it is characterized in that,

Described function d (a b) is | a-b|;

Perhaps described function d (a b) is | (a-b) modu1|;

Perhaps described function

Perhaps described function

22. method according to claim 21 is characterized in that, this method further comprises according to following method determines described u, v:

$u=1-/\left(2N_{p_1}\right)+1/\left(4N_{p_2}\right),$ $v=1/\left(2N_{p_1}\right)-1/\left(4N_{p_2}\right),$ Wherein

Be the sequence length of short sequence,

For only greater than

Sequence length.

23. method according to claim 21 is characterized in that, this method further comprises

Determine described u according to following method, v:

To sequence set q ₁Child group p ₁, Wherein $1/N_{p_l}-1/N_{p_1}+1/\left(2N_{p_1}\right)\&le;{\mathrm{\&delta;}}_u<1/2\left(N_{p_1}\right);$

To sequence set Child group p ₁,

Wherein $-1/\left(2N_{p_1}\right)<{\mathrm{\&delta;}}_v\&le;(N_{p_l}-1)/N_{p_l}-(N_{p_1}-1)/-N_{p_1}-1/\left(2N_{p_1}\right);$

Wherein,

Expression is the sequence length of short sequence,

The sequence length of expression maximum length sequence, length is

Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be

Being numbered of sequence set at basic sequence place

Length is The basic sequence place the child group be numbered p ₁

24. method according to claim 21 is characterized in that, this method further comprises

Determine described u according to following method, v:

Sequence set q _kThe child group _p1 For:

Sequence set q _K+1Child group p ₁

For:

Wherein,

Expression is the sequence length of short sequence, and length is

The basic sequence place the child group be numbered p ₁, length is

Index be k the basic sequence place sequence set be numbered q _k, length is

Index be k+1 the basic sequence place sequence set be numbered q _K+1, and

$1/D\&le;1/\left(2N_{p_1}\right).$

25. method according to claim 21 is characterized in that, this method further comprises according to following method determines described v:

To sequence length be

Basic sequence, according to

Different values, made And

When obtaining minimum value

Sequence set q _kChild group p _i

For: when

The time, $v_{q_k,p_i}=v_{q_k,p_{i-1}}+r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}};$ When $r_{q_{k+1},p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{\mathrm{right}}_{q_k,p_{i-1}}>0$ The time, $v_{q_k,p_i}=v_{q_k,p_{i-1}};$

Wherein, use

Expression is the sequence length of short sequence, and length is

Index be k the basic sequence place sequence set be numbered q _k, length is

Index be k+1 the basic sequence place sequence set be numbered q _K+1, length is

The basic sequence place the child group be numbered p _I-1, length is The basic sequence place the child group be numbered p _i, $N_{p_{i-1}}<N_{p_i},$ And ${\mathrm{right}}_{q_k,p_{i-1}}=v_{q_k,p_{i-1}}+k/N_{p_1},$ ${\mathrm{left}}_{q_{k+1},p_{i-1}}=u_{q_{k+1},p_{i-1}}+(k+1)/N,$ $k=1,...,N_{p_1}-2,$ I ∈ S, S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

26. method according to claim 21 is characterized in that, this method further comprises

Determine described u according to following method:

To sequence length be

Basic sequence, according to Different values, made

And

When obtaining minimum value

Sequence set q _K+1Child group p _i For: when

The time, $u_{q_{k+1},p_i}=u_{q_{k+1},p_{i-1}}+r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}};$ When $r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}}<0$ The time, $u_{q_{k+1},p_i}=u_{q_{k+1},p_{i-1}};$

Wherein,

Expression is the sequence length of short sequence, and length is

Index be k the basic sequence place sequence set be numbered q _k, length is Index be k+1 the basic sequence place sequence set be numbered q _K+1, length is

The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i, $N_{p_{i-1}}<N_{p_i},$ And ${\mathrm{right}}_{q_k,p_{i-1}}=v_{q_k,p_{i-1}}+k/N_{p_1},$ ${\mathrm{left}}_{q_{k+1},p_{i-1}}=u_{q_{k+1},p_{i-1}}+(k+1)/N,$ $k=1,...,N_{p_1}-2,$ I ∈ S, S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

27. method according to claim 21 is characterized in that, this method further comprises

Determine described v according to following method:

To sequence length be Basic sequence, according to

Different values, made

And

When obtaining minimum value

Sequence set

Child group p _i

For: when $r_{q_1,p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}\&le;0$ The time, $v_{q_{N_{P_1}-1},p_i}=v_{q_{N_{p_1}-1},p_{i-1}}+r_{q_1,p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;};$ When $r_{q_1,p_{i-1}}/N_{p_{i-1}}-1/C_{p_{i-1}}-{{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}>0$ The time, $v_{q_{N_{p_1}-1},p_i}=v_{q_{N_{p_1}-1},p_{i-1}};$

Wherein, use

Expression is the sequence length of short sequence, and length is Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be

Being numbered of sequence set at basic sequence place

Length is

The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i, $N_{p_{i-1}}<N_{p_i},$ And ${{\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}}^{\&prime;}=v_{q_{N_{p_1}-1},p_{i-1}}-1/N_{p_1},$

I ∈ S, described S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

28. method according to claim 21 is characterized in that, this method further comprises

Determine described u according to following method:

Sequence set q ₁Child group p _i

For:

To sequence length be

Basic sequence, according to

Different values, made

And

When obtaining minimum value

Sequence set q ₁Child group p _i

For working as $r_{q_{N_{p_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{{\mathrm{left}}_{q_1,p_{i-1}}}^{\&prime;\&GreaterEqual;}0$ The time, $u_{q_1,p_i}=u_{q_1,p_{i-1}}+r_{q_{N_{p_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i_{-1}}}-{{\mathrm{left}}_{q_1,p_{i-1}}}^{\&prime;};$ When $r_{q_{N_{P_1}-1},p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}-{{\mathrm{left}}_{q_1,p_{i-1}}}^{\&prime;}<0$ The time, $u_{q_1,p_i}=u_{q_1,p_{i-1}};$

Wherein, use

Expression is the sequence length of short sequence, and length is

Index be 1 basic sequence place sequence set be numbered q ₁, length is

Index be

Being numbered of sequence set at basic sequence place

Length is

The basic sequence place the child group be numbered p _I-1, length is

The basic sequence place the child group be numbered p _i, $N_{p_{i-1}}<N_{p_i},$ ${\mathrm{right}}_{q_{N_{p_1}-1},p_{i-1}}=v_{q_{N_{p_1}-1},p_{i-1}}+(N_{p_1}-1)/N_{p_1},$ I ∈ S, described S are an index set, and described S set is the subclass of set I or set I, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences.

29. method according to claim 21 is characterized in that, this method further comprises

Determine described u according to following method, v:

Sequence set q _kChild group p _i

With

Be respectively:

$u_{q_k,p_i}=u_{q_k,p_m},$ $v_{q_k,p_i}=v_{q_k,p_m},$

Wherein,

Expression is the sequence length of short sequence, and length is

Index be k the basic sequence place sequence set be numbered q _k, length is

The basic sequence place the child group be numbered p _m, length is The basic sequence place the child group be numbered p _i, and I ∈ I-S, described I and described S are two index sets, described set I={2, and 3 ..., l}, l are the number of the sequence length in the collection of candidate sequences, and described S set is the subclass of set I or set I, and m is the element of S set intermediate value maximum.

30. method according to claim 21 is characterized in that,

Described n≤Q, wherein Q is for satisfying The number of sequence, u _{K, i}And v _{K, i}U and v for the child group i among the sequence set k.

31. a series processing device is characterized in that this device comprises

Sequence selection unit: be used for the group number k of the sequence set that receiving system distributes, select to make in the collection of candidate sequences function d (f _i(), G _k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group i among the sequence set k, and wherein i be the sub sequence number of organizing, and n is a natural number, wherein (a b) is a binary function to d, and k is the group number of sequence set, G _kBe an amount of determining by group number k, function f _i() is the function of son group i correspondence, and this domain of function is the described collection of candidate sequences of this child group i correspondence;

Series processing unit: be used for generating corresponding sequence, and on the running time-frequency resource of child group i correspondence, handle according to the sequence of the described son group i that constitutes.

32. series processing device according to claim 31 is characterized in that,

Described series processing unit is specially the sequence transmitter unit, and described sequence transmitter unit is used for generating corresponding sequence according to the described sequence that constitutes, and launches on corresponding running time-frequency resource; Perhaps,

Described series processing unit is specially the sequential reception unit, and described sequential reception unit is used for generating corresponding sequence according to the described sequence that constitutes, and receives on corresponding running time-frequency resource.

33. the method for sequence allocation in the communication system is characterized in that this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the above-mentioned method of choosing is specially: at least to a sequence set k, and at least two son group i wherein, the sequence of j is by making function d (f in the described collection of candidate sequences _i(), f _j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is a natural number, d (f _i(), f _j()) be a binary function, function f _i() or f _j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence;

Described sequence set is distributed to sub-district/user/channel.

34. method according to claim 33 is characterized in that,

Described sequence is to prick doffer-first Zadoff-Chu sequence or Gauss Gauss sequence.

35. method according to claim 33 is characterized in that,

The sequence candidates set of described son group is shift sequence, and function is f _i(x)=((2xr _i) modN _i)/N _i, f _j(x)=((2xr _j)) modN _j)/N _j, x is the cyclic shift index, N _i, N _jBe the length of sequence, r _i, r _jBasic sequence index for the Zadoff-Chu sequence.

36. according to any described method of claim 33-35, it is characterized in that,

Described function d (f _i(), f _j()) be | f _i-f _j|, perhaps

37. according to any described method of claim 33-35, it is characterized in that, this method further comprises: for non-centrosymmetrical resource occupation mode, cyclically shifted sequences in the candidate collection of the child group i that obtains and son group j is increased again the adjustment amount of cyclic shift, generate child group i in the same sequence set and the sequence of son group j, the adjustment amount of cyclic shift by the position of non-centrosymmetrical resource and centrosymmetric resource apart from decision.

38. method according to claim 36 is characterized in that,

When described function is f _i(x)=((2xr _i) modN _i)/N _i, and work as N _i, N _jWhen coprime, utilize division algorithm to calculate mN _i+ nN _j=1, obtain a=m, b=-n;

In the residue system that contracts, carry out a/2/r _iModN _i, b/2/r _jModN _jCalculating, the value that obtains is exactly the cyclic shift index of selected cyclically shifted sequences.

39. method according to claim 36 is characterized in that, as the index r of basic sequence _i, r _jOdd even is chosen making among son group i and the son group j not simultaneously | f _i-f _j| be the cyclically shifted sequences of the minimum value in the nonzero value.

40. method according to claim 35 is characterized in that, when the sequence of two or more length was arranged in the system, this method further comprised:

The sequence of choosing certain length is as fixed sequence program;

Sequence u outside the described fixed sequence program is except carrying out cyclic shift Offset _uIn addition, further shift reverse Offset on transform domain also ₁' r ₁/ N ₁, Offset wherein ₁The relative shift amount of the described fixed sequence program of ' expression, r ₁, N ₁Be the basic sequence index and the length of described fixed sequence program, Offset _uThe cyclic shift amount Offset that represents described sequence u self _u

41., it is characterized in that described fixed sequence program is specially sequence the shortest in the sequence set according to the described method of claim 40, or the longest sequence in the sequence set.

42. method according to claim 33 is characterized in that, after determining a sequence set, this method further comprises:

The identical cyclic shift that each sequence in the described definite sequence set is carried out on the transform domain obtains other sequence set.

43. method according to claim 36 is characterized in that,

Described d (the f that makes _i, f _j) minimum two sequences generate child group i in same group and the sequence of son group j through the cyclic shift adjustment amount on the transform domain again.

44. according to right 43 described methods, it is characterized in that, as basic sequence index r _i, r _jOdd even not simultaneously, and f _i-f _j=± 1/ (N _iN _j) time, the cyclic shift adjustment amount on the described transform domain is

N wherein _i, N _jBe the length of basic sequence.

45. according to claim 43 or 44 described methods, it is characterized in that, when sequence need be blocked or during cyclic extension, the cyclic shift adjustment amount on the described transform domain is-(((r ₁A) modN ₁)/N ₁+ (r ₂B) modN ₂/ N ₂)/2, wherein, b is owing to after blocking back or expansion, r ₁, N ₁The distance of the mirror image resources mapping of the sequence of decision, a is r ₁, N ₁Cyclic shift amount between the sequence of the mirror image resources mapping of the sequence of decision poor.

46. the processing unit of sequence in the communication system is characterized in that this device comprises:

The second sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, at least two son group i among the described sequence set k, the sequence of j is by making function d (f in the collection of candidate sequences corresponding with this child group _i(), f _j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is a natural number, d (f _i(), f _j()) be a binary function, function f _i() or f _j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence;

The second series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.

47. according to the described device of claim 46, it is characterized in that,

The described second sequence selection unit further comprises:

The cyclic shift determination module is used to adopt division algorithm to determine cyclic shift;

The cyclically shifted sequences generation module is used for generating corresponding cyclically shifted sequences according to the cyclic shift of determining.

48. the method that communication sequence distributes is characterized in that,

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, described collection of candidate sequences specifically is the time of basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that cyclically shifted sequences takies with respect to the distance of reference running time-frequency resource position;

Described sequence set is distributed to sub-district/user/channel.

49., it is characterized in that described basic sequence is the basic sequence of Zadoff-Chu sequence, perhaps the basic sequence of Gauss sequence according to the described method of claim 48.

50., it is characterized in that the described running time-frequency resource position that is specially sequence correspondence the longest in the system with reference to the running time-frequency resource position according to the described method of claim 48.

51. according to the described method of claim 48, it is characterized in that,

The process of determining described cyclically shifted sequences is specially:

The cyclic shift amount of choosing on the transform domain is-(cr ₂) modN ₂/ N ₂Sequence constitute described cyclically shifted sequences, wherein c represents running time-frequency resource position that corresponding cyclically shifted sequences the takies distance with respect to reference running time-frequency resource position, r ₂, N ₂Expression takies the basic sequence index and the length of sequence of the running time-frequency resource of reference.

52. according to the described method of claim 48, it is characterized in that, after determining a cyclically shifted sequences group, this method further comprises: each sequence in the described definite cyclically shifted sequences group is carried out cyclic shift identical on the transform domain and is obtained other cyclically shifted sequences group.

53. the processing unit of sequence in the communication system is characterized in that this device comprises:

The 3rd sequence selection unit: the group number k that is used for the sequence set of receiving system distribution, from the collection of candidate sequences corresponding, choose the sequence that obtains in each son group with this child group, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position;

The 3rd series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.

54. the method for sequence allocation in the communication system is characterized in that this method comprises:

Sequence in the sequence set is divided into a plurality of son groups, wherein, the mode that each height group correspondence running time-frequency resource separately takies;

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the method of above-mentioned generation is specially: the sequence in the group group need carry out that cyclic shift expands or when blocking, take the method that symmetry expands or symmetry is blocked to the sequence in the collection of candidate sequences;

Described sequence set is distributed to sub-district/user/channel.

Images