RESOURCE REMAPPING AND REGROUPING IN A WIRELESS COMMUNICATION SYSTEM

• US 20090092148A1
• Filed: 08/28/2008
• Published: 04/09/2009
• Est. Priority Date: 09/19/2007
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: PI, ZHOUYUE, CHO, JOONYOUNG, ZHANG, JIANZHONG, LEE, JUHO, KHAN, FAROOQ, PAPASAKELLARIOU, ARIS
• Granted Patent: US 8,077,693 B2
• Time in Patent Office: Days
• US Class Current: 370/458
• CPC Class Codes: H04L 1/0026 Transmission of channel quality indication
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 1/1607 Details of the supervisory signal
• CPC Class Codes: H04L 5/0007 the frequencies being orthogonal, e.g. OFDM(A), DMT
• CPC Class Codes: H04L 5/0014 Three-dimensional division time-code-space division H04B7/0413, H04B7/0697
• CPC Class Codes: H04L 5/0037 Inter-user or inter-terminal allocation
• CPC Class Codes: H04L 5/0048 Allocation of pilot signals, i.e. of signals known to the receiver
• CPC Class Codes: H04L 5/0055 Physical resource allocation for ACK/NACK for physical mapping arrangements in ARQ protocols H04L1/1861
• CPC Class Codes: H04L 5/0057 Physical resource allocation for CQI

Abstract

Methods and apparatus for remapping and regrouping transmission resources in a wireless communication system. First, a set of new permutation algorithms based on Galois field operation is proposed. Then the proposed algorithms and the known Pruned Bit Reversal Ordering (PBRO) algorithm are applied to several of various resource mapping schemes, including slot or symbol level Orthogonal Cover (OC)/Cyclic Shift (CS) mapping, cell-specific slot-level and symbol-level CS hopping patterns, and subframe and slot level base sequence hopping patterns.

Claims

1. A method for communication in a communication network, the method comprising the steps of:

establishing a mapping scheme between N resource combinations in a first time slot and N resource combinations in a second time slot in dependence upon a certain parameter n, with the mapping scheme established by;

j=g(i,n),

where i denotes the index of a resource combination in the first time slot and i=1, 2, . . . , N, j denotes the index of a resource combination in the second time slot and j=1, 2, . . . , N, and g(a,b) is a pseudo-random function;

selecting a first resource combination from among the N resource combinations in the first time slot;

selecting a second resource combination from among the N resource combinations in the second time slot in accordance with the mapping scheme; and

transmitting information using the first resource combination in the first time slot during the first time slot and the second resource combination during the second time slot.

2. The method of claim 1, comprised of:

the pseudo-random function being a Galois Field based permutation function established by;

j=g(i,n)=P_G(i,n,N),

when the input and output resource indices i and j starts from 1, such that i=1, 2, . . . N and j=1 . . . , N, and n is selected from a set of integers {1, 2, . . . , N}; and

the pseudo-random function being a Galois Field based permutation function established by;

j′

=g(i′

,n)=P_G(i′

+1,n,N)−

1,

when the input and output resource indices starts from 0, such that i′

=0, . . . , N−

1 and j′

=0, . . . , N−

1, and n is selected from a set of integers {1, 2, . . . , N}.

3. The method of claim 2, comprised of, when N satisfies N=p^m−

1 for a prime number p and a positive integer m;

determining a primitive element α

for a Galois field N+1;

determining an integer k such that i=α

^k and 0≦

k≦

N−

1; and

determining the number j in accordance with one of the pseudo-random permutation functions established by;

j=P_G,1(i,n,N)=α

<sup>mod(k+n−

1,N)</sup>, and

j=P_G,2(i,n,N)=α

<sup>mod(k−

(n−

1);

N)</sup>.

4. The method of claim 2, comprised of, when N satisfies N=p¹−

1 for a prime number p;

when the input and output resource indices starts from 1, such that i=1, 2, . . . N and j=1 . . . , N, determining the number j in accordance with the pseudo-random permutation function established by;

j=P_G,3(i,n,N)=mod(i×

n,N+1); and

when the input and output resource indices starts from 0, such that i′

=0, . . . , N−

1 and j′

=0, . . . , N−

1, determining the number j′

in accordance with the pseudo-random permutation function established by;

j′

=P_G,3(i′

+1,n,N)−

1=mod((i′

+1)×

n,N+1)−

1

5. The method of claim 2, comprised of, when N does not satisfy N=p^m−

1 for any prime number p and any positive integer m;

determining a smallest integer M>

N such that M satisfies M=p^m−

1 for a prime number p and a positive integer m;

determining a primitive element α

for a Galois field M+1;

setting two variables u=1, and v=1;

determining a number w in dependence upon M, n and v;

when m>

