CN101542935B - Sequence distributing, processing method and apparatus in communication system - Google Patents

Abstract

A method and apparatus for allocating and processing sequences in a communication system is disclosed. The method includes: the sequences in each sequence group are divided into multiple sub-groups; the sequences in each sub-group are obtained from a candidate sequence collection corresponding to the sub-group in a specific selection mode; the system allocates the determined sequences to the cells; for a sub-group i, a function fi(.) corresponding to the sub-group is determined, and the domain of the function is the candidate sequence collection corresponding to the sub-group; the sequences in the sub-group i in a sequence group k (k is the serial number of the sequence group) are n (n is a natural number) sequences selected from the candidate sequence collection, where the n sequences make the d (fi(.),Gk) function value smaller, d(a,b) is a two variables function, and Gk is a variable determined by the group number k.

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.

The application requires Chinese patent application number to be: 200710112774.3,200710073057.4,200710100449.5,200710103147.3 and the priority in first to file of 200710123676.X.

Background technology

In communication system, a class sequence (CAZAC, constantamplitude 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 divisionmultiple 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 for 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:

Obtain the group number k of the sequence set of system assignment;

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 to obtain the group number k of the sequence set of system assignment, 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.Described processing comprises and transmitting and receiving.

In above-mentioned sequence allocating method, series processing method 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 mode 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 u in the embodiment of the present invention, the computational process schematic diagram that v determines;

Fig. 4 is a schematic flow sheet of handling sequence method in the embodiment of the present invention;

Fig. 5 is the structural representation of series processing device in the embodiment of the present invention;

Fig. 6 is the structural representation of series processing device one embodiment in the embodiment of the present invention;

Fig. 7 is the structural representation of another embodiment of series processing device in the embodiment of the present invention.

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 or user or 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 mode of choosing 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 mode of choosing 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 is chosen mode and is from collection of candidate sequences and 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) mode of choosing of above-mentioned sequence allocation is described for example:

Each sequence set is made up of M son, son group 1,2 ..., 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 $a_{r_i,N_i}\left(z\right),z=\mathrm{0,1},...,N_i-1$ Total Ni-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 $f_i:\{a_{r_i,N_i}\left(z\right){\}}_{z=\mathrm{0,1,2},...,N_i-1}\→r_i/N_i,$ 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 $G_k=f_{p_1}\left({\left\{a_{c_k,N_{p_1}}\left(z\right)\right\}}_{z=\mathrm{0,1},...,N_1-1}\right)=c_k/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ Be 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 $G_k=f_{p_1}\left(\right\{a_{k,N_{p_1}}\left\}\right)=k/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}.$

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 $d(f_{p_1}(\&CenterDot;),G_k))=d(f_{p_1}(\&CenterDot;),f_{p_1}\left(\right\{a_{k,N_{p_1}}\left\}\right))$ Minimum sequence is meant and is designated as , length is

Sequence

