ES2654346T3

Method and device for uplink resource allocation

Abstract

A method for transmitting an uplink signal by a communication device in a wireless communication system, the method comprising: receiving, by the communication device, a control channel signal that includes a resource allocation field (RA ); and transmit, by the communication device, an uplink signal according to the control channel signal, wherein a size of the resource allocation field in the control channel signal is represented by the following equation: ** (See equation) ** where, NRBUL is the number of uplink resource blocks (RB) (UL), P is an uplink group size (RBG) size of uplink (UL), ⌈ ⌉ is a ceiling function , Max (x, y) is the largest of xe ** (See equation) **

ES2654346T3, drawing sheet 1 — Sheet 1 of 43

Term

5 yearsto projected expiry

Projected expiry 14 September 2031, counted from filing; an application has no term until it is granted.

14 claims: 2 independent, 12 dependent

1
ES 2 654 346 T3 ES 2 654 346 T3 CLAIMS REIVINDICACIONES 1. A method of transmitting an uplink signal by a communication device in a wireless communication system, the method comprising:1. Un método para transmitir una señal de enlace ascendente por un dispositivo de comunicación en un sistema de comunicación inalámbrica, el método que comprende: receiving, by the communication device, a control channel signal that includes a resource allocation field (RA);and transmitting, by the communication device, an uplink signal according to the control channel signal, wherein a size of the resource allocation field in the control channel signal is represented by the following equation: recibir, por el dispositivo de comunicación, una señal de canal de control que incluye un campo de asignación de recursos (RA);y transmitir, por el dispositivo de comunicación, una señal de enlace ascendente según la señal de canal de control, en donde un tamaño del campo de asignación de recursos en la señal de canal de control se representa por la siguiente ecuación: (Ττν / Λ- / p + iT | ' Max '° g2(l1 RB4 Ί) (Ττν/Λ- / p + iT| ’ Max ’°g2(l1 RB4 Ί) Plog2(7VRorBL(^BL +1)/2)1 / Plog2(7VRuBL(^BL +1)/2)1 / donde, NRB es el número de bloques de recursos (RB) de enlace ascendente (UL), P es un tamaño de Grupo de Bloques de Recursos (RBG) de enlace ascendente (UL), P 1 es una función techo, Max(x, y) es el mayor de x e whereRB is the number of uplink (UL) resource blocks (RB), P is an uplink (UL) Resource Block Group (RBG) size, P 1 is a ceiling function, Max (x, y) is the oldest of xe y.yWes XX-1)-'1 y.yWes XX-1)-'1
8
A communication device for use in a Wireless communication system and comprising:8. Un dispositivo de comunicación para uso en un sistema de comunicación Inalámbrica y que comprende: a radio frequency (RF) unit;and a processor, wherein the processor is configured to receive a control channel signal including a resource allocation field (RA), and transmit an uplink signal according to the control channel signal, and wherein a size of the resource allocation field in the control channel signal is represented by the following equation: una unidad de radiofrecuencia (RF);y un procesador, en donde el procesador está configurado para recibir una señal de canal de control que Incluye un campo de asignación de recursos (RA), y transmitir una señal de enlace ascendente según la señal de canal de control, y en donde un tamaño del campo de asignación de recursos en la señal de canal de control se representa por la siguiente ecuación: íí / vll · / p + il · ' Max '° g2(l ' RB4 Ί) íí/vll· / p+il· ’ Max ’°g2(l' RB4 Ί) A + 1) / 2) j / A + 1)/2) j / donde, N/ es el número de bloques de recursos (RB) de enlace ascendente (UL), P es un tamaño de Grupo de Bloques de Recursos (RBG) de enlace ascendente (UL), [ | es una función techo, Max(x, y) es el mayor de x e ί x3 χ(χ-1)···(χ-^+1) y,Wes ' 1 where, N / is the number of uplink (UL) Resource Blocks (RB), P is an uplink (UL) Resource Block Group (RBG) size, [| is a ceiling function, Max (x, y) is the largest of xe ί x3 χ (χ-1) ··· (χ - ^ + 1) y, Wands' 1

Independent claims2

424 paragraphs in 19 sections, as filed

ES 2 654 346 T3

DESCRIPTION

Method and device for uplink resource allocation

Technical field

The present invention relates to a wireless communication system, and more particularly to a method and apparatus for performing contiguous and non-contiguous uplink resource allocation.

Background of the technique

Wireless communication systems have been widely used to provide various types of communication services such as voice or data services. Generally, a wireless communication system is a multiple access system that can communicate with multiple users by sharing available system resources (bandwidth, transmission power (Tx), and the like). A variety of multiple access systems can be used. For example, a Code Division Multiple Access (CDMA) system, a Frequency Division Multiple Access (FDMA) system, a Time Division Multiple Access (TDMA) system, a Orthogonal Frequency (OFDMA), a Single Carrier Frequency Division Multiple Access (SC-FDMA) system, and the like.

Another example can be found in the 3GPP document: R1-103889, "UL Non-contiguous Transmission for CA"

Description

Technical problem

Accordingly, the present invention is directed to a method and apparatus for performing uplink resource allocation in a wireless communication system that substantially obviates one or more problems due to limitations and disadvantages of the related art. An object of the present invention is to provide a method and apparatus for efficiently allocating resources in a wireless communication system. Another object of the present invention is to provide a method and apparatus for contiguously or non-contiguously allocating resources for transmitting an uplink signal (UL).

It will be appreciated by those skilled in the art that the objects that can be achieved through the present invention are not limited to what has been particularly described above and the above and other objects that the present invention can achieve will be further understood. clearly from the following detailed description taken in conjunction with the accompanying drawings.

Technical solution

The object of the present invention can be achieved by providing a method for transmitting an uplink signal in a wireless communication system, the method including: receiving a control channel signal that includes a resource allocation field (RA); and transmitting an uplink signal according to the control channel signal, wherein a size of the resource allocation field is represented by the following equation:

Equation

where, is the number of uplink (UL) Resource Blocks (RB), P is an uplink (UL) Resource Block Group (RBG) size, [| is a ceiling function, Max (x, y) is the largest of x and y, and χΊ χ (χ-1) ··· (χ- j '+ l) y) is Χ ^ ”ΐ) ··· ΐ

In another aspect of the present invention, a communication device for use in a wireless communication system includes: a radio frequency (RF) unit; and a processor, wherein the processor is configured to receive a control channel signal including a resource allocation field (RA), and to transmit an uplink signal according to the control channel signal, wherein a size of the resource allocation field is represented by the following equation:

Equation

ES 2 654 346 T3

Max ° g2(

I), [log2(^ (<+1) / 2) 1 where, it is ®l number of Uplink Resource Blocks (RB) (UL), P is a Group size of

Uplink Resource Blocks (RBG) (UL), [| is a ceiling function, Max (x, y) is the largest of x and y, yfx (x -1) · · (x - y +1)

W is.

P can be given by the following table:

Table

where the UL RBG size is the number of contiguous RBs.

The resource allocation (RA) field may include information indicating a combinatorial index (r) used to indicate two sets of resource blocks (RB), where each set of RBs includes one or more contiguous RBGs, and the combinatorial index (r) is given by the following equation:

Equation

where M 'is 4, N is (UL RBG number + 1), so and si are used to indicate a start RBG index and an end RBG index of a first set of RBs, respectively, and S2 and S3 are used to indicate a start RBG index and an end RBG index of a second set of RBs, respectively.

The start RBG index and the end RBG index of the first RB set can be indicated by so and Si-1, respectively, and the start RBG index and the end RBG index of the second RB set can be specified. can be indicated by S2 and S3-I, respectively.

{s¡ Γη 'PEUto satisfy 1 <s, <N and s, <s, + i.

bits indicating the combinatorial index (r) may be contained in a Least Significant Part (LSB) part of the resource allocation field (RA).

The control channel signal may be a Physical Downlink Control Channel (PDCCH) signal, and the uplink signal may be a Physical Uplink Shared Channel (PUSCH) signal. Advantageous effects

Exemplary embodiments of the present invention have the following effects. According to embodiments of the present invention, resources can be efficiently allocated in a wireless communication system. In more

In detail, a contiguous or non-contiguous resource allocation can be carried out for uplink transmission.

It will be appreciated by those skilled in the art that the effects achievable through the present invention are not limited to what has been particularly described above and other advantages of the present invention will be more clearly understood from the foregoing. following detailed description taken in conjunction with the accompanying drawings.

Description of the drawings

The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.

FIG. 1 shows an exemplary radio frame structure for use in a 3 Cooperative Project system.to Generation (P).

FIG. 2 exemplary shows a resource grid of a downlink (DL) slot.

FIG. 3 exemplarily shows a downlink (DL) frame structure.

FIG. 4 exemplarily shows an uplink subframe structure (UL).

FIG. 5 exemplarily shows a correspondence between a virtual resource block (VRB) and a physical resource block (PRB).

FIGS. 6A through 6C exemplarily show legacy LTE resource allocation types 0-2.

FIGS. 7A and 7B are block diagrams illustrating a Discrete Fourier Transform Propagation Orthogonal Frequency Division Multiple Access (DFT-s-OFDMA) transmitter and receiver.

FIG. 8 is a conceptual diagram illustrating a localized DTF-s-OFDMA resource mapping.

FIG. 9 is a conceptual diagram illustrating a pooled DTF-s-OFDMA resource mapping.

FIG. 10 exemplarily shows a cluster of RBGs.

FIGS. 11 through 13 are concept diagrams illustrating a non-contiguous uplink resource allocation method according to an embodiment of the present invention.

FIGS. 14 and 15 exemplarily show an uplink transmission according to an embodiment of the present invention.

FIG. 16 is a flow chart illustrating an uplink transmission method according to an embodiment of the present invention.

FIG. 17 is a block diagram illustrating a base station (BS) and user equipment (UE) applicable to embodiments of the present invention.

Best mode

Reference will now be made in detail to the preferred embodiments of the present invention with reference to the accompanying drawings. The detailed description, which will now be given with reference to the accompanying drawings, is intended to explain the exemplary embodiments of the present invention, rather than show the only embodiments that can be implemented in accordance with the invention. The following embodiments of the present invention can be applied to a variety of wireless access technologies, eg, CDMA, FDMA, TDMA, OFDMA, SC-FDMA, MC-FDMA, and the like. CDMA can be implemented using wireless communication technologies, such as Universal Terrestrial Radio Access (UTRA) or CDMA2000. TDMA can be implemented by wireless communication technologies, for example, Global System for Mobile communications (GSM), General Packet Radio Service (GPRS), Enhanced Data rates for Evolution of GSM (EDGE), etc. OFDMA can be implemented using wireless communication technologies, for example, IEEE 802.11 (WiFi), IEEE 802.16 (WiMAX), IEEE 802.20, E-UTRA (UTRA Evolved), and the like. UTRA is a part of the Universal Mobile Telecommunications System (UMTS). Long Term Evolution (LTE) 3rd Generation Cooperation Project (3GPP) is a part of Evolved UMTS (E-UMTS) using E-UTRA. LTE Advanced (LTE-A) is an advanced version of LTE from 3GPP. Although the following embodiments of the present invention will hereinafter describe inventive technical features based on the 3GPP LTE / ITE-A system, it should be noted that the following embodiments will be described for illustrative purposes only.

FIG. 1 exemplarily shows a radio frame structure for use in a 3rd Generation Cooperation Project (3GPP) system.

ES 2 654 346 T3

With reference to FIG. 1, a radio frame includes 10 subframes, and a subframe includes two slots in a time domain. A time required to transmit a subframe is defined as a Transmission Time Interval (TTI). For example, a subframe can be 1 ms long and an interval can be 0.5 ms long. A slot may include a plurality of Orthogonal Frequency Division Multiplexing (OFDM) symbols or a Single Carrier Frequency Division Multiple Access (SCFDMA) symbol in a time domain. Since the LTE system uses OFDMA in the downlink and uses SC-FDMA in the uplink, the symbol OFDm or SC-FDMA indicates a duration of one symbol. A resource block (RB) is a resource allocation unit and includes a plurality of contiguous carriers in an interval. The structure of the radio frame is only exemplary. Accordingly, the number of subframes included in the radio frame, the number of slots included in the subframe, or the number of symbols included in the slot can be changed in various ways.

FIG. 2 exemplary shows a resource grid of a downlink slot.

With reference to FIG. 2, a downlink slot includes a plurality of OFDM symbols in a time domain. A downlink slot includes 7 (or 6) OFDM symbols and a resource block (RB) includes 12 subcarriers in a frequency domain. Each item in a resource grid can be defined as a Resource Item (RE). One RB includes 12 x 7 (or 12 x 6) RE. The number (ND) of RBs contained in a downlink interval is dependent on a downlink transmission bandwidth. An uplink slot structure is identical to the downlink slot structure, but the OFDM symbols are substituted with SC-FDMA symbols in the uplink slot structure differently from the downlink slot structure, and ND is replaced with. FIG. 3 it is a downlink subframe structure.

With reference to FIG. 3, a maximum of three (or four) OFDM symbols located at the front of a first slot of the subframe may correspond to a control region to which a control channel is assigned. The remaining OFDM symbols correspond to a data region to which a Downlink Shared Physical Channel (PDSCH) is assigned. A variety of downlink control channels can be used in LTE, for example, a Physical Control Format Indicator Channel (PCFICH), a Physical Downlink Control Channel (PDCCH), an ARQ Indicator Physical Channel hybrid (PHICH), etc. PCFICH is transmitted from a first OFDM symbol in the subframe, and carries information about the number of OFDM symbols used to transmit a control channel within the subframe. PHICH carries a Hybrid Automatic Repeat Request Acknowledgment / Negative Acknowledgment (HARQ ACK / NACK) signal in response to an uplink transmission signal.

Control information transmitted on a PDCCH is known as Downlink Control Information (DCI). DCI includes resource allocation information for either a UE or a group of UEs and other control information. For example, a DCI includes uplink / downlink (UL / DL) scheduling information, an uplink transmit power control (UL Tx) command, and so on.

PDCCH carries a variety of information, for example, transmission format information and resource allocation of a downlink shared channel (DL-SCH), transmission format information and resource allocation of an uplink shared channel ( UL-SCH), paging information transmitted on a paging channel (PCH), system information transmitted on the DL-SCH, resource allocation information of an upper layer control message such as a random access response transmitted on a PDSCH, a set of Tx power control commands of each UE contained in a group of UEs, a control command of Tx power, Voice over IP (VoIP) activation indication information, and the like. A plurality of PDCCHs can be transmitted within a control region. A user equipment (UE) can monitor a plurality of PDCCHs. PDCCH is transmitted as an aggregate of one or more contiguous Control Channel Elements (CCE). CCE is a logical allocation unit that is used to provide a code rate based on a radio channel state to a PDCCH. CCE may correspond to a plurality of Resource Element Groups (REG). The PDCCH format and the number of PDCCH bits can be determined according to the number of CCEs. A base station (BS) decides a PDCCH format according to the DCI to be sent to the UE, and adds a Cyclic Redundancy Check (CRC) to control information. The CRC is masked with an identifier (eg Radio Network Temporary Identifier (RNTI)) according to a PDCCH holder or PDCcH purpose. For example, provided that the PDCCH is provided for a specific UE, an identifier of the corresponding UE (eg, Cell RNTI (C-RNTI)) can be masked with the CRC. If a PDCCH is provided for a search message, a search identifier (eg, Search RNTI (P-RNTI)) can be masked with a cRc. If a PDCCH is provided for system information (eg, system information block (SIC)), the system information RNTI (SI-RNTI) can be masked with CRC. If a PDCCH is provided for a random access response, a random access RNTI (RA-RNTI) can be masked with a CRC. For example, a CRC masking (or scrambling) can perform an XOR operation between the CRC and the RNTI at the bit level.

ES 2 654 346 T3

FIG. 4 is a diagram showing the structure of an uplink subframe used in LTE.

With reference to FIG. 4, the uplink subframe includes a plurality of Slots (eg two). The number of SC-FDMA symbols Included in an Interval can be changed according to the length of a CP. For example, in the case of the normal CP, the Range may include seven SC-FDMA symbols. The uplink subframe is divided into a data row and a control row in a frequency domain. The data rung includes a PUSCH and is used to transmit a data signal such as voice data. The control rung includes a PUCCH and is used to transmit control information. The PUCCH includes pairs of RBs (eg, m = 0, 1, 2, 3) located at both ends of the data row on a frequency axis and jumps between Intervals. Control Information Includes HARQ ACK / NACK, Control Quality Information (CQI), Pre-coding Matrix Indicator (PMI), Range Indication (Rl), etc.

Hereinafter, a resource block mapping will be described. A physical resource block (PRB) and a virtual resource block (VRB) are defined. PRB is Same as shown in FIG. 2. That is, the PRB is defined as N ^b Contiguous OFDM symbols in a time domain and contiguous subcarriers in a frequency domain. PRBs are numbered from 0 to NRB -1 in the frequency domain. A relationship between a number of PRB ripR and a RE (k, l) in an interval is shown in Equation 1.

Equation 1 «PRB ~

RB

In Equation 1, k indicates a subcarrier index and TV / indicates the number of subcarriers included in a RB.

The VRB is the same size as the PRB. A localized VRB (LVRB) of a localized type and a distributed VRB (DVRB) of a distributed type are defined. Regardless of the VRB type, a pair of RBs is assigned over two intervals by a unique VRB number ηνρβ. FIG. 5 is a diagram showing a method of mapping a virtual resource block (VRB) to a physical resource block (PRB).

With reference to Fig. 5, since an LVRB is directly correlated to a PRB, a VRB number íivrb corresponds in the same way to a PRN number rippB (ιίρρβ = ηνρβ) · The VRB is numbered from 0 to N1^ -1 and =

NRB . The DVRB is correlated to the PRB after being interleaved. More specifically, DVRB can be correlated to PRB as shown in Table 1. Table 1 shows a gap value of RB.

Table 1

<td rowspan="2">System BW (NRB )</td><td colspan="2">PIT (Nhueco)</td>

<td>1st hole (Nhueco, i)</td><td>2nd Hollow (Nhueco, 2)</td>

<td> 6-10</td><td>faith'4</td><td>N / A</td>

ES 2 654 346 T3

Nhueco indicates a frequency gap (for example, PRB unit) when VRBs having the same number are correlated to PRBs of a first Interval and a second Interval. In the case of 6 <N ^ j <49, only one gap value is defined (N gap, = NhUeCor, 1). In the case of 50 <N ^ j <110, two values of the gap Nhueco are defined, 1 and Nhueco, 2- Nhueco = N /,ueCo, í o Nhueco. = Nhueco, 2 is signaled via downlink programming. DVRBs are numbered from 0 to N¡Ñ -1, it is N¡Ñ = = 2 mm (NhuecOR„NAND¡¡- Nhueco) with respect to Nhueco, = Nhueco, 1, and is ÑÑ = N ^ g hole2 = \ _Nrb I2.Ngap\ '2NhUeco With respect to NhUecho, = NhUecho, 2 mln (AB) Indicates the smaller of A or B.

Contiguous VRB numbers Ñ ^ b set a unit for VRB number interleaving, it is 7V ^ j = Ñ'¡(b in case of Ngap= Nhollow, and is 7V ^ = 2Ngap in case of Ngap= Ngap¿. Interleaving of VRB numbers of each Interleaving unit can be performed using four columns y = fc / (4P) lPfllasN.

and P indicates the size of a Resource Block Group (RBG). The RBG is defined by contiguous P RBs. The VRB number is written into a matrix in a row-by-row manner and is read in a column-by-column manner. Nnull null values are inserted in the Nnull / 2 last rows of the second and fourth columns and Nnull = 4Nrow - .

The null value is Ignored after reading.

Hereinafter, a resource allocation scheme defined in the legacy LTE will be described in detail below. In LTE, a frequency resource allocation can be indicated via one PDCCH per subframe. In case of resource allocation, a Physical Resource Block (PRB) of a first half (that is, a first Interval) of a subframe is paired with the PRB of Equal Frequency of a second half (that is, a second Interval) . For convenience of description, the present invention will be described in terms of a first half of a subframe. Legacy LTE uses a variety of resource allocation methods as shown in Tables 2 and 3. Table 2 shows a downlink resource allocation method, and Table 3 shows an uplink resource allocation method. .

Table 2

<td>DL AR method</td><td>Description</td><td>Number of bits required</td>

<td>Type 0: bitmap</td><td>The bitmap indicates the RBG. RGB size is based on a system band</td><td></td>

<td>Type 1: bitmap</td><td>The bitmap indicates the RBs within a subset of RBGs, respectively. The number of subsets is dependent on a band of the system. The number of bits is set in the same way as Type 0. Therefore, the same DCI format is used to carry Type 0 and Type 1 information.</td><td></td>

<td>Type 2: contiguous assignment</td><td>This indicates an initial position of a resource block and the number of contiguous resource blocks</td><td> +1)/2)1</td>

Table 3

<td>UL RA method</td><td>Description</td><td>Number of bits required</td>

<td>Contiguous assignment</td><td>This indicates an initial position of a resource block and the number of contiguous resource blocks</td><td> +1)/2)1</td>

In Tables 2 and 3, N ^ j is a downlink bandwidth indicated by a multiple of. That is, Nrb is a downlink bandwidth in units of one RB. Similarly,it's a width

ES 2 654 346 T3 uplink band Indicated by a multiple of i.e. N ^B is an uplink bandwidth in units of one RB. P is the number of RBs contained in an RBG.

FIGS. 6A through 6C exemplarily show legacy LTE resource allocation types 0-2. FIG. 6A shows a Type 0 RA (Resource Allocation) Control Information format and its associated resource allocation example. FIG. 6B shows a Type 1 RA Control Information format and its associated resource allocation example. FIG. 6C shows a Type 2 RA Control Information format and its associated resource allocation example.

A user equipment (UE) interprets a resource allocation field based on a detected PDCCH DCI format. The resource allocation field in each PDCCH includes two parts: a resource allocation header field and actual resource block allocation information. PDCCH 1, 2 and 2A DCI formats for Type 0 and Type 1 RA have the same format and are distinguished by a single bit resource allocation header field present based on a link system bandwidth falling. More specifically, a Type 0 RA is Indicated by 0 and a Type 1 RA is Indicated by 1. While the DCI formats of PDCCH 1, 2, and 2A are used for Type 0 or Type 1 RA, the DCI of PDCCH IA, 1b, 1C and 1D are used for Type 2 RA. The PDCCH DCI format having Type 2 RA does not have a resource allocation header field.

With reference to FIG. 6A, in Type 0 RA, the Resource Block Allocation Information includes a bitmap indicating an RBG assigned to a UE. RGB is a set of contiguous PRBs. The RBG size P depends on a system bandwidth as shown in Table 4.

Table 4

<td>System bandwidth</td><td>RBG size</td>

In a downlink system bandwidth having NRB PRB, the total number NRBGfrom RBG is

NRBG = the size of | _2V ^ / P_ | RBG is P, and the size of an RBG is NRB ~ P '| _Vrb in case of NRB modP> 0. Mod Indicates a modulo operation, [| Indicates a ceiling function, and | _ J Indicates a floor function. The size of a bitmap is NRBG and each bit corresponds to an RBG. All RBGs are indexed by 0 to

Nrbg - 1 in an increasing frequency direction and RBG 0 to RBG NRBG - 1 are mapped from a most significant bit (MSB) to a least significant bit (LSB) of a bitmap.

With reference to FIG. 6B, in Type 1 RA, the Resource Block Allocation Information having the size of NRBG Reports to a scheduled UE of resources in a subset of RBG in PRB units. The RBG subset p (0 2(P) ”| bits e Indicates a subset of RBG selected from P subsets of RBG. A second field is 1 bit and indicates a resource allocation expansion offset within a subset. Scrolling is triggered if a bit value is 1 and not triggered if a bit value is 0. A third field includes a bitmap and each bit indicates a PRB within a selected RBG set. The size of a part of the bitmap used to indicate a PRB within the selected RBG subset is NRBO1 and is defined by Equation 2.

Equation 2

ES 2 654 346 T3 <72O1= [you / pl -Tlog2(P) T _ 1 / V¿5

An addressable PRB number in the selected RBG subset can start from an offset Adeferral(/?) from the smallest PRB number within the selected RBG subset and can be mapped to a bitmap MSB. The offset is represented by the PRB number and is applied within the selected RBG subset. If the bit value within the second field for resource allocation expansion offset is set to 0, an offset for a subset of RBG p is ^deferral(p) = 0. In the other case, a displacement for a subset of RBG p is indicates the number of PRBs within the subset of RBG p and can be obtained by Equation 3.

Equation 3

WDL -1 / VRB 1 subsetRBG

RB (p) = jVANDJ 'P

P + P

P + (N ^ -l) modP + l

P, P <

> P ~, P>

-i <L-i mod?

modP modP

With reference to the FlG. 6C, in a Type 2 RA, the Resource Block Allocation Information indicates a set of LVRB or DVRB contiguously assigned to a scheduled UE. IF resource allocation is signaled in a PDCCH DCI 1A, 1B, or 1C format, a 1-bit flag indicates whether an LVRB or DVRB is allocated (for example, 0 indicates LVRB allocation and 1 indicates DVRB allocation). By the way, if resource allocation is signaled in PDCCH DCI 1C format, only DVRB is always allocated. A Type 2 RA field includes a Resource Indication value (RIV) and the RIV corresponds to a resource block of level RBbeginning and a length. Length Indicates the number of resource blocks allocated virtual and contiguously.

The FlG. 7A and 7B are block diagrams illustrating a Discrete Fourler Transform Propagation Orthogonal Frequency Division Multiple Access (DFT-s-OFDMA) transmitter and a DFT-sOFDMA receiver. The DFT-s-OFDMA scheme is different from the OFDMA scheme, because the DFT-s-OFDMA scheme propagates a plurality of data symbols (i.e., a sequence of data symbols) over a frequency domain before performing the IFFT processing, differently from OFDMA scheme. The DFT-s-OFDMA scheme can also be known as an SC-FDMA scheme. For the convenience of the description and better understanding of the present invention, the DFT-s-OFDMA scheme and the SC-FDMA can be used together as necessary.

With reference to the FlG. 7a, a DFT-s-OFDMA transmitter 700 Includes a constellation mapping module 702, a Serle / Parallel (S / P) converter 704, an N-point FFT propagation moduleor 706, a symbol to subcarrier mapping module 708, a point N IFFT modulec 710, a cyclic prefix module 712, and a Parallel / Serle (P / S) converter 714. The aforementioned modules are described for illustrative purposes only, and the DFT-s-OFDMA transmitter 700 may further include additional modules. IF necessary, some modules among the aforementioned modules can be Integrated into one function, so that the modules can also be Integrated into one module. In this case, Nor is an FFT propagation modulo input size, and means the number of programmed subcarriers. Nc means the total number of subcarriers that exist in the system bandwidth (system BW). Therefore, a value Nor and its associated DFT Input / Output (l / O) size can be variable within the Interval of Nor <Nc according to the number of data symbols programmed in each programming time.

A signal processing step for the DFT-s-OFDMA transmitter 700 will be described in detail hereinafter. First, a bit stream is modulated into a sequence of data symbols by the constellation mapping module 702. After that, a sequence of data symbols in series is converted to Nor Parallel data symbol sequences via the S / P 704 converter. Parallel data symbol sequences of length Nor are converted to frequency domain sequences of length Nor through DIMENSIONED FFT processing Same through N-point FFT propagation moduleor 706. The FFT process can be carried out by N-point DFT processing.or. In embodiments of the present invention, FFT and DFT can be used together as needed, and a DFT process can be used in conjunction with DFT propagation or DFT precoding. After that, the frequency domain sequences of

ES 2 654 346 T3 length Nu are mapped to Nu mapped subcarriers out of a total of Nc subcarriers, and the remaining Nc-Nu subcarriers are each padded with '0' by the symbol for the 708 subcarrier mapping module. The mapped sequences a Nc subcarriers are converted to time domain sequences of length Nc by the IFFT module of point Nc 710. In order to reduce Inter-Symbol Interference (ISI) and Inter-Carrier Interference (ICI), the last Np samples from between time domain sequences are copied and joined to the front of the time domain sequences to configure a Cyclic Prefix (CP) by the Cyclic Prefix Module 712. The generated time domain sequences can correspond to a transmit symbol, and can be converted to a serial sequence by the P / S converter 714. After that, the serial sequence is transmitted to a receiver via frequency up-conversion or the like. Another UE (ie, this last UE) receives available subcarriers from among the remaining Nc-Nu subcarriers that have been left after being used by this last UE, so that this last UE transmits data using the assigned available subcarriers.

With reference to FIG. 7B, a receiver 720 includes an S / P converter 722, a point Nc FFT module 724, a subcarrier to symbol matching module 726, a point DFT depropagation module 728, a P / S converter 730, and a constellation mapping module 732. The signal processing steps of receiver 720 are arranged in opposite order from those of transmitter 700 and therefore a detailed description thereof will be described with reference to FIG. 7A.

LTE uses the OFDMA scheme on the downlink while it uses the SC-FDMA scheme on the uplink. If the Nu 706 point FFT propagation module is removed from the block diagram of FIG. 7A, OFDMA transmitter can be achieved. If the Nu 728 point DFT depropagation module is removed from the block diagram of FIG. 7B, OFDMA receiver can be achieved.

FIG. 8 is a conceptual diagram illustrating a localized DTF-s-OFDMA resource mapping. FIG. 9 is a conceptual diagram illustrating a pooled DTF-s-OFDMA resource mapping. A method for mapping a frequency domain sequence generated by DFT precoding to a subcarrier will be described hereinafter with reference to FIGS. 8 and 9. Legacy LTE has been designed to allocate only one contiguous frequency resource to a UE on the uplink. However, the LTE-A system (from Rel-10) can assign a contiguous frequency resource to a UE on the uplink, and can also assign a plurality of non-contiguous frequency resources to a UE on the uplink, so that the utilization of frequency resources and the demand for high-speed communication can be maximized.

FIG. 8 is a block diagram illustrating an example of a localized DFT-s-OFDMA transmitter. FIG. 8 shows a legacy LTE resource allocation method. In other words, a frequency domain sequence having a length of Nu maps to contiguous Nu subcarriers. The localized DFT-sOFDMA scheme can transmit data only through consecutive subcarriers in a given time, so scheduling flexibility may inevitably deteriorate. For example, when a transmitter and a receiver have good radio channel response characteristics in a plurality of frequency domains separated from each other in a certain time, it is impossible for the localized DFT-s-OFDMA scheme of FIG. 8 simultaneously transmitting data to the plurality of frequency domains separated from each other.

FIG. 9 is a block diagram illustrating an example of a clustered DFT-s-OFDMA transmitter. FIG. 9 shows a resource allocation method additionally used in LTE-A. The LTE-A UE can use the scheme of FIG. 8 or the scheme of FIG. 9 based on resource allocation information.

With reference to FIG. 9, the frequency domain sequences generated from the DFT module 906 are non-contiguously mapped to a frequency band at irregular intervals by the symbol-to-subcarrier matching module 908. It can be recognized that the DFT- pooled s-OFDMA of FIG. 9 is implemented when the localized DFT-s-OFDMA scheme is independently applied to a plurality of frequency domains separated from each other. Each frequency band (or each set of resources) to which the localized DFT-s-OFDMA scheme applies is known as a cluster. The grouping includes one or more consecutive subcarriers. Accordingly, in the scheme of FIG. 9, a plurality of DFT precoded data symbols are mapped to consecutive subcarriers contained in each of M clusters (M> 1) spaced from each other on a frequency axis. FIG. 9 shows in an exemplary way the case of three groups. The sizes of the respective clusters (ie the number of subcarriers) can be equal to each other or they can be set independently. If M is equal to or greater than 1, a PAPR value of the transmit signal becomes greater than that of the localized DFT-s-OFDMA scheme. On the contrary, if M is set to a specific value within a suitably small range, a lower PAPR is still guaranteed than that of the OFDMA scheme and the programming flexibility can be improved according to the clustered DFT-s-OFDMa scheme of the FIG. 9.

Realization

ES 2 654 346 T3

Since the non-contiguous (for convenience of description, known as UL RA Type 1) uplink resource allocation method has been introduced to the LTE-A system, a variety of methods for effectively signaling the UL RA Type 1.

First, there is proposed a first scheme configured to employ a bitmap designed to Individually Indicate UL RB (or RBG) in the same way as DL RA Type 0. According to the present invention, although perfect programming freedom is guaranteed, an n-bit RA field is needed when n RB (on RBG) are present in a UL band so that the amount of control information can be increase excessively. In addition, considering that the size of the RA field for programming

Flog?(? C (XV +1) / 2) 1 conventional PUSCH is fixed to 1 62 K 7 71 the first scheme.

a new DCI format must be defined to support

Second, a method is proposed to reuse a conventional contiguous allocation scheme (RA Type 2) and limit a resource row to which each pool can be allocated. For example, provided that the UL band includes 10 RBGs, a first pool can be assigned only to RBGs 0 ~ 4 and a second pool can be assigned only to RBGs 5 ~ 9. In this case, the RA field can have the size of, | j í Grouping Extension ^ j-Grouping Extension

RBG

A TExtensionGrouping,, ~,,£. ,

TVRGB is the size of the specific region to which each pool can be assigned, and is indicated in RBG units. According to the second scheme, it may be possible to perform non-contiguous resource allocation using a legacy RA field according to the TV size setting.RGB However, since the region to which each grouping can be assigned is limited, programming freedom may be reduced.

As described above, when using a Bitmap Indicating an Individual RB (or RBG) in case of non-contiguous UL resource allocation, the amount of Control Information can be extremely increased so that it is Impossible to reuse the legacy DCI format. Also, when using the legacy contiguous allocation scheme (i.e. RIV) or the DCI format in case of non-contiguous UL resource allocation, the size of a rung capable of being used for pool allocation is limited to maintain the legacy DCI format size, resulting in reduced programming freedom.

A non-contiguous UL resource allocation method capable of ensuring freedom of programming without increasing the amount of Resource Allocation Information will be described hereinafter with reference to the accompanying drawings. In more detail, the present invention proposes a method of using a combinatorial index corresponding to a plurality of non-contiguously allocated resource sets. The combinatorial index may be contained in an RA field of a DCI format for PUSCH programming. The combinatorial index can be used to indicate a specific case in which the indices of a specific combination are selected from among all the cases. For convenience of description, a set of a specific combinatorial index Indicated by M 'is Identical to 2M (Μ' = 2M), where M is the number of allocated resource sets (eg clusters). In this case, {s0, 5j} corresponds to a first set of resources, and

{.S '2, .S '3¡Corresponds to a second set of resources. That is, {s2m 2, s2m l} corresponds to the set of resources of order m (where m = 1,2, ..., M). The correspondence relationship can be defined in different ways. A resource allocation method using the combinatorial index will be described later.

Prior to describing the following description, either a total UL system bandwidth or a total number of RBs corresponding to a UL bandwidth available for resource allocation is defined as Ngg. For convenience of description, although the embodiment of the present invention uses an RBG as a minimal (i.e. granularity) resource allocation unit, the scope of the present invention is not limited thereto, and the resource allocation unit Minimum can be defined in different ways. Provided that the number of RBs contained in a RBG is P (P = 1, 2, ...), a total of / V ^ can be definedorResource allocation RBG for a total of Ngg RB. In more detail, TV ^GIt can be indicated by ÍMíb (or, ceiling (7V ^ / P)). Px ”| or ceiling (x) is a minimum integer equal to or greater than x. Meanwhile, based on the definition and size of the resource allocation field, NggGIt can be indicated by | _7V ^ / pj (or, ground (Ngg / P)) or rounding (Ngg / P). | _xJ or ground (x) is a maximum integer equal to or less than x. rounding (x) represents the rounded value of x.

Furthermore, the number of resource sets (eg RBG pools) allocated non-contiguously to the UE is defined by M (M = 2, 3, ...). M can be set as a value common to all UEs (that is, a value

ES 2 654 346 T3 cell specific) or can be set as an Independent value for each UE (ie, a specific UE value). Preferably M can be set to 2 (ie M = 2) for all UEs.

FIG. 10 shows an exemplary RBG map based on RBG indexing for resource allocation. In FIG. 10, the UL band is assumed to include 20 RB (= 20). Here, RBG includes two RBs as shown in Table 4. Therefore, RBs # 1 ~ # 20 are grouped into RBGs # 1 ~ # 10. In the following description, RBG is used as a basic UL resource allocation unit. Although FIG. 10 shows that the RB index or the RBG index starts from 1, an RB index and / or an RBG index can start from 0 according to an implementation example.

Method 1: A combination of RBG indices is indicated by a combinatorial index

Method 1 refers to a method for allocating a plurality of non-contiguous UL resource sets (eg, RBG pools) on the basis of RBG indexing. For convenience of description, a starting RBG index of the RBG pool assigned to the UE is indicated by S, and an end RBG index of the same is indicated by E. The beginning RBG index of the RBG pool of order m is indicated by Sm, and the end-of-order RBG index is indicated by Em. For convenience of description, the following description will focus on an exemplary case in which two clusters of RBGs are assigned. In this case, the combinatorial index can be used to indicate {s¿1 (M '= 4).

For resource allocation, you can define {so, s?} = {S ?, E?} Or {S2, S3} = {S2, E2}. However, considering that the RBG grouping is composed of a RBG, the combinatorial index needs to indicate a combination of so = s? and / or S2 = S3. In this case, a total number of combinations is increased due to a duplicate selection, so that much more control information may be needed. In order to exclude duplicate selection, a limitation of s? <yes + ?. However, if you use the limitation of s? <yes + ?, it may be impossible to allocate a resource set made up of an RBG.

Therefore, the following method can be used.

- Method 1-1: {so, s?} = {S ?, E? + 1}, {sz s3} = {S2, E2 + 1}

- Method 1-2: {so, s?} = {S? -1 isz s3} = {S2 -?, E2 + 1}

In Method 1-1, the RBG index of the set of allocated resources is indicated by {Sm, Em} = {s2m-2, s2m-? - 1} (where, m = 1, 2, ..., M). Similarly, according to Method 1-2, the RBG index of the allocated resource set is indicated by {Sm, Em} = {s2m-2 +1 s2m-?}.

Method 1-1 and Method 1-2 will be described below with reference to the accompanying drawings.

Method 1-1) RBG Back Start / End RBG Indication

FIG. 11 shows an exemplary resource allocation of Method 1-1.

With reference to FIG. 11, Method 1-1 is based on RBG indexing, {Sm, Em + 1} (ie, a starting RBG index and a trailing end RBG index) is reported to each of the M RBG pools assigned to the UE out of a total of Nrbg RBGs. As described above, a combinatorial index (also called a combinatorial index) contained in a DCI format for PUSCH programming indicates {yes,1 (M '= 2M), and the

EU can confirm {Sm, Em} based on {s2m-2, s2m-?} = {Sm, Em +1}.

In Method 1-1, it is possible to define an additional virtual RBG on the back side of (that is, on a higher RBG index side) of the end RBG index as shown in FIG. 11 to allow the end RBG of the RBG pool to be assigned to the end RBG index. In case of virtual RBG, real resource allocation is impossible, or virtual RBG can only be used for indexing as needed.

In Method 1-1, 2M (= M ') indices for allocation of M clusters of RBG can be encoded in different bits or they can be encoded in different bits of individual clusters, or all indices of all clusters can be encoded together in order to reduce the number of bits required for resource allocation. Furthermore, as described above, only one non-overlapping index combination can be selected and flagged from the 2M (= M ') indices to discriminate M clusters of RBG. For the sake of convenience, when N = Nrbg is assumed, the total number of RBG indices includes the virtual RBG so that the total number of RBG indices is N + 1 and therefore the number of bits required to Resource allocation in Method 1-1 is ceiling (log2 (N + -iC2M)). More specifically, when N + 1 RBG indices (that is, RBG indices 1 to N + 1) are defined in Method 1-1, a combinatorial index (r) for resource allocation signaling of M RBG pools can be represented by the following equation 4.

Equation 4

ES 2 654 346 T3

ί = ΰ '(y + i) -¿Λ, M'-i ί

S / χ> and if χ <and

In Equation 4, {.V r, '^' (1 £ s, <Λ / + 1, s, <s, + y) Give M '(= 2 / W) ordered RBG indices, and I know Tell x (yl) '- (yj / + l) _%!

Xy-1) - 1 (xy) y.

for

In another scheme, when N + 1 RBG indices are defined (that is, RBG indices 0 to N), a combinatorial 5 index r for resource allocation signaling of M RBG clusters can be expressed by the following equation 5 .

Equation 5

(= 0 if x> y if x <y

Here, '(0 <s, <N, s¡ <Si + i) denotes M' (= 2 / W) ordered RBG indices, and I know Indicate y (xl) ·· - (y -v + 1) by

In Equations 4 and 5, N can be given by the following equation 6.

Equation 6

[Ív £ / í> l +1

Here, it is the number of resource blocks (RB) in a UL band. P is the number of RBs contained in a 15 RBG. Γ | it is a roof.

Table 5 exemplarily shows the RBG (P) size dependent on a band of the system.

Table 5

<td>Bandwidth</td><td>RBG size</td>

<td>of the TV ™ system</td><td>(P)</td>

Also, {£m + 1} = {S2m-i} can be interpreted as an index of RBG of ice of a RBG rung of no 20 assignment adjacent to a rear part of the RBG cluster of order m.

Method 1-2) RBG Clusters Front / End Ice RBG Indication FIG. 12 shows the exemplary resource allocation of Method 1-1.

ES 2 654 346 T3

With reference to FIG. 12, Method 1-2 is based on the RBG index, {Sm -1, Em} (ie, a leading edge RBG index and an ending RBG index) are reported to each of the M RBG pools assigned to the UE out of a total of Nrbg RBGs. As described above, a combinatorial index (also called a combinatorial index) contained in a DCI format for PUSCH Indicates programming and the UE can confirm {Sm, Em} on the basis of {s2m-2, S2m-r} = {Sm - 1, Em}.

In Method 1-2, it is possible to define an additional virtual RBG on the leading side of (that is, on a lower RBG index side) of the first RBG index as shown in FIG. 12 to allow the ending RBG of the RBG pool to be mapped to the ending RBG index. In case of virtual RBG, real resource allocation is Impossible, or virtual RBG can be used only for dextraction as needed.

In Method 1-2, 2M (= / Wj indices for allocation of M clusters of RBG can be encoded in different bits or can be encoded in different bits of Individual clusters, or all indices of all clusters can be encoded together with in order to reduce the number of bits required for resource allocation. Furthermore, as described above, only a combination of non-overlapping indices can be selected and pointed out from the 2M (= / Wj indices to discriminate M clusters of RBG. For the sake of convenience, when it is assumed that N = Nrbg, the total number of RBG indices Includes the virtual RBG so that the total number of RBG indices is N + 1 and therefore the number of bits required for resource allocation in Method 1-1 is ceiling (log2 (N + iC2M))

More specifically, when N + 1 RBG indices (that is, RBG indices 1 to N + 1) are defined in Method 1-2, a combinatorial index (r) for resource allocation signaling of M RBG clusters is can be represented by the following equation 4. Furthermore, when N + 1 RBG indices (that is, RBG indices 1 to N + 1) are defined in Method 1-2, a combinatorial index (r) for RBG assignment signaling Resources of M clusters of RBG can be represented by Equation 5.

In Method 1-2, {Sm-1} = {s2m-2} can be interpreted as the end RBG index of an unassigned RBG rung adjacent to a leading part of the m-order RBG cluster.

Method 2: A combination of RBG edges is indicated by a combinatorial index

Method 2 relates to a method for allocating a plurality of non-contiguous UL resource sets (eg, RBG pools) based on RBG edge dextraction. For convenience of description, an RBG edge index of zero and an end RBG edge index of an RBG pool assigned to a UE are indicated by SB and EB, respectively. The RBG edge index of zero and the end RBG edge index of the set of m-order RBGs are indicated by SBm and EBm, respectively. For the sake of description, a detailed description of Method 2 will focus on an exemplary case where two clusters of RBG are assigned. In this case, a combinatorial index can be used to Indicate (M '= 4).

FIGS. 13A and 13B exemplarily show a resource allocation based on Method 2.

With reference to FIGS. 13A and 13B, Method 2 is based on the RBG index, {SBm, EBm} (ie an RBG edge index of zero and an end RBG edge index) each of M RBG pools assigned to the UE out of a total of Nrbg RBGs are reported. As described above, a combinatorial index (also called a combinatorial index) contained in a DCI format for PUSCH programming Indicates {sF1 (M '= 2M), and the UE can confirm {SBm, EBm} on the basis of {s2m-2, S2m-i} = {SBm, EBm}.

In Method 2, 2M (= / Wj indices for allocation of M clusters of RBG can be encoded in different bits or they can be encoded in different bits of Individual clusters, or all the indices of all clusters can be encoded together in order to reduce the number of bits required for resource allocation. Furthermore, as described above, only a combination of non-overlapping indices can be selected and pointed out from the 2M (= / Wj indices to discriminate M clusters of RBG. For the sake of convenience, when it is assumed that N = Nrbg, a total number of RBG indices is N + 1 and therefore the number of bits required for resource allocation in Method 2 is ceiling (log2 (N + iC2M))

More specifically, when N + 1 RBG indices (that is, RBG indices 1 to N + 1) are defined in Method 2, a combinatorial index (r) for resource allocation signaling of M RBG pools can be represent by the following equation 7.

Equation 7

ES 2 654 346 T3

In Equation 7, 'O - s'- Si <S / + f) Indicate M' (= 2 / W) ordered RBG indices, and Indicate x (x -1) · · (x - y +1) by

In another scheme, when N + 1 RBG indices are defined (that is, RBG indices 0 to N), a combinatorial index r for resource allocation signaling of M RBG clusters can be expressed by the following equation 8.

Equation 8

if x> y \ yj if χ <y

Here, 1 (θ - S / - N, * Yes <Yes + 1'> indicates M' (= 2 / W) ordered RBG indices, and

x (x -1) · · (x - y +1) is denoted by XA '!) ···!

While Method 2 is designed to use RBG edge index instead of RBG indent, Method 2 does not need to define the additional virtual RBG shown in Method 1.

FIG. 14 is a flow chart illustrating UL signal transmission according to one embodiment of the present invention.

With reference to FIG. 14, the UE receives resource allocation information including a combinatorial index from a network node (eg, a BS or a relay) in step S1402. A field for resource allocation information is contained in the DCI and can be received through a downlink control channel (eg, PDCCH).

If a PDCCH having a DCI format for PUSCH scheduling is detected in a subframe (n), the UE performs PUSCH transmission based on the PUSCH information in a subframe (n + 4). For this purpose, the UE analyzes the resource allocation information. In more detail, the UE obtains {^. ^ 'That corresponds to a combinatorial index in step S1404, and confirms a set of resources that corresponds to Ε, Ιμ)1 Therefore, the UE maps an uplink signal to a plurality of contiguous resource sets (eg, RBG pools) corresponding to step S1406. FIG. 14 shows the relationship between Ε, Ιμ)1 Methods 1-1, 1-2, and 2 and a resource set under the assumption that two RBG pools are assigned. The UL signal includes uplink shared channel data (UL-SCH) and / or control information. Finally, the UE performs UL transmission using the resource set allocated from the network node (eg, the BS or the relay) in step S1408. UL transmission can be carried out via a PUSCH.

FIG. 15 shows an exemplary interpretation of resource allocation information according to an embodiment of the present invention. In FIG. 15, the RBG number is assumed to be 0 and two resource sets are allocated (for example, RBG pools). Each resource set is made up of contiguous resources (for example, RBGs).

With reference to FIG. 15, if a combinatorial index (r) contained in the resource allocation information indicates 117, r is indicated by r = 70 + 35 +10 + 2 = 117 so that {so, Sy, s is achieved2, S3} = {2, 3, 5, 8} rbg- In Method 1-1, since {Sm, Em} = {s2m-2, s2m-y - 1}, you can get {Sy, Ey} = {so, sy - 1} = {2, 2} rbg and (S2, E2) = (s2, S3 - 1} = {5, 7} rbg- Therefore, RBG # 2 and RBG # 5 ~ # 7 can be used to transmit UL signals.

Although not shown in FIG. 14, Method 1-2 and Method 2 can also use UL signals as follows.

- Method 1-2: {S m, Em} - {s2m-2 + 1, s2m-Y}

ES 2 654 346 T3 => {Sy, Ει} - {so + 1, Sí} - {3, 3} rbg {S2, E¿¡ - {S2 + 1, S3} - {6, 8} rbg => RBG # 3 and RBG # 6 ~ # 8 can be used to transmit UL signals. - Method 2. {SBm, FBrj} {S2m-2, S2m-l} —7 {S m, Em} - {S2m-2 + 1, S2m-í} => {Yes, Ei} = {so + 1 , Yes} = {3, 3} rbg {S2, £ 2} = {S2 + 1, S3} = {6, 8} rbg

RBG # 3 and RBG # 6 ~ # 8 can be used to transmit UL signals.

The above-mentioned description has been described with a focus on non-contiguous UL resource allocation. The LTE-A system can support not only contiguous UL resource allocation (also known as UL RA Type 0) and non-contiguous UL resource allocation (also known as UL RA Type 1). The two resource allocation schemes can be signaled through the same DCI format. In this case, the applied resource allocation type can actually be discriminated using flag bits. For example, as shown in DL RA Types 0/1, a 1-bit flag (also known as an RA type bit) is mapped to a DCI format for PUSCH programming, so that the Type UL RA 0 and UL RA Type 1 can be selectively flagged.

Meanwhile, the size of RBG P (i.e. (maximum) P RB per RBG) for DL RA in legacy LTE has been defined in Table 5 based on the size of BW (i.e. the number of N ^ j RB from DL to RW from DL). Additionally, DCI Format 0 for UL programming for use in LTE supports RIV (Indication Value of

Resources) - based on Type 2 RA. The number of bits contained in the RA field is typheus (- ^ rb +1) 2) | (excluding a 1 bit Frequency Hopping (FH) flag). is the number of DL RBs in DL RWs. Legacy DCI Format 0 based on RBG size defined in Legacy LTE applies to LTE-A without any change.

LTE-A uses UL non-contiguous RA where LTE-A uses Legacy DCI Format 0 without resizing the RA field based on the RBG size defined in Legacy LTE so that you can allocate two pools by RBG. For this purpose, LTE-A can use a total of Odcio = +1 bits that include the 1-bit FH flag (ie, FH is not performed in non-contiguous RA) as the RA field. In this case, when using Method 1 and Method 2 for UL non-contiguous RA, a total of Ogrouption =

P ° & 2 (jV + 1 '4 I kits ^ 1 is needed). Therefore, O must be satisfiedagrUOption <Odcio to implement UL non-contiguous RA using legacy DCI format 0 without changes.

Table 6 shows not only the RBG P size for each BW in LTE calculated on the basis of Table 5, but also the N number of RBGs. In Table 6, the gray-shaded parts (BW: 7, 9—10, 55-63, 85-90, and 101-110 RB) shown in Table 6 may indicate BWs that do not satisfy OagrUpation <OdcioTabla 6

ES 2 654 346 T3

The following description proposes a method to satisfy the above condition ORgrouption <Odcio to support UL non-contiguous RA based on Methods 1 and 2. One case where a legacy DCI format 0 is used will be described first and another case where a DCI format is used (for convenience of the description, known as the format

X from DCI) for MIMO from UL will be described later.

UL discontiguous RA using DCI format 0

The following methods Alt 0) to Alt 5) can be considered to satisfy the conditions mentioned above {ORgroupation <0Dyear)

Alt 0) This method supports non-contiguous RA only for a BW that satisfies ORgroupCion <Odcio10 Alt 1) Some parts of the RBG size are changed for each BW defined in legacy LTE

ES 2 654 346 T3

Alt 2) The RBG size per BW defined in the legacy LTE is used unchanged, and a BW for which the RA applies is defined separately.

Alt 3) The RBG or RB range for RA application is indicated through RRC signaling.

Alt 4) The RA field is extended by borrowing / adding a specific bit in DCI format 0.

Alt 5) A new RA field of DCI format 0 is defined for LTE-A.

A detailed description of the Alt 1) to Alt 5) methods mentioned above is as follows.

Alt 0) This method supports non-contiguous RA only for a BW that satisfies ORgroupion <Odcio

In order to support a non-contiguous RA only using the RA field composed of Odcio bits in a BW that satisfies ORgroupion> Odcio, the number of RBG per BW defined in the legacy LTE, the RBG application interval, and / or the RBG size can be inevitably adjusted. For example, the number of the RBGs and the application can be reduced or the size of the RBG can be extended. As a result, scheduling flexibility and granularity may deteriorate. Therefore, in association with the BW that satisfies Ogroupion <Odcio, a contiguous RA based on the legacy Rel-8 RIV scheme and a non-contiguous RA based on Methods 1 and 2 are supported simultaneously. In association with a BW that satisfies Ogroupion> Odcio, it can be considered a method to support only contiguous RA. Provided that the RA type bit indicates the non-contiguous RA scheme in the BW of ORgroupion> Odcio, the UE can determine the occurrence of errors and can drop the UL transmission.

Alt 1) Some parts of the RBG size are changed for each BW defined in the legacy Rel-8.

First, when considering the application of RA for N RBG, the size of UL RBG per BW can be changed as shown in Table 7 ~ ÍMIB Ogroupation = | log2 (w + 1 C '4)|).

Table 7

<td>Bandwidth</td><td>UL RBG Size</td>

<td>of the TV ™ system</td><td>(P)</td>

<td> < 10</td><td>Undefined</td>

When considering an application of RA for (N-1) UL RBGs contained in the BW, the UL RBG size for each BW can be changed as shown in Table 8 ^ 1, ORgroupation = | log2 (wC4) |). In this case, an RBG excluded from an RA object can be an RBG that has the first or last RBG index. Since the number of RBs contained in the last RBG can be equal to or less than P, the RBG that has the last RBG index can be excluded.

Table 8

<td>Bandwidth</td><td>UL RBG Size</td>

<td>of the TV ™ system</td><td>(P)</td>

ES 2 654 346 T3

<td>System bandwidth N ^ j</td><td>UL RBG Size (P)</td>

When considering an RA application for (N-2) UL RBGs contained in the BW, the UL RBG size for each BW can be changed as shown in Table 9 ~ ÍMíb Occupation = | Tog2 C ^)-]). In this case, two RBGs excluded from an RA object can be one RBG that has the first or last RBG index. 5 The PUCCH transmission is skipped to the opposite side of the frequency band based on an interval, the RBGs excluded from both ends of the frequency band can be used for PUCCH signal transmission.

Table 9

<td>Bandwidth</td><td>UL RBG Size</td>

<td>of the N ^ j system</td><td>(P)</td>

Alt 2) The RBG size for each BW defined in Legacy Rel-8 is applied unchanged, and a BW to which 10 RA is applied is defined independently.

In Alt 2), the RBG indexing based on Table 5 is applied, and a BW (simply, BW for RA (BWra)) to which the RA applies can be defined independently. For example, BWra can be defined using the number of RBGs excluded from the actual BW. That is, RA can only be applied to a BW for RA purpose (that is, a total of N - RBG)

