RU2454804C2 - Methods and device for redistribution of resources and regrouping in wireless communication system - Google Patents

Abstract

FIELD: information technologies.

SUBSTANCE: in the method of data transfer in a communication system data to be transferred is modulated to generate modulated data, the first resource is selected to be used during the first time on the basis of the first time index function, the second resource is selected to be used in the second time on the basis of the second time index function, modulated data is distributed in the selected first resource and in the selected second resource during the first time and the second time, accordingly, and modulated data is sent into each of the first time and the second time. The first resource and the second resource are one of an orthogonal code and a cyclic shift of a basic sequence. Each of the first time and the second time is set on the basis of one of a symbol level and an interval level, and moreover, the interval consists of at least one symbol.

EFFECT: higher efficiency of redistribution and regrouping of transfer resources in a wireless communication system.

36 cl, 3 dwg, 22 tbl

Description

BACKGROUND

FIELD OF THE INVENTION

The present invention relates to methods and devices for redistributing and rearranging resources for transmission in a wireless communication system.

State of the art

Communication tools allow the transmission of data over a distance in order to communicate between the transmitter and receiver. Data is usually carried by radio waves and transmitted using limited transmission resources. That is, radio waves are transmitted over a period of time using a limited frequency range.

In systems of the Third Term (3rd) Generation Partnership Project Long Term Evolution (3GPP LTE), one of the types of transmission resource used in the uplink control channel (PUCCH) is known as a cyclic shift (CS) for each OFDM symbol. For example, a PUCCH occupies twelve subcarriers in one resource block (RB) and, therefore, there are twelve CS resources in one RB.

In addition, in accordance with the current operating assumption on the transmission of the acknowledgment block for the UL acknowledgment channel (ACK) and the reference signal (RS), acknowledgment and no acknowledgment signals (ACK / NAK) and RS in the uplink (UL) for ACK demodulation / NACKs are multiplexed on code channels formed by both the cyclic shift (CS) of the base sequence and the orthogonal coating (OC). One example of a base sequence is the Zadov-Chu sequence.

One of the important aspects of the design of the system is the allocation of resources at the level of symbols, intervals or subframes. Although some methods have been proposed in the past, such as the redistribution table based approach disclosed in reference [5], the redistributed table based approach requires storing the redistribution table and is therefore undesirable. In the present invention, we are trying to find an effective, but still a general way to reallocate resources.

SUMMARY OF THE INVENTION

An object of the present invention is to provide improved methods and apparatus for wireless communication.

Another objective of the present invention is to provide improved methods and apparatus for efficiently redistributing and rearranging transmission resources in a wireless communication system.

In accordance with one aspect of the present invention, a global resource allocation scheme is arranged between N resource combinations in a first time slot and N resource combinations in a second time slot, depending on a specific parameter n . The distribution scheme is set as follows:

j = g (i, n),

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

The pseudo-random function may be a permutation function based on the Galois field, set as follows:

j = g (i, n) = P _G (i, n, N),

where n is selected from the set of integers {l, 2, ..., N }. Alternatively, the pseudo-random function may be a truncated bit function of the reverse order (PBRO), described as follows:

j = g (i, n) = PRBO (mod (i + n- l , N) + l , N).

The parameter n can be the same for all cells in the communication network.

Alternatively, the parameter n may be assigned to each cell in the communication network depending on the identification of the cell.

Each of the resource combinations comprises an orthogonal coating selected from a plurality of orthogonal coatings, and a cyclic shift of the base sequence selected from a plurality of cyclic shifts. The symbol level cyclic shift hopping scheme for a particular cell can be set to shift the cyclic shift index within at least one resource combination per modulation symbol in a subframe in the cell by the value indicated by the expression h_sym (c_id, s_id, l_id) . The index of v _i 'cyclic shift after the shift, which had prior to the shift index v, within the i -th resource combination is described as follows:

v _i '= cyclic_shift (v _i , h_sym (c_id, s_id, l_id), K),

where c_id means cell identification, s_id means subframe identification, l_id means modulation symbol identification, K means the total number of multiple cyclic shifts, and cyclic_shift (a, b, N) = mod (a + b -1, N ) + l when the set cyclic shifts are indexed as 1,2, ..., N.

The h_sym function (c_id, s_id, l_id) can be one of the permutation functions based on the Galois field, described as follows:

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

and a truncated reverse order bit function (PBRO), described as follows:

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 -l, K ) + l.

Alternatively, a symbol level cyclic shift hopping scheme for a particular cell can be set to shift the cyclic shift index within at least one resource combination in a time interval in the cell by the value indicated by the expression h_slot (c_id, sl_id ). The index of v _i 'cyclic shift after the shift index v _i having to shift within the i -th resource combination is described as follows:

v _i ' = cyclic_shift (v _i , h_slot (c_id, sl_id), K) ,

where c_id means cell identification, sl_id means time slot identification, K means total number of multiple cyclic shifts, and cyclic_shift (a, b, N) = mod ( a + b -1, N) +1 when multiple cyclic shifts are indexed as 1 , 2, ..., N. The h_slot (c_id, sl_id) function can be one of the permutation functions based on the Galois field, described as follows:

h_slot (c_id, sl_id) = P _G (sl_id, r (c_id, n, K), K) ,

and a truncated reverse order bit function (PBRO), described as follows:

h_slot (c_id, s_id, l_id) = PBRO (mod ( sl_id + c_id + n -1, K ) +1, K ),

where r (c_id, n, K) = mod ( c_id + nl, K ) +1.

In accordance with another aspect of the present invention, first N resource combinations within each of the plurality of time slots are divided into K subsets, with the kth subset containing N _k resource combinations, where k = 1,2, ..., K. The distribution scheme of resources within a subset is organized between combinations of resources in subsets in the first time interval and combinations of resources in subsets in the second time interval depending on a certain parameter vector n = [ n ₁ , n ₂ , ..., n _k ], where n _k corresponds to the kth subset. The distribution scheme is described as follows:

i _{k, d} = g _k (i, n) = g _k ( i _{k, c} , n _k ), for k = 1, 2, ..., K

where i = i _{k, c} , i _{k, c} means the index of the combination of resources inside N combinations of resources in the first time interval, k means the index of the subset in which i _{k, the} cth combination of resources, c means the index i _{k, c} - th resource combination inside the k- th subset, i _{k, d} means the resource combination index inside the N resource combinations in the second time interval, k means the subset index in which the i _k is located _{, the d-} th resource combination, d means the index i _{k, d} -th combination of resources within the kth subset, i _{k, c} = ( k -l) x N _k + c , i _{k, d} = ( k -1) x N _k + d , and g (a, b) is P Sevdo random function.

In accordance with yet another aspect of the present invention, the first N resource combinations within each of the plurality of time intervals are divided into K subsets with the kth subset containing N _k resource combinations, where k = 1,2, ..., K , and N ₁ = N ₂ = ... = N _k . The interleaving scheme between the subsets is organized in at least one time interval in accordance with the interleaving parameter PG [ s ₁ , s ₂ , ..., s _k ]. The interleaving scheme between the subsets is organized as follows:

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

where w ( i , PG [ s ₁ , s ₂ , ..., s _k ]) means the i-th resource combination in the time interval after interleaving in accordance with the interleaving parameter PG [ s ₁ , s ₂ , ..., s _k ]) and the interleaving parameter PG [ s ₁ , s ₂ , ..., s _k ]) indicates that the subset having index s _k before interleaving has index k after interleaving, and l≤ s ₁ , ..., s _k ≤ K.

In accordance with yet another aspect of the present invention, a symbol level cyclic shift distribution pattern is arranged between M cyclic shifts in a first modulation symbol in a transmission channel and M cyclic shifts in a second modulation symbol in a transmission channel depending on a specific parameter n . The first modulation symbol has an identification number 1, and the second modulation symbol has an identification number greater than 1. A distribution scheme with cyclic shifts at the symbol level is described as follows:

m '= t ( m , l _ id , n ), for l _ id > 1,

where m means the cyclic shift index inside the first modulation symbol and m = 1,2, ..., M , m 'means the cyclic shift index inside the second modulation symbol and m ' = l, 2, ..., M , l_ id means the identification number of the second modulation symbol, and t ( a , b , c ) is a pseudo-random function.

In accordance with yet another aspect of the present invention, an interval-level cyclic shift distribution scheme is arranged between M cyclic shifts in a first time slot in a transmission channel and M cyclic shifts in a second time slot in a transmission channel depending on a specific parameter n . The distribution scheme with cyclic shifts at the interval level is described as follows:

m '= g ( m , n ),

where m is the cyclic shift index inside the first time interval and m = 1,2, ..., M , m 'is the cyclic shift index inside the second time interval and m ' = 1,2, ..., M , and g ( a , b ) is a pseudo-random function.

In accordance with a further aspect of the present invention, a sub-frame level base sequence distribution scheme is arranged between Z base sequences in a first sub-frame in a transmission channel and Z base sequences in a second sub-frame in a transmission channel depending on a specific parameter n . The first subframe has an identification number 1, and the second subframe has an identification number greater than 1. The distribution scheme of the base sequences at the subframe level is described as follows:

z '= s ( z , s _ id , n ), for s _ id > 1,

where z means the index of the base sequence inside the first subframe and z = 1,2, ..., Z , z 'means the index of the base sequence inside the second subframe and z ' = l, 2, ..., Z , s _ id means identification number of the second subframe, and s ( a , b , c ) is a pseudo-random function.

In accordance with another aspect of the present invention, an interval distribution pattern of base sequences is arranged between Z base sequences in a first time interval and Z base sequences in a second time interval 1 depending on a specific parameter n . The first time interval has identification number 1, and the second time interval has identification number greater than 1. The distribution scheme of the basic sequences of shifts at the interval level is described as follows:

z '= s ( z , sl _ id , n ), for sl _ id > 1,

where z means the index of the base sequence inside the first time interval and z = 1,2, ..., Z, z 'means the index of the base sequence inside the second time interval and z ' = l, 2, ..., Z , sl _ id means the identification number of the second time interval, and s ( a , b , c ) is a pseudo-random function.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the invention and many of its inherent advantages will become easily visible, and will also be clearer when referring to the following detailed description when considering it in conjunction with the accompanying drawings, in which the same reference numbers indicate the same or similar components, on which :