At this moment $d(f_{p_1}(\&CenterDot;),G_k)=0.$

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{\&alpha;}}_l,{\mathrm{\&alpha;}}_{l-1},...,{\mathrm{\&alpha;}}_0}\left(n\right)=\exp (-2\mathrm{\&pi;j}({\mathrm{\&alpha;}}_l{n}^l+{\mathrm{\&alpha;}}_{l-1}{n}^{l-1}+...+{\mathrm{\&alpha;}}_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, and the span of l is a positive integer.When l=2, can get α ₂=r/N, wherein N is an integer.Work as N=2N ₁, α ₁=r (N ₁Mod2)/during N+2r/Np, it is r that the Gauss sequence is equivalent to index, N ₁The Zadoff-Chu sequence

As l〉2 the time, different α _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 $f_i:{\left\{a_{r_i,N_i}\left(z\right)\right\}}_{z=\mathrm{0,1,2},...,N_i-1}\&RightArrow;r_i/N_i,$ 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/2, therefore can not adopt this modu 1 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, $a_{r,N}{\left(z\right)}_{z=-(N_1-1)/2,...,-\mathrm{1,0,1,2},...,(N_1-1)/2}$ 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="H2008800001007E00021.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 (N _iN _j/ 2, N _iN _j/ 2].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 ... in time, similarly handle.

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.The definition of this metric function is suitable for the Zadoff-Chu sequence equally.

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): $f_{N_i}:{\left\{a_{r_i,N_i}\left(z\right)\right\}}_{z=\mathrm{0,1,2},...,N_i-1}\&RightArrow;r_i/N_i,$ Wherein s is subcarrier (or time-domain sampling) gap size of Radio Resource.To the Gauss sequence, function is $f_{N_i}:{\left\{a_{s^l{r}_i,N_i}\left(z\right)\right\}}_{z=\mathrm{0,1,2},...,N_i-1}\&RightArrow;r_i/N_i,$ 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 $N_{p_{}}$ ${{}_1}_{}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1=11,$ 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 $N_{p_{}}$ ${{}_1}_{}=N_2=37,$ 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, 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 $N_{p_{}}$ ${{}_1}_{}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1=11,$ 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

N 1=11 group number k	N 2=23 basic sequence index r 2	N 3=37 basic sequence index r 3	N 1=11 group number k	N 2=23 basic sequence index r 2	N 3=37 basic sequence index r 3
						1	2	3	6	13	20
2	4	7	7	15	24
						3	6	10	8	17	27
4	8	13	9	19	30
						5	10	17	10	21	34

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 guarantees that just the correlation between the sequence is higher, and by checking, the correlation between the sequence in the table 1 in each sequence set is all very high.

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.

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.

If aforementioned functions d (a b) is defined as | (a-b) modum _{K, i}|, modum wherein _{K, i}Carry out function d after this operation (a, b) value belongs to (m for making _{K, i}/ 2, m _{K, i}/ 2], m _{K, i}Be an amount of determining by group number k and sub-group number i, m _{K, i}=1/B, wherein B is natural number, i.e. m _{K, i}∈ 1,1/2,1/3,1/4 ....

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

To sequence set k=1,2 ..., choose label p ₁The child group as with reference to son group, define aforementioned G _kFor $G_k=f_{p_1}\left({\left\{a_{w_k,N_{p_1}}\left(z\right)\right\}}_{z=\mathrm{0,1},...,N_1-1}\right)=w_k/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$

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

The basic sequence index of long sequence.Especially, can choose w _k=k, then G _kFor $G_k=f_{p_1}\left(\right\{a_{k,N_{p_1}}\left\}\right)=k/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}.$ So, the label among the sequence set k is p ₁The child group in satisfy $d(f_{p_1}(\&CenterDot;),G_k)=d(f_{p_1}(\&CenterDot;),f_{p_1}\left(\right\{a_{k,N_{p_1}}\left\}\right))$ Minimum sequence is meant and is designated as ${\mathrm{<figure-callout\; id="1"\; label="r\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">r</figure-callout>}}_{p_{}}$ , length is

Sequence

At this moment $d(f_{p_1}(\&CenterDot;),G_k)=0.$

The sequence of child group i=q among the sequence set k is that length is N _q, satisfy $\left|(r_q/N_q-k/N_{p_1})\mathrm{mod}u{m}_{k,q}\right|$ Minimum, inferior minimum, so that n less sequence, promptly satisfied $d(f_{p_1}(\&CenterDot;),f_{p_1}\left(\right\{a_{k,N_{p_1}}\left\}\right))$ N minimum sequence.

It is pointed out that aforementioned functions d (a, b)=| (a-b) modu m _{K, i}|, can be different to the different child group of different sequence set or same sequence set.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, m in the function _{K, i}Get different values, just obtain different metric function.

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

Have 3 son groups in the present embodiment, it is 31,47 and 59 Zadoff-Chu sequence that the sequence candidates set is respectively length, three kinds of resource occupation modes of correspondence.Select $N_{p_{}}$ ${{}_1}_{}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1=31,$ Then one have 30 sequence set.M shown in the application table 2 _{K, q}, select and make | (r _q/ N _q-k/N ₁) modum _{K, q}| minimum sequence is grouped into respectively in each sequence set, and each son group has only a sequence, and the sequence index expression of basic sequence will obtain as following table 3:

Table 2

N1=31 group number k	N 2＝47m k，2	N 3＝59m k，3	N 1=31 group number k	N 2＝47m k，2	N 3＝59m k，3
						1	1/2	1	16	1/3	1/2
