Method and apparatus for transmitting uplink signal, and method and apparatus for generating uplink signal in communication system

Method and apparatus for transmitting uplink signal, and method and apparatus for generating uplink signal in communication system
RE49539

When a terminal generates an uplink signal in a communication system, the terminal hops a sequence for differentiating itself from another terminal with time. The terminal generates the uplink signal by multiplying a transmission symbol by a sequence of a transmission time corresponding to the transmission symbol.

PTO Wrapper PDF
Dossier Espace Google

Patent RE49539
Priority Sep 01 2006
Filed Dec 02 2016
Issued May 30 2023
Expiry Aug 31 2027
Inventors Kim, Young…
Assg.orig Electronic…
Assg.curr Electronic…
Entity unknown
Referenced by 0
References 26
Maint.: currently ok

RELATED APPLICATIONS

1. A communication methodof transmitting an uplink signal at a terminal of a first user in a wireless communication system, the method comprising:

transmitting, by a user equipment (ue), a first sequence at a first transmission time, the first sequence being determined by based on a basic sequence and a first cyclic shift valueamong a plurality of cyclic shift values including the first cyclic shift value, a second cyclic shift value, a third cyclic shift value, and a fourth cyclic shift value; and

transmitting, by the ue, a second sequence at a second transmission time after the first transmission time, the second sequence being determined by based on the basic sequence and the a second cyclic shift value,

wherein at a terminal of a second user being different from the first user, a sequence determined by the basic sequence and the third cyclic shift value is transmitted at the first transmission time and a sequence determined by the basic sequence and the fourth cyclic shift value is transmitted at the second transmission time, and

wherein a difference between the second cyclic shift value and the first cyclic shift value is different from a difference between the fourth cyclic shift value and the third cyclic shift value when the third cyclic shift value is adjacent to the first cyclic shift value

wherein the first cyclic shift value and the second cyclic shift value are ue-specific.

0. 22. A communication apparatus, comprising:

a processor, and

a memory operably coupled to the processor,

wherein the memory stores program instructions which:

cause the communication apparatus to transmit a first sequence to a base station at a first transmission time, the first sequence being determined based on a basic sequence and a first cyclic shift value; and

cause the communication apparatus to transmit a second sequence to the base station at a second transmission time after the first transmission time, the second sequence being determined based on the basic sequence and a second cyclic shift value,

wherein the first cyclic shift value and the second cyclic shift value are ue-specific.

0. 28. A communication method, comprising:

receiving, from a first user equipment (ue), a first sequence at a first transmission time, the first sequence being determined based on a basic sequence and a first cyclic shift value; and

receiving, from the first ue, a second sequence at a second transmission time after the first transmission time, the second sequence being determined based on the basic sequence and a second cyclic shift value,

receiving, from a second ue, a third sequence at the first transmission time, the second ue being different from the first ue, and the third sequence being determined based on the basic sequence and a third cyclic shift value; and

receiving, from the second ue, a fourth sequence at the second transmission time, the fourth sequence being determined based on the basic sequence and a fourth cyclic shift value,

wherein, when the first cyclic shift value is equal to the third cyclic shift value plus one (1), the second cyclic shift value is not equal to the fourth cyclic shift value plus one (1).

0. 34. A communication apparatus, comprising:

a processor, and

a memory operably coupled to the processor,

wherein the memory stores program instructions which:

cause the apparatus to receive a first sequence from a first user equipment (ue) at a first transmission time, the first sequence being determined based on a basic sequence and a first cyclic shift value; and

cause the apparatus to receive a second sequence from the first ue at a second transmission time after the first transmission time, the second sequence being determined based on the basic sequence and a second cyclic shift value;

cause the apparatus to receive a third sequence from a second ue at the first transmission time, the second ue being different from the first ue, and the third sequence being determined based on the basic sequence and a third cyclic shift value; and

cause the apparatus to receive a fourth sequence from the second ue at the second transmission time, the fourth sequence being determined based on the basic sequence and a fourth cyclic shift value,

wherein, when the first cyclic shift value is equal to the third cyclic shift value plus one (1), the second cyclic shift value is not equal to the fourth cyclic shift value plus one (1).

2. The method of claim 1, wherein the second cyclic shift value is determined based on the first cyclic shift value, and the fourth cyclic shift value is determined based on the third cyclic shift value.

3. The method of claim 1, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

4. The method of claim 1, wherein the first sequence is given by cyclic-shifting the basic sequence by the first cyclic shift value in a time domain, and

the second sequence is given by cyclic-shifting the basic sequence by the second cyclic shift value in a time domain cyclic shift value is determined also based on a first symbol number of the first transmission time, and the second cyclic shift value is determined also based on a second symbol number of the second transmission time.