figure 1 - diagram of the transceiver chain of a multiplexing system with orthogonal frequency division multiplexing (OFDM), suitable for the practical implementation of the principles of the present invention;

figure 2 is a schematic example of multiplexing six blocks of user equipment (UE) inside one resource block (RB); and

3 is a schematic diagram of a current operational assumption for acknowledgment channels and an uplink reference signal.

DETAILED DESCRIPTION OF THE INVENTION

The following materials are included in the present invention by reference:

[1] 3GPP RANl # 50 Chairman's Notes, August 2007, Athens, Greece

[2] 3GPP RANl # 50 Chairman's Notes, August 2007, Athens, Greece

[3] 3GPP RANl # 50 Chairman's Notes, August 2007, Athens, Greece

[4] Rl-072225, "CCE to RE mapping", Samsung, RANl # 49, Kobe, May 2007

[5] Rl-073412, "Randomization of intra-cell interference in PUCCH", ETRI, RANl # 50, Athens, August 2007

[6] Rl-073413, "Sequence allocation and hopping for uplink ACK / NACK channels", ETRI, RANl # 50, Athens, August 2007

[7] Rl-073661, "Signaling of implicit ACK / NACK resources", Nokia Siemens, Nokia, RANl # 50, Athens, August 2007

[8] Rl-080983, "Way forward on the Cyclic Shift Hopping for PUCCH", Panasonic, Samsung, ETRI, RAN1 # 52, Sorrento, Italy, February, 2008

[9] 3GPP TS 36.211, version 8.3.0, May, 2008

1 shows a transceiver chain of an orthogonal frequency division multiplexing (OFDM) system. In a communication system using OFDM technology, in a transmitter chain 110, control signals or data 111 are modulated by a modulator 112 into a sequence of modulation symbols that are sequentially converted from serial to parallel to serial-to-parallel (S / P) converter 113. Inverse fast Fourier transform block 114 (IFFT) is used to convert signals from the frequency domain to the time domain into multiple OFDM signals. A cyclic prefix (CP) or null prefix (ZP) is added to each OFDM symbol by the CP insertion unit 116 to avoid or mitigate the effect of multipath fading. As a result, the signal is transmitted by an external transmitter (TX) processing unit 117, such as an antenna (not shown), or, alternatively, via a fixed wired or cable network. In the receiving chain 120, assuming that the time and frequency synchronization is fully achieved, the signal received by the external receiver processing unit (Rx) 121 is processed by the CP removal unit 122. A fast Fourier transform (FFT) unit 124 converts the received signal from the time domain to the frequency domain for further processing.

The total bandwidth of an OFDM system is divided into narrowband frequency intervals called subcarriers. The number of subcarriers is equal to the size N FFT / IFFT used in the system. In general, the number of subcarriers used for data is less than N, since some subcarriers at the edge of the frequency spectrum are reserved as guard subcarriers. In general, no information is transmitted on guard subcarriers.

On the uplink (UL) of the Third Term (3rd) Generation Partnership Project (3GPP LTE) Long Term Evolution, one of the types of transmission resource used in the uplink control channel (PUCCH) is known as cyclic shift (CS) for each OFDM symbol. For example, a PUCCH occupies twelve subcarriers in one resource block (RB) and, therefore, twelve CS resources in one RB. An example of multiplexing six blocks of user equipment (UE) in one RB is shown in FIG. Note that in this example, only six out of twelve CSs are used.

Figure 3 shows the current operational assumption for the acknowledgment channel (ACK) transmission unit and the reference signal (RB). ACK / NAK and UL RS signals for ACK / NACK demodulation are multiplexed on code channels formed by a cyclic shift (CS) of the base sequence and orthogonal coverage (OC). One example of a base sequence is the Zadov-Chu sequence.

One of the important aspects of the design of the system is the allocation of resources at the level of symbols, intervals or subframes. Although some methods have been proposed in the past, such as a redistribution table based on the approach disclosed in reference [5], a redistribution table based on the above approach requires storing the redistribution table and is therefore undesirable. In the present invention, we are trying to find an effective but still general way of reallocating resources.

In the present invention, for the first time, we propose a set of new permutation algorithms, and also propose to apply these algorithms and the well-known reverse order truncated bit algorithm (PBRO) to several different problems of redistribution / rearrangement, including redistribution with cyclic shifts (CS) / orthogonal coating ( OC) at the level of intervals or symbols, to creating hopping schemes using CS at the level of intervals and symbols for specific cells and to creating basic hopping schemes sequences at the level of subframes and intervals.

In addition, we note that a truncated reverse order bit algorithm (PBRO or sometimes known as the “PBRI” algorithm, where “I” is inserted for interleaving) is a known method and has been used in many applications, for example, distribution of a control channel element (CCE) in resource elements (RE) disclosed in reference [4]. The PBRO method creates a permutation y = PBRO ( i , M ) of a sequence {1,2, ..., M } of size M , where y is the output value corresponding to the input value i . PBRO is installed as follows:

Let i = i -1, so that i belongs to the sequence {0,1, ..., M -1}. We define the parameter n PBRO, where n is the smallest integer, such as M ≤2 ⁿ .

Set the counters i and j to their original position at 0.

Define x as the value of j with the reverse bit order using an n- bit binary representation. For example, if n = 4 and j = 3, then x = 12.

If x < M , set PBRO (i, M) to x and increase i by 1.

Let's increment the counter j .

If i <M go to step 3. Otherwise, go to step 7.

Let j = j +1, so that j belongs to the set {0,1, ..., M}.

Aspects, features and advantages of the invention are clearly apparent from the following detailed description, simply by showing several specific embodiments, including the preferred embodiment, intended to carry out the invention. The invention is also suitable for other or different embodiments, and some of its details may vary in various obvious respects, without deviating from the essence and scope of the invention. Accordingly, the drawings and description should be considered in nature as examples, but not as limitations. The invention is demonstrated by way of example and not by way of limitation, in the figures of the accompanying drawings.

one. The proposed permutation algorithm

In the first embodiment, in accordance with the principles of the present invention, we propose a resource permutation function that is based on Galois field operations. Let N be the total number of rearranged resources, then the operations of the permutation function are described as follows:

(1) j = P _G ( i , n , N )

(one)

where i = l, ..., N is the index of input resources, j = l, ..., N is the index of output resources, and n = l, ..., N is the index of the sequence of permutations, since the other value n provides the output with other permutations.

First, we consider the case where N is an integer satisfying the condition N = p ^m -1, where p is a prime and m is a positive integer. In this case, the Galois field N + 1 exists and we mark it as GF (N + 1). In addition, we can find the primitive element of this Galois field and name the primitive element α, which satisfies the condition α ^N = α ^pm-1 = 1, and α is an integer. In addition, all N nonzero elements in GF (N + 1) can be expressed as the exponent α or, in other words, the sequence α ⁰ , α ^l , ..., α ^N-1 contains all N nonzero elements in GF ( N + one). Therefore, any number i of the input resource can be expressed as an exponent of the primitive element i = α ^k for any integer k , such that 0≤ k ≤ N -1. With this in mind, the output of the resource permutation function P _G ( i , n , N ) is described as follows:

j = P _{G, 1} ( i , n , N ) = α ^{mod (k + n-1, N)} for i = 1, ..., N , and n = l, ..., N , (2)

where mod ( a , b ) is a modulo operation applied to two integers a and b . Another similar permutation function can be found as:

j = P _{G, 2} ( i , n , N ) = α ^{mod (k- (n-1), N)} for i = 1, ..., N, and n = l, ..., N (3 )

Note that we can turn to the calculation of the final field for help in order to find the representation of the natural number j in the above equation.

On the other hand, we consider the special case where N is an integer satisfying the condition N = p ^j -1, where p is a prime. In this case, the Galois field N + l, that is, GF (N + 1), also exists and is also the main Galois field. In this case, we offer a simpler approach to finding the output rearranged resource:

j = P _{G, 3} ( i , n , N ) = mod ( i x n , N +1) for i = 1, ..., N , and n = l, ..., N (4)

Additionally, if N does not satisfy the condition N = p ^m -1 for some prime p and a positive integer m , then we propose the following approach based on the truncated field GF, which we denote as P _{G, 4α} ( i , n , N ):

Step 1: Find the smallest integer M > N such that M satisfies the condition M = p ^m -1, where p is a prime and m is a positive integer. Form a Galois field GF (M + 1), find the primitive element α for GF (M + 1). Set the variables u = l and v = l.

Step 2: Find w in the following way: if M = p ^m -1, where p is a prime and m > 1, then w can be created either as w = P _{G, 1} ( v , n , M ), or as w = P _{G, 2} ( v , n , M ); if M = p -1, where p is a prime, then w can be created using one of the three functions listed above: w = P _{G, 1} ( v , n , M ), w = P _{G, 2} ( v , n , M ) and w = P _{G, 3} ( v , n , M ).

Stage 3: if w > N , let v = v +1, go to stage 2; otherwise go to step 4.

Step 4: if u = i , go to step 5; otherwise, let u = u +1, v = v +1 and go to step 2.

Stage 5: We got the index of the output resource j = w = P _{G, 4α} ( i , n , N ).

We also proposed a similar method for the case when N does not satisfy the condition N = p -1 for some prime p , then we proposed the following approach based on the main truncated field GF, which we mean by P _{G, 4b} ( i , n , N ):

Stage 1: Find the smallest M > N such that M satisfies the condition M = p -1, where p is a prime. Set the variables u = l and v = l.

Stage 2: Find w as w = P _{G, 3} ( v , n , M ).

Stage 3: if w > N , let v = v +1, go to stage 2; otherwise, go to step 4.

Step 4: if u = i , go to step 5; otherwise, let u = u +1, v = v +1 and go to step 2.

Stage 5: We got the index of the output resource j = w = P _{G, 4b} ( i , n , N ).

Now we generalize the proposed permutation function. Therefore, for a set of input values i , n , N , where l≤ i ≤ N and l≤ n ≤ N , the result of the permutations is described by the following function:

It is noteworthy that in the methods described above we assumed the input and output resources indexed as i = 1, ..., N , and j = l, ..., N. If the input index i ' and the output index j ' are indexed as i ' = 0, ..., N -1 and j' = 0, ..., N -l, then the above equation should be used as follows:

j ' = P _G ( i ' +1, n , N ) -1; for i '= 0, ..., N -1, j ' = 0, ..., N -1, and n = 1, ..., N (6)

2. Redistribution of resources at the interval level for combinations with orthogonal coverage / cyclic shift

First, consider the case where in each of the two slots of the uplink control channel, a total of N resources are available and each resource is defined as a combination with orthogonal coverage and cyclic shift (combined OC / CS resource). An example of the application of this type of unified resource assignment is the uplink ACK / NACK channel. Note that the uplink service request channel may reuse the uplink ACK / NACK channel structure. Another example of the application of this type of combined resource assignment is the uplink demodulation reference channel.

One example of orthogonal coverage is the Walsh-Hadamard code.

On the other hand, cyclic shift (CS) is usually applied to the base sequence, examples of the base sequence include the ZC (Zadov-Chu) code and computer-generated CAZAC (Constant Amplitude Zero Auto-Correlation) codes. For any base sequence of length N, there are N cyclic shifts or N CS resources.

Hereinafter, we denote the combined OC / CS resources as CB. N pooled resources are represented as follows:

CB _a [ i ] = { OC _a [ u _i ], CS _a [ v _i ]}, for i = l, ..., N , and a = 1, 2, (7)

where u _i and v _i indicate the indices OC and CS for the i- th combined resource, respectively. In addition, a = 1.2 is the interval index within a subframe for uplink transmissions according to the 3GPP LTE standard.

2.1. Global reallocation of resources

In a second embodiment consistent with the principles of the present invention, let there be N combined OC / CS resources in both intervals of the uplink subframe. We propose linking the combined OC / CS resources so that if the UE selects the combined resource CB ₁ [ i ] in the first interval, then the UE must be assigned CB ₂ [ g ( i , n )] in the second interval, where g ( i , n ) is a pseudo-random resource reallocation / rearrangement function and n is a parameter.

In a first embodiment of the second embodiment, consistent with the principles of the present invention, the pseudo-random permutation function is described as follows:

(8) g ( i , n ) = P _G ( i , n , N )

(8)

where n is selected from the set {1,2, ..., N} or n = l, ..., N. The function P _G (i, n, N) is defined in the previous section.

In a second embodiment of the second embodiment, consistent with the principles of the present invention, the pseudo-random permutation function uses the PBRO function as follows:

(9) g ( i , n ) = PBRO (mod ( i + n -1, N ) + l, N )

(9)

The function PBRO (a, b) is determined in advance and n is selected from the set {1, 2, ..., N}.

In a third embodiment of the second embodiment, consistent with the principles of the present invention, the parameter n in the above two embodiments is the same for all cells. Parameter n may be communicated to the UE by higher layer signaling.

In a fourth embodiment of the second embodiment, consistent with the principles of the present invention, the parameter n is a function of the cell identifier, CELL ID ( c _ id ), denoted as n = f ( c _ id ). Therefore, for another c _ id we will have a different parameter n . One example of such a function is n = mod ( c _ id -1, N ) +1.

Before showing an example of such embodiments described above, we present a table for four subsets of OC S ₁ , S ₂ , S ₃ and S ₄ , as presented in reference [3]. Three codes in each subset are denoted as S _i (A), S _i (B), and S _i (C).

Table 1
Equivalent distribution between all sets
three OS Four subsets BUT AT FROM S _one c2 c3 c1 S ₂ c1 c4 c2 S ₃ c4 c1 c3 S _four c3 c2 c4

where the set of OS codes is represented by Walsh codes in accordance with the link [3]:

Now we move on to an example of application of the embodiments. First, the distribution / definition of combined OC / CS resources is given in Table 2 for N = 18, as presented in reference [3].

table 2
OC / CS resource combinations defined in two slots, N = 18 Combined resources in the interval No. 1 - CB ₁ [] Combined resources in the interval No. 2 - CB ₂ [] Cyclic shift value OC ₁ [1] OC ₁ [2] OC ₁ [3] OC ₂ [1] OC ₂ [2] OC ₂ [3] 0 NE ₁ [1] [13] NE ₂ [1] [13] one [7] [7] 2 [2] [fourteen] [2] [fourteen] 3 [8] [8] four [3] [fifteen] [3] [fifteen] 5 [9] [9] 6 [four] [16] [four] [16] 7 [10] [10] 8 [5] [17] [5] [17] 9 [eleven] [eleven] 10 [6] [eighteen] [6] [eighteen] eleven [12] [12]

Note here that OC ₁ [1], OC ₁ [2], OC ₁ [3] are the three OC codes used in interval 1, and OC ₂ [1], OC ₂ [2], OC ₂ [3] are the three OC codes used in interval 2. In general, the OC codes in each interval can be an arbitrary subset of four length-4 Walsh codes {cl, c2, c3, c4} defined in Table 1. One example of selecting OC codes is in that the OC codes in the first interval are set as OC ₁ [1] = S _i (A), OC ₁ [2] = S _i (C), OC ₁ [3] = S _i (B) and OC codes in the second interval are specified as OC ₂ [1] = S _j (A), OC ₂ [2] = S _j (C), OC ₂ [3] = S _j (B) for a pair of integers ( i , j ) (link [3]). For example, if i = j = 2, then we have OC ₁ [1] = OC ₂ [1] = S ₂ (A) = c1, OC ₁ [2] = OC ₂ [2] = S ₂ (C) = c2 and OC ₁ [3] = OC ₂ [3] = S ₂ (B) = c4.

Now, in this example, we find from the 18 combined OC / CS resources shown in Table 2, the connection / redistribution between the combined resources in interval 1 and interval 2. Note that the same connection / redistribution is applied in any other case where N = 18 OC / CS combinations, such as the alternative distribution scheme shown in Table 19 in the Appendix. Since N = 18 and N + 1 = 19 is a prime and GF (19) is the main Galois field, we can use g ( i , n ) = P _{G, 3} ( i , n , 18) = mod ( i x n , 19) as a permutation function g ( i , n ) that connects the resource CB ₁ [ i ] of interval 1 and the resource CB ₂ [ g ( i , n )] of interval 2. This resource redistribution function is shown in Table 3 below. Note that only n = l - n = 4 are shown, other parameter values n = 5 - n = 18 can also be used to create the function g ( i , n ).

Table 3
Resource permutation / reallocation function g ( i , n ) as a function of parameter n . N = 18 i one 2 3 four 5 6 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 eighteen g ( i , n ), n = 1 one 2 3 four 5 6 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 eighteen g ( i , n ), n = 2 2 four 6 8 10 12 fourteen 16 eighteen one 3 5 7 9 eleven 13 fifteen 17 g (i, n ), n = 3 3 6 9 12 fifteen eighteen 2 5 8 eleven fourteen 17 one four 7 10 13 16 g ( i , n ), n = 4 four 8 12 16 one 5 9 13 17 2 6 10 fourteen eighteen 3 7 eleven fifteen

In another example, we have N = 12 or 12 combined OC / CS resources in each interval, as shown in Table 4 below.

Table 4
Combinations of OC / CS resources defined in two intervals, presented in reference [3]. N = 12 Combined resources in the interval No. 1 - CB ₁ [] Combined resources in the interval No. 2 - CB ₂ [] Cyclic Shift Value OC ₁ [1] OC ₁ [2] OC ₁ [3] OC ₂ [1] OC ₂ [2] OC ₂ [3] 0 NE ₁ [1] NE ₂ [1] one [5] [5] 2 [9] [9] 3 [2] [2] four [6] [6] 5 [10] [10] 6 [3] [3] 7 [7] [7] 8 [eleven] [eleven] 9 [four] [four] 10 [8] [8] eleven [12] [12]

Now we find the relationship between the combined resources in interval 1 and interval 2 in this example, shown in table 4. Note that this same connection / redistribution can be applied in any other case where there are N = 12 OC / CS combinations. Since N = 12 and N + l = 13 is a prime and GF (13) is the main Galois field, we can use g ( i , n ) = P _{G, 3} ( i , n, 12) = mod ( i × n , 13) as a permutation function g ( i , n ) that connects the resource CB ₁ [ i ] of interval 1 and the resource CB ₂ [ g ( i , n )] of interval 2.

This resource redistribution function is shown in Table 5 below. Note that only n = l - n = 3 is shown, other parameter values n = 5 - n = 12 can also be used to create the function g ( i , n ).

Table 5
Resource permutation / reallocation function g ( i , n ) as a function of parameter n . N = 12 i one 2 3 four 5 6 7 8 9 10 eleven 12 g ( i , n ), n = 1 one 2 3 four 5 6 7 8 9 10 eleven 12 g ( i , n ), n = 2 2 four 6 8 10 12 one 3 5 7 9 eleven g ( i , n ), n = 3 3 6 9 12 2 5 8 eleven one four 7 10

In the third embodiment, in accordance with the principles of the present invention, we propose to assign a subset of S _i and S _{j to the} interval 1 and 2 in a subframe for all UEs within a given cell. In addition, we propose associating the subset indices i and j with the CELL ID denoted as c _ id . One example of such a relationship:

(11) i = mod ( c _ id -1,4) +1, and j = mod ( i + n -1,4) +1

(eleven)

where n is a positive integer. When the indices i and j are available for this cell whose CELL ID is c _ id , let:

(12) OC ₁ [1] = S _i (A), OC ₁ [2] = S _i (C) OC ₁ [3] = S _i (B)

(12)

for the first interval and let:

(13) OC ₂ [1] = S _j (A), OC ₂ [2] = S _j (C) OC ₂ [3] = S _j (B)

(13)

for the second interval.

Note that this embodiment applies, for example, to the examples for N = 18 and N = 12 shown above in Table 2 and Table 4.

2.2. Redistributing resources between subsets

. Дополнительно, поднаборы в интервале №1 и интервале №2 имеют одни и те же индексы. Формирование этих поднаборов показано ниже в таблице 6.In the fourth embodiment, in accordance with the principles of the present invention, we propose to divide N resources into K subsets with the kth subset having N _k elements ( k = 1,2, ..., K ), so that