2	1	1	17	1/4	1/2
						3	1/2	1/3	18	1/3	1
4	1	1/2	19	1	1
						5	1/2	1/2	20	1/3	1

6	1	1/2	21	1	1
						7	1/2	1/3	22	1/3	1
8	1	1	23	1	1
						9	1/3	1	24	1/2	1/3
10	1	1	25	1	1/2
						11	1/3	1	26	1/2	1/2
12	1	1	27	1	1/2
						13	1/3	1	28	1/2	1/3
14	1/4	1/2	29	1	1
						15	1/3	1/2	30	1/2	1

Table 3

N 1=31 group number k	N 2=47 basic sequence index r 2	N 3=59 basic sequence index r 3	N 1=31 group number k	N 2=47 basic sequence index r 2	N 3=59 basic sequence index r 3
						1	25	2	16	40	1
2	3	4	17	14	3
						3	28	45	18	43	34
4	6	37	19	29	36
						5	31	39	20	46	38
6	9	41	21	32	40
						7	34	33	22	2	42
8	12	15	23	35	44

N 1=31 group number k	N 2=47 basic sequence index r 2	N 3=59 basic sequence index r 3	N 1=31 group number k	N 2=47 basic sequence index r 2	N 3=59 basic sequence index r 3
						9	45	17	24	13	26
10	15	19	25	38	18

11	1	21	26	16	20
						12	18	23	27	41	22
13	4	25	28	19	14
						14	33	56	29	44	55
15	7	58	30	22	57

Top group technology is feasible | (r _q/ N _q-k/N ₁) modu m _{K, q}| minimum, by checking, the sequence in the table 3 all be with reference of same sequence set group in the sequence of sequence strongest correlation, the correlation of the sequence between further having reduced not on the same group makes that interference becomes less between group.

When the number of subcarrier of carrying sequence in the sub-district is not prime number, need choose the sequence of the prime number length around this subcarrier number, by blocking or sequence that the method for cyclic extension obtains wanting of sequence, launch then.

Be example below with the cyclic extension.Present embodiment has the subcarrier numbers of three kinds of carrying sequences, is respectively 36,48,60, chooses the sequence less than the largest prime length of subcarrier number, and promptly corresponding respectively length is that 31,47 and 59 Zadoff-Chu sequence obtains by cyclic extension.Select $N_{p_{}}$ ${{}_1}_{}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1=31,$ Then one have 30 sequence set.M shown in the application table 4 _{K, q}, select and make | (r _q/ N _q-k/N ₁) modum _{K, q}| minimum sequence is grouped into respectively in each sequence set, and each son group has only a sequence, and the sequence index expression of basic sequence will obtain as following table 5:

Table 4

N 1=31 group number k	N 2＝47m k，2	N 3＝59m k，3	N 1=31 group number k	N 2＝47m k，2	N 3＝59m k，3
						1	1/2	1	16	1/3	1/2
2	1	1	17	1	1/3
						3	1/2	1/3	18	1/3	1/3

4	1	1/2	19	1	1
						5	1/2	1/2	20	1/3	1
6	1	1/2	21	1	1
						7	1/3	1/3	22	1/3	1
8	1	1	23	1	1
						9	1/3	1	24	1/3	1/3
10	1	1	25	1	1/2
						11	1/3	1	26	1/2	1/2
12	1	1	27	1	1/2
						13	1/3	1/3	28	1/2	1/3
14	1	1/3	29	1	1
						15	1/3	1/2	30	1/2	1

Table 5

N 1=31 group number k	N 2=47 basic sequence index r 2	N 3=59 basic sequence index r 3	N 1=31 group number k	N 2=47 basic sequence index r 2	N 3=59 basic sequence index r 3
						1	25	2	16	40	1
2	3	4	17	26	52
						3	28	45	18	43	54
4	6	37	19	29	36
						5	31	39	20	46	38
6	9	41	21	32	40
						7	42	33	22	2	42
8	12	15	23	35	44

9	45	17	24	5	26
						10	15	19	25	38	18
11	1	21	26	16	20
						12	18	23	27	41	22
13	4	5	28	19	14
						14	21	7	29	44	55