5. The method of claim 1, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c_odenotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 6. A method of receiving an uplink signal at a base station in a wireless communication system, the method comprising:

receiving a first sequence from a first terminal of a first user at a first transmission time, the first sequence being determined by a basic sequence and a first cyclic shift value among a plurality of cyclic shift values including the first cyclic shift value, a second cyclic shift value, a third cyclic shift value, and a fourth cyclic shift value;

receiving a second sequence from the first terminal at a second transmission time after the first transmission time, the second sequence being determined by the basic sequence and the second cyclic shift value;

receiving a third sequence from a second terminal of a second user at the first transmission time, the second user being different from the first user and the third sequence being determined by the basic sequence and the third cyclic shift value; and

receiving a fourth sequence from the second terminal at the second transmission time, the fourth sequence being determined by the basic sequence and the fourth cyclic shift value,

0. 7. The method of claim 6, wherein the second cyclic shift value is determined based on the first cyclic shift value, and the fourth cyclic shift value is determined based on the third cyclic shift value.

0. 8. The method of claim 6, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

0. 9. The method of claim 6, wherein the first sequence is given by cyclic-shifting the basic sequence by the first cyclic shift value in a time domain, and

the second sequence is given by cyclic-shifting the basic sequence by the second cyclic shift value in a time domain.

0. 10. The method of claim 6, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c_odenotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 11. An apparatus for transmitting an uplink signal at a terminal of a first user in a wireless communication system, the method comprising:

a mapper configured to generate a first sequence and a second sequence, the first sequence being determined by a basic sequence and a first cyclic shift value among a plurality of cyclic shift values including the first cyclic shift value, a second cyclic shift value, a third cyclic shift value, and a fourth cyclic shift value, and the second sequence being determined by the basic sequence and the second cyclic shift value; and

a transmitter configured to transmit the first sequence at a first transmission time and transmit the second sequence at a second transmission time after the first transmission time,

0. 12. The apparatus of claim 11, wherein the second cyclic shift value is determined based on the first cyclic shift value, and the fourth cyclic shift value is determined based on the third cyclic shift value.

0. 13. The apparatus of claim 11, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

0. 14. The apparatus of claim 11, wherein the first sequence is given by cyclic-shifting the basic sequence by the first cyclic shift value in a time domain, and

the second sequence is given by cyclic-shifting the basic sequence by the second cyclic shift value in a time domain.

0. 15. The apparatus of claim 11, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c_odenotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 16. An apparatus of receiving an uplink signal at a base station in a wireless communication system, the method comprising:

a first receiver configured to receive a first sequence from a first terminal of a first user at a first transmission time and receive a second sequence from the first terminal at a second transmission time after the first transmission time, the first sequence being determined by a basic sequence and a first cyclic shift value among a plurality of cyclic shift values including the first cyclic shift value, a second cyclic shift value, a third cyclic shift value, and a fourth cyclic shift value, and the second sequence being determined by the basic sequence and the second cyclic shift value; and

a second receiver configured to receive a third sequence from a second terminal of a second user at the first transmission time and receive a fourth sequence from the second terminal at the second transmission time, the second user being different from the first user and the third sequence being determined by the basic sequence and the third cyclic shift value and the fourth sequence being determined by the basic sequence and the fourth cyclic shift value,

0. 17. The apparatus of claim 16, wherein the second cyclic shift value is determined based on the first cyclic shift value, and the fourth cyclic shift value is determined based on the third cyclic shift value.

0. 18. The apparatus of claim 16, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

0. 19. The apparatus of claim 16, wherein the first sequence is given by cyclic-shifting the basic sequence by the first cyclic shift value in a time domain, and

the second sequence is given by cyclic-shifting the basic sequence by the second cyclic shift value in a time domain.

0. 20. The apparatus of claim 16, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 ⅇ^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & ⅇ^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c_odenotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 21. The communication method of claim 1, further comprising:

transmitting, from another ue, a third sequence at the first transmission time, the another ue being different from the ue, and the third sequence being determined based on the basic sequence and a third cyclic shift value; and

transmitting, from the another ue, a fourth sequence at the second transmission time, the fourth sequence being determined based on the basic sequence and a fourth cyclic shift value,

wherein, when the first cyclic shift value is equal to the third cyclic shift value plus one (1), the second cyclic shift value is not equal to the fourth cyclic shift value plus one (1).

0. 23. The apparatus of claim 22, wherein the second cyclic shift value is determined based on the first cyclic shift value.

0. 24. The apparatus of claim 22, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

0. 25. The apparatus of claim 22, wherein the first cyclic shift value is determined also based on a first symbol number of the first transmission time, and the second cyclic shift value is determined also based on a second symbol number of the second transmission time.

