ES2397112T3

Wireless communication apparatus and response signal spreading method

Abstract

Radio communication apparatus, comprising: a diffusion unit (214, 217) configured to broadcast an ACK or NACK with an orthogonal sequence, which is one of a plurality of orthogonal sequences, and is with a sequence defined by a cyclic shift value , which is one of the plurality of cyclic shift values and that is associated with the orthogonal sequence; and a transmission unit (218) configured to transmit the ACK or NACK, in which: each of the plurality of orthogonal sequences is an orthogonal sequence composed of 4 chips; the plurality of orthogonal sequences include a first orthogonal sequence and a second orthogonal sequence, in which a sequence comprising 2 chips in the first half of the first orthogonal sequence is not orthogonal to a sequence comprising 2 chips in the first half of the second orthogonal sequence , and a sequence comprising 2 chips in the second half of the first orthogonal sequence is not orthogonal to a sequence comprising 2 chips in the second half of the second orthogonal sequence; a cyclic shift value associated with the first orthogonal sequence is different from a cyclic shift value associated with the second orthogonal sequence; the plurality of orthogonal sequences also include a third orthogonal sequence, in which a sequence comprising 2 chips in the first half of the second orthogonal sequence is orthogonal to a sequence comprising 2 chips in the first half of the third orthogonal sequence, and a sequence that it comprises 2 chips in the second half of the second orthogonal sequence is orthogonal to a sequence that comprises 2 chips in the second half of the third orthogonal sequence, and a cyclic shift value associated with the second orthogonal sequence is the same as a cyclic shift value associated with the third orthogonal sequence.

ES2397112T3, drawing sheet 1 — Sheet 1 of 15

Term

1.7 yearsto projected expiry

Projected expiry 13 June 2028, counted from filing; an application has no term until it is granted.

24 claims: 8 independent, 16 dependent