1, determining the number w in accordance with one of the pseudo-random permutation functions established by;

j=P_G,1(v,n,N)=α

<sup>mod(k+n−

1,N)</sup>, and

j=P_G,2(v,n,N)=α

<sup>mod(k−

(n−

1),N)</sup>,

where k is an integer k such that i=α

^k and 0≦

k≦

N−

1;

when m=1, determining the number w in accordance with one of the pseudo-random permutation functions established by;

j=P_G,1(v,n,N)=α

<sup>mod(k+n−

1,N)</sup>,

j=P_G,2(v,n,N)=α

<sup>mod(k−

(n−

1),N)</sup>, and

j=P_G,3(v,n,N)=mod(v×

n,N+1)

where k is an integer k such that i=α

^k and 0≦

k≦

N−

1;

comparing w and N, when w>

N, setting v=v+1, repeating the step of determining the number w in dependence upon M, n and v, and repeating the step of comparing w and N;

when w≦

N comparing u and i, and when u≠

i, setting u=u+1 and v=v+1, repeating the step of determining the number w in dependence upon M, n and v, and repeating the step of comparing w and N, and comparing u and i; and

when w≦

N, and u=i, setting j=w.

6. The method of claim 2, comprised of, when N does not satisfy N=p−

1 for any prime number p;

determining a smallest integer M>

N such that M satisfies M=p−

1 for a prime number p;

determining a primitive element α

for a Galois field M+1;

setting two variables u=1, and v=1;

determining a number w in dependence upon M, n and v in accordance with the pseudo-random permutation function established by;

j=P_G,3(v,n,N)=mod(v×

n,N+1)

comparing w and N, when w>

N, setting v=v+1, repeating the step of determining the number w in dependence upon M, n and v, and repeating the step of comparing w and N;

when w≦

N comparing u and i, and when u≠

i, setting u=u+1 and v=v+1, repeating the step of determining the number w in dependence upon M, n and v, and repeating the step of comparing w and N, and comparing u and i; and

when w≦

N, and u=i, setting j=w.

7. The method of claim 1, comprised of the pseudo-random function being a Pruned Bit Reversal Ordering (PBRO) function established by:

j=g(i,n)=PRBO(mod(i+n−

1,N)+1,N).

8. The method of claim 1, comprised of assigning the same parameter n for all cells in the communication network.

9. The method of claim 1, comprised of assigning one parameter n for each cell in the communication network in dependence upon an identification of the cell.

10. The method of claim 9, comprised of the relationship between the parameter n and the identification of the cell being established by:

n=mod(c_id−

1,N)+1.

where c_id denotes the identification of the cell.

11. The method of claim 1, comprised of each of the resource combinations comprising an orthogonal cover selected from a plurality of orthogonal covers and a cyclic shift of a base sequence selected from a plurality of cyclic shifts.

12. The method of claim 11, comprised of the base sequence being a Zadoff-Chu sequence.

13. The method of claim 11, comprised of the plurality of orthogonal covers being of four Walsh codes established by:

c1=0.5×

[1,1,1,1];

c2=0.5×

[1,−

1,1,−

1];

c3=0.5×

[1,1,−

1,−

1];

c4=0.5×

[1,−

1,−

1,1].

14. The method of claim 13, comprised of:

constructing four sets of Walsh codes S₁, S₂, S₃ and S₄, with each set comprising three Walsh codes, and the four sets of Walsh codes S₁, S₂, S₃ and S₄ are established by the following table;

Four subsets A B C S₁ c2 c3 c1 S₂ c1 c4 c2 S₃ c4 c1 c3 S₄ c3 c2 c4

assigning an i′

-th set of Walsh codes S_i selected from the four sets of Walsh codes S₁, S₂, S₃ and S₄ to the first time slot; and

assigning a j′

-th set of Walsh codes S_j selected from the four sets of Walsh codes S₁, S₂, S₃ and S₄ to the second time slot, with i′ and

j′

being determined in dependence upon an identification of a certain cell in the communication network.

15. The method of claim 14, comprised of i′

and j′

being determined in dependence upon the identification of the certain cell by;

i′

=mod(c−

id−

1,4)+1, and

j′

=mod(i+n−

1,4)+1

where n is a positive integer, and c_id denotes the identification of the cell.

16. The method of claim 11, comprised of shifting the index of the cyclic shift within at least one resource combination on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id,s_id,l_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

17. The method of claim 16, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