0. 26. The apparatus of claim 22, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c₀denotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 27. The communication apparatus of claim 22, wherein another communication apparatus transmits a third sequence at the first transmission time, the another communication apparatus being different from the communication apparatus, and the third sequence being determined based on the basic sequence and a third cyclic shift value,

wherein the another communication apparatus transmits a fourth sequence at the second transmission time, the fourth sequence being determined based on the basic sequence and a fourth cyclic shift value, and

wherein, when the first cyclic shift value is equal to the third cyclic shift value plus one (1), the second cyclic shift value is not equal to the fourth cyclic shift value plus one (1).

0. 29. The method of claim 28, wherein the second cyclic shift value is determined based on the first cyclic shift value.

0. 30. The method of claim 28, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

0. 31. The method of claim 28, wherein the first cyclic shift value is determined also based on a first symbol number of the first transmission time, and the second cyclic shift value is determined also based on a second symbol number of the second transmission time.

0. 32. The method of claim 28, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c₀denotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 33. The communication method of claim 28, wherein the first cyclic shift value and the second cyclic shift value are ue-specific.

0. 35. The apparatus of claim 34, wherein the second cyclic shift value is determined based on the first cyclic shift value.

0. 36. The apparatus of claim 34, wherein the first sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the first cyclic shift value, and

the second sequence is defined by a product of the basic sequence and a complex sine wave corresponding to the second cyclic shift value.

0. 37. The apparatus of claim 34, wherein the first cyclic shift value is determined also based on a first symbol number of the first transmission time, and the second cyclic shift value is determined also based on a second symbol number of the second transmission time.

0. 38. The apparatus of claim 34, wherein each of the first sequence and the second sequence c_i_n^(k)is given as follows:

{\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)}

{\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}

{\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T},

wherein c₀denotes the basic sequence, Δτ·i_n(k) denotes the first or second cyclic-shift value, and N_fdenotes the number of subcarriers.

0. 39. The communication apparatus of claim 34, wherein the first cyclic shift value and the second cyclic shift value are ue-specific.

RELATED APPLICATIONS

This application

The CDM sequence c_i_n^(k)can be defined as the product of a basic sequence c₀and the code ψ_i_n^(k)for identifying the user as expressed in Equation 2, and the code ψ_i_n^(k)for identifying the user will be described as a complex sine wave having a characteristic of a linear phase increase in the exemplary embodiments of the present invention. Multiplying of the complex sine wave in the frequency domain corresponds to shifting in the time domain. Accordingly, the CDM sequence c_i_n^(k)is given by cyclic-shifting the basic sequence c₀by Δτi_n(k) in the time domain.

$\begin{matrix} {\overline{c}}_{i_{n}}^{(k)} = {\overline{c}}_{0} \otimes {\overline{ψ}}_{i_{n}}^{(k)} & Equation 2 \end{matrix}$ ${\overline{c}}_{0} = {[\begin{matrix} c_{0} (0) & c_{0} (1) & \dots & c_{0} (N_{f} - 1) \end{matrix}]}^{T}$ ${\overline{ψ}}_{i_{n}}^{(k)} = {[\begin{matrix} 1 & e^{- j \frac{2 π}{N_{f}} Δ τ i_{n} (k)} & \dots & e^{- j \frac{2 π}{N_{f}} (N_{f} - 1) Δ τ i_{n} (k)} \end{matrix}]}^{T}$

Here, {circle around (x)} denotes an operation that multiplies each element of one vector by each element of the other vector, i_n(k) denotes a number of the CDM sequence used by the user #k at the transmission time #n, and Δτ denotes a granularity of the cyclic-shift, N_fdenotes the number of subcarriers for transmitting the CDM sequence, and the basic sequence c₀is given as a vector.

In Equation 2, the cyclic-shift is determined based on the number i_n(k) of the CDM sequence. For example, the cyclic-shift increases by Δτ when the number i_i(k) of the CDM sequence increases by ‘1’.

The IFFT 120 transforms the transmission symbol that is multiplied by the CDM sequence to a transmission signal of the time domain by performing an inverse fast Fourier transform (step S12). The parallel/serial converter 130 converts the transmission signal of the time domain to a serial transmission signal (step S13), and the CP adder 140 adds the CP to the serial transmission signal (step S14). The digital/analog converter 150 converts the transmission signal to which the CP is added to an analog transmission signal (step S15), and the RF transmitter 160 converts the analog transmission signal to an RF signal and transmits the RF signal through a transmission antenna 170 (step S16).