1
ES 2 397 112 T3 REIVINDICACIONES 1. Aparato de comunicación por radio, que comprende:una unidad de difusión (214, 217) configurada para difundir un ACK o NACK con una secuencia ortogonal, que es una de una pluralidad de secuencias ortogonales, y es con una secuencia definida por un valor de desplazamiento cíclico, que es uno de la pluralidad de valores de desplazamiento cíclico y que está asociado con la secuencia ortogonal;y una unidad de transmisión (218) configurado para transmitir el ACK o NACK, en el que: cada una de la pluralidad de secuencias ortogonales es una secuencia ortogonal compuesta de 4 chips;la pluralidad de secuencias ortogonales incluyen una primera secuencia ortogonal y una segunda secuencia ortogonal, en el que una secuencia que comprende 2 chips en la primera mitad de la primera secuencia ortogonal no es ortogonal a una secuencia que comprende 2 chips en la primera mitad de la segunda secuencia ortogonal, y una secuencia que comprende 2 chips en la segunda mitad de la primera secuencia ortogonal no es ortogonal a una secuencia que comprende 2 chips en la segunda mitad de la segunda secuencia ortogonal;un valor de desplazamiento cíclico asociado con la primera secuencia ortogonal es diferente de un valor de desplazamiento cíclico asociado con la segunda secuencia ortogonal;las pluralidad de secuencias ortogonales también incluyen una tercera secuencia ortogonal, en el que una secuencia que comprende 2 chips en la primera mitad de la segunda secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la primera mitad de la tercera secuencia ortogonal, y una secuencia que comprende 2 chips en la segunda mitad de la segunda secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la segunda mitad de la tercera secuencia ortogonal, y un valor de desplazamiento cíclico asociado con la segunda secuencia ortogonal es el mismo que un valor de desplazamiento cíclico asociado con la tercera secuencia ortogonal.
2
Aparato de comunicación por radio de acuerdo con la reivindicación 1, en el que una secuencia que comprende 2 chips en la primera mitad de la primera secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la primera mitad de la tercera secuencia ortogonal, una secuencia que comprende 2 chips en la segunda mitad de la primera secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la segunda mitad de la tercera secuencia ortogonal.
3
Aparato de comunicación por radio de acuerdo con la reivindicación 1, en el que:los 4 chips, que comprende cada una de la pluralidad de secuencias ortogonales, se expresa como [W0, W1, W2, W3];[W0, W1] de la primera secuencia ortogonal y [W0, W1] de la segunda secuencia ortogonal no son ortogonales, y [W2, W3] de la primera secuencia ortogonal y [W2, W3] de la segunda secuencia ortogonal no son ortogonales;y [W0, W1] de la segunda secuencia ortogonal y [W0, W1] de la tercera secuencia ortogonal son ortogonales, y [W2, W3] de la segunda secuencia ortogonal y {W2, W3] de la tercera secuencia ortogonal son ortogonales.
4
Aparato de comunicación por radio de acuerdo con la reivindicación 2, en el que:los 4 chips, que comprende cada una de la pluralidad de secuencias ortogonales, se expresa como [W0, W1, W2, W3];[W0, W1] de la primera secuencia ortogonal y [W0, W1] de la segunda secuencia ortogonal no son ortogonales, y [W2, W3] de la primera secuencia ortogonal y [W2, W3] de la segunda secuencia ortogonal no son ortogonales;[W0, W1] de la primera secuencia ortogonal y [W0, W1] de la tercera secuencia ortogonal son ortogonales;y [W2, W3] de la primera secuencia ortogonal y [W2, W3] de la tercera secuencia ortogonal son ortogonales;y [W0, W1] de la segunda secuencia ortogonal y [W0, W1] de la tercera secuencia ortogonal son ortogonales;y [W2, W3] de la segunda secuencia ortogonal y [W2, W3] de la tercera secuencia ortogonal son ortogonales.
5
Aparato de comunicación por radio de acuerdo con la reivindicación 3 ó 4, en el que Wn(n = 0 ~ 3) es 1 ó -1.
6
Aparato de comunicación por radio de acuerdo con cualquiera de las reivindicaciones 1 a 5, en el que:la pluralidad de valores de desplazamiento cíclico incluyen una pluralidad de primeros valores de desplazamiento cíclico y una pluralidad de segundos valores de desplazamiento cíclicos que son diferentes de la pluralidad de primeros valores de desplazamiento cíclico;y la primera secuencia ortogonal está asociada con la pluralidad de primeros valores de desplazamiento cíclico, y la segunda secuencia ortogonal y la tercera secuencia ortogonal están asociadas con la pluralidad de segundos valores de desplazamiento cíclico.
7
Aparato de comunicación por radio de acuerdo con la reivindicación 6, en el que:ES 2 397 112 T3 la pluralidad de valores de desplazamiento cíclico comprende 12 valores de desplazamiento cíclico, que se desplazan cíclicamente entre sí mediante una unidad predefinida;la primera pluralidad de valores de desplazamiento cíclico comprende 6 valores de desplazamiento cíclico, que están fuera de la pluralidad de valores de desplazamiento cíclico y que se desplazan cíclicamente entre sí mediante dos de las unidades;y la pluralidad de segundos valores de desplazamiento cíclico comprende 6 valores cíclicos de desplazamiento, que están fuera de la pluralidad de valores de desplazamiento cíclico y son exclusivos de la primera pluralidad de valores de desplazamiento cíclico y que se desplazan cíclicamente entre sí mediante dos de las unidades.
8
Aparato de comunicación por radio de acuerdo con cualquiera de las reivindicaciones 1 a 7, en el que la pluralidad de secuencias ortogonales incluyen la primera secuencia ortogonal [1, -1, 1, -1] y la segunda secuencia ortogonal [1, -1, -1, 1 ].
9
Aparato de comunicación por radio de acuerdo con la reivindicación 8, en el que la pluralidad de secuencias ortogonales incluyen la tercera secuencia ortogonal [1, 1, 1, 1].
10
Aparato de comunicación por radio de acuerdo con cualquiera de las reivindicaciones 1 a 9, en el que una diferencia mínima entre los valores de desplazamiento cíclico que se utilizan respectivamente para la primera secuencia ortogonal y la segunda secuencia ortogonal es menor que una diferencia mínima entre los valores de desplazamiento cíclico que se utilizan para una de la pluralidad de secuencias ortogonales.
11
Aparato de comunicación por radio de acuerdo con cualquiera de las reivindicaciones 1 a 10, en el que dicha unidad de transmisión transmite el ACK o NACK usando un canal de control, y dicha unidad de difusión utiliza una secuencia ortogonal determinada a partir del canal de control y utiliza una secuencia definida por un valor de desplazamiento cíclico que se determina a partir del canal de control.
12
Aparato de comunicación por radio de acuerdo con cualquiera de las reivindicaciones 1 a 10, en el que dicha unidad de transmisión transmite el ACK o NACK utilizando un recurso, y dicha unidad de difusión utiliza una secuencia ortogonal determinada a partir del recurso y utiliza una secuencia definida por un valor de desplazamiento cíclico que se determina a partir del recurso.
13
Procedimiento de difusión de una señal de respuesta, que comprende:difundir un ACK o NACK con una secuencia definida por un valor de desplazamiento cíclico, que es una de una pluralidad de valores de desplazamiento cíclico y que está asociado con una secuencia ortogonal;y difundir el ACK o NACK con una secuencia ortogonal, que es una de la pluralidad de secuencias ortogonales, en el que: cada una de la pluralidad de secuencias ortogonales es una secuencia ortogonal que comprende 4 chips;la pluralidad de secuencias ortogonales incluyen una primera secuencia ortogonal y una segunda secuencia ortogonal, en el que una secuencia comprende 2 chips en la primera mitad de la primera secuencia ortogonal no es ortogonal a una secuencia que comprende 2 chips en la primera mitad de la segunda secuencia ortogonal, y una secuencia que comprende 2 chips en la segunda mitad de la primera secuencia ortogonal no es ortogonal a una secuencia que comprende 2 chips en la segunda mitad de la segunda secuencia ortogonal;un valor de desplazamiento cíclico asociado con la primera secuencia ortogonal es diferente de un valor de desplazamiento cíclico asociado con la segunda secuencia ortogonal;la pluralidad de secuencias ortogonales también incluyen una tercera secuencia ortogonal, en el que una secuencia que comprende 2 chips en la primera mitad de la segunda secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la primera mitad de la tercera secuencia ortogonal, y una secuencia que comprende 2 chips en la segunda mitad de la segunda secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la segunda mitad de la tercera secuencia ortogonal, y un valor de desplazamiento cíclico asociado con la segunda secuencia ortogonal es el mismo que un valor de desplazamiento cíclico asociado con la tercera secuencia ortogonal.
14
Procedimiento de difusión de una señal de respuesta de acuerdo con la reivindicación 13, en el que una secuencia que comprende de 2 chips en la primera mitad de la primera secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la primera mitad de la tercera secuencia ortogonal, una secuencia que comprende 2 chips en la segunda mitad de la primera secuencia ortogonal es ortogonal a una secuencia que comprende 2 chips en la segunda mitad de la tercera secuencia ortogonal.
15
Procedimiento de difusión de una señal de respuesta de acuerdo con la reivindicación 13, en el que:los 4 chips, que comprenden cada una de la pluralidad de secuencias ortogonales, se expresan como [W0, W1, W2, W3];ES 2 397 112 T3 [W0, W1] de la primera secuencia ortogonal y [W0, W1] de la segunda secuencia ortogonal no son ortogonales, y [W2, W3] de la primera secuencia ortogonal y [W2, W3] de la segunda secuencia ortogonal no son ortogonales;y [W0, W1] de la segunda secuencia ortogonal y [W0, W1] de la tercera secuencia ortogonal son ortogonales, y [W2, W3] de la segunda secuencia ortogonal y [W2, W3] de la tercera secuencia ortogonal son ortogonales.
16
Procedimiento de difusión de una señal de respuesta de acuerdo con la reivindicación 14, en el que:los 4 chips, que comprende cada una de la pluralidad de secuencias ortogonales, se expresan como [W0, W1, W2, W3];[W0, W1] de la primera secuencia ortogonal y [W0, W1] de la segunda secuencia ortogonal no son ortogonales, y [W2, W3] de la primera secuencia ortogonal y [W2, W3] de la segunda secuencia ortogonal no son ortogonales;[W0, W1] de la primera secuencia ortogonal y [W0, W1] de la tercera secuencia ortogonal son ortogonales, y [W2, W3] de la primera secuencia ortogonal y [W2, W3] de la tercera secuencia ortogonal son ortogonales;y [W0, W1] de la segunda secuencia ortogonal y [W0, W1] de la tercera secuencia ortogonal son ortogonales, y [W2, W3] de la segunda secuencia ortogonal y [W2, W3] de la tercera secuencia ortogonal son ortogonales.
17
Procedimiento de difusión de una señal de respuesta de acuerdo con la reivindicación 15 ó 16, en el que Wn (n = 0 ~ 3) es 1 ó -1.
18
Procedimiento de difusión de una señal de respuesta de acuerdo con cualquiera de las reivindicaciones 13 a 17, en el que:la pluralidad de valores de desplazamiento cíclico incluyen una pluralidad de primeros valores de desplazamiento cíclico y una pluralidad de segundos valores de desplazamiento cíclico que son diferentes de la primera pluralidad de valores de desplazamiento cíclico;y la primera secuencia ortogonal está asociada con la primera pluralidad de valores de desplazamiento cíclico, y la segunda secuencia ortogonal y la tercera secuencia ortogonal están asociados con la pluralidad de segundos valores de desplazamiento cíclico.
19
Procedimiento de difusión de una señal de respuesta de acuerdo con la reivindicación 18, en el que:la pluralidad de valores de desplazamiento cíclico comprende 12 valores de desplazamiento cíclico, que se desplazan cíclicamente entre sí mediante una unidad predefinida;la pluralidad de primeros valores de desplazamiento cíclico comprende 6 valores de desplazamiento cíclico, que están fuera de la pluralidad de valores de desplazamiento cíclico y que se desplazan cíclicamente entre sí mediante dos de las unidades;y la pluralidad de segundos valores de desplazamiento cíclico comprende 6 valores de desplazamiento cíclico, que están fuera de la pluralidad de valores de desplazamiento cíclico y son exclusivos de la pluralidad de primeros valores de desplazamiento cíclico y que se desplazan cíclicamente entre sí mediante dos de las unidades.
20
Procedimiento de difusión de una señal de respuesta de acuerdo con cualquiera de las reivindicaciones 13 a 19, en el que, la pluralidad de secuencias ortogonales incluyen la primera secuencia ortogonal [1, -1, 1, -1] y la segunda secuencia ortogonal [1, -1, -1, 1].
21
Procedimiento de difusión de una señal de respuesta de acuerdo con la reivindicación 20, en el que la pluralidad de secuencias ortogonales incluyen la tercera secuencia ortogonal [1, 1, 1, 1].
22
Procedimiento de difusión de una señal de respuesta de acuerdo con cualquiera de las reivindicaciones 13 a 21, en el que una diferencia mínima entre los valores de desplazamiento cíclico que se utilizan respectivamente para la primera secuencia ortogonal y la segunda secuencia ortogonal es menor que una diferencia mínima entre los valores de desplazamiento cíclico que son utilizado para una de la pluralidad de secuencias ortogonales.
23
Procedimiento de difusión de una señal de respuesta de acuerdo con cualquiera de las reivindicaciones 13 a 22, comprendiendo también el procedimiento la transmisión del ACK o NACK utilizando un canal de control, en el que el ACK o NACK se transmite con una secuencia ortogonal determinada a partir del canal de control, y el ACK o NACK se difunde con una secuencia definida mediante un valor de desplazamiento cíclico, que se determina a partir del canal de control.
24
Procedimiento de difusión de una señal de respuesta de acuerdo con cualquiera de las reivindicaciones 13 a 22, comprendiendo también el procedimiento la transmisión del ACK o NACK utilizando un recurso, en el que el ACK o NACK se transmite con una secuencia ortogonal determinada a partir del recurso, y el ACK o NACK se difunde con una secuencia definida por un valor de desplazamiento cíclico que se determina a partir del recurso.

Independent claims24

133 paragraphs in 6 sections, as filed

IS 2 397 112 T3

DESCRIPTION

Wireless communication apparatus and response signal broadcast procedure

Technical field

The present invention relates to a radio communication apparatus and a response signal broadcasting method.