In the case of Ν'fifi = 1, a RBG to be excluded can be a RBG that has the last RBG index. In case of ^ RBG= 2' d0S RBG to be excluded may include a RBG that has a first RBG index and a RBG that has a last RBG index. As a result, the resource efficiency of PUCCH can be increased by considering that the transmission of PUCCH skips to the opposite side of a frequency band on the basis of a slot. In the case of Ν'fifi = 3, three RBGs to be excluded can be a RBG that has a first RBG index, an RBG that has the last RBG index, and an RBG that has an index (that is, the last RBG index - 1) contiguous to the last RBG index.

Table 10 exemplarily shows TV ^^ that change with BW.

<td colspan="2">Table 10</td>

<td>System bandwidth N ^ j</td><td>UL RBG number excluded</td>

ES 2 654 346 T3

<td>Bandwidth TV ™ system</td><td>UL RBG number excluded</td>

For the definition of BWra, the A ^ / f number of UL RBs actually excluded from the BW can be defined as shown in Table 11. In this case, the RBG index based on Table 5 is performed only for the BWra (a total of -N ^ 'former RB) and RA can be applied to the BWRA (^ = Oagmpacian =

Γ1ο& 2 <JV + 1 ^ 4 'l ·. Here, in the case of 2a - 1 (where a is a positive integer), the RBs to be excluded can be a RB that corresponds to the first (a-1) indices of RB and a RB that corresponds to the last to RB indices. In the case of = 2a, the RBs to be excluded can be a RB that corresponds to the former to RB indices and a RB that corresponds to the latter to RB indices.

Table 11

<td>Bandwidth TV ™ system</td><td>UL RB number to be excluded</td>

Alt 3) The Alt-3 Method Indicates a RBG or RB Interval applied to RA via RRC signaling