15	7	58	30	22	57

Top group technology is feasible | (r _q/ N _q-k/N ₁) modum _{K, q}| minimum, by checking, in the table 5 sequence all be with same sequence set in reference length in the sequence of sequence strongest correlation, the correlation of the sequence between further having reduced not on the same group makes to disturb between group to become less.

To m _{K, q}Value, specifically can be: work as N _q〉=L _rThe time, desirable m _{K, q}=1, N wherein _qBe the sequence length of child group q, L _rBy organizing sequence length with reference to son

Determine.Concrete, for ${\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1=31,$ Get L _r=139, then work as N _q=139 and during above length, m _{K, q}=1.Sequence is got L through after the cyclic extension _r=191, then work as N _q=191 and during above length sequences, m _{K, q}=1.

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

Preferable, n is 1, that is to say, as above in the example, selects and makes | (r _q/ N _q-k/N ₁) modum _{K, q}| a minimum sequence is grouped among the son group q.

Preferable, n is the natural number greater than 1, the value of n is organized N according to son _qWith reference group N ₁The length difference determine.That is to say, | (r _q/ N _q-k/N ₁) modum _{K, q}| minimum r _qNear the sequence of several basic sequence index correspondences is grouped in the son group, general r in minimum _qNear immediate n, the selection of concrete n still will be seen N ₁, N _qThe length difference.For example, work as N _qBe N ₁4 times of left and right sides the time, just can select 2 r _qBe grouped in this group.General, can select n=|N _q/ (2N ₁) |, wherein

Expression is greater than the integer of the minimum of z.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, and for example made | (r _q/ N _q-k/N ₁) modum _{K, q}| minimum r _q=f, then less n is f ± 1, f ± 2 .....Transmitter and receiver can calculate according to this method, but not storage.

Because when the correlation of two sequences that Zadoff-Chu sequence length is different is strong, $\left|(r_q/N_q-{\mathrm{<figure-callout\; id="1"\; label="r"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">r</figure-callout>}}_1/N_1)\mathrm{mod}u{m}_{{\mathrm{<figure-callout\; id="1"\; label="r"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">r</figure-callout>}}_1,q}\right|$ Necessarily smaller.Above distribution method in, guaranteed not two son group i on the same group, between the j sequence $\left|(r_i/N_i-r_j/N_j)\mathrm{mod}u{m}_{r_j,i}\right|$ 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 between group with sequence with reference to the sequence time strongest correlation of son group.

In other embodiments, aforementioned functions d (a, b) definition also can for

Or

Function d (a, b) infinity in the definition can guarantee some sequence is removed, and the correlation between guaranteeing not on the same group is low.

It is pointed out that aforementioned functions Perhaps

Different child group to different sequence set or same 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 $f_i:\{a_{r_i,N_i}\left(z\right){\}}_{z=\mathrm{0,1,2},...,N_i-1}\&RightArrow;r_i/N_i$ Above-mentioned embodiment in, when The time, present embodiment is exactly: choose feasible $u\&le;(r_i/N_i-k/N_{p_1})\&le;v$ 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 $(r_m/N_m-k/N_{p_1})\&GreaterEqual;0$ Minimum sequence selects being equivalent to of negative direction to get $(k/N_{p_1}-r_m/N_m)\&GreaterEqual;0$ Minimum sequence.For example, be N in sub-group length _mThe time, calculate with

Minimum positive negative test is respectively that difference is 0.036 r _mWith difference be-0.025 Certainly, with length be Sequence $r_{p_{}}$ ${{}_1}_{}=k$ Strongest correlation be

If 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),$ The length of reference sequences wherein

The shortest sequence length of choosing,

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 6

N 1=11 group number k	N 2=23 basic sequence index r 2	N 3=37 basic sequence index r 3	N 4=47 basic sequence index r 4
				1	2	3、4	3、4、5
2	4	6、7、8	7、8、9、10
				3	6、7	9、10、11	12、13、14
4	8、9	13、14	16、17、18
				5	10、11	16、17、18	20、21、22
6	12、13	19、20、21	25、26、27
				7	14、15	23、24	29、30、31
8	16、17	26、27、28	33、34、35
				9	19	29、30、31	37、38、39、40
