CN101262687A - Sequence allocation method and device - Google Patents

Sequence allocation method and device Download PDF

Info

Publication number
CN101262687A
CN101262687A CNA2007101004495A CN200710100449A CN101262687A CN 101262687 A CN101262687 A CN 101262687A CN A2007101004495 A CNA2007101004495 A CN A2007101004495A CN 200710100449 A CN200710100449 A CN 200710100449A CN 101262687 A CN101262687 A CN 101262687A
Authority
CN
China
Prior art keywords
sequence
group
function
sequences
son
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2007101004495A
Other languages
Chinese (zh)
Other versions
CN101262687B (en
Inventor
曲秉玉
何玉娟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to CN2007101004495A priority Critical patent/CN101262687B/en
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to DE602008004885.3T priority patent/DE602008004885C5/en
Priority to EP20080715167 priority patent/EP2101419B1/en
Priority to AT08715167T priority patent/ATE498249T1/en
Priority to BRPI0808183A priority patent/BRPI0808183B1/en
Priority to PT08715167T priority patent/PT2101419E/en
Priority to DK08715167T priority patent/DK2101419T3/en
Priority to JP2009546637A priority patent/JP4922412B2/en
Priority to BR122015028224-1A priority patent/BR122015028224B1/en
Priority to PL08715167T priority patent/PL2101419T3/en
Priority to PCT/CN2008/070431 priority patent/WO2008106894A1/en
Priority to SI200830203T priority patent/SI2101419T1/en
Priority to KR20097015469A priority patent/KR101095420B1/en
Publication of CN101262687A publication Critical patent/CN101262687A/en
Priority to US12/493,869 priority patent/US8249006B2/en
Priority to HR20110288T priority patent/HRP20110288T1/en
Priority to US13/330,252 priority patent/US8644239B2/en
Priority to US13/545,707 priority patent/US8588168B2/en
Application granted granted Critical
Publication of CN101262687B publication Critical patent/CN101262687B/en
Priority to US14/068,124 priority patent/US9143295B2/en
Priority to US14/842,618 priority patent/US9819434B2/en
Priority to US15/807,774 priority patent/US10389468B2/en
Priority to US16/436,413 priority patent/US11057141B2/en
Priority to US17/349,664 priority patent/US11716120B2/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a sequence distribution method and a corresponding sequence transmitting and receiving method and a device thereof. Sequences in each sequence group are divided into a plurality of subgroups; the sequences in each subgroup are obtained by being selected from a candidate sequence set corresponding to the subgroup according to certain rules; the determined sequences are allocated to a subarea by the system. As for the subgroup m, a function fm(question mark) corresponding to the subgroup is determined and the definition domain of the function is the candidate sequence set corresponding to the subgroup; wherein, the sequences in the subgroup m of the sequence group k are determined by selecting n sequences in the candidate sequence set while the sequences cause values of a function d (fm (question mark), Gk) to be smaller, wherein, k is a group number of the sequence group, m is a sequence number of the subgroup, n is a natural number depending on m, d(a, b) is a binary function and Gk is a value determined by the group number k. The occurrence of the sequence highly correlative to a certain length of the sequence can be avoided in other sequence groups, thus reducing strong interference. No tables for storing the large-scale sequence group are required, thus the complexity of the system is reduced.

Description

Sequence allocating method and device
Technical field
The present invention relates to wireless communication field, particularly a kind of communication sequence distribution technique.
Background technology
In communication system, a class sequence (CAZAC, the constantamplitude zero auto-correlate) sequence 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.
■ autocorrelation null cycle, except with self correlation maximum, other cyclic shift auto-correlation of this sequence self is zero.
Because it has above-mentioned character,, also be the CAZAC sequence in the sequence of frequency domain therefore through behind the Fourier transform.Such characteristic especially 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, promptly the unit of CAZAC sequence is launched on a plurality of subcarriers in order, the signal of launching on each subcarrier is the unit of CAZAC sequence, 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, therefore, receiver can compare the fair channel fading that estimates on each subcarrier, can be not smaller because of signal amplitude on individual subcarriers, and influence estimation performance; 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, arbitrary access front signal in the single carrier-frequency division multiple access system, can adopt the CAZAC sequence, utilize the good auto-correlation and the cross correlation of CAZAC sequence, 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 (Fourier) conversion 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:
Figure A20071010044900111
Wherein, r is the parameter that sequence generates, and is the number relatively prime 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.For two different r values, r=u for example, r=v, when (u-v) and N were relatively prime, 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 generated N-1 different sequence, and the cross correlation between these sequences is fine, Shang Mian example for example, and when N was prime number, the absolute value of normalized cross-correlation was 1/ between two sequences
Figure A20071010044900112
The conjugation of Zadoff-Chu sequence also is the CAZAC sequence.
Above-mentioned CAZAC sequence auto-correlation and their cross correlation preferably arranged, in addition, also have a kind of Gauss (Gauss) sequence that good auto-correlation and their cross correlation are also arranged.The generation formula of Gauss sequence is:
b α l , α l - 1 , . . . , α 0 ( n ) = exp ( - 2 πj ( α l n l + α l - 1 n l - 1 + . . . + α 0 ) ) , n = 0,1,2 , . . . , N Formula (2)
Work as l=2, the time, be the equivalence transformation of Zadoff-Chu sequence.When N is integer, the factor alpha of the item of high-order l lR/N in corresponding the Zadoff-Chu sequence, obvious l=2, α 2=r/N.When l＞2, different α l=r/N, 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.. determines.We use a R, N(n) expression α lOne or more sequence of the Gauss of=r/N
Figure A20071010044900121
On behalf of sequence, one of them be called basic sequence.
In common cellular communication system, not only to consider the signal of this sub-district, also to consider the interference between signals of the emission of different districts.When a cell selecting after the emission of sequence modulation, the another one sub-district will select another to have the sequence of fine 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 to disturb 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 characteristic of former sequence 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 length around this subcarrier number, carry out blocking or sequence that the method for recursive copying obtains wanting of sequence, launch then.Therefore in the description below, will ignore the operation to sequence, the sequence of generation is defaulted as prime length.
When the signal of a plurality of sequences of different sub-district 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 parameter r 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.If there is the same sub-carrier width each sub-district in the system, supposing has 36 subcarriers in the B1 bandwidth, and 144 subcarriers are just arranged in the B2 bandwidth, because sequence is mapped on the subcarrier, the length correspondence of subcarrier the length of sequence, it is different that then obvious two sub-districts need the length of the sequence selected separately.Long sequence at this time also may take place disturb more intense situation mutually with short sequence.The planning of this time series 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 has tens kinds, and complexity is than higher.
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 all can strong jamming between all users of sequence of this two kinds of length.For example, if the sequence of all length all has 6 shift sequences to use in the system, be to be shifted circulation timei of 23 sequence strong jamming to have taken place for the shift sequence of n for m sequence and length in case length is displacement circulation timei of 11 sequences, use corresponding displacement circulation timei of difference of these two kinds of length to be (m+1 so, n+1), (m+2, n+2), (m+3, n+3), (m+4, n+4), (strong jamming also can take place between 5 couples of users of n+5) other in m+5.
Thereby, when sequence takies running time-frequency resource by different way, will consider the problem of the interference between the sub-district.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 with same sample frequency on time domain, the problem of correlation between the length sequence then also can occur.Can also be that sequence takies subcarrier in frequency domain with different subcarrier spacings, the perhaps situation of time sampling point.In other words, sequence is not to be modulated at (or sampled point) on all subcarriers, but above fixed number subcarrier (or sampled point) is modulated at.
Mention above, when having the sequence of different length in the system, not only will 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 main technical problem to be solved in the present invention provides a kind of method and apparatus of assigned sequence, avoids the different sequence set of the different sequence of length to produce strong jamming each other.
Another problem that the present invention will solve is: a kind of device of series processing is provided, avoids storing sequence set tabulation to be allocated, thereby save the communication resource.
For addressing the above problem, the method that embodiment of the present invention provides a kind of communication sequence to distribute, wherein, sequence in each sequence set is divided into several 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 from the collection of candidate sequences corresponding with this child group and is obtained, and sequence set is distributed to the sub-district, and 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 the natural number that depends on i, (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.
The method that also provides another kind of communication sequence to distribute, this method comprises: the sequence in each sequence set is divided into several 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 from the collection of candidate sequences corresponding with this child group and is obtained, and the above-mentioned method of choosing is specially: at least to a sequence set k, and at least two son group i wherein, the sequence of j is by making function d (f in the described collection of candidate sequences i(), f j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is for depending on i, the natural number of j, d (f i(), f j()) be a binary function, function f i() or f j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence; Described sequence set is distributed to the sub-district.
The method that also provides another kind of communication sequence to distribute, this method comprises: the sequence in each sequence set is divided into several 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, described collection of candidate sequences specifically is the time of basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position; Described sequence set is distributed to the sub-district.
Consistent with above-mentioned sequence allocating method, the method and the device of transmitting sequence, the method for receiving sequence and device also are provided.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 corresponding sequence group and launch or receive.
In above-mentioned sequence allocating method, emission, method of reseptance and the device, the sequence in each sequence set is divided into several 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 rule of choosing has guaranteed that the correlation between the different sub sequences of organizing is bigger, therefore, the correlation of the sequence between different son groups is lower, make like this disturb between the different sequence of length little.To the sequence of some length, method of the present invention is therefrom chosen a part and is distributed, and other sequence does not adopt in system, like this, can avoid with length be N iSequence r iThe sequence of inferior strong correlation appears in other sequence set, thereby has reduced strong jamming.On the other hand, in each method and apparatus of the present invention, the method for choosing by calculating in the time of reception or emission is determined sequence, because do not need to store the form of large-scale sequence set, 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. 5 is the structural representation of emitter in the embodiment of the present invention;
Fig. 6 is the schematic flow sheet of method of reseptance in the embodiment of the present invention;
Fig. 7 is the schematic flow sheet of receiving system in the embodiment of the present invention;
Fig. 8 is the schematic diagram of non-centrosymmetry running time-frequency resource occupancy mode in the embodiment of the present invention;
Fig. 9 is the schematic diagram of center symmetry running time-frequency resource occupancy mode in the embodiment of the present invention.
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.
Inventor Qu Bingyu, He Yujuan, the applying date is on December 30th, 2006, in the still undocumented Chinese patent application 200610173364.5, utilizes the method for sequence of packets to solve the interference problem of length sequence.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 the communication resource.
Embodiment one
In the specific embodiment of the invention, system distributes to the sub-district with sequence set, and wherein, the sequence in each sequence set is divided into several son groups; The mode that the corresponding a kind of running time-frequency resource of each son group takies, how many height groups are the mode that has the how many kinds of running time-frequency resource to take in the communication system just have; Sequence in each son group is chosen according to certain rule from the collection of candidate sequences of this height group correspondence and is obtained.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 corresponding sequence group and launch or receive.
Above-mentioned certain rule is specially: for any one son group m, determine a corresponding function f of son group m(), 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 m(), G k) value in minimum, inferior minimum so that n less sequence determined the sequence among the child group m among the sequence set k, and wherein, m is the sequence number that son is organized, and k is the group number of sequence set, and n is the natural number that depends on m, (a b) is a binary function, G to d kIt is an amount of determining by group number k.This rule is from collection of candidate sequences selects n sequence, makes the d (f of all other sequences m(), G k) all than the d (f of this n sequence m(), G k)) big.
Below with Zadoff-Chu sequence a R, N(n) (to Gauss sequence a R, N(n) similar) 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 1, N 2..., N MThe Zadoff-Chu sequence.Wherein, length is N iThe Zadoff-Chu sequence a r i , N i ( n ) , n = 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 N i : { a r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i , This domain of function is this child group N iCorresponding collection of candidate sequences, wherein r iBe the r 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 ..., N 1-1, choose son group N 1As with reference to the son group, define aforementioned G kBe G k=k/N 1, aforementioned functions d (a b) is defined as | a-b|.So, the child group N among the sequence set k 1In sequence be meant and be designated as r 1=k's, length is N 1Sequence, it satisfies | f N m ( { a r m , N m ( n ) } n = 0,1 , . . . , N m - 1 ) - k / N 1 | = | r m / N m - k / N 1 | Minimum.Child group N among the sequence set k mSequence be that length is N m, satisfy | r m/ N m-k/N 1| minimum, inferior minimum, so that n less sequence, n is the natural number that depends on m.For the child group N among the sequence set k arbitrarily i, carry out choosing of sequence according to same rule.
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 : { a s 2 r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i , Wherein s is subcarrier (or time-domain sampling) gap size of Radio Resource.General to Gauss sequence, s 2Use s lReplace, l is the high-order in the Gauss sequence.
Above-mentioned with reference to son group N 1Set according to multiple factor.Preferable, can selective system in the child group of sequence length minimum organize N as son 1Do like this and say so optimumly from performance, the number of the available sequences group in the system is identical with sequence number under this length, and therefore the sequence of lacking 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, N in the said method then 1=11, at this moment, there are 10 sequence set available in the system.But under other situation, when system was very big to the demand of sequence set, 10 sequence set were just not enough, and can sacrifice some performances this moment, with N 1Be chosen for a length that satisfies system requirements, for example, the shortest sequence length still is 11 in the system, but chooses N 1=37, just have 36 sequence set to use this moment.Because sequence number the shortest in the system is less than 36, the shortest sequence will be reused repeatedly, so will this cost that is inevitable occur than strong correlation between some group.In addition, N 1Can be system default, also can be that system sets and be notified to the user as required, but which kind of method no matter, during the sequence of user in selecting the sequence set that will use, must know N simultaneously 1, otherwise just can't calculate comparison.
Illustrate the sequence set that constitutes according to described method below.
Suppose to have 3 son groups, be respectively length and be 11,23 and 37 Zadoff-Chu sequence, three kinds of resource occupation modes of correspondence.Select N 1=11, then one have 10 sequence set.Select and make (r m/ N m-r 1/ N 1) the sequence of absolute value minimum be grouped into respectively in each sequence set, will obtain following form:
N 1=11 group number k N 2＝23 r 2 N 3＝37 r 3 N 1=11 group number k N 2＝23 r 2 N 3＝37 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
By Practical Calculation, the correlation in the table between the sequence is all very high really.
Above group technology can following of equal valuely description, r m/ N m-r 1/ N 1=(N 1r m-N mr 1)/(N 1N m) the absolute value minimum, promptly require N 1r m-N mr 1The absolute value minimum.According to the theory of binary indeterminate equation of the first degree, given N 1, N m, and it is coprime, for given q value, q=± 1 for example, ± 2 ..., with r m, r 1Indeterminate equation N for indeterminate 1r m-N mr 1The general solution of=q is
r m=c m+ tN m, r 1=c 1+ tN 1, wherein t is an integer arbitrarily, c m, c 1Be equation N 1r m-N mr 1Separate for one of=q.Therefore, if limit 0＜r m＜N m, 0＜r 1＜N 1, N then 1r m-N mr 1=q has and has only and separate (be separate on the mould meaning unique).
For q=1, suppose indeterminate equation N 1r m-N mr 1Separating of=q is r m=b m, r 1=b 1, then obvious kb mN 1-kb 1N m=k, promptly during q=k, r 1=kb 1, r m=kb mBe r mN 1-r 1N m=q separates.
For r mN 1-r 1N m=q, given N 1, N m, r 1,, unique q is arranged, (N then according to the theory of indeterminate equation 1/ 2＜q＜N 1/ 2) and rm satisfy r mN 1-r 1N m=q.Promptly at this moment minimum | N 1r m-N mr 1| for | q|, and have only a r m(under the mould meaning) reaches minimum.And the discussion of front is known, given r 1=kb 1, r m=kb mWhen being q=k, be r mN 1-r 1N mThe unique solution of=q, so also reach | N 1r m-N mr 1| minimum separates.
Therefore, according to the method for this aspect, given r 1=kb 1The actual r that draws m=kb m,-N 1/ 2＜k＜N 1/ 2.Therefore, under this special case, the method that the present invention provides can further be reduced to, and for any one group of sequence, length is corresponding N respectively m, N 1, at first determine b m, b 1, make N 1b m-N mb 1=1, then to any one r 1=kb 1, r is arranged m=kb m,-N 1/ 2＜k＜N 1/ 2.The corresponding relation of the sequence in so just having provided a group.When needs are determined sequence among a plurality of son group m, be r=kb m± δ, δ are little integers, guarantee r m/ N m-r 1/ N 1=(N 1r m-N mr 1)/(N 1N m) less.
b m, b 1Definite method, can use division algorithm to determine.The selection difference of M, then corresponding b m, b 1All different.
In the previous example, N 1=11, N 2=23 o'clock, b 1=10, b 2=23, corresponding relation r 1=kb 1, r 2=kb 2,-5≤k≤5
N 1=11, N 3=37 o'clock, b 1=3, b 3=10, corresponding relation r 1=kb 1, r 3=kb 3,-5≤k≤5.
In the patent application 200610173364.5, provide linear corresponding relation, but definite method of the coefficient of the concrete corresponding relation that provides and ours is different.And definite method of our coefficient has guaranteed that the correlation between the sequence of different groups is lower, and more performance is arranged.
In the above-mentioned execution mode, aforementioned functions d (a b) is defined as | a-b|, also can be defined as in other embodiments when (a-b) 〉=0, for | a-b| is infinitely great when (a-b)＜0; Perhaps, when (b-a) 〉=0, for | a-b| is infinitely great when (b-a)＜0.Specific to f N i : { a r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i Above-mentioned embodiment in, get (r m/ N m-k/N 1) the minimum and folk prescription of absolute value to two kinds of situations of minimum.The selection positive direction, be equivalent to and get (r m/ N m-k/N 1The sequence of) 〉=0 minimum selects being equivalent to of negative direction to get (k/N 1-r m/ N mThe sequence of) 〉=0 minimum.For example, be N at needed length mThe time, calculate and k/N 1Minimum positive negative test is respectively that difference is 0.036 r mWith difference be-0.025 r ' m, certainly, with length be N 1Sequence r 1=k strongest correlation be r ' mIf, but the regulation choosing (r of system m/ N m-k/N 1) sequence of positive direction, that just selects r m.The benefit of doing like this is the sequence and the k/N of all lengths 1The sequence that obtains relatively, their differences each other are just littler.
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 1) a minimum sequence is grouped in the group, this is a kind of best choice scheme, because the number of the available sequences group in the system is identical with sequence number under this length, therefore short sequence can not repeat in different sequence set, thereby the low correlation energy between the sequence set guarantees.
Preferable, n is the natural number greater than 1, the value of n is organized N according to son mWith reference group N 1The length difference determine.That is to say (r m/ N m-k/N 1) minimum r mNear several sequences are grouped in same group, general r in minimum mNear immediate n, the selection of concrete n still will be seen N 1, N mThe length difference.For example, work as N mBe N 14 times of left and right sides the time, just can select 2 r mBe grouped in this group.That is to say, in the sequence set of this moment, more than one of the sequence of certain length possibility.Because according to the related characteristics of sequence, these sequences and reference sequences N 1Between correlation might be more intense, but these sequences and not between on the same group the sequence correlation be lower.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 1) minimum, inferior minimum ..., or the like.
Concrete, known N 1, N 2, e makes | e/N 1-f/N 2| the minimum f of value is and eN 2/ N 1Immediate integer is down and rounds
Figure A20071010044900211
Round perhaps
Figure A20071010044900212
Transmitter and receiver can calculate according to this method, but not storage.
Since when the correlation of two sequences that Zadoff-Chu sequence length is different is strong, (r m/ N m-r 1/ N 1) necessarily smaller.In the top distribution method, guaranteed that the value of the function between the different sub sequences of organizing is certain bigger, therefore, the correlation of the sequence between different sub groups is lower, disturbs little.Further, to the sequence of some length, we can therefrom choose a part and have distributed, and other sequence does not adopt in system, like this, can avoid with length be N 1Sequence r 1The sequence of inferior strong correlation appears in other sequence set, thereby has reduced strong jamming.
In the embodiment that above-mentioned each sequence set is distributed, can carry out the generation of sequence set to the sequence of a part of running time-frequency resource occupancy mode correspondence in the system, rather than all.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, to comprising 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 of the minimum that takies when sequence is smaller, can adopt dynamic sequence set distribution method.Because the length of this time series is also smaller, thereby the number of sequence set is also 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 sequence set at random in the moment of emission pilot tone 1, and then calculate the r of needs length according to as above rule kSequence.Preferable, when the Radio Resource of the minimum that takies when sequence is bigger, 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 smaller 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; 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.
In the distribution embodiment of each above-mentioned sequence set, usually, a basic sequence passes through a certain size the different sequence of time cyclic shift generation, and for example the time domain sequences that length is 12 sampled points can have 6 time cyclic shifts that are spaced apart 2 sampled points.The sequence that the different time shift of same basic sequence generates is quadrature or nearly orthogonal, can distribute to the different user of same sub-district, perhaps the different sub-district of a base station.The length sequence that belongs to same sequence set when the delay between them has tangible difference, also has the characteristic of nearly orthogonal, can be same carry out above-mentioned distribution.
Gauss sequence for example, a usually again R, N(n) corresponding one group by low order item α L-1, α L-2... the sequence of determining.These sequences can utilize our method further to divide into groups.
When in the son group a plurality of sequence being arranged, comprise the shift sequence that basic sequence and different time postpone, 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 has a different sequence, the minimum length that at this moment can limit the sequence of use is not less than certain value, increasing the number of basic sequence in the son group, thereby the delay of more basic sequence or basic sequence in the child group can be distributed to the sub-district.
Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.
Embodiment two
Consistent with the method that above-mentioned network based certain rule is distributed to the sub-district with sequence set, introduce a kind of communication sequence launching technique below, with reference to figure 3, detailed process is:
The group number k of the sequence set that step 201 receiving system is distributed.
Step 202 is by making function d (f in the collection of candidate sequences m(), G k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group m among the sequence set k, and wherein n is the natural number that depends on m, and wherein m 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 m() is the function of the definite child group m correspondence of system, and this domain of function is the described collection of candidate sequences of this child group m correspondence.
Step 203 is being launched on corresponding running time-frequency resource according to the corresponding sequence of the sequence generation of described formation.
Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.Each function in the said method specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.
In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need storage, realize simple.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to finish by program, described program can be stored in the computer read/write memory medium, this program is when carrying out, comprise that step is consistent with above-mentioned steps 201-step 203, described storage medium, as: ROM/RAM, magnetic disc, CD etc.
Embodiment three
A kind of emitter of using above-mentioned sequence launching technique is provided below, and with reference to figure 5, this device comprises:
Sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, by making function d (f in the collection of candidate sequences m(), G k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group m among the sequence set k, and wherein m be the sub sequence number of organizing, and n is the natural number that depends on m, 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 m() is the function of the definite child group m correspondence of system, and this domain of function is the described collection of candidate sequences of this child group m correspondence.
Sequence transmitter unit: be used for sequence selection or the corresponding sequence of generation, and on corresponding running time-frequency resource, launching according to described formation.
State in the device relevant function can with aforementioned distribution method in discuss consistent, do not give unnecessary details at this.Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.
In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need storage, realize simple.
Embodiment four
Consistent with the method that above-mentioned network based certain rule is distributed to the sub-district with sequence set, introduce a kind of communication sequence method of reseptance below, with reference to figure 6, detailed process is as follows:
The group number k of the sequence set that step 401 receiving system receiving system is distributed.
Step 402 is by making function d (f in the collection of candidate sequences m(), G k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group m among the sequence set k, and wherein n is the natural number that depends on m, and wherein m 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 m() is the function of the definite child group m correspondence of system, and this domain of function is the described collection of candidate sequences of this child group m correspondence.
Step 403 generates corresponding sequence according to the sequence of above-mentioned formation and is receiving on corresponding running time-frequency resource.
Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.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 401-step 403, described storage medium, as: ROM/RAM, magnetic disc, CD etc.
Embodiment five
A kind of receiving system of using above-mentioned sequential reception method is provided below, and with reference to figure 7, this device comprises
Sequence selection unit: the group number k that is used for the sequence set of receiving system receiving system distribution; By making function d (f in the collection of candidate sequences m(), G k) value in minimum, inferior minimum, so that n less sequence constitutes the sequence among the child group m among the sequence set k, and wherein n is the natural number that depends on m, and wherein m 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 m() is the function of the definite child group m correspondence of system, and this domain of function is the described collection of candidate sequences of this child group m correspondence.
Sequential reception unit: generate corresponding sequence and on corresponding running time-frequency resource, receiving according to the sequence of above-mentioned formation.
Usually, above-mentioned reception operation is specially, to obtain channel estimation value or to obtain related operation of time synchronized or the like.Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to Gauss sequence or other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission.Each function in the said apparatus specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.
In the top distribution method, guaranteed that the value of the function between the different sub sequences of organizing is certain bigger, therefore, the correlation of the sequence between different sub groups is lower, disturbs little.Further, to the sequence of some length, we can therefrom choose a part and have distributed, and other sequence does not adopt in system, like this, can avoid with length be N 1Sequence r 1The sequence of inferior strong correlation appears in other sequence set, thereby has reduced strong jamming.
In the above-mentioned implementation method, determined resource that sequence takies after, can generate the sequence of child group of this resource correspondence of current group according to rule in real time, and not need storage, realize simple.
Embodiment six
This embodiment is different with the sequence allocating method of aforementioned first group of embodiment, and the cyclically shifted sequences of one or more basic sequence is divided into groups.
During assigned sequence, general one group of sequence comprises a plurality of cyclically shifted sequences of one or more basic sequence, this cyclically shifted sequences can be basic sequence in time or frequency cocycle displacement obtain.In this case, in the time need distributing to the different user of a different sub-district (for example a plurality of sectors of a base station) or a sub-district/channel to different cyclically shifted sequences, with regard to needing further the signal of the cyclic shift of these basic sequences is divided into groups, make the different cyclically shifted sequences of same basic sequence belong to different groups, not quadrature basically between any two sequences on the same group, thereby reduce the interference of sub-district/user/interchannel.
The method of this embodiment is specially:
Sequence in each sequence set is divided into several son groups, the mode that the corresponding a kind of running time-frequency resource of each son group takies (for example, take the subcarrier of different numbers, perhaps take the position of different frequency resources), sequence set is distributed to the sub-district, and the sequence in each son group is chosen from the collection of candidate sequences corresponding with this child group and is obtained, and the above-mentioned method of choosing is specially: at least to a sequence set k, at least two son group i wherein, the sequence of j is by making function d (f in the described collection of candidate sequences i(), f j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is for depending on i, the natural number of j, (a b) is a binary function, function f to d m() is the function of son group m correspondence, and this domain of function is the described collection of candidate sequences of this child group m correspondence.
Be example with the Zadoff-Chu sequence below, be described in detail.It is pointed out that this programme also is suitable for for the Gauss sequence.
The mode that the sequence that sends in the reality takies running time-frequency resource has multiple situation, and in order to describe the solution of the present invention in detail, at first simple example is explained the mode that different running time-frequency resources take below.
With situation shown in Figure 9 is example, the running time-frequency resource occupancy mode is: sequence from left to right is mapped on the frequency resource at center, short sequence and long sequence all take the subcarrier that is positioned at core, and this occupancy mode simplified summary is the mode that centrosymmetric running time-frequency resource takies.Among the figure under the A mode, sequence takies a Resource Block (being called for short RB, Resourse Block), and for example when the 1RB correspondence comprises 12 subcarriers, corresponding employing length is 11 Zadoff-Chu sequence; And under the B mode among the figure, sequence takies 2 RB, and when promptly taking 24 subcarriers, corresponding employing length is 23 Zadoff-Chu sequence.
Be example with situation shown in Figure 8 again, take the mode A of a RB, i.e. 12 subcarriers, can be 12 subcarriers (occupancy mode of follow-up abbreviation left side RB) that take the low frequency shown in the light grey part in Fig. 8 left side, also may be 12 subcarriers (occupancy mode of follow-up abbreviation the right RB) that take the high frequency shown in the Dark grey part of Fig. 8 right side.This shows the position that is not both the running time-frequency resource that sequence takies of the occupancy mode of the occupancy mode of left side RB and the right RB different.
When adopting length is N i, the basic sequence index is r iThe Zadoff-Chu sequence time, above-mentioned function f m() is specially f in the present embodiment i(x)=((2 (x-F i) r i) modN i)/N i, wherein x is the cyclic shift index, and corresponding cyclic shift amount is the sequence of x, has represented that it is the shift sequence that the cyclic shift of x obtains that basic sequence is carried out shift amount, and the sequence of cyclic shift index x and cyclic shift x is corresponding one by one.That is to say, determined that cyclic shift index x has just determined that corresponding cyclic shift amount is the sequence of x.Collection of candidate sequences is the cyclically shifted sequences that basic sequence generates; F iBe the distance of the resource mode that takies of this sequence, be generally plurality of sub carrier wave or sampled point with respect to the symmetrical resource occupation mode in center.Respectively at the situation that takies different frequency resource mode in above-mentioned sequence, sequence allocating method is specifically described below.
First kind of situation: with reference to figure 9, the situation of promptly centrosymmetric resource occupation mode, at this moment, described with respect to center symmetry resource occupation mode apart from F iBe 0 (individual subcarrier).Thereby, above-mentioned function f iBe specially ((2Offset iR k) modN k)/N k, Offset wherein iIt is exactly the cyclic shift index of frequency domain; From two son group i, the candidate sequence of j concentrate select feasible | f i-f j| minimum sequence is grouped into same group.Also be above-mentioned function d (a b) is specially | a-b|.For instance, be N to length 1And N 2Two sequences group, determine the criterion of sequence in a group, be exactly to make | ((2Offset xR 1) modN 1)/N 1-((2Offset yR 2) modN 2)/N 2| minimum.Offset wherein xBe that length is N under the resource occupation mode of Fig. 9 1, the basic sequence index is r 1The frequency domain cyclic shift index of sequence, Offset yBe that length is N under the resource occupation mode of Fig. 9 2, the basic sequence index is r 2The frequency domain cyclic shift index of sequence.Obviously, Offset x=Offset yThe=0th, feasible | ((2Offset xR 1) modN 1)/N 1-((2Offset yR 2) modN 2)/N 2| minimum is zero.Work as r 1, r 2When odd even was identical, promptly two all was odd number, perhaps two when all being even number, selected to make | ((2 (Offset x-F 1) r 1) modN 1)/N 1-((2 (Offset y-F 2) r 2) modN 2)/N 2| minimum value is zero cyclic shift amount Offset x, Offset yAnd work as r 1, r 2Odd even is selected feasible not simultaneously | ((2 (Offset x-F 1) r 1) modN 1)/N 1-((2 (Offset y-F 2) r 2) modN 2)/N 2| be cyclic shift amount Offset minimum in the nonzero value x, Offset yThis be because, when odd even is identical, the Zadoff-Chu sequence of two different lengths is not carried out any displacement, is exactly strong correlation on frequency domain, when odd even not simultaneously, on frequency domain, be shifted.
Ask feasible | ((2 (Offset x-F 1) r 1) modN 1)/N 1-((2 (Offset y-F 2) r 2) modN 2)/N 2| minimum Offset x, Offset yCan be undertaken by mode relatively, promptly calculate different Offset x, Offset yValue, it obtains in the nonzero value minimum.Utilize, fix an Offset x, make the Offset of nonzero value minimum y, can simple calculations obtain.Concrete, known N 1, N 2, e makes | e/N 1-f/N 2| the minimum f of value is and eN 2/ N 1Immediate integer is down and rounds
Figure A20071010044900291
Round perhaps
Figure A20071010044900292
Transmitter and receiver can calculate according to this method, but not storage.
Above-mentioned rule can be divided into following step:
0601) determine to make | ((ar 1) modN 1)/N 1-((br 2) modN 2)/N 2| minimum a, b:
0602) according to Offset x=a/2modN 1, Offset y=b/2modN 2, determine Offset x, Offset yValue, the computing of wherein (/ 2) is carried out in the residue system that contracts, and works as N 1, N 2When coprime, minimum value is 1/ (N 1N 2).
Lift a real example below, the sequence of supposing to take 1 RB is a length N 1=11, the basic sequence index is r 1=6; The sequence that takies 2 RB is a length N 2=23, the index of basic sequence is r 2=13.So, use division algorithm, try to achieve a=9, b=14, feasible ((9r according to step 0601 1) modN 1) N 2-((14r 2) modN 2) N 1=1.According to step 0602, calculate 9/2mod11=10 then, 14/2mod23=7, therefore, Offset x=10, Offset y=7.Promptly in the centrosymmetric resource occupation mode, length is 11, the basic sequence index is 6 sequence and length is 23, the basic sequence index is 13 sequence, and dividing other cyclic shift amount is 10 and 7.Obviously-10, the-7th, other a pair of cyclic shift, satisfy | ((2Offset xR 1) modN 1)/N 1-((2Offset yR 2) modN 2)/N 2| minimum.Transmitter and receiver can adopt division algorithm to determine cyclic shift, has also avoided a large amount of storages.
Second kind of situation: with reference to figure 8, for non-centrosymmetrical running time-frequency resource occupancy mode, its with respect to the symmetrical resource occupation mode in center apart from F iBe not equal to 0, and then above-mentioned function d (a b) is specially || ((2 (Offset z-F z) r 1) modN 1)/N 1-((2 (Offset w-F w) r 2) modN 2)/N 2|, F wherein z, F wBe two sequence correspondences the running time-frequency resource position respectively with the tape symbol distance of center symmetry resource location; Offset zBe that length under the resource occupation mode of Fig. 8 is N 1, the basic sequence index is r 1The cyclic shift index of sequence, Offset wBe that length is N under the resource occupation mode of Fig. 8 2, the basic sequence index is r 2The cyclic shift index of sequence.
Be real example in the resource occupation mode that takies left side RB among Fig. 8 below.The fixing Offset of the cyclically shifted sequences of 1RB correspondence 1Be Offset 1=Offset x, the Offset here xIt is the cyclic shift index under the symmetry resource occupation mode of center; The Offset of the cyclically shifted sequences of the occupancy mode correspondence of 2RB among Fig. 8 then 3Be Offset 3=Offset y-F 1F wherein 1Be the running time-frequency resource position of left side RB correspondence and the tape symbol distance of centrosymmetric resource location as shown in Figure 9, the positive different direction of negative indication, unit is a subcarrier.F in the example of Fig. 8 1=-6, represent to move to left 6 subcarriers, perhaps F 1=-5 also can, this is because length 11 and the possible flexibility that RB subcarrier number 12 does not match and causes of Zadoff-Chu sequence.Concrete, be exactly the cyclic shift Offset of 11 long sequences of the RB on Fig. 8 left side 1The length of=10,2 RB correspondences is that the cyclic shift of 23 sequence is Offset 3=7-(6)=13.
Above-mentioned function f m() is specially f i(x)=((2 (x-F i) r i) modN i)/N iEmbodiment, at N 1, N 2When coprime, utilize Elementary Number Theory, calculate in the following method.Detailed process is:
If N 1, N 2Coprime, make r 1N 2-r 2N 1=c, mN 1+ nN 2=1, (r then 1N 2-r 2N 1) (mN 1+ nN 2)=c, r 1N 2NN 2-r 2N 1MN 1=c mod (N 1N 2), (c -1NN 2) r 1N 2-(c -1MN 1) r 2N 1=1mod (N 1N 2), c -1Be in the residue system that contracts, get contrary.
Therefore can obtain a=(c -1NN 2) modN 1, b=(c -1MN 1) modN 2, also satisfy | ((ar 1) modN 1)/N 1-((br 2) modN 2)/N 2| minimum.Ka, kb, k=-(N 1-1)/2 ..., (N 1-1)/2, be to make this target formula be time little some possible values, wherein k=0 is ordinary situation.Obtain carrying out next step calculating by 0602 behind a, the b.Work as r 1, r 2All be even number, perhaps r 1, r 2When all being odd number, at this moment, get k=0, thereby in example shown in Figure 9, the corresponding relation of cyclic shift is Offset x=Offset y=0.Work as r 1, r 2Odd even is not considered the ordinary Offset that separates not simultaneously x=Offset y=0.
The Offset that said method is determined x, Offset yBe the frequency domain displacement, in general, also can be shifted and obtain Offset by time domain x, Offset yCorresponding time domain displacement is Offset xR 1/ N 1S, and Offset yR 2/ N 2S.This is because the frequency domain displacement necessarily is equivalent to a time domain displacement.Owing to work as r 1, r 2Odd even not simultaneously, minimum value reality is not null value, therefore, can also further finely tune on time domain, i.e. one of them sequence 1/ (2N that is shifted again 1N 2) S, making that the correlation peak of the length sequence after the displacement is the highest, the sequence of Sheng Chenging is as same group sequence like this.Wherein, S is total the counting of time-domain sampling.
Said method has determined to belong to the cyclically shifted sequences of at least two different lengths of same group, in other execution mode, when the sequence of multiple length is arranged in the system, can choose any one sequence as fixing sequence, other sequence all compares with this fixed sequence program, determines the cyclic shift (promptly determining cyclically shifted sequences in twos) of sequence by above-mentioned rule.For example, the shortest sequence that may use in can selective system is as fixing sequence.
In this execution mode, in case sequence of fixing running time-frequency resource occupancy mode and in addition the running time-frequency resource occupancy mode a sequence relatively, determine cyclic shift after, this is the cyclic shift Offset of the sequence of running time-frequency resource occupancy mode fixedly 0Just fixing.Other sequence again with this fixedly the cyclically shifted sequences of the sequence of running time-frequency resource occupancy mode compare, the cyclic shift amount of determining comprises the fixing shift amount Offset of running time-frequency resource occupancy mode 0' and the cyclic shift amount Offset of other sequence u self u, sequence u is except carrying out cyclic shift Offset uIn addition, also need shift reverse Offset in time 0' r 1/ N 1S, wherein S is the total sampled point number of time domain.This is the frequency domain cyclic shift owing to the Zadoff-Chu sequence, is equivalent to the cyclic shift of certain time domain, and in general, frequency domain cyclic shift c is equivalent to time-domain cyclic shift cr 1/ N 1S.
Utilize said method to determine a cyclically shifted sequences group, can be called benchmark cyclically shifted sequences group, can utilize the characteristic of sequence nearly orthogonal on time domain of different length in the reality, obtain other a plurality of cyclically shifted sequences groups with this benchmark cyclically shifted sequences group, method is exactly to be shifted in the time domain cocycle.
Below, provide a concrete example above-mentioned definite benchmark cyclically shifted sequences group and definite method of other cyclically shifted sequences group are described.For N 1=11, N 2=23, have the group of 10 basic sequences, as following table.Basic sequence in every group can be divided into a plurality of different cyclically shifted sequences groups again.Hypothetical sequence is as shown in Figure 9 a center symmetry resource occupation mode to the occupancy mode of resource, utilizes the bright rule of we, determines to make metric function | ((2Offset xR 1) modN 1)/N 1-((2Offset yR 2) modN 2)/N 2| minimum cyclic shift value, can select to make that metric is two cyclic shifts of-1, can select also to make that metric is two cyclic shifts of+1.For example to the sequence set of k=1, r 1, r 2Expression basic sequence index, Offset1, Offset2 represents by the definite cyclic shift amount of the present invention's rule, this moment, two sequences can obtain strongest correlation, the metric function minimum is-1, and corresponding correlation is 10.9256, and it is very approaching that this value is compared with desirable auto-correlation 11, thereby correlation is very strong.So the sequence in the benchmark cyclically shifted sequences group in this example is exactly: length is 11, the basic sequence index is 1, the cyclic shift on the frequency domain is 6 sequence and, length is 23, the basic sequence index is 2, the cyclic shift on the frequency domain is 12 sequence.After obtaining benchmark cyclically shifted sequences group, the signal sampling point of hypothetical sequence on time domain has 12 now, and then two of this group sequences can produce other 5 groups of sequences in time domain cocycle displacement 2,4,6,8,10 respectively.The cyclic shift of concrete time domain can be mapped on the subcarrier by resource occupation in sequence, after generation obtains time-domain signal then, carries out on time domain.
Group number k r 1，r 2 Offset1，Offset2 The metric at strongest correlation peak Correlation
1 1，2 6，12 -1 10.9256
2 2，4 0，0 0 10.7375
3 3，6 2，4 -1 10.4072
4 4，8 0，0 0 9.9743
5 5，10 10，7 -1 9.4193
6 6，13 1，16 -1 9.4193
7 7，15 0，0 0 9.9743
8 8，17 9，19 -1 10.4072
9 9，19 0，0 0 10.7375
10 10，21 6，22 -1 10.9256
Use sequence N again 1=23, N 2=37 are the example explanation, and following relation is in groups then arranged:
Group number k r 1，r 2 Offset1，Offset2 The metric at strongest correlation peak Correlation
1 1，2 14，2 -75 9.1184 12.0825
2 2，3 7，26 1 17.5056
3 3，5 0，0 0 19.3621
4 4，6 15，13 777 1.0960 11.7449
5 5，8 12，19 -1 22.7527
6 6，10 10，30 74 1.0594 12.0637
7 7，11 0，0 0 15.4330
8 8，13 19，6 -1 20.8930
9 9，14 22，32 73 6.6780 11.0861
10 10，16 0，0 0 22.0487
11 11，18 18，29 1 13.2419
12 12，19 5，8 -1 13.2419
13 13，21 0，0 0 22.0487
14 14，23 1，5 73 6.6780 11.0861
15 15，24 4，31 1 20.8930
16 16，26 0，0 0 15.4330
17 17，27 13，7 777 1.0594 12.0637
18 18，29 11，18 -1 22.7527
19 19，31 8，24 777 1.0960 11.7449
20 20，32 0，0 0 19.3621
21 21，34 16，11 -1 17.5056
22 22，35 9，35 75 9.1184 12.0825
Last list notation is in the row of " correlation ", the expression of two correlations is arranged, in this sequence set, the cyclic shift of two sequences of strongest correlation, not to make a pair of cyclic shift of metric minimum, wherein the correlation on the left side is the correlation of a pair of cyclically shifted sequences that makes that tolerance is minimum, the right be getable maximum correlation value in all possible frequency domain cyclic shift.Can obviously find out, these sequence set that runic shows in table, the method according to this invention design, the correlation of two cyclically shifted sequences of same group is big not enough.Find that by analyzing this occurs in | r 1/ N 1-r 2/ N 2| during bigger situation, r in the table for example 1=1, r 2=2 o'clock, | 1/23-2/37|=9/ (2337), work as in the table | r 1/ N 1-r 2/ N 2|≤7/N 1N 2The time, the sequence set of the present invention's design satisfies the strong correlation requirement fully, all compares near desirable autocorrelation value 23.Therefore, be that 23 sequence and length are 37 sequence to length, although can be combined into 22 basic sequence groups, can only limit and select for use | r 1/ N 1-r 2/ N 2|≤7/N 1N 214 basic sequence groups, just go up the group of non-runic sign in the table.For each selected basic sequence group, the group technology of cyclically shifted sequences of the present invention is suitable fully.The cyclically shifted sequences of the present invention basic sequence of rule in groups can be selected to satisfy by system, promptly selects to make | r 1/ N 1-r 2/ N 2| some less basic sequence groups.Again for example, for 11 long sequence and 23 long sequences, for the basic sequence index r of one 11 length 1Represent sequence, the basic sequence index r of two 23 length can be arranged 2The sequence of expression is respectively feasible | r 1/ N 1-r 2/ N 2| minimum and time minimum sequence, belong to same basic sequence group, can find to have only feasible | r 1/ N 1-r 2/ N 2| the sequence of one 23 minimum length and corresponding length are the basic sequence group of 11 sequence composition, in the time of just can further dividing into groups to cyclically shifted sequences, and our rule of the deferred gratification of strongest correlation.To length 11 sequence (basic sequence index r 1Expression) and length be 37 sequence (basic sequence index r 2Expression), then the basic sequence group can have one long be 11 sequence and 2 long be 37 sequence, these two long is 37 sequence, is respectively feasible | r 1/ N 1-r 2/ N 2| minimum and time minimum sequence.To the cyclically shifted sequences of this sequence set, further grouping, that utilizes then that our rule finds out belongs to same group cyclically shifted sequences, is strong correlation.Therefore, general, in order to guarantee the correct of cyclically shifted sequences rule of classification, need the formation of basic sequence group be limited.
Compared with prior art, following beneficial effect is arranged in this embodiment: in this embodiment the length sequence, the cyclically shifted sequences that causes strong correlation of the sequence of perhaps general corresponding different frequency resource occupation mode is placed in same group, the interference between the sequence on the same group is not smaller, perhaps nearly orthogonal.Like this, distribute different groups to give sub-district or user or channel, just can reach and disturb the purpose that reduces.And take method of the present invention, the machine of transmitting and receiving can generate cyclically shifted sequences according to rule in groups, avoids the form of the side of emission and recipient's storage sequence group corresponding relation, reduces implementation complexity.
Embodiment seven
In this embodiment, different with previous embodiment, present embodiment is reference with the cyclically shifted sequences of a certain running time-frequency resource occupancy mode correspondence, determine other the cyclically shifted sequences of running time-frequency resource occupancy mode correspondence in the system with this, as the cyclically shifted sequences with long sequence correspondence in the center symmetry resource occupation mode shown in Figure 9 is reference, determines the cyclically shifted sequences of the short sequence correspondence on different RB among Fig. 8.Concrete method is:
Sequence in each sequence set is divided into several son groups, the mode that the corresponding a kind of running time-frequency resource of each son group takies, sequence set is distributed to the sub-district, sequence in each son group is chosen from the collection of candidate sequences corresponding with this child group and is obtained, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position.
In this embodiment, the process of described definite described cyclically shifted sequences is specially:
C represents running time-frequency resource position that the cyclically shifted sequences of the occupancy mode correspondence of described different running time-frequency resource the takies distance with respect to reference running time-frequency resource position, r 2, N 2The basic sequence index and the length of the running time-frequency resource of expression reference, S represents the number that time-domain sampling point is total,
Then access time, the cyclic shift amount was-(cr 2) modN 2/ N 2The sequence of S constitutes described cyclically shifted sequences.
Running time-frequency resource position with reference to running time-frequency resource position the longest sequence correspondence in can selective system.
Running time-frequency resource occupancy mode with Fig. 8 and Fig. 9 is an example, suppose resource occupation mode as a reference with Fig. 9, and will grow be 23, the cyclic shift amount is 7 sequence cyclically shifted sequences as a reference, the cyclically shifted sequences of Fig. 8 left side RB correspondence then, by the length of the correspondence of center symmetry RB be 11, the frequency domain cyclic shift amount determined is Offset xSequence, on time domain, carry out oppositely (cr 2) modN 2/ N 2The cyclic shift of S sampled point obtains, wherein, and r 2Be the pairing basic sequence index of sequence that 2RB uses, N 2Sequence length for the 2RB correspondence, the relative distance of running time-frequency resource position is c=-6, wherein S be that sequence takies on the time domain free total sampled point number, for example in the symbol time that sequence emission takies, sampled points such as 32,64,512 can be arranged, depend on specific implementation.In the previous example, sampled point gets 32, and then frequency domain cocycle displacement-6 is equivalent to time domain superior displacement (613) mod23/2332=-12.52.Because to grow sequence sequence as a reference, promptly the fixing cyclic shift of long sequence as a reference, and short sequence shift reverse-12.52 sampled point in time, 12.52 sampled points that promptly are shifted make that short sequence and the length sequence after the displacement is strong correlation.The sequence of such cyclic shift on time domain is as belonging to same group sequence with long sequence.When specific implementation, step is: the resource location of a selected reference and corresponding cyclically shifted sequences thereof, obtain the distance c of the shared running time-frequency resource position of the cyclically shifted sequences of occupancy mode correspondence of current running time-frequency resource, according to (cr with respect to reference running time-frequency resource position 2) modN 2/ N 2S calculates the cyclic shift amount that the sequence on this resource location will be carried out in time domain, then the time domain sequences that is obtained by the sequence of shining upon on this resource location is carried out a reverse displacement, and shift amount is (cr 2) modN 2/ N 2S.Because the certain operations of spatial transform frequently, as over-sampling etc., the shift amount that may calculate is a decimal, wants corresponding some trace to adjust during specific implementation in the reality.So just obtained belonging to same group time-domain cyclic shift sequence, can carry out the distribution of corresponding cyclically shifted sequences group according to the needs of system more at last with long sequence.
Determine that for the cyclic shift of the sequence of Fig. 8 the right RB can adopt similar method, at this moment the distance of time-domain resource position is c=6.
We have determined one group of sequence like this, comprise the sequence of 2RB correspondence, the sequence of left side 1RB correspondence, and the sequence of the right 1RB correspondence, these sequences are determined with cyclic shift amount separately.Generally determined one group of sequence, the sequence of other group then, sequence amount of while cyclic shift on time domain by this group is determined, the sequence of each length 8 sampled points of cyclic shift all on time domain for example, so total sampled point number is 32 o'clock, just can generate 4 different sequence set, corresponding cyclic shift is 8 respectively, 16,24 sampled points, and the initial sequence set of determining (being shifted 0).
Embodiment eight
A kind of processing unit of sequence is provided below, and a kind of processing unit of sequence, this device are used for the emission or the reception of sequence, and this device comprises:
The second sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, at least two son group i among the described sequence set k, the sequence of j is by making function d (f in the collection of candidate sequences corresponding with this child group i(), f j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is for depending on i, the natural number of j, d (f i(), f j()) be a binary function, function f i() or f j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence.
The second series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.
In the another kind of execution mode, the above-mentioned second sequence selection unit can adopt division algorithm to determine cyclic shift, has also avoided a large amount of storages.Concrete, the second sequence selection unit further comprises:
The cyclic shift determination module is used to adopt division algorithm to determine cyclic shift; With the cyclically shifted sequences generation module, generate corresponding cyclically shifted sequences according to the cyclic shift of determining.
Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission; Usually, above-mentioned reception operation is specially, to obtain channel estimation value or to obtain related operation of time synchronized or the like.Each function in the said apparatus specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.
Embodiment nine
A kind of processing unit of sequence is provided below, it is characterized in that, this device comprises:
The 3rd sequence selection unit: the group number k that is used for the sequence set of receiving system distribution, from the collection of candidate sequences corresponding, choose the sequence that obtains in each son group with this child group, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position.
The 3rd series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.
Above-mentioned sequence is not limited only to the Zadoff-Chu sequence, can also be applied to the Gauss sequence, other CAZAC sequence, the basic sequence of CAZAC sequence and or delayed sequence.The radiation pattern of sequence can be that the frequency domain emission also can be the time domain emission; Usually, above-mentioned reception operation is specially, to obtain channel estimation value or to obtain related operation of time synchronized or the like.Each function in the said apparatus specifically can with above-mentioned distribution method in consistent, do not give unnecessary details at this.
Aforementioned respectively about the series processing device, sequence selection unit wherein adopts certain rule directly to choose the sequence that satisfies the interference requirement, does not need the tabulation of storage sequence corresponding relation, compared with prior art, saves 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 (39)

1. the communication sequence method of distributing is characterized in that this method comprises:
Sequence in each sequence set is divided into several 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 from the collection of candidate sequences corresponding with this child group and is obtained, and 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 the natural number that depends on i, (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 the sub-district.
2. method according to claim 1 is characterized in that,
Described sequence is to prick doffer-first Zadoff-Chu sequence or Gauss Gauss sequence.
3. method as claimed in claim 2 is characterized in that,
Described function f i() is specially f N i : { a r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i , R wherein iBe the r index of sequence in this collection of candidate sequences, N iBe the length of the sequence in this collection of candidate sequences;
Described G kBe G k=k/N 1, N wherein 1Be the sequence length of 1 child group for label, be called with reference to the son group.
4. method according to claim 2 is characterized in that, the method for this assigned sequence further comprises:
When described son group i correspondence is spaced apart the Radio Resource of s, described function f i() is specially: f N i : { a s l r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i , Wherein s is the gap size of Radio Resource, and l is the top step number of gaussian sequence.
5. as the described method of the arbitrary claim of claim 1-4, it is characterized in that,
Described function d (a b) is | a-b|;
Perhaps work as (a-b) 〉=0, for | a-b| is infinitely great when (a-b)＜0;
Perhaps work as (b-a) 〉=0, for | a-b| is infinitely great when (b-a)＜0.
6. method according to claim 3 is characterized in that,
Described with reference to the child group of son group for sequence length minimum in the system.
7. method according to claim 3 is characterized in that,
Described n is 1; Perhaps,
Child group sequence length N according to sequence to be determined iWith reference group sequence length N 1Difference determine the value of described n.
8. method according to claim 3 is characterized in that,
As described r 1=kb 1, r then i=kb i± δ, wherein b i, b 1Satisfy b iN 1-b 1N i=1, δ is an integer.
9. method according to claim 1 is characterized in that,
The described process that described sequence set is distributed to the sub-district is specially:
The dynamic method of salary distribution promptly waits variable to change the sequence of using in time; Perhaps, the static method of salary distribution, promptly the sequence of Shi Yonging does not change; Perhaps, to different sequence set, adopt the dynamic or static method of salary distribution respectively.
10. method according to claim 1 is characterized in that, this method further comprises:
When in the child group in the described sequence set a plurality of sequence being arranged, give different users with described a plurality of sequence allocation, perhaps distribute to different sub-districts, perhaps a plurality of sub-districts of a base station, described a plurality of sequences comprise basic sequence and/or the different shift sequence that postpones.
11. a method of handling sequence is characterized in that,
The group number k of the sequence set that receiving system is distributed;
By making 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 the natural number that depends on i, (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;
Generating corresponding sequence according to the sequence in the child group that constitutes handles on corresponding running time-frequency resource.
12. method according to claim 11 is characterized in that, described processing is specially emission or receives.
13. method according to claim 11 is characterized in that,
Described sequence is to prick doffer-first Zadoff-Chu sequence or Gauss Gauss sequence.
14. method according to claim 13 is characterized in that,
Described function f i() is specially f N i : { a r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i , R wherein iBe the r index of sequence in this collection of candidate sequences, N iBe the length of the sequence in this collection of candidate sequences;
Described G kBe G k=k/N 1, N 1Be the length of 1 child group for label, be called with reference to the son group.
15. method according to claim 13 is characterized in that, the method for this processing sequence further comprises:
When described son group i correspondence is spaced apart the Radio Resource of s, described function f i() is: f N i : { a s l r i , N i ( n ) } n = 0,1,2 , . . . , N i - 1 → r i / N i , Wherein s is the gap size of Radio Resource, and l is the top step number in the gaussian sequence.
16. according to arbitrary described method among the claim 11-15, it is characterized in that,
Described function d (a b) is | a-b|;
Perhaps work as (a-b) 〉=0, for | a-b| is infinitely great when (a-b)＜0;
Perhaps work as (b-a) 〉=0, for | a-b| is infinitely great when (b-a)＜0.
17. method according to claim 14 is characterized in that,
Described with reference to the child group of son group for sequence length minimum in the system.
18. method according to claim 11 is characterized in that,
Described n is 1;
Perhaps, the sequence length N of described child group i according to sequence to be determined iWith sequence length N with reference to the son group 1Difference determine the value of n.
19. a series processing device is characterized in that this device comprises
Sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, by making 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 the natural number that depends on i, 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 corresponding running time-frequency resource, handle according to the described sequence that constitutes.
20. series processing device according to claim 19 is characterized in that,
Described series processing unit is specially the sequence transmitter unit, and described sequential reception 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. the method that communication sequence distributes is characterized in that this method comprises:
Sequence in each sequence set is divided into several 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 from the collection of candidate sequences corresponding with this child group and is obtained, and the above-mentioned method of choosing is specially: at least to a sequence set k, and at least two son group i wherein, the sequence of j is by making function d (f in the described collection of candidate sequences i(), f j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is for depending on i, the natural number of j, d (f i(), f j()) be a binary function, function f i() or f j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence;
Described sequence set is distributed to the sub-district.
22. method according to claim 21 is characterized in that,
Described sequence is to prick doffer-first Zadoff-Chu sequence or Gauss Gauss sequence.
23. method according to claim 22 is characterized in that,
Function in the described sequence candidates set is f i(x)=((2 (x-F i) r i) mod N i)/N i, x is the cyclic shift index, F iBe distance with respect to center symmetry resource occupation mode, N iBe the length of sequence, r iBasic sequence index for the Zadoff-Chu sequence.
24. according to the arbitrary described method of claim 21-23, it is characterized in that,
Described function d (f i(), f j()) be | f i-f j|.
25. method as claimed in claim 23 is characterized in that, this method further comprises:
Make function d (f choosing i(), f j()) value in minimum, inferior minimum, so that before the step of n less sequence, choose satisfied earlier | r i/ N i-r j/ N j| less basic sequence makes that same group cyclically shifted sequences is a strongest correlation.
26. method according to claim 24.It is characterized in that,
When described function is f i(x)=((2 (x-F i) r i) mod N i)/N i, and work as N i, N jWhen coprime, make r iN i-r jN j=c, mN i+ nN j=1,
A=(the c that calculates -1NN j) mod N i, b=(c -1MN i) mod N j, c -1Be in the residue system that contracts, to get contraryly, satisfy | ((ar i) mod N i)/N i-((br j) mod N j)/N j| minimum; Further,
In the residue system that contracts, carry out a/2 mod N i, b/2 mod N jCalculating, the value that obtains is exactly the cyclic shift index of selected cyclically shifted sequences.
27. method as claimed in claim 24 is characterized in that, as the index r of basic sequence i, r jOdd even is chosen feasible not simultaneously | f i-f j| the minimum value of non-zero.
28. method as claimed in claim 23 is characterized in that, when the sequence of two or more length was arranged in the system, this method further comprised:
Choose any one sequence as fixed sequence program;
Sequence u outside the described fixed sequence program is except carrying out cyclic shift Offset uIn addition, further shift reverse Offset in time also 0R 0/ N 0S, wherein S is the total sampled point number of time domain, Offset 0The shift amount of representing described fixed sequence program, r 0, N 0Be the basic sequence index and the length of described fixed sequence program, Offset uThe cyclic shift amount Offset that represents described sequence u self u
29. method as claimed in claim 28 is characterized in that, described fixed sequence program is specially the shortest sequence that may use in the system.
30. method according to claim 21 is characterized in that, after determining a sequence set, this method further comprises:
The identical cyclic shift that each sequence in the described definite sequence set is carried out on the time domain obtains other sequence set.
31. method according to claim 24 is characterized in that,
Described making | f i-f j| two minimum sequences generate same group sequence through the cyclic shift on the time domain again.
32. the method that communication sequence distributes is characterized in that,
Sequence in each sequence set is divided into several 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, described collection of candidate sequences specifically is the time of basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position;
Described sequence set is distributed to the sub-district.
33. method according to claim 32 is characterized in that, described basic sequence is the basic sequence of Zadoff-Chu sequence, perhaps the basic sequence of Gauss sequence.
34. method according to claim 32 is characterized in that, the described running time-frequency resource position that is specially sequence correspondence the longest in the system with reference to the running time-frequency resource position.
35. method according to claim 32 is characterized in that,
The process of described definite described cyclically shifted sequences is specially:
Access time, the cyclic shift amount was-(cr 2) mod N 2/ N 2The sequence of S constitutes described cyclically shifted sequences, and wherein c represents running time-frequency resource position that the cyclically shifted sequences of the occupancy mode correspondence of described different running time-frequency resource the takies distance with respect to reference running time-frequency resource position, r 2, N 2The basic sequence index and the length of the running time-frequency resource of expression reference, S represents the number that time-domain sampling point is total.
36. method according to claim 32, it is characterized in that, after determining a cyclically shifted sequences group, this method further comprises: each sequence in the described definite cyclically shifted sequences group is carried out cyclic shift identical on the time domain and is obtained other cyclically shifted sequences group.
37. the processing unit of a sequence is characterized in that, this device comprises:
The second sequence selection unit: be used for the group number k of the sequence set of receiving system distribution, at least two son group i among the described sequence set k, the sequence of j is by making function d (f in the collection of candidate sequences corresponding with this child group i(), f j()) value in minimum, inferior minimum, so that n less sequence chosen generation, wherein, i, j are the sequence numbers that son is organized, n is for depending on i, the natural number of j, d (f i(), f j()) be a binary function, function f i() or f j() is the function of son group i or j correspondence, and this domain of function is the described collection of candidate sequences of this child group i or j correspondence.
The second series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.
38. according to the described device of claim 37, it is characterized in that,
The described second sequence selection unit further comprises:
The cyclic shift determination module is used to adopt division algorithm to determine cyclic shift;
The cyclically shifted sequences generation module is used for generating corresponding cyclically shifted sequences according to the cyclic shift of determining.
39. the processing unit of a sequence is characterized in that, this device comprises:
The 3rd sequence selection unit: the group number k that is used for the sequence set of receiving system distribution, from the collection of candidate sequences corresponding, choose the sequence that obtains in each son group with this child group, described collection of candidate sequences specifically is the time of a basic sequence generation or the cyclically shifted sequences on the frequency, and the above-mentioned method of choosing is specially: determine described cyclically shifted sequences by the running time-frequency resource position that different cyclically shifted sequences take with respect to the distance of reference running time-frequency resource position.
The 3rd series processing unit: be used for sequence selection or the corresponding sequence of generation according to described formation, and emission or reception on corresponding running time-frequency resource.
CN2007101004495A 2007-03-07 2007-04-09 Sequence allocation method and device Active CN101262687B (en)

Priority Applications (22)

Application Number Priority Date Filing Date Title
CN2007101004495A CN101262687B (en) 2007-03-07 2007-04-09 Sequence allocation method and device
BRPI0808183A BRPI0808183B1 (en) 2007-03-07 2008-03-06 method for processing sequences and method for allocating sequences in a communication system, and sequence processing apparatus
EP20080715167 EP2101419B1 (en) 2007-03-07 2008-03-06 Sequence distributing, processing method and apparatus in communication system
AT08715167T ATE498249T1 (en) 2007-03-07 2008-03-06 SEQUENCE DISTRIBUTION, PROCESSING METHOD AND CORRESPONDING DEVICE IN A COMMUNICATIONS SYSTEM
PT08715167T PT2101419E (en) 2007-03-07 2008-03-06 Sequence distributing, processing method and apparatus in communication system
DK08715167T DK2101419T3 (en) 2007-03-07 2008-03-06 Sequence distribution, processing method and device in a communication system
JP2009546637A JP4922412B2 (en) 2007-03-07 2008-03-06 Method and apparatus for assigning and processing sequences in a communication system
BR122015028224-1A BR122015028224B1 (en) 2007-03-07 2008-03-06 METHOD FOR ALLOCATING AND PROCESSING A SEQUENCE IN A COMMUNICATION SYSTEM, AND SEQUENCE PROCESSING APPARATUS
PL08715167T PL2101419T3 (en) 2007-03-07 2008-03-06 Sequence distributing, processing method and apparatus in communication system
PCT/CN2008/070431 WO2008106894A1 (en) 2007-03-07 2008-03-06 Sequence distributing, processing method and apparatus in communication system
SI200830203T SI2101419T1 (en) 2007-03-07 2008-03-06 Sequence distributing, processing method and apparatus in communication system
KR20097015469A KR101095420B1 (en) 2007-03-07 2008-03-06 Method and apparatus for allocating and processing sequences in communication system
DE602008004885.3T DE602008004885C5 (en) 2007-03-07 2008-03-06 SEQUENCE DISTRIBUTION, PROCESSING METHOD AND CORRESPONDING DEVICE IN A COMMUNICATION SYSTEM
US12/493,869 US8249006B2 (en) 2007-03-07 2009-06-29 Method and apparatus for allocating and processing sequences in communication system
HR20110288T HRP20110288T1 (en) 2007-03-07 2011-04-19 Sequence distributing, processing method and apparatus in communication system
US13/330,252 US8644239B2 (en) 2007-03-07 2011-12-19 Method and apparatus for allocating and processing sequences in communication system
US13/545,707 US8588168B2 (en) 2007-03-07 2012-07-10 Method and apparatus for allocating and processing sequences in communication system
US14/068,124 US9143295B2 (en) 2007-03-07 2013-10-31 Method and apparatus for allocating and processing sequences in communication system
US14/842,618 US9819434B2 (en) 2007-03-07 2015-09-01 Method and apparatus for allocating and processing sequences in communication system
US15/807,774 US10389468B2 (en) 2007-03-07 2017-11-09 Method and apparatus for allocating and processing sequences in communication system
US16/436,413 US11057141B2 (en) 2007-03-07 2019-06-10 Method and apparatus for allocating and processing sequences in communication system
US17/349,664 US11716120B2 (en) 2007-03-07 2021-06-16 Method and apparatus for allocating and processing sequences in communication system

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN200710073057 2007-03-07
CN200710073057.4 2007-03-07
CN2007101004495A CN101262687B (en) 2007-03-07 2007-04-09 Sequence allocation method and device

Publications (2)

Publication Number Publication Date
CN101262687A true CN101262687A (en) 2008-09-10
CN101262687B CN101262687B (en) 2012-11-21

Family

ID=39962506

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007101004495A Active CN101262687B (en) 2007-03-07 2007-04-09 Sequence allocation method and device

Country Status (2)

Country Link
CN (1) CN101262687B (en)
ES (1) ES2359952T3 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9143295B2 (en) 2007-03-07 2015-09-22 Huawei Technologies Co., Ltd. Method and apparatus for allocating and processing sequences in communication system
CN106576089A (en) * 2014-08-19 2017-04-19 Lg电子株式会社 Method for generating and transmitting pilot sequence using non-CAZAC sequence in wireless communication system
US10305661B2 (en) 2006-09-30 2019-05-28 Huawei Technologies Co., Ltd. Method and apparatus for sequence distributing and sequence processing in communication system
CN113765633A (en) * 2020-06-03 2021-12-07 华为技术有限公司 Method and communication device for transmitting reference signal
CN114401068A (en) * 2021-12-27 2022-04-26 西安电子科技大学 Construction method of multi-group orthogonal sequence set

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1773897A (en) * 2004-11-10 2006-05-17 北京三星通信技术研究有限公司 Resource distributing method and apparatus of dynamic time-frequency and code sequence

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11811697B2 (en) 2006-09-30 2023-11-07 Huawei Technologies Co., Ltd. Method and apparatus for sequence distributing and sequence processing in communication system
US10305661B2 (en) 2006-09-30 2019-05-28 Huawei Technologies Co., Ltd. Method and apparatus for sequence distributing and sequence processing in communication system
US10764011B2 (en) 2006-09-30 2020-09-01 Huawei Technologies Co., Ltd. Method and apparatus for sequence distributing and sequence processing in communication system
US11057141B2 (en) 2007-03-07 2021-07-06 Huawei Technologies Co., Ltd. Method and apparatus for allocating and processing sequences in communication system
US9819434B2 (en) 2007-03-07 2017-11-14 Huawei Technologies Co., Ltd. Method and apparatus for allocating and processing sequences in communication system
US9143295B2 (en) 2007-03-07 2015-09-22 Huawei Technologies Co., Ltd. Method and apparatus for allocating and processing sequences in communication system
US11716120B2 (en) 2007-03-07 2023-08-01 Huawei Technologies Co., Ltd. Method and apparatus for allocating and processing sequences in communication system
US10389468B2 (en) 2007-03-07 2019-08-20 Huawei Technologies Co., Ltd. Method and apparatus for allocating and processing sequences in communication system
EP3197116A4 (en) * 2014-08-19 2018-04-18 LG Electronics Inc. Method for generating and transmitting pilot sequence using non-cazac sequence in wireless communication system
US10277373B2 (en) 2014-08-19 2019-04-30 Lg Electronics Inc. Method for generating and transmitting pilot sequence using non-CAZAC sequence in wireless communication system
CN106576089A (en) * 2014-08-19 2017-04-19 Lg电子株式会社 Method for generating and transmitting pilot sequence using non-CAZAC sequence in wireless communication system
CN113765633A (en) * 2020-06-03 2021-12-07 华为技术有限公司 Method and communication device for transmitting reference signal
CN114401068A (en) * 2021-12-27 2022-04-26 西安电子科技大学 Construction method of multi-group orthogonal sequence set

Also Published As

Publication number Publication date
ES2359952T3 (en) 2011-05-30
CN101262687B (en) 2012-11-21

Similar Documents

Publication Publication Date Title
CN101366193B (en) Sequence distributing method, sequence processing method and apparatus in communication system
US20210384999A1 (en) Method and apparatus for allocating and processing sequences in communication system
CN101574010B (en) Two-dimensional reference signal sequences
RU2007138505A (en) TRANSMISSION OF SIGNALS FOR A WIRELESS COMMUNICATION SYSTEM WITH ORTHOGONAL FREQUENCY PARTITION
CN1207848C (en) Training and synchronous sequence in multi-emitting and multi-receiving antenna CDMA and TDMA system
CN103475604A (en) Transmission method, transmission device, receiving method, and receiving device
CN101741793A (en) Method, system and equipment for transmitting uplink reference signals
CN101682446A (en) Method and apparatus for improving PAPR in OFDM or ordma communication system
CA2559814A1 (en) Method and apparatus for generating preamble sequence for adaptive antenna system in orthogonal frequency division multiple access communication system
CN101262687B (en) Sequence allocation method and device
CN101262255B (en) Sequence allocation and processing method and device for communication system
CN101179819A (en) Sequence allocated method, system and device in multi-cell system
KR101568714B1 (en) Apparatus and method for tarnsmitting and receiving information through fast feedback channel in a broadband wireless communication system
CN101174857A (en) Sequence distribution method, sequence processing method and device in communication system
KR20080056423A (en) A method of configuring reference signals for cell search
CN101675636B (en) Method and device for allocating resources in OFDM network
CN101542935B (en) Sequence distributing, processing method and apparatus in communication system
CN101299736B (en) Method and system for implementing channel quality indication information transmission, subscriber terminal and base station
CN101399793A (en) Method and apparatus for sequence distributing, processing, and apparatus thereof
CN101547034A (en) Pilot frequency method and device
CN102124699A (en) Ranging request/detection method and device, base station and terminal device for the wireless communication system
CN111836383A (en) SCMA codebook scheduling method based on beam domain channel
CN104468446A (en) Design method for pilot frequency in next generation broadcast wireless (NGB-W) communication system
CN103220013A (en) Method and device of spread spectrum communication for code division multiple access (CDMA) system
CN109586871A (en) A kind of transmission method and device of CSI-RS

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20080910

Assignee: Apple Computer, Inc.

Assignor: Huawei Technologies Co., Ltd.

Contract record no.: 2015990000755

Denomination of invention: Sequence allocation method and device

Granted publication date: 20121121

License type: Common License

Record date: 20150827

LICC Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model