The Alt-3 method can Indicate a UL RBG Range (simply, UL RBG Range for RA Purpose, RBGra Range) via RRC signaling. In this case, the RBG index based on Table 5 is

ES 2 654 346 T3 can apply only to the corresponding RBGs (ie, a plurality of the RBGra), and an RA can be applied only to the corresponding RBG range. In order to indicate the RBGra interval, the starting RBG index and / or the last RBG index of the corresponding interval, or the starting RBG index and the number of contiguous RBGs can be indicated.

In another example, it is impossible to indicate the RA purpose RB range (simply, RA purpose RB range or RBra range) through RrC signaling. In this case, the indexing based on Table 5 can be applied only to the corresponding RBs (that is, a plurality of the RBra), and an Ra can be applied only to the corresponding RB range. In order to indicate the interval RBra, the starting RB index and / or the last RB index of the corresponding interval, or the starting RB index and the number of contiguous RBs can be indicated.

Alt 4) The Alt-4 Method extends the RA field by borrowing / adding a specific bit contained in DCI format 0

A specific bit in DCI format 0 is borrowed so that the specific bit can be incorporated into the RA field in case of non-contiguous RA. For example, in case of a non-contiguous RA, a bit of a CQI request field contained in DCI format 0 can be used / interpreted as part of the RA field. The CQI request field is composed of 1 bit, and thus the CQI request function is disabled in case of non-continuous RA. That is, in case of non-contiguous RA application, the base station cannot indicate the CQI request. In another example, in the case of non-contiguous RA, one bit from among the field of 3 bits indicating a CS of DMRS (Demodulation Reference Signal Cyclic Change) can be incorporated into the RA field. That is, in case of non-contiguous RA application, 2 bits out of 3 bits contained in the DMRS CS field can be used to indicate a DMRS CS according to its original usage, and one bit out of the 3 bits can be use / interpret as part of the AR field.