Next, the CDM mapper 110 sets a CDM sequence c_i_n+1^(k)that is different from the CDM sequence c_i_n^(k)of the transmission time #n to a CDM sequence of a transmission time #(n+1) (step S17), and repeats from the step S11. The CDM mapper 110 changes the CDM sequence c_i_n^(k)with time by changing the number i_n(k) of the CDM sequence c_i_n^(k)with time, that is, by changing a cyclic-shift value for the cyclic-shift with time. A pattern for changing the cyclic-shift value may be stored in the terminal in the format of a lookup table.

On the other hand, channels using the CDM sequence according to the first exemplary embodiment of the present invention may be channels for allocating a plurality of users to the same frequency bandwidth at the same time domain. For example, a sounding reference signal or an ACK/NACK channel may use the CDM sequence. The sounding reference signal is a wideband signal that is periodically transmitted by the terminal, and is used for estimating the uplink channel characteristic, for controlling the uplink power, and for estimating the timing. Therefore, all users transmit the sounding reference signals by using the same frequency bandwidth at the same time. The ACK/NACK channel is a channel for informing whether or not the terminal has received downlink packet data, and is required to have excellent performance at a low signal-to-noise ratio (SNR). Therefore, a lot of frequencies and time resources are allocated to the ACK/NACK channel, and a plurality of users simultaneously could access the ACK/NACK channel. Accordingly, the CDM sequence according to the exemplary embodiments of the present invention may be applicable to the sounding reference signal and the ACK/NACK channel.

In FIG. 1, the transmission symbol s^(k)is ‘1’ when the CDM sequence is used for the sounding reference signal, and the transmission symbol s^(k)is an ACK/NACK symbol to be transmitted when the CDM sequence is used for the ACK/NACK channel.

FIG. 3 shows a schematic block diagram of a receiving apparatus in a base station according to the first exemplary embodiment of the present invention, and FIG. 4 shows a schematic block diagram of a CDM demapper in the receiving apparatus of FIG. 3. FIG. 5 shows a flow diagram of a method for extracting a desired user signal, and FIG. 6 shows a signal extracted by the CDM demapper of FIG. 4.

As shown in FIG. 3, the receiving apparatus includes an RF receiver 210, an analog/digital converter 220, a CP remover 230, a serial/parallel converter 240, a fast Fourier transformer (FFT) 250, and a CDM demapper 260.

The RF receiver 210 receives K user signals from K terminals through a receiving antenna 270, and converts the K user signals to a baseband signal. The analog/digital converter 220 converts the baseband signal to a digital received signal. The CP remover 230 removes the CP from the digital received signal, and the serial/parallel converter 240 converts the digital received signal from which the CP is removed to a parallel received signal. The FFT 250 transforms the parallel received signal to a frequency domain received signal by performing a fast Fourier transform. The CDM demapper 260 estimates a vector s^(k)H_n^(k)from the frequency domain received signal by using the CDM sequence c_i_n^(k)at the transmission time of the user #k (where k is a number within a range from 0 to (K−1)). At this time, the vector is given by a product of the transmission symbol of the user #k and a channel vector.

The frequency domain received signal X_ntransformed by the FFT 250 can be expressed as Equation 3.

$\begin{matrix} \begin{matrix} {\overline{X}}_{n} = {[\begin{matrix} X_{n} (0) & X_{n} (1) & \dots & X_{n} (N_{f} - 1) \end{matrix}]}^{T} \\ = \sum_{k = 0}^{K - 1} s^{(k)} {\overline{H}}_{n}^{(k)} \otimes {\overline{c}}_{i_{n}}^{(k)} \end{matrix} & Equation 3 \end{matrix}$ ${\overline{H}}_{n}^{(k)} = {[\begin{matrix} H_{n}^{(k)} (0) & H_{n}^{(k)} (1) & \dots & H_{n}^{(k)} (N_{f} - 1) \end{matrix}]}^{T}$

Here, {circle around (x)} denotes an operation that multiplies each element of one vector by each element of the other vector, H_n^(k)(j) denotes a channel value corresponding to the j^thsubcarrier.

As shown in FIG. 4, the CDM demapper 260 includes a basic sequence descrambler 261, an inverse discrete Fourier transformer (IDFT) 262, a time delay domain extractor 263, and a discrete Fourier transformer (DFT) 264.

Referring to FIG. 5, the basic sequence descrambler 261 descrambles the basic sequence by multiplying each element of the frequency domain received signal X_nby each element of the conjugated basic sequence c₀as expressed in Equation 4 (step S21).
Y_nX_n{circle around (x)}c₀* Equation 4

Here, Y_ndenotes an output of the basic sequence descrambler 261.

