Method and apparatus for allocating and processing sequences in communication system

• US 8,644,239 B2
• Filed: 12/19/2011
• Issued: 02/04/2014
• 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: HE, Yujuan, FENG, Xuan, Qu, Bingyu
• Primary Examiner(s): Wong, Warner
• Application Number:
  US13/330,252
• Publication Number:
  US 20120087326A1
• Time in Patent Office: 778 Days
• Field of Search: 370/203, 370/204, 370/329, 370/330, 370/343, 370/344, 375/259, 375/260, 375/267, 375/285, 375/295, 375/296, 375/364, 375/365, 375/366, 375/368
• US Class Current: 370/329
• 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, by a communication system, sequences in a sequence group into multiple sub-groups, each sub-group corresponding to a mode of occupying time frequency resources;

selecting, by the communication system, a sequence from a candidate sequence collection corresponding to each sub-group to form the sequences in the sub-group by;

selecting, by the communication system, n sequences in the candidate sequence collection to form sequences in a sub-group i in a sequence group k, wherein n is a natural number, i is a serial number of the sub-group, k is a serial number of the sequence group,

determining by the communication system, a value of a basic sequence index r_i in the sub-group i in the sequence group k, the value of r_i;

is at least one of └

k·

N_i/N₁┘

, ┌

k·

N_i/N₁┐

, └

k·

N_i/N₁┘

+1 and ┌

k·

N_i/N₁┐

−

1, wherein N_i is a length of a sequence in the candidate sequence collection, N₁ is a length of a reference sub-group sequence;

allocating, by the communication system, the sequence group to at least one of;

a base station, a cell, a user equipment and a channel.

2. The method of claim 1, wherein:

the sequences correspond to at least one of Zadoff-Chu sequences and Gauss sequences.

3. The method of claim 1, wherein n is a value selected from the group of values consisting of:

one, a natural number dependent on k and i, and a value dependent on N_i and N₁.

4. The method of claim 1, wherein the reference sub-group sequence N₁ is a maximum sequence length in the sequence group or a shortest sequence length in the sequence group.

5. The method of claim 4, wherein if the N₁ is the maximum sequence length in the sequence group, the value of N₁ is 37, if the N₁ is the shortest sequence length in the sequence group, the value of N₁ is 11.

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

obtaining, by a cell or a base station or a user equipment, a group number k of a sequence group allocated by the system;

selecting, by the cell or the base station or the user equipment, n sequences from a candidate sequence collection to form sequences in a sub-group i in a sequence group k;

wherein n is a natural number, i is a serial number of the sub-group, k is a serial number of the sequence group, a value of a basic sequence index r_i in the sub-group i in the sequence group k is at least one of └

k·

N_i/N₁┘

, ┌

k·

N_i/N₁┐

, └

k·

N_i/N₁┘

+1 or ┌

k·

N_i/N₁┐

−

1, wherein N_i is a length of a sequence in the candidate sequence collection, N₁ is a length of a reference sub-group sequence;

generating, by the cell or the base station or the user equipment, corresponding sequences according to the sequences in the formed sub-group; and

communicating, by the cell or the base station or the user equipment, according to the sequences on time frequency resources corresponding to the sub-group i.

7. The method of claim 6, wherein the sequences correspond to at least one of:

Zadoff-Chu sequences and Gauss sequences.

8. The method of claim 6, wherein n is a value from the group of values consisting of:

one;

a natural number dependent on k and i, and a value dependent on N_i and N₁.

9. The method of claim 6, wherein the reference sub-group sequence N₁ is a maximum sequence length in the sequence group or a shortest sequence length in the sequence group.

10. The method of claim 9, wherein if the N₁ is the maximum sequence length in the sequence group, the value of N₁ is 37, if the N₁ is the shortest sequence length in the sequence group, the value of N₁ is 11.

11. The method of claim 6, wherein communicating, by the cell or the base station or the user equipment, on time frequency resources corresponding to the sub-group i comprises:

sending, by the cell or the base station or the user equipment, the sequences on time frequency resources corresponding to the sub-group i; and

receiving, by the cell or the base station or the user equipment, the sequences on time frequency resources corresponding to the sub-group i.

12. A communication system for allocating sequences, comprising:

a processor configured to divide sequences in a sequence group into multiple sub-groups, wherein each sub-group corresponding to a mode of occupying time frequency resources, select n sequences in a candidate sequence collection to form sequences in a sub-group i in a sequence group k, wherein n is a natural number, i is a serial number of the sub-group, k is a serial number of the sequence group, determine a value of a basic sequence index r_i in the sub-group i in the sequence group k, the value of r_i is at least one of └

k·

N_i/N₁┘

, ┌

k·

N_i/N₁┐

, └

k·

N_i/N₁┘

+1 or ┌

k·

N_i/N₁┐

−

1, wherein N_i is a length of a sequence in the candidate sequence collection, N₁ is a length of a reference sub-group sequence; and

the processor is further configured to allocate the sequence group to at least one of;

a base station, a cell, a user equipment and a channel.

13. The system of claim 12, wherein the sequences correspond to at least one of:

Zadoff-Chu sequences and Gauss sequences.

14. The system of claim 12, wherein n is a value selected from the values consisting of:

one, a natural number dependent on k and i, and a value dependent on N_i and N₁.

15. The system of claim 12, the reference sub-group sequence N₁ is a maximum sequence length in the sequence group or a shortest sequence length in the sequence group.

16. The system of claim 15, wherein if the N₁ is the maximum sequence length in the sequence group, the value of N₁ is 37, if the N₁ is the shortest sequence length in the sequence group, the value of N₁ is 11.

17. 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 n is a natural number, i is a serial number of the sub-group, k is a serial number of the sequence group, a value of a basic sequence index r_i in the sub-group i in the sequence group k is at least one of └

k·

N_i/N₁┘

, ┌

k·

N_i/N₁┐

, └

k·

N_i/N₁┘

+1 or ┌

k·

N_i/N₁┐

−

1, wherein N_i is a length of a sequence in the candidate sequence collection, N₁ is a length of a reference sub-group sequence; and

a sequence processing unit is configured to generate corresponding sequences according to the sequences in the formed sub-group i, and process according to the sequences on time frequency resources corresponding to the sub-group i.

18. The sequence processing apparatus of claim 17, wherein the sequences correspond to at least one of:

Zadoff-Chu sequences and Gauss sequences.

19. The sequence processing apparatus of claim 17, wherein n is a value selected from the group of values consisting of one, a natural number dependent on k and i, and a value dependent on N_i and N₁.

20. The sequence processing apparatus of claim 17, wherein the reference sub-group sequence N₁ is a maximum sequence length in the sequence group or a shortest sequence length in the sequence group.

21. The sequence processing apparatus of claim 20, wherein if the N₁ is the maximum sequence length in the sequence group, the value of N₁ is 37, if the N₁ is the shortest sequence length in the sequence group, the value of N₁ is 11.

22. The sequence processing apparatus of claim 17, wherein the sequence processing unit is a sequence transmitting unit configured to generate the corresponding sequences according to the formed sequences and transmit according to the sequences on the corresponding time frequency resources.

23. The sequence processing apparatus of claim 17, wherein:

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