Method and apparatus for allocating and processing sequences in communication system

Abstract

A method and apparatus for allocating and processing sequences in a communication system is disclosed. The method includes: dividing sequences in a sequence group into multiple sub-groups, each sub-group corresponding to its own mode of occupying time frequency resources; selecting sequences from a candidate sequence collection corresponding to each sub-group to form the sequences in the sub-group by: the sequences in a sub-group i in a sequence group k being composed of n sequences in the candidate sequence collection, the n sequences making a |r.sub.i/N.sub.i−c.sub.k/N.sub.p.sub.1| or |(r.sub.i/N.sub.i−c.sub.k/N.sub.p.sub.1) modu m.sub.k,i| function value the smallest, second smallest, till the n.sup.th smallest respectively; allocating the sequence group to cells, users or channels. It prevents the sequences highly correlated with the sequences of a specific length from appearing in other sequence groups, thus reducing interference, avoiding the trouble of storing the lists of massive sequence groups.

Claims

1. A method, comprising: determining, by the terminal device, a sequence index r.sub.i according to a group number k, wherein the sequence index r.sub.i is determined using the relation $k * \frac{N_{i}}{N_{1}},$ wherein N.sub.i, is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N.sub.1, is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is a index of the Zadoff-Chu sequence group; generating, by the terminal device, the reference signal sequence according to the sequence index r.sub.i; and transmitting, by the terminal device to a base station, the reference signal sequence.

2. Method of claim 1, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.

3. Method of claim 2, wherein the determining step further comprises determining the sequence index r.sub.i by rounding down the $k * \frac{N_{i}}{N_{1}} .$

4. Method of claim 2, wherein the determining step further comprises determining the sequence index r.sub.i by rounding up the $k * \frac{N_{i}}{N_{1}} .$

5. Method of claim 4, wherein the terminal device generates a second r.sub.i value by rounding down the $k * \frac{N_{i}}{N_{1}} .$

6. Method of claim 3, wherein the terminal device generates a second r.sub.i value by rounding up the $k * \frac{N_{i}}{N_{1}} .$

7. The method according to claim 1, wherein N.sub.1 is 31.

8. A terminal device, comprising: a processor coupled with a non-transitory storage medium storing executable instructions; wherein the executable instructions, when executed by the processor, cause the terminal device to: obtain a sequence index r.sub.i according to a group number k, wherein the sequence index r.sub.i is determined using the relation $k * \frac{N_{i}}{N_{1}},$ N.sub.i is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N.sub.1 is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is a index of the Zadoff-Chu sequence group; generate the reference signal sequence according to the sequence index r.sub.i; and transmit the reference signal sequence to a base station.

9. The device of claim 8, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.

10. The device of claim 8, wherein the executable instructions, when executed by the processor, cause the terminal device to determine the sequence index r.sub.i by rounding down the $k * \frac{N_{i}}{N_{1}} .$

11. The device of claim 8, wherein the executable instructions, when executed by the processor, cause the terminal device to determine the sequence index r.sub.i by rounding up the $k * \frac{N_{i}}{N_{1}} .$

12. The device of claim 11, wherein the executable instructions, when executed by the processor, cause the terminal device further to generate a second r.sub.i value by rounding down the $k * \frac{N_{i}}{N_{1}} .$

13. The device of claim 10, wherein the executable instructions, when executed by the processor, cause the terminal device further to generate a second r.sub.i ri value by rounding up the $k * \frac{N_{i}}{N_{1}} .$

14. The method according to claim 9, wherein N.sub.1 is 31.

15. A method, comprising: obtaining, by a terminal device, a group number k of a sequence group; obtaining, by the terminal device, a sequence index r.sub.i according to the group number k, wherein the sequence index r.sub.i satisfies with $r_{i} = .Math. \frac{N_{i} k}{31} + \frac{1}{2} .Math.,$ wherein r.sub.i is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generating, by the terminal device, the reference signal sequence according to the sequence index r.sub.i; and transmitting, by the terminal device, the reference signal sequence to a base station.

16. The method of claim 15, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.

17. A terminal device, comprising: a processor coupled with a non-transitory storage medium storing executable instructions; wherein the executable instructions, when executed by the processor, cause the terminal device to: obtain a group number k of a sequence group; obtain a sequence index r.sub.i according to the group number k, wherein the sequence index r.sub.i satisfies with $r_{i} = .Math. \frac{N_{i} k}{31} + \frac{1}{2} .Math.,$ wherein N.sub.i is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generate a reference signal sequence according to the sequence index r.sub.i; and transmit the reference signal sequence to a base station.

18. The terminal device of claim 17, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.

19. A method, comprising: obtaining, by a terminal device, a group number k of a sequence group; obtaining, by the terminal device, a sequence index r.sub.i according to the group number k, wherein a value of the sequence index r.sub.i minimizes |r.sub.i/N.sub.i −k/N.sub.1 |, wherein N.sub.i is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N.sub.1 is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generating, by the terminal device, a reference signal sequence according to the sequence index r.sub.i; and transmitting, by the terminal device to a base station, the reference signal sequence.

20. The method according to claim 19, wherein N.sub.1 is 31.

21. The method of claim 19, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.

22. A terminal device, comprising: a processor coupled with a non-transitory storage medium storing executable instructions; wherein the executable instructions, when executed by the processor, cause the terminal device to: obtain a group number k of a sequence group; obtain a sequence index r.sub.i according to the group number k, wherein a value of the sequence index r.sub.i minimizes |r.sub.i/N.sub.i −k/N.sub.1 |, wherein N.sub.i is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group N.sub.1 is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generate the reference signal sequence according to the sequence index r.sub.i; and transmit the reference signal sequence to a base station.

23. The terminal device according to claim 22, wherein N.sub.1 is 31.

24. The terminal device of claim 22, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) FIG. 1 shows the conventional art where the sequences transmitted by different cells occupy the same time frequency resources and have the same length;

(2) FIG. 2 shows the conventional art where the sequences transmitted by different cells occupy partially overlapped time frequency resources and have different lengths;

(3) FIG. 3 shows a calculation process for determining u and v in an embodiment of the present application;

(4) FIG. 4 is a flowchart of a sequence processing method in an embodiment of the present application;

(5) FIG. 5 shows a structure of a sequence processing apparatus in an embodiment of the present application;

(6) FIG. 6 shows a structure of a sequence processing apparatus in an embodiment of the present application; and

(7) FIG. 7 shows a structure of a sequence processing apparatus in another embodiment of the present application.

DETAILED DESCRIPTION OF THE APPLICATION

(8) A detailed description of the present application is provided hereunder with reference to accompanying drawings and preferred embodiments.

(9) In the Chinese application No. 200610173364.5, which was filed with the State Intellectual Property Office of the People's Republic of China by Huawei Technologies Co., Ltd. on Dec. 30, 2006, a method is provided to overcome the sequence interference caused by different modes of occupying time frequency resources by grouping sequences. The method shows: the sequences in a group are multiple sequences corresponding to different modes of occupying time frequency resources; the strongly correlated sequences are included into a group, and the correlation between different groups is relatively low; and then the sequence groups are allocated among the cells. The strongly correlated sequences are in the same group, and the sequences in the same group are used only in this group. The sequence groups used by different cells are little correlated with each other, thus avoiding strong correlation in the case of using sequences of different lengths in different cells.

(10) The strongly correlated sequences are included into a group. Generally, the composition of all sequences of each group may be stored. When a cell user or channel wants to use a sequence corresponding to a mode of occupying time frequency resources in the allocated sequence group, the desired sequence may be found in the stored sequence group. However, the formation of the sequence group needs a pre-stored table. If the size of the sequence group becomes greater, the storage occupies a huge space, and the searching is time-consuming. The extra storage increases the complexity and wastes hardware resources.

(11) Embodiment 1

(12) In this embodiment, the system allocates sequence groups to the cell, user or channel. The sequences in each sequence group are divided into multiple sequence sub-groups. Each sequence sub-group corresponds to a mode of occupying time frequency resources. In the communication system, each mode of occupying time frequency resources corresponds to a sequence sub-group uniquely. The sequences in each sub-group are selected from the candidate sequence collection corresponding to the sub-group in a specific selection mode. According to the allocated sequence group and the mode of occupying time frequency resources used for the specific transmit signals, the user or channel selects the sequences in the sequence sub-group corresponding to the mode of occupying the time frequency resources of the transmit signals in the allocated sequence group for transmitting or receiving.

(13) A certain selection mode can be: for a random sub-group i, determining a function ƒ.sub.i(.Math.) corresponding to the sub-group, where the domain of the function is the candidate sequence collection corresponding to the sub-group; determining n sequences from the candidate sequence collection to form sequences, n is a natural number, in the sub-group i, i is a serial number of the sub-group, in the sequence group k, k is the serial number of the sequence group, where the n sequences make the ƒ.sub.i(.Math.) function value the smallest, second smallest, and third smallest respectively, d(a,b) is a two variables function, and G.sub.k is a variable determined by the group number k. This selection mode is equivalent to: selecting n sequences from the candidate sequence collection to make the d(ƒ.sub.i(.Math.), G.sub.k) of all other sequences greater than d(ƒ.sub.i(.Math.), G.sub.k)) of these n sequences.

(14) The foregoing sequence selection mode is described below, taking a Zadoff-Chu sequence, namely, a.sub.r,N(z), in the CAZAC sequence as an example:

(15) Each sequence group is composed of M sub-groups. The candidate sequence collection of sub-groups 1,2, . . . , M includes the Zadoff-Chu sequences whose lengths are N.sub.1, N.sub.2, . . . , N.sub.M. The Zadoff-Chu sequence whose length is N.sub.i, namely, the a.sub.r.sub.i.sub., N.sub.i(z), z=0,1, . . . , N.sub.i−1 sequence, has N.sub.i−1 different basic sequences, depending on r.sub.i=1,2, . . . , N.sub.i−1. Specifically, the function corresponding to the sub-group i (namely, the sub-group i corresponding to the Zadoff-Chu sequence whose length is N.sub.i) is ƒ.sub.i:{a.sub.r.sub.i.sub.N.sub.i(z)}.sub.z=0, 1, 2, . . . , N.sub.i.sub.−1.fwdarw.r.sub.i/N.sub.i. The domain of this function is a candidate sequence collection corresponding to the sub-group i. r.sub.i is an index of the Zadoff-Chu sequence in the candidate sequence collection, and N.sub.i is the length of the Zadoff-Chu sequence in the candidate sequence collection.

(16) For the sequence group k=1,2, . . . , the sub-group numbered p.sub.1 is selected as a reference sub-group. The foregoing G.sub.k is defined as