. Additionally, subsets in interval # 1 and interval # 2 have the same indices. The formation of these subsets is shown below in table 6.

Table 6
Dividing N Combined OC / CS Resources into Subsets Combined resources in the interval No. 1 Combined resources in the interval No. 2 Subset 1 { CB ₁ [ i _1,1 ], ..., CB ₁ [ i _{1, N1} ]} { CB ₂ [ i _1,1 ], ..., CB ₂ [ i _{1, N1} ]} Subset 2 { CB ₁ [ i _2,1 ], ..., CB ₁ [ i _{2, N2} ]} { CB ₂ [ i _2,1 ], ..., CB ₂ [ i _{1, N2} ]} ... ... ... Subset K { CB ₁ [ i _{K, 1} ], ..., CB ₁ [ i _{K, Nk} ]} { CB ₂ [ i _{K, 1} ], ..., CB ₂ [ i _{K, Nk} ]}

Additionally, we propose linking the combined OC / CS resources in such a way that the combined resources in subset No.k, interval No. 1, should be rearranged with the combined resources in subset No.k, interval No. 2. If the UE selects the combined resource CB ₁ [ i _{k, c} ] in the first slot interval (1 ≤ c ≤ N _k ), which belongs to the set No. k within the interval No. 1, then the UE must be assigned CB ₂ [ g _k ( i _{k , s} , n _k )] in the second interval, where g _k ( i _{k, c} , n _k ) is a pseudo-random resource reallocation / rearrangement function for subset No. k , and n _k is a parameter for subset No. k . Note that i _{k, c} = ( k -1) × N _k + c . Additionally, CB ₂ [ g _k ( i _{k, c} , n _k )] should also be part of subset No. k within interval No. 2 , so g _k ( i _{k, c} , n _k ) = i _{k, d is} preserved for some 1≤ d ≤ N _k . We proceed to show how to derive the output resource index i _{k, d} for each input index i _{k, c} (derive the variable d from the variable c). Note that i _{k, d} = (kl) × N _k + d.

In the first embodiment of the fourth embodiment, consistent with the principles of the present invention, the redistribution / rearrangement of resources within each subset uses the Galois field based on the permutation function proposed earlier in Section 1. In each subset k, we associate / redistribute the two resources CB ₁ [ i _{k , c} ] and CB ₂ [ i _{k, c} , n _k )] in accordance with the following:

g _k ( i _{k, c} , n _k ) = i _{k, d} where d = P _G ( c , n _k , N _k ) for k = l, ..., K (14)

Note that here n _k is a parameter for the subset k , so that 1 ≤ n _k ≤ N _k . We can additionally collect all these parameters in vector form n = [ n ₁ , ..., n _k ], the total number of possible parameter vectors is equal to the product N ₁ × N ₂ × ... × N _k . Additionally, by summing the redistribution of resources in all subsets then for each vector of n parameters, we determined the general redistribution function for the entire set of resources, which we denote as g ( i , n ) and provide communication / redistribution between any resource CB ₁ [i] in the interval No. 1 and resource CB ₂ [g (i, n )] in the interval No. 2.

The function g ( i , n ) is determined by the first resulting subset k to which i belongs, that is, the resulting subset where there is some c , such that i = i _{k, c} , and additionally:

g ( i , n ) = g _k ( i _{k, c} , n _k ), for k , c , so i = i _{k, c} (15)

In a second embodiment of the fourth embodiment, consistent with the principles of the present invention, the pseudo-random permutation function uses the PBRO function as follows:

g ( i _{k, c,} n _k ) = i _{k, d} , where d = PBRO (mod ( c + n _k -1) + l, N ) (16)

The function PBRO ( a , b ) is defined earlier in the introduction and n _k is selected from the set {1,2, ..., N }.

In the third sub-embodiment of the fourth embodiment, consistent with the principles of the present invention, the parameter vector n = [ n ₁ , ..., n _k ] used in the above two sub-options is the same for all cells. The parameter vector n = [ n ₁ , ..., n _k ] may be reported to the UE by higher layer signaling.

In a fourth embodiment of the second embodiment, consistent with the principles of the present invention, the parameter vector n = [ n ₁ , ..., n _k ] is a CELL ID function denoted by n = f ( c_id ). Therefore, for another c_id we can have a different vector of parameters n = [ n ₁ , ..., n _k ]. One example of such a function is shown below:

(17) n _k = mod ( c_id -l, N _k ) +1

(17)

As an example, we apply this set of embodiments to the 18 resources shown in Table 2. We must first divide them into K = 3 groups with six resources in each group, that is, N ₁ = N ₂ = N ₃ = 6.

The division of resources is shown in table 7.

Note that in this example, all combined OC / CS resources that belong to the same OC code are grouped into a subset for a given interval.

Table 7
An example of dividing the resources shown in table 2 into 3 groups, each of 6 resources Combined resources in the interval No. 1 Combined resources in the interval No. 2 Subset 1 { CB ₁ [1], ..., CB ₁ [6]} { CB ₂ [1], ..., CB ₂ [6]} Subset 2 { CB ₁ [7], ..., CB ₁ [12]} { CB ₂ [7], ..., CB ₂ [12]} Subset K { CB ₁ [13], ..., CB ₁ [18]} { CB ₂ [13], ..., CB ₂ [18]}

In addition, the reallocation of resources at the interval level can be presented in the form of a table, shown below. Here we used the permutation equation d = P _G ( c , n _k , N _k ) to derive the index i _{k, d} from each input index i _{k, c} . In particular, we used the variant d = P _{G, 3} ( c , n _k , N _k ) = mod ( c × n _k , N _k +1), since N _k + 1 = 7 is a prime and GF (7) is the main field of Galois.

Table 8 (a)
Reallocation of resources for subset 1 Resource index in the interval No. 2
i _{1, d} = g ₁ ( i _{1, c} , n ₁ ) Resource index in the interval No. 1 i _{1, c} = 1 i _{1, c} = 3 i _{1, c} = 3 i _{1, c} = 4 i _{1, c} = 5 i _{1, c} = 6 n ₁ = 1 one 2 3 four 5 6 n ₁ = 2 2 four 6 one 3 5 n ₁ = 3 3 6 2 5 one four n ₁ = 4 four one 5 2 6 3 n ₁ = 5 5 3 one 6 four 2 n ₁ = 6 6 5 four 3 2 one

Table 8 (b)
Reallocation of Resources for Subset 2 Resource index in the interval No. 2
i _{2, d} = g ₂ ( i _{2, c} , n ₂ ) Resource index in the interval No. 2 i _{2, c} = 7 i _{2, c} = 8 i _{2, c} = 9 i _{2, c} = 10 i _{2, c} = 11 i _{2, c} = 12 n ₂ = 1 7 8 9 10 eleven 12 n ₂ = 2 8 10 12 7 9 eleven n ₂ = 3 9 12 8 eleven 7 10 n ₂ = 4 10 7 eleven 8 12 9 n ₂ = 5 eleven 9 7 12 10 8 n ₂ = 6 12 eleven 10 9 8 7

Table 8 (c)
Reallocation of Resources for Subset 3 Interval Resource Index
Number 2 Resource index in the interval No. 1 i _{2, c} = 13 i _{2, c} = 14 i _{2, c} = 15 i _{2, c} = 16 i _{2, c} = 17 i _{2, c} = 18 i _{3, d} = g ₂ ( i _{3, c} ) n ₃ = 1 13 fourteen fifteen 16 17 eighteen i _{3, d} = g ₂ ( i _{3, c} ) n ₃ = 2 fourteen 16 eighteen 13 fifteen 17 i _{3, d} = g ₂ ( i _{3, c} ) n ₃ = 3 fifteen eighteen fourteen 17 13 16 i _{3, d} = g ₂ ( i _{3, c} ) n ₃ = 4 16 13 17 fourteen eighteen fifteen i _{3, d} = g ₂ ( i _{3, c} ) n ₃ = 5 17 fifteen 13 eighteen 16 fourteen i _{3, d} = g ₂ ( i _{3, c} ) n ₃ = 6 eighteen 17 16 fifteen fourteen 13

As can be seen from the above table, since N ₁ = N ₂ = N ₃ = 6, there are six possible redistribution functions within each subset. Therefore, there are a total of 6 ³ vectors of parameter n and, thus, 6 ³ possible resource reallocation functions g ( i , n ) for the entire set of eighteen combined OC / CS resources. In the table below, we list only three examples containing n = [ n ₁ , n ₂ , n ₃ ] = [2,2,2] or [l, 2,3] or [2,3,4].

Table 9
General table of redistribution of resources, where redistributions take place inside each of the subsets Resource index
in the second interval
g ( j , n ) Resources in the first interval, i one 2 3 four 5 6 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 eighteen n = [ n ₁ , n ₂ , n ₃ ] = [1,2,3] one 2 3 four 5 6 8 10 12 7 9 eleven fifteen eighteen fourteen 17 13 16 n = [ n ₁ , n ₂ , n ₃ ] = [2,2,3] 2 four 6 one 3 5 8 10 12 7 9 eleven fourteen 16 eighteen 13 fifteen 17 n = [ n ₁ , n ₂ , n ₃ ] = [2,3,4] 3 four 6 one 3 5 9 12 8 eleven 7 10 16 13 17 fourteen eighteen fifteen

2.3. Switch between subsets

. Дополнительно, поднаборы в интервале №1 и интервале №2 имеют одни и те же индексы. Формирование этих поднаборов показано в таблице 6 подобно предыдущему варианту осуществления. Кроме того, в этом варианте осуществления предполагается, что число элементов внутри каждого поднабора должно быть одним и тем же, то есть N ₁ =N ₂=...=N _k.In the fifth embodiment, in accordance with the principles of the present invention, we propose to divide N resources into K subsets, each subset having N ₁ , N ₂ , ..., N _k elements and so that

. Additionally, subsets in interval # 1 and interval # 2 have the same indices. The formation of these subsets is shown in Table 6 similar to the previous embodiment. In addition, in this embodiment, it is assumed that the number of elements within each subset must be the same, that is, N ₁ = N ₂ = ... = N _k .