Background of the technique

In mobile communication, ARQ (Automatic Repetition Request) is applied to downlink data from a radio base station communication apparatus (hereinafter abbreviated to base station) to mobile radio communication station apparatus (in hereinafter abbreviated to mobile stations). That is, the mobile stations feed back response signals representing the downlink data error detection results to the base station. The mobile stations perform a CRC (Cyclic Redundancy Check) of downlink data, and if CRC = OK is found (i.e., if no error is found), an ACK (Acknowledgment) is fed back, and If CRC = NG is found (that is, if an error is found), a NACK (Negative Acknowledgment) is fed back, as a response signal to the base station. These response signals are transmitted to the base station using uplink control channels, such as a PUCCH (Physical Uplink Control Channel).

In addition, the base station transmits control information to report the downlink data resource allocation results to the mobile stations. This control information is transmitted to mobile stations using downlink control channels such as CCH L1 / L2 (L1 / L2 control channels). Each L1 / L2 CCH occupies one or a plurality of CCEs. If a L1 / L2 CCH occupies a plurality of CCEs (Control Channel Elements), the plurality of CCEs occupied by the L1 / L2 CCH are consecutive. Based on the number of CCEs that are required to carry control information, the base station assigns an arbitrary L1 / L2 CCH among the plurality of L1 / L2 cChs for each mobile station, assigns the control information about the physical resources corresponding to the CCEs (Channel Control Elements) occupied by the CCH L1 / L2, and performs the transmission.

Furthermore, to efficiently use the downlink communication resources, studies are being carried out to assign between CCEs and PUCCHs. According to this assignment, each mobile station can decide the PUCCH to use to transmit response signals from the mobile station, from the CCEs assigned to the physical resources in which control information is assigned for the mobile station.