The IDFT 262 transforms the output Y_nof the basic sequence descrambler 261 to a time delay domain signal g_nby performing an inverse discrete Fourier transform (step S22). It is assumed that ‘k’ is allocated to the CDM sequence number i_n(k) of the user #k, and the K user signals are transmitted through the same frequency domain at the same time domain. Then, channel delay profiles of the K user signals appear in the time delay domain signal g_nas shown in FIG. 6, and a time delay between the two adjacent users is Δτ. The time delay domain extractor 262 extracts a domain allocated to the user #k at the transmission time #n, and moves data of the extracted domain into an origin to output the time delay domain signal g_n^(k)of the user #k (step S23). The DFT 264 transforms the time delay domain signal g_n^(k)of the user #k to a desired user signal, i.e., a signal of the user #k, by performing a discrete Fourier transform (step S24).

Next, the effect that a multipath of a user having a channel delay spread has on the other users will be described with reference to FIG. 7 and FIG. 8.

FIG. 7 shows a time delay domain signal according to the passing of time when a general CDM sequence is used, and FIG. 8 shows a time delay domain signal according to the passing of time when the CDM sequence is hopped in accordance with the first exemplary embodiment of the present invention.

Referring to FIG. 7, a multipath of a user #0 having the channel delay spread has the effect on an interval of a user #1 such that interference can occur between the users. If the interference occurs in the sounding reference signal, the channel estimation performance of the user #1 deteriorates. Particularly, the channel estimation performance becomes worse when the user #0 has a larger received power than the user #1. In this case, if the same CDM sequence is continuously allocated to the same user even though time is passed, the multipath of the user #0 continuously has the effect on the interval of the user #1 in the time delay domain signals g₀−g_N−1such that the channel estimation performance of the user #1 continues to deteriorate.

As shown in FIG. 8, according to the first exemplary embodiment of the present invention, the CDM sequence of each user is changed with time such that the users that are adjacent to each other in the time delay domain signals are changed. As a result, the interference between the users can be randomized. That is, the multipath of the user #0 has the effect on the interval of the user #1 in the time delay domain signal g₀, but has the effect on the intervals of the user #2 and the user #3 in the time delay domain signals g₁and g_N−1, respectively. Accordingly, the channel estimation performance of only one user is not deteriorated by the multipath of the user #0 but the channel estimation performances of the plurality of users can be randomly deteriorated.

Next, a method for allocating the different CDM sequences to the user with time will be described with reference to Table 1 and Table 2. Table 1 and Table 2 show a CDM sequence allocation method according to the first exemplary embodiment of the present invention.

TABLE 1

	i₀	i₁	. . .	i_N−1

User #0	m₀(0)	m₀(1)	. . .	m₀(N − 1)
User #1	m₁(0)	m₁(1)	. . .	m₁(N − 1)
. . .	. . .	. . .	. . .	. . .
User #(K − 1)	m_K−1(0)	m_K−1(1)	m_K−1(N − 1)	m_K−1(N − 1)

Here, i_ndenotes a CDM sequence number of the transmission time #n, and m_k(n) denotes the cyclic-shift value that is transmitted by the user #k at the transmission time #n. The m_k(n) has any one of the cyclic-shift values from 0 to (K−1) as expressed in Equation 5.
∀n,m_k(n)ϵ{0,1,2, . . . ,K−1},0≤k≤K−1 Equation 5

In order to randomize the interference between the users, two different users use the different CDM sequences at one time domain. In addition, when the two users use the adjacent CDM sequences at one time domain, the two users use CDM sequences that are not adjacent to each other. As shown in an example of Table 2, the base station and the terminal allocate the different cyclic-shift values to the different users at one time domain, hop the cyclic-shift values with time, and allocate the hopped cyclic-shift values to the users. Then, the CDM sequence is hopped with time. The hopping pattern of the cyclic-shift is set such that the two users that have used the adjacent cyclic-shift values at one time domain use the cyclic-shift values that are not adjacent to each other at the other time domain. For example, when the hopping pattern of each user is set as shown in Table 2, the cyclic-shift values of the user #0 and the user #1 are adjacent to each other at the transmission time #0, but the cyclic-shift values of the user #0 and the user #1 are not adjacent to each other.

TABLE 2

	i₀	i₁


	User #0	0	3
	User #1	1	5
	User #2	2	2
	User #3	3	0
	User #4	4	4
	User #5	5	1

The cyclic-shift hopping pattern is a pattern that is predetermined between the base station and the terminal. The base station informs the terminal of information on the cyclic-shift hopping pattern at initial access, and the terminal and the base station may store the cyclic-shift hopping pattern, respectively. The cyclic-shift hopping pattern may be set by the base station or an upper node of the base station in the communication system. That is, the base station or the upper node may set the CDM sequences on the plurality of user and the cyclic-shift hopping patterns thereof.