Now we have proposed a resource redistribution scheme in which the switching of resource redistribution between different subsets is performed. We denote this operation as PG [ s ₁ , s ₂ , ..., s _k ], where l ≤ s ₁ , ..., s _k ≤ K are the indices that indicate the switching pattern as follows: subset No. s ₁ in the first interval is redistributed into subset No. 1 in the second interval, No. s ₂ in the first interval is redistributed into subset No. 2 in the second interval, etc. The index of each resource element within the subset does not change in this switch operation. If the resource in the first interval is denoted as CB ₁ [ i ], then after redistribution the resource is denoted as CB ₂ [ w ( i , PG [ s ₁ , s ₂ , ... s _k ])] (or briefly CB ₂ [ w ( i , PG [.])]) in the second interval. In other words, if the UE selects a combination of resources CB ₁ [ i ] in the first interval, then it should be assigned CB ₂ [ g ( w ( i , PG [ s ₁ , s ₂ , ..., s _k ]), n )] in the second interval.

In a first embodiment of the fifth embodiment according to the principles of the present invention, the switching pattern within the subset PG [ s ₁ , s ₂ , ..., s _k ] is the same for all cells. The parameter PG [ s ₁ , s ₂ , ..., s _k ] may be communicated to the UE by higher layer signaling.

In a second embodiment of the fifth embodiment according to the principles of the present invention, the switching pattern within the subset PG [ s ₁ , s ₂ , ..., s _k ] is a CELL ID function denoted by PG [ s ₁ , s ₂ , ..., s _k ] = e ( c _ id ). Therefore, for another c _ id, we can have a different parameter vector PG [ s ₁ , s ₂ , ..., s _k ].

For example, we can divide OC / CS resources, as shown in Table 2, into three subsets in each interval. In this example, each subset corresponds to all combined resources on the same OC code. Three subsets in the interval No. 1 are set as G1 [1] = { CB ₁ [1], ... CB ₁ [6]}, Gl [2] = { CB ₁ [7], ..., CB ₁ [12 ]} and G1 [3] = { CB ₁ [13], ..., CB ₁ [18]}. The subsets in interval # 2 are similarly defined as G2 [l], G2 [2], and G2 [3]. Now we denote PG [2,3,1] as the distribution of resources known in the subset that allocates resources in the subsets G1 [2] -G2 [l], the subsets G1 [3] -G2 [2] and the subsets Gl [1] - G2 [3], etc. Similarly, we can define PG [1,3,2], PG [2,1,3], PG [3,1,2], PG [3,2,1]. A few examples of the function g ( i , PG [.]), Which links the combined resources of CB ₁ [ i ] in the first interval and CB ₂ [ w ( i, PG [.])] In the second interval, are given in Table 10.

Table 10
Example of switching resources known in a subset Resource Index in the Second Interval
w (i, PG [.]) Resources in the first interval, i one 2 3 four 5 6 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 eighteen PG [1,3,2] one 2 3 four 5 6 13 fourteen fifteen 16 17 eighteen 7 8 9 10 eleven 12 PG [2,1,3] 7 8 9 10 eleven 12 one 2 3 four 5 6 13 fourteen fifteen 16 17 eighteen PG [3,1,2] 13 fourteen fifteen 16 17 eighteen one 2 3 four 5 6 7 8 9 10 eleven 12 PG [3,2,1] 13 fourteen fifteen 16 17 eighteen 7 8 9 10 eleven 12 one 2 3 four 5 6 PG [2,3,1] 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 eighteen one 2 3 four 5 6

2.4. Combining redistribution between subsets and switching between subsets

In a sixth embodiment consistent with the principles of the present invention, a combination of redistribution between subsets and switching between subsets described in previous embodiments is proposed. If the resource in the first interval is denoted as CB ₁ [ i ], then after the redistribution, the resource is denoted as CB ₂ [ g ( w ( i , PG [ s ₁ , s ₂ , ... s _k ]), n )] (or briefly CB ₂ [ g ( w ( i , PG [.]), N )]) in the second interval. Note that we use the combined function g ( w ( i , PG [.]), N ) to indicate the combined work of switching between subsets and permutations between subsets. Here PG [ s ₁ , s ₂ , ... s _k ] is a sample of switching between subsets, and n = [ n ₁ , ..., n _k ] is the vector of redistribution parameters between subsets. This applies in both cases where the permutation function g (., N ) between subsets is based on GF or based on PBRO, as defined in Section 2.3.

In a first embodiment of a sixth embodiment according to the principles of the present invention, a switching pattern between subsets PG [ s ₁ , s ₂ , ..., s _k ] and / or a parameter vector n = [ n ₁ , ..., n _k ] are the same for all cells. The parameters PG [ s ₁ , s ₂ , ... s _k ] and n = [ n ₁ , ..., n _k ] can be communicated to the UE by higher level signaling.

In a second embodiment of the sixth embodiment according to the principles of the present invention, a switching pattern between the subsets PG [ s ₁ , s ₂ , ..., s _k ] and / or the parameter vector n = [ n ₁ , ..., n _k ] are CELL ID functions, denoted as PG [ s ₁ , s ₂ , ..., s _k ] = e ( c _ id ) and n = f ( c _ id ). Therefore, for another c _ id, we can have another example of switching between the subsets PG [ s ₁ , s ₂ , ..., s _k ] and / or the parameter vector n = [ n ₁ , ..., n _k ].

Table 11 below shows how permutations between subsets can be combined with switching between subsets using the same 18-resource example as shown in Table 2. In this example, we used CF-based permutation between subsets:

(18) g ( i , n ) = g _k ( i _{k, c} , n _k ) = i _{k, d} , for k , c , so i = i _{k, c} and

(eighteen)

(19) d = P _{G, 3} ( c , n _k , N _k ) = mod (c × n _k , N _k + l)

(19)

Note that N ₁ = N ₂ = N ₃ = 6 in this example, where 18 combined resources are divided into 3 subsets.

Table 11
An example of resource reallocation with permutations between subsets and switching between subsets Resource Index in the Second Interval
g (w (i, PG [.]), n) Resources in the first interval, i one 2 3 four 5 6 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 eighteen PG [1,3,2], n = [1,2,3] one 2 3 four 5 6 fifteen eighteen fourteen 17 13 16 8 10 12 7 9 eleven PG [1,3,2], n = [2,2,2] 8 10 12 7 9 eleven 2 four 6 one 3 5 fourteen 16 eighteen 13 fifteen 17

2.5. Combining OC / CS Resource Redistribution Patterns with Cell-specific CS Hopping

In a seventh embodiment consistent with the principles of the present invention, we propose combining the OC / CS aggregated permutation methods at the interval level described above in Sections 2.1-2.4 with the symbol level hopping CS resource mapping for specific cells indicated by h_sym ( c_id , s_id , l_id ), where the CELL ID is denoted as c_id , the subframe ID is denoted as s_id and the OFDM symbol ID is the long block inside the subframe is denoted as l_id . An additional step of hopping for a particular cell is performed by cyclic shifting the CS resource on a particular OFDM symbol by the value indicated as h_sym ( c_id , s_id , l_id ).

In an eighth embodiment consistent with the principles of the present invention, we propose to combine the symbol level CS permutation methods described in Sections 2.1-2.4 above with the interval level CS resource hopping scheme for specific cells denoted by h_slot ( c_id , sl_id ), where the CELL ID is indicated as c_id , the interval ID is indicated as sl_id . An additional step of hopping for a particular cell is performed by cyclic shifting the CS resource on a particular OFDM symbol by the value indicated as h _ slot ( c _ id , sl _ id ).

In the seventh and eighth embodiments, we further describe in detail how to combine permutations of the combined OC / CS resources and hopping for specific cells. Let the possible CS values in all the combined OC / CS resources during the discussion be K and K is also the maximum value of the hopping. Let CB ₁ [i] = { OC ₁ [ u _i ], CS ₁ [ v _i ]} be the combined resource in the first interval and let CB ₁ [ i ] = { OC ₁ [ u _i ], CS ₁ [ v _i ] } binds / redistributed with CB ₂ [ j ] = { OC ₂ [ u _j ], CS ₂ [ v _j ]} in the second interval in accordance with any of the permutation methods described in sections 2.1-2.4. Then, if symbol-level hopping is used for specific cells in the seventh embodiment, the i CS index in the first subframe interval will hop-hop for the cyclic_shift index ( v _i , h _ sym ( c _ id , s _ id , l _ id ) , K ) for the OFDM symbol with index l _ id , and index j CS in the second interval of the subframe will hop over to cyclic_ shift ( v _j , h _ sym ( c _ id , s _ id , l _ id ), K ) Similarly, if interval-level hopping is used for specific cells in the seventh embodiment, the i CS index in the first interval of the subframe will hop-hop to the cyclic_shift index ( v _i , h _ slot ( c _ id , sl _ id ,), K ) for OFDM symbol having index l_id ; and the index j CS in the second interval of the subframe will hop over to cyclic_ shift ( v _j , h _ slot ( c _ id , sl _ id ), K ).

Note that the cyclic shift operation is defined as follows:

(20) cyclic _ shift ( a , b , N ) = mod ( a + b -1, N ) +1

(twenty)

if N resources are indexed as 1,2, ..., N (this is a ubiquitous case for this document). On the other hand, if N resources are indexed as 0,1,2, ..., N -1, then the cyclic shift operation is defined as follows:

(21) cyclic _ shift ( a , b , N ) = mod ( a + b , N )

(21)

3. Redistribution of resources at the symbol level and at the level of intervals for resources with a cyclic shift

Assignment / reallocation of CS resources is applied in the following cases:

An uplink control RB that contains only channel quality indicator (CQI) channels;

An uplink control RB, which contains both CQI channels and ACK / NACK channels;

An uplink control RB that contains only ACK / NACK channels. Note that the uplink service request channel may reuse the uplink ACK / NACK channel structure.

3.1. Character level CS redistribution