Table 12 exemplarily shows the RBG size for each BW according to the present invention. Table 12 exemplarily shows that a bit is borrowed from another field to extend the size of the field.

RA.

Table 12

<td>Bandwidth</td><td>UL RBG Size</td>

<td>of the system</td><td>(P)</td>

In addition to periodic legacy SRS (Polling Reference Signal), LTE-A considers transmission of an SRS dynamically or aperiodic to perform UL MIMO transmission and burst traffic processing. For this purpose, the dynamic / aperiodic SRS transmission can be triggered via a PDCCH. In this case, a bit to trigger the SRS can be added to a DCI format. In this case, a bit to trigger the SRS can be borrowed and fused into the RA field of the non-contiguous RA. Therefore, in case of non-contiguous RA application, the SRS trigger function is automatically disabled, and the BS and UE can use / interpret the corresponding bit as part of the RA field (that is, the eNB cannot indicate SRS triggering during non-contiguous RA).

Meanwhile, in case of non-contiguous RA, it can be set whether a specific bit (for example, 1 bit from CQI request field, 1 bit from DMRS CS field, and 1 bit from SRS trigger field) has to be used as the RA field or to be used as an original function via RRC signaling. Also, the specific bit is not borrowed (that is, the function of the corresponding bit is not disabled), and a bit can be added to a DCI format 0 to extend the RA field. In this case, in order to prevent additional blind decoding (BD) from increasing in the common search space, a method of adding a bit to the RA field of DCI format 0 can be limited to a specific search space of the EU.

