METHOD AND APPARATUS FOR ALLOCATING AND PROCESSING SEQUENCES IN COMMUNICATION SYSTEM

• US 20090303960A1
• Filed: 06/29/2009
• Published: 12/10/2009
• Est. Priority Date: 03/07/2007
• Status: Active Grant

• Current Assignee: Huawei Technologies Co., Ltd. (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: Huawei Technologies Co., Ltd. (Huawei Investment & Holding Co., Ltd.)
• Inventors: Feng, Xuan, He, Yujuan, Qu, Bingyu
• Granted Patent: US 8,249,006 B2
• Time in Patent Office: Days
• US Class Current: 370/330
• CPC Class Codes: H04B 7/022 Site diversity; Macro-diversity using two or more spaced independent antennas H04B7/04
• CPC Class Codes: H04J 13/0059 CAZAC [constant-amplitude and zero auto-correlation]
• CPC Class Codes: H04J 13/0062 Zadoff-Chu
• CPC Class Codes: H04J 13/22 Allocation of codes with a zero correlation zone
• CPC Class Codes: H04L 23/02 adapted for orthogonal signalling
• CPC Class Codes: H04L 25/0226 sounding signals per se
• CPC Class Codes: H04L 27/261 Details of reference signals
• CPC Class Codes: H04L 5/0041 Frequency-non-contiguous
• CPC Class Codes: H04L 5/0048 Allocation of pilot signals, i.e. of signals known to the receiver
• CPC Class Codes: H04L 5/0053 Allocation of signaling, i.e. of overhead other than pilot signals
• CPC Class Codes: H04L 5/0062 Avoidance of ingress interference, e.g. ham radio channels
• CPC Class Codes: H04L 5/0073 Allocation arrangements that take into account other cell interferences for intercell interference mitigation or co-ordination in orthogonal multiplex systems H04J11/005
• CPC Class Codes: H04L 5/0078 Timing of allocation
• CPC Class Codes: H04W 72/04 Wireless resource allocation

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_i/N_i−c_k/N_p1| or |(r_i/N_i−c_k/N_p1) modu m_k,i| function value the smallest, second smallest, till the n^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 for allocating sequences in a communication system, comprising:

dividing sequences in a sequence group into multiple sub-groups, each sub-group corresponding to a 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, wherein n is a natural number, the n sequences making a |r_i/N_i−

c_k/N_p1| or |(r_i/N_i−

c_k/N_p1) modu m_k,i| function value a smallest, a second smallest, until an n^th smallest respectively,

wherein i is a serial number of the sub-group, k is a serial number of the sequence group, N_p1 is the length of a reference sub-group sequence, c_k is a basic sequence index of a sequence with a length of N_p1 determined by the sequence group k;

wherein r_i is a basic sequence index in the candidate sequence collection, and N_i is the length of a sequence in the candidate sequence collection;

wherein m_k,i is a variable dependent on the group number k and the sub-group number i; and

allocating the sequence group to at least one of;

cells, users or channels.

2. The method of claim 1, wherein:

the sequences correspond to at least one of;

Zadoff-Chu sequences or Gauss sequences.

3. The method of claim 2, wherein n=└

N_i/N_p1┘

, └

z┘

represents a maximum integer not greater than z.

4. The method of claim 1, further comprising:

making r_i an integer value of c_k·

N_i/N_p1 rounded up or down, which makes the function |r_i/N_i−

c_k/N_p1| the smallest value.

5. A method for processing sequences in a communication system, comprising:

obtaining a group number k of a sequence group allocated by the system;

selecting n sequences from a candidate sequence collection to form sequences in a sub-group i in a sequence group k;

the n sequences making a |r_i/N_i−

c_k/N_p1| or |(r_i/N_i−

c_k/N_p1) modu m_k,i| function value a smallest, a second smallest, until an n^th smallest respectively;

wherein n is a natural number, i is a serial number of the sub-group;

wherein N_p1 is the length of a reference sub-group sequence, c_k is a basic sequence index of a sequence with a length of N_p1 determined by the sequence group k;

wherein r_i is a basic sequence index in the candidate sequence collection, and N_i is the length of a sequence in the candidate sequence collection;

wherein m_k,i is a variable dependent on the group number k and the sub-group number i;

generating corresponding sequences according to the sequences in the formed sub-group; and

communicating the sequences on time frequency resources corresponding to the sub-group i.

6. The method of claim 5, wherein:

the sequences correspond to at least one of;

Zadoff-Chu sequences or Gauss sequences.

7. The method of claim 6, wherein n=└

N_i/N_p1┘

, └

z┘

represents a maximum integer not greater than z.

8. The method of claim 5, wherein m_k,i=1/B, and wherein B is a natural number.

9. The method of claim 8, further comprising:

pre-storing m_k,i (1≦

k≦

T/2) corresponding to k and i.

10. The method of claim 8, further comprising:

pre-storing m_k,i (T/2<

k≦

T) corresponding to k and i, wherein T is the total quantity of sequence groups.

11. The method of claim 8, wherein:

if N_i≧

L_r, then m_k,i=1 wherein N_i is the length of a sequence in the candidate sequence collection corresponding to the sub-group i, and L_r is determined by a reference sub-group sequence length N_p1.

12. The method of claim 8, wherein the basic sequence index r_i=B⁻

1×

round(B×

c_k×

N_i/N_p1) makes a function d(a,b) value the smallest, where B<sup>−

1</sup> is a natural number that meets B×

B<sup>−

1</sup> mod N_i=1 and round(z) represents an integer closest to z.

13. The method of claim 5, wherein the function |r_i/N_i−

c_k/N_p1| or |(r_i/N_i−

c_k/N_p1) modu m_k,i| varies between at least one of;

different sequence groups, or different sub-groups of one sequence group.

14. The method of claim 5, further comprising:

making r_i an integer value of k·

N_i/N₁ rounded up or down, which makes the function |r_i/N_i−

c_k/N_p1| the smallest value.

15. A sequence processing apparatus, comprising:

a sequence selecting unit configured to;

obtain a group number k of a sequence group allocated by a system, and select n sequences from a candidate sequence collection to form sequences in a sub-group i in the sequence group k, wherein the n sequences make a |r_i/N_i−

c_k/N_p1| or |(r_i/N_i−

c_k/N_p1) modu m_k,i| function value a smallest, a second smallest, until an n^th smallest respectively, wherein i is a serial number of the sub-group, k is a serial number of the sequence group, N_p1 is the length of a reference sub-group sequence, c_k is a basic sequence index of a sequence with a length of N_p1 determined by the sequence group k;

wherein r_i is a basic sequence index in the candidate sequence collection, and N_i is the length of a sequence in the candidate sequence collection;

wherein m_k,i is a variable dependent on the group number k and the sub-group number i; and

a sequence processing unit configured to;

generate corresponding sequences according to the sequences in the formed sub-group i, and process the sequences on time frequency resources corresponding to the sub-group i.

16. The sequence processing apparatus of claim 15, wherein:

the sequence processing unit is a sequence communicating unit configured to generate the corresponding sequences according to the formed sequences and communicate the sequences on the corresponding time frequency resources.