In the ninth embodiment, consistent with the principles of the present invention, we propose linking the CS resources in such a way that if any UE channel (eg, CQI, ACK / NACK) is allocated to the CS GS ₁ [ m ] resource in the first OFDM symbol ( l _ id = 1), then it should be assigned CS _{l_id} [t (m, l_id, n)] in OFDM symbols, where l _ id > 1, where t ( m , l _ id , n) is a pseudo-random resource reallocation / permutation function, which is a function of the index m of the input resource, the index l _ id of the OFDM symbol, and the parameter n , which is an integer. Note that m = 1,2, ..., M and M is the total number of CS resources in each OFDM symbol.

Additionally, when applying to UL A / N (or providing a service), the symbol level CS redistribution can be combined with the OC redistribution at the slot level or the OC hopping. Redistributing OC at the interval level is very simple compared to redistributing OC / OS combined resources at the interval level, which was discussed throughout the document, except that the resource redistributed from one interval to the next is only an OC resource, not a combined OC resource / OS. OC hopping has the same meaning as CS hopping in this context.

We note this by defining t ( m , l _ id , n ) = m for l _ id = 1 for the first OFDM symbol in question.

In a first embodiment of the ninth embodiment, consistent with the principles of the present invention, the pseudo-random permutation function is described as follows:

(22) t ( m , l _ id , n ) = P _G ( m , r ( l _ id , n , M ), M ), for l _ id > 1

(22)

where r ( l _ id , n , M ) = mod ( l _ id + nl, M ) + l. The permutation / redistribution function P _G (m, r, M) based on the Galois field is defined in the previous section.

In a second embodiment of the ninth embodiment, consistent with the principles of the present invention, the pseudo random permutation function uses the PBRO function as follows:

t ( m , l _ id , n ) = PBRO (mod ( m + l _ id + n -1, M ) +1, M ), for l _ id > 1 (23)

The function PBRO ( a , b ) is defined in the introduction.

In a third embodiment of the second embodiment, consistent with the principles of the present invention, the parameter n in the above two embodiments is the same for all cells. Parameter n may be reported to the UE by higher layer signaling.

In a fourth embodiment of the second embodiment, consistent with the principles of the present invention, the parameter n is a CELL ID function denoted as n = f ( c _ id ). Therefore, for another c _ id we will have a different parameter n .

One example of such a function is n = mod ( c _ id -1, N ) +1.

As an example, here we consider the case where in each uplink OFDM symbol there are 6 resources or M = 6 and there are eight OFDM uplink symbols, that is, L = 8. Further, for example, let n = 0 and t ( m , l _ id , n ) = P _{G, 3} ( m , r ( l _ id , 0,6), 6). We note here that we can use the function P _{G, 3} (.,.,.) Defined earlier, since M + 1 = 7 and GF (7) is the main Galois field. Linking / redistributing resources as a function of the OFDM symbol index, l _ id , is shown in Table 12 below. Here, parameter n is selected to be 0.

Table 12
An example of CS resource reallocation as a function of an OFDM symbol identifier. M = 6, L = 8 Redistributed Resource Index CS t ( m , l _ id , 0) l_id = 1 l_id = 2 l_id = 3 l_id = 4 l_id = 5 l_id = 6 l_id = 7 l_id = 8 M = 1 one 2 3 four 5 6 one 2 2 2 four 6 one 3 5 2 four 3 3 6 2 5 one four 3 6 four four one 5 2 6 3 four one 5 5 3 one 6 four 2 5 3 6 6 5 four 3 2 one 6 5

3.2. Interval level CS redistribution

In a tenth embodiment in accordance with the principles of the present invention, we propose linking the CS resources in such a way that if any UE channel (eg, CQI, ACK / NACK) is allocated to the CS GS ₁ [ m ] resource in the first interval, then the channel should be assigned CS ₂ [ g ( m , n )] in the second interval, where g ( m , n ) is a pseudo-random resource redistribution / permutation function, which is a function of the input resource index m and parameter n , which is an integer.

We further note that when applying to the A / N channel UL (or providing a service), the redistribution of the CS at the interval level can be combined with the redistribution of the OC at the interval level or the hopping of the OC at the interval level.

In a first embodiment of the tenth embodiment, consistent with the principles of the present invention, the pseudo-random permutation function is described as follows:

(24) g ( m , n ) = P _G ( m , n , M )

(24)

where n is selected from the set [1, M ] or n = l, ..., M. The function P _G ( m , n , M ) is defined in the previous section.

In a second embodiment of the tenth embodiment, consistent with the principles of the present invention, the pseudo-random permutation function uses the PBRO function as follows:

(25) g ( m , n ) = PBRO (mod ( m + n -1, M ) + l, M )

(25)

The function PBRO (a, b) is defined in the introduction.

In the third embodiment, the tenth embodiment corresponding to the principles of the present invention, the parameter n in the above two embodiments is the same for all cells. Parameter n may be reported to the UE by higher layer signaling.

In a fourth embodiment of the tenth embodiment, consistent with the principles of the present invention, the parameter n is a CELL ID function designated as n = f ( c _ id ). Therefore, for another c _ id we will have a different parameter n . One example of such a function is n = mod ( c _ id -1, M ) +1.

We consider below an example for M = 6 with n = 1,2,3,4.

Table 13
Example of CS redistribution at the interval level for M = 6 m one 2 3 four 5 6 G (m, n), n = 1 one 2 3 four 5 6 G (m, n), n = 2 2 four 6 one 3 5 G (m, n), n = 3 3 6 2 5 one four G (m, n), n = 4 four one 5 2 6 3 G (m, n), n = 5 5 3 one 6 four 2 G (m, n), n = 6 6 5 four 3 2 one

The application of slot redistribution of CS to the assigned uplink RB for dedicated CQI or A / N channels is understandable and therefore we do not provide further explanations. On the other hand, the application of slot redistribution of CS in the mixed uplink RB of the CQI and A / N channels is less obvious and below we give an example showing how this works.

Here we show an example of how to apply slotted CS redistribution in the case of mixed ACK / NACK and CQI channels within a single RB (12 subcarriers). Here, the total number of CSs used by the ACK / NACK and CQI channels is 8 (M = 8) and there are a total of 8 ACK / NACK channels sharing 5 CS, and three CQI channels sharing 3 CS. The CS redistribution function used in this example is g ( m , n ) with n = 2. Note that since M + l = 9, GF (9) = GF (3 ² ) is a Galois field, but not the main Galois field. Nonzero elements of GF (9) are given below in table 14.

Table 14
GF Elements (9) Exhibitor Format α ⁰ α ¹ α ² α ³ α ⁴ α ⁵ α ⁶ α ⁷ Vector format (three digits) [least significant digit] [most significant digit] [1,0] [0,1] [1,1] [1,2] [2.0] [0.2] [2.2] [2,1] Natural number format one 3 four 7 2 6 8 5

The distribution table g (m, n) for n = 2 is given below for M = 8 with GF (9) and g ( m , n ) = P _{G, 1} ( m , n , M ) = P _{G, 1} ( m , 2.8), where P _{G, 1} ( m , n , M ) is defined in section 1.

Table 15 (a)
Redistribution of CS with g (m, 2), M = 8 m one 2 3 four 5 6 7 8 g (m, n), n = 2 3 6 four 7 one 8 2 5

Alternatively, we can use a method based on the truncated main field GF, g ( m , n ) = P _{G, 4b} ( m , n , M ) = P _{G, 4b} ( m , 2,8), to create the following table.

Table 15 (b)
Redistribution at the level of intervals with g ( i , n ), N = 8, n = 2 M one 2 3 four 5 6 7 8 g (m, n), n = 2 2 four 6 8 one 3 5 7

We will continue to show how the reallocation of CS resources in the table below. Note that there are M = 8 CS and redistribution takes place only within this set of "used" CS. We applied the CS redistribution rules used in table 15 (a) above to get the table below. Note how a single A / N channel or CQI channel can be redistributed to different areas in the OC / CS table.

Table 16
Redistribution of CS in uplink RB for mixed CQI and ACK / NACK The combined resources of OC / CS in the interval No. 1 - CB ₁ [] (ACK / NCK)
CS in the interval No. 1-CS _{1, CQI} [] (CQI) The combined resources of OC / CS in the interval No. 1 - CB ₂ [] (ACK / NCK)
CS in the interval No. 1-CS ₂ [] (CQI) The value of the cyclic shift [used CS] OC ₁ [1] OC ₁ [2] OC ₁ [3] OC ₂ [1] OC ₂ [2] OC ₂ [3] 0 = [1] A / N No. 1 A / N No. 6 A / N No. 3 A / N No. 8 1 [2] A / N No. 4 CQI No. 2 2 [3] A / N No. 2 A / N No. 7 A / N No. 1 A / n Number 6 3 [4] A / N No. 5 A / N No. 2 A / N No. 7 4 [5] A / N No. 3 A / N No. 8 CQI No. 3 5-- A / N No. 4 6 [6] CQI No. 1 7-- A / N No. 5 8- [7] CQI No. 2 9-- 10- [8] CQI No. 3 CQI No. 1 eleven--

3.3. An alternative way to reallocate resources in the case of mixed CQI and ACK / NACK

In table 16 you can see that the four channels A / N, A / N No. 1,2,6,7 are assigned to the neighboring CS, after which the joint CS is redistributed over the CQI and A / N channels. This may impair A / N performance. In this subsection, we propose an alternative approach to resource reallocation in the case of mixed CQI and ACK / NACK.

In an eleventh embodiment in accordance with the principles of the present invention, we propose to divide the CS common resources within one RB into two parts, one part is allocated to the CQI channel, and the other part to the ACK / NACK (or service request) channel. The distribution is fixed at two sub-frame intervals. In addition, within the CS portion assigned to the CQI channel, both symbol level CS redistribution proposed in Section 3.1 and slot interval CS redistribution proposed in Section 3.2 can be applied. On the other hand, within the CS resources allocated to the A / N channels of the uplink (or service request), we can apply any of the following: (a) joint reallocation at the interval level of the joint OC / CS, described in sections 2.1-2.4; (b) symbol level CS redistribution described in section 3.1; (c) the co-distribution of CS at the interval level described in section 3.2.