Next, exemplary embodiments that respectively apply the cyclic-shift hopping pattern according to the first exemplary embodiment of the present invention to the sounding reference signal and the ACK/NACK channel will be described with reference to FIG. 9 and FIG. 10.

FIG. 9 shows a transmission structure of the sounding reference signal according to a second exemplary embodiment of the present invention, and FIG. 10 shows a transmission structure of the ACK/NACK channel according to a third exemplary embodiment of the present invention.

As shown in FIG. 9, all users transmit the sounding reference signals through the same frequency bandwidth at the same time domain. Since the sounding reference signal uses the CDM sequence c_i_n^(k)to which the cyclic-shift of Table 1 is applied, the different CDM sequences are allocated to the different users such that the users are identified. After the base station estimates the channel characteristic of each user by using the sounding reference signal, the base station informs each user of a frequency bandwidth having an excellent channel characteristic. Then, the user may transmit data through the frequency bandwidth that is informed by the base station. In addition, the base station may measure received power of each user and estimate a timing error of each user by using the sounding reference signal.

Meanwhile, since the user may move in a wireless communication system, the terminal periodically transmits the sounding reference signal as shown in FIG. 9. Then, the base station may periodically estimate channel characteristics by using the sounding reference signal. As described with reference to Table 1 and Table 2, the base station and the terminal hop the cyclic-shift value with time when the sounding reference signal is periodically transmitted such that the interference between the users is randomized.

Referring to FIG. 10, the CDM sequence is used for the reference signal, e.g., a pilot signal, and the ACK/NACK signal in the transmission structure according to the third exemplary embodiment. That is, three OFDM symbols are used for the reference signals and four OFDM symbols are used for the ACK/NACK symbols in the structure for transmitting seven OFDM symbols and N_fsubcarriers.

The output of the CDM demapper (260 of FIG. 2) at a transmission time of the reference signal is a channel estimate
Ĥ_n^W^(k),
n=1, 3, 5 at the corresponding transmission time, and the output of the CDM demapper at a transmission time of the ACK/NACK signal is a product
y_n=s^(k)Ĥ_n^W^(k)
(n=0, 2, 4, 6) of the ACK/NACK symbol s^(k)and the channel estimate at the corresponding transmission time. Then, a receiver of the base station compensates the outputs of the CDM demapper 260 with the channel estimates, and acquires an estimate on the ACK/NACK symbol by summing the compensated outputs as expressed in Equation 6.

$\begin{matrix} \hat{s} = \frac{1}{4} \sum_{j = 0}^{3} {y_{2 j} ({\hat{H}}_{2 j}^{W_{(k)}})}^{*} & Equation 6 \end{matrix}$

As shown in FIG. 10, the base station and the terminal may use one cyclic-shift hopping pattern by sequentially allocating the CDM sequences to the reference signal and the ACK/NACK signal in order of the transmission time. Alternatively, the base station and the terminal may set the cyclic-shift hopping pattern for the reference signal to be different from the cyclic-shift hopping pattern of the ACK/NACK signal. As a further alternative, the base station and the terminal may apply the cyclic-shift hopping pattern to any one of the reference signal and the ACK/NACK signal.

While it has been described that four symbols such as ACK/NACK symbols transmit the same symbols s^(k)in FIG. 10, the cyclic-shift hopping pattern according to the first exemplary embodiment of the present invention can be applicable to a channel quality indicator (CQI) channel. The CQI channel is used when the terminal transmits downlink channel information to the base station. In CQI channel, different symbols can be transmitted through the whole data blocks, i.e., the OFDM symbols, except for the reference signals.

As described above, while it has been described that K cyclic-shift values are used for the K users in the first to the third exemplary embodiments of the present invention, the K cyclic-shift values extracted from more than K cyclic-shift values may be allocated to the K users and be hopped with time.

In addition, the base station and the terminal may change the number of cyclic-shift values in accordance with a cell environment or a cell load, and this exemplary embodiment will be described below.

In a fourth exemplary embodiment of the present invention, the base station and the terminal classify entire sequences for the cyclic-shift values into a plurality of groups, and sets a minimum difference between the cyclic-shift values of each group to be greater than 1. For example, the base station and the terminal may divide all the sequences of Equation 5 into two groups as expressed in Equation 7. Then, when the number of the cyclic-shift values used in the cell is less than or equal to (K/2), the base station and the terminal set the cyclic-shift values with the sequences of the first group and hop the cyclic-shift values with time. Since the first group has the even-numbered cyclic-shift values, the minimum difference between the cyclic-shift values is 2. When the number of the cyclic-shift values used in the cell is greater than (K/2), the base station and the terminal set the cyclic-shift values with the sequences of the first and second groups and hop the cyclic-shift values with time. In this case, the minimum difference between the cyclic-shift values is 1.
∀n,m_k(n)ϵ{0,2,4, . . . ,K−1},0≤k≤K/2−1
∀n,m_k(n)ϵ{1,3,5, . . . ,K−2},K/2≤k≤K−1 Equation 7