Also, as shown in Figure 1, studies are being conducted to perform code multiplexing by broadcasting a plurality of response signals from a plurality of mobile stations using ZC (Zadoff-Chu) sequences and Walsh sequences. (see multiplexing ability of CQIs and ACK / NACKs to form different UEs (ftp://ftp.3gpp.org/TSG_RAN/WG1_RL1/TSGR1_49/Docs/R1-072315.zip)). In Figure 1, (W0, W1, W2, W3) represents a Walsh sequence with a sequence length of 4. As shown in Figure 1, in a mobile station, first, an ACK response signal or NACK is subject to a first broadcast to a symbol by a ZC sequence (with a sequence length of 12) in the frequency domain. Next, the response signal under the first broadcast is subjected to an IFFT (Inverse Fast Fourier Transform) in association with W0 to W3. The response signal spread in the frequency domain by a ZC sequence with a sequence length of 12 is transformed into a ZC sequence with a sequence length of 12 by this IFFT in the time domain. Then, the IFFT-subjected signal is subjected to a second broadcast using a Walsh sequence (with a sequence length of 4). That is, an answer signal is assigned to each of the four symbols S0 to S3. Similarly, response signals from other mobile stations are transmitted using ZC sequences and Walsh sequences. Here, different mobile stations use ZC sequences of different time domain cyclic shift values or of different Walsh sequences. Here, the sequence length of the ZC sequences in the time domain is 12, so it is possible to use twelve ZC sequences of cyclic shift values 0 to 11, generated from the ZC sequence itself. Furthermore, the sequence length of the Walsh sequences is 4, so that it is possible to use four different Walsh sequences. Therefore, in an ideal communication environment, it is possible to multiplex a maximum code of forty-eight (12 x 4) response signals from the mobile stations.

Here, there is no cross-correlation between the ZC sequences of different cyclic shift values generated from the same ZC sequence. Therefore, in an ideal communication environment, as shown in Figure 2, a plurality of response signals subjected to broadcast and code multiplexing by ZC sequences of different cyclic shift values (0 to 11) can be separated in the time domain without inter-code interference, through correlation processing at the base station.

IS 2 397 112 T3

However, due to an influence of, for example, the transmission timing difference in mobile stations, delayed multipath waves and frequency offsets, a plurality of response signals from a plurality of mobile stations do not always arrive at one base station at the same time. For example, as shown in Figure 3, if the transmission timing of a response signal transmitted by the sequence ZC of cyclic offset value 0 is delayed from the correct transmission timing, the correlation peak of the sequence ZC of the cyclic offset value 0 may appear in the detection window for the ZC sequence of the cyclic offset value 1 ''. Also, as shown in Figure 4, if a response signal transmitted by the ZC sequence of cyclic offset value 0 has a lag wave, an interference leak may appear due to lag wave in the detection window for the ZC sequence of the cyclic shift value 1. Therefore, in these cases, the separation performance degrades between a response signal transmitted by the ZC sequence of cyclic offset value 0 and a response signal transmitted by the ZC sequence of cyclic offset value 1. That is, If Zc sequences of adjacent cyclic shift values are used, the performance of the response signal separation may be degraded.

Thus, up to now, if a plurality of response signals are code multiplexed by broadcast using ZC sequences, a sufficient cyclic shift value difference (i.e., cyclic shift interval) is provided between the ZC sequences, in a measure that does not cause interference between the codes between the ZC sequences. For example, when the difference between the values of the cyclic shifts of ZC sequences is 4, only three ZC sequences of cyclic shift values 0, 4, and 8 among twelve ZC sequences of cyclic shift values 0 to 11 are used for the first broadcast of response signals. Therefore, if Walsh sequences with a sequence length of 4 are used for the second broadcast of response signals, it is possible to code multiplex a maximum of twelve (3 x 4) response signals from mobile stations.

Examples of this multiplexing are provided in

MOTOROLA: EUTRA SC-FDMA Uplink Pilot / Reference Signal Design, PROJECT 3GPP; R1-063057 UL_REFERENCE_SIGNAL_DESIGN, 3rd GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTER; 650, ROUTE DES LUCIOLES, F-06921 SOPHIA-ANTIPOLIS CEDEX, France, vol. RAN WG1, no. Riga, Latvia, 20061102, November 2, 2006 (02.11.2006.) O

NOKIA: Multiplexing of L1 / L2 Control Signaling when UE has no data to transmit, 3GPP PROJECT; R1063380, 3RD GENERATION ASSOCIATION PROJECT (3GPP), MOBILE COMPETENCE CENTER; 650, ROUTE DES LUCIOLES, F-06921 SOPHIA-ANTIPOLIS CEDEX, France, vol. RAN WG1, no. Riga, Latvia, 20061101, November 1, 2006 (01.11.2006).

Description of the invention

Problems to be solved by the invention

As described above, if a Walsh sequence with a sequence length of 4, (W0, W1, W2, W3), is used for the second broadcast, a reply signal is assigned to each of the four symbols ( S0 to S3). Therefore, a base station that receives response signals from mobile stations needs to de-spread the response signals in a time period of four symbols. On the other hand, if a mobile station is moving fast, there is a high possibility that the channel conditions between the mobile station and the base station will change during the time period above four symbols. Therefore, when there is a fast moving mobile station, the orthogonality between the Walsh sequences that are used for the second broadcast can collapse. That is, when there are fast-moving mobile stations, inter-code interference is more likely to occur between Walsh sequences than between ZC sequences and, as a result, the performance of response signal separation is degraded.

By the way, when some of a plurality of mobile stations are fast moving and the rest of the mobile stations are in a steady state, the mobile stations are in a steady state, multiplexing with the fast moving mobile stations on the Walsh axis. , are also influenced by inter-code interference.

Therefore, it is an object of the present invention to provide a radio communication apparatus and response signal broadcast method which can minimize the performance degradation of the separation of response signals that are multiplexed by code.

Means to solve the problem

The radio communication apparatus of the present invention employs a configuration having: a first broadcast section that performs a first broadcast of a response signal using one of a plurality of first sequences that can be separated from each other because of different values cyclic displacement, and a second diffusion section that performs a second diffusion of the response signal subjected to the first

ES 2 397 112 T3 diffusion, using one of a plurality of second sequences, and in which a difference between the cyclic shift values of the first sequences associated with different adjacent second sequences is less than a difference between the cyclic shift values of first sequences associated with the same second sequence.

Advantageous effect of the invention

According to the present invention, it is possible to minimize the performance degradation of the separation of the response signals that are code multiplexed.

Brief Description of Drawings

Fig. 1 is a diagram showing a response signal broadcast method (prior art);

Fig. 2 is a diagram showing the correlation processing of response signals broadcast by ZC sequences (in the case of an ideal communication environment);

Fig. 3 is a diagram showing the correlation processing of response signals broadcast by ZC sequences (when there is a transmission time difference);

Fig. 4 is a diagram showing the correlation processing of response signals broadcast by ZC sequences (when there is a delay wave);

Fig. 5 is a block diagram showing the configuration of a base station according to Embodiment 1;

Fig. 6 is a block diagram showing the configuration of a mobile station according to Embodiment 1;

Figure 7 is a diagram showing the assignments between ZC sequences, Walsh sequences and PUCCHs according to Embodiment 1 (variation 1);

Fig. 8 is a diagram showing the assignments between the first sequences, the second sequences, and PUCCHs according to Embodiment 1;

Figure 9 is a diagram showing the assignments between ZC sequences, Walsh sequences and PUCCHs according to Embodiment 1 (variation 2);

Figure 10 is a diagram showing the assignments between ZC sequences, Walsh sequences and PUCCHs according to Embodiment 1 (variation 3);

Figure 11 illustrates Walsh sequences according to Embodiment 2, which is an embodiment of the present invention; Fig. 12 is a diagram showing the assignments between ZC sequences, Walsh sequences and PUCCHs according to Embodiment 2, which is an embodiment of the present invention;

Figure 13 is a diagram showing the assignments between ZC sequences, Walsh sequences and PUCCHs according to Embodiment 3 (variation 1);

Fig. 14 is a diagram showing the assignments between ZC sequences, Walsh sequences and PUCCHs according to Embodiment 3 (variation 2); Y

Fig. 15 is a diagram showing a method of broadcasting a reference signal.

Best mode of carrying out the invention

Three embodiments will now be explained in detail with reference to the accompanying drawings. Embodiments 1 and 3 are examples relating to assignments between sequences and PUCCHs. Only Embodiment 2 describes an embodiment of the claimed invention.

(Embodiment 1)

Figure 5 illustrates the configuration of base station 100 according to the present embodiment, and Figure 6 illustrates the configuration of mobile station 200 according to the present embodiment.

Here, to avoid complicated explanation, Figure 5 illustrates the components associated with transmitting downlink data and the components associated with receiving uplink response signals for downlink data, which are closely related to the present invention, and the illustration and explanation of the components associated with receiving uplink data will be omitted. Similarly, Figure 6 illustrates the components associated with receiving downlink data and components associated with transmitting uplink response signals for downlink data, which are closely related to the present invention, and are it will omit the illustration and explanation of the components associated with uplink data transmission.

Furthermore, in the following explanation, a case will be described where the ZC sequences are used for the first diffusion and the Walsh sequences are used for the second diffusion. Here, for the first diffusion, it is also possible to use sequences, which can be separated from each other due to different cyclic shift values, different from the ZC sequences. Similarly, for the second diffusion it is equally possible to use other orthogonal sequences of Walsh sequences.

IS 2 397 112 T3

Furthermore, in the following explanation, a case where ZC sequences with a sequence length of 12 and Walsh sequences with a sequence length of 4, (W0, W1, W2, W3) are used. However, the present invention is not limited to these sequence lengths.

Also, in the following explanation, twelve ZC sequences of cyclic shift values 0 to 11 are referred to as ZC # 0 to ZC # 11, and four Walsh sequences of sequence numbers 0 to 3 are referred to as W # 0 to W # 3.

Also, a case will be assumed in the explanation below, where CCH L1 / L2 # 1 occupies CCE # 1, CCH L1 / L2 # 2 occupies CCE # 2, CCH L1 / L2 # 3 occupies CCE # 3, CCH L1 / L2 # 4 occupies CCE # 4 and CCE # 5, CCH L1 / L2 # 5 occupies CCE # 6 and CCE # 7, CCH L1 / L2 # 6 occupies CCE # 8 to # 11, and so on.

Furthermore, in the following discussion, the CCE numbers and the PUCCH numbers, defined by the values of the cyclic shifts of the ZC sequences and Walsh sequence numbers, are assigned on a one-to-one basis. That is, CCE # 1 maps to PUCCH # 1, CCE # 2 maps to PUCCH # 2, CCE # 3 maps to PUCCH # 3, and so on.

In the base station 100 shown in FIG. 5, the control information generation section 101 and the allocation section 104 receive the downlink data resource allocation result as input.

The control information generation section 101 generates control information to carry the resource allocation result, on a per mobile station basis, and sends the control information to the encoding section 102. The control information, which is provided by the mobile station, includes mobile station identification information to indicate to which mobile station the control information is directed. For example, the control information includes, as the mobile station ID information, a CRC masked by the ID number of the mobile station, to which the control information is sent. Control information is encoded in encoding section 102, modulated in modulation section 103, and received as input to allocation section 104, on a per mobile station basis. Furthermore, the control information generation section 101 allocates an arbitrary L1 / L2 CCH in a plurality of L1 / L2 CCHs for each mobile station, based on the number of CCEs required to send the control information, and sends the CCE number corresponding to CCH L1 / L2 assigned to assignment section 104. For example, when the number of CCEs required to send control information to mobile station # 1 is one and therefore CCH L1 / L2 # 1 is assigned to mobile station # 1, the information generation section Control 101 sends CCE # 1 number to allocation section 104. Furthermore, when the number of CCEs required to send control information to mobile station # 1 is four and therefore CCH L1 / L2 # 6 is assigned to mobile station # 1, the information generation section of control 101 sends CCE numbers # 8 to # 11 to allocation section 104.

On the other hand, the encoding section 105 encodes the transmission data for each mobile station (ie, downlink data) and sends the encoded transmission data to the relay control section 106.

After the initial transmission, the retransmission control section 106 contains the encoded transmission data on a per mobile station basis and sends the data to the modulation section 107. The retransmission control section 106 contains the transmission data until the Relay control section 106 receives as input an ACK from each mobile station from decision section 116. Furthermore, upon receiving as input a NACK from each mobile station from the decision section 116, that is, on retransmission, the retransmission control section 106 sends the transmission data associated with said NACK to the modulation section 107.

The modulation section 107 modulates the encoded transmission data received as input from the retransmission control section 106, and sends the result to the allocation section 104.

After transmission of control information, assignment section 104 assigns control information received as input from modulation section 103 into a physical resource based on the number of CCEs received as input from control information generation section 101 , and send the result to IFFT section 108. That is, the allocation section 104 allocates control information on the subcarrier corresponding to the number of CCEs in a plurality of subcarriers comprising an OFDM symbol, on a per mobile station basis.

On the other hand, when transmitting downlink data, the allocation section 104 allocates the transmission data, which is provided on a per mobile station basis, into a physical resource based on the result of the resource allocation, and sends the result to IFFT section 108. That is, based on the resource allocation result, the allocation section 104 allocates transmission data on a subcarrier to a plurality of subcarriers comprising an OFDM symbol, on a per mobile station basis.

The IFFT section 108 generates an OFDM symbol by performing an IFFT of a plurality of subcarriers in which control information or transmission data is assigned, and sends the OFDM symbol to the

ES 2 397 112 T3 CP junction section (cyclic prefix) 109.

The CP junction section 109 joins the same signal as the signal in the trailing end portion of the OFDM symbol, to the head of the OFDM symbol as CP.

Radio transmission section 110 performs transmission processing, such as D / A conversion, amplification and upconversion into OFDM symbol with CP, and transmits the result from antenna 111 to mobile station 200 (in Figure 6 ).

On the other hand, the radio reception section 112 receives a response signal transmitted from the mobile station 200, through the antenna 111, and performs reception processing, such as downconversion and A / D conversion of the answer signal.

The CP remove section 113 removes the CP attached to the response signal undergoing receive processing.

The non-broadcast section 114 does not broadcast the response signal by a Walsh sequence that is used for the second broadcast at the mobile station 200, and sends the non-broadcast response signal to the correlation processing section 115.

The correlation processing section 115 finds the correlation value between the response signal received as input from the non-broadcast section 114, that is, the response signal extended by a ZC sequence, and the ZC sequence that is used for the first broadcast at mobile station 200, and sends the correlation value to decision section 116.

Decision section 116 detects a correlation peak on a per mobile station basis, using a detection window defined per mobile station in the time domain, thereby detecting a response signal on a per mobile station basis. For example, upon detecting a correlation peak in detection window # 1 for mobile station # 1, decision section 116 detects the response signal from mobile station # 1. Next, decision section 116 decides whether the detected response signal is an ACK or NACK, and sends the ACK or NACK to relay control section 106 on a per mobile station basis.

On the other hand, in the mobile station 200 shown in FIG. 6, the radio reception section 202 receives the OFDM symbol transmitted from the base station 100, through the antenna 201, and performs reception processing, such as downconversion and A / D conversion on OFDM symbol.

The CP removal section 203 removes the CP attached to the OFDM symbol undergoing receive processing.

The FFT (Fast Fourier Transform) section 204 acquires the assigned downlink data or control information on a plurality of subcarriers by performing an OFDM symbol FFT, and outputs the downlink data or control information to extraction section 205.

Upon receiving the control information, the extraction section 205 extracts the control information from the plurality of subcarriers and sends it to the demodulation section 206. This control information is demodulated in the demodulation section 206, decoded in the demodulation section 206. decoding 207 and received as input in decision section 208.

On the other hand, upon receiving downlink data, the extraction section 205 extracts the downlink data directed to the mobile station from the plurality of subcarriers, based on the result of the resource allocation received as input from the decision section. 208, and sends the downlink data to demodulation section 210. This downlink data is demodulated in demodulation section 210, decoded in decoding section 211, and received as input in CCR section 212.

The CRC section 212 performs error detection of the decoded downlink data using a CRC, generates an ACK in the case of CRC = OK (that is, when no error is found), and a NACK in the case of CRC = NG (i.e. when an error is encountered), as a response signal, and sends the generated response signal to modulation section 213. Also, in the case of CRC = Ok (that is, when no error is found), the CRC section 212 sends the decoded downlink data as received data.

Decision section 208 performs blind detection of whether or not the control information received as decoding input from section 207 is directed to the mobile station. For example, decision section 208 decides that if CRC = OK is found (that is, if no error is found) as a result of unmasking by the mobile station ID number, the control information is directed to the mobile station. In addition, the decision section 208 sends the control information addressed to the mobile station, that is, the

ES 2 397 112 T3 result of the downlink data resource allocation for the mobile station, to the extraction section 205. In addition, the decision section 208 decides a PUCCH to use to transmit a response signal from the mobile station , from the number of CCEs associated with subcarriers in which the control information directed to the mobile station is assigned, and sends the decision result (ie, the PUCCH number) to the control section 209. For example, if the control information is assigned on a subcarrier corresponding to CCE # 1, decision section 208 of mobile station 200 assigned the CCH L1 / L2 # 1 above decides that the PUCCH # 1 assigned to CCE # 1 is the PUCCH for the mobile station. For example, if control information is assigned on subcarriers corresponding to CCE # 8 to CCE # 11, decision section 208 of mobile station 200 assigned to CCH L1 / L2 # 6 above decides that PUCCH # 8 assigned to CCE # 8, which has the minimum number between CCE # 8 and CCE # 11, is the PUCCH directed to the mobile station.

Based on the PUCCH number received as input from decision section 208, control section 209 controls the cyclic shift value of the ZC sequence that is used for the first broadcast in broadcast section 214 and the Walsh sequence that is used for the second broadcast in broadcast section 217. That is, the control section 209 establishes a ZC sequence of the cyclic shift value assigned to the received PUCCH number as input from the decision section 208, in the broadcast section 214, and the Walsh sequence assigned to the received PUCCH number is established. as input from decision section 208, in broadcast section 217. Sequence control in control section 209 will be described later in detail.

Modulation section 213 modulates the response signal received as input from CRC section 212 and sends the result to broadcast section 214.

As shown in FIG. 1, the broadcast section 214 performs the first broadcast of the response signal by the ZC sequence established in the control section 209, and sends the response signal subjected to the first broadcast to the IFFT section. 215.

As shown in FIG. 1, the IFFT section 215 performs an IFFT of the response signal subjected to the first broadcast, and sends the response signal under an IFFT to the CP junction section 216.

The CP junction section 216 joins the same signal as the tail end of the response signal subjected to an IFFT, to the head of the response signal as a CP.

As shown in Figure 1, the broadcast section 217 performs a second broadcast of the response signal with a CP using the Walsh sequence established in the control section 209, and sends the response signal subjected to the second broadcast. to radio transmission section 218.

Radio transmission section 218 performs transmission processing, such as D / A conversion, amplification, and upconversion on the response signal subjected to the second broadcast, and transmits the resulting signal from antenna 201 to base station 100. (in figure 5).

According to the present embodiment, a response signal is subjected to two-dimensional diffusion, by a first diffusion using a ZC sequence and the second diffusion using a Walsh sequence. That is, the present embodiment broadcasts a response signal on the cyclic shift axis and on the Walsh axis.

Next, the sequence control in the control section 209 (in FIG. 6) will be explained in detail.

If the ZC sequences are used for the first broadcast of a response signal, as described above, a sufficient cyclic change value difference (eg cyclic change value difference of 4) is provided between the ZC sequences, to an extent that it does not cause interference between the codes between the ZC sequences. Therefore, the orthogonality between the response signals subjected to the first diffusion by using ZC sequences of different cyclic shift values is unlikely to collapse. In contrast, as described above, when there is a fast moving mobile station, the orthogonality between the Walsh sequences used for the second broadcast is likely to collapse.

Therefore, the present embodiment controls the ZC sequences and the Walsh sequences according to the assignments shown in Figure 7, such that the interference components in the response signals were kept under non-diffusion in the non-diffusion section 114 (in Figure 5) are absorbed by a small difference between the cyclic displacement values of the ZC sequences. That is, the control section 209 controls the cyclic shift values of the ZC sequences that are used for the first broadcast in the broadcast section 214 and the Walsh sequences that are used for the second broadcast in the broadcast section 217, according to the assignments shown in figure 7.

Figure 7 maps PUCCH # 1 to ZC # 0 and W # 0, PUCCH # 2 to ZC # 4 and W # 0, PUCCH # 3 to ZC # 8 and W # 0, PUCCH # 4 to ZC # 1 and # W 1, PUCCH # 5 to ZC # 5 and W # 1, PUCCH # 6 to ZC # 9 and W # 1, PUCCH # 7 to ZC # 2 and W # 2, PUCCH # 8 to ZC # 6 and W # 2, PUCCH # 9 to ZC # 10 and W # 2, PUCCH # 10 to ZC # 3 and W # 3, PUCCH # 11 to

IS 2 397 112 T3

ZC # 7 and W # 3, and PUCCH # 12 to ZC # 11 and W # 3.

Therefore, for example, upon receiving PUCCH number # 1 as input from decision section 208, control section 209 sets ZC # 0 in broadcast section 214 and W # 0 in broadcast section 217. Furthermore For example, upon receiving PUCCH number # 2 from decision section 208 as input, control section 209 sets ZC # 4 in broadcast section 214 and W # 0 in broadcast section 217. Also, for example, upon receiving PUCCH number # 4 from decision section 208 as input, control section 209 sets ZC # 1 in broadcast section 214 and W # 1 in broadcast section 217.

Here, in Figure 7, the ZC sequences for the first diffusion using W # 1 in the second diffusion (i.e., ZC # 1, ZC # 5 and ZC # 9) are obtained by performing a cyclic shift of the sequences ZC for the first broadcast using W # 0 in the second broadcast (ie ZC # 0, ZC # 4, and ZC # 8). Furthermore, the ZC sequences for the first diffusion using W # 2 in the second diffusion (i.e., ZC # 2, ZC # 6 and ZC # 10) are obtained by performing a cyclic shift of the ZC sequences for the first diffusion. using W # 1 in the second broadcast (ie ZC # 1, ZC # 5 and ZC # 9). Furthermore, the ZC sequences for the first diffusion using W # 3 in the second diffusion (i.e., ZC # 3, ZC # 7 and ZC # 11) are obtained by performing a cyclic change of the ZC sequences for the first diffusion. using W # 2 in the second broadcast (ie ZC # 2, ZC # 6 and ZC # 10).

Furthermore, in Figure 7, the difference between the cyclic shift values of the ZC sequences assigned to different adjacent Walsh sequences is less than the difference between the cyclic shift values of the ZC sequences assigned to the same Walsh sequence. For example, while the difference of the cyclic shift value is 1 between ZC # 0 assigned to W # 0 and ZC # 1 assigned to W # 1, the difference of the cyclic shift value is 4 between ZC # 0 and ZC # 4 assigned to W # 0.

Thus, in Figure 7, the ZC sequences are cyclically shifted by one each time the Walsh sequence number is increased by one. That is, in the present embodiment, the minimum difference is 1 between the values of the cyclic shifts of the adjacent ZC sequences assigned to Walsh sequences. In other words, in Figure 7, adjacent Walsh sequences are assigned to the ZC sequences of different cyclic shift values and are used for two-dimensional diffusion for the response signals. Therefore, even when inter-code interference occurs between Walsh sequences due to the drop in orthogonality between Walsh sequences, it is possible to suppress inter-code interference by spreading the use of ZC sequences. For example, referring to Figure 7, a response signal that is transmitted using PUCCH # 4 is subjected to two-dimensional broadcast using ZC # 1 and W # 1, and a response signal that is transmitted using PUCCH # 7 is subjected to two-dimensional diffusion using ZC # 2 and W # 2. Therefore, even when inter-code interference occurs between W # 1 and W # 2 due to collapse of orthogonality between W # 1 and W # 2, it is possible to suppress inter-code interference by a small difference between the values. cyclic displacement ZC # 1 and ZC # 2.

On the other hand, in Figure 7, as ZC # 1 and ZC # 2, adjacent ZC sequences of cyclic displacement values are used, that is, ZC sequences, between which the difference of the cyclic displacement value is 1. By means of These means, the orthogonality between the ZC sequences can collapse, causing cross-code interference between the ZC sequences. However, in Figure 7, the ZC sequences, between which a difference of the cyclic shift value is 1, are assigned to different Walsh sequences and used for the two-dimensional diffusion of response signals. Therefore, even when inter-code interference occurs between ZC sequences due to orthogonality collapse between ZC sequences, it is possible to suppress interference between broadcast codes using Walsh sequences. For example, referring to Figure 7, a response signal that is transmitted using PUCCH # 4 is subjected to two-dimensional broadcast using ZC # 1 and W # 1, and a response signal that is transmitted using PUCCH # 7 is subjected to two-dimensional diffusion using ZC # 2 and W # 2. Therefore, even when inter-code interference occurs between ZC # 1 and ZC # 2, it is possible to suppress inter-code interference by the difference between the sequences of W # 1 and # 2 W.

Therefore, the present embodiment absorbs the orthogonality collapse on the Walsh axis (that is, inter-code interference between Walsh sequences), on the cyclic displacement axis, and absorbs the orthogonality collapse on the cyclic displacement axis. (that is, inter-code interference between ZC sequences), on the Walsh axis. In other words, the present embodiment compensates for inter-code interference between Walsh sequences caused by the collapse of the orthogonality between the Walsh sequences, by increasing the diffusion of the ZC sequence, and compensates for inter-code interference between the ZC sequences. caused by the collapse of the orthogonality between the ZC sequences, by the diffusion gain of the Walsh sequence. Therefore, according to the present embodiment, it is possible to minimize the performance degradation of the separation of the code multiplexed response signals.

Figure 8 generalizes the assignments shown in Figure 7. That is, Figure 8 illustrates a case where signals are transmitted using a plurality of first sequences that can be separated from each other because of different cyclic shift values and a plurality of second orthogonal sequences. That is, of

ES 2 397 112 T3 according to figure 8, when the difference between the cyclic shift values of a plurality of first sequences assigned to the same second sequence is k, the difference between the cyclic shift values of a plurality of first assigned sequences to a plurality of second adjacent sequences is Δ (Δ <k). That is, in Figure 8, the first sequences are shifted by Δ each time the number of second sequences is increased by one.

Furthermore, as described above, the present embodiment can compensate for inter-code interference between Walsh sequences by ZC sequence diffusion gain, and compensate for inter-code interference between ZC sequences by increasing sequence diffusion. by Walsh. Therefore, it is possible to make the difference between the values of the cyclic shifts of the ZC sequences assigned to the same Walsh sequence less than 4 in figure 7. Figure 9 illustrates a case where this difference is 2. While twelve PUCCHs from PUCCH # 1 to PUCCH # 12 are available in figure 7, twenty-four PUCCHs from PUCCH # 1 to PUCCH # 24 are available in figure 9. In other words, while twelve code resources out of forty-eight code resources are used in Figure 7, twenty-four code resources out of forty-eight code resources are used in Figure 9. That is, the present embodiment can increase the efficiency of the use of limited code resources and maximize the efficiency of the use of code resources.

Furthermore, if the assignments shown in figure 10 are used, it is also possible to produce the same effect as in the case of using the associations shown in figure 9.

(Embodiment 2)

As shown in Figure 11, when W # 0 is (1, 1, 1, 1) and W # 1 is (1, -1, 1, -1), the first two-chip units in W # 0 and W # 1 are orthogonal to each other, and the second units of two chips are orthogonal to each other. Similarly, when W # 2 is (1, 1, -1, -1) and W # 3 is (1, -1, -1, 1), the first two-chip units in W # 2 and W # 3 are orthogonal to each other, and the second units of two chips are orthogonal to each other. Therefore, if the channel state change is small enough over two time symbol periods, there is no inter-code crosstalk between W # 0 and W # 1 and no inter-code crosstalk between W # 2 and W # 3. Therefore, it is possible to separate a plurality of code-multiplexed response signals per broadcast second using W # 0 and W # 1, into the first two-chip units and the second two-chip units. Similarly, it is possible to separate a plurality of code multiplexed response signals by the second broadcast using W # 2 and W # 3, into the first two-chip units and the second two-chip units.

Therefore, with the present embodiment, the control section 209 controls the cyclic shift value of a ZC sequence that is used for the first diffusion in the diffusion section 214 and a Walsh sequence that is used for the second diffusion in broadcast section 217 according to the assignments shown in FIG.

12. In Figure 12, the values of the cyclic shifts of the ZC sequences assigned to W # 0 and the values of the cyclic shifts of the ZC sequences assigned to W # 1 are the same in 0, 2, 4, 6, 8 and 10, and the cyclic shift values of the ZC sequences assigned to W # 2 and the cyclic shift values of the ZC sequences assigned to W # 3 are the same in 1, 3, 5, 7, 9, and 11.

Here, for example, to separate the response signal subjected to the second broadcast by W # 0 when W # 0, W # 1 and W # 2 are used for the second broadcast at the same time, the sum of S0, S1 is calculated , S2 and S3 in figure 1. By this means, it is possible to eliminate the components of the response signal broadcast by W # 1 and W # 2, from a received signal. However, if a mobile station using W # 1 and a mobile station using W # 2 move fast, the difference per channel variation was kept in a separate response signal as inter-code interference.

That is, referring to W # 1, S0 and S1 have different signs, and therefore the response signal component transmitted by W # 1 is removed by adding S0 and S1. But the inter-code interference of Δ # 1 by channel variation remained in the separate response signal. If the channel variation is linear, similarly, the inter-code interference of Δ # 1 is kept in the response signal separated between S2 and S3. Therefore, the inter-code crosstalk of 2XA # 1 in total was kept in the separate answer signal.

On the other hand, referring to W # 2, S0 and S1 have the same sign, and therefore the response components of the signal propagated by W # 2 are eliminated by the difference between the signs of S2 and S3. In this case, the inter-code crosstalk of 4xΔ # 2 in total was kept in the separate answer signal.

That is, inter-code interference is reduced between a plurality of response signals subjected to code multiplexing using a plurality of Walsh sequences, among which the first two-chip units are orthogonal to each other and the second two-chip units. they are orthogonal to each other. Therefore, the present embodiment uses different Walsh sequences with little inter-code interference (eg, W # 0 and W # 1) in combination with ZC sequences of the values of the same cyclic shifts, and uses different Walsh sequences with significant inter-code interference (eg, W # 0 and W # 2) in combination with ZC sequences of different cyclic shift values.

IS 2 397 112 T3

As described above, according to the present embodiment, by performing the second broadcast response signals using Walsh sequences in which parts of the sequences shorter than the length of the sequence are orthogonal to each other, it is Possible to improve the robustness to fast movement of mobile stations.

(Embodiment 3)

In code multiplexing by first broadcast using ZC sequences, that is, in code multiplexing on the cyclic shift axis, as described above, a sufficient difference is provided between the values of the cyclic shifts of the ZC sequences , to an extent that they do not cause inter-code interference between the ZC sequences. Therefore, the orthogonality between the ZC sequences is unlikely to collapse. Also, even if there is a fast moving mobile station, the orthogonality between the ZC sequences does not collapse. On the other hand, in code multiplexing by second broadcasting using Walsh sequences, that is, code multiplexing on the Walsh axis, as described above, the orthogonality between the Walsh sequences is likely to collapse when not there is a fast moving mobile station. Therefore, code multiplexing of the response signals in a second broadcast may be preferable to increase the average level of multiplexing on the cyclic axis of travel where orthogonality is unlikely to collapse, and the average level of multiplexing is lowered. on the Walsh axis, where the orthogonality is likely to collapse. Furthermore, it may be preferable to equalize (unify) the multiplexing level on the Walsh axis between the ZC sequences, such that the multiplexing level on the Walsh axis is not extremely high only in the response signal under the first broadcast. by a certain ZC sequence. That is, when a response signal is subject to two-dimensional diffusion, both on the cyclic displacement axis and the Walsh axis, it may be preferable to reduce the average multiplexing level on the Walsh axis and equalize (unify) the levels multiplexing on the Walsh axis between the ZC sequences.

That is, the present embodiment controls the ZC sequences and the Walsh sequences according to the assignments shown in Figure 13. That is, the control section 209 controls the cyclic shift value of a ZC sequence that is used for the former broadcast in broadcast section 214 and a Walsh sequence that is used for the second broadcast in broadcast section 217 according to the assignments shown in the figure

13.

Here, in CCE # 1 to CCE # 12 mapped to PUCCH # 1 to PUCCH # 12 shown in Figure 13, the probability P of using the response signal physical resources (i.e., physical resources for PUCCH) corresponding to the CCE numbers or the priority level of the CCEs decreases in order from cCe # 1, CCE # 2, ..., CCE # 11 and CCE # 12. That is, when the CCE number increases, the previous probability P decreases from monotonic form. Therefore, the present embodiment assigns PUCCHs to ZC sequences and Walsh sequences, as shown in Figure 13.

That is, referring to the first and second rows along the Walsh axis (i.e. W # 0 and W # 1) in Figure 13, PUCCH # 1 and PUCCH # 6 are multiplexed, and PUCCH # 2 and PUCCH # 5 are multiplexed. Therefore, the sum of the numbers of PUCCHs of PUCCH # 1 and PUCCH # 6, 7, is equal to the sum of the numbers of PUCCHs PUCCH # 2 and PUCCH # 5, 7. That is, on the Walsh axis , the low-numbered PUCCHs and the high-numbered PUCCHs are associated and assigned. The same applies to PUCCH # 3, PUCCH # 4, and PUCCH # 7 to PUCCH # 12. Also, the same applies to the third row (W # 2) and the fourth row (W # 3) on the axis of Walsh. That is, in Figure 13, between adjacent ZC sequences, the sum of the numbers of PUCCHs (ie, the sum of the numbers of CCEs) adjacent to Walsh sequences is equal. Therefore, in Figure 13, the mean multiplex levels on the Walsh axis are substantially equal (substantially uniform).

Furthermore, to equalize (unify) the multiplexing level on the Walsh axis between the ZC sequences when the difference between the values of the cyclic shifts of the ZC sequences assigned to the same Walsh sequence is 2 (in figure 9) , it is preferable to control the ZC sequences and the Walsh sequences according to the assignments shown in Figure 14.

In CCE # 1 to CCE # 24 assigned to PUCCH # 1 to PUCCH # 24, the probability P of using the physical resources for response signals corresponding to the number of CCEs or the priority level of the CCEs is shown in figure 14. decreases in order from CCE # 1, CCE # 2, ..., CCE # 23 and CCE # 24. That is, as described above, when the number of CCEs is increased, the previous probability P decreases in a monotonic way .

Referring to the first and third rows on the Walsh axis (ie W # 0 and W # 2) in Figure 14, PUCCH # 1 and PUCCH # 18 are multiplexed, and PUCCH # 2 and PUCCH # 17 are multiplexed. Therefore, the sum of the numbers of PUCCHs PUCCH # 1 and PUCCH # 18, 19, is equal to the sum of the numbers of PUCCHs PUCCH # 2 and PUCCH # 17, 19. Also, referring to the second and fourth rows along the Walsh axis (i.e. W # 1 and W # 3) in Figure 14, PUCCH # 12 and PUCCH # 19 are multiplexed, and PUCCH # 11 and PUCCH # 20 they are multiplexed. Therefore, the sum of the numbers of PUCCHs PuCCH # 12 and PUCCH # 19, 31, is equal to the

ES 2 397 112 T3 sum of the numbers of PUCCHs PUCCH # 11 and PUCCH # 20, 31 are equal. That is, on the Walsh axis, low-numbered PUCCHs and high-numbered PUCCHs are associated and assigned. The same applies to PUCCH # 3 to PUCCH # 10, PUCCH # 13 to PUCCH # 16, and PUCCH # 21 to PUCCH # 24. That is, in Figure 14, similar to Figure 13, between adjacent ZC sequences, the sum of the PUCCH numbers (that is, the sum of the CCE numbers) of adjacent Walsh sequences is equal. Therefore, in Figure 14, similar to Figure 13, the average multiplex levels on the Walsh axis are substantially equal (substantially uniform).

Therefore, the present embodiment assigns PUCCHs (i.e., CCEs) to sequences that are used for two-dimensional broadcast, based on the probability P of using physical resources for response signals corresponding to the CCE numbers or the priority level of the CCEs. Hereby, the average level of multiplexing on the Walsh axis, that is, the expected values of the number of PUCCHs multiplexed on the Walsh axis are substantially the same (or substantially uniform). Thus, according to the present embodiment, the multiplexing level on the Walsh axis is not extremely high, only in a response signal under the first diffusion by a given ZC sequence, so that it is possible to minimize the influence when the orthogonality between the Walsh sequences it collapses. Therefore, according to the present embodiment, it is possible to suppress the degradation of the separation ability of response signals subjected to code multiplexing by the second broadcast.

The embodiments of the present invention have been described above.

Also, Figure 7, Figure 9, Figure 10, Figure 12, Figure 13 and Figure 14 illustrate a use case of four Walsh sequences from W # 0 to W # 3. But, in the case of using two, three, five or more Walsh sequences, it is equally possible to practice the present invention in the same manner as above.

Furthermore, the above embodiment shows a configuration to compensate for inter-code interference between Walsh sequences by the ZC sequence diffusion gain. But the present invention is applicable not only to the cases where complete orthogonal sequences, such as Walsh sequences, are used for the second diffusion, but it is also for the cases where, for example, incomplete orthogonal sequences are used, such as PN sequences for the second broadcast. In this case, the inter-code interference due to incomplete orthogonality of PN sequences is compensated by an increase in the diffusion of the ZC sequence. That is, the present invention is applicable to any radio communication apparatus that use sequences, which can be separated from each other due to different cyclic shift values, for the first broadcast and sequences, which can be separated due to sequence differences. , for the second broadcast.

Furthermore, a case has been described above with the embodiments in which a plurality of response signals from a plurality of mobile stations are code multiplexed. But, it is also possible to practice the present invention, even when a plurality of reference signals (eg pilot signals) from a plurality of mobile stations are code multiplexed. As shown in Figure 15, when three symbols of the reference signals R0, R1, and R2 are generated from a ZC sequence (with a sequence length of 12), first, the ZC sequence is subjected to a IFFT in association with orthogonal sequences (F0, F1, F2) with a sequence length of 3. By means of this IFFT, it is possible to acquire a ZC sequence with a sequence length of 12 in the time domain. Then, the signal subjected to an IFFT extends the use of orthogonal sequences (F0, F1, F2). That is, a reference signal (ie, ZC sequence) is assigned to three symbols R0, R1, and R2. Similarly, other mobile stations assign a reference signal (ie, ZC sequence) to three symbols R0, R1, and R2. Here, individual mobile stations use ZC sequences of different time domain cyclic shift values or of different orthogonal sequences. Here, the sequence length of the time domain ZC sequences is 12, so it is possible to use twelve ZC sequences of cyclic shift values 0 to 11, generated from the same ZC sequence. Furthermore, the sequence length of orthogonal sequences is 3, so that it is possible to use three different orthogonal sequences. Therefore, in an ideal communication environment, code multiplexing of a maximum of thirty-six (12 x 3) response signals from mobile stations is possible.

Furthermore, a PUCCH used in the embodiments described above is a channel for feeding back an ACK or NACK and can therefore be referred to as an ACK / NACK channel.

Also, a mobile station can be called a UE, a base station can be called a Node B, and a subcarrier can be called a tone. Furthermore, a CP can be referred to as a GI (guard interval).

Also, the error detection procedure is not limited to a CRC.

Furthermore, a method of performing transformation between frequency domain and time domain is not limited to IFFT and FFT.

Furthermore, a case which has been described with the above-described embodiments in which the present is applied

ES 2 397 112 T3 invention to mobile stations. However, the present invention is also applicable to a fixed radio communication terminal apparatus in a steady state and a radio communication relay station apparatus that performs the same operations with a base station as a mobile station. That is, the present invention is applicable to all radio communication apparatus.

Although a case with the above embodiments has been described as an example where the present invention is implemented with hardware, the present invention can be implemented with software.

Furthermore, each function block employed in the description of each of the aforementioned embodiments can typically be implemented as an LSI made up of an integrated circuit. These can be individual chips or contained partially or totally on a single chip. LSI has been adopted here, but this can also be referred to as IC, '' LSI system, super LSI, or ultra LSI depending on the different integration extensions.

Furthermore, the circuit integration procedure is not limited to LSIs, and implementation using a dedicated circuit or general-purpose processors is also possible. After LSI fabrication, it is also possible to use an FPGA (Field Programmable Gate Array) or reconfigurable processor where cell connections and settings in an LSI circuit can be reconfigured.

Furthermore, if integrated circuit technology comes to replace LSIs as a result of the advancement of semiconductor technology or other derived technology, it is also naturally possible to carry out block function integration using this technology. The application of biotechnology is also possible.

The reader also refers to the descriptions of Japanese Patent Application 2007-159580, filed June 15, 2007, and Japanese Patent Application No. 2007-161966, filed June 19, 2007.

Industrial applicability

The present invention is applicable to, for example, mobile communication systems.

Contents6

83 members in 13 offices

This recordMember, by publication date3 more offices are in the list below

Members83

Family members, oldest first
Document	Office	Kind
WO2008152819A1	World Intellectual Property Organization (WIPO)	A1	2008-12-18
MX2009011333A	Mexico	A	2010-02-11
EP2159925A1	European Patent Office (EPO)	A1	2010-03-03
KR20100031665A	Republic of Korea	A	2010-03-24
US2010118919A1	United States of America	A1	2010-05-13
CN101720531A	China	A	2010-06-02
JP2010136448A	Japan	A	2010-06-17
JP2010141923A	Japan	A	2010-06-24
JP4505043B2	Japan	B2	2010-07-14
JPWO2008152819A1	Japan	A1	2010-08-26
JP4546580B2	Japan	B2	2010-09-15
US2010296384A1	United States of America	A1	2010-11-25
US7848299B1	United States of America	B1	2010-12-07
RU2009146294A	Russian Federation	A	2011-06-20
EP2159925A4	European Patent Office (EPO)	A4	2011-08-17
US8009721B2	United States of America	B2	2011-08-30
JP4768862B2	Japan	B2	2011-09-07
JP2011176895A	Japan	A	2011-09-08
US2011249707A1	United States of America	A1	2011-10-13
JP2011211750A	Japan	A	2011-10-20
JP4846060B2	Japan	B2	2011-12-28
JP4872029B1	Japan	B1	2012-02-08
JP2012029302A	Japan	A	2012-02-09
US2012039258A1	United States of America	A1	2012-02-16
US2012063292A1	United States of America	A1	2012-03-15
US8179947B2	United States of America	B2	2012-05-15
EP2458759A2	European Patent Office (EPO)	A2	2012-05-30
JP4948662B2	Japan	B2	2012-06-06
US8199792B2	United States of America	B2	2012-06-12
EP2458759A3	European Patent Office (EPO)	A3	2012-06-20
JP2012151861A	Japan	A	2012-08-09
US8311079B2	United States of America	B2	2012-11-13
EP2159925B1	European Patent Office (EPO)	B1	2012-12-05
US2013034077A1	United States of America	A1	2013-02-07
KR20130019009A	Republic of Korea	A	2013-02-25
ES2397112T3This record	Spain	T3	2013-03-04
DK2159925T3	Denmark	T3	2013-03-11
RU2480908C2	Russian Federation	C2	2013-04-27
EP2621119A1	European Patent Office (EPO)	A1	2013-07-31
EP2458759B1	European Patent Office (EPO)	B1	2013-08-07
ES2425780T3	Spain	T3	2013-10-17
DK2458759T3	Denmark	T3	2013-10-28
CN101720531B	China	B	2013-11-27
JP5350505B2	Japan	B2	2013-11-27
JP2014003678A	Japan	A	2014-01-09
CN103546227A	China	A	2014-01-29
CN103546228A	China	A	2014-01-29
RU2012158156A	Russian Federation	A	2014-07-10
KR101425249B1	Republic of Korea	B1	2014-08-01
KR101425326B1	Republic of Korea	B1	2014-08-01
JP5571835B2	Japan	B2	2014-08-13
JP2014212559A	Japan	A	2014-11-13
RU2537694C2	Russian Federation	C2	2015-01-10
EP2621119B1	European Patent Office (EPO)	B1	2015-01-28
US8953544B2	United States of America	B2	2015-02-10
ES2533346T3	Spain	T3	2015-04-09
US2015155910A1	United States of America	A1	2015-06-04
JP5740034B2	Japan	B2	2015-06-24
EP2892170A1	European Patent Office (EPO)	A1	2015-07-08
BRPI0812534A2	Brazil	A2	2015-09-29
HK1212117A1	Hong Kong, China	A1	2016-06-03
RU2014150994A	Russian Federation	A	2016-07-10
US9484982B2	United States of America	B2	2016-11-01
US2017026077A1	United States of America	A1	2017-01-26
CN103546227B	China	B	2017-04-12
CN103546228B	China	B	2017-08-08
RU2014150994A3	Russian Federation	A3	2018-08-07
RU2678334C2	Russian Federation	C2	2019-01-28
US10200083B2	United States of America	B2	2019-02-05
EP2892170B1	European Patent Office (EPO)	B1	2019-04-24
US2019149188A1	United States of America	A1	2019-05-16
EP3540989A1	European Patent Office (EPO)	A1	2019-09-18
PL2892170T3	Poland	T3	2019-10-31
ES2735877T3	Spain	T3	2019-12-20
BRPI0812534B1	Brazil	B1	2020-04-28
RU2019101507A	Russian Federation	A	2020-07-21
BR122019021860B1	Brazil	B1	2020-11-03
US10958303B2	United States of America	B2	2021-03-23
US2021194537A1	United States of America	A1	2021-06-24
RU2019101507A3	Russian Federation	A3	2021-11-15
RU2763957C2	Russian Federation	C2	2022-01-11
EP3540989B1	European Patent Office (EPO)	B1	2023-10-25
ES2968530T3	Spain	T3	2024-05-10

Wireless communication apparatus and response signal spreading method

Abstract

Term

IS 2 397 112 T3

DESCRIPTION

IS 2 397 112 T3

IS 2 397 112 T3

IS 2 397 112 T3

IS 2 397 112 T3

Members83

Numbers

Titles2

Classification