10	21	33、34	42、43、44

All satisfy between any two sequences in the table 6 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.Select the shortest sequence as the reference sequence, then

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 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 ₁, 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, $N_{p_{i-1}}<N_{p_i}.$

Step 1001, to sequence set q ₁Child group P ₁, ${\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}=-1/\left(2N_{p_1}\right)+{\mathrm{\&delta;}}_u,$ Wherein $1/N_{p_L}-1/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.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 ₁, $v_{q_{N_{p_1}-1},{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">p</figure-callout>}}_1}=1/\left(2N_{p_1}\right)+{\mathrm{\&delta;}}_v,$ 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 P ₁

$k=1,\&CenterDot;\&CenterDot;\&CenterDot;,N_{p_1}-2,$ Be respectively:

$v_{q_k,{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">p</figure-callout>}}_1}=-1/D,$ $u_{q_{k+1},{\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="H2008800001007E00021.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. 3, sequence set q _kChild group P _i

With sequence set q _K+1Child group P _i

$k=1,\&CenterDot;\&CenterDot;\&CenterDot;,N_{p_1}-2,$ 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="H2008800001007E00021.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="H2008800001007E00021.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}}_{q_{k+1},p_{i-1}}\&GreaterEqual;0$ And $|r_{p_{i-1}}/N_{p_{i-1}}-{\mathrm{left}}_{q_{k+1},p_{i-1}}|$ 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+1},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 $r_{q_k,p_{i-1}}/N_{p_{i-1}}+1/C_{p_{i-1}}$ Less than sequence set q _K+1Left margin

$u_{q_{k+1},p_i}{=u}_{q_{k+1},p_{i-1}}.$

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="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ ${\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}+1/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.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="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ ${\mathrm{left}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}\&prime;={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}+({\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}+1)/{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.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="H2008800001007E00021.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="H2008800001007E00021.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}|$ When obtaining minimum value

When ${\mathrm{<figure-callout\; id="1"\; label="r\; q"\; filenames="H2008800001007E00021.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="H2008800001007E00021.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="H2008800001007E00021.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="H2008800001007E00021.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}\&prime;\&GreaterEqual;0$ The time,

${\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}={\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.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{<figure-callout\; id="1"\; label="lef\; t\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">lef</figure-callout>}{t}_{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}}_{{\mathrm{<figure-callout\; id="1"\; label="q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">q</figure-callout>}}_1,p_{i-1}}\&prime;<0$ The time, ${\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}}{=\mathrm{<figure-callout\; id="1"\; label="u\; q"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">u</figure-callout>}}_{q_{}};$

Especially, can get $C_{p_{i-1}}=2N_{p_{i-1}}.$

Step 1003, sequence set q _kChild group p _i With

$k=1,\&CenterDot;\&CenterDot;\&CenterDot;,N_{p_1}-1,$ 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,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.

Get δ in the following Example _u=0, δ _v=0, $D=2{\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}},$ $C_{p_{i-1}}=2N_{p_{i-1}},$ 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,1, so v _4,2=v _4,1, i.e. v ₄, 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,20 and | r _5,2/ N ₂-left _5,2| obtain minimum value, because r _5,2/ N ₂-1/2 (N ₂)-right _4,20, 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,20, 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,30, 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 7

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 8

N 1=11 group number k	N 2=23 basic sequence index r 2	N 3=37 basic sequence index r 3	N 4=47 basic sequence index r 4
				1	2、3	2、3、4、5	3、4、5、6
2	4、5	6、7、8	8、9、10
				3	6、7	9、10、11	12、13、14

N 1=11 group number k	N 2=23 basic sequence index r 2	N 3=37 basic sequence index r 3	N 4=47 basic sequence index r 4
				4	8、9	13、14、15	16、17、18、19
5	10、11	16、17、18	20、21、22、23
				6	12、13	19、20、21	24、25、26、27
7	14、15	22、23、24	28、29、30、31
				8	16、17	26、27、28	33、34、35
9	18、19	29、30、31	37、38、39
				10	20、21	32、33、34、35	41、42、43、44

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 example, for the system bandwidth of 5M, sequence length wherein has: 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, i}And u _{5, 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=u5,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,20 and | r _5,2/ N ₂-left _5,2| obtain minimum value, because r _5,2/ N ₂-1/2 (N ₂)-right _4,20, 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,20, 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,30 and | r _5,3/ N ₃-left _5,3| obtain minimum value, because r _5,3/ N ₃-1/ (2N ₃)-right _4,30, 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 9

N 1=11 group number k	5
		N 2=23 basic sequence index r 2	10、11
N 3=37 basic sequence index r 3	16、17、18
		N 4=47 basic sequence index r 4	20、21、22、23
N 5=59 basic sequence index r 5	25、26、27、28、29
		N 6=71 basic sequence index r 6	30、31、32、33、34、35
N 7=97 basic sequence index r 7	41、42、43、44、45、46、47、48
		N 8=107 basic sequence index r 8	45、46、47、48、49、50、51、52、53
N 9=113 basic sequence index r 9	48、49、50、51、52、53、54、55、56
		N 10=139 basic sequence index r 10	59、60、61、62、63、64、65、66、67、68、69
N 11=179 basic sequence index r 11	75、76、77、78、79、80、81、82、83、84、85、86、87、88、89
		N 12=191 basic sequence index r1 2	81、82、83、84、85、86、87、88、89、90、91、92、93、94、95

N 13=211 basic sequence index r 13	89、90、91、92、93、94、95、96、97、98、99、100、101、102、103、104、105
		N 14=239 basic sequence index r 14	101、102、103、104、105、106、107、108、109、110、111、112、113、114、115、116、117、118、119
N 15=283 basic sequence index r 15	119、120、121、123、124、125、126、127、128、129、130、131、132、133、134、135、136、137、138、139、140、141
		N 16=293 basic sequence index r 16	123、124、125、126、127、128、129、130、131、132、133、134、135、136、137、138、139、140、141、142、143、144、145、146

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 of 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.

In the top embodiment, describedly choose n sequence, 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/ (2N1), 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 above-mentioned each embodiment, 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 the index that calculates the sequence in the child group of the needs length that belongs to same sequence set according to the mode of as above choosing is r _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 mode of choosing is distributed to the sub-district with sequence set, introduce the method that a kind of communication sequence is handled below, with reference to figure 4, detailed process is:

Step 201 obtains the group number k of the sequence set of system assignment.

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 handled on corresponding running time-frequency resource according to the corresponding transmitting sequence of the sequence generation of the child group i of described formation.

The processing of described communication sequence can specifically be divided into the emission of communication sequence and the reception of communication sequence, and wherein the processing of Jie Shouing generally comprises the sequence of generation and the related operation of the signal that receives.Usually, receive operation and be specially, to obtain channel estimation value or to obtain the related operation etc. of time synchronized.

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 processing mode of sequence can be that the frequency domain processing also can be that time domain is handled.Each function in the said method specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.

When function d (a, b) be d (a, b)=| (a-b) | the time, be example with the Zadoff-Chu sequence, antithetical phrase group m selects and makes | r _m/ N _m-k/N ₁| the sequence of absolute value minimum be grouped among the sequence set k, so just can guarantee that the correlation between the sequence is higher, thereby the correlation between group is reduced.

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.

If function d (a b) is | (a-b) modum _{K, i}|, be example still with the Zadoff-Chu sequence, choose label P ₁The child group as with reference to son group,

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

The basic sequence index of long sequence, N _iBe the length of the sequence of child group i, r _iBe the N that determines by sequence set k _iThe basic sequence index of long sequence, then $\left|(a-b)\mathrm{mod}u{m}_{k,i}\right|=\left|(r_i/N_i-c_k/N_{p_1})\mathrm{mod}u{m}_{k,i}\right|.$ Especially, can choose ${\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1,$ c _k=k, select feasible to the child group i=q among the sequence set k | (r _q/ N _q-k/N ₁) modum _{K, q}| minimum sequence is grouped among the sequence set k, the sequence of selecting like this be with same sequence set in reference length in the sequence of sequence strongest correlation, the correlation of the sequence between further having reduced not on the same group makes to disturb between group to become less.

In the concrete realization, ask feasible | (r _q/ N _q-k/N ₁) modu m _{K, q}| minimum index r _q, can be generalized into general method, i.e. r _q=B ^-1* round (B * k * N _q/ N ₁), B=1/m wherein _{K, q}, B ^-1For making B * B ^-1ModN _q=1 natural number, round (z) expression and the immediate integer of z.

Specify for example below.Known Integer N ₁, N ₂, e is to m _{K, q}=1, require integer f to make | (e/N ₁-f/N ₂) modu1| value minimum, obviously f is and eN ₂/ N ₁Immediate integer w is down and rounds Round perhaps

To m _{K, q}=1/2, require integer f to make | (e/N ₁-f/N ₂) modu1/2| value minimum, f is To N ₂Delivery, promptly Wherein w is and 2eN ₂/ N ₁Immediate integer is down and rounds

Round perhaps

To m _{K, q}=1/3, require integer f to make | (e/N ₁-f/N ₂) modu1/3| value minimum, working as N2mod3=0, f is

, work as N ₂Mod3=1, f is

Work as N ₂Mod3=2, f is

Wherein w is and 3eN ₂/ N ₁Immediate integer is down and rounds

Round perhaps

To m _{K, q}=1/4, require integer f to make | (e/N ₁-f/N ₂) modu1/4| value minimum, work as N ₂Mod2=0, f is

, work as N ₂Mod4=1, f is

Work as N ₂Mod4=3, f is

Wherein w is and 4eN ₂/ N ₁Immediate integer is down and rounds

Round perhaps

As fully visible, by storage m _{K, q}And simple calculating, just can obtain the sequence among the child group q among the sequence set k.According to m _{K, q}The characteristic of itself can reduce m _{K, q}The complexity of storage, specific as follows:

The m of the child group q of different sequence set k _{K, q}Has symmetry, i.e. m _{K, q}=m _{T-k, q}, wherein T is total sequence set number.Therefore store the m under 1≤k≤T/2 situation in advance _{K, q}, can obtain the m under 1≤k≤T situation _{K, q}Perhaps store the m under T/2＜k≤T situation in advance _{K, q}, also can obtain the m under 1≤k≤T situation _{K, q}

Work as N _q〉=L _rThe time, desirable m _{K, q}=1, N wherein _qBe the sequence length of child group q, L _rBy organizing sequence length with reference to son

Determine.Concrete, for ${\mathrm{<figure-callout\; id="1"\; label="N\; p"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_{p_{}}={\mathrm{<figure-callout\; id="1"\; label="N"\; filenames="H2008800001007E00021.png"\; state="\{\{state\}\}">N</figure-callout>}}_1=31,$ Get L _r=139, then work as N _q=139 and during above length, m _{K, q}=1.Sequence is got L through after the cyclic extension _r=191, then work as N _q=191 and during above length sequences, m _{K, q}=1.

M to the child group q correspondence among the sequence set k _{K, q}, can store m _{K, q}Concrete value.Concrete, can represent m with x bit _{K, q}The possible different value of W kind, wherein 2 ^X-1＜W≤2 ^x, be each m _{K, q}The x of its concrete value of a storage representation bit.Also can store m _{K, q}Value choose mode, such as, work as N _q〉=L _rThe time get m _{K, q}=1.

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 the mode of choosing 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 communication sequence processing unit of using above-mentioned communication sequence processing method is provided below, and with reference to figure 5, this device comprises:

Sequence selection unit: be used to obtain the group number k of the sequence set of system assignment, 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.

Series processing unit: be used for sequence selection or the corresponding sequence of generation, and on the running time-frequency resource of child group i correspondence, handle according to the child group i of described formation.

As shown in Figure 6, 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.This moment, described communication sequence processing unit just was specially the communication sequence emitter.

As shown in Figure 7, described series processing unit also can be 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.This moment, described communication sequence processing unit just was specially the communication sequence receiving system.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.

Relevant function in the described communication sequence processing unit and concrete processing can with aforementioned distribution method and processing 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 processing mode of sequence can be that the frequency domain processing also can be that time domain is handled.

Aforementioned communication series processing device, sequence selection unit wherein adopt certain mode of choosing 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 (22)

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, each height group correspondence running time-frequency resource occupancy mode separately;

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 in the described collection of candidate sequences

Perhaps

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, Be the length with reference to son group sequence, c _kDetermine by sequence set k

The basic sequence index of long sequence, reference are organized the child group for sequence length maximum in the child group of sequence length minimum in the sequence set or the sequence set, r _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; Wherein, m _{K, i}Be the amount of determining by group number k and sub-group number i,

Described sequence set is distributed to sub-district or user or channel,

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

2. 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.

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

Described n is according to described N _iWith

The value of determining, perhaps

Wherein

Expression is not more than the integer of the maximum of z.

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

Described m _{K, i}=1/B, wherein B is a natural number.

5. according to claim 1 or 4 described methods, it is characterized in that, further comprise:

Work as N _i〉=L _rThe time, get m _{K, i}=1, N wherein _iBe the sequence length in the collection of candidate sequences of child group i correspondence, L _rBy organizing sequence length with reference to son

Determine.

6. according to claim 1 or 4 described methods, it is characterized in that, further comprise:

Storage in advance and k, the corresponding m of i _{K, i}, 1≤k≤T/2, perhaps

Storage in advance and k, the corresponding m of i _{K, i}, T/2＜k≤T, wherein T is total sequence set number.

7. method according to claim 1 is characterized in that, further comprises:

Make described function

Perhaps

The basic sequence index of value minimum

B wherein ^-1For making B * B ^-1ModN _i=1 natural number, round (z) expression and the immediate integer of z.

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

Described function Perhaps

Different child group difference to different sequence set or same sequence set.

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

r _iFor under round

Round perhaps

, or

r _iFor Perhaps

10. handle the method for sequence in the communication system, it is characterized in that,

Obtain the group number k of the sequence set of system assignment;

By selecting to make function in the collection of candidate sequences

Perhaps

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, k is the group number of sequence set, and i is the sequence number that son is organized, and n is a natural number, Be the length with reference to son group sequence, c _kDetermine by sequence set k

The basic sequence index of long sequence, reference are organized the child group for sequence length maximum in the child group of sequence length minimum in the sequence set or the sequence set, r _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; Wherein, m _{K, i}Be the amount of determining by group number k and sub-group number i;

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,

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

11. method according to claim 10 is characterized in that,

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

12. method according to claim 10 is characterized in that,

Described n is according to described N _iWith

The value of determining;

Perhaps

Wherein

Expression is not more than the integer of the maximum of z.

13. method according to claim 10 is characterized in that,

Described m _{K, i}=1/B, wherein B is a natural number.

14. according to claim 10 or 13 described methods, it is characterized in that, further comprise:

Storage in advance and k, the corresponding m of i _{K, i}, 1≤k≤T/2, perhaps

Storage in advance and k, the corresponding m of i _{K, i}, T/2＜k≤T, wherein T is total sequence set number.

15. according to claim 10 or 13 described methods, it is characterized in that, further comprise:

Work as N _i〉=L _rThe time, get m _{K, i}=1, N wherein _iBe the sequence length in the collection of candidate sequences of child group i correspondence, L _rBy organizing sequence length with reference to son Determine.

16. according to claim 10 or 13 described methods, it is characterized in that, further comprise:

Make described function Perhaps

The basic sequence index of value minimum

B wherein ^-1For making B * B ^-1ModN _i=1 natural number, round (z) expression and the immediate integer of z.

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

Described function

Perhaps

Different child group to different sequence set or same sequence set can be different.

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

r _iFor under round

Round perhaps

, or

r _iFor

Perhaps

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

Sequence selection unit: be used to obtain the group number k of the sequence set of system assignment, select to make in the collection of candidate sequences function Perhaps

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, k is the group number of sequence set, and i is the sequence number that son is organized, and n is a natural number,

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

The basic sequence index of long sequence, reference are organized the child group for sequence length maximum in the child group of sequence length minimum in the sequence set or the sequence set, r _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; Wherein, m _{K, i}Be the amount of determining by group number k and sub-group number i,

The 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,

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

20. series processing device according to claim 19 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.

21. series processing device according to claim 19 is characterized in that,

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

22. series processing device according to claim 19 is characterized in that,

Described n is according to described N _iWith

The value of determining;

Perhaps

Wherein

Expression is not more than the integer of the maximum of z.

Images