We again use the example with eight A / N channels and three CQI channels, shown in Table 16, to demonstrate this alternative approach. Additionally, in this example, we use the global OC / CS redistribution at the interval level (section 2.1) for the A / N part and use the interval level CS redistribution for the CQI part. From table 17 it is clear that the CS resources assigned to the A / N part and the CQI part remain the same in interval No. 1 and interval No. 2.

Table 17
An example of an alternative method of reallocating resources in uplink RB with mixed CQI and ACK / NACK The combined resources of OC / CS in the interval No. 1 - CB ₁ [] (ACK / NCK)
CS in the interval No. 1-CS _{1, CQI} [] (CQI) The combined resources of OC / CS in the interval No. 1 - CB ₂ [] (ACK / NCK)
CS in the interval No. 1-
CS ₂ [] (CQI) Cyclic shift value [used cs] OC ₁ [1] OC ₁ [2] OC ₁ [3] OC ₂ [1] OC ₂ [2] OC ₂ [3] 0 = [1] CB ₁ [1] CB ₁ [6] CB ₂ [1] CB ₂ [6] 1 [2] CB ₁ [4] CB ₂ [4] 2 [3] CB ₁ [2] CB ₁ [7] CB ₂ [2] CB ₂ [7] 3 [4] CB ₁ [5] CB ₂ [5] 4 [5] CB ₁ [3] CB ₁ [8] CB ₂ [3] CB ₂ [8] 5-- 6 [6] CS _{1, CQI} [1] CS _{2, CQI} [1] 7-- 8- [7] CS _{1, CQI} [2] CS _{2, CQI} [2] 9-- 10- [8] CS _{1, CQI} [3] CS _{2, CQI} [3] eleven--

In addition, for A / N channels (or service provisioning), if the combined resource CB ₁ [ i ] is assigned to the A / N channel in the first interval, then CB ₂ should be assigned to the A / N channel [ g ( i , n )] in the second interval. Let n = 2. In one example, g ( i , n ), let g ( i , n ) = P _{G, 1} ( i , 2,8) (note that in this example, N = 8, indicating that there are only 8 OC / CS combinations for channel A / N and GF (9)). The distribution table is the same as table 15 (a) or 15 (b) if we replace m with i and M with N.

For A / N channels, on the other hand, if a CS ₁ [ m ] resource is assigned to the CQI channel in the first interval, then CS ₂ [ g ( m , n )] in the second interval should be assigned to the CQI channel. Similarly, let n = 2. In one example, g ( m , n ), let g ( m , n ) = P _{G, 1} ( m , 2,3) (note that in this example M = 3, indicating that there are only 3 CS resources for channel A / N and GF (4)). For brevity, the distribution table is omitted here.

3.4. Combining CS resource allocation and hopping for specific cells

In a twelfth embodiment consistent with the principles of the present invention, it is proposed to combine the symbol level CS permutation methods described in the previous embodiment with the symbol level CS resource hopping scheme for specific cells denoted by h_sym ( c _ id , s _ id , l _ id ), where the CELL ID is denoted by c _ id , the subframe ID is denoted by s _ id, and the OFDM symbol identifier (long block) is denoted by l _ id . An additional step of hopping for a particular cell is performed by cyclic shifting the CS resource on a particular OFDM symbol by the value indicated as h_sym (c_id, s_id, l_id).

In a thirteenth embodiment, consistent with the principles of the present invention, it is proposed to combine the symbol level CS permutation methods described in the previous embodiment with the slot level CS resource hopping scheme for specific cells, denoting it as h _ slot ( c _ id , sl _ id ), where CELL ID is indicated as c _ id , interval ID is indicated as sl _ id . An additional step of hopping for a particular cell is performed by cyclic shifting the CS resource on a particular OFDM symbol by the value indicated as h _ slot ( c _ id , sl _ id ).

We further describe in detail how to combine symbol level permutations of the combined CS resources and cell hopping described in the two embodiments above. Let the number of resources in the discussion be K, and K is also the maximum value of hopping. Let CS _{l_id} [ t ( m , l _ id , n )] denote the CS resource of the l _ id OFDM symbol in accordance with the symbol level redistribution algorithms discussed previously. Then, if hopping is used for specific cells at the symbol level, the CS index will hop hopping to cyclic_ shift ( t ( m , l _ id , n ), h _ sym ( c _ id , s _ id , l _ id ) , K ) for the symbol l _ id OFDM. Similarly, if hopping is used for specific cells at the interval level, the CS index in the first interval will jump-hop into cyclic_ shift ( t ( m , l _ id , n ), h _ slot ( c _ id , sl _ id ), K ) for the OFDM symbol index on l _ id in the interval indexed as sl _ id .

The description of combining CS resource reallocation at the slot level and hopping for specific cells at the symbol or slot level is similar and is omitted for brevity.

4. Creating a CS hopping scheme for specific cells at the interval or symbol level

Let the maximum number of hopping values be denoted by K.

In the fourteenth embodiment, in accordance with the principles of the present invention, we provide an example of a basic sequence for specific cells at the interval level with a period K of consecutive intervals. We propose a hopping scheme for specific cells at the interval level such that:

(26) h_slot ( c_id , sl_id ) = P _G ( sl_id , r ( c_id, n, K ), K )

(26)

or,

h_slot ( c_id , sl_id ) = PBRO (mod ( sl_id + c_id + n -1, K ) +1, K ) (27)

where the function r is defined as r ( c_id, n, K ) = mod ( c_id -1, + n -1, K ) +1. Note that sl_id = 1, ..., K is the interval index for the interval within K consecutive intervals, n is a parameter representing an integer, and c_id means the cell identifier CELL ID.

The permutation / redistribution function P _G ( c_id , r, К ) based on the Galois field is defined in Section 1. The PBRO function is defined earlier.

For example, if there are twelve subcarriers in the LTE uplink control channel PUCCH, then the maximum hopping is K = 12.

Further, for example, let n = 0 and let h_slot ( c_id , sl_id ) = P _{G, 3} ( sl_id , r ( c_id, 0.12), 12) = mod ( sl_id × r ( c_id , 0.12), 13 ) We note here that we can use the function P _{G, 3} (.,.,.) Defined earlier, since 12 + 1 = 13 and GF (13) is the main Galois field.

Again, let the maximum number of hop values be denoted by K. Additionally, let L denote the number of OFDM symbols of interest within the subframe.

In the fifteenth embodiment, consistent with the principles of the present invention, we propose a sample base sequence for specific cells at the interval level, which is repeated in each subframe, that is, it is not a function of the identifier of the subframe.

Denoting s _ id as the identifier of a subframe, we propose a hopping scheme for specific cells at the interval level, such that:

h_sym ( c_id , s_id , l_id ) = P _G ( x ( l_id , K ), r ( c_id , n , K ), K ), (28)

or

h_sym ( c_id , s_id , l_id ) = PBRO (mod ( l_id + c_id + n -l, K ) +1, K ), (29)

where the function x and r is defined as x ( l_id, K ) = mod ( l_id -1, K ) +1 and r ( c_id , n , K ) = mod ( c_id + n -1, K ) +1.

Note that l_id , ..., L is the OFDM symbol identifier (long block), n is an integer parameter, s_id is the subframe identifier, and c_id is the cell identifier, CELL ID.

The permutation / redistribution function P _G ( x, r, K ) based on the Galois field is defined in the previous section.

The PBRO function is defined in the introduction.

For example, if there are twelve subcarriers in the LTE uplink control channel PUCCH, then the maximum hopping is K = 12.

Further, for example, let n = 0 and let h_sym ( c_id , s_id, l_id ) = P _{G, 3} ( x (l_id , 12) r ( c_id, 0.12), 12) = mod ( x (l_id, 12) x r ( c_id , 0.12), 13). We note here that we can use the function P _{G, 3} (.,.,.) Defined earlier, since 12 + 1 = 13 and GF (13) is the main Galois field.

5. Creating a jump sequence of the base sequence at the level of subframes or at the level of intervals

In a sixteenth embodiment in accordance with the principles of the present invention, let there be a total of Z base sequences for uplink communication. Further, we propose a hopping scheme for the base sequence at the subframe level with a period Z of consecutive subframes. In addition, for a given cell, let BS ₁ [z] = z be the base sequence index in the first subframe within the same period Z of consecutive subframes, then the base sequence index used in consecutive subframes in the same cell is denoted as BS _{s_ld} [ s ( z, s_id, n )]. Here z = l, ..., Z , s_id = l, ..., Z and n is a parameter that is an integer. Note that s_id means a subframe identifier within a period Z of subframes.

In a sub-embodiment of the sixteenth embodiment corresponding to the principles of the present invention, the pseudo-random permutation function s ( z , s _ id , n ) is described as follows:

(30) s ( z , s_id , n ) = P _G ( z , r ( s_id , n , Z ), Z )

(thirty)

or

(31) s ( z, s_id, n ) = PBRO (mod ( z + s_id + n -1, Z ) +1, Z )

(31)

where the function r is defined as r ( s_id, n, Z ) = mod ( s_id -1, + n -1, Z ) +1. The permutation / redistribution function P _G ( z, r, Z ) based on the Galois field is defined in the previous section. The PBRO (.,.) Function is defined in the introduction.

For example, if there are thirty base sequences in a cellular system, then Z = 30. Then, for example, let n = 0 and let s (z, s_id, n) = PG, 3 (z, r (s_id, 0.30), 30) = mod (z × s_id, 31). We note here that we can use the function P _{G, 3} (.,.,.) Defined earlier, since Z + 1 = 13 and GF (31) is the main Galois field.

Within one subframe, uplink transmission may include several slots. For example, in 3GPP LTE, there may be 2 slots within each subframe in the uplink.

In the seventeenth embodiment, consistent with the principles of the present invention, let there be a total of Z base sequences for uplink communication. Further, we propose a hopping scheme for the base sequence at the interval level with a period Z of consecutive intervals. In addition, for a given cell, let BS ₁ [z] = z be the index of the base sequence in the first interval within the same period Z of consecutive intervals, then the index of the base sequence used in consecutive intervals in the same cell is _denoted as BS _{s_id} [ s ( z, s_id, n )]. Here z = l, ..., Z , s_id = l, ..., Z and n is a parameter that is an integer. Note that sl_id means the interval identifier within the period Z of the intervals.