More specifically, the Alt-4 Method can be applied only to the gray shaded parts (BW of Ogrouping> Odcio) (BW: 7, 9 ~ 10, 55 ~ 63, 85 ~ 90, 101 ~ 110 RB) shown in the Table 6.

Alt 5) A new RA field of DCI format 0 is defined for LTE-A.

ES 2 654 346 T3

Legacy RIV-based RA Type 2 and Methods 1 and 2 can be applied based on the RBG size for each BW defined in the Legacy LTE without any other processing, such that a total number Odcio (except for one flag 1-bit FH) of bits contained in the RA field for DCI format 0 for use in LTE-A can be redefined as shown in the following equation 9.

Equation 9

([log2(w + 1C4) ll, ^, (^ (^ + 1) / 2) 1) * = pv £ // |

Here, Odcio is the number of bits in the RA field for RBG allocation. N is the number of UL RBGs.

is the number of the UL RBs. P is the size of the UL RBG. The UL RBG size can be indicated by Table 5 based on a BW. [| it is a ceiling function. Max (x, y) is the largest of x and y.xCY is a number of cases to select and number of parts out of x number of parts, and is indicated by

If N shown in Equation 9 is replaced with following equation 10.

the substituted result can be represented by the

Equation 10 log2(= Max log3(

In this case, in order to avoid additional blind decoding (BD) from increasing in the common search space, a method of adding a bit to the RA field of DCI format 0 can be limited to a specific search space of the EU. So in case of using RA field for LTE-A DCI format 0 in common search space, after RA field is mapped in the same way as in RA field size From the legacy DCI Format 0, Methods Alt-1 to Alt-4 can be used or a method can be considered to prevent non-contiguous RA from being supported for all BWs.

Preferably, in case of a BW composed of 10 RB or less, the number of RB is small in number, so that non-contiguous RA cannot be used. As a result, Methods Alt-0 to Alt-5 cannot be applied to BW composed of 10 RB or less.

A method for arranging RA information bits in the RA field of DCI format 0 will be described in detail below. For explanation, it is assumed that the number of bits contained in the RA field (including a 1-bit FH flag) of DCI format 0 to which the Alt-0 to Alt-5 Methods apply is indicated by Ni, and the number of bits contained in the non-contiguous RA is indicated by Mi. If Mi <Ni is given under non-contiguous RA, the following methods can be used to arrange Mi bits in the RA field. For convenience of description, the order of the bits that make up the RA field starting from the 1-bit FH flag is indicated by

1) My bits (i.e. bi, omi) are mapped to the MSB part

2) My bits (ie b2, bMi + i) are assigned to a part of MSB other than the flag of FH.

In this case, the remaining (Ni - Mi) bits that do not correspond to Mi bits assigned through Methods 1), 2) and