18. The method of claim 11, comprised of shifting the index of the cyclic shift within at least one resource combination in a time slot in a cell by an amount specified by h_slot(c_id, sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

19. The method of claim 18, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1,K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

20. A method for communication in a communication network, the method comprising the steps of:

dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K;

establishing a mapping scheme between the resource combinations in the subsets in a first time slot and the resource combinations in the subsets in a second time slot in dependent upon a certain parameter vector {right arrow over (n)}=[n₁, n₂, . . . , n_K], where n_k corresponds to a k-th subset, with the mapping scheme being established by;

i_k,d=g(i,{right arrow over (n)})=g_k(i_k,c,n_k), for k=1, 2, . . . , K

where i=i_k,c, i_k,c denotes the index of a resource combination within the N resource combinations in the first time slot, k denotes the index of the subset where the i_k,c-th resource combination is located, c denotes the index of the i_k,c-th resource combination within the k-th subset, i_k,d denotes the index of a resource combination within the N resource combinations in the second time slot, k denotes the index of the subset where the i_k,d-th resource combination is located, d denotes the index of the i_k,d-th resource combination within the k-th subset, i_k,c=(k−

1)×

N_k+c, i_k,d=(k−

1)×

N_k+d, and g(a,b) is a pseudo-random function;

selecting a first resource combination from among N_k resource combinations in a k-th subset in the first time slot;

selecting a second resource combination from among N_k resource combinations in a k-th subset in the second time slot in accordance with the mapping scheme; and

transmitting information using the first resource combination during the first time slot and the second resource combination during the second time slot.

21. The method of claim 20, comprised of:

establishing the mapping scheme in accordance with a Galois Field based permutation function established by;

d=P_G(c,n_k,N_k)

when the input and output resource indices starts from 1, such that c=1, 2, . . . N_k and d=1 . . . , N_k, and 1≦

n_k≦

N_k; and

establishing the mapping scheme in accordance with a Galois Field based permutation function established by;

d′

=P_G(c′

+1,n_k,N_k)−

1

when the input and output resource indices starts from 0, such that c′

=0, . . . , N_k−

1 and d′

=0, . . . , N_k−

1, and 1≦

n_k≦

N_k.

22. The method of claim 20, comprised of establishing the mapping scheme in accordance with a Pruned Bit Reversal Ordering (PBRO) function established by:

d=PBRO(mod(c+n_k−

1)+1,N_k).

23. The method of claim 20, comprised of assigning the same parameter vector n for all cells in the communication network.

24. The method of claim 20, comprised of assigning one parameter vector n for each cell in the communication network in dependence upon an identification of the cell.

25. The method of claim 20, comprised of each of the resource combinations comprising an orthogonal cover selected from a plurality of orthogonal covers and a cyclic shift of a base sequence selected from a plurality of cyclic shifts.

26. The method of claim 25, comprised of shifting the index of the cyclic shift within at least one resource combination on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id,s_id,l_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

27. The method of claim 26, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

28. The method of claim 25, comprised of shifting the index of the cyclic shift within at least one resource combination in a time slot in a cell by an amount specified by h_slot(c_id,sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

29. The method of claim 28, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1,K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

30. A method for communication in a communication network, the method comprising the steps of:

dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K, and N₁=N=N₂= . . . =N_K;

establishing an inter-subset interleaving scheme in at least one time slot in accordance with an interleaving parameter P_G[s₁, s₂, s_K], with the inter-subset interleaving scheme being established by;

j=w(i,PG[s₁, s₂, . . . , s_K]), for k=1, 2, . . . , K,

where w(i,PG[s₁, s₂, . . . , s_K]) denotes the i-th resource combination in the time slot after the interleaving in accordance with the interleaving parameter PG[s₁, s₂, . . . , s_K], and the interleaving parameter PG[s₁, s₂, . . . , s_K] indicates that a subset having a pre-interleaving index of s_k has a post-interleaving index of k, and 1≦

s₁, . . . , s_K≦

K;

selecting a first resource combination from among the N resource combinations in a first time slot that has not been interleaved;

selecting a second resource combination from among the N resource combinations in a second time slot that has been interleaved in accordance with the inter-subset interleaving scheme; and

transmitting information using the first resource combination during the first time slot and the j-th resource combination during the second time slot.

31. The method of claim 30, comprised of the interleaving parameter PG[s₁, s₂, . . . , s_K] being the same for all cells in the communication network.

32. The method of claim 30, comprised of assigning the interleaving parameter PG[s₁, s₂, . . . , s_K] for each cell in the communication network in dependence upon an identification of the cell.

33. The method of claim 30, comprised of each of the resource combinations comprising an orthogonal cover selected from a plurality of orthogonal covers and a cyclic shift of a base sequence selected from a plurality of cyclic shifts.

34. The method of claim 33, comprised of shifting the index of the cyclic shift within at least one resource combination on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id, s_id, id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

35. The method of claim 34, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

36. The method of claim 33, comprised of shifting the index of the cyclic shift within at least one resource combination in a time slot in a cell by an amount specified by h_slot(c_id, sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

37. The method of claim 36, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1,K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

38. A method for communication in a communication network, the method comprising the steps of:

dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K, and N₁=N₂= . . . =N_K;

establishing an intra-subset remapping scheme between the resource combinations in the subsets in a first time slot and the resource combinations in the subsets in a second time slot in dependent upon a certain parameter vector {right arrow over (n)}=[n₁, n₂, . . . , n_K], where n_k corresponds to a k-th subset, with the mapping scheme being established by;

i_k,d=g(i,{right arrow over (n)})=g_k(i_k,c,n_k), for k=1, 2, . . . , K

where i=i_k,c, i_k,c denotes the index of a resource combination within the N resource combinations in the first time slot, k denotes the index of the subset where the i_k,c-th resource combination is located, c denotes the index of the i_k,c-th resource combination within the k-th subset, i_k,d denotes the index of a resource combination within the N resource combinations in the second time slot, k denotes the index of the subset where the i_k,d-th resource combination is located, d denotes the index of the i_k,d-th resource combination within the k-th subset, i_k,c=(k−

1)×

N_k+c, i_k,d=(k−

1)×

N_k+d, and g(a,b) is a pseudo-random function;

establishing an inter-subset interleaving scheme for the subsets in at least one time slot in accordance with an interleaving parameter PG[s₁, s₂, . . . , s_K], with 1≦

s₁, . . . , s_K≦

K, and the inter-subset interleaving scheme being established by;

j=w(i,PG[s₁, s₂, . . . , s_K]), for k=1, 2, . . . , K,

where w(i,PG[s₁, s₂, . . . , s_K]) denotes the i-th resource combination in the time slot after interleaving the subsets in the time slots in accordance with the interleaving parameter PG[s₁, s₂, . . . , s_K], and the interleaving parameter PG[s₁, s₂, . . . , s_K] indicates that a subset having a pre-interleaving index of s_k has a post interleaving index of k, where k=1, 2, . . . , K, and;

selecting a first resource combination from among the N resource combinations in the first time slot;

selecting a second resource combination from among the N resource combinations in the second time slot in accordance with the intra-subset remapping scheme and the inter-subset interleaving scheme, with j=g(w(i,PG[s₁, s₂, . . . , s_K]),{right arrow over (n)}); and

transmitting information using the first resource combination during the first time slot and the second resource combination during the second time slot.

39. The method of claim 38, comprised of at least one of the remapping parameter vector {right arrow over (n)}=[n₁, n₂, . . . , n_K] and the interleaving parameter PG[s₁, s₂, . . . , s_K] being the same for all cells in the communication network.

40. The method of claim 38, comprised of at least one of the remapping parameter vector {right arrow over (n)}=[n₁, n₂, . . . , n_K] and the interleaving parameter PG[s₁, s₂, . . . , s_K] being assigned for each cell in the communication network in dependence upon an identification of the cell.

41. The method of claim 38, comprised of each of the resource combinations comprising an orthogonal cover selected from a plurality of orthogonal covers and a cyclic shift of a base sequence selected from a plurality of cyclic shifts.

42. The method of claim 41, comprised of shifting the index of the cyclic shift within at least one resource combination on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id,s_id,l_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

43. The method of claim 42, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

44. The method of claim 41, comprised of shifting the index of the cyclic shift within at least one resource combination in a time slot in a cell by an amount specified by h_slot(c_id,sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

45. The method of claim 44, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1,K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

46. A method for communication in a communication network, the method comprising the steps of:

establishing a symbol-level cyclic shift mapping scheme between M cyclic shifts in a first modulation symbol in a transmission channel and M cyclic shifts in a second modulation symbol in the transmission channel in dependence upon a certain parameter n, with the first modulation symbol having an identification number of 1, the second modulation symbol having an identification number of more than 1, and with the symbol-level cyclic shift mapping scheme being established by;

m′

=t(m,l_id,n), for l_id>

1,

where m denotes the index of a cyclic shift within the first modulation symbol and m=1, 2, . . . , M, m′

denotes the index of a cyclic shift within the second modulation symbol and m′

=1, 2, . . . , M, l_id denotes the identification number the second modulation symbol, and t(a, b, c) is a pseudo-random function;

selecting a first cyclic shift from among the M cyclic shifts in the first modulation symbol;

selecting a second cyclic shift from among the M cyclic shifts in the second modulation symbol in accordance with the mapping scheme; and

transmitting information using the first cyclic shift in the first modulation symbol and the second cyclic shift in the second modulation symbol.

47. The method of claim 46, comprised of the pseudo-random function being a Galois Field based permutation function established by:

t(m,l_id,n)=P_G(m,r(l_id,n,M),M), for l_id>

1.

48. The method of claim 46, comprised of the pseudo-random function being a Pruned Bit Reversal Ordering (PBRO) function established by:

t(m,l_id,n)=PBRO(mod(m+l_id+n−

1,M)+1,M), for l_id>

1.

49. The method of claim 46, comprised of assigning the same parameter n for all cells in the communication network.

50. The method of claim 46, comprised of assigning one parameter n for each cell in the communication network in dependence upon an identification of the cell.

51. The method of claim 46, comprised of shifting the index of at least one cyclic shift on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id,s_id,l_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

52. The method of claim 51, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

53. The method of claim 46, comprised of shifting the index of at least one cyclic shift in a time slot in a cell by an amount specified by h_slot(c_id,sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

54. The method of claim 53, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1,K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

55. A method for communication in a communication network, the method comprising the steps of:

establishing a slot-level cyclic shift mapping scheme between M cyclic shifts in a first time slot in a transmission channel and M cyclic shifts in a second time slot in the transmission channel in dependence upon a certain parameter n, with the slot-level cyclic shift mapping scheme being established by;

m′

=g(m,n),

where m denotes the index of a cyclic shift within the first time slot and m=1, 2, . . . , M, m′

denotes the index of a cyclic shift within the second time slot and m′

=1, 2, . . . , M, and g(a,b) is a pseudo-random function;

selecting a first cyclic shift from among the M cyclic shifts in the first time slot;

selecting a second cyclic shift from among the M cyclic shifts in the second time slot in accordance with the mapping scheme; and

transmitting information using the first cyclic shift in the first time slot and the second cyclic shift in the second time slot.

56. The method of claim 55, comprised of:

the pseudo-random function being a Galois Field based permutation function established by;

m′

=g(m,n)=P_G(m,n,M),

when the input and output resource indices starts from 1, such that m=1, 2, . . . M and m′

=1 . . . , M; and

the pseudo-random function being a Galois Field based permutation function established by;

t′

=g(t,n)=P_G(t+1,n,M)−

1

when the input and output resource indices starts from 0, such that t=0, . . . , M−

1 and t′

=0, . . . , M−

1.

57. The method of claim 55, comprised of the pseudo-random function being a Pruned Bit Reversal Ordering (PBRO) function established by:

g(m,n)=PBRO(mod(m+n−

1,M)+1,M).

58. The method of claim 55, comprised of assigning the same parameter n for all cells in the communication network.

59. The method of claim 55, comprised of assigning one parameter n for each cell in the communication network in dependence upon an identification of the cell.

60. The method of claim 55, comprised of shifting the index of at least one cyclic shift on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id,s_id,l_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

61. The method of claim 60, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

62. The method of claim 55, comprised of shifting the index of at least one cyclic shift in a time slot in a cell by an amount specified by h_slot(c_id,sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

63. The method of claim 62, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

64. A method for communication in a communication network, the method comprising the steps of:

dividing a plurality of cyclic shifts within each of a plurality of time slots into two subsets, with each time slot comprising a plurality of resource combinations, and each resource combination comprising an orthogonal cover selected from a plurality of orthogonal covers and a cyclic shift selected from the plurality of cyclic shifts;

allocating a first subset of cyclic shifts to channel quality indicator channels, and allocating a second subset of cyclic shifts to acknowledgement channels;

selecting a first cyclic shift from the first subset of cyclic shifts in a first time slot for a channel quality indicator channel, and selecting a second cyclic shift from a first subset of cyclic shifts in a second time slot for the channel quality indicator channel in accordance with one of a symbol-level cyclic shift mapping scheme and a slot-level cyclic shift mapping scheme;

selecting a third cyclic shift from the second subset of cyclic shifts in the first time slot for an acknowledgement channel, and selecting a fourth cyclic shift from the second subset of cyclic shifts in the second time slot for the acknowledgement channel in accordance with one of the symbol-level cyclic shift mapping scheme, the slot-level cyclic shift mapping scheme, a global resource mapping scheme, an intra-subset resource mapping scheme, an inter-subset interleaving scheme, an combination of the intra-subset resource mapping scheme and the inter-subset interleaving scheme;

transmitting information regarding channel quality indicators by using the first cyclic shift during the first time slot and the second cyclic shift during the second time slot; and

transmitting acknowledgement information by using the third cyclic shift during the first time slot and the fourth cyclic shift during the second time slot.

65. The method of claim 64, comprised of the symbol-level cyclic shift mapping scheme being established between M cyclic shifts in a first modulation symbol and M cyclic shifts in a second modulation symbol in dependence upon a certain parameter n, with the first modulation symbol having an identification number of 1, the second modulation symbol having an identification number of more than 1, and with the symbol-level cyclic shift mapping scheme being established by:

m′

=t(m,l_id,n), for l_id>

1,

where m denotes the index of a cyclic shift within the first modulation symbol and m=1, 2, . . . , M, m′

denotes the index of a cyclic shift within the second modulation symbol and m′

=1, 2, . . . , M, l_id denotes the identification number the second modulation symbol, and t(a, b, c) is a pseudo-random function.

66. The method of claim 64, comprised of the slot-level cyclic shift mapping scheme being established between M cyclic shifts in a first time slot and M cyclic shifts in a second time slot in the transmission channel in dependence upon a certain parameter n, with the slot-level cyclic shift mapping scheme being established by:

m′

=g(m,n),

where m denotes the index of a cyclic shift within the first time slot and m=1, 2, . . . , M, m′

denotes the index of a cyclic shift within the second time slot and m′

=1, 2, . . . , M, and g(a,b) is a pseudo-random function.

67. The method of claim 64, comprised of the global resource mapping scheme being established between N resource combinations in a first time slot and N resource combinations in a second time slot in dependence upon a certain parameter n, with the mapping scheme established by:

j=g(i,n),

where i denotes the index of a resource combination in the first time slot and i=1, 2, . . . , N, j denotes the index of a resource combination in the second time slot and j=1, 2, . . . , N, and g(a,b) is a pseudo-random function.

68. The method of claim 64, comprised of:

dividing N resource combinations within each of the plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K; and

establishing the intra-subset resource mapping scheme between the resource combinations in the subsets in a first time slot and the resource combinations in the subsets in a second time slot in dependent upon a certain parameter vector {right arrow over (n)}=[n₁, n₂, . . . , n_K], where n_k corresponds to a k-th subset, with the mapping scheme being established by;

i_k,d=g(i,{right arrow over (n)})=g_k(i_k,c,n_k), for k=1, 2, . . . , K

where i=i_k,c, i_k,c denotes the index of a resource combination within the N resource combinations in the first time slot, k denotes the index of the subset where the i_k,c-th resource combination is located, c denotes the index of the i_k,c-th resource combination within the k-th subset, i_k,d denotes the index of a resource combination within the N resource combinations in the second time slot, k denotes the index of the subset where the i_k,d-th resource combination is located, d denotes the index of the i_k,d-th resource combination within the k-th subset, i_k,c=(k−

1)×

N_k+c, i_k,d=(k−

1)×

N_k+d, and g(a,b) is a pseudo-random function.

69. The method of claim 64, comprised of:

dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K, and N₁=N₂= . . . =N_K; and

establishing the inter-subset interleaving scheme in at least one time slot in accordance with an interleaving parameter PG[s₁, s₂, . . . , s_K], with the inter-subset interleaving scheme being established by;

j=w(i,PG[s₁, s₂, . . . , s_K]), for k=1, 2, . . . , K,

where w(i,PG[s₁, s₂, . . . , s_K]) denotes the i-th resource combination in the time slot after the interleaving in accordance with the interleaving parameter PG[s₁, s₂, . . . , s_K], and the interleaving parameter PG[s₁, s₂, . . . , s_K] indicates that a subset having a pre-interleaving index of s_k has a post-interleaving index of k, and 1≦

s₁, . . . , s_K≦

K.

70. A method for communication in a communication network, the method comprising the steps of:

establishing a subframe-level base sequence mapping scheme between Z base sequences in a first subframe in a transmission channel and Z base sequences in a second subframe in the transmission channel in dependence upon a certain parameter n, with the first subframe having an identification number of 1, the second subframe having an identification number of more than 1, and with the subframe-level base sequence mapping scheme being established by;

z′

=s(z,s_id,n), for s_id>

1,

where z denotes the index of a base sequence within the first subframe and z=1, 2, . . . Z, z′

denotes the index of a base sequence within the second subframe and z′

=1, 2, . . . , Z, s_id denotes the identification number the second subframe, and s(a, b, c) is a pseudo-random function;

selecting a first base sequence from among the Z base sequences in the first subframe;

selecting a second base sequence from among the Z base sequences in the second subframe in accordance with the mapping scheme; and

transmitting information using the first base sequence during the first subframe and the second base sequence in the second subframe.

71. The method of claim 70, comprised of the pseudo-random function being one a Galois Field based permutation function established by:

s(z,s_id,n)=P_G(z,r(s_id,n,Z),Z),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

s(z,s_id,n)=PBRO(mod(z+s_id+n−

1,Z)+1,Z),

where r(s_id,n,Z)=mod(s_id+n−

1,Z)+1.

72. A method for communication in a communication network, the method comprising the steps of:

establishing a slot-level base sequence mapping scheme between Z base sequences in a first time slot and Z base sequences in a second time slot 1 in dependence upon a certain parameter n, with the first time slot having an identification number of 1, the second time slot having an identification number of more than 1, and with the slot-level base sequence mapping scheme being established by;

z′

=s(z,sl_id,n), for sl_id>

1,

where z denotes the index of a base sequence within the first time slot and z=1, 2, . . . , Z, z′

denotes the index of a base sequence within the second time slot and z′

=1, 2, . . . , Z, sl_id denotes the identification number the second time slot, and s(a, b, c) is a pseudo-random function;

selecting a first base sequence from among the Z base sequences in the first time slot;

selecting a second base sequence from among the Z base sequences in the second time slot in accordance with the mapping scheme; and

transmitting information using the first base sequence during the first time slot and the second base sequence in the second time slot.

73. The method of claim 72, comprised of the pseudo-random function being one of a Galois Field based permutation function established by:

s(z,sl_id,n)=P_G(z,r(sl_id,n,Z),Z),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

s(z,sl_id,n)=PBRO(mod(z+sl_id+n−

1,Z)+1,Z),

where r(s_id,n,Z)=mod(s_id+n−

1,Z)+1.

74. A wireless terminal in a communication system, comprising a mapping unit establishing and broadcasting a mapping scheme between N resource combinations in a first time slot and N resource combinations in a second time slot in dependence upon a certain parameter n, with the mapping scheme established by:

j=g(i,n),

where i denotes the index of a resource combination in the first time slot and i=1, 2, . . . , N, j denotes the index of a resource combination in the second time slot and j=1, 2, . . . , N, and g(a,b) is a pseudo-random function.

75. The wireless terminal of claim 74, comprised of:

the pseudo-random function being a Galois Field based permutation function established by;

j=g(i,n)=P_G(i,n,N),

when the input and output resource indices starts from 1, such that i=1, 2, . . . N and j=1 . . . , N, and n is selected from a set of integers {1, 2, . . . , N}; and

the pseudo-random function being a Galois Field based permutation function established by;

j′

=g(i′

,n)=P_G(i′

+1,n,N)−

1

when the input and output resource indices starts from 0, such that i′

=0, . . . , N−

1 and j′

=0, . . . , N−

1.

76. The wireless terminal of claim 74, comprised of the pseudo-random function being a Pruned Bit Reversal Ordering (PBRO) function established by:

j=g(i,n)=PRBO(mod(i+n−

1,N)+1,N).

77. The wireless terminal of claim 74, comprised of the parameter n being the same for all cells in the communication network.

78. The wireless terminal of claim 74, comprised of the parameter n being assigned to each cell in the communication network in dependence upon an identification of the cell.

79. The wireless terminal of claim 74, comprised of each of the resource combinations comprising an orthogonal cover selected from a plurality of orthogonal covers and a cyclic shift of a base sequence selected from a plurality of cyclic shifts.

80. The wireless terminal of claim 79, comprised of the mapping unit shifting the index of the cyclic shift within at least one resource combination on a modulation symbol in a subframe in a cell by an amount specified by h_sym(c_id,s_id,l_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_sym(c_id,s_id,l_id),K)

where c_id denotes the identification of the cell, s_id denotes the identification of the subframe, l_id denotes the identification of the modulation symbol, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

81. The wireless terminal of claim 80, comprised of h_sym(c_id,s_id,l_id) being one of a Galois Field based permutation function established by:

h_sym(c_id,s_id,l_id)=P_G(x(l_id,K),r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−

1,K)+1,K),

where x(l_id,K)=mod(l_id−

1,K)+1, and r(c_id,n,K)=mod(c_id+n−

1,K)+1.

82. The wireless terminal of claim 79, comprised of the mapping unit shifting the index of the cyclic shift within at least one resource combination in a time slot in a cell by an amount specified by h_slot(c_id,sl_id), with the post-shifting index v_i′

of the cyclic shift having a pre-shifting index of v_i within an i-th resource combination being established by;

v_i′

=cyclic_shift(v_i,h_slot(c_id,sl_id),K)

where c_id denotes the identification of the cell, sl_id denotes the identification of the time slot, K denotes the total number of the plurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−

1,N)+1 when the plurality of cyclic shifts are indexed as 1, 2, . . . , N.

83. The wireless terminal of claim 82, comprised of h_slot(c_id,sl_id) being one of a Galois Field based permutation function established by:

h_slot(c_id,sl_id)=P_G(sl_id,r(c_id,n,K),K),

and a Pruned Bit Reversal Ordering (PBRO) function established by;

h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−

1,K)+1,K),

where r(c_id,n,K)=mod(c_id+n−

1,K)+1.

84. A wireless terminal in a communication network, comprising a mapping unit, with the mapping unit:

dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K; and

establishing and broadcasting a mapping scheme between the resource combinations in the subsets in a first time slot and the resource combinations in the subsets in a second time slot in dependent upon a certain parameter vector {right arrow over (n)}=[n₁, n₂, . . . , n_K], where n_k corresponds to a k-th subset, with the mapping scheme being established by;

i_k,d=g(i,{right arrow over (n)})=g_k(i_k,c,n_k), for k=1, 2, . . . , K

where i=i_k,c, i_k,c denotes the index of a resource combination within the N resource combinations in the first time slot, k denotes the index of the subset where the i_k,c-th resource combination is located, c denotes the index of the i_k,c-th resource combination within the k-th subset, i_k,d denotes the index of a resource combination within the N resource combinations in the second time slot, k denotes the index of the subset where the i_k,d-th resource combination is located, d denotes the index of the i_k,d-th resource combination within the k-th subset, i_k,c=(k−

1)×

N_k+c, i_k,d=(k−

1)×

N_k+d, and g(a,b) is a pseudo-random function.

85. A wireless terminal in a communication network, comprising a mapping unit, with the mapping unit:

dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising N_k resource combinations, where k=1, 2, . . . , K, and N₁=N₂= . . . =N_K; and

establishing and broadcasting an inter-subset interleaving scheme in at least one time slot in accordance with an interleaving parameter PG[s₁, s₂, . . . , s_K], with the inter-subset interleaving scheme being established by;

j=w(i,PG[s₁, s₂, . . . , s_K]), for k=1, 2, . . . , K,

where w(i,PG[s₁, s₂, . . . , s_K]) denotes the i-th resource combination in the time slot after the interleaving in accordance with the interleaving parameter PG[s₁, s₂, . . . , s_K], and the interleaving parameter PG[s₁, s₂, . . . , s_K] indicates that a subset having a pre-interleaving index of s_k has a post-interleaving index of k, and 1≦

s₁, . . . , s_K≦

K.

86. A wireless terminal in a communication network, comprising a mapping unit, with the mapping unit establishing and broadcasting a symbol-level cyclic shift mapping scheme between M cyclic shifts in a first modulation symbol in a transmission channel and M cyclic shifts in a second modulation symbol in the transmission channel in dependence upon a certain parameter n, with the first modulation symbol having an identification number of 1, the second modulation symbol having an identification number of more than 1, and with the symbol-level cyclic shift mapping scheme being established by:

m′

=t(m,l_id,n), for l_id>

1,

where m denotes the index of a cyclic shift within the first modulation symbol and m=1, 2, . . . , M, m′

denotes the index of a cyclic shift within the second modulation symbol and m′

=1, 2, . . . , M, l_id denotes the identification number the second modulation symbol, and t(a, b, c) is a pseudo-random function.

87. A wireless terminal in a communication network, comprising a mapping unit, with the mapping unit establishing and broadcasting a slot-level cyclic shift mapping scheme between M cyclic shifts in a first time slot in a transmission channel and M cyclic shifts in a second time slot in the transmission channel in dependence upon a certain parameter n, with the slot-level cyclic shift mapping scheme being established by:

m′

=g(m,n),

where m denotes the index of a cyclic shift within the first time slot and m=1, 2, . . . , M, m′

denotes the index of a cyclic shift within the second time slot and m′

=1, 2, . . . , M, and g(a,b) is a pseudo-random function.

88. A wireless terminal in a communication network, comprising a mapping unit, with the mapping unit establishing and broadcasting a subframe-level base sequence mapping scheme between Z base sequences in a first subframe in a transmission channel and Z base sequences in a second subframe in the transmission channel in dependence upon a certain parameter n, with the first subframe having an identification number of 1, the second subframe having an identification number of more than 1, and with the subframe-level base sequence mapping scheme being established by:

z′

=s(z,s_id,n), for s_id>

1,

where z denotes the index of a base sequence within the first subframe and z=1, 2, . . . , Z, z′

denotes the index of a base sequence within the second subframe and z′

=1, 2, . . . , Z, s_id denotes the identification number the second subframe, and s(a, b, c) is a pseudo-random function.

89. A wireless terminal in a communication network, comprising a mapping unit, with the mapping unit establishing and broadcasting a slot-level base sequence mapping scheme between Z base sequences in a first time slot and Z base sequences in a second time slot 1 in dependence upon a certain parameter n, with the first time slot having an identification number of 1, the second time slot having an identification number of more than 1, and with the slot-level base sequence mapping scheme being established by:

z′

=s(z,sl_id,n), for sl_id>

1,

where z denotes the index of a base sequence within the first time slot and z=1, 2, . . . , Z, z′

denotes the index of a base sequence within the second time slot and z′

=1, 2, . . . , Z, sl_id denotes the identification number the second time slot, and s(a, b, c) is a pseudo-random function.