In a sub-embodiment of the seventeenth embodiment, consistent with the principles of the present invention, the pseudo-random permutation function s ( z , sl _ id , n ) is described as follows:

(32) s ( z , sl_id , n ) = P _G ( z , r ( sl_id , n , Z ), Z )

(32)

or

(33) s ( z, sl_id, n ) = PBRO (mod ( z + sl_id + n -1, Z ) +1, Z )

(33)

where the function r is defined as r ( sl_id, n, Z ) = mod ( sl_id + n -1, Z ) +1. The permutation / redistribution function P _G ( z, r, Z ) based on the Galois field is defined in the previous section.

For example, if there are thirty base sequences in a cellular system, then Z = 30. Then, for example, let n = 0 and let s ( z, sl_id, n ) = P _{G, 3} ( z, r ( sl_id , 0.30), 30) = mod ( z × sl_id , 31). We note here that we can use the function P _{G, 3} (.,.,.) Defined earlier, since Z + 1 = 31 and GF (31) is the main Galois field. The PBRO (.,.) Function is defined in the introduction.

In the eighteenth embodiment, consistent with the principles of the present invention, the uplink physical control channel supports the multiple formats shown in Table 18. Formats 2a and 2b are only supported for the regular cyclic prefix.

Table 18
Supported PUCCH Formats PUCCH format Modulation scheme The number of bits per subframe, M _bit one not used not used 1a Bpsk one 1b QPSK 2 2 QPSK twenty 2a QPSK + BPSK 21 2b QPSK + QPSK 22

The resource indices within two resource blocks at two intervals of a subframe in which the PUCCH is displayed are determined by the expression:

for n _s mod2 = 0 and the expression:

for n _s mod2 = 1.

означает индекс ресурса,

означает номер использованного циклического сдвига для форматов 1/la/lb PUCCH в блоке ресурсов, использованном для смеси форматов 1/1a/1b и 2/2a/2b и

является количеством, установленным более высокими уровнями и представляется следующим образом:In the above equations, n _s means the number of the interval,

means a resource index,

means the used cyclic shift number for the 1 / la / lb PUCCH formats in the resource block used for the mixture of 1 / 1a / 1b and 2 / 2a / 2b formats and

is the quantity set by higher levels and is presented as follows:

and

, из которого циклический сдвиг α определяется согласно выражению:Resources used for transmitting 2 / 2a / 2b PUCCH formats are identified by a resource index

, from which the cyclic shift α is determined according to the expression:

(38)α ( n _s ) = 2π × n _CS ( n _s ) /

(38)

Where

for n _s mod2 = 0 and according to the expression:

for n _s mod2 = 1.

Appendix: Alternative OC / CS resource allocation for N = 18 resources (excerpt from link [6])

Table 19
Alternative OC / CS Resource Allocation Scheme for N = 18 Cyclic shift index Walsh Sequence Index 0 one 2 3 0 0 fifteen one 16 four 2 3 one 12 four 17 5 5 9 6 2 13 7 6 8 10 9 3 fourteen 10 7 eleven eleven

Although the above explanation of the principles of the present invention has been shown and described in detail in connection with preferred embodiments, it will be apparent to those skilled in the art that modifications and changes can be made without departing from the spirit and scope of the invention as defined in the attached claims inventions.

Claims (36)

1. A method for transmitting data in a communication system, comprising the steps of:
modulate the data to be transmitted to form modulated data,
selecting a first resource to be used at the first time based on the index function of the first time,
selecting a second resource to be used in the second time based on a second time index function,
distributing modulated data in the selected first resource and in the selected second resource in the first time and second time, respectively, and
transmit modulated data at each of the first time and second time,
wherein the first resource and the second resource are at least one of the orthogonal code and the cyclic shift of the base sequence,
wherein each of the first time and second time is set based on one of a symbol level and an interval level, and
wherein the interval consists of at least one character. 2. The method according to claim 1, wherein when the modulated data to be transmitted is acknowledgment data and non-acknowledgment data (ACK / NACK), the resource is an orthogonal code and a cyclic shift of the base sequence. 3. The method of claim 1, wherein when the modulated data to be transmitted is channel quality indicator (CQI) data, the resource is a cyclic shift of the base sequence. 4. The method according to claim 1, in which the cyclic shift of the base sequence is set at the character level or level of the interval based on the index of the symbol or index of the interval, respectively. 5. The method according to claim 1, in which the orthogonal code is set at an interval level based on the index of the interval. 6. The method according to claim 1, in which the selection of the second resource to be used in the second time is based on the first time index and the second time index. 7. The method according to claim 1, in which the selection of the first resource to be used at the first time, and the selection of the second resource to be used at the second time, based on the value of the total resource associated with the corresponding time index. 8. The method of claim 1, wherein when the shared resource is shared by CQI transmission and ACK / NACK transmission, the shared resource is divided into a part for CQI transmission and a part for ACK / NACK transmission. 9. The method of claim 8, in which the resource for transmitting CQI and the resource for transmitting ACK / NACK are selected from the part for transmitting CQI and the part for transmitting ACK / NACK, respectively, at each respective time. 10. A device for transmitting data in a wireless communication network, comprising:
transmitter chain configured to:
modulating the data to be transmitted to generate modulated data,
selecting a first resource to be used in the first time based on the index function of the first time,
selecting a second resource to be used at a second time based on a second time index function,
distributing the modulated data in the selected first resource and in the selected second resource in the first time and second time, respectively, and
transmitting modulated data at each of a first time and a second time,
wherein the first resource and the second resource are at least one of the orthogonal code and the cyclic shift of the base sequence,
wherein each of the first time and second time is set based on one of a symbol level and an interval level, and
wherein the interval consists of at least one character. 11. The device of claim 10, wherein when the modulated data to be transmitted is acknowledgment data and non-acknowledgment data (ACK / NACK), the resource is an orthogonal code and a cyclic shift of the base sequence. 12. The apparatus of claim 10, wherein when the modulated data to be transmitted is channel quality indicator (CQI) data, the resource is a cyclic shift of the base sequence. 13. The device of claim 10, in which the cyclic shift of the base sequence is set at the character level or level of the interval based on the index of the character or index of the interval, respectively. 14. The device of claim 10, in which the orthogonal code is set at an interval level based on the index of the interval. 15. The device of claim 10, in which the chain of the transmitter is configured to select a second resource to be used in the second time, based on the index of the first time and the index of the second time. 16. The device of claim 10, in which the transmitter chain is configured to select a first resource to be used at the first time, and to select a second resource to be used at the second time, based on the total resource associated with the corresponding time index. 17. The device according to claim 10, in which when the shared resource is shared by CQI transmission and ACK / NACK transmission, the shared resource is divided into a part for CQI transmission and a part for ACK / NACK transmission. 18. The device according to 17, in which the resource for transmitting CQI and the resource for transmitting ACK / NACK are selected from the part for transmitting CQI and the part for transmitting ACK / NACK, respectively, at each respective time. 19. A method of receiving data in a communication system, comprising the steps of:
receiving modulated data distributed in the first resource at the first time, wherein the first time is based on the index function of the first time, and
receiving modulated data distributed in a second resource at a second time, wherein the second time is based on a second time index function,
wherein the first resource and the second resource are at least one of the orthogonal code and the cyclic shift of the base sequence,
wherein each of the first time and second time is set based on one of a symbol level and an interval level, and
wherein the interval consists of at least one character. 20. The method of claim 19, wherein when the received data is acknowledgment data and non-acknowledgment data (ACK / NACK), the resource is an orthogonal code and a cyclic shift of the base sequence. 21. The method according to claim 19, wherein when the received data is channel quality indicator (CQI) data, the resource is a cyclic shift of the base sequence. 22. The method according to claim 19, in which the cyclic shift of the base sequence is set at the character level or level of the interval based on the index of the character or index of the interval, respectively. 23. The method according to claim 19, in which the orthogonal code is set at an interval level based on the index of the interval. 24. The method of claim 19, wherein the second resource used in the second time is based on the first time index and the second time index. 25. The method according to claim 19, in which the first resource used in the first time and the second resource used in the second time are selected based on the value of the total resource associated with the corresponding time index. 26. The method of claim 19, wherein when the shared resource is shared by CQI transmission and ACK / NACK transmission, the shared resource is divided into a part for CQI transmission and a part for ACK / NACK transmission. 27. The method of claim 26, wherein the resource for transmitting the CQI and the resource for transmitting the ACK / NACK are selected from the part for transmitting the CQI and the part for transmitting the ACK / NACK, respectively, at each respective time. 28. A device for receiving data in a wireless communication network, comprising:
receiver chain configured to:
receiving modulated data distributed in the first resource for the first time, wherein the first time is based on a first time index function, and
receiving modulated data distributed in a second resource at a second time, wherein the second time is based on a second time index function,
wherein the first resource and the second resource are at least one of the orthogonal code and the cyclic shift of the base sequence,
wherein each of the first time and second time is set based on one of a symbol level and an interval level, and
wherein the interval consists of at least one character. 29. The apparatus of claim 28, wherein when the received data is acknowledgment data and non-acknowledgment data (ACK / NACK), the resource is an orthogonal code and a cyclic shift of the base sequence. 30. The apparatus of claim 28, wherein when the received data is channel quality indicator (CQI) data, the resource is a cyclic shift of the base sequence. 31. The device according to p, in which the cyclic shift of the base sequence is set at the character level or level level based on the index of the character or index of the interval, respectively. 32. The device according to p, in which the orthogonal code is set at the interval level based on the index of the interval. 33. The device according to p, in which the second resource used in the second time is based on the index of the first time and the index of the second time. 34. The device according to p. 28, in which the first resource used in the first time, and the second resource used in the second time, based on the value of the total resource associated with the corresponding time index. 35. The apparatus of claim 28, wherein when the shared resource is shared by CQI transmission and ACK / NACK transmission, the shared resource is divided into a part for CQI transmission and a part for ACK / NACK transmission. 36. The apparatus of claim 35, wherein the resource for transmitting the CQI and the resource for transmitting the ACK / NACK are selected from the part for transmitting the CQI and the part for transmitting the ACK / NACK, respectively, at each respective time.

Images