3) are set to default values (specifically, all bits are set to Ό '), so that the virtual CRC for error detection can be used as needed.

The number of bits that make up the RA field (excluding the 1-bit FH flag) of DCI Format 0 to which Methods Alt-0 to Alt-5 apply is assumed to be indicated by N2, and the number of bits contained in the

ES 2 654 346 T3

Contiguous RA is indicated by M2. Yes M2 <N2 is given under the contiguous RA application, the following methods can be used to arrange M2 bits in the RA field composed of N2 bits. For the convenience of description, the order of the RA field construction bits (excluding the 1-bit FH flag) is indicated by

1) M2 bits (i.e.

i) are assigned to the MSB part

2) M2 bits (i.e.

In this case, the (N2- M2) remaining bits that do not correspond to M2 bits assigned via Methods 1) and 2) are set to default values (specifically, all bits are set to '0'), so that the virtual CRC for error detection can be used as needed.

UL non-contiguous RA using DCI X format

LTE-A can support uplink MIMO transmission differently from legacy LTE, and a DCI format (i.e. DCI format X) can be redefined for UL MIMO programming. In addition, non-contiguous RA can be supported in UL MIMO transmission, and the RA field can be defined in DCI X format. For reference, frequency hopping is not supported in UL MIMO, so the 1-bit FH flag is not set.