According to the fourth exemplary embodiment, when a small number of sequences are required in accordance with the time and the cell environment, the cyclic-shift values are allocated from the group in which the minimum difference between the sequences is great such that the interference between the users is reduced.

When the time delay spread of the radio channel is different according to surroundings of the cell, the cyclic-shift values may be allocated from the (K/2) sequences of the first group in the case of the great time delay spread, and the cyclic-shift values may be allocated from the K sequences in the case of a small time delay spread.

FIG. 11 shows a drawing for explaining the interference between the cells.

When a first user 311 uses a cell #0 of a first base station 312 as a home cell, and a second user 321 uses a cell #1 of a second base station 322 as the home cell, a signal transmitted by the second user may be received in the cell #0. In this case, if the first and second users have the same cyclic-shift hopping pattern, the CDM sequences of the two users may be continuously conflicted. Accordingly, the base station and the terminal according to a fifth exemplary embodiment of the present invention set the cyclic-shift hopping pattern based on the cell to which the user belongs as shown in Equation 8, Table 3, and Table 4.
i_n=[m_k(n)+H_c(n)]% K Equation 8

Here, H_c(n) denotes a cell code value allocated to the cell #c at the transmission time #n, K denotes the maximum number of the users, and % denotes the modulo operation.

TABLE 3

	i₀	. . .	i_N−1

User #0	[m₀(0) + H₀(0)]% K	. . .	[m₀(N − 1) + H₀(N − 1)]% K
User #1	[m₁(0) + H₀(0)]% K	. . .	[m₁(N − 1) + H₀(N − 1)]% K
. . .	. . .	. . .	. . .
User	[m_K−1(0) + H₀(0)]% K	. . .	[m_K−1(N − 1) + H₀(N − 1)]% K
#(K − 1)

TABLE 4

	i₀	. . .	i_N−1

User #0	[m₀(0) + H₁(0)]% K	. . .	[m₀(N − 1) + H₁(N − 1)]% K
User #1	[m₁(0) + H₁(0)]% K	. . .	[m₁(N − 1) + H₁(N − 1)]% K
. . .	. . .	. . .	. . .
User	[m_K−1(0) + H₁(0)]% K	. . .	[m_K−1(N − 1) + H₁(N − 1)]% K
#(K − 1)

According to the fifth exemplary embodiment, even though the user #k of the cell #0 and the user #k of the cell #1 use the same m_k(n), the two users use different cyclic-shift values since the cell #0 and the cell #1 have different cells codes. Accordingly, since the users that belong to the different cells use the different CDM sequences at the same transmission time, the interference between the cells is prevented.

In the first to fifth exemplary embodiments of the present invention, it has been described that the basic sequence is fixed and the cyclic-shift is hopped to hop the CDM sequence. However, the basic sequence may be varied with time while the cyclic-shift is hopped such that the interference between the cells is reduced.

In addition, the cyclic-shift hopping pattern according to the exemplary embodiments of the present invention can be applicable to the case where the users are located at the different cells or sectors like a reference signal of a data channel used for a coherent demodulation of the data channel. This exemplary embodiment will be described with reference to FIG. 12 and FIG. 13.

FIG. 12 shows an example of a method for arranging the reference signals of the data channels in a cellular environment, and FIG. 13 shows an example of data transmission in two sectors located at the same base station. Seven base stations are shown in FIG. 12 for easy description.

As shown in FIG. 12, the seven base stations use different base sequences, i.e., basic sequence numbers u_n. Each base station includes three sectors, and the three sectors use sequences which are obtained by cyclic-shifting the same basic sequence by the different values. While it has been shown in FIG. 12 that two different cyclic-shift values are allocated to each sector, one cyclic-shift value can be allocated to each sector.

Referring to FIG. 13, a user #1 transmits data in a sector α, and the user #1 is differentiated form the other users of the sector a by the frequency. The data are transmitted in a subframe unit, and the reference signal which is common to all users of the sector α is transmitted twice in each subframe. A user #2 transmits data in a sector β, and the data transmission structure of the sector β is similar to the sector α. At this time, the interference between the users within one sector does not exist as shown in FIG. 13. However, the user #1 of the sector α and the user #2 of the sector β use the same time/frequency resources, and use sequences, which are obtained by cyclic-shifting the same basic sequence by the different values, as the reference signals, respectively. Herein, the interference between the users may exist when time delay in a channel is great. Accordingly, a sixth exemplary embodiment of the present invention randomizes the interference between the users by changing the cyclic-shift value with time. At this time, the basic sequence may be, changed with time.

