Method for signaling of resource allocation to adjust granularity in cellular multi-carrier system
Abstract
A method for receiving a downlink signal by an apparatus in a wireless mobile communication system, the method comprising: receiving common downlink control information that includes a resource indication value, RIV, wherein the RIV is correlated at a start index S and a length L of virtual resource blocks, VRB, consecutive; and receive the downlink signal in the consecutive VRBs, where, if Y-1 <= ⌊ X / 2⌋ is given, the RIV is correlated to the start index S and the length L of the consecutive VRBs according to a relationship of RIV> = X (Y - 1) + Z if not the RIV is correlated to the start index S and the length L of the consecutive VRBs according to a ratio of RIV> = X (X - Y + 1) + (X - 1 - Z), where X is indicated by X> = ⌊ NG⌋ VRB /, Y is indicated by Y> = L / G, Z is indicated by Z> = S / G, NVRB is a VRB number and G is an integer of 2 or more.

Term
2.5 yearsto projected expiry
Projected expiry 8 April 2029, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
10 claims: 4 independent, 6 dependent
- 1ES 2 586 624 T3 REIVINDICACIONES 1. Un método para recibir una señal de enlace descendente por un aparato en un sistema de comunicación móvil inalámbrico, el método que comprende:recibir información de control de enlace descendente común que incluye un valor de indicación de recurso, RIV, en donde el RIV se correlaciona a un índice de inicio S y una longitud L de bloques de recursos virtuales, VRB, consecutivos;y recibir la señal de enlace descendente en los VRB consecutivos, en donde, si se da Y - 1 _X /2_, el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(Y - 1) + Z si no el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(X- Y + 1) + (X- 1 -Z), donde X se indica por X = / G_, Y se indica por Y = L/G, Z se indica por Z = S/G, Nvrb es un número de VRB y G es un entero de 2 o más.
- 2Un método para transmitir una señal de enlace descendente por un aparato en un sistema de comunicación móvil inalámbrico, el método que comprende:transmitir información de control de enlace descendente común que incluye un valor de indicación de recurso, RIV, en donde el RIV se correlaciona a un índice de inicio S y una longitud L de bloques de recursos virtuales, VRB, consecutivos;y transmitir la señal de enlace descendente en los VRB consecutivos, en donde, si se da Y - 1 _X /2_ el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(Y - 1) + Z si no el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(X- Y + 1) + (X- 1 -Z), donde X se indica por X = / G_, Y se indica por Y = L/G, Z se indica por Z = S/G, Nvrb es un número de VRB y G es un entero de 2 o más.
- 3El método según la reivindicación 1 o 2, en donde, una longitud, Nbit requerido, de un campo de bit usado para transmitir el RIV se indica por Nbit requerido = Plog 2 (R7V ax +1)|, donde RIVmax se indica por RIVmax = ' /GMNr, /G_+1)/2 -1.
- 4El método según una cualquiera de las reivindicaciones 1 a 3, en donde el valor G es 2 o 4 (G =2 o 4).
- 5El método según la reivindicación 1 o 2, en donde los VRB consecutivos son un conjunto de VRB distribuidos, DVRB.
- 6Un aparato para uso en un sistema de comunicación móvil inalámbrico, el aparato que comprende:un receptor y un procesador, en donde el procesador se configura para: recibir información de control de enlace descendente común que incluye un valor de indicación de recurso, RIV, en donde el RIV se correlaciona a un índice de inicio S y una longitud L de bloques de recursos virtuales, VRB, consecutivos y recibir una señal de enlace descendente en los VRB consecutivos, en donde, si se da Y - 1 _X /2_, el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(Y - 1) + Z si no el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(X- Y + 1) + (X- 1 -Z), donde X se indica por X = _Ν^ / G_, Y se indica por Y = L/G, Z se indica por Z = S/G, Nvrb es un número de VRB y G es un entero de 2 o más.
- 7Un aparato para uso en un sistema de comunicación móvil inalámbrico, el aparato que comprende:ES 2 586 624 T3 un transmisor y un procesador, en donde el procesador se configura para: transmitir información de control de enlace descendente común que incluye un valor de indicación de recursos, RIV, en donde el RIV se correlaciona a un índice de inicio S y una longitud L de bloques de recursos virtuales, VRB, consecutivos y transmitir una señal de enlace descendente en los VRB consecutivos, en donde, si se da Y - 1 _X / 2_, el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(Y - 1) + Z si no el RIV se correlaciona al índice de inicio S y la longitud L de los VRB consecutivos según una relación de RIV = X(X- Y + 1) + (X- 1 -Z), donde X se indica por X = / G_, Y se indica por Y = L/G, Z se indica por Z = S/G, Nvrb es un número de VRB y G es un entero de 2 o más.
- 8El aparato según la reivindicación 6 o 7, en donde, una longitud, Nbit requerido, de un campo de bit usado para transmitir el RIV se indica por Nbit requerido = Plo^ 2 (RIV mx¡í +1)|, donde RIVmax se indica por RIVmax = V. /GJ(_N,„ /G_+1)/2 -1.
- 9El aparato según una cualquiera de las reivindicaciones 5 a 7, en donde el valor G es 2 o 4 (G =2 o 4).
- 10El aparato según la reivindicación 6 o 7, en donde los VRB consecutivos son un conjunto de VRB distribuidos, DVRB.
Independent claims10
266 paragraphs in 13 sections, as filed
ES 2 586 624 T3
DESCRIPTION
Method and apparatus for resource allocation signaling to adjust granularity in a cellular multi-carrier system
Technical field
The present invention relates to a broadband wireless mobile communication system and, more particularly, to scheduling radio resources for uplink / downlink packet data transmission in a frequency division multiplexing wireless packet communication system. orthogonal (OFDM) cell.
Background of the technique
In a cellular orthogonal frequency division multiplexing (OFDM) wireless packet communication system, uplink / downlink data packets are transmitted on a subframe basis and a subframe is defined by a certain time interval which includes a plurality of OFDM symbols.
The 3 Cooperation Project<sup>to</sup> Generation (3GPP) supports a type 1 radio frame structure applicable to frequency division duplex (FDD) and a type 2 radio frame structure applicable to time division duplex (TDD). The structure of a type 1 radio frame is shown in FIG. 1. The type 1 radio frame includes ten subframes, each of which consists of two slots. The structure of a type 2 radio frame is shown in FIG. two. The type 2 radio frame includes two half frames, each of which is composed of five subframes, a downlink pilot time slot (DwPTS), a gap period (GP), and a pilot time slot of uplink (UpPTS), in which a subframe consists of two slots. That is, a subframe is made up of two slots regardless of the type of radio frame.
A signal transmitted from each slot can be described by a resource grid that includes ND N<sup>r</sup>b OFDM subcarriers and symbols. Here, ND represents the number of resource blocks (RB) in a downlink, N<sup>R</sup>B represents the number of subcarriers that make up an RB and represents the number of OFDM symbols in a downlink interval. The structure of this resource grid is shown in FIG. 3.
RBs are used to describe a correlation relationship between certain physical channels and resource elements. RBs can be divided into physical resource blocks (PRBs) and virtual resource blocks (VRBs). A correlation relationship between VRBs and PRBs can be described on a subframe basis. In more detail, it can be described in units of an interval that constitutes a subframe. Also, the correlation relationship between VRBs and PRBs can be described using a correlation relationship between VRB indices and PRB indices. A detailed description of this will be given further in the embodiments of the present invention.
A PRB is defined by consecutive OFDM symbols in a time domain and N<sup>R</sup>B consecutive subcarriers in a frequency domain. A PRB is therefore composed of ND<sub>mb</sub> N<sup>R</sup>B resource items. PRBs are assigned numbers from 0 to ND -1 in the frequency domain.
A VRB can be the same size as the PRB. There are two types of VRBs defined, the first being a localized type and the second being a distributed type. For each VRB type, a VRB pair has a unique vRb index (hereinafter referred to as a 'VRB number') and they are allocated over two slots of a subframe. In other words, ND VRBs that belong to a first of two slots that constitute a subframe are each assigned to any index from 0 to ND - 1 and ND VRBs that belong to a second of the two slots are each assigned in the same way at any index from 0 to ND -1.
The index of a VRB that corresponds to a specific virtual frequency band of the first interval has the same value as that of the index of a VRB that corresponds to the virtual frequency band of the second interval. That is, assuming that a VRB that corresponds to a virtual frequency band of order i of the first interval is indicated by VRB1 (i), a VRB that corresponds to a virtual frequency band of order j of the second interval is indicated by VRB2 ( j) and the index numbers of VRB1 (i) and VRB2 (j) are indicated by index (VRB1 (i)) and index (VRB2 (j)), respectively, an index relationship (VRB1 (k)) is established = index (VRB2 (k)) (see FIG. 4A).
Similarly, the index of a PRB that corresponds to a specific frequency band of the first interval has the same value as that of the index of a PRB that corresponds to the specific frequency band of the second interval. That is, assuming that a PRB that corresponds to a frequency band of order i of the first
ES 2 586 624 T3 interval is indicated by PRB1 (i), a PRB corresponding to a frequency band of order j of the second interval is indicated by PRB2 (j) and the index numbers of PRB1 (i) and PRB2 (j ) are indicated by index (PRB1 (i)) and index (PRB2 (j)), respectively, an index relationship (PRB1 (k)) = index (PRB2 (k)) is established (see FIG. 4B).
Some of the VRBs mentioned above are assigned as being of the localized type and the others are assigned as being of the distributed type. Hereinafter, VRBs assigned as being of the localized type will be known as 'Localized Virtual Resource Blocks (LVRB)' and VRBs assigned as being of the distributed type will be known as 'Distributed Virtual Resource Blocks (DVRB)'.
Localized VRBs (LVRB) are directly correlated with PRBs, and LVRB indices correspond to PRB indices. Also, the LVRBs of index i correspond to the PRBs of index i. That is, an LVRB1 that has the index i corresponds to a PRB1 that has the index i and an LVRB2 that has the index i corresponds to a PRB2 that has the index i (see FIG. 5). In this case, it is assumed that the VRBs of FIG. 5 are all assigned as LVRB.
Distributed VRBs (DVRB) cannot be directly mapped to PRBs. That is, the DVRB indices can be correlated with the PRBs after being subjected to a series of processes.
First, the order of a sequence of consecutive DVRB indexes can be reversed by a block interleaver. Here, the sequence of consecutive indices means that the index number is sequentially increased by one starting with 0. A sequence of indices drawn from the block interleaver is sequentially correlated with a sequence of consecutive indices from PRB1 (see FIG. 6). The VRBs of FIG. 6 are all assigned as DVRB. Thereafter, the index sequence output from the block interleaver is cyclically shifted by a predetermined number and the cyclically shifted index sequence is sequentially correlated with a sequence of consecutive PRB2 indexes (see FIG. 7). The VRBs of FIG. 7 are all assigned as DVRB. In this way, PRB indices and DVRB indices can be correlated over two intervals.
On the other hand, in the above processes, a sequence of consecutive indices of the DVRB, not passed through the interleaver, can be sequentially correlated with the sequence of consecutive indices of the PRB1. Also, the consecutive index sequence of the DVRBs, not passed through the interleaver, can be cyclically shifted by the predetermined number and the cyclically shifted index sequence can be sequentially correlated with the PRB2 consecutive index sequence.
According to the previously mentioned processes of correlation of DVRB with PRB, a PRB1 (i) and a PRB2 (i) that have the same index i can be correlated with a DVRB1 (m) that has an index 'm' and a DRVB2 (n ) which has an index 'n', respectively. For example, referring to FIGS. 6 and 7, a PRB1 (1) and a PRB2 (1) correlate with a DVRB1 (6) and a DVRB2 (9) that have different indices, respectively. A frequency diversity effect can be obtained based on the DVRB correlation scheme.
A variety of methods can be used to map such VRBs, for example, a bitmap method and a compact method. According to this bitmap method, all resources on the system band can be freely allocated and non-consecutive RBs can also be allocated. However, the above-mentioned bitmap method has a disadvantage in that the number of bits required for allocation of the RBs inevitably increases as the number of RBs increases. According to the compact method, only one set of consecutive RBs can be assigned all over the system band . In order to represent consecutive RBs, a resource indication value (RIV) can be defined. This RIV may represent a combination of a starting point (S) of the series of assigned RBs among all RBs and a length (L) of the series of assigned RBs. According to the number of generable combinations of the starting point (S) and the length (L), the number of bits representing a certain RIV to indicate a specific combination is decided by the above compact method. Assuming that the number of bits this RIV represents can be reduced, the remaining bits can be used to transmit other information.
The 3GPP technical specification TS 36.213, V8.3.0, dated May 1, 2008, entitled "TS 36.213 E-UTRA Physical layer procedure", describes a resource allocation to a UE through a resource allocation field carried in a PDCCH and different formats of such a field associated with different types. In particular, a RIV resource indication value is defined using a starting resource block and a length in terms of contiguously allocated resource blocks.
Description
Technical problem
An object of the present invention conceived to solve the problem lies in a method for reducing an amount of control information representing a range of allocation resources in a resource allocation scheme based on the compact method.
Technical solution
ES 2 586 624 T3
The present invention is defined in the independent claims. The particular embodiments are set out in the dependent claims.
Z = S / G, in which, L is the length of a set of consecutive virtual resource blocks (VRB), S is the starting index of a set of consecutive virtual resource blocks (VRB), Nvrb is the number of virtual resource blocks (RB) available in the wireless mobile communication system, each of L and S is a multiple of G and G is a predetermined natural number.
Nrb can be indicated by Nrb = _ ©<sub>w</sub>.<sub>;</sub> / G _G, where Nvrb is the number of virtual resource blocks (VRB) available in the wireless mobile communication system.
Required_bit of a bit field used to transmit the resource indication value (RIV) can be indicated by required_bit = log<sub>2</sub>(RIR. +1 ”|, where RIV<sub>max</sub>indicated by RIV<sub>max</sub> = _.\ <sub>R;</sub> / G_ | '(_ ^<sub>RB</sub> / G_ | +1) / 2-1.
Advantageous effects
The present invention provides a radio resource scheduling scheme, a scheduling information structure and a transmission scheme, so that it can more efficiently implement a resource allocation scheme for common signaling.
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 principles of the invention.
In the drawings:
FIG. 1 is a view showing an example of a radio frame structure applicable to FDD.
FIG. 2 is a view showing an example of a radio frame structure applicable to TDD.
FIG. 3 is a view showing an example of a resource grid structure constituting a 3GPP transmission interval.
FIG. 4A is a view showing an example of the structure of VRBs in a subframe.
FIG. 4B is a view showing an example of the structure of PRBs in a subframe.
FIG. 5 is a view illustrating an example of a method for mapping LVRBs to PRBs.
FIG. 6 is a view illustrating an example of a method for mapping DVRBs in a first interval to PRBs.
FIG. 7 is a view illustrating an example of a method for correlating DVRBs in a second interval to PRBs.
FIG. 8 is a view illustrating an example of a method for mapping DVRBs and LVRBs to PRBs.
FIG. 9 is a view illustrating an example of a method for allocating resource blocks by compact schema.
FIG. 10 is a view illustrating an example of a method for correlating two DVRBs having consecutive indices with a plurality of contiguous PRBs.
FIG. 11 is a view illustrating an example of a method for correlating two DVRBs having consecutive indices with a plurality of separate PRBs.
FIG. 12 is a view illustrating an example of RIVs when Nrb = 20.
FIG. 13 through 19 are views illustrating the RIVs of generable combinations of S and L values according to one embodiment of the present invention.
Mode for invention
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 be given below 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 present invention. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, it will be apparent to
IT IS 2 586 624 T3 skilled in the art that the present invention can be practiced without such specific details. For example, the following description will center around specific terms, but the present invention is not limited thereto and any other terms may be used to represent the same meanings. Also, wherever possible, the same reference numerals will be used throughout the drawings to refer to the same or similar parts.
Hereinafter, terms used in the detailed description of this application are defined as follows.
A 'resource element (RE)' represents the smallest frequency-time unit in which data or a modulated symbol of a control channel is correlated. Provided that a signal is transmitted in one OFDM symbol on M subcarriers and N OFDM symbols are transmitted in one subframe, MxN REs are present in one subframe.
A 'physical resource block (PRB)' represents a unit frequency-time resource for data transmission. In general, a PRB includes a plurality of consecutive REs in a frequency-time domain and a plurality of PRBs are defined in a subframe.
A 'virtual resource block (VRB)' represents a virtual unit resource for data transmission. In general, the number of REs included in a VRB is equal to the number of REs included in a PRB, and when data is transmitted, a VRB can be mapped to a PRB or some areas of a plurality of PRBs.
A 'localized virtual resource block (LVRB)' is a type of the VRB. An LVRB maps to a PRB, and the PRBs that different LVRBs map to are not duplicated. An LVRB can be interpreted just like a PRB.
A virtual distributed resource block (DVRB) 'is another type of VRB. A DVRB is mapped to some REs in a plurality of PRBs and the REs to which different DVRBs are mapped are not duplicated.
'Nd' = 'Nd represents the number of PRBs to which a DVRB is mapped. FIG. 8 illustrates an example of a method for mapping DVRBs and LVRBs to PRBs. In FIG. 8, Nd = 3. As can be seen from FIG. 8, an arbitrary DVRB can be divided into three parts, and the divided parts can be mapped to different PRBs, respectively. At this time, the remaining part of each PRB, uncorrelated by the arbitrary DVRB, is correlated with a divided part of another DVRB.
'Nprb' represents the number of PRBs in a system. 'Nlvrb' represents the number of LVRBs available in the system.
'Nlvrb' represents the number of LVRBs available in the system.
'Ndvrb' represents the number of DVRBs available in the system.
'Nlvrb_ue' represents the maximum number of LVRBs assignable to a user equipment (UE).
'Ndvrb_ue' represents the maximum number of DVRBs assignable to a UE.
'Nsubset' represents the number of subsets.
Here, the "RB number" means the number of the RBs divided on a frequency axis. That is, even in the case where the RBs can be divided by intervals that constitute a subframe, the "number of RBs" means the number of the RBs divided on the frequency axis in the same interval.
FIG. 8 shows an example of LVRB and DVRB definitions.
As can be seen from FIG. 8, each RE of an LVRB is mapped one-to-one to each RE of a PRB. For example, an LVRB maps to a PRB0 (801). In contrast, a DVRB is divided into three parts and the divided parts are mapped to different PRBs, respectively. For example, a DVRB0 is divided into three parts and the divided parts are mapped to a PRB1, PRB4, and PRB6, respectively. Similarly, a DVRB1 and a DVRB2 are each divided into three parts and the divided parts are mapped to the remaining resources of PRB1, PRB4 and PRB6. Although each DVRB is divided into three parts in this example, the present invention is not limited thereto. For example, each DVRB can be divided into two parts.
The transmission of downlink data from a base station to a specific terminal or the transmission of uplink data from the specific terminal to the base station is done through one or more VRBs in a subframe. When the base station transmits data to the specific terminal, it has to notify the terminal of which of the VRBs through which the data will be transmitted. Also, in order to allow the specific terminal to transmit data, the base station has to notify the terminal of which of the VRBs through which the data can be transmitted.
ES 2 586 624 T3
Data transmission schemes can be broadly classified into a frequency diversity scheduling scheme (FDS) and a frequency selective scheduling scheme (FSS). The FDS scheme is a scheme that achieves a receive performance gain through frequency diversity and the FSS scheme is a scheme that achieves a receive performance gain through frequency selective scheduling.
In the FDS scheme, a transmission stage transmits a data packet on widely distributed subcarriers in a frequency domain of the system so that the symbols in the data packet may experience various radio channel fading. Therefore, an improvement in reception performance is obtained by preventing all data packets from being subjected to unfavorable fading. On the contrary, in the FSS scheme, an improvement in reception performance is obtained by transmitting the data packet over one or more consecutive frequency areas in the system frequency domain that are in a favorable fading state. In a cellular OFDm wireless packet communication system, a plurality of terminals are present in a cell. At this time, because the radio channel conditions of the respective terminals have different characteristics, it is necessary to perform data transmission of the FDS scheme with respect to a certain terminal and data transmission of the FSS scheme with respect to a different terminal even within of a subplot. As a result, a detailed FDS transmission scheme and a detailed FSS transmission scheme must be designed so that the two schemes can be efficiently multiplexed within a subframe. On the other hand, in the FSS scheme, a gain can be obtained by selectively using a band favorable to a UE among all available bands. In contrast, in the FDS scheme, no comparison is made as to whether a specific band is good or bad and, as long as a frequency range capable of adequately obtaining diversity is maintained, there is no need to select and transmit a specific frequency band. Therefore, it is advantageous for overall system performance improvement to perform frequency selective scheduling of the FSS scheme preferably when scheduling.
In the FSS scheme, because the data is transmitted using consecutively contiguous subcarriers in the frequency domain, it is preferable that the data is transmitted using the LVRBs. At this time, provided that Nprb PRBs are present in a subframe and a maximum of Nlvrb LVRBs are available within the system, the base station can transmit bitmap information of Nlvrb bits to each terminal to notify the terminal of which of the LVRBs through which downlink data will be transmitted or which of the LVRBs through which uplink data can be transmitted. That is, each bit of the N LVRB-bit bitmap information, which is passed on to each terminal with the highest programming information, indicates whether data will or can be transmitted through an LVRB. which corresponds to this bit, between the LVRB Nlvrb. This scheme is disadvantageous in that, when the number Nlvrb becomes larger, the number of bits to be transmitted to each terminal becomes larger in proportion thereto.
On the other hand, a physical downlink control channel (PDCCH) DCI handed over to a user equipment (UE) may have a plurality of formats. A resource allocation field transferred on the PDCCH may have different structures according to the DCI formats. In this way, the user equipment (UE) can interpret the resource allocation field according to a format of the received DCI.
The resource allocation field can have two parts, that is, resource block allocation information and a resource allocation header field. A plurality of resource allocation types can be defined. For example, according to a first type of resource allocation, the resource block allocation information may have a bitmap indicating a set of consecutive physical resource blocks (PRBs). In this case, one bit can be assigned to a Resource Block Group (RBG). According to a second type of resource allocation, a resource block allocation information may have a bitmap indicating subsets or RBs allocated to the UE. According to a third type of resource allocation, the resource block allocation information may have a bitmap indicating the VRBs allocated consecutively. At this time, the resource allocation field may include a resource indication value (RIV) indicating a resource block start and the length of consecutively allocated resource blocks (RB). Examples of the types of resource allocation mentioned above have been described in 3GPP TS 36.213.
For example, a DCI 1A format prescribed in 3GPP TS 36.213 can be used for compact programming of a physical downlink shared channel (PDSCH) codeword. This compact scheduling is a scheduling scheme for allocating a set of consecutive VRBs to a user equipment (UE) and corresponds to the third type of resource allocation above. Hereinafter, the aforementioned compact programming in the present invention may be known as a compact scheme.
As described above, provided that a terminal (i.e. UE) can only be assigned to a set of contiguous RBs, information from the assigned RBs can be represented by the compact scheme indicated by both a RB start point as the number of the RB.
FIG. 9 is a view illustrating an example of a method for allocating resource blocks by compact schema. If the number of available RBs is indicated by Nrb = Nvrb, the length of the available RBs is different
ES 2 586 624 T3 depending on the respective starting points as shown in FIG. 9, so the number of combinations for RB assignment is Nlvrb (Nlvrb +1) / 2 at the end. Therefore, the number of bits required for combinations is 'ceiling (log2 (NLVRB (NLVRB +1) / 2)'. Here, ceiling (x) means rounding “x” to the nearest integer. This method is advantageous over the bitmap scheme in that the number of bits does not increase as significantly with the increase in the number Nlvrb.
On the other hand, for a method of notifying a user equipment (UE) of the DVRB assignment, it is necessary to previously compromise the positions of the respective divided parts of the transmitted DVRBs in a distributed manner for a diversity gain. Alternatively, additional information may be required to directly report positions. Preferably, provided that the number of bits for signaling for DVRBs is set to be equal to the number of bits in transmission of LvRb of the compact scheme indicated above, it is possible to simplify a signaling bit format in a downlink. As a result, there are advantages in that the same channel coding can be used, etc.
Here, in the case where a plurality of DVRBs is assigned to a UE, this UE is informed of a DVRB index of a DVRB start point, a length (= the number of assigned DVRBs) and a position difference relative between divided parts of each DVRB (for example, a gap between the divided parts).
FIG. 10 illustrates an example of a method for correlating two DVRBs having consecutive indices with a plurality of contiguous PRBs.
As shown in FIG. 10, in the case where a plurality of DVRBs having consecutive indices correlate with a plurality of contiguous PRBs, the first divided parts 1001 and 1002 and the second divided parts 1003 and 1004 are separated from each other by a gap 1005, while the divided parts belonging to each of the upper divided parts and the lower divided parts are contiguous with each other, so that the order of diversity becomes 2.
FIG. 11 illustrates an example of a method for correlating two DVRBs having consecutive indices with a plurality of separate PRBs.
In the method of FIG. 11, the DVRB indices are constructed as shown in FIG. 1. When DVRBs are allowed to correspond to PRBs, consecutive DVRB indices can be allowed to be distributed, not to correspond to contiguous PRBs. For example, a DVRB index '0' and a DVRB index '1' are not arranged contiguous with each other. In other words, in FIG. 11, the DVRB indices are arranged in the order of 0, 8, 16, 4, 12, 20, ... and this arrangement can be obtained by entering the consecutive indices in FIG. 10, for example, to a block interleaver. In this case, it is possible to obtain a distribution within each of the divided parts 1101 and 1102, as well as a distribution across a gap 1103. Therefore, when two DVRBs are assigned to a UE as shown in FIG. 11, the order of diversity increases to 4, causing an advantage that the diversity gain can be obtained further.
At this time, the value of the gap indicative of the relative position difference between the divided parts can be expressed in two ways. First of all, the value of the gap can be expressed by a difference between the DVRB indices. Second, the value of the gap can be expressed by a difference between PRB indices to which a DVRB is correlated. In the case of FIG. 11, Gap = 1 in the first form, while Gap = 3 in the second form. FIG. 12 shows the latter case 1103. Meanwhile, if the total number of RBs in the system is changed, the DVRB index arrangement can be changed accordingly. In this case, the use of the second way has the advantage of grasping the physical distance between the divided parts.
In order to realize DVRB assignment signaling, the aforementioned compact LVRB scheme can be used. In this case, a start point of consecutively assigned RBs and length information of the RBs correspond to a start point of VRB indices instead of PRB indices and length information of them, respectively.
As described above, in the compact scheme, the LVRB signaling includes a start point of the RBs and length information of the RBs. In order to perform DVRB signaling, gap information may be additionally required in some cases. In order to constantly maintain the number of bits required for the entire signaling, there is a need to limit the length information so that an amount of information must be reduced. For example, in case of using 50 RB or more, a bit of the RIV field must be allocated for gap indication, so that there is a need to reduce the number of bits required to transfer the RIV with the limitation on the information of the RIV. length.
On the other hand, in case of using the RBs to perform common signaling for several users, a control signaling to notify the assigned RBs should allow all users present in the cell to read information from the assigned RBs. In this way, for this control signaling, a code rate can be reduced or a transmission power can be increased, so that the resulting control signaling information having a low code rate and a high transmission power is you can broadcast to multiple users. In order to reduce the code rate of control signaling to which limited resources are allocated, a
ES 2 586 624 T3 amount of control data. In order to reduce the amount of control data, the number of bits required for RB allocation information must be reduced.
Similarly, the control message data transferred to the assigned RBs should allow all users present in the cell to read the corresponding information, so that the control message data is transferred at a low code rate. Assuming that the code rate is 1/20, if a data quantity increases by 16 bits, a codeword quantity made after one channel encoding increases by 320 bits. In the Long Term Evolution (LTE) of 3GPP, assuming that a TX antenna transmission is carried out (i.e. 1 Tx antenna transmission) and an OFDM symbol is used for a control signal, the number of symbols capable of transferring payload data within an RB (ie 1RB) is 148. Thus, assuming that a Quadrature Phase Shift Keying (QPSK) modulation is used, the number of transferable bits is 296. As a result, the data increases by 16 bits, the data of 320 bits increases, so that two additional RBs are needed.
That is, in order to maintain a low code rate, although the data size increases a little, the number of RBs required to transfer this data increases extremely, so that the need for RBs to be allocated with a granularity of one unit. of RB (that is, a granularity based on 1RB).
Hereinafter, a resource allocation signaling structure for setting a step to limit a start position with a granularity of an allocation of one RB (ie, allocation of 1RB) will be described in detail.
The following equation 1 shows an exemplary signaling method based on the compact scheme that reports a start point (S) of the RBs and the number (= Length, L) of the assigned RBs.
In the following description, "mod (x, y)" means "x mod y" and "mod" means a modulo operation. Also, "[_ · _]" means a descending operation and represents the largest of integers less than or equal to a number indicated in "_ _". On the other hand, "p-" means an ascending operation and represents the smallest of integers greater than or equal to a number indicated in "-". Also, "round (·)" represents an integer closer to a number indicated in "()". "Min (x, y)" represents the smallest value selected between x and y, while "max (x, y)" represents the largest value selected between x and y.
Equation 1 if L - 1 <_N <sub>|<|;</sub> / 2_ then
RIV = Nrb (L -1) + S otherwise
RIV = Nrb (Nrb-L + 1) + (Nrb-1 - S)
End
Required bits <sup>N</sup>required_bit = PlO<sup>g</sup><sub>2</sub> (RIV<sub>me</sub>x + 1) No limitation
RlVmax = Nrb · (Nrb + 1) / 2 - 1
No limitation L<sup>Limile</sup>
RIVmax = min {NRB · (Nrb + 1) / 2 - 1, Nrb (L<sup>Umite</sup> - 1) + Nrb - L<sup>Umite</sup>}
Assuming that the total number of all available RBs is indicated by Nrb and the starting number of indices to be assigned to the RBs is set to 0, the indices from 0 to Nrb-1 are sequentially assigned to the RBs. In this case, Nrb can be the total number of all RBs contained in a band of the system, the number of all RBs used as VRBs, or the number of RBs contained in any limited area.
In this way, the interval of S can be 0 <S <Nrb-1 and the interval of the assignable value 'L' is changed according to this value S. In another view, the value L is in the interval of 0 <L <Nrb and the range of the available S-value is changed according to the L-value. That is, a certain S-value is incapable of being combined with a specific L-value.
ES 2 586 624 T3
A maximum value of each of the S and L values can be represented by a binary number, regardless of such impossible combinations. A bit field for this binary number can be constructed for each of the S and L values. In case of transmission of each of the bit fields, if Nrb is 20 (that is, Nrb = 20), 20 is less than 2<sup>5</sup> (i.e. 20 <2<sup>5</sup>), so that 5 bits are needed for the S values and 5 bits for the L values, that is, a total of 10 bits. However, unnecessary transmission bit oversizing is generated because these 10 bits include even useless combination information that cannot be actually generated. In this way, if each generable combination of S and L values is represented by 'RIV', this RIV is converted to a binary number according to a binary representation and the resulting RIV of the binary number is then transferred, the number of bits can be reduced of transmission.
FIG. 12 is a view illustrating an example of RIVs when Nrb = 20.
As can be seen from FIG. 12, an 'RIV' is decided according to the values S and L. In case of calculating an 'RIV' related to 0 <S <Nrb-1 in each of all the L values using Equation 1, the RIVs of FIG. 12. The value of each item shown in FIG. 12 is 'RIV' which indicates a combination of S and L values corresponding to the previous element. The values contained in an upper left part that cover almost half of the FIG. 12 corresponds to generable combinations of the S and L values when Nrb = 20 and the values contained in a lower right part colored in gray, which cover the other half of FIG. 12, correspond to combinations of S and L values that cannot be generated.
In this scheme, the RIVs present in the part colored in gray under the condition of L - 1 <_N<sub>k |</sub>, / 2_, are correlated with RIVs under the other condition of L - 1> _N<sub>k |</sub>, / 2_, so there is no RIV to be spent. For example, if Nrb is set to 20 (that is, Nrb = 20), the RIVs present in a specific part that corresponds to L <_Ni; / 2_ +1 = _20 / 2_ + 1 = 11 between the bottom right of the FIG. 12 are reused elsewhere that corresponds to L> _N<sub>k |</sub>, / 2_ +1 = _20 / 2_ + 1 = 11 between the upper left of FIG. 12. In this case, a maximum value (that is, a maximum RIV) among the RIVs in the upper left corner is 209.
In this scheme, the maximum RIV can influence the number of transmission bits, the RIVs below the maximum RIV cannot be correlated with values that cannot be obtained by combinations of real S and L values. That is, all values below the maximum RIV correspond to generable combinations of S and L values.
In case the S value is transmitted separately, a maximum S value is 19, so that 5 bits are needed to indicate this S value '19' (where 0 <19 <2<sup>5</sup>). In case the L value is transmitted separately, a maximum L value is 20, so that 5 bits are needed to indicate this value S '20' (where 0 <20 <2<sup>5</sup>). Therefore, in case of transmitting the S and L values independent of each other, 10 bits are needed at the end. However, IVRs are in the range of 0 <IVR <209 <2<sup>8</sup>, so that 8 bits are needed to indicate these RIVs, as indicated by Nbit_required = 8. As a result, it can be recognized that 2 bits are saved compared to the previous case of transmitting the S and L values independent of each other.
Meanwhile, in the RIV construction method mentioned above, if a maximum value (= L<sup>Limit</sup>) of assigned RBs is limited, that is, if the value L is limited to L<sup>Limit</sup> or less, the number of bits required can be reduced.
In FIG. 12, if L<sup>Limit</sup> is set 6 (that is, L<sup>Limit</sup> = 6), the generable range of L values is given as 1 <L <6, combinations that have other L values that have the range of 7 <L <20 are not in use. At this time, it can be recognized that a maximum IVR among the IVRs is 114. That is, the interval of generable IVRs is given as 0 <IVR <114 <2<sup>7</sup>, so the number of required bits is 7 as indicated by Nbit_requerido_lim = 7.
However, in the case of using the RBs for common signaling as described above, there is a need to reduce the number of bits used for resource allocation. Thus, a method for limiting the S and L values according to the present invention will be described in detail hereinafter.
Embodiment 1
A method for limiting each of the S and La values to a multiple of G (where G is a positive integer) according to a first embodiment of the present invention will be described hereinafter.
If each of the S and L values is limited to a multiple of G, a maximum RIV can be decreased between the RIVs represented by combinations of S and L values. That is, an incremental step of the S value can be set to G and an incremental granularity of the L value can be set in units of G.
FIG. 13 shows RIVs related to generable combinations of S and L values under the condition that Nrb is 20 (Nrb = 20) and G is 2 (G = 2) according to the first embodiment.
ES 2 586 624 T3
A gray colored area of FIG. 13 corresponds to combinations of S and L values that cannot be generated under the condition that Nrb is 20 (Nrb = 20) and G is 2 (G = 2). IVRs are in the range of 0 <IVR <54 <2<sup>6</sup>, so 6 bits are needed to indicate these IVRs, as indicated by Nb¡t_com<sub>P</sub>act = 6.
If a start point step and its granularity are all set to G, the number of bits used to express the IVRs becomes less than that of the conventional scheme.
Thus, provided that [_<sup>Limit</sup> can be set to limit a maximum value between available L values, the required number of bits can be further reduced. As can be seen from FIG. 13, if [_<sup>Limit</sup> is set to 6, it can be recognized that a maximum RIV is 27. At this time, because combinations are not in use, each having the value L within the range of 8 <L <20, the RIVs are in the range from 0 <IVR <27 <2<sup>5</sup>, so that the number of bits required is 5 as indicated by Nb¡t_requer¡do_i¡m = 5.
The following equation 2 is used to obtain the RIVs according to S and L values under the condition that Nrb and G are given. In this case, the number of bits required to express the RIVs can be calculated in different ways depending on the setting of [ _<sup>Limit</sup> If a maximum length of RB is required, [_<sup>Limit</sup> is indicated by [_<sup>Limit</sup> = g- | | If a maximum allowable amount of RB is given, [_<sup>Limit</sup> is indicated by [_<sup>Limit</sup> = g- | _L<sup>max</sup>- P<sup>allowed</sup> / QJ
Equation 2 <T = G>
Step: T = G RB
Granularity: G RB if (¿! G -1) <| [y<sub>;to</sub> / G_ | / 2j then
RIV = | _ / V<sub>M</sub> / g] · (i / G -1) + S / G otherwise / ÍZF = L ^ / Gj (L ^ / Gj-i / G + l) + (K<sub>fl</sub>/ Gj-l-5 / G) end
Required bits + Di
Without limitation
With limitation / g] or G- [l max_allowed
<img file="ES2586624T3_D0001.tif" />
/ gJ '<4+ »/ 2-0)
As can be seen from Equation 2, the parameters of equations that make up Equation 1 above are substituted for others in Equation 2, so there is an advantage that the existing equation can be used without any change. In more detail, Equation 1 showing a method for deciding a starting point and a length on a basis of an RB can correspond to the following equation 3 under the condition that X = Nrb, Y = L and Z = S. Equation 2 which shows a method to decide a starting point and a length in units of G RB can correspond to the following equation 3 under the condition that X = | _N<sub>|<|;</sub> / G_ |, Y = L / G and Z = S / G.
Equation 3
ES 2 586 624 T3
If y ~ l <j_JV / 2j
RIV = X {Y -Y) + Z otherwise
RIV = X (X - y +1) + (Ύ -1 - Z)
End
This relationship can also be represented by the following expression 1
Expression 1
Method to decide the Starting Point and Length in units of a RB (1 RB) <sup>x</sup> = <sup>x</sup>kb Y - £ Z = S s¡ yi <[x / 2j
RIV = X (Y-1) + Z otherwise
RIV = X (X - y + 1) + (Ύ -1 - Z)
End or
Method for deciding the starting point and length in units of G RB
Y = UG Z = SIG? * if Yl <| _X / 2j
RIV = X (Y - 1) + Z otherwise
RIV = X (X-Y + l) + (XlZ)
End
On the other hand, assuming that Nrb is a multiple of G, each RIV obtained by the previous equation that has been done to calculate the RIV using combinations of S and L values in units of one RB (1 RB) is divided by G, from Thus the resulting RIV obtained by this division becomes any of the RIVs obtained by combinations of S and L values in units of G RB. Therefore, assuming that Nrb is a multiple of G, the RIV can be represented by the following expression 2.
Expression 2
Method to decide the Start Point and the Length in units of G RB in case Nrb is a multiple of G
ES 2 586 624 T3 if L - 1 <i 2 J then
RW = N<sub>Kli</sub>(LY) + S otherwise
RIV '= Νμ (Ν<sub>κβ</sub> -L + r) + (N<sub>R1</sub> -lS)
End
RIV = RIV '/ G
If the total number of all RBs in the system is set to Nprb, then Nvrb indicating the number of VRBs used to assign RB indices or RB numbers can be less than or equal to Nprb. Since each of the RB indices assigned according to the method of Equation 2 proposed by the present invention is a multiple of G, the number of RBs used for this assignment can also be indicated by a multiple of G. In this way, if Nrb for use in the previous expression is not a multiple of G, as many RB as a remainder made when Nrb is divided by G may not be used for RB assignment. Therefore, it is preferable that Nrb is set to Nrb = l_N<sub>VRB</sub> / O] G. Under this condition indicated by Nrb =
LLn
VRB / gJ-g / gJ = LLn
VRB
L<sup>N</sup>vrb<sup>/ G!</sup>JG, it can be recognized that X = | _N<sub>|<|;</sub> / Gj = / Gjj = | _n<sub>vrb</sub>/ gJ.
Assuming that the number of available RBs really is Nvrb, due to a granularity constraint, as many RBs as a remainder made when Nvrb is divided by G, that is, N<sub>RB</sub>° = N<sub>n <</sub>¡¡~ LM'w? / óJ'G RB remaining, cannot be assigned.
In order to assign such remaining RBs, Nrb can be set to N<sub>RB</sub> = PV<sub>(7i</sub>,<sub>/;</sub> / G [G. However, under this condition<sup>N</sup>rb = [<sup>N</sup>ms / <sup>G</sup>~}<sup>G</sup> if the remaining RBs are assigned, the L value can include the number of imaginary RBs, that is,] \ [<sup>l</sup>^ smario _ / g [G - Ny ^. As a result, if the remaining RBs are assigned, the length of the assigned RB iix 11 T Ά T actually becomes L - Jy<sub>RB</sub>
Embodiment 2
According to this embodiment, an optimization method will be described in detail hereinafter, under the condition that each of the values S and L is limited to a multiple of G (where G is a positive integer) and [_<sup>Limit</sup> is established.
The FlG. 14 shows RIVs related to generable combinations of S and L values under the condition that Nrb is 40 (Nrb = 40) and G is 2 (G = 2) in the method described in the first embodiment. In this case, it can be recognized that a maximum RIV among the RIVs under the condition that L<sup>Limit</sup>is 14 (that is, [_<sup>Limit</sup>= 14) is 133.
If L<sup>Limit</sup> is set to 14 (L<sup>Limit</sup> = 14), 8 bits are needed because 0 <RIV <133 <2<sup>8</sup>. However, the IVRs (= 39, 58-59, 77-79, 96-99, 115-119) included in the part colored in gray (see Fig. 14) under the condition of 4 <L <12 are not can be used as RIVs although the RIVs (= 39, 58-59, 77-79, 96-99, 115-119) are less than the maximum RIV 133. That is, the number of bits required to transmit the RIVs may be spent . In order to remove the spent RIVs, under the condition that Nrb, G and [_<sup>Limit</sup> are limited, there is a need to construct a table for the RIVs so that all numbers below the maximum RIV among the RIVs that correspond to combinations of S and L values can actually be available. That is, all IVRs in the range 0 to maximum IVR must represent actually generable combinations of S and L values.
The FlG. 15 shows the RIVs related to generable combinations of S and L values under the condition that Nrb is 40 (N<sub>rb</sub> = 40), G is 2 (G = 2) and L<sup>Limit</sup>is 14 (| _<sup>Limit</sup>= 14) according to the second embodiment.
Because 0 <RIV <118 <2<sup>7</sup>, the number of required bits Nb¡t_requer¡do_i¡m is 7. In this case, it can be recognized that the bits to represent generable combinations of S and L values are not spent because the RIVs included in the part colored in gray that have L values in the interval of 2 <L <6 are used in generable combinations of S and L values under the condition 10 <L <14. Thus, compared with the FlG method. 14, the signaling oversize is reduced by one bit when signaling the same RB assignment combinations as the FlG. 14.
ES 2 586 624 T3
The following equation 4 is used to obtain the IVRs using combinations of S and L values under the condition that Nrb, G and [_<sup>Limit</sup> are given in the method of FIG. 15. In this case, the number of bits required can also be calculated by the equations included in Equation 4. If a maximum length of the RBs is limited, [_<sup>Limit</sup> is indicated by [_<sup>Limit</sup> = g- | / Q | If a maximum allowable amount of RB is given, [_<sup>Limit</sup> is indicated by [_<sup>Limit</sup> _ q | _ £ ^ max_ allowed / J
Equation 4 <T = G, Optimized for i_ limitation<sup>Limit</sup> >
Step: T = G RB
Granularity: G RB
Optimized for limiting
<img file="ES2586624T3_D0002.tif" />
yes L / G <Pí<sup>L,</sup>™<sup>tea</sup>/ G / 2 ^ then
RIV = (2 IG J- Γ'7 G +1) (IG -1) + S / G otherwise
RIV = (2 [_N<sub>KS</sub> / Gj- £<sup>L</sup>'™ 7G + l) (£<sup>L, ra</sup>7G-L / G +1) - (1 + S7 G) end
Bits required if £<sup>L,</sup>™<sup>tea</sup>/ G / 2 <^<sup>L,</sup>™ 7G / 2l then
RIV ™ = (2 · | Λ7<sub>Λ</sub> / Gj- £<sup>Lta</sup>7G + l) (¿<sup>w</sup>'™ “! G - i) + \ _ (N <sub>R</sub> -) / gJ otherwise
RIV<sub>m</sub>, = (2 Lx „/ GJ- G + / G) -1 end where / G / 2 ~ |
Assuming the number of available RBs actually is Nvrb, due to the granularity constraint, so many RBs
<img file="ES2586624T3_D0003.tif" />
as a remainder made when Nvrb is divided by G, that is, N<sub>RB</sub>° = / GjG RB remaining, cannot be assigned. In order to assign such remaining RBs, Nrb can be set to N<sub>RB</sub> = / G [G. However, under this condition N<sub>RB</sub> =<img file="ES2586624T3_D0004.tif" />, if the remaining RBs are contained and allocated, the L value can include the number of imaginary RBs, that is, 7 \ ^ "<sup>α</sup>^”<sup>απο</sup> - N<sub>n <</sub>As a result, if the remaining RBs are contained and allocated, the length of the actually allocated RBs is indicated by L -.
Embodiment 3
<img file="ES2586624T3_D0005.tif" />
ES 2 586 624 T3
According to a third embodiment, a method of constructing an optimal table of RIVs will be described in detail hereinafter, under the condition that S is limited to a multiple of T (where T is a positive integer) and L is limited to a multiple of G (where G is a positive integer).
In the first embodiment mentioned above, it is assumed that the position of a starting point of the assigned RBs and the length of the RBs are each limited to a multiple of G (where G is a positive integer). However, in the third embodiment, the starting point is limited to one of multiples of a first positive integer and the length is limited to one of multiples of a second positive integer that is independent of the first positive integer, respectively. That is, S is limited to a multiple of T and L is limited to a multiple of G.
FIG. 16 shows the IVRs related to generable combinations of S and L values under the condition that Nrb is 20 (Nrb = 20), S is a multiple of T (= 4) and L is a multiple of G (= 2) according to the third embodiment.
FIG. 17 shows the IVRs related to generable combinations of S and L values under the condition that Nrb is 20 (Nrb = 20), S is a multiple of T (= 2) and L is a multiple of G (= 4) according to the third embodiment.
In FIGS. 16 and 17, the parts colored in gray correspond to combinations of S and L values that cannot be generated under Nrb = 20.
If T = 2 and G = 4, the IVRs are in the range of 0 <IVR <26 <2<sup>5</sup>, so that 5 bits are needed to represent these IVRs, as indicated by Nb¡t_requered = 5. In this case, if [_<sup>Limit</sup> is set to 8 ([_<sup>Limit</sup> = 8), IVRs are in the range of 0 <IVR <15 <2<sup>4</sup>, so 4 bits are needed to represent these IVRs, as indicated by Nb¡t_requerido_lim ~ 4.
If T = 4 and G = 2, the IVRs are in the range of 0 <IVR <29 <2<sup>5</sup>, so that 5 bits are needed to represent these IVRs, as indicated by Nb¡t_requendo = 5. In this case, if [_<sup>Limit</sup> is set to 8 ([_<sup>Limit</sup> = 8), IVRs are in the range of 0 <IVR <18 <2<sup>5</sup>, so 5 bits are needed to represent these IVRs, as indicated by Nb¡t_requerido_lim ~ 5.
The following equation 5 is done to calculate the RIVs using combinations of S and L values under the condition that Nrb, T and G are given. In this case, the number of required bits can be calculated in different ways according to L<sup>Limit</sup>. Under this condition, T or G is assumed to be an integer multiple of min (T, G). If the maximum length of the RBs is limited, [_<sup>Limit</sup> indicated by L<sup>Limit</sup> = G- | £<sup>max</sup>-<sup>re</sup>i<sup>uendo</sup> / Q | g<sub>e a</sub> maximum allowable amount of RB, L<sup>Limit</sup>indicated by E ™<sup>tea</sup> = G- ^<sup>max</sup>- / G_ |.
Equation 5 <T and G are independent>
Step: T RB
Granularity: G RB si (L / GI) <| _JV<sub>RS</sub>/ G / 2 + mod (jV<sub>/ M</sub>/ 'GJ-l, 77G) / 2j then = -G + 1) / 7 ^ (L IG-V) + S / T otherwise
RIV = [íV,<sub>{S</sub> - G +1) / rl / GJ - L / G +1 + mod ^ / V ^ / gJ- 1.77 G) J <sub>+</sub> (f (7V<sub>Rfl</sub>-G + l) / rl -is / n end
Required bits
ES 2 586 624 T3 = r * og<sub>2</sub>(^<sub>ma</sub>x + ol if (L<sup>1</sup>^ / G - 1) </ 2 / G + mod ([/ V<sub>CT</sub> / gJ- 1, T / G) / 2j then
<td></td><td>= | (N „- G +1) / T 1</td><td>more</td><td>/ Gl) + S ™ '™ / T</td>
<td>else</td><td></td><td></td><td></td>
<td></td><td>= f (Aí „-G + i) / r]</td><td></td><td></td>
<td>end</td><td></td><td></td><td></td>
<td>where, $<sup>ltí</sup>Yr<sub>M</sub> _</td><td>L (W<sub>sa</sub> -L<sup>K, r</sup>-) / Ty</td><td></td><td></td>
No limitation = G · [round / 2 / G + m or 4 ^ / 0.) - 1,770) / 2) +1] and<sup>-</sup>Lfrnfte __ j m3x_required I j-, max-allowed f
Without limitation í LJ
L ™ '™ = min (G- [round ^ / 2 / G + mod ([^ / G_ | -l, 77G) / 2) +1]
Assuming that the number of available RBs really is Nvrb, some RBs that have large indexes may not be allocated due to the granularity constraint. In order to assign such remaining RBs, Nrb can be set to = Γ / Vf / RB I rr \ ax (T, G ^ max (T, G). However, under this condition, if the remaining RBs are assigned, the value L can include the number of imaginary RBs, that is, J \ pff £<sup>hand</sup> = S +. As a result, if the remaining RBs are allocated, the length of the actually allocated RBs is indicated by L - Nfff ™ "™ = Ny ^ —S.
Embodiment 4
According to a fourth embodiment, an optimization method will be described in detail hereinafter, under the condition that S starts from P and then increases by a multiple of G and L starts from K and then increases by multiples of G.
In the first embodiment, it is assumed that the position of a starting point of the assigned RBs and the length of the RBs each is limited to a multiple of G (where G is a positive integer). In other words, the first embodiment assumes that the starting point S of the RBs starts from 0 and then increases by G and the length L of the RBs starts from 1 and then increases by G.
The fourth embodiment below refers to a method to construct the IVRs under the condition that the starting point S of the RB starts from a displacement P and then increases by G and the length L of the RB starts from another displacement K and then increases in G. That is, this fourth embodiment refers to a method to construct the IVR under Se {P, P + G, P + 2G, P + 3G, ...} and Le {K, K + G, K + 2G, K + 3G, ...}.
FIG. 18 shows the RIVs related to generable combinations of S and L values when Nrb = 20, G = 2, P = 1 and K = 4 according to the fourth embodiment. The gray colored part of FIG. 18 corresponds to combinations of S and L values that cannot be really generated when Nrb = 20. IVRs are in the range of 0 <IVR <35 <2<sup>6</sup>, so 6 bits are needed to represent these RIVs.
If the range of available L values is limited by setting [_<sup>Limit</sup>, the number of bits required can be reduced. With reference to FIG. 18, if [_<sup>Limit</sup> is set to 8 ([_<sup>Limit</sup> = 8), it can be recognized that a maximum IVR among the IVRs is 21. In this case, because combinations that have L values in the range of 10 <L <18 cannot be used, the range of the IVRs can be be 0 <RIV <21 <2<sup>5</sup>, so 5 bits are needed to represent these IVRs, as indicated by 'Nb¡t_requer¡do_i¡m = 5'.
ES 2 586 624 T3
The following equation 6 is made to calculate the IVRs using combinations of S and L values under the condition that Nrb, T and G are given. Under this condition, it is assumed that T or G is an integer multiple of min (T, G ). If the length of the RBs is limited, L<sup>bmite</sup>is indicated by [_<sup>Limit</sup> = g- | - K.) / G | + K. If a maximum allowable amount of RB is given, L<sup>Limit</sup>indicated by E ™<sup>tea</sup> = G- | _L<sup>max</sup>~^<sup>Itldo</sup>K / GJ + K.
Equation 6 <T = G starting from displacement P and K, respectively>
Step: T = G RB starting from P
Granularity: G RB starting from K if (ί-ί) / σ <| [(Ύ<sub>ω</sub> -P - ^) / G + lJ / 2j then
RIV = [(N<sub>liJ}</sub> - P - K) / G +] \ - (L - K) IG + (S - P) / G otherwise
RIV = -PK) / G + 1J · (L (rV<sub>ra</sub> ~ P ~ K) IG + 1J- (? - K) / G)
G + 1J-1 - (S-?) / G) end
Required bits bit_requerúiü ftog<sub>2</sub>(R / r „+1) 1
Without limitation
R / P »= ί <<sup>λ</sup>™ - P - R) / G + ij · (|. (Λ1,<sub>! β</sub> - P - KVG + 1J + 1) / 2 -1
No limitation + ko ai) / gJ + k
<img file="ES2586624T3_D0006.tif" />
<img file="ES2586624T3_D0007.tif" />
P - K) / G + 1J · (E '<sup>ra, faith</sup>- K) / G + [(Ν<sub>άβ</sub> - L<sup>Limits</sup>- P) / - P ~ K) / G + 1J. - PK)! G + 1J + 1) / 2 -1
On the other hand, the parameters of equations that construct Equation 1 above are substituted for others in Equation 6, so Equation 6 has an advantage in that it can use the existing equation without any changes. In more detail, Equation 1 showing the method for deciding the starting point and length on a basis of an RB can correspond to Equation 3 under the condition that X = Nrb, Y = L and Z = S. Equation 6 shows the method to control the starting point of the RBs to start from P and then increase in units of G and control the length of the RBs to start from K and then increase in units of G. This Equation 6 may correspond with Equation 3 under the condition that X = L (N<sub>k</sub>|, —P-K) / G], Y-1 = (LK) / GyZ = (SP) / G.
This relationship can also be represented by the following expression.
Expression
Starting Point and Length decision method in units of a RB
ES 2 586 624 T3 <sup>x</sup> = Y - LZ = S s¡ yi <| x / 2j
RIV = Ύ (Κ-1) + Ζ otherwise
RIV = X (X - Y + 1) + (X -1 - Z)
End
Control method of the RB Start Point to start from P and then increase in units of G and control the Length of the RB to start from K and then increase in units of G
X = -Ρ-Κ) / β \, Y- \ = (LK) / G, Z = (S ~ P) ÍG s¡ r-ι <[y / 2j
RIV = X (Y -1) + Z otherwise
RIV = X (XY + l) + (Xl ~ Z) end
Assuming that the number of available RBs really is Nvrb, due to the granularity constraint, you cannot assign as many RBs as a remainder made when Nvrb is divided by G, that is, N<sub>RB</sub>° = [(Ny ^ -KP) ¡G J'G + K + P - N<sub>v¡ <¡;</sub> RB remaining.
In order to assign such remaining RBs, Nrb can be set to N<sub>RB</sub> = (Ny ^ - K —P) l G [G + K + P. However, under this condition, if the remaining RBs are assigned, the value L can include the number of imaginary RBs, that is, N<sup>1</sup>^<sup>1</sup><sup>0</sup><sup>0</sup> = [(Ny<sub>RB</sub>-K-P ') / G ~ \ G + K + P-Ny<sub>RB</sub>. As a result, if the remaining RBs are allocated, the length of the actually allocated RBs is indicated by L -] \ ρ ™ ® £<sup>ιηαηο</sup>
Embodiment 5
According to a fifth embodiment, an optimization method will be described in detail hereinafter, under the condition that S starts from P and then increases by a multiple of T and L starts from K and then increases by a multiple of G.
As can be seen from the fourth embodiment, it is assumed that the position of a starting point of the assigned RBs and a length of the RBs each is limited to a multiple of G (where G is a positive integer), the The position of each starting point is limited to starting from P and the length is limited to starting from K.
The fifth embodiment refers to a method for constructing the IVRs, under the condition that the starting point 'S' of the RB starts from a displacement P and increases by T and the length 'L' of the RB starts from another displacement. K and increase in G. That is, the fifth embodiment describes a method to construct the RIVs under Se {P, P + T, P + 2T, P + 3T, ...} and Le {K, K + G, K + 2G, K + 3G, ...}.
FIG. 19 shows the RIVs related to generable combinations of S and L values when Nrb = 30, T = 4, G = 2, P = 1 and K = 4 according to the fifth embodiment. The gray colored part of FIG. 19 corresponds to combinations of S and L values incapable of being actually generated when Nrb = 30. IVRs are in the range of 0 <IVR <48 <2<sup>6</sup>, so 6 bits are needed to represent these RIVs.
If the range of available L values is limited by setting [_<sup>Limit</sup>, the number of bits required can be reduced. With reference to FIG. 19, if L<sup>bmite</sup>is set to 10 (| _<sup>Limit</sup>= 10), it can be recognized that a maximum IVR among the IVRs is 25. In this case, because combinations that have L values in the range of 12 <L <28 cannot be used, the range of the IVRs can be be 0 <RIV <21 <2<sup>5</sup>, so 5 bits are needed to represent these IVRs as indicated by 'Nb¡t_requer¡do_i¡m = 5' bits.
ES 2 586 624 T3
The following equation 7 is made to calculate the IVRs using combinations of S and L values under the condition that Nrb, T, G, P and K are given. In this case, the number of bits required to express the IVR can be calculated in different ways according to [_<sup>Limit</sup> With reference to Equation 7, | _<sup>max</sup>-<sup>rec</sup>i<sup>uerldo</sup> It can represent the number of RBs actually available. At this point, if there are remaining RBs due to the granularity constraint, the number of remaining RBs is subtracted from the number of actually available RBs and the resulting value of the subtraction can be represented by | _<sup>max</sup>-P<sup>ermitld0</sup> £ In this case, in order to allow the available RBs to actually be all assigned, L<sup>bmite</sup> is fixed to L<sup>Lirr</sup>”<sup>tea</sup> = g | (Z<sup>max</sup>-<sup>requesting</sup> - ^) / Q | + k. In order to prevent the remaining RBs among the available RBs from actually being allocated, L<sup>bmite</sup>is set to [_<sup>Limit</sup> = q- | _ / J<sup>iix</sup> P<sup>allowed</sup> - / ζ / (¡\ + k.
Equation 7 <T and G are independent starting from displacement values P and K, respectively>
Step: T RB starting from P
Granularity: G RB starting from K if (? -K) / G <lT (7y<sub>/; / í</sub> -PK + + P- + 1) / g] -1, T / G) / 2J then
RIV = [(Ν<sub>κβ</sub>-Ρ-Κ + ϊ) / τ] (L -K) / G + (SP) / T otherwise! faith ~<sup>p</sup>~ Λ '+ Ι) / G] - (¿- / C) / G + mod (f (y<sub>s / j</sub> - PK + l) / <s | -1, T / G) j + (Γ (Λ ^ -P- ^ <sub>+</sub> l) / r1 -l- (5-P) / G) end
Required bits if -Á?) / G <| [(Ar<sub>HS</sub>- ^ - ^ + 1) / 01/2 + mod (P (JV ^ -P- / C + l) / G '| -l, T / G) / 2j then = Γ (^ - PK + i) / r ~ | -K) / G + L (/ v<sub>/ IB</sub> -P) / t \ otherwise w »» = Í (A ^ - P - K + i) / rl - K) / G -1
Where,
Without limitation
L ™ '™ <sub>= G</sub> . round - p - K +1) / g] / 2 + mod (f (/ V<sub>fij! J</sub> No limitation L<sup>Limile</sup><sub>= rnjn</sub> ig 'round - P - K +1) / g} 2 + mod ([(/ V<sub>M</sub>
2 ^ Limit ^ Limit __ Q <sub>t</sub> | [ζ Q ^ Limit _ q, jjnax_pem «tido
P ~ K + \) / g] - \, 7GG) / 2) + K
-.PK + l) / Gl-l, T / G) / 2) + K,
ES 2 586 624 T3
In this case, because the above RBs are continuously assigned RBs, i_<sup>Limit</sup>, L<sup>max-requendo</sup> and L<sup>max</sup>-<sup>allowed</sup> can be represented as and, respectively.
Assuming that the number of available RBs is actually set to Nvrb, some RBs that have large indexes may not be allocated due to the granularity constraint. In order to assign such remaining RBs, Nrb can be set to N<sub>RB</sub> = [(N ^ —K - P) / max (T, G) "| 'max (T, G) + K + P. However, under this condition, if the remaining RBs are contained and allocated, the value L can include the number of imaginary RBs, that is, N<sup>masmano</sup> = s + l - n ^. As a result, if the remaining RBs are contained and allocated, the length of the actually allocated RBs is indicated by L - N<sup>l</sup>RB<sup>sman</sup>° = N ^ - S.
The exemplary embodiments described above are combinations of elements and features of the present invention. Items or traits can be considered selective unless mentioned otherwise. Each element or trait can be put into practice without being combined with other elements or traits. Furthermore, embodiments of the present invention can be constructed by combining parts of the elements and / or features. The operating orders described in the embodiments of the present invention can be reordered. Some constructions of any embodiment can be included in another embodiment and can be substituted with corresponding constructions of another embodiment.
Embodiments of the present invention can be achieved by various means, eg, hardware, firmware, software, or a combination thereof. In a hardware configuration, embodiments 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 arrangements (FPGA), processors, controllers, micro controllers, microprocessors, etc.
In a firmware or software configuration, embodiments of the present invention can be achieved by a module, a method, a function, etc., that performs the functions or operations described above. A software code can be stored in a memory unit and powered by a processor. The memory unit is located inside or outside the processor and can transmit data to and receive data from the processor through various known means.
Industrial applicability
The present invention is applicable to a transmitter and a receiver used in a broadband wireless mobile communication system.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the scope of the invention. Thus, the present invention is intended to cover modifications and variations of this invention provided they are within the scope of the appended claims.
Contents13
24 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22 Sheet 23 Sheet 24
46 members in 11 offices
Priority claims6
| Document | Office | Kind | Date |
|---|---|---|---|
| 74131P | United States of America | – | |
| 7413108 | United States of America | P | |
| 75010P | United States of America | – | |
| 7501008 | United States of America | P | |
| 20080136669 | Republic of Korea | A | |
| 20080136669 | Republic of Korea | – |
Members46
| Document | Office | Kind | |
|---|---|---|---|
| KR100921467B1 | Republic of Korea | B1 | |
| AU2009261058A1 | Australia | A1 | |
| EP2136503A2 | European Patent Office (EPO) | A2 | |
| WO2009154341A1 | World Intellectual Property Organization (WIPO) | A1 | |
| US2009316814A1 | United States of America | A1 | |
| TW201002114A | Taiwan Province of China | A | |
| MX2010011250A | Mexico | A | |
| US7885221B2 | United States of America | B2 | |
| CN102057735A | China | A | |
| JP2011519208A | Japan | A | |
| US2011164582A1 | United States of America | A1 | |
| US2011170501A1 | United States of America | A1 | |
| RU2450491C1 | Russian Federation | C1 | |
| AU2009261058B2 | Australia | B2 | |
| US8374119B2 | United States of America | B2 | |
| TWI391016B | Taiwan Province of China | B | |
| US2013128844A1 | United States of America | A1 | |
| US8509142B2 | United States of America | B2 | |
| US8532043B2 | United States of America | B2 | |
| JP5331196B2 | Japan | B2 | |
| CN102057735B | China | B | |
| US2013329674A1 | United States of America | A1 | |
| CN103516503A | China | A | |
| JP2014007748A | Japan | A | |
| EP2136503A3 | European Patent Office (EPO) | A3 | |
| US8958385B2 | United States of America | B2 | |
| JP5678143B2 | Japan | B2 | |
| JP2015073329A | Japan | A | |
| US2015208395A1 | United States of America | A1 | |
| EP2136503B1 | European Patent Office (EPO) | B1 | |
| US9161355B2 | United States of America | B2 | |
| EP2942898A1 | European Patent Office (EPO) | A1 | |
| ES2553585T3 | Spain | T3 | |
| US2016007329A1 | United States of America | A1 | |
| EP2942898B1 | European Patent Office (EPO) | B1 | |
| CN103516503B | China | B | |
| EP3079297A1 | European Patent Office (EPO) | A1 | |
| ES2586624T3This record | Spain | T3 | |
| JP6018649B2 | Japan | B2 | |
| JP2017005758A | Japan | A | |
| US9629147B2 | United States of America | B2 | |
| US2017201971A1 | United States of America | A1 | |
| JP6229029B2 | Japan | B2 | |
| US9900885B2 | United States of America | B2 | |
| EP3079297B1 | European Patent Office (EPO) | B1 | |
| ES2814124T3 | Spain | T3 |
Numbers
- Publication
- 2586624
- Application
- 15174145
Titles2
- Spanish
- Método y aparato para señalización de asignación de recursos para ajustar granularidad en un sistema multiportador celular
- English
- Method and apparatus for resource allocation signaling to adjust granularity in a cellular multi-carrier system
Classification
- CPC, 15
- H04L5/0007
- H04W72/23
- H04W72/04
- H04L5/0039
- H04L5/0094
- H04J11/00
- H04W28/16
- H04W72/53
- H04L5/0092
- H04W72/12
- H04W72/0446
- H04B7/0665
- H04W16/10
- H04W36/0066
- H04W48/12
- IPC, 2
- H04L5 00
- H04W72 04