Therefore, when non-contiguous RA is applied using DCI X format, the RA field size of a DCI X format (@DCJX @DC? Q

) in the same way as in the legacy DCI Format 0 RA field size (including the 1-bit FH flag), Methods Alt-0 to Alt-4 can be used.

In another method, RA types 0 and 1 RA can be used on the basis of the RBG per BW size defined in the legacy LTE without any other processing, such that a total number Odcix of bits contained in the field of RA can be defined again by the following equation 11 (Alt-5 method).

Equation 11 '(Γ1ο§2 <ν · <-ιΕι) ΤΓΐ ° §2 «(+ 1) / 2) 1) / v = fe /? L

In Equation 11, Odcix is the number of the RA field for RBG assignment. N is the number of the RBG of

UL. is the number of the UL RBs. P is the UL RBG size. The UL RBG size can be represented by Table 5 according to the UL BW. [| it is a ceiling function. Max (x, y) is the largest of x and y.xCY is a number of cases to select and number of parts from x number of parts, and is Indicated by

-Y j _ — T + l) and (yi) -i

IF N shown in Equation 11 is replaced with the following equation 12.

the substituted result can be represented by the

Equation 12

OR.

In the case of DCI format X for UL MIMO, blind decoding (BD) can be performed independently of other DCI formats. Therefore, adding a bit to the RA field in the Alt-4 Method and Equation 10 based on the Alt-5 Method can be commonly used without distinction between the common search space and the UE specific search space.