(17) $G_{k} = f_{p_{1}} ({a_{c_{k}, N_{p_{1}}} (z)}_{z = 0, 1, .Math., N_{1} - 1}) = c_{k} / N_{p_{1}},$
N.sub.p.sub.1 is the length of the reference sub-group sequence, and C.sub.k is a basic sequence index of the sequence with a length of N.sub.p.sub.1 determined by the sequence group k. Particularly, if c.sub.k=k is selected, then

(18) $G_{k} = f_{p_{1}} ({a_{k, N_{p_{1}}}}) = k / N_{p_{1}} .$

(19) If the foregoing function d(a,b) is defined as |a−b|, the sequence that makes the d(ƒ.sub.p.sub.1(.Math.),G.sub.k))=d(ƒ.sub.p.sub.1(.Math.), ƒ.sub.p.sub.1({a.sub.k,N.sub.p1})) value the smallest in the sub-group numbered p.sub.1 in the sequence group k is the {a.sub.k,N.sub.p1} sequence with the index of r.sub.p.sub.1=k and length of N.sub.p.sub.1. In this case, d(ƒ.sub.p.sub.1(.Math.),G.sub.k=0.

(20) The sequences in the sub-group i=m in the sequence group k are n sequences that have the length of N.sub.m and make the |r.sub.m/N.sub.m−k/N.sub.p.sub.1| value the smallest, second smallest, and third smallest respectively, namely, n sequences that make the d(ƒ.sub.m(.Math.),ƒ.sub.p.sub.1({a.sub.k,N.sub.p1}) value smaller, where n is a natural number dependent on k and m.

(21) The foregoing embodiment reveals that: the sequences (for example, i=m, j=p.sub.1) in at least two sub-groups i and j in at least one sequence group k are n (n is a natural number dependent on k, i, and j) sequences selected from the candidate sequence collection and make the value of the function d(ƒ.sub.i(.Math.),ƒ.sub.j(.Math.)) such as the foregoing d(ƒ.sub.m(.Math.), ƒ.sub.p.sub.1({a.sub.k,N.sub.p1}) smallest, second smallest, and third smallest respectively.

(22) This embodiment is introduced below, taking a non-CAZAC sequence such as a Gauss sequence which has high auto correlation and cross correlation features as an example. A formula for generating a Gauss sequence is:
b.sub.α.sub.l.sub.,α.sub.l−1.sub., . . . , α.sub.0(n)=exp(−2πj(α.sub.ln.sup.l+α.sub.l−1n.sup.l−1+. . . +α.sub.0)), n=0, 1, 2, . . . , N Formula (2)

(23) In formula (2), n.sup.l is the highest-order item of the Gauss sequence, l is the highest order, and the value range of l is a positive integer. If l=2, α.sub.2=r/N, where N is a positive integer. If N=2N.sub.1 and α.sub.1=r(N.sub.1 mod 2)/N+2r/N.Math.p, the Gauss sequence is equivalent to a Zadoff-Chu sequence α.sub.r,N.sub.1(n) whose indexes are r, N.sub.1. if l>2, different α.sub.l=r/(Nl), r=1,2, . . . , N−1 values correspond to different Gauss sequence groups, and each group has multiple sequences which depend on the lower-order coefficients α.sub.l−1, α.sub.l−2, . . . . In this case, the Gauss sequence is not a CAZAC sequence, but has high auto correlation and cross correlation features. In this embodiment, α.sub.r,N(n) is used to represent multiple sequences b.sub.α.sub.l.sub.,α.sub.l−1.sub., . . . α.sub.0 (n) of α.sub.l=r/(lN). One of such sequences is defined as a basic sequence.

(24) For a Gauss sequence α.sub.r,N(z), the function corresponding to the sub-group i may be defined as ƒ.sub.i: {a.sub.r.sub.i.sub.N.sub.i(z)}.sub.z=0, 1, 2, . . . ,N.sub.i.sub.−1.fwdarw.r.sub.i/N.sub.i. The domain of this function is a candidate sequence collection corresponding to the sub-group i. In the function, r.sub.i is an index of the Gauss sequence in the candidate sequence collection, and N.sub.i is the length of the Gauss sequence in the candidate sequence collection.

(25) The function d(a,b) corresponding to the Gauss sequence may be d(a,b)=|(a−b) modu 1|, where the modu 1 operation is defined as making the modulo value included in (−½,½].

(26) Particularly, for the Zadoff-Chu sequence which can be construed as a special example of the Gauss sequence, if the basic sequence index is r=−(N−1)/2, . . . , −1,0,1, . . . , (N−1)/2, because |a−b<½, the modu 1 operation is not required.

(27) However, for general Gauss sequences such as r=1,3,5, . . . , N.sub.1−2,N.sub.1+2, . . . , 2N.sub.1−1, N=2N.sub.1, l=2, α.sub.2=r/(2N.sub.1),α.sub.1=0, and α.sub.r,N(z).sub.z=−(N.sub.1.sub.−1)/2, . . . . , −1, 0, 1, 2, . . . . , (N.sub.1.sub.−1)/2, (d(a,b)=(a−b)modu 1| is required. In other words, d(ƒ.sub.i, ƒ.sub.j) of the sequences corresponding to α.sub.2=r.sub.i/(2N.sub.i) and the sequences corresponding to α.sub.2=r.sub.j/(2N.sub.j) is

(28) $d (f_{i}, f_{j}) = .Math. r_{i} / N_{i} - r_{j} / N_{j} modu 1 .Math. = .Math. \frac{(r_{i} N_{j} - r_{j} N_{i}) modu N_{i} N_{j}}{N_{i} N_{j}} .Math.,$
where the modu N.sub.iN.sub.j operation is defined as making the modulo value included in (−N.sub.iN.sub.j/2, N.sub.iN.sub.j/2]. If l=3 and d(ƒ.sub.i, ƒ.sub.j) of the sequences corresponding to α.sub.3=r.sub.i/(3N.sub.i) and the sequences corresponding to α.sub.3=r.sub.j/(3N.sub.j) is d(ƒ.sub.i,ƒ.sub.j)=|(r.sub.i/N.sub.i−r.sub.j/N.sub.j)modu 1| and l=4,5, . . . , the processing is similar.

(29) The Gauss sequence may be defined in another way. If α.sub.l=r.sub.i/N, and α.sub.r.sub.i.sub.,N is used to represent the corresponding Gauss sequence, then the foregoing ƒ.sub.i of the function is defined as ƒ.sub.i:a.sub.r.sub.i.sub.,N.sub.i(z).fwdarw.r.sub.i/N.sub.i, and the function d(a,b) is defined as d(a,b)=|(a−b) modu 1/l|, where the modu 1/l operation makes −1(2l)<(a−b) modu 1/l≤1/(2l). Therefore, the definition of the two types of Gauss sequences generates the same sequence group. The definition of such a measurement function is also applicable to the Zadoff-Chu sequence.

(30) In another embodiment, if the mode of occupying time frequency resources is that the sequence is modulated on the radio resource whose sub-carrier interval (or time domain sampling interval) is s, then the function corresponding to the sub-group with the interval s is: ƒ.sub.N.sub.i.:{a.sub.s.sub.2.sub.r.sub.i.sub.,N.sub.i(z)}.sub.z=0, 1, 2, . . . , N.sub.i.sub.−1.fwdarw.r.sub.i/N.sub.i, where s is the sub-carrier (or time domain sampling) interval of the radio resource. For a Gauss sequence, the function is ƒ.sub.N.sub.i:{a.sub.s.sub.l.sub.r.sub.i.sub.,N.sub.i(z)}.sub.z=0, 1, 2, . . . , N.sub.i.sub.−1.fwdarw.r.sub.i/N.sub.i, where l is the highest order of the Gauss sequence.

(31) The foregoing reference sub-group is set according to multiple factors. A sub-group of a specific sequence length may be selected as a reference sub-group.

(32) Preferably, the sub-group with the minimum sequence length in the system is selected as a reference sub-group. The quantity of available sequence groups in the system is the same as the quantity of sequences of this length. Therefore, shorter sequences do not appear repeatedly in different sequence groups. For example, supposing the shortest sequence length according to the resource occupation mode is 11 in the system, then in the foregoing method, N.sub.p.sub.1=N.sub.1=11. In this case, 10 sequence groups are available in the system.

(33) Alternatively, the sub-group with the maximum sequence length in the sequence group may be selected as a reference sub-group. For example, the maximum sequence length in the sequence group is 37, and a sub-group with the sequence length 37 is selected as a reference sub-group. In this case, N.sub.p.sub.1=N.sub.2=37, and 36 sequence groups are available. When r.sub.2 meets −1/(2N.sub.i)<r.sub.2/N.sub.2<1/(2N.sub.1), if the value of r.sub.1 is not limited to r.sub.1=1,2, . . . , N.sub.1−1, then r.sub.1 that makes the |r.sub.2/N.sub.2−r.sub.1/N.sub.1| value the smallest is 0. In practice, the value 0 of r.sub.1 does not correspond to the Zadoff-Chu sequence. Therefore, r.sub.2 that makes −1/(2N.sub.1)<r.sub.2/N.sub.2<1/(2N.sub.1), namely, r.sub.2=+1,−1, may be removed. In this way, there are 34 groups of sequences in total. In a sequence group, the quantity of the shortest sequences is less than 36. Therefore, the shortest sequences are used repeatedly.

(34) Moreover, the reference sub-group may be a default sub-group of the system, and may be set by the system as required and notified to the user. After a sequence in the reference sub-group j is selected, the sequences in the sub-group i are n sequences that make the d(ƒ.sub.i(.Math.), ƒ.sub.j(.Math.)) value smaller, and are in the sequence group that contain the sequences selected for the reference sub-group j. Different sequence groups are generated by selecting different sequences of the reference sub-group j.

(35) The sequence group formed in the above method is described below through examples.

(36) There are 3 sub-groups in total in this embodiment. The sequence candidate collection includes Zadoff-Chu sequences whose lengths are 11, 23 and 37 respectively, corresponding to three resource occupation modes. If N.sub.p.sub.1=N.sub.1=11 is selected, then there are 10 sequence groups in total. By selecting the sequences that make the absolute value of (r.sub.m/N.sub.m−r.sub.1/N.sub.1) the smallest and including them into each sequence group, where each sub-group contains only one sequence and the sequence is represented by a basic sequence index, the following table is generated:

(37) TABLE-US-00001 TABLE 1 N.sub.2 = 23 N.sub.3 = 37 N.sub.2 = 23 N.sub.3 = 37 N.sub.1 = 11 Basic Basic N.sub.1 = 11 Basic Basic Group Sequence Sequence Group Sequence Sequence Number K Index r.sub.2 Index r.sub.3 Number K Index r.sub.2 Index r.sub.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

(38) The foregoing grouping method makes the absolute value of r.sub.m/N.sub.m−r.sub.1/N.sub.1=(N.sub.1r.sub.m−N.sub.mr.sub.1)/(N.sub.1N.sub.m) the smallest, namely, makes the absolute value of N.sub.1r.sub.m−N.sub.mr.sub.1 the smallest. That is, the method ensures high correlation between sequences. As verified, the correlation between the sequences in each sequence group in Table 1 is very high.

(39) In the foregoing embodiment, selection of the n sequences comes in two circumstances:

(40) Preferably, n is 1, namely, in the foregoing example, a sequence that makes (r.sub.m/N.sub.m−k/N.sub.1) the smallest is selected and included into a sub-group m.

(41) Preferably, n is a natural number greater than 1, and the value of n depends on the length difference between sub-group N.sub.m and reference sub-group N.sub.1. The sequences corresponding to several basic sequence indexes near r.sub.m that makes (r.sub.m/N.sub.m−k/N.sub.1) the smallest are included into a sub-group. Generally, such sequences are n sequences closest to the minimum r.sub.m, where n depends on the length difference between N.sub.1 and N.sub.m.

(42) For example, if N.sub.m is about 4×N.sub.1, two r.sub.m's may be included into the group. Generally, n=┌N.sub.m/(2N.sub.i)┐ may be selected. In an example, n=└N.sub.m/N.sub.1┘ may be selected, where └z┘ is the maximum integer not greater than z. In the sequence sub-group in this case, there may be more than one sequence of a certain length. After such allocation in the system, when using the sequence, the user may select any of the allocated n sequences for transmitting, for example, select the sequence that makes (r.sub.m/N.sub.m−k/N.sub.1) the smallest, second smallest, and so on.

(43) When two Zadoff-Chu sequences of different lengths are highly correlated, it is sure that |r.sub.m/N.sub.m−r.sub.1/N.sub.1| is relatively small. In the foregoing allocation method, it is ensured that the value of |r.sub.i/N.sub.i−r.sub.j/N.sub.j| between two sub-groups i,j of different groups is great. Therefore, the sequences are little correlated between different groups, and the interference is low. Further, among the sequences of certain lengths, some may be selected for allocation, and the remaining are not used in the system. This prevents the sequences the second most correlated with the sequences in the reference sub-group from appearing in other sequence groups, and reduces strong interference.

(44) If the foregoing function d(a,b) is defined as |(a−b)modu m.sub.k,i|, where modu m.sub.k,i causes the value of the function d(a,b) after this operation to be included in (−m.sub.k,i/2,m.sub.k,i/2], and m.sub.k,i is a variable determined by the group number k and sub-group number i, then m.sub.k,i=1/B, where B is a natural number, namely, m.sub.k,iϵ{1, ½, ⅓, ¼, . . . }.

(45) The foregoing sequence allocation mode is described below, taking a Zadoff-Chu sequence, namely, a.sub.r,N(z), in the CAZAC sequence as an example:

(46) For the sequence group k=1,2, . . . , the sub-group numbered p.sub.1 is selected as a reference sub-group. The foregoing G.sub.k is defined as

(47) $G_{k} = f_{p_{1}} ({a_{w_{k}, N_{p_{1}}} (z)}_{z = - 0, 1, .Math., N_{1} - 1}) = w_{k} / N_{p_{1}},$
N.sub.p.sub.1 is the length of the reference sub-group sequence, and w.sub.k is a basic sequence index of the sequence with a length of N.sub.p.sub.1 determined by the sequence group k. Particularly, if w.sub.k=k is selected, then

(48) $G_{k} = f_{p_{1}} ({a_{k, N_{p_{1}}}}) = k / N_{p_{1}} .$
Therefore, the sequence that makes the d(ƒ.sub.p.sub.1(.Math.), G.sub.k)=d(ƒ.sub.p.sub.1(.Math.), ƒ.sub.p.sub.1({a.sub.k,N.sub.p1})) value the smallest in the sub-group numbered p.sub.1 in the sequence group k is the {a.sub.k,N.sub.p1} sequence with the index of r.sub.p1=k and length of N.sub.p1. In this case, d(ƒ.sub.p1(.Math.), G.sub.k)=0.

(49) The sequences in the sub-group i=q in the sequence group k are n sequences that have the length of N.sub.q and make the |(r.sub.q/N.sub.q−k/N.sub.p1) modu m.sub.k,q| value the smallest, second smallest, and third smallest respectively, namely, n sequences that make the d(ƒ.sub.p.sub.1(.Math.), ƒ.sub.p.sub.1({a.sub.k,N.sub.p1})) value the smallest.

(50) It should be noted that the foregoing function d(a,b)=|(a−b) modu m.sub.k,i| may vary between different sequence groups, or different sub-groups of the same sequence group. For example, all sub-groups of one sequence group adopt a d(a,b) function, and all sub-groups of another sequence group adopt another d(a,b) function. Alternatively, one sub-group adopts a d(a,b) function, and another sub-group may adopt another d(a,b) function. Specifically, m.sub.k,i in the function has different values, which give rise to different measurement functions.

(51) The sequence group formed in the foregoing method is described below through examples.

(52) There are 3 sub-groups in total in this embodiment. The sequence candidate collection includes Zadoff-Chu sequences whose lengths are 31, 47 and 59 respectively, corresponding to three resource occupation modes. If N.sub.p1=N.sub.1=31 is selected, then there are 30 sequence groups in total. By using m.sub.k,q in Table 2 and selecting the sequences that make |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest and including them into each sequence group, where each sub-group contains only one sequence and the sequence is represented by a basic sequence index, Table 3 is generated:

(53) TABLE-US-00002 TABLE 2 N.sub.1 = 31 N.sub.1 = 31 Group N.sub.2 = 47 N.sub.3 = 59 Group N.sub.2 = 47 N.sub.3 = 59 Number K m.sub.k,2 m.sub.k,3 Number K m.sub.k,2 m.sub.k,3 1 1/2 1 16 1/3 1/2 2 1 1 17 1/4 1/2 3 1/2 1/3 18 1/3 1 4 1 1/2 19 1 1 5 1/2 1/2 20 1/3 1 6 1 1/2 21 1 1 7 1/2 1/3 22 1/3 1 8 1 1 23 1 1 9 1/3 1 24 1/2 1/3 10 1 1 25 1 1/2 11 1/3 1 26 1/2 1/2 12 1 1 27 1 1/2 13 1/3 1 28 1/2 1/3 14 1/4 1/2 29 1 1 15 1/3 1/2 30 1/2 1

(54) TABLE-US-00003 TABLE 3 N.sub.2 = 47 N.sub.3 = 59 N.sub.2 = 47 N.sub.3 = 59 N.sub.1 = 31 Basic Basic N.sub.1 = 31 Basic Basic Group Sequence Sequence Group Sequence Sequence Number K Index r.sub.2 Index r.sub.3 Number K Index r.sub.2 Index r.sub.3 1 25 2 16 40 1 2 3 4 17 14 3 3 28 45 18 43 34 4 6 37 19 29 36 5 31 39 20 46 38 6 9 41 21 32 40 7 34 33 22 2 42 8 12 15 23 35 44 9 45 17 24 13 26 10 15 19 25 38 18 11 1 21 26 16 20 12 18 23 27 41 22 13 4 25 28 19 14 14 33 56 29 44 55 15 7 58 30 22 57

(55) The following grouping method makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| smallest. As verified, all the sequences in Table 3 are the sequences the most correlated with the sequences in the reference sub-group of the same sequence group. Therefore, the correlation of the sequences between different groups is further reduced, and the inter-group interference is weaker.

(56) When the number of sub-carriers that bear the sequence in the cell is not a prime number, it is necessary to select the sequence whose length is equal to the prime number around the number of sub-carriers, and the desired sequence is obtained through sequence segmentation or cyclic extension of the sequence before being transmitted.

(57) The following description takes cyclic extension as an example. In this embodiment, there are quantities of sub-carriers that bear the sequences: 36, 48, and 60.

(58) The sequences with a length of the maximum prime number less than the quantity of sub-carriers, namely, the Zadoff-Chu sequences corresponding to the lengths 31, 47 and 59, are selected, and the desired sequences are obtained through cyclic extension of such sequences. If N.sub.p.sub.1=N.sub.1=31 is selected, then there are 30 sequence groups in total. By using m.sub.k,q in Table 4 and selecting the sequences that make |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest and including them into each sequence group, where each sub-group contains only one sequence and the sequence is represented by a basic sequence index, Table 5 is generated:

(59) TABLE-US-00004 TABLE 4 N.sub.1 = 31 N.sub.1 = 31 N.sub.2 = 47 Group N.sub.2 = 47 N.sub.3 = 59 Group N.sub.3 = 59 m.sub.k,2 Number K m.sub.k,2 m.sub.k,3 Number K m.sub.k,3 1 1/2 1 16 1/3 1/2 2 1 1 17 1 1/3 3 1/2 1/3 18 1/3 1/3 4 1 1/2 19 1 1 5 1/2 1/2 20 1/3 1 6 1 1/2 21 1 1 7 1/3 1/3 22 1/3 1 8 1 1 23 1 1 9 1/3 1 24 1/3 1/3 10 1 1 25 1 1/2 11 1/3 1 26 1/2 1/2 12 1 1 27 1 1/2 13 1/3 1/3 28 1/2 1/3 14 1 1/3 29 1 1 15 1/3 1/2 30 1/2 1

(60) TABLE-US-00005 TABLE 5 N.sub.2 = 47 N.sub.3 = 59 N.sub.2 = 47 N.sub.3 = 59 N.sub.1 = 31 Basic Basic N.sub.1 = 31 Basic Basic Group Sequence Sequence Group Sequence Sequence Number K Index r.sub.2 Index r.sub.3 Number K Index r.sub.2 Index r.sub.3 1 25 2 16 40 1 2 3 4 17 26 52 3 28 45 18 43 54 4 6 37 19 29 36 5 31 39 20 46 38 6 9 41 21 32 40 7 42 33 22 2 42 8 12 15 23 35 44 9 45 17 24 5 26 10 15 19 25 38 18 11 1 21 26 16 20 12 18 23 27 41 22 13 4 5 28 19 14 14 21 7 29 44 55 15 7 58 30 22 57

(61) The following grouping method makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest. As verified, all the sequences in Table 5 are the sequences the most correlated with the sequences in the reference length of the same sequence group. Therefore, the correlation of sequences between different groups is further reduced, and the inter-group interference is weaker.

(62) The specific value of m.sub.k,q may be: if N.sub.q≥L.sub.r, then m.sub.k,q=1, where N.sub.q is the sequence length of the sub-group q, and L.sub.r is determined by the reference sub-group sequence length N.sub.p.sub.1. Specifically, for N.sub.p.sub.1=N.sub.1=31, L.sub.r=139. If N.sub.q=139 or above, then m.sub.k,q=1. After cyclic extension of the sequence, L.sub.r=191. Therefore, when N.sub.q=191 or above, m.sub.k,q=1.

(63) In the foregoing embodiment, selection of the n sequences comes in two circumstances:

(64) Preferably, n is 1, namely, in the foregoing example, a sequence that makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest is selected and included into the sub-group q.

(65) Preferably, n is a natural number greater than 1, and the value of n depends on the length difference between sub-group N.sub.q and reference sub-group N.sub.1. The sequences corresponding to several basic sequence indexes near r.sub.q that makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest are included into a sub-group. Generally, such sequences are n sequences closest to the minimum r.sub.q, where n depends on the length difference between N.sub.1,N.sub.q. For example, if N.sub.q is about 4×N.sub.1, two r.sub.q's may be included into the group. Generally, n=|N.sub.q/(2N.sub.1)| may be selected, where ┌z┐ is the minimum integer greater than z. In another example, n=└N.sub.q/N.sub.1┘ may be selected, where └z┘ is the maximum integer not greater than z. In the sequence sub-group in this case, there may be more than one sequence of a certain length. After such allocation in the system, when using the sequence, the user may select any of the allocated n sequences for transmitting, for example, select r.sub.q=ƒ that makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest, then the fewer n sequences are ƒ±1, ƒ±2 . . . . The transmitter and the receiver may obtain the data through calculation in this way rather than store the data.

(66) When two Zadoff-Chu sequences of different lengths are highly correlated, it is sure that |(r.sub.q/N.sub.q−r.sub.1/N.sub.1) modu m.sub.r.sub.1,q| is relatively small. In the foregoing allocation method, it is ensured that the value of i,j between two sub-groups |(r.sub.i/N.sub.i−r.sub.j/N.sub.j) modu m.sub.r.sub.j.sub.,i| of different groups is great. Therefore, the sequences are little correlated between different groups, and the interference is low. Further, among the sequences of certain lengths, some may be selected for allocation, and the remaining are not used in the system. This prevents the sequences the second most correlated with the sequences in the reference sub-group from appearing in other sequence groups, and reduces strong interference between groups.

(67) In other embodiments, the definition of the foregoing function d(a,b) may also be

(68) $d (a, b) = {\begin{matrix} .Math. a - b .Math., & when u \leq (a - b) \leq v \\ infinity, & others \end{matrix}, or d (a, b) = {\begin{matrix} .Math. (a - b) modu m_{k, i} .Math., & when u \leq (a - b) modu m_{k, i} \leq v \\ infinity, & others \end{matrix} .$
The infinity in the definition of the d(a,b) function filters out certain sequences, and ensures low correlation between different groups.

(69) It should be noted that the foregoing function

(70) $d (a, b) = {\begin{matrix} .Math. a - b .Math., & when u \leq (a - b) \leq v \\ infinity, & others \end{matrix}, or d (a, b) = {\begin{matrix} .Math. (a - b) modu m_{k, i} .Math., & when u \leq (a - b) modu m_{k, i} \leq v \\ infinity, & others \end{matrix}$
may vary between different sequence groups, or different sub-groups of the same sequence group. For example, all sub-groups of one sequence group adopt a d(a,b) function, and all sub-groups of another sequence group adopt another d(a,b) function. Alternatively, one sub-group adopts a d(a,b) function, and another sub-group may adopt another d(a,b) function.

(71) Specifically, u,v in the function has different values, which give rise to different measurement functions. For example, u=0,v=+∞, or u=−∞, v=0, or u=−1/(2×11)+1/(23×4), v=1/(2×11)−1/(23×4), or u=a,v=b, where a,b depend on the sequence group k and sub-group i, and so on.

(72) Specifically, in the foregoing embodiment of ƒ.sub.i:{a.sub.r.sub.i.sub.,N.sub.i(z)}.sub.z=0, 1, 2, . . . , N.sub.i.sub.−1.fwdarw.r.sub.i/N.sub.i,

(73) $if d (a, b) = {\begin{matrix} .Math. a - b .Math., & when u \leq (a - b) \leq v \\ infinity, & others \end{matrix},$
this embodiment is: selecting the sequences that meet u≤(r.sub.i/N.sub.i−k/N.sub.p.sub.i)≤v and including them into each sequence group; |r.sub.i/N.sub.i−r.sub.j/N.sub.j|>1/C.sub.i is met between any two sequences of different sequence groups, where N.sub.i<N.sub.j, as detailed below:

(74) First, u=0,v=+∞ or u=−∞,v=0, namely, the sequences that make the value the smallest in a single direction. For the positive direction, it is equivalent to selecting the sequences that meet (r.sub.m/N.sub.m−k/N.sub.p.sub.1)≥0; for the negative direction, it is equivalent to selecting the sequences that meet (k/N.sub.p.sub.1−r.sub.m/N.sub.m)≥0. For example, if the sub-group length is N.sub.m, the positive result closest to k/N.sub.p.sub.1 is r.sub.m with the difference of 0.036, and the negative result closest to k/N.sub.p.sub.1 is r.sub.m′ with the difference of −0.025. The one the most correlated with the r.sub.p.sub.1=k sequence of a length of N.sub.p.sub.1 is r.sub.m′. If the system specifies that the sequence in the positive direction of (r.sub.m/N.sub.m−k/N.sub.p.sub.1) needs to be selected, r.sub.m is selected. The benefit is: after the sequences of various lengths are compared with k/N.sub.p.sub.1, the difference between the function values, namely, |r.sub.i/N.sub.i−r.sub.j/N.sub.j|, is smaller.

(75) Secondly, u=−1/(2N.sub.p.sub.1)+1/(4N.sub.p.sub.2) and v=1/(2N.sub.p.sub.1)−1/(4N.sub.p.sub.2) may be selected. The length (N.sub.p.sub.1) of the reference sequence is the shortest sequence length and N.sub.p.sub.2 is the sequence length only greater than N.sub.p.sub.1. Here is an example:

(76) In this embodiment, there are 4 sub-groups in total. The candidate sequence collections contain Zadoff-Chu sequences with N.sub.1=11, N.sub.2=23, N.sub.3, and N.sub.4=47 respectively. By selecting the sequences that meet |r.sub.i/N.sub.i−k/N.sub.1|<1/(2N.sub.1)−1/(4N.sub.2), namely, |r.sub.i/N.sub.i−k/N.sub.1|<1/(2×11)−1/(4×23) and including them into the sub-groups of each sequence group, the following table is generated, where the sequence is represented by a basic sequence index:

(77) TABLE-US-00006 TABLE 6 N.sub.2 = 23 N.sub.3 = 37 N.sub.4 = 47 N.sub.1 = 11 Basic Basic Basic Group Sequence Sequence Sequence Number K Index r.sub.2 Index r.sub.3 Index r.sub.4 1 2 3, 4 3, 4, 5 2 4 6, 7, 8 7, 8, 9, 10 3 6, 7 9, 10, 11 12, 13, 14 4 8, 9 13, 14 16, 17, 18 5 10, 11 16, 17, 18 20, 21, 22 6 12, 13 19, 20, 21 25, 26, 27 7 14, 15 23, 24 29, 30, 31 8 16, 17 26, 27, 28 33, 34, 35 9 19 29, 30, 31 37, 38, 39, 40 10 21 33, 34 42, 43, 44

(78) In table 6, |r.sub.i/N.sub.i−r.sub.j/N.sub.j|>1/(2N.sub.i) is met between any two sequences of different sequence groups, where N.sub.i<N.sub.j. In this way, the correlation between the two sequences is relatively lower.

(79) Thirdly, for different sequence groups k and different sub-groups i in the same sequence group, u,v may differ.

(80) The shortest sequence is selected as a reference sequence. Therefore, N.sub.p.sub.1 represents the length of the shortest sequence, and N.sub.p.sub.L represents the length of the longest sequence; the sequence group that includes the basic sequence with a length of N.sub.p.sub.1 and an index of 1 is numbered “q.sub.1”; the sequence group that includes the basic sequence with a length of N.sub.p.sub.1 and an index of N.sub.p.sub.1−1 is numbered “q.sub.N.sub.p1.sub.−1”; the sequence group that includes the basic sequence with a length of N.sub.p.sub.1 and an index of k is numbered “q.sub.k”; the sequence group that includes the basic sequence with a length of N.sub.p.sub.1 and an index of k+1 is numbered “q.sub.k+1”; the sub-group that includes the basic sequence with a length of N.sub.p.sub.1 is numbered “p.sub.1”; the sub-group that includes the basic sequence with a length of N.sub.p.sub.m is numbered “p.sub.m”; the sub-group that includes the basic sequence with a length of N.sub.p.sub.i−1 is numbered “p.sub.i−1”; and the sub-group that includes the basic sequence with a length of N.sub.p.sub.i is numbered “p.sub.i”, where N.sub.p.sub.i−1<N.sub.p.sub.i.

(81) Step 1001: For the sub-group P.sub.1 of the sequence group q.sub.1, u.sub.q.sub.1.sub.,p.sub.1=−1/(2N.sub.p.sub.1)+δ.sub.u, where 1/N.sub.p.sub.L−1/N.sub.p.sub.1+1/(2N.sub.p.sub.1)≤δ.sub.u<½(N.sub.p.sub.1). v.sub.q.sub.k.sub.,p.sub.1 of the sub-group p.sub.1 of the sequence group q.sub.k and u.sub.q.sub.k+1.sub.,p.sub.1 of the sub-group p.sub.1 of the sequence group q.sub.k+1 (k−1, . . . N.sub.p.sub.1−2) are: v.sub.p.sub.k.sub.,p.sub.1=1/D, u.sub.q.sub.k+1.sub.,p.sub.1=−1/D where 1/D≤1/(2N.sub.p.sub.1).

(82) Step 1002: As shown in FIG. 3, v.sub.q.sub.k.sub.,p.sub.i of the sub-group p.sub.i of the sequence group q.sub.k and u.sub.q.sub.k+1.sub.,p.sub.i of the sub-group p.sub.i of the sequence group q.sub.k+1 (k=1, . . . , N.sub.p.sub.1−2, iϵ¼S) are: right.sub.q.sub.k.sub.,p.sub.i−1=v.sub.q.sub.k.sub.,p.sub.i−1+k/N.sub.p.sub.1, left.sub.q.sub.k+1.sub.,p.sub.i−1=u.sub.q.sub.k+1.sub.,p.sub.i−1+(k+1)/N.sub.p.sub.1

(83) For the basic sequence with a length of N.sub.p.sub.i−1, depending on the value of r.sub.p.sub.i−1, r.sub.q.sub.k+1.sub.,p.sub.i−1 that meets r.sub.p.sub.i−1/N.sub.p.sub.i−1−left.sub.q.sub.k+1.sub.,p.sub.i−1≥0 and minimum |r.sub.p.sub.i−1/N.sub.p.sub.i−1−left.sub.q.sub.k+1.sub.,p.sub.i−1| is obtained, namely, the obtained basic sequence r.sub.q.sub.k+1.sub.,p.sub.i−1 is included in the sequence group q.sub.k+1, has a length of N.sub.p.sub.i−1 and is closest to the left border (left.sub.q.sub.k+1.sub.,p.sub.i−1) of the sequence group q.sub.k+1.

(84) If r.sub.q.sub.k+1.sub.,p.sub.i−1/N.sub.p.sub.i−1−1/C.sub.p.sub.i−1−right.sub.q.sub.k.sub.,p.sub.i−1≤0, namely, r.sub.q.sub.k−.sub.,p.sub.i−1/N.sub.p.sub.i−1−1/C.sub.p.sub.i−1 is less than the right border (right.sub.q.sub.k.sub.,p.sub.i−1) of the sequence group q.sub.k, then v.sub.q.sub.k.sub.p.sub.1=v.sub.q.sub.k.sub.,p.sub.i−1+r.sub.q.sub.k+1.sub.,p.sub.i−1/N.sub.p.sub.i−1−1/C.sub.p.sub.i−1−right.sub.q.sub.k.sub.,p.sub.i−1, to ensure low cross correlation between the sequence group q.sub.k and its adjacent sequence group q.sub.k+1; if r.sub.p.sub.k+1.sub.,p.sub.i−1/N.sub.p.sub.i−1−1/C.sub.p.sub.i−1−right.sub.q.sub.k.sub., p.sub.i−1>0, namely, r.sub.p.sub.k+1.sub.,p.sub.i−1/N.sub.p.sub.i−1−1/C.sub.p.sub.i−1 is greater than the right border (right.sub.q.sub.k.sub., p.sub.i−1) of the sequence group q.sub.k, then v.sub.q.sub.k.sub.,p.sub.i=v.sub.q.sub.k.sub.,p.sub.i−1.

(85) For the basic sequence with a length of N.sub.p.sub.i−1, depending on the value of r.sub.p.sub.i−1, r.sub.p.sub.k.sub.,p.sub.i−1 that meets r.sub.p.sub.i−1/N.sub.p.sub.i−1−right.sub.q.sub.k.sub.,p.sub.i−1≤0 and minimum |r.sub.p.sub.i−1/N.sub.p.sub.i−1−right.sub.q.sub.k.sub.,p.sub.i−1| is obtained, namely, the obtained basic sequence q.sub.k is included in the sequence group N.sub.p.sub.i−1, has a length of q.sub.k and is closest to the right border (right.sub.q.sub.k.sub.,p.sub.i−1) of the sequence group r.sub.q.sub.k.sub.,p.sub.i−1.

(86) If r.sub.q.sub.k.sub.,p.sub.i−1/N.sub.p.sub.i−1+1/C.sub.p.sub.i−1−left.sub.q.sub.k+1.sub.,p.sub.i−1≥0, namely, r.sub.q.sub.k.sub., p.sub.i−1/N.sub.p.sub.i−+1/C.sub.p.sub.i−1 is greater than the left border (q.sub.k+1) of the sequence group left.sub.q.sub.k+1.sub.,p.sub.i−1, then

(87) 0 $u_{q_{k + 1}, p_{i}} = u_{q_{k + 1}, p_{i - 1}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{k + 1}}, p_{i - 1},$
to ensure low cross correlation between the sequence group q.sub.k and its adjacent sequence group q.sub.k+1; if r.sub.q.sub.k.sub.,p.sub.i−1/N.sub.p.sub.i−1+1/C.sub.p.sub.i−1−left.sub.q.sub.k+1.sub.,p.sub.i−1<0, namely, r.sub.q.sub.k.sub., p.sub.i−1/N.sub.p.sub.i−+1/C.sub.p.sub.i−1 is less than the left border (q.sub.k+1) of the sequence group left.sub.q.sub.k+1.sub.,p.sub.i−1, then u.sub.q.sub.k+1.sub.,p.sub.i=u.sub.q.sub.k+1.sub.,p.sub.i−1.

(88) q.sub.N.sub.p1.sub.−1 of the sub-group p.sub.i of the sequence group

(89) $v_{q_{N_{p_{1}} - 1}, p_{i}}$
and q.sub.1 of the sub-group p.sub.i of the sequence group u.sub.q.sub.q.sub.,p.sub.i (iϵS) are:

(90) ${right}_{q_{N_{p 1} - 1, p_{i - 1}}} = v_{q_{N_{p 1} - 1, p_{i - 1}}} + (N_{p_{1}} - 1) / N_{p_{1}}, {left}_{q_{1}, p_{i - 1}} = u_{q_{1} p_{i - 1}} + 1 / N_{p_{1}}$ ${right}_{q_{N_{p 1} - 1, p_{i - 1}}^{'}} = v_{q_{N_{p 1} - 1, p_{i - 1}}} - 1 / N_{p_{1}}, {left}_{q_{1}, p_{i - 1}}^{'} = u_{q_{1}, p_{i - 1}} + (N_{p_{1}} + 1) / N_{p_{1}}$

(91) For the basic sequence with a length of N.sub.p.sub.i−1, depending on the value of r.sub.p.sub.i−1, r.sub.q.sub.1.sub.,p.sub.i−1 that meets r.sub.p.sub.i−1/N.sub.p.sub.i−1−left.sub.q.sub.1.sub.,p.sub.i−1≥0 and minimum |r.sub.p.sub.i−1/N.sub.p.sub.i−1−left.sub.q.sub.1.sub.,p.sub.i−1| is obtained;

(92) $If r_{q_{1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - {right}_{q_{N_{p 1} - 1, p_{i - 1}}^{'}} \leq 0, then$ $v_{q_{N_{p 1} - 1, p_{i}}} = v_{q_{N_{p 1} - 1, p_{i - 1}}} + r_{q_{1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - {right}_{q_{N_{p 1} - 1, p_{i - 1}}^{'}}; if$ $r_{q_{1}, p_{i - 1}} / N_{p_{i - 1}} - 1 / C_{p_{i - 1}} - {right}_{q_{N_{p 1} - 1, p_{i - 1}}^{'}} > 0, then$ $v_{q_{N_{p 1} - 1, p_{i}}} = v_{q_{N_{p 1} - 1, p_{i - 1}}};$

(93) For the basic sequence with a length of N.sub.p.sub.i−1, depending on the value of r.sub.p.sub.i−1,

(94) $r_{q_{N_{p 1} - 1, p_{i - 1}}}$
that meets

(95) $r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{N_{p 1} - 1, p_{i - 1}}} \leq 0$
and minimum

(96) $.Math. r_{p_{i - 1}} / N_{p_{i - 1}} - {right}_{q_{N_{p 1} - 1, p_{i - 1}}} .Math.$
is obtained

(97) $If r_{q_{N_{p 1} - 1, p_{i - 1}}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{1}, p_{i - 1}}^{'} \geq 0, then$ $u_{q_{1}, p_{i}} = u_{q_{1}, p_{i - 1}} + r_{q_{N_{p 1} - 1, p_{i - 1}}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{1}, p_{i - 1}}^{'}; if$ $r_{q_{N_{p 1} - 1, p_{i - 1}}} / N_{p_{i - 1}} + 1 / C_{p_{i - 1}} - {left}_{q_{1}, p_{i - 1}}^{'} < 0, then u_{q_{1}, p_{i}} = u_{q_{1}, p_{i - 1}};$

(98) Particularly, C.sub.p.sub.i−1=2N.sub.p.sub.i−1.

(99) Step 1003: u.sub.q.sub.k.sub.,p.sub.i and v.sub.q.sub.k.sub.,p.sub.i of the sub-group p.sub.i in the sequence group q.sub.k (k=1, . . . , N.sub.p.sub.1−1, iϵI−S) are: u.sub.q.sub.k.sub.,p.sub.i=u.sub.q.sub.k.sub.,p.sub.m and v.sub.q.sub.k.sub.,p.sub.i=v.sub.q.sub.k.sub.,p.sub.m, respectively where I and S are two index collections; in the collection I={2,3 . . . , L)}, L is the quantity of sequence lengths in a candidate sequence collection, and the collection S is the collection I or a sub-collection of the collection I, and m is an element with the maximum value in the collection S.

(100) In the following example, δ.sub.u=0, δ.sub.v=0, D=2N.sub.p.sub.i, C.sub.p.sub.i−1=2N.sub.p.sub.i−1, q.sub.k=k, and p.sub.i=i.

EXAMPLE 1

(101) In this example, there are 4 sub-groups in total. The candidate sequence collection contains the Zadoff-Chu are sequences with N.sub.1=11, N.sub.2=23, N.sub.3=37, and N.sub.4=47 respectively. Taking the fourth sequence group as an example (namely, k=4), v.sub.4,i and u.sub.5,iiϵ{1, 2, 3, 4} are obtained through step 1101, specifically:

(102) For the sub-group 1, v.sub.4,1=1/(2×11), u.sub.5,1=−1/(2×11).

(103) For the sub-group 2, right.sub.4,1=v.sub.4,1+4/11=1/(2×11)+4/11 left.sub.5,1=u.sub.5,1+5/11=−1/(2×11)+5/11; because no r.sub.5,1 or r.sub.4,1 compliant with the conditions exists, v.sub.4,2=v.sub.4,1, namely, v.sub.4,2=1/(2×11); u.sub.5,2=u.sub.5,1, namely, u.sub.5,2=−1/(2×11).

(104) For the sub-group 3, right.sub.4,2=v.sub.4,2+4/11=1/(2×11)+4/11 left.sub.5,2=u.sub.5,2+5/11=−1/(2×11)+5/11.

(105) For N.sub.2=23, when r.sub.2 varies, if r.sub.5,2=10, then r.sub.5,2/N.sub.2−left.sub.5,2>0 and |r.sub.5,2/N.sub.2−left.sub.5,1| is the minimum value; because r.sub.5,2/N.sub.2−½(N.sub.2)−right.sub.4,2>0, v.sub.4,3=v.sub.4,2, namely, v.sub.4,3=1/(2×11).

(106) For N.sub.2=23, when r.sub.2 varies, if r.sub.4,2=9, then r.sub.4,2/N.sub.2−right.sub.4,2<0 and |r.sub.4,2/N.sub.2−right.sub.4,2| is the minimum value; because r.sub.4,2/N.sub.2+1/(2N.sub.2)−left.sub.5,2>0,

(107) $\begin{matrix} u_{5, 3} = u_{5, 2} + r_{4, 2} / N_{2} + 1 / (2 N_{2}) - {left}_{5, 2} \\ = - 1 / (2 \times 11) + 9 / 23 + 1 / (2 \times 23) - (- 1 / (2 \times 11) + 5 / 11) \\ = - 21 / (2 \times 11 \times 23) . \end{matrix}$

(108) For the sub-group 4, right.sub.4,3=v.sub.4,3+4/11=1/(2×11)+4/11 left.sub.5,3=u.sub.5,3+5/11=−21/(2×11×23)+5/11.

(109) For N.sub.3=37, when r.sub.3 varies, if r.sub.5,3=16, then r.sub.5,3/N.sub.3−left.sub.5,3>0 and |r.sub.5,3/N.sub.3−left.sub.5,3| is the minimum value; because r.sub.5,3/N.sub.3−1/(2N.sub.3)−right.sub.4,3>0, v.sub.4,4=v.sub.4,3, namely, v.sub.4,4=1/(2×11).

(110) For N.sub.3=37, when r.sub.3 varies, if r.sub.4,3=15, then r.sub.4,3/N.sub.3−right.sub.4,3<0 and |r.sub.4,3/N.sub.3−right.sub.4,3| is the minimum value; because r.sub.4,3/N.sub.3+1/(2N.sub.3)−left.sub.5,3>0,

(111) $\begin{matrix} u_{5, 4} = u_{5, 3} + r_{4, 3} / N_{3} + 1 / (2 N_{3}) - {left}_{5, 3} \\ = - 21 / (2 \times 11 \times 23) + 15 / 37 + 1 / (2 \times 37) - \\ (- 21 / (2 \times 11 \times 23) + 5 / 11) \\ = - 29 / (2 \times 11 \times 37) . \end{matrix}$

(112) By analogy, u and v of all sub-groups of all sequence groups are obtained, and the following table is generated:

(113) TABLE-US-00007 TABLE 7 Sub-Group i Group Number k 1 2 3 4 1 u.sub.1,1 = −1/(2 × 11) u.sub.1,2 = −1/(2 × 11) u.sub.1,3 = −1/(2 × 11) u.sub.1,4 = −1/(2 × 11) v.sub.1,1 = 1/(2 × 11) v.sub.1,2 = 1/(2 × 11) v.sub.1,3 = 1/(2 × 11) v.sub.1,4 = 1/(2 × 11) 2 u.sub.2,1 = −1/(2 × 11) u.sub.2,2 = −1/(2 × 11) u.sub.2,3 = −15/(2 × 11 × 23) u.sub.2,4 = −15/(2 × 11 × 23) v.sub.2,1 = 1/(2 × 11) v.sub.2,2 = 1/(2 × 11) v.sub.2,3 = 1/(2 × 11 ) v.sub.2,4 = 1/(2 × 11) 3 u.sub.3,1 = −1/(2 × 11) u.sub.3,2 = −1/(2 × 11) u.sub.3,3 = −17/(2 × 11 × 23) u.sub.3,4 = −17/(2 × 11 × 23) v.sub.3,1 = 1/(2 × 11) v.sub.3,2 = 1/(2 × 11) v.sub.3,3 = 1/(2 × 11) v.sub.3,4 = 1/(2 × 11) 4 u.sub.4,1 = −1/(2 × 11) u.sub.4,2 = −1/(2 × 11) u.sub.4,3 = −19/(2 × 11 × 23) u.sub.4,4 = −19/(2 × 11 × 23) v.sub.4,1 = 1/(2 × 11) v.sub.4,2 = 1/(2 × 11) v.sub.4,3 = 1/(2 × 11) v.sub.4,4 = 1/(2 × 11) 5 u.sub.5,1 = −1/(2 × 11) u.sub.5,2 = −1/(2 × 11) u.sub.5,3 = −21/(2 × 11 × 23) u.sub.5,4 = −29/(2 × 11 × 37) v.sub.5,1 = 1/(2 × 11) v.sub.5,2 = 1/(2 × 11) v.sub.5,3 = 1/(2 × 11) v.sub.5,4 = 1/(2 × 11) 6 u.sub.6,1 = −1/(2 × 11) u.sub.6,2 = −1/(2 × 11) u.sub.6,3 = −1/(2 × 11) u.sub.6,4 = −1/(2 × 11) v.sub.6,1 = 1/(2 × 11) v.sub.6,2 = 1/(2 × 11) v.sub.6,3 = 21/(2 × 11 × 23) v.sub.6,4 = 29/(2 × 11 × 37) 7 u.sub.7,1 = −1/(2 × 11) u.sub.7,2 = −1/(2 × 11) u.sub.7,3 = −1/(2 × 11) u.sub.7,4 = −1/(2 × 11) v.sub.7,1 = 1/(2 × 11) v.sub.7,2 = 1/(2 × 11) v.sub.7,3 = 19/(2 × 11 × 23) v.sub.7,4 = 19/(2 × 11 × 23) 8 u.sub.8,1 = −1/(2 × 11) u.sub.8,2 = −1/(2 × 11) u.sub.8,3 = −1/(2 × 11) u.sub.8,4 = −1/(2 × 11) v.sub.8,1 = 1/(2 × 11) v.sub.8,2 = 1/(2 × 11) v.sub.8,3 = 17/(2 × 11 × 23) v.sub.8,4 = 17/(2 × 11 × 23) 9 u.sub.9,1 = −1/(2 × 11) u.sub.9,2 = −1/(2 × 11) u.sub.9,3 = −1/(2 × 11) u.sub.9,4 = −1/(2 × 11) v.sub.9,1 = 1/(2 × 11) v.sub.9,2 = 1/(2 × 11) v.sub.9,3 = 15/(2 × 11 × 23) v.sub.9,4 = 15/(2 × 11 × 23) 10 u.sub.10,1 = −1/(2 × 11) u.sub.10,2 = −1/(2 × 11) u.sub.10,3 = −1/(2 × 11) u.sub.10,4 = −1/(2 × 11) v.sub.10,1 = 1/(2 × 11) v.sub.10,2 = 1/(2 × 11) v.sub.10,3 = 1/(2 × 11) v.sub.10,4 = 1/(2 × 11)

(114) Step 1102: The sequences that meet u.sub.k,i≤(r.sub.i/N.sub.i−k/N.sub.1)≤v.sub.k,i are selected and included into the sub-group i of the sequence group k, where the sequence is represented by a basic sequence index. Thus the following table is generated:

(115) TABLE-US-00008 TABLE 8 N.sub.2 = 23 N.sub.3 = 37 N.sub.4 = 47 N.sub.1 = 11 Basic Basic Basic Group Sequence Sequence Sequence Number K Index r.sub.2 Index r.sub.3 Index r.sub.4 1 2, 3 2, 3, 4, 5 3, 4, 5, 6 2 4, 5 6, 7, 8 8, 9, 10 3 6, 7 9, 10, 11 12, 13, 14 4 8, 9 13, 14, 15 16, 17, 18, 19 5 10, 11 16, 17, 18 20, 21, 22, 23 6 12, 13 19, 20, 21 24, 25, 26, 27 7 14, 15 22, 23, 24 28, 29, 30, 31 8 16, 17 26, 27, 28 33, 34, 35 9 18, 19 29, 30, 31 37, 38, 39 10 20, 21 32, 33, 34, 35 41, 42, 43, 44

EXAMPLE 2

(116) If the sequence group contains more sub-groups, after u and v are calculated to a certain sub-group, u and v of the sub-groups of longer sequences do not change any more. For example, if the system bandwidth is 5 Mbps, the sequence lengths include: N.sub.1=11, N.sub.2=23, N.sub.3=37, N.sub.4=47, N.sub.5=59, N.sub.6=71, N.sub.7=97, N.sub.8=107, N.sub.9=113, N.sub.10=139, N.sub.11=179, N.sub.12=191, N.sub.13=211, N.sub.14=239, N.sub.15=283, and N.sub.16=293. Taking the fourth sequence group as an example, namely, k=4, v.sub.4,i and u.sub.5,1iϵ{1, 2, 3, . . . , 16} are obtained in the following way:

(117) For the sub-group 1, v.sub.4,1=1/(2×11), and u.sub.5,1=−1/(2×11).

(118) For the sub-group 2, right.sub.4,1=v.sub.4,1+4/11=1/(2×11)+4/11, left.sub.5,1=u.sub.5,1+5/11=−1/(2×11)+5/11; because no r.sub.5,1 or r.sub.4,1 compliant with the conditions exists, v.sub.4,2=v.sub.4,1 namely, v.sub.4,2=1/(2×11); u.sub.5,2=u.sub.5,1, namely, u.sub.5,2=−1/(2×11).

(119) For the sub-group 3, right.sub.4,2=v.sub.4,2+4/11=1/(2×11)+4/11, and left.sub.5,2=u.sub.5,2+5/11=−1/(2×11)+5/11.

(120) For N.sub.2=23, when r.sub.2 varies, if r.sub.5,2=10, then r.sub.5,2/N.sub.2−left.sub.5,2>0 and |r.sub.5,2/N.sub.2−left.sub.5,2| is the minimum value; because r.sub.5,2/N.sub.¼2−½(N.sub.2)−right.sub.4,2>0, v.sub.4,3=v.sub.4,2 namely, v.sub.4,3=1/(2×11).

(121) For N.sub.2=23, when r.sub.2 varies, if r.sub.4,2=9, then r.sub.4,2/N.sub.2−right.sub.4,2<0 and |r.sub.4,2/N.sub.2−right.sub.4,2| is the minimum value; because r.sub.4,2/N.sub.2+1/(2N.sub.2)−left.sub.5,2>0,

(122) 0 $\begin{matrix} u_{5, 3} = u_{5, 2} + r_{4, 2} / N_{2} + 1 / (2 N_{2}) - {left}_{5, 2} \\ = - 1 / (2 \times 11) + 9 / 23 + 1 / (2 \times 23) - (- 1 / (2 \times 11) + 5 / 11) \\ = - 21 / (2 \times 11 \times 23) . \end{matrix}$

(123) For the sub-group 4, right.sub.4,3=v.sub.4,3+4/11=1/(2×11)+4/11, and left.sub.5,3=u.sub.5,3+5/11=−21/(2×11×23)+5/11.

(124) For N.sub.3=37, when r.sub.3 varies, if r.sub.5,3=16, then r.sub.5,3/N.sub.3−left.sub.5,3>0 and |r.sub.5,3/N.sub.3−left.sub.5,3| is the minimum value; because r.sub.5,3/N.sub.3−1/(2N)−right.sub.4,3>0, v.sub.4,4=v.sub.4,3, namely, v.sub.4,4=1/(2×11).

(125) For N.sub.3=37, when r.sub.3 varies, if r.sub.4,3=15, then r.sub.4,3/N.sub.3−right.sub.4,3<0 and |r.sub.4,3/N.sub.3−right.sub.4,3| is the minimum value; because r.sub.4,3/N.sub.3+1/(2N.sub.3)−left.sub.5,3>0,

(126) $\begin{matrix} u_{5, 4} = u_{5, 3} + r_{4, 3} / N_{3} + 1 / (2 N_{3}) - {left}_{5, 3} \\ = - 21 / (2 \times 11 \times 23) + 15 / 37 + 1 / (2 \times 37) - \\ (- 21 / (2 \times 11 \times 23) + 5 / 11) \\ = - 29 / (2 \times 11 \times 37) \end{matrix}$

(127) For the sub-group 5, v.sub.4,5=v.sub.4,4, namely, v.sub.4,5=1/(2×11); u.sub.5,5=u.sub.5,4, namely, u.sub.5,5=−29/(2×11×37).

(128) For the sub-group 6, v.sub.4,6=v.sub.4,5, namely, v.sub.4,6=1/(2×11); u.sub.5,6=u.sub.5,5, namely, u.sub.5,6=−29/(2×11×37).

(129) For the sub-group 7, v.sub.4,7=v.sub.4,6, namely, v.sub.4,7=1/(2×11); u.sub.5, 7=u.sub.5,6, namely, u.sub.5,7=−29/(2×11×37).

(130) Further calculation reveals that: for sub-groups 8, 9, 10, . . . , 16, the values of u and v do not change any more.

(131) By analogy, u and v of all sub-groups of other sequence groups may be obtained. Calculation reveals that: for any sub-group i of the sequence group 5, v.sub.5,i=1/(2×11). Based on the foregoing calculation, the sequences that meet u.sub.5,i≤(r.sub.i/N.sub.i−5/N.sub.1)≤v.sub.5,i are selected and included into the sub-group i of the sequence group 5, where the sequence is represented by a basic sequence index. Thus the following table is generated:

(132) TABLE-US-00009 TABLE 9 N.sub.1 = 11 group number k 5 N.sub.2 = 23 basic sequence index r.sub.2 10, 11 N.sub.3 = 37 basic sequence index r.sub.3 16, 17, 18 N.sub.4 = 47 basic sequence index r.sub.4 20, 21, 22, 23 N.sub.5 = 59 basic sequence index r.sub.5 25, 26, 27, 28, 29 N.sub.6 = 71 basic sequence index r.sub.6 30, 31, 32, 33, 34, 35 N.sub.7 = 97 basic sequence index r.sub.7 41, 42, 43, 44, 45, 46, 47, 48 N.sub.8 = 107 basic sequence index r.sub.8 45, 46, 47, 48, 49, 50, 51, 52, 53 N.sub.9 = 113 basic sequence index r.sub.9 48, 49, 50, 51, 52, 53, 54, 55, 56 N.sub.10 = 139 basic sequence index r.sub.10 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69 N.sub.11 = 179 basic sequence index r.sub.11 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89 N.sub.12 = 191 basic sequence index r.sub.12 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95 N.sub.13 = 211 basic sequence index r.sub.13 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105 N.sub.14 = 239 basic sequence index r.sub.14 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119 N.sub.15 = 283 basic sequence index r.sub.15 119, 120, 121, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141 N.sub.16 = 293 basic sequence index r.sub.16 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146

(133) The foregoing calculation of u.sub.k,i, v.sub.k,i reveals that: the same u.sub.k,i,v.sub.k,i may be determined when calculated to N.sub.4=47 (namely, S={2,3,4}) and N.sub.16=293 (namely, S=I={2,3, . . . , 16}). Therefore, the calculation may continue only to the fourth sub-group, namely, S={2,3,4} to ¼obtain u and v of all sub-groups of all sequence groups and reduce the calculation load.

(134) In practice, u and v in use may be quantized according to the foregoing calculation results to achieve the required precision.

(135) In the foregoing embodiment, selection of the n sequences comes in two circumstances:

(136) Preferably, n is 1, namely, in the foregoing example, a sequence that makes (r.sub.m/N.sub.m−k/N.sub.1) the smallest is selected and included into the sub-group m.

(137) Preferably, n is a natural number greater than 1, and the value of n depends on the length difference between sub-group N.sub.m and reference sub-group N.sub.1. The sequences corresponding to several basic sequence indexes near r.sub.m that makes (r.sub.m/N.sub.m−k/N.sub.1) the smallest are included into a sub-group. Generally, such sequences are n sequences closest to the minimum r.sub.m, where n depends on the length difference between N.sub.1,N.sub.m. For example, if N.sub.m is about 4×N.sub.1, two r.sub.m's may be included into the group. Generally, n=┌N.sub.m/(2N.sub.1)┐ may be selected. In another example, n=└N.sub.m/N.sub.1┘ may be selected, where └z┘ is the maximum integer not greater than z. In the sequence sub-group in this case, there may be more than one sequence of a certain length. After such allocation in the system, when using the sequence, the user may select any of the allocated n sequences for transmitting, for example, select the sequence that makes (r.sub.m/N.sub.m−k/N.sub.1) the smallest, second smallest, and so on.

(138) In the foregoing embodiment, n sequences are selected, where n is preferably determined by the sequence group k and sub-group i. For example, n≤Q, where Q is the quantity of sequences that meet u.sub.k,i≤(r.sub.i/N.sub.i−c.sub.k/N.sub.p.sub.i)≤v.sub.k,i, N.sub.p.sub.1 is the length of the reference sub-group sequence, and c.sub.k is the basic sequence index of the sequence with a length of N.sub.p.sub.1 determined by the sequence group k. u.sub.k,i=−1/(2N.sub.1) v.sub.k,i=1/(2N.sub.1), or u.sub.k,i=−1/(2N.sub.1)+1/(4N.sub.2) v.sub.k,i=1/(2N.sub.1)−1/(4N.sub.2), u.sub.k,i=−½.sup.θ, ¼v.sub.k,i=½.sup.θ, and so on, where θ is an integer. If u.sub.k,i and v.sub.k,i are relatively small, for example, u.sub.k,i=−1/(2N.sub.1)+1/(4N.sub.2) and v.sub.k,i=1/(2N.sub.1)−1/(4N.sub.2), the correlation between any two sequences of different sequence groups is ensured to be low.

(139) In the foregoing embodiments, the sequence groups may be generated for the sequences corresponding to partial instead of all modes of occupying time frequency resources in the system. For example, the modes of occupying time frequency resources may be divided into multiple levels according to the length of the sequence. Each level includes sequences in a certain length range. For the sequences at each level, the sequence groups are generated and allocated, as described above.

(140) Specifically, the sequence groups may be allocated dynamically, namely, the sequence in use varies with time or other variables; or the sequence groups are allocated statically, namely, the sequence in use is constant. More specifically, the static allocation mode may be used alone, or the dynamic allocation mode is used alone, or both the dynamic allocation mode and the static allocation mode are used, as detailed below:

(141) Preferably, if few radio resources are occupied by the sequence, the sequence groups are allocated dynamically. That is because the sequent length is small in this circumstance, and there are fewer sequence groups. For example, as regards the method of “hopping” a sequence group: in the foregoing embodiment taking the Zadoff-Chu sequence as an example, a serial number (r.sub.1) of a reference sequence group is selected randomly in the pseudo random mode at the time of transmitting the pilot frequency, and then the sequence with the index r.sub.k in the sub-group of the same sequence group is calculated out according to the foregoing selection mode.

(142) Preferably, if many radio resources are occupied by the sequence, the sequence groups are allocated statically. For example, in the foregoing embodiment taking the Zadoff-Chu sequence as an example, if the quantity (N) of sequence groups meets the need, the N sequence groups are allocated to each cell, which meets the requirements of averaged interference between cells without changing with time. Preferably, the radio resources occupied in the system may be divided into two levels. One level is about the sequences that occupy many radio resources, where different sequence groups are allocated statically; the other level is about the sequences that occupy few radio resources, where the sequence groups allocated in the dynamic pseudo random mode. For example, if a sequence occupies more than 144 sub-carriers, the sequence length is generally greater than or equal to 144, and different sequence groups are allocated statically; if the sequences in each sequence group correspond to radio resources of less than 144 sub-carriers, the sequence length is generally less than 144, and the sequence groups are allocated in the dynamic pseudo random mode.

(143) If a sub-group contains multiple sequences, including basic sequences and the sequences of different time cyclic shifts, the sequences may be allocated not only to different users, but also to different cells, for example, different sectors under a base station. Particularly, if a cell needs more sequences, for example, if multi-antenna transmitting is supported, each antenna needs to have a different sequence. In this case, the minimum length of the sequence in use may be limited to increase the quantity of basic sequences in the sub-group. Therefore, more basic sequences in the sub-group or more cyclic shifts of the basic sequences may be allocated to the cell. Further, if the sub-group in the sequence group has multiple sequences, the sequence groups may be further grouped and allocated to different cells, users or channels.

(144) The aforementioned sequences are not limited to Zadoff-Chu sequences, and may be Gauss sequences, other CAZAC sequences, basic sequences, and/or deferred sequences of CAZAC sequences.

(145) Embodiment 2

(146) Corresponding to the aforementioned method for allocating sequence groups to cells in a specific selection mode in a network, a method for processing communication sequences is described. As shown in FIG. 4, the process of the method includes:

(147) Step 201: The group number k of the sequence group allocated by the system is obtained.

(148) Step 202: N (n is a natural number) sequences are selected from the candidate sequence collection to form sequences in the sub-group i (i is a serial number of the sub-group) in the sequence group k, where the n sequences make the d(ƒ.sub.i(.Math.),G.sub.k) function value the smallest, second smallest, and third smallest respectively, d(a,b) is a two variables function, G.sub.k is a variable determined by the group number k, ƒ.sub.i(.Math.) is a function corresponding to the sub-group i determined by the system, and the domain of the function is the candidate sequence collection corresponding to the sub-group i.

(149) Step 203: The corresponding transmitting sequences are generated according to the formed sub-group i, and the sequences on the corresponding time frequency resources are processed.

(150) Processing of communication sequences includes transmitting and receiving of communication sequences. Receiving of communication sequences includes calculation related to the generated sequences and received signals. Generally, the specific receiving operations include the calculation for obtaining channel estimation or time synchronization.

(151) The aforementioned sequences are not limited to Zadoff-Chu sequences, and may be Gauss sequences, other CAZAC sequences, basic sequences, and/or shifted sequences of CAZAC sequences. The processing of sequences may be frequency domain processing or time domain processing. The functions in the foregoing method may be consistent with the functions in the foregoing allocation method, and are not repeated further.

(152) Taking the Zadoff-Chu sequence as an example, if the function d(a,b) is d(a,b)=|(a−b)|, for the sub-group m, the sequence that makes the |r.sub.m/N.sub.m−k/N.sub.1| value the smallest is selected and included into the sequence group k, thus ensuring higher correlation between sequences and reducing correlation between groups.

(153) In practice, working out the r.sub.m indexes that make |r.sub.m/N.sub.m−k/N.sub.1| the smallest, second smallest, . . . , may induce a general method. That is, with an known integer N.sub.1,N.sub.2,e, the integer ƒ needs to make the |e/N.sub.1−ƒ/N.sub.2| value the smallest. Evidently, ƒ is the integer w closest to e.Math.N.sub.2/N.sub.1, namely, the └e.Math.N.sub.2/N.sub.1┘ value rounded down or the ┌e.Math.N.sub.2/N.sub.1┐ value rounded up. The fewer n sequences are w±1,w±2, . . . .

(154) The transmitter and the receiver may obtain the data through calculation in this way rather than store the data.

(155) Still taking the Zadoff-Chu sequence as an example, if the function d(a,b) is |(a−b) modu m.sub.k,i|, the sub-group numbered p.sub.1 serves as a reference sub-group, N.sub.p.sub.1 is the length of the reference sub-group sequence, c.sub.k is the basic sequence index of the sequence with a length of N.sub.p.sub.1 determined by the sequence group k, N.sub.i is the length of the sequence of the sub-group i, and r.sub.i is the basic sequence index of the sequence with a length of N.sub.i determined by the sequence group k, then, |(a−b)modu m.sub.k,i|=|=|(r.sub.i/N.sub.i−c.sub.k/N.sub.p.sub.1)modu m.sub.k,i|. Particularly, N.sub.p.sub.1=N.sub.1 and c.sub.k=k may be selected. For the sub-group i=q in the sequence group k, the sequence that makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest is selected and included into the sequence group k. Therefore, the selected sequence is the most correlated with the sequence of the reference length in the same sequence group, the correlation of the sequences between different groups is further reduced, and the inter-group interference is weaker.

(156) In practice, working out the index r.sub.q that makes |(r.sub.q/N.sub.q−k/N.sub.1) modu m.sub.k,q| the smallest may induce a general method, namely, r.sub.q=B.sup.−1×round(B×k×N.sub.q/N.sub.1), where B=1/m.sub.k,q, B.sup.−1 is a natural number that meets B×B.sup.−1 mod N.sub.q=1, and round(z) is an integer closest to z.

(157) A detailed description is given below through examples. With a known integer N.sub.1,N.sub.2,e, if m.sub.k,q=1, then the integer ƒ needs to make the |(e/N.sub.1−ƒ/N.sub.2 modu 1| value the smallest. Evidently, ƒ is the integer w closest to e.Math.N.sub.2/N.sub.1, namely, the └e.Math.N.sub.2/N.sub.1┘ value rounded down or the ┌e.Math.N.sub.2/N.sub.1┐ value rounded up. If m.sub.k,q=½, then the integer ƒ needs to make the |(e/N.sub.1−ƒ/N.sub.2) modu ½| value the smallest. ƒ is

(158) $w .Math. \frac{1 + N_{2}}{2} modulo N_{2},$
namely,

(159) $w .Math. \frac{1 + N_{2}}{2} \mod N_{2},$
where w is an integer closest to 2e.Math.N.sub.2/N.sub.1, namely, the └2e.Math.N.sub.2/N.sub.1┘ value rounded down or the └2e.Math.N.sub.2/N.sub.1┘ value rounded up. If m.sub.k,q=⅓, then the integer ƒ needs to make the |(e/N.sub.1−ƒ/N.sub.2)modu ⅓| value the smallest.¼When N.sub.2 mod 3=0 ƒ is

(160) $\frac{w}{3};$
when N.sub.2 mod 3=1 ƒ is

(161) $w .Math. \frac{1 - N_{2}}{3} \mod N_{2};$
when N.sub.2 mod 3=2 ƒ is

(162) $w .Math. \frac{1 + N_{2}}{3} {\mod N}_{2},$
mod N.sub.2, where w is an integer closest to 3e.Math.N.sub.2/N.sub.1, namely, the └3e.Math.N.sub.2/N.sub.1┘ value rounded down or the └3e.Math.N.sub.2/N.sub.1┘ value rounded up. If m.sub.k,q=¼, then the integer ƒ needs to make the |(e/N.sub.1−ƒ/N.sub.2) modu ¼| value the smallest. When N.sub.2 mod 2=0, ƒ is

(163) $\frac{w}{4};$
when N.sub.2 mod 4=1, ƒ is

(164) $w .Math. \frac{1 - N_{2}}{4} \mod N_{2};$
when N.sub.2 mod 4=3, ƒ is

(165) $w .Math. \frac{1 + N_{2}}{4} \mod N_{2},$
where w is an integer closest to 4e.Math.N.sub.2/N.sub.1, namely, the └4e.Math.N.sub.2/N.sub.1┘ value rounded down or the ┌4e.Math.N.sub.2/N.sub.1┐ value rounded up.

(166) To sum up, through m.sub.k,q storage and simple calculation, the sequences in the sub-group q in the sequence group k are obtained. According to the inherent features of m.sub.k,q the m.sub.k,q storage may be simplified, as detailed below:

(167) m.sub.k,q of the sub-group q is symmetric between different sequence groups k, namely, m.sub.k,q=m.sub.T−k,q, where T is the total number of sequence groups. Therefore, if m.sub.k,q in the case of 1≤k≤T/2 is pre-stored, m.sub.k,q in the case of 1≤k≤T can be obtained; or, if m.sub.k,q in the case of T/2<k≤T is pre-stored, m.sub.k,q in the case of 1≤k≤T can also be obtained.

(168) If N.sub.q≥L.sub.r, it is appropriate that m.sub.k,q=1, where N.sub.q is the sequence length of the sub-group q, and L.sub.r is determined by the reference sub-group sequence length N.sub.p.sub.1. Specifically, for N.sub.p.sub.1=N.sub.1=31, L.sub.r=139. If N.sub.q=139 or above, then m.sub.k,q=1. After cyclic extension of the sequence, L.sub.r=191. Therefore, when N.sub.q=191 or above, m.sub.k,q=1.

(169) The specific values of m.sub.k,q corresponding to the sub-group q in the sequence group k may be stored. Specifically, x bits may be used to represent W different values of m.sub.k,q, where 2.sup.x−1<W≤2.sup.x; for each m.sub.k,q, the x bits that represent the specific values of m.sub.k,q are stored. Alternatively, the value selection mode of m.sub.k,q may also be stored. For example, when N.sub.q≥L.sub.r, m.sub.k,q=1.

(170) In the foregoing embodiment, after the resource occupied by the sequence is determined, the sequence of the sub-group corresponding to the resource of the current group may be generated in real time according to the selection mode, without the need of storing. The implementation is simple.

(171) It is understandable to those skilled in the art that all or part of the steps in the foregoing embodiments may be implemented by hardware instructed by a program. The program may be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk and compact disk, and the steps covered in executing the program are consistent with the foregoing steps 201-203.

(172) Embodiment 3

(173) As shown in FIG. 5, an apparatus for processing communication sequences by using the foregoing communication sequence processing method includes: a sequence selecting unit, adapted to: obtain a group number k of a sequence group allocated by the system, and select n (n is a natural number) sequences from a candidate sequence collection to form sequences in a sub-group i (i is a serial number of the sub-group) in the sequence group k (k is the serial number of the sequence group), where the n sequences make the d(ƒ.sub.i(.Math.),G.sub.k) function value the smallest, second smallest, and third smallest respectively, d(a,b) is a two variables function, G.sub.k is a variable determined by the group number k, ƒ.sub.i(.Math.) is a function corresponding to the sub-group i determined by the system, and the domain of the function is the candidate sequence collection corresponding to the sub-group i; and a sequence processing unit, adapted to: select or generate the corresponding sequences according to the sequences in the formed sub-group i, and process the sequences on the time frequency resources corresponding to the sub-group i.

(174) Specifically, as shown in FIG. 6, the sequence processing unit is a sequence transmitting unit adapted to generate the corresponding sequences according to the formed sequences and transmit the sequences on the corresponding time frequency resources. In this case, the communication sequence processing apparatus is a communication sequence transmitting apparatus.

(175) Specifically, as shown in FIG. 7, the sequence processing unit may be a sequence receiving unit adapted to generate the corresponding sequences according to the formed sequences and receive the sequences on the corresponding time frequency resources. In this case, the communication sequence processing apparatus is a communication sequence receiving apparatus. The receiving processing generally includes calculation related to the generated sequences and received signals. Generally, the specific receiving operations include the calculation for obtaining channel estimation or time synchronization.

(176) The relevant functions and specific processing in the communication sequence processing apparatus are consistent with those in the forgoing allocation method and processing method, and are not repeated further. The aforementioned sequences are not limited to Zadoff-Chu sequences, and may be Gauss sequences, other CAZAC sequences, basic sequences, and/or deferred sequences of CAZAC sequences. The processing of sequences may be frequency domain processing or time domain processing.

(177) In the foregoing communication sequence processing apparatus, the sequence selecting unit selects a sequence compliant with the interference requirement directly in a specific selection mode, without the need of storing the lists about the correspondence of sequences, thus saving communication resources as against the conventional art.

(178) Although exemplary embodiments have been described through the application and accompanying drawings, the claims are not limited to such embodiments. It is apparent that those skilled in the art can make various modifications and variations to the embodiments without departing from the spirit and scope of the claims.

Method and apparatus for allocating and processing sequences in communication system

Assignee

Inventors

Cpc classification

Classification Explorer

H04L5/0073

ELECTRICITY

Classification Explorer

H04L27/261

ELECTRICITY

Classification Explorer

H04L23/02

ELECTRICITY

Classification Explorer

H04L25/0226

ELECTRICITY

Classification Explorer

H04J13/22

ELECTRICITY

Classification Explorer

H04W72/04

ELECTRICITY

Classification Explorer

H04L5/0062

ELECTRICITY

Classification Explorer

H04B7/022

ELECTRICITY

Classification Explorer

H04L5/0041

ELECTRICITY

Classification Explorer

H04J13/0062

ELECTRICITY

Classification Explorer

H04L5/0053

ELECTRICITY

Classification Explorer

H04J13/0059

ELECTRICITY

Classification Explorer

H04L5/0078

ELECTRICITY

Classification Explorer

H04L5/0048

ELECTRICITY

International classification

Classification Explorer

H04J13/00

ELECTRICITY

Classification Explorer

H04J13/22

ELECTRICITY

Classification Explorer

H04B7/022

ELECTRICITY

Classification Explorer

H04L5/00

ELECTRICITY

Classification Explorer

H04L23/02

ELECTRICITY

Classification Explorer

H04W72/04

ELECTRICITY

Classification Explorer

H04L27/26

ELECTRICITY

Abstract

Claims

Description