Table 5 shows an example of a cyclic shift hopping pattern and a basic sequence hopping pattern on the reference signal of the data channel. Referring to Table 5, whenever the reference signal is transmitted, the basic sequence number u_nand the cyclic-shift, i.e., the CDM sequence number i_nis changed.

TABLE 5

	(u₀, i₀)	(u₁, i₁)	(u₂, i₂)	(u₃, i₃)


Base	Sector α	(0, 0)	(2, 0)	(0, 0)	(5, 0)
station	Sector β	(0, 1)	(2, 2)	(0, 1)	(5, 2)
#0	Sector γ	(0, 2)	(2, 1)	(0, 2)	(5, 1)
	Sector α	(0, 3)	(2, 3)	(0, 3)	(5, 3)
	Sector β	(0, 4)	(2, 5)	(0, 4)	(5, 5)
	Sector γ	(0, 5)	(2, 4)	(0, 5)	(5, 4)
Base	Sector α	(1, 0)	(4, 0)	(2, 0)	(7, 0)
station	Sector β	(1, 1)	(4, 2)	(2, 1)	(7, 2)
#1	Sector γ	(1, 2)	(4, 1)	(2, 2)	(7, 1)
	Sector α	(1, 3)	(4, 3)	(2, 3)	(7, 3)
	Sector β	(1, 4)	(4, 5)	(2, 4)	(7, 5)
	Sector γ	(1, 5)	(4, 4)	(2, 5)	(7, 4)

While this invention has been described in connection with what is presently considered to be practical exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

The above-described methods and apparatuses are not only realized by the exemplary embodiments of the present invention, but, on the contrary, are intended to be realized by a program for realizing functions corresponding to the configurations of the exemplary embodiments of the present invention or a recording medium for recording the program.

INVENTORS:

Kim, Young-Hoon, Bang, Seung-Chan, Chang, Kap-Seok, Park, Hyeong-Geun, Kim, Il-Gyu, Ko, Young-Jo, Yi, Hyo-Seok

THIS PATENT IS REFERENCED BY THESE PATENTS:

Patent

Priority

Assignee

Title

THIS PATENT REFERENCES THESE PATENTS:

Patent	Priority	Assignee	Title
5742678,	Aug 16 1994	Ericsson, Inc.	Multiple access coding for radio communications
5963601,	May 20 1996	Trimble Navigation Limited	Variable suppression of multipath signal effects
6160803,	Jan 12 1998	GOOGLE LLC	High processing gain spread spectrum TDMA system and method
6542478,	Mar 23 1998	Samsung Electronics, Co., Ltd.	Device and method for generating PN sequence in CDMA communication system
7068703,	Feb 18 2003	Qualcomm Incorporated	Frequency hop sequences for multi-band communication systems
7724777,	Jun 18 2004	Qualcomm Incorporated	Quasi-orthogonal multiplexing for a multi-carrier communication system
7848438,	Feb 14 2006	Google Technology Holdings LLC	Method and apparatus for pilot signal transmission
8116398,	Aug 14 2006	Toyota Jidosha Kabushiki Kaisha	Transmission method, transmitter, and receiver for multi antenna wireless communication system
20040120422,
20050152327,
20050180386,
20050201326,
20050233710,
20060035643,
20060039343,
20060056360,
20060067421,
20060104379,
20070041404,
20070104085,
20070183386,
20080259892,
20080298335,
CN1262824,
KR100326182,
WO2006009715,

ASSIGNMENT RECORDS Assignment records on the USPTO

Executed on	Assignor	Assignee	Conveyance	Frame	Reel	Doc
Dec 02 2016		Electronics and Telecommunications Research Institute	(assignment on the face of the patent)

MAINTENANCE FEES AND DATES: Maintenance records on the USPTO

Date	Maintenance Fee Events

Date	Maintenance Schedule
May 30 2026	4 years fee payment window open
Nov 30 2026	6 months grace period start (w surcharge)
May 30 2027	patent expiry (for year 4)
May 30 2029	2 years to revive unintentionally abandoned end. (for year 4)
May 30 2030	8 years fee payment window open
Nov 30 2030	6 months grace period start (w surcharge)
May 30 2031	patent expiry (for year 8)
May 30 2033	2 years to revive unintentionally abandoned end. (for year 8)
May 30 2034	12 years fee payment window open
Nov 30 2034	6 months grace period start (w surcharge)
May 30 2035	patent expiry (for year 12)
May 30 2037	2 years to revive unintentionally abandoned end. (for year 12)