ES 2 654 346 T3

Meanwhile, assuming that the number of bits that make up the RA field of the DCI format X to which the Methods Alt-0 to Alt-5 apply is indicated by L, and the number of bits needed for the actual RA is indicated by K (Regardless of the RA type), the following method can be used as a method to arrange K bits to the RA field in case of K <L. The size of the RA field may be different from the size of the RA information in the following cases. For a better understanding of the present invention, the following description will focus on the Alt-5 Method. In the Alt-5 Method, the RA field size in the configured UL BW is determined to be one greater than the RA Type 0 Information size of RA and the RA Type 1 Information size. Therefore, if the size of the RA field is given on the basis of the RA type 0 and the RA type bit indicates RA type 1, the size of the RA information may be less than the size of the RA field. RA. On the other hand, assuming that the RA field size is given on the basis of RA type 1 and the RA type bit indicates RA type 0, the RA Information size can be less than the field size. by RA.

For convenience of description, the order of the bits that make up the RA field is indicated by bi, b¿ .... b¡_.

1) K bits (i.e. bi, bf) are allocated to the MSB part

2) K bits (that is, b¡_-K + i,, be) are assigned to the LSB part.

In this case, the remaining (K- L) bits that do not correspond to the K bits assigned via Methods 1) and 2) are set to default values (specifically, all bits are set to '0'), so so that the virtual CRC for error detection can be used as needed.

FIG. 16 is a flow chart illustrating an uplink transmission procedure in accordance with an embodiment of the present invention. For convenience of description, it is assumed that the Alt-5 Method is used.

With reference to FIG. 16, a base station (BS) broadcasts System Information to a user equipment (UE) in step S1602. System Information may Include BW Information. System bandwidth information can include information from an uplink BW. The UL BW can be given using the UL RB number. Therefore, the BS transmits a PDCCH signal for UL programming to the UE in step

S1604. The PDCCH signal includes a DCI format for UL programming. In a single antenna (port) transmission mode, the PDCCH signal includes a DCI format 0. In case of a multiple antenna (port) transmission mode (also called MIMO transmission), the PDCCH signal includes a DCI X format. DCI format 0 / X can include a Resource Allocation Type (RA) bit and a Resource Allocation (RA) field. The RA type bit can be used to indicate RA Type 0 or 1, and can be composed of 1 bit. The RA field can be used for UL RBG assignment. The size of the RA field can be indicated by the ir i

Max Iog2(

Equations 9 to 12 (for example;

). After the UE

Interpret the RA type bit and the RA field of the PDCCH signal, the resources for PUSCH transmission are allocated in step S1604. In the case of RA type 0, the resources for PUSCH transmission may be composed of one or more contiguous RBs according to a RIV value of the RA field. In contrast, in the RA type 1 case, a PUSCH transmission resource may be composed of two non-contiguous clusters according to a combinatorial index of the RA field (See FIGS. eleven to 15). Each pool is made up of one or more contiguous RBGs. Thereafter, the UE transmits a PUCCH signal to the base station (BS) using the resources allocated in step S1606.

FIG. 17 is a block diagram illustrating a base station (BS) and user equipment (UE) applicable to embodiments of the present invention. A BS-UE block diagram shown in FIG. 17 can be replaced with a BS-RN block diagram or an RN-UE block diagram.

With reference to FIG. 17, the Wireless communication system includes a base station (BS) 110 (also indicated by 'eNB') and a UE 120. The BS 110 includes a processor 112, a memory 114, and a radio frequency (RF) unit 116. Processor 112 can be constructed to implement the procedures and / or methods described in embodiments of the present invention. Memory 114 may connect to processor 112, and store various information related to processor 112 operations. RF unit 116 is connected to processor 112, and transmits and / or receives RF signals. The UE 120 includes a processor 122, a memory 124, and an RF unit 126. The processor 122 can be constructed to implement the procedures and / or methods described in embodiments of the present invention. The memory 124 can be connected to a processor 122, and store various information related to the operations of the processor 122. The RF unit 126 is connected to the processor 122, and transmits or receives RF signals. The BS 110 and / or the UE 120 may include a single antenna or multiple antennas.

The above embodiments are achieved by combining elements and structural features of the present invention in a predetermined way. Each of the structural elements or features should be considered selectively unless otherwise specified. Each of the structural elements or features can be carried out without being combined with another structural element or feature. Also, some elements and / or

Structural features can be combined with one another to constitute embodiments of the present invention. The order of operations described in embodiments of the present invention can be changed. Some structural elements or features of one embodiment may be included in another embodiment, or may be substituted with corresponding structural elements or features of another embodiment. Furthermore, it will be apparent that some claims that refer to specific claims may be combined with other claims that refer to the claims other than the specific claims to constitute the embodiment or add new claims by way of modification after the submission is made. request.

Embodiments of the present invention have been described based on data transmission and reception between a BS (or eNB) and a UE. A specific operation that has been described as being performed by the eNB (or BS) can be performed by a higher node of the BS (or eNB) as the case may be. In other words, it will be apparent that various operations performed for communication with the UE in the network including a plurality of network nodes together with the BS (or eNB) can be performed by the BS or network nodes other than the BS (or eNB). The BS can be replaced with terms such as fixed station, Node B, eNode B (eNB), and access point. Also, the term UE can be replaced with terms such as mobile station (MS) and mobile subscriber station (MSS).

Embodiments according to the present invention can be implemented by various means, for example, hardware, firmware, software, or combinations thereof. If the embodiment according to the present invention is implemented by hardware, the embodiment of the present invention can be implemented by one or more application-specific integrated circuits (ASICs), digital signal processors (DSP), digital signal processing devices (DSPD). ), Programmable Logic Devices (PLD), Field Programmable Gate Clusters (FPGA), Processors, Controllers, Microcontrollers, Microprocessors, etc.

If the embodiment according to the present invention is implemented by microprograms or software, the embodiment of the present invention can be implemented by a module, a method, or a function, which performs the functions or operations as described above. A software code can be stored in a memory unit and then it can be operated by a processor. The memory unit can be located inside or outside the processor to transmit and receive data to and from the processor through various well-known means. Industrial applicability

Exemplary embodiments of the present invention can be applied to wireless communication systems such as a UE, a relay node (RN), and a BS (or eNB).

36 members in 9 offices

This recordMember, by publication datePriority claim

Priority claims5

Priority claims
Document	Office	Kind	Date
38289010	United States of America	P	2010-09-14
41439810	United States of America	P	2010-11-16
41923410	United States of America	P	2010-12-02
42265510	United States of America	P	2010-12-13
2011006770	Republic of Korea	W	2011-09-14

Members36

Family members, oldest first
Document	Office	Kind
WO2012036456A2	World Intellectual Property Organization (WIPO)	A2	2012-03-22
WO2012036456A3	World Intellectual Property Organization (WIPO)	A3	2012-05-31
MX2013000981A	Mexico	A	2013-02-15
US2013089063A1	United States of America	A1	2013-04-11
CN103081385A	China	A	2013-05-01
EP2618505A2	European Patent Office (EPO)	A2	2013-07-24
US2013229993A1	United States of America	A1	2013-09-05
KR20130105781A	Republic of Korea	A	2013-09-26
JP2013538485A	Japan	A	2013-10-10
US8737344B2	United States of America	B2	2014-05-27
US2014204879A1	United States of America	A1	2014-07-24
RU2529880C1	Russian Federation	C1	2014-10-10
US8867474B2	United States of America	B2	2014-10-21
JP5629377B2	Japan	B2	2014-11-19
JP2015057888A	Japan	A	2015-03-26
US9197384B2	United States of America	B2	2015-11-24
US2016007343A1	United States of America	A1	2016-01-07
CN103081385B	China	B	2016-02-17
JP5911545B2	Japan	B2	2016-04-27
CN105681011A	China	A	2016-06-15
JP2016131396A	Japan	A	2016-07-21
KR20160103556A	Republic of Korea	A	2016-09-01
KR101654064B1	Republic of Korea	B1	2016-09-05
KR101683125B1	Republic of Korea	B1	2016-12-06
KR20160139062A	Republic of Korea	A	2016-12-06
JP6073514B2	Japan	B2	2017-02-01
EP2618505A4	European Patent Office (EPO)	A4	2017-02-15
US9706535B2	United States of America	B2	2017-07-11
EP2618505B1	European Patent Office (EPO)	B1	2017-11-29
US2017347354A1	United States of America	A1	2017-11-30
EP3264846A1	European Patent Office (EPO)	A1	2018-01-03
ES2654346T3This record	Spain	T3	2018-02-13
EP3264846B1	European Patent Office (EPO)	B1	2019-04-17
US10368341B2	United States of America	B2	2019-07-30
CN105681011B	China	B	2019-08-16
KR102019131B1	Republic of Korea	B1	2019-09-06

Method and device for uplink resource allocation

Abstract

Term

ES 2 654 346 T3

DESCRIPTION

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

RB

ES 2 654 346 T3

ES 2 654 346 T3

RBG

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

ES 2 654 346 T3

Priority claims5

Members36

Numbers

Titles2

Classification