CN101399793A - Method and apparatus for sequence distributing, processing, and apparatus thereof - Google Patents

Abstract

The invention relates to an implementation mode which provides a sequence distribution and treatment method and a corresponding device in a communication system; the sequences of each sequence group are divided into a plurality of subgroups; the sequence of each subgroup is selected and obtained from a candidate sequence set which is corresponding to the subgroup according to a certain rule; the system assigns the determined sequences to a district/user/channel, and fixes a function fi(.) which is corresponding to a subgroup i, and the definition domain of the function is the candidate sequence set which the subgroup is corresponding to; the sequence of the subgroup i in a sequence group k consists of n sequences in which the value of a function d(fi(.), Gk, m<k, i>) is the smallest of the candidate sequence set, wherein, n is a natural number, d(a, b, c) is a ternary function, Gk is a quantity which is determined by a group number k, and m<k, i> is a quantity which is determined by the group number k and the subgroup i. The implementation mode avoids that the sequence related to the sequence strength with a certain length appears in other sequence groups, thus strong interference is reduced, large-scale sequence group forms are not need to be stored, and the complexity of the system 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 wireless communication system.

Background technology

In communication system, the class sequence (CAZAC, constantamplitude zero auto-correlate) with 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.

■ autocorrelation null cycle, 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.

Single-carrier frequency division multiple access (SC-FDMA for example, 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 utilize 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, utilizes its good auto-correlation and cross correlation, and the interference ratio between different sub-districts and different users' the arbitrary access front signal is less.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.

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.Be that example is described with the Zadoff-Chu sequence below.The generating mode of Zadoff-Chu sequence also is that 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.The cyclic shift that different q is corresponding different.The sequence that the different cyclic shifts of a sequence generate is called the cyclically shifted sequences that is generated by same basic sequence.The r value has determined basic sequence, and the q value has determined the different cyclic shift of same basic sequence.R is called the basic sequence index.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, promptly has good cross correlation.Especially, when being a prime number for N itself, r=1,2 ..., N-1 has generated N-1 different CAZAC sequence, and the cross correlation between these sequences is fine, Shang Mian example for 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 selecting the Zadoff-Chu sequence, when N is a prime number, the r value that different cell selecting is different can guarantee low 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 just in the sub-district, just choose the sequence of the prime number length around this subcarrier number, carry out blocking or sequence that the method for cyclic extension obtains wanting of sequence, launch then.In the following description, omitted a operation of expanding of blocking or circulate 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 between the transmitting of different districts is just smaller.

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, has used all strong jammings mutually between all users of sequence of this two kinds of length so.

Certainly, the 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 subcarriers/sampled point, 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, m _{K, i}) value minimum, inferior minimum, so that n less sequence formation, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i;

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

Embodiment of the present 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, m _{K, i}) value in minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an 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.

Embodiment of the present 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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i;

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.

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 the structural representation of emitter in the embodiment of the present invention;

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

Fig. 6 is the schematic flow sheet of receiving system 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.

The applicant 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.By comparison, technical solution of the present invention can the sequence of strong correlation be classified as one group with having more, the correlation between further having reduced not on the same group.

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 is as follows:

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, m _{K, i}) value minimum, inferior minimum so that n less sequence determined the sequence among the child group i among the sequence set k, and wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, m _{K, i}It is an amount of determining by group number k and sub-group number i.This rule is from collection of candidate sequences selects n sequence, makes the d (f of all other sequences _i(), G _k, m _{K, i}) all than the d (f of this n sequence _i(), G _k, m _{K, i}) 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 ..., 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 Z=0,1 ..., N _i-1 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 $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 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_{w_k,N_{p_1}}\left(z\right)\right\}}_{z=\mathrm{0,1},...,N_1-1}\right)=w_k/N_{p_1},$

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(\left\{a_{k,N_{p_1}}\right\}\right)=k/N_{p_1}.$

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

If aforementioned functions d (a, b c) are defined as | (a-b) modu c|, modu c wherein for make carry out after this operation function d (a, b, c) value belong to (c/2, c/2].So, the label among the sequence set k is p ₁The child group in satisfy $d(f_{p_1}(\&CenterDot;),G_k,m_{k,p_1})=d(f_{p_1}(\&CenterDot;),f_{p_1}\left(\left\{a_{k,N_{p_1}}\right\}\right),m_{k,p_1})$ Minimum sequence is meant and is designated as $r_{p_1}=k$ , length is

Sequence

At this moment $d(f_{p_1}(\&CenterDot;),G_k,m_{k,p_1})=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_q(\&CenterDot;),f_{p_1}\left(\left\{a_{k,N_{p_1}}\right\}\right),m_{k,q})$ N minimum 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 31 according to the shortest sequence length of resource occupation mode correspondence in the system, then in the said method $N_{p_1}=N_1=31$ , at this moment, have 30 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 293 in the sequence set, and to select sequence length be 293 child group as with reference to the son group, at this moment $N_{p_1}=N_2=293$ , have 292 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 290 groups of sequences like this.Because sequence number the shortest in the sequence set is less than 290, 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(), m _{K, i}) minimum n sequence and belong to same sequence set with reference to the sequence of selecting of son group j.Select different sequence, just produced different sequence set with reference to son group j.

It is pointed out that aforementioned functions d (a, b, c)=| (a-b) modu c|, can be different to the different child group of different sequence set or same sequence set.For example d of all son group employings of a sequence set (organize and adopt another one d (a, b, c) function for a, b by c) function, all sons of another one sequence set.Perhaps son group adopt a d (a, b, c) function, another one can adopt other a d (a, b, c) function for child group.Specifically, c gets different values in the function, just obtains 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}=N_1=31$ , then one have 30 sequence set.M shown in the application table 1 _{K, q}, select and make | (r _q/ N _q-k/N ₁) modu m _{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 2:

Table 1

N ₁＝31 N ₂＝47 N ₃＝59 N ₁＝31 N ₂＝47 N ₃＝59

Group number k m _{K, 2}m _{K, 3}Group number k m _{K, 2}m _{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 2

N ₁＝31 N ₂＝47 N ₃＝59 N ₁＝31 N ₂＝47 N ₃＝59

Group number k basic sequence basic sequence group number k basic sequence basic sequence

Index r ₂Index r ₃Index r ₂Index r ₃

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

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 2 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}=N_1=31$ , then one have 30 sequence set.M shown in the application table 3 _{K, q}, select and make | (r _q/ N _q-k/N ₁) modu m _{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 4:

Table 3

N ₁＝31 N ₂＝47 N ₃＝59 N ₁＝31 N ₂＝47 N ₃＝59

Group number k m _{K, 2}m _{K, 3}Group number k m _{K, 2}m _{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 4

N ₁＝31 N ₂＝47 N ₃＝59 N ₁＝31 N ₂＝47 N ₃＝59

Group number k basic sequence basic sequence group number k basic sequence basic sequence

Index r ₂Index r ₃Index r ₂Index r ₃

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 ₁) modu m _{K, q}| minimum, by checking, in the table 4 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.

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.It is known Integer N ₁, N ₂, e is to m _{K, q}=1, require integer f to make | (e/N ₁-f/N ₂) modu 1| 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 ₂) modu 1/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 ₂) modu 1/3| value minimum, work as N ₂Mod 3=0, f is

Work as N ₂Mod 3=1, f is

Work as N ₂Mod 3=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 ₂) modu 1/4| value minimum, work as N ₂Mod 2=0, f is

Work as N ₂Mod 4=1, f is

Work as N ₂Mod 4=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 _qDuring 〉=L, desirable m _{K, q}=1, N wherein _qBe the sequence length of child group q, L is by organizing sequence length with reference to son

Determine.Concrete, for $N_{p_1}=N_1=31$ , get L=139, then work as N _q=139 and during above length, m _{K, q}=1.Sequence is got L=191 through after the cyclic extension, then works 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 S kind, wherein 2 ^X-1＜S≤2 ^x, be each m _{K, q}The x of its concrete value of a storage representation bit.Also can store m _{K, q}The value rule, such as, work as N _qGet m during 〉=L _{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 ₁) modu m _{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 ₁) modu m _{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 ₁) modu m _{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-r_1/N_1)\mathrm{mod}u{m}_{r_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.

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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i.

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.

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 4, 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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i.

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.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 5, 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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i.

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.

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 6, 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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i.

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

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 (22)

1, the method for sequence allocation in a kind of communication system is characterized in that this method comprises:

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

Sequence in each son group is chosen generation from the collection of candidate sequences corresponding with this child group, the method for 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, m _{K, i}) value minimum, inferior minimum, so that n less sequence composition, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i;

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.

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

Described function f _i() is specially $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,$ R wherein _iBe the index of basic sequence in the collection of candidate sequences of this child group i correspondence, N _iBe the length of the sequence in the collection of candidate sequences of this child group i correspondence.

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

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

Be the length with reference to son group sequence, w _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 4 is characterized in that,

Described n is 1, perhaps according to described N _iWith

Determine the value of described n.

6, method according to claim 1 is characterized in that,

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

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

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.

8, method according to claim 6 is characterized in that, further comprises:

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

Determine.

9, according to any described method of claim 1-8, it is characterized in that,

Described function d (a, b c) be | (a-b) modu c|.

10, method according to claim 9 is characterized in that,

(c) the different child group to different sequence set or same sequence set can be different for a, b for described function d.

11, a kind of 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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an 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.

12, method according to claim 11 is characterized in that,

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

13, method according to claim 12 is characterized in that,

Described function f _i() is specially $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,$ R wherein _iBe the index of basic sequence in the collection of candidate sequences of this child group i correspondence, N _iBe the length of the sequence in the collection of candidate sequences of this child group i correspondence.

14, method according to claim 13 is characterized in that,

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

Be the length with reference to son group sequence, w _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.

15, method according to claim 14 is characterized in that,

Described n is 1, perhaps according to described N _iWith

Determine the value of described n.

16, method according to claim 11 is characterized in that,

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

17, method according to claim 16 is characterized in that, further comprises:

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.

18, method according to claim 16 is characterized in that, further comprises:

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

19, according to any described method of claim 11-18, it is characterized in that,

Described function d (a, b c) be | (a-b) modu c|.

20, method according to claim 19 is characterized in that,

(c) the different child group to different sequence set or same sequence set can be different for a, b for described function d.

21, a kind of 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, m _{K, i}) value minimum, inferior minimum, so that the sequence among the child group i among n the less sequence formation sequence set k, wherein n is a natural number, (a, b c) are one three meta-function, G to d _kBe an amount of determining by group number k, 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, m _{K, i}It is an amount of determining by group number k and sub-group number i;

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.

22, series processing device according to claim 21 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.

Images