ES2688382T3 - Method for programming distributed virtual resource blocks - Google Patents

Abstract

A method of transmitting downlink data using resource blocks distributively mapped virtual resource blocks, VRB, consecutively allocated with physical resource blocks, PRB, at a base station in a wireless mobile communication system, the method that comprises: transmitting downlink data correlated with the PRBs to a user equipment, where the indices of the VRBs, which are interleaved by a block interleaver, are correlated with indices of the PRBs for each of a first interval and a second interval of a subframe with a predetermined space (1105, 1203) for its distribution, characterized in that: the VRB indices are written row by row in the block interleaver and are read column by column from the block interleaver, in where the PRB indices, which are equal to or greater than Nthreshold, for the first interval and the second interval of the subframe are shifted by one c amount of Ncompensation, where Ncompensation denotes a compensation value and Nthreshold denotes a threshold value of the PRB indices to which the compensation value applies, where a number, C, of columns of the block interleaver is equal to 4 , and a number, R, of rows of the interleaver of blocks is given as: where NDVRB is a number of resource blocks used for the VRBs, MRBG is a number of the PRBs that constitute the group of resource blocks, RBG, Ninterleaver is a size of the block interleaver, where, when NDVRB is less than Ninterleaver, the nulls are uniformly inserted into the last Nnull / 2 rows of the 2nd and 4th columns of the block interleaver, where Nnull is equal to a number of nulls , where, when the VRB indexes are read from the block interleaver, nulls are ignored, where NDVRB is determined as (NPRB - Nspace) 2 where Nspace denotes a value of the predetermined space that is a multiple of a MRBG square, and NPRB denotes a number of PRBs in a system bandwidth, when Nespace is greater than or equal to NPRB / 2, and where Ncompensation is determined as Nespace - Nthreshold, and Nthreshold is equal to NDVRB / 2.

Description

5

10

fifteen

twenty

25

30

35

40

Four. Five

DESCRIPTION

Method for programming distributed virtual resource blocks Technical field

The present invention relates to a wireless broadband mobile communication system, and more particularly, to programming radio resources for uplink / downlink packet data transmission in a cellular OfdM wireless packet communication system.

Prior art

In a cellular orthogonal frequency division multiplex (OFDM) wireless packet communication system, the transmission of uplink / downlink data packets is performed on a subframe basis and a subframe is defined by a certain time interval that includes a plurality of OFDM symbols.

The Third Generation Cooperation Project (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 intervals. The structure of a type 2 radio frame is shown in FIG. 2. The type 2 radio frame includes two half frames, each consisting of five subframes, a downlink pilot time interval (DwPTS), a space period (GP) and a time interval. uplink pilot (UpPTS), in which a subframe consists of two intervals. That is, a subframe is composed of two intervals regardless of the type of radio frame.

A signal transmitted in each interval can be described by a resource grid that includes N ^ Nr subcarriers and NDmb OFDM symbols. Here, N ^ represents the number of resource blocks (RB) in a

downlink, NR represents the number of subcarriers that constitute an RB, and NDb 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 correspondence relationship between certain physical channels and resource elements. RBs can be classified into physical resource blocks (PRB) and virtual resource blocks (VRB), which means that an RB can be either one of a PRB or a VRB. A correspondence relationship between the VRBs and the pRb can be described on a subframe basis. In more detail, it can be described in units of each of the intervals that constitute a subframe. Also, the correspondence relationship between the VRBs and the PRBs can be described using a correspondence relationship between VRB indices and PRB indices. A detailed description of this will also be given in the embodiments of the present invention.

A PRB is defined by NDb consecutive OFDM symbols in a time domain and NR consecutive subcarriers in a frequency domain. A PRB is therefore composed of NDb NR resource elements. PRBs are assigned numbers from 0 to N ^ -1 in the frequency domain.

A VRB can be the same size as the PRB. There are two types of VRB defined, the first being a localized type and the second being a distributed type. For each type of VRB, a pair of VRBs have a single index of VRB in common (hereinafter, it can be known as' number of VRB ') and are assigned over two intervals of one

subframe In other words, N ^ VRB that belong to the first of two intervals that constitute a subframe are assigned to each any index of 0 to N ^ -1, and N ^ VRB that belong to the second of the two intervals are assigned to each in the same way any index from 0 to N ^ -1.

The index of a VRB corresponding to a specific virtual frequency band of the first interval has the same value as the index of a VRB corresponding to the specific virtual frequency band of the second interval. That is, assuming that a VRB corresponding to a virtual frequency band of order i of the first interval is denoted by VRB1 (i), a VRB corresponding to a virtual frequency band of order j of the second interval is denoted by VRB2 (j) and the index numbers of VRB1 (i) and VRB2 (j) are denoted by index (VRB1 (i)) and index (VRB2 (j)), respectively, an index relationship is established (VRB1 (k)) = index (VRB2 (k)) (see Fig. 4a).

Similarly, the index of a PRB corresponding to a specific frequency band of the first interval has the same value as the index of a PRB corresponding to the specific frequency band of the second interval. That is, assuming that a PRB corresponding to a frequency band of order i of the first

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

interval is denoted by PRB1 (i), a PRB corresponding to a frequency band of order j of the second interval is denoted by PRB2 (j) and the index numbers of PRB1 (i) and PRB2 (j) are denoted by index ( PRB1 (i)) and index (PRB2 (j)), respectively, establish an index relationship (PRB1 (k)) = index (PRB2 (k)) (see FIG. 4b).

Some of the plurality of VRB mentioned above are assigned as of the localized type and the others are assigned as of the distributed type. Hereinafter, the VRBs assigned as the localized type will be known as 'localized virtual resource blocks (LVRB)' and the VRBs assigned as the distributed type will be known as 'distributed virtual resource blocks (DVRB)'.

The 3GPP draft No. R1-080377, entitled "DVRB mapping", describes a mapping scheme for distributed VRBs using a block interleaver.

The draft of 3GPP No. R1-073615, entitled “Distributed channel mapping”, deals with the D-VRB to PRB correspondence schemes.

Document US 2004/178934 A1 describes bit interleaving schemes for OFDM systems, in which the coded bits of a multi-band OFDM ultra-wideband system are interleaved within each OFDM symbol and through OFDM symbols.

The draft 3GPP No. R1-074735, entitled "Comparison of proposals for downlink resource allocation approach 2", deals with proposals for allocating downlink resources in which downlink LVRBs are allocated over subsets of PRB.

The draft 3GPP No. R1-074749, entitled "Comparison of interleavers for PDCCH", deals with interleavers for correspondence of the control channel element (CCE) with the resource element (RE) for the PDCCH channel.

The draft of 3GPP No. R1-074226, entitled "Generic interleaver for PDCCH", deals with a common cell part of an interleaver for correspondence of a control channel element (CCE) with a resource element (RE).

The document "Downlink Resource Allocation Mapping for E-UTRA", R1-073372 of 3GPP, August 20-29, 2007, describes a bitmap approach of definable resource blocks for allocation of downlink resources on E-systems UTRA

The 3GPP draft No. R1-073392, entitled "E-UTRA DL Distributed Multiplexing and Mapping Rules: Performance", addresses various aspects of DVRB distributed transmissions and presents performance results.

The 3GPP draft No. R1-074722, entitled "DL Distributed Resource Signaling for EUTRA", deals with resource signaling methods for distributed transmission using the "small payload size PDCCH format" in EUTRA networks.

The localized VRBs (LVRB) correlate directly with the PRBs and the LVRB indices correspond to the PRB indices. Also, the LVRBs of index i correspond to PRBs of index i. That is, an LVRB1 that has the index i corresponds to a PRB 1 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, the VRBs of FIG. 5 are all assigned as LVRB.

Distributed VRBs (DVRBs) cannot be directly correlated with PRBs. That is, DVRB indices can be correlated with PRBs after being subjected to a series of processes.

First, the order of a sequence of consecutive indices of the DVRBs can be interleaved by a block interleaver. Examples and embodiments of the prior art can be found in US 2005/135493 A1.

Here, the sequence of consecutive indices means that the index number is sequentially increased by one starting with 0. A sequence of indices emitted from the interleaver is sequentially correlated with a sequence of consecutive indices of PRB1 (see FIG. 6). The VRBs of FIG. 6 are all assigned as DVRB. On the other hand, the sequence of indices emitted from the interleaver is cyclically shifted by a predetermined number and the cyclically shifted index sequence is sequentially correlated with a sequence of consecutive indices of PRB2 (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 DVRBs can be sequentially correlated with the sequence of consecutive indices of the PRB1 without passing through the interleaver. Also, the sequence of consecutive indices of the DVRBs can be cyclically shifted in the predetermined number without passing through the interleaver and the cyclically shifted index sequence can be sequentially correlated with the sequence of consecutive indices of the PRB2.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

According to the aforementioned processes of correspondence of DVRB with PRB, a PRB1 (i) and a PRB2 (i) that have the same index i can be correlated with a DVRB1 (m) and a DVRB2 (n) that has different myn indexes. For example, with reference to FIG. 6 and 7, a PRB1 (1) and a PRB2 (1) are correlated with a DVRB1 (6) and a DVRB2 (9) that have different rates. A frequency diversity effect can be obtained based on the DVRB correspondence scheme.

In the case where the VRBs (1), among the VRBs, are assigned as DVRBs as in FIG. 8, if the methods of FIG. 6 and 7, LVRBs cannot be assigned to a PRB2 (6) and a PRB1 (9) even if the VRBs have not yet been assigned to PRB2 (6) and PRB1 (9). The reason is as follows: according to the aforementioned LVRB correspondence scheme, that LVRB correlates with PRB2 (6) and PRB1 (9) means that LVRB also correlates with PRB1 (6) and PRB2 ( 9); however, PRB1 (6) and PRB2 (9) have already been correlated by the VRB1 (1) and VRB2 (1) mentioned above. In this regard, it will be understood that LVRB correspondence may be restricted by the results of DVRB correspondence. Therefore, there is a need to determine DVRB correspondence rules in consideration of LVRB correspondence.

In a wireless broadband mobile communication system that uses multi-carrier radio resources, each terminal can be assigned with an LVRB and / or DVRB scheme. The information that indicates which scheme is used can be transmitted in a bitmap format. At this time, the allocation of radio resources to each terminal can be carried out in units of an RB. In this case, resources can be allocated with a granularity of '1' RB, but a large amount of bit overhead is required to transmit the allocation information with the bitmap format. Alternatively, a group of RB (RBG) consisting of PRB of consecutive k indices (for example, k = 3) can be defined and resources can be assigned with a granularity of '1' RBG. In this case, the allocation of RB is not done sophisticatedly, but there is an advantage that bit overload is reduced.

In this case, the LVRB can be correlated with the PRBs on an RBG basis. For example, PRBs that have three consecutive indices, a PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1) and PRB2 (i + 2), they can constitute an RBG and the LVRB can be correlated with this RBG in units of an RBG. However, in the case where one or more of the PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1) and PRB2 (i + 2) are previously correlated by DVRBs, this RBG cannot be correlated by LVRBs on an RBG basis. That is, the DVRB correspondence rules may restrict the RBG unit LVRB correspondence.

As mentioned above, because DVRB correspondence rules may affect LVRB correspondence, there is a need to determine DVRB correspondence rules in consideration of LVRB correspondence.

Description

Technical problem

An object of the present invention designed to solve the problem is in a method of resource programming to efficiently combine the programming of an FSS scheme and the programming of an SDS scheme.

Technical solution

This document provides a method for transmitting downlink data using resource blocks with distributive correspondence of virtual resource blocks allocated consecutively with physical resource blocks at a base station in a wireless mobile communication system, as defined in the Claim 1. A method is also provided for receiving a downlink data packet in a wireless mobile communication system according to claim 2. The embodiments of such methods are further defined in claims 3-8. In other aspects, a base station according to claim 9 is provided, and a user equipment according to claim 12 is provided.

The object of the present invention can be achieved by providing, in a wireless mobile communication system that supports a resource allocation scheme in which a group of resource blocks (RBG) that includes consecutive physical resource blocks is indicated by a bit , a method of correspondence of resource blocks for distributive correspondence of virtual resource blocks assigned consecutively with the physical resource blocks, the method that includes: interleaving, using a block interleaver, indices of the virtual resource blocks determined to from a resource indication value (RIV) that indicates a starting index number of the virtual resource blocks and a length of the virtual resource blocks; and sequentially correlating the interleaved indices with indices of the physical resource blocks in a first interval of a subframe, the subframe that includes the first interval and a second interval, and sequentially correlating indices obtained by cyclically displacing the intercalated indices by a space for distribution to the indices of the physical resource blocks in the second interval, where the space is a multiple of a square of the number (MRBG) of the consecutive physical resource blocks that constitute the RBG.

When a grade of the block interleaver is defined as the number (C = 4) of columns of the block interleaver, the number (R) of rows of the block interleaver can be given as in the expression (1) and the number (Null) ) of nulls filled in the block interleaver can be given as in expression (2).

Expression (1)

5

R ~ ^ ntercaladDr! C - f (C ‘M RRCj)] 'M RBG

^ ,, „r = TNdvrb / (C-Mrbg) \ C-Mrbg

where Mrbg is the number of consecutive physical resource blocks that constitute the RBG, and Ndvrb is the number of virtual resource blocks allocated distributively.

Expression (2)

image 1

- N, ltl.carrier NDVRB - iNdvrb / (C ■ M RBG) "| • C • M RBG

-N

DVRB

10 where Mrbg is the number of consecutive physical resource blocks that constitute the RBG, and Ndvrb is the number of virtual resource blocks allocated distributively.

A degree of the block interleaver can be equal to an order of diversity (NOrdenDiv) determined by the distribution.

When an index d of one of the blocks of virtual resources assigned in a distributive manner is given, an index Pi, d of the corresponding one of the blocks of physical resources in the first interval correlated with the index d as in the expression ( 3) and an index P2, d of the corresponding of the physical resource blocks in the second interval correlated with the index d can be given as in the expression (4). Here, R is the number of rows of the block interleaver, C is the number of columns of the block interleaver, Ndvrb is the number of resource blocks used for the virtual resource blocks allocated distributively, Null is the number of nulls filled in the block interleaver, and mod means a module operation

Expression (3)

25

Pu = ■

Pu

, when N - 0 or (d <N

DVRB ^ null

—N, i 2, when N ^ ¿0

¿N m null null

(d <N

- N

1 * null DVRB

mod (rf, C) <2) mod (d, C)> 2)

where

p'tJ = mod (¿, C) • R + [d / cj

image2

where = mod (d, C 12) -2R + \ _2d I C \

Expression (4)

P2.1i ~ iTiodfpj ^ + Ndvrb / 2, NDVRB)

Here, C can be equal to the degree of the block interleaver.

The index P-i, d can be p-i, d + Nprb - Ndvrb when it is greater than Ndvrb / 2, and the index P2, d can be p2, d + Nprb ■

Ndvrb when it is greater than Ndvrb / 2. Here, Nprb is the number of physical resource blocks in the system.

When the number (Ndvrb) of the virtual resource blocks is not a multiple of the grade of the block interleaver, the interleaving step may include dividing the interleaver into groups of the number (Nd) of physical resource blocks with which a block virtual resources and distribute nulls evenly to divided groups.

The groups may correspond to rows of the block interleaver, respectively, when one degree of the block interleaver is the number of the rows of the block interleaver, and to the columns of the block interleaver, respectively, when the degree of the block interleaver is the number of the columns of the block interleaver.

In another aspect of the present invention, it is provided herein in a wireless mobile communication system that supports a resource allocation scheme in which a resource block group (RBG) that includes consecutive physical resource blocks a method of correspondence of resource blocks for distributive correspondence of virtual resource blocks assigned consecutively with the physical resource blocks is indicated by a bit, the method that includes: interleaving, using a 10-block interleaver, indexes of the virtual resource blocks determined from a resource indication value (RIV) that indicates a starting index number of the virtual resource blocks and a length of the virtual resource blocks; and correspondence sequentially of the indices interspersed with the indices of the physical resource blocks in a first interval of a subframe, the subframe that includes the first interval and a second interval, and sequential correspondence of the indices obtained by cyclically displacing the 15 indexes interspersed in a space for distribution with the indices of the physical resource blocks in the second interval, where the interval (Nespace) for distribution is given as in expression (5).

Expression (5)

N = rounding (N PRB / (2 ■ M RBG ‘)) • MRBG '

UafJavrU

where Mrbg is the number of consecutive physical resource blocks that constitute the RBG, and Nprb is the number 20 of physical resource blocks in the system.

When nulls are allowed to be entered into the block interleaver, the number (Ndvrb) of the virtual resource blocks allocated distributively can be given as in expression (6).

Expression (6)

^ dvkb = min (Af PRB - Nespacl¡¡, ■ 2

25 When an index d of one of the blocks of virtual resources allocated in a distributive manner is given, an index Pi, d of the corresponding one of the blocks of physical resources in the first interval correlated with the index d can be pi, d + Nprb - Ndvrb when it is greater than Ndvrb / 2, and an index P2, d of the corresponding of the physical resource blocks in the second interval correlated with the index d can be p2, d + Nprb - Ndvrb when it is greater than Ndvrb / 2, in where Ndvrb is the number of resource blocks used for virtual resource blocks allocated distributively.

In another aspect of the present invention, it is provided herein, in a wireless mobile communication system that supports a resource allocation scheme in which a resource block group (RBG) that includes consecutive physical resource blocks is indicates by one bit, a method of resource block correspondence for distributive correspondence of virtual resource blocks assigned consecutively with the physical resource blocks, the method that includes: detecting a resource indication value (RIV) indicating a start index number of the virtual resource blocks and a length of the virtual resource blocks and determine the indexes of the virtual resource blocks from the detected resource indication value; and collate the determined indices of the virtual resource blocks using a block interleaver and distributing the virtual resource blocks distributively with the 40 physical resource blocks, where a degree of the block interleaver is equal to an order of diversity ( NOrdenDiv) determined by the distribution.

In another aspect of the present invention, the present memory is provided, in a wireless mobile communication system that supports a resource allocation scheme in which a resource block group (RBG) that includes consecutive physical resource blocks is indicated with a bit, a method of correspondence of resource blocks 45 to distributively map the virtual resource blocks assigned consecutively with the physical resource blocks, the method that includes: determining the indices of the virtual resource blocks from a resource indication value (RIV) that indicates a starting index number of the virtual resource blocks and a length of the virtual resource blocks; and collate the determined indices of the virtual resource blocks using a block interleaver and distributing the blocks of 50 virtual resources with the physical resource blocks, where, when the number (Ndvrb) of the virtual resource blocks does not is a multiple of one degree of the block interleaver, the correspondence step includes dividing the interleaver into groups of the number (Nd) of blocks of physical resources with which a block of virtual resources is correlated and uniformly distributing nulls to the groups divided.

The groups may correspond to rows of the block interleaver, respectively, when a degree of the block interleaver is the number of the rows of the block interleaver, and columns of the interleaver of

10

fifteen

blocks, respectively, when the degree of the block interleaver is the number of the columns of the block interleaver.

The control information may be a DCI transmitted through a PDCCH.

The space can be a function of the system bandwidth.

When an index p of one of the physical resource blocks is given, an interleaved index dp1 correlated with the index p can be given as in expression (7) or expression (8), and a cyclically shifted index dp2 correlated with the p index can be given as in the expression (9) or in the expression (10). Here, R is the number of rows of the block interleaver, C is the number of columns of the block interleaver, Ndvrb is the number of resource blocks used for the virtual resource blocks allocated distributively, and mod means an operation of module.

Expression (7)

dPi = mod (//, R) • C + \ _ p'I / íj

where

p =

'p + l, when mod (7Vowa, C) ^ 0 and p> 2R- \

2R - 1, when mod (¿VÜVM, C) * 0 and p = 3R - 2

p, when mod (A, C) -0 or p <2R- \

Expression (8)

d = moá (p \ R) C + [_pl R \

where

'p +1, when modC / VDm¡íC) * 0 and 2 /? - 1, when modCJV ^ jf ^ C) 7 * ^ 0 and

p, when mod (JVDraB, C) ~ 0 or p <2R- \

Expression (9)

dp2 = mod {p ', R) C + lp' / R]

p * 3R-2

p> 2R- \ and p * 3R-2 p = 3R-2

where

P =

p * + \, when mod (N ÜVR¡), C) 0 and p "> 2R ~ l

2R- \, when I modified ^^ C) ^ 0 and p "= 3R ~ 2

pm, when I modified ^^, C) = 0 or p "'<2R ~ l

p ”* 3R-2

where p ”= modíj? + NDVRB / 2, NDVRB) Expression (10)

d —2 ’when niodíí / ^, C)> 2

"Pi

d + 2> when mod (í / R, C) <2

V -2

JV DVRB

dvrb ~ ^> when mod ^, C) <2

, when mod (¿/ ,,, C) <2

d ^ N - 2

P, DVRR

dp¡ ~ ^ DVRB ~ ^ dPy ~ ^ DVRB ~ ^

dp, * NDVRB -1

The order of diversity (NOrdenDiv) can be a multiple of the number (Nd) of physical resource blocks with which a virtual resource block is correlated.

The space can be 0 when the number of virtual resource blocks is greater than or equal to a predetermined threshold value (Mth).

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

The resource block correspondence method may also include reception information about the space, the space being determined by the information of the space received.

In another aspect of the present invention, a wireless mobile communication system that supports a RBG resource allocation scheme and a subset resource allocation scheme, a resource block matching method for providing Distributive correspondence of virtual resource blocks assigned consecutively with physical resource blocks, the method that includes: receiving control information that includes resource block allocation information indicating the distributed allocation of virtual resource blocks, and indexes of virtual resource blocks; and collate the indices of the virtual resource blocks using a block interleaver, where the interleaving step includes, until the indices of the virtual resource blocks are correlated with all the physical resource block indices belonging to any of a plurality of subsets of RBG, preventing the indexes of the virtual resource blocks from being correlated with indexes of physical resource blocks belonging to a different one of the RBG subsets.

The resource block correspondence method may further include sequential correspondence of the interleaved indices with the indices of the physical resource blocks in a first interval of a subframe, the subframe that includes the first interval and a second interval, and the correspondence indexes sequentially obtained by cyclically moving the interleaved indices in a space for distribution to the indices of the physical resource blocks in the second interval, where the space for distribution is determined so that the correlated virtual resource blocks in the first interval and the correlated virtual resource blocks in the second interval are included in the same subset.

The number (Ndvrb) of the virtual resource blocks can be a multiple of an order of diversity (NOrdenDiv) determined by the distribution.

The number (Ndvrb) of the virtual resource blocks may be a multiple of the Mrbg number of the consecutive physical resource blocks that constitute the RBG.

The number (Ndvrb) of the virtual resource blocks can be a multiple of a value obtained by multiplying the Mrbg number of the consecutive physical resource blocks that constitute the RBG by the number (Nd) of physical resource blocks with which it is correlated A block of virtual resources.

The number (Ndvrb) of the virtual resource blocks can be a multiple of a value obtained by multiplying the square (Mrbg2) of the number of consecutive physical resource blocks that make up the RBG by the number (Nd) of physical resource blocks with which correlates a block of virtual resources.

The number Ndvrb of the virtual resource blocks can be a common multiple of a value obtained by multiplying the number (Mrbg) of the consecutive physical resource blocks that constitute the RBG by the number (ND) of physical resource blocks with which correlates a block of virtual resources and a grade (D) of the block interleaver.

The degree (D) of the block interleaver may be a multiple of the number (Nd) of physical resource blocks with which a virtual resource block is correlated.

The number Ndvrb of the virtual resource blocks can be a common multiple of a value obtained by multiplying a square (Mrbg2) of the number of consecutive physical resource blocks that constitute the RBG by the number (Nd) of physical resource blocks with the that correlates a block of virtual resources and a degree (D) of the block interleaver.

The degree (D) of the block interleaver may be a multiple of the number (Nd) of physical resource blocks with which a virtual resource block is correlated.

The number Ndvrb of the virtual resource blocks can be a common multiple of a value obtained by multiplying a degree (D) of the block interleaver by a square (Mrbg2) of the number of consecutive physical resource blocks that constitute the RBG and a value obtained multiplying the number (Nd) of physical resource blocks with which a virtual resource block is correlated by the square (Mrbg2) of the number of consecutive physical resource blocks that constitute the RBG.

The degree (D) of the block interleaver may be a multiple of the number (Nd) of physical resource blocks with which a virtual resource block is correlated.

The various aspects of the present invention mentioned above are all applicable to a base station and / or a mobile station. In the case where the aforementioned aspects of the present invention are applied to the mobile station, the resource block correspondence method may further include receiving the resource indication value (RIV) from the mobile station of the mobile communication system wireless, before the interleaving step or the step of determining the indices of the virtual resource blocks.

5

10

fifteen

twenty

25

30

35

40

Four. Five

Advantageous effects

According to the present invention, it is possible to efficiently combine the programming of an FSS scheme and the programming of an SDS scheme and simply implement a method of transferring programming information.

Description of 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.

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 that constitutes a 3GPP transmission interval.

FIG. 4a is a view that shows an example of the structure of the VRBs in a subframe.

FIG. 4b is a view that shows an example of the structure of PRBs in a subframe.

FIG. 5 is a view illustrating an example of a method for correspondence of the LVRB with the PRB.

FIG. 6 is a view illustrating an example of a method for correspondence of DVRBs in a first interval with PRBs.

FIG. 7 is a view illustrating an example of a method for correspondence of DVRBs in a second interval with PRBs.

FIG. 8 is a view illustrating an example of a method for correspondence of DVRBs with PRBs.

FIG. 9 is a view illustrating an example of a method for correspondence of DVRBs and LVRBs with PRBs.

FIG. 10 is a view illustrating an example of a method for allocating resource blocks by a compact scheme.

FIG. 11 is a view illustrating an example of a method for correspondence of two DVRBs having consecutive indices with a plurality of contiguous PRBs.

FIG. 12 is a view illustrating an example of a method for correspondence of two DVRBs having consecutive indices with a plurality of separate PRBs.

FIG. 13 is a view illustrating an example of a method for correspondence of four DVRBs having consecutive indices with a plurality of separate PRBs.

FIG. 14 is a view illustrating an example of a resource block matching method in the case where Space = 0, according to an embodiment of the present invention.

FIG. 15 is a view illustrating a bitmap configuration.

FIG. 16 is a view illustrating an example of a method for correspondence based on a combination of a bitmap scheme and a compact scheme.

FIG. 17 and 18 are views illustrating a DVRB correspondence method according to an embodiment of the present invention.

FIG. 19 is a view illustrating an example of a method for interleaving DVRB indices.

FIG. 20a and 20b are views illustrating an operation of a general interleaver when the number of resource blocks used in an interleaving operation is not a multiple of an order of diversity.

FIG. 21a and 21b are views illustrating a method for inserting nulls when the number of resource blocks used in an interleaving operation is not a multiple of an order of diversity, according to an embodiment of the present invention.

FIG. 22 is a view illustrating a method for correspondence of DVRB indices interspersed with Space = 0 according to an embodiment of the present invention.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

FIG. 23 is a view illustrating an example of a method for correspondence of DVRB indices, using different spaces for different terminals.

FIG. 24 is a view to explain the relationship between DVRB and PRB indices.

FIG. 25a is a view to explain the relationship between DVRB and PRB indices.

FIG. 25b is a view illustrating a general method for inserting nulls into an interleaver.

FIG. 25c and 25d are views illustrating examples of a method for inserting nulls into an interleaver in an embodiment of the present invention, respectively.

FIG. 26 and 27 are views illustrating examples of a method that uses a combination of the bitmap scheme using the RBG scheme and the subset scheme and the compact scheme, respectively.

FIG. 28 is a view illustrating the case in which the DVRB number is set to a multiple of the number of physical resource blocks (PRB), with which a virtual resource block (VRB), Nd and the number of consecutive physical resource blocks that constitute an RBG, Mrbg, according to an embodiment of the present invention.

FIG. 29 is a view illustrating the case in which the DVRB indices are interleaved according to the method of FIG. 28.

FIG. 30 is a view illustrating an example where the correspondence is made under the condition in which the degree of a block interleaver is established in the number of columns of the block interleaver, that is, C, and C is established in a order of diversity, according to an embodiment of the present invention.

FIG. 31 is a view illustrating an example of a correspondence method according to an embodiment of the present invention when the PRB number and the DVRB number are different from each other.

FIG. 32 and 33 are views illustrating examples of a correspondence method capable of increasing the number of DVRB, using a given space, according to an embodiment of the present invention.

Invention 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 be given below with reference to the accompanying drawings, is intended to explain the exemplary embodiments of the present invention, rather than showing the only embodiments that can be implemented according to the 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 those skilled in the art that the present invention can be practiced without such specific details. For example, the following description will be given focusing around specific terms, but the present invention is not limited thereto and any other term can be used to represent the same meanings. Also, whenever possible, the same reference numbers will be used in all drawings to refer to the same or similar parts.

In the case where a subframe consists of a first interval and a second interval, an index (PRB1 (i)) represents an index of a PRB of a frequency band of order i of the first interval, an index (PRB2 (j)) represents an index of a PRB of a frequency band of order j of the second interval, and an index relationship (PRB1 (k)) = index (PRB2 (k)) is established, as indicated above. Also, an index (VRB1 (i)) represents an index of a VRB of a virtual frequency band of order i of the first interval, an index (VRB2 (j)) represents an index of a VRB of a virtual frequency band of j order of the second interval, and an index relationship is established (VRB1 (k)) = index (VRB2 (k)). At this time, VRB1 correlates with PRB1, and VRB2 correlates with PRB2. Also, VRBs are classified into DVRB and LVRB.

The rules for correspondence of LVRB1 with PRB1 and the rules for correspondence of LVRB2 with PRB2 are the same. However, the rules for correspondence of DVRB1 with PRB1 and the rules for correspondence of DVRB2 with PRB2 are different. That is, DVRBs are 'divided' and correlated with PRBs.

In 3GPP, an RB is defined in units of an interval. However, in the detailed description of the invention, an RB is defined in units of a subframe, and this RB is divided into Nd subRB in a time axis, so that the DVRB correspondence rules are generalized and described. For example, in the case where Nd = 2, a PRB defined in units of a subframe is divided into a first subPRB and a second subPRB, and a VRB defined in units of a subframe is divided into a first subVRB and a second subVRB.

In this case, the first subPRB corresponds to the aforementioned PRB 1, and the second subPRB corresponds to the aforementioned PRB2. Also, the first subVRB corresponds to the aforementioned VRB1, and the second subVRB corresponds to the aforementioned VRB2. Also, both in the detailed description of the invention and

5

10

fifteen

twenty

25

30

35

40

Four. Five

In the 3GPP, the DVRB correspondence rules are described to obtain a frequency effect based on a subframe. Therefore, it will be understood that all embodiments of the detailed description of the invention are concepts that include an RB correspondence method in the 3GPP.

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 is mapped or a modulated symbol of a control channel. Provided that a signal is transmitted in an OFDM symbol on M subcarriers and that N OFDM symbols are transmitted in a subframe, MxN RE are present in a subframe.

A 'physical resource block (PRB)' represents a unit frequency-time resource for data transmission. In general, a PRB consists of a plurality of consecutive REs in a frequency-time domain, and a plurality of PRB is defined in a subframe.

A 'virtual resource block (VRB)' represents a virtual unit resource for data transmission. In general, the number of RE included in a VRB is equal to that of RE included in a PRB, and, when data is transmitted, a VRB can be correlated with a PRB or with some areas of a plurality of PRB.

A 'localized virtual resources block (LVRB)' is a type of VRB. An LVRB correlates with a PRB. A PRB correlated with an LVRB is different from a PRB correlated with another LVRB.

A 'distributed virtual resources block (DVRB)' is another type of VRB. A DVRB correlates with a plurality of PRB in a distributed manner.

'Nd' = 'Nd' represents the number of PRBs with which a DVRB correlates. FIG. 9 illustrates an example of a method for correspondence of DVRBs and LVRBs with PRBs. In FIG. 9, Nd = 3. An arbitrary DVRB can be divided into three parts and the divided parts can be correlated with different PRBs, respectively. At this time, the remaining part of each PRB, not correlated by the arbitrary DVRB, is correlated by a divided part of a different DVRB.

Nprb 'represents the PRB number in a system. In the case where the system band is divided, Nprb can be the PRB number in the divided part.

Nlvrb 'represents the number of the 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.

NordenDiv 'represents an order of diversity required in the system. Here, the order of diversity is defined by the number of Rb that are not adjacent to each other.

Here, the "RB number" means the number of RB divided into a frequency axis. That is, even in the case where the RBs can be divided into time intervals that constitute a subframe, the "RB number" means the number of RBs divided on the frequency axis of the same interval.

FIG. 9 shows an example of definitions of LVRB and DVRB.

As you can see in FIG. 9, each RE of an LVRB is correlated one by one with each RE of a PRB. For example, an LVRB correlates with a PRB0 (901). On the contrary, a DVRB is divided into three parts and the divided parts are correlated with different PRBs, respectively. For example, a DVRB0 is divided into three parts and the divided parts are correlated with a PRB1, PRB4 and PRB6, respectively. Similarly, a DVRB1 and a DVRB2 are each divided into three parts and the divided parts are correlated with 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 to this. For example, each DVRB can be divided into two parts.

A downlink data transmission from a base station to a specific terminal or uplink data transmission 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 which of the VRBs is used for data transmission. Also, in order to allow the specific terminal to transmit data, the base station has to notify the terminal which of the VRBs is allowed to be used for data transmission.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

Data transmission schemes can be broadly classified into a frequency diversity programming scheme (FDS) and a frequency selective programming scheme (FSS). The FDS scheme is a scheme that obtains a gain in reception through frequency diversity, and the FSS scheme is a scheme that obtains a gain in reception through selective frequency programming.

In the SDS scheme, a transmission stage transmits a packet of data on the subcarriers widely distributed in a frequency domain of the system so that the symbols in the data packet may undergo different radio channel fades. Therefore, an improvement in reception performance is obtained by preventing the entire data packet from being subject 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 fade state. In a cellular wireless RFID packet communication system, a plurality of terminals is present in a cell. At this time, because the radio channel conditions of the respective terminals have different characteristics, it is necessary to perform a data transmission of the SDS scheme with respect to a certain terminal and a data transmission of the FSS scheme with respect to a different terminal even within a subframe. 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 favorable band for a UE among all available bands. On the contrary, in the SDS scheme, an evaluation is not made as to whether a specific band is good or bad, and, as long as a frequency separation capable of adequately obtaining a diversity is maintained, there is no need to select and Transmit a specific frequency band. Therefore, it is advantageous for an improvement in the performance of the entire system to perform frequency selective programming of the FSS scheme preferably when programmed.

In the FSS scheme, because the data is transmitted using consecutively adjacent subcarriers in the frequency domain, it is preferable that the data is transmitted using the LVRB. At this time, provided that Nprb PRB are present in a subframe and that a maximum of Nlvrb LVRB is 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 data will be transmitted or which of the LVRBs through which uplink data can be transmitted. That is, each bit of the Nlvrb bitmap information bit, which is transmitted to each terminal as programming information, indicates whether the data will be transmitted or can be transmitted through an LVRB corresponding to this bit, between the Nlvrb LVRB This scheme is disadvantageous in that when the number Nlvrb becomes greater, the number of bits to be transmitted to each terminal becomes greater in proportion to it.

On the other hand, provided that only one set of contiguous RBs can be assigned to a terminal, the information of the assigned RBs can be expressed by a starting point of the RBs and their number. This scheme is known as 'compact scheme' in this document.

FIG. 10 illustrates an example of a method for allocating resource blocks through the compact scheme.

In this case, as shown in FIG. 10, the length of the available RBs is different depending on the respective starting points, and the number of RB allocation combinations is Nlvrb (Nlvrb + 1) / 2 at the end. Therefore, the number of bits required for the combinations is ceiling (log2 (NLVRB (NLVRB + 1) / 2)). Here, ceiling (x) means to round "x" to a closer whole number. This method is advantageous over the bitmap scheme in which the number of bits does not increase so significantly with the increase in the number Nlvrb.

On the other hand, for a method of notifying a user equipment (UE) of DVRB allocation, it is necessary to pre-prescribe the positions of the respective divided parts of the DVRBs distributed distributively for a diversity gain. Alternatively, additional information may be required to directly notify the positions. Preferably, provided that the number of bits for signaling the DVRBs is set to be equal to the number of bits in the LVRB transmission of the compact scheme indicated above, it is possible to simplify a signaling bit format on a downlink. As a result, there are advantages that the same channel coding can be used, etc.

Here, in the case where a plurality of DVRBs are assigned to a UE, this UE is notified of a DVRB index of a starting point of the DVRBs, a length (= the number of the DVRBs assigned), and a difference of relative position between the divided parts of each DVRB (for example, a space between the divided parts).

FIG. 11 illustrates an example of a method for correspondence of two DVRBs having consecutive indices with a plurality of contiguous PRBs.

As shown in FIG. 11, in the case where a plurality of DVRBs having consecutive indices correlate with a plurality of contiguous PRBs, the first divided parts 1101 and 1102 and the second divided parts 1103 and 1104 are parts separated from each other by a space 1105, while the divided parts

that belong 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. 12 illustrates an example of a method for correlating two DVRBs that have consecutive indices with a plurality of separate PRBs. In this application, 'separate PRBs' means that the PRBs are not adjacent to each other.

5 In the method of FIG. 12, when DVRBs are allowed to correspond to PRBs, consecutive DVRB indices, which do not correspond to adjacent PRBs, can be distributed. For example, a DVRB index '0' and a DVRB index '1' are not arranged adjacent to each other. In other words, in FIG. 12, 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 shown in FIG. 11, for example, in a block interleaver. In this case, it is possible to obtain a distribution within each of the divided parts 1201 and 1202, as well as a distribution through a space 1203. Therefore, when two DVRBs are assigned to a UE as shown in FIG. 12, the order of diversity increases to 4, resulting in an advantage that the diversity gain can be obtained even more.

At this time, the value of the space indicative of the relative position difference between the divided parts can be expressed in two ways. First, the space value can be expressed by a difference between DVRB indices. Second, the space value can be expressed by a difference between the PRB indices with which a DVRB correlates. In the case of FIG. 12, Space = 1 in the first form, while Space = 3 in the second form. FIG. 12 shows the latter case 1203. Meanwhile, if the total number of RB of the system is changed, the DVRB index arrangement can be changed accordingly. In this case, the use of the second form has the advantage of capturing a physical distance between the divided parts.

FIG. 13 illustrates the case where four DVRBs are assigned to a UE under the same rules as those in FIG. 12.

As can be seen from FIG. 13, the order of diversity increases to 7. However, as the order of diversity increases, the diversity gain converges. The results of existing studies indicate that the increase in diversity gain is insignificant when the order of diversity is around 4 or more. 25 The uncorrelated parts of the PRB 1301, 1302, 1303, 1304 and 1305 can be assigned and correlated for another UE that uses the DVRBs, however, the uncorrelated parts cannot be assigned and correlated for another UE that uses the LVRB . Therefore, when there are no other UEs using the DVRBs, there is a disadvantage that the uncorrelated parts of the PRBs 1301, 1302, 1303, 1304 and 1305 cannot be left empty, unused. In addition, the distributed provision of DVRBs breaks the continuity of available PRBs, resulting in a restriction in the allocation of consecutive LVRBs.

As a result, there is a need for a method to limit the order of diversity to a correct level to carry out the distributed allocation.

A first embodiment and a second embodiment of the present invention are directed to methods for establishing a relative distance between divided parts of a DVRB correlated with the PRB at 0. In these embodiments, 35 in a scheme for correspondence of consecutive DVRB indices with PRB separated, when a plurality of DVRBs are assigned to a UE, the respective divided parts of each of the DVRBs can be allocated distributively to different PRBs, thereby raising the order of diversity. Alternatively, under the same conditions, the respective divided parts of each DVRB can be assigned to the same PRB, not distributively assigned to different PRBs. In this case, it is possible to reduce the number of PRBs to which DVRBs are allocated distributively, thereby limiting the order of diversity.

<Accomplishment 1>

This embodiment is directed to a method for switching split parts to a distributed / non-distributed mode by setting a reference value for the number of DVRBs assigned to a UE. Here, the 'distributed mode' refers to a mode where the space between the divided DVRB parts is not 0, and the 'undistributed mode' refers to a mode where the space between the divided DVRB parts is 0.

Assume that the number of DVRBs assigned to a UE is M. When M is smaller than a specific reference value (= Mth), the divided parts of each DVRB are allocated distributively, thereby raising the order of diversity.

On the contrary, when M is greater than or equal to the reference value (= Mth), the divided parts are assigned to the same PRB 50, they are not allocated distributively. This allocation of the parts divided to the same PRB can reduce the number of PRBs with which the DVRBs are distributionally correlated, thus limiting the order of diversity.

That is, in the case where M is greater than or equal to the reference value Mth, a space, which is a relative distance between the divided parts of each DVRB correlated with the PRBs, is set to 0.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

For example, if the number of DVRB is 2 under the condition that Mth = 3, the divided parts of each DVRB can be correlated distributively as shown in FIG. 12. On the contrary, if the number of DVRB is 4 under the condition that Mth = 3, a space is set to 0 so that the divided parts of each DVRB can be correlated with the same PRB.

FIG. 14 illustrates an example of a resource block matching method in the case where Space = 0, according to embodiment 1.

<Completion 2>

This embodiment is directed to a method for switching the divided parts to a distributed / non-distributed mode using a control signal. Here, the 'distributed mode' refers to a mode where the space between the divided DVRB parts is not 0, and the 'undistributed mode' refers to a mode where the space between the divided DVRB parts is 0.

Embodiment 2 is a modified version of Embodiment 1. In Embodiment 2, Mth is not established, and, as necessary, a control signal is transmitted and received to switch the divided parts to distributed / non-distributed mode. In response to the transmitted and received control signal, split DVRB parts can be distributed to raise the order of diversity or be correlated with the same PRB to decrease the order of diversity.

For example, the control signal can be defined to indicate the value of a space, which is a relative distance between the divided parts of each DVRB correlated with the PRBs. That is, the control signal can be defined to indicate the value of the space itself.

For example, in the case where the control signal indicates that Space = 3, the divided DVRB parts are mapped distributively as shown in FIG. 12 or 13. Also, in the case where the control signal indicates that Space = 0, the divided DVRB parts are correlated with the same PRB shown in FIG. 14.

As indicated above, in order to freely program the PRB Nprb number in the system on a PRB basis, it is necessary to transmit a Nprb bitmap to each UE to be programmed. When the Nprb number of the PRBs in the system is large, the control information overhead for the Nprb bit bitmap transmission is increased. Therefore, a method can be considered to scale down a programming unit or divide the entire band and then perform the transmission in different programming units only in some bands.

In the 3GPP LTE, a bitmap configuration scheme has been proposed in consideration of the overhead when the bitmap is transmitted as indicated above.

FIG. 15 illustrates a bitmap configuration.

A signal for resource allocation consists of a header 1501 and a bitmap 1502. The header 1501 indicates the structure of the bitmap 1502 that is transmitted, that is, a bitmap scheme, indicating a signaling scheme.

The bitmap scheme is classified into two types, an RBG scheme and a subset scheme.

In the RBG scheme, the RBs are grouped into a plurality of groups. RBs are correlated in units of a group. That is, a plurality of RBs that constitute a group have correspondence association. When the group size is larger, it is difficult to carefully allocate resources, but it is possible to reduce the number of bits in a bitmap. With reference to FIG. 15, because Nprb = 32, a bitmap of a total of 32 bits is required for a resource allocation of an RB unit. However, provided that three RBs are grouped (P = 3) and that resources are allocated on a RB group basis (RBG), all RBs can be divided into a total of eleven groups. As a result, only an 11-bit bitmap is required, thereby significantly reducing the amount of control information. On the contrary, in the case where resources are allocated on this basis of RBG, they cannot be allocated in units of an RB, so that they cannot be allocated thoroughly.

In order to compensate for it, the subset scheme is used. In this scheme, a plurality of RBG is established as a subset, and resources are allocated on a RB basis within each subset. In order to use the 11-bit bitmap in the RBG scheme expressed above of FIG. 15, it is possible to configure '3' subsets (subset 1, subset 2 and subset 3). Here, '3' is the number of RBs that constitute each RBG expressed above. As a result, Nrb / P = ceiling (32/3) = 11, so that the RBs in each subset can be assigned on the basis of RB with 11 bits. Here, the information in header 1501 is required to indicate which of the RBG scheme and subset scheme is used for the bitmap and what subset is used if the subset scheme is used.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

Provided that the header information 1501 only indicates which of the RBG scheme and subset scheme is used and some bits of the bitmap used for RBGs are used to indicate the type of subset, not all rBs can be used in all subsets. For example, with reference to FIG. 15, because a total of three subsets are established, a 2-bit subset indicator 1503 is required to identify the subsets. At this time, a total of 12 RBs are assigned to subset 1 1504 or 1505, and only 9 bits are left in the bitmap of a total of 11 bits if 2 bits of the subset indicator 1503 of the bitmap are excepted. It is not possible to individually indicate all of the twelve RBs with 9 bits. In order to solve this, a bit of the RBG bitmap can be assigned as offset indicator 1506, so that it can be used to shift the position of an RB indicated by the bitmap of the subset. For example, in the case where the subset indicator 1503 indicates subset 1 and the offset indicator 1506 indicates 'offset 0', the remaining 8 bits of the bitmap are used to indicate RB0, RB1, RB2, RB9, RB10, RB11, RB 18 and RB19 (see 1504). On the other hand, in the case where the subset indicator 1503 indicates subset 1 and the offset indicator 1506 indicates 'offset 1', the remaining 8 bits of the bitmap are used to indicate RB10, RB11, RB18, RB19, RB20 , RB27, rB28 and RB29 (see 1505).

Although the subset indicator 1503 has been described in the previous example to indicate subset 1 1504 or 1505, it may indicate subset 2 or subset 3. Therefore, it can be seen that eight RBs can be correlated in units of a RB with with respect to each combination of the subset indicator 1503 and the displacement indicator 1506. Also, with reference to FIG. 15, in the present embodiment, the RB numbers assigned to subset 1, subset 2 and subset 3 are 12, 11 and 9, which are different, respectively. Therefore, it can be seen that four RBs cannot be used in the case of subset 1, three RBs cannot be used in the case of subset 2 and one RB cannot be used in the case of subset 3 (see the shaded areas ). FIG. 15 is nothing more than an illustration, and the present embodiment is thus not limited thereto.

You can consider using a combination of the bitmap scheme using the RBG scheme and the subset scheme and the compact scheme.

FIG. 16 illustrates an example of a method for correspondence based on a combination of the bitmap scheme and the compact scheme.

In the case where DVRBs are correlated and transmitted as shown in FIG. 16, some resource elements of an RBG0, RBG1, RBG2 and RBG4 are filled in by the DVRB. RBG0, among them, is included in a subset 1, RBG1 and RBG4 are included in a subset 2, and RBG2 is included in a subset 3. At this time, it is impossible to assign RBG0, RBG1, RBG2 and RBG4 to the UEs in the RBG scheme. Also, the RB (PRB0, PRB4, PRB8 and PRB 12) in the remaining RBGs after being assigned as the DVRBs must be assigned to the UEs in the subset scheme. However, because only one RB in a subset can be assigned to a UE assigned in the subset scheme, the remaining RBs belonging to other subsets cannot help to be assigned to different UEs. As a result, LVRB programming is restricted by DVRB programming.

Therefore, there is a need for a DVRB setup method capable of reducing the restriction in LVRB programming.

The third to fifth embodiments of the present invention are directed to methods for establishing a relative distance between the divided parts of a DVRB correlated with the PRBs to reduce the effect on the LVRB.

<Accomplishment 3>

Embodiment 3 is directed to a method for correlating divided parts of DVRB, correlating the divided parts with the RBs belonging to a specific subset and then correlating the divided parts with the RBs belonging to other subsets after correlating the parts. divided with all the RB of the specific subset.

According to this embodiment, when consecutive DVRB indices are correlated with distributed PRBs, they can be mapped distributively within a subset and then correlated with other subsets when they can no longer be correlated within a subset. Also, interleaving of consecutive DVRBs is performed within a subset.

FIG. 17 and 18 illustrate a DVRB correspondence method according to an embodiment of the present invention.

DVRB0 to DVRB11 are mapped distributively within a subset 1 (1703), DVRB12 to DVRB22 are mapped distributively within a subset 2 (1704), and DVRB23 to DVRB31 are then mapped distributively within a subset 3 ( 1705). This assignment can be carried out by a method of using a block interleaver for each subset or any other method.

This arrangement can be achieved by controlling a block interleaver operation scheme.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

<Completion 4>

Embodiment 4 is directed to a method for limiting the correspondence of divided DVRB parts with the PRBs included in the same subset.

In embodiment 4, the space information can be used to correlate the divided parts of the same DVRB within the same subset. At this time, a parameter can be used for all PRBs, such as the 'Space' mentioned above. Alternatively, another parameter can be used for a subset, 'Spacesubset'. This will be described in detail hereafter.

It is possible to use together a method for distributive filling of consecutive DVRBs within a subset and a method for correspondence of the divided parts of each DVRB within the same subset. In this case, preferably, Spaces subset, which means a difference between the PRB numbers within the same subset, can be used as information indicative of a relative position difference between the divided DVRB parts. The meaning of Spacesubset can be understood from FIG. 17. The PRBs included in subset 1 are PRB0, PRB1, PRB2, PRB9, pRB10, PRB11, PRB18, PRB19, PRB20, PRB27, PRB28 and PRB29. Here, the PRB18 is separated from the PRB0 within subset 1 by 6 indexes (Spaces subset = 6). On the other hand, with respect to all PRBs, it can be indicated that PRB18 is separated from PRB0 by 18 indexes (Space = 18).

<Completion 5>

Embodiment 5 is directed to a method for establishing a relative distance between parts of DVRB divided into a multiple of the square of the size of an RBG.

The limited establishment of Space in a multiple of the size of an RBG as in the present embodiment provides features such as the following. That is, when the relative distance between the divided DVRB parts is indicated as a relative position difference within a subset, it is set to a multiple of the size (P) of an RBG. Alternatively, when the relative distance between the divided DVRB parts is indicated as a position difference with respect to all PRBs, it is limited to a multiple of the square (P2) of the size of RBG.

For example, with reference to FIG. 15, it can be seen that P = 3 and P2 = 9. Here, it can be seen that the relative distance between a first divided part 1701 and a second divided part 1702 of a DVRB is a multiple of P (= 3) because Spacesubset = 6, and a multiple of P2 (= 9) because Space = 18.

In the case where a scheme based on this embodiment is used, because the probability that RBGs only some resource elements of each of which are used belong to the same subset is high, it is expected that the resource elements or RB that remain unused are present in the same subset. Therefore, it is possible to use the allocation of the subset scheme efficiently.

With reference to FIG. 17, because the size of a RBG10 is 2, it is different from the sizes (= 3) of other RBGs. In this case, for the convenience of the provision of DVRB indices, RBG 10 cannot be used for DVRBs. Also, with reference to FIG. 17 and 18, a total of four RBGs, which include a RBG9 belong to subset 1, a total of three RBG, if RBG 10 is excluded, belong to subset 2, and a total of three RBGs belong to subset 3. Here, For the convenience of the provision of DVRB indices, RBG9, among the four RBGs that belong to subset 1, cannot be used for DVRBs. In this way, a total of three RBGs per subset can be used for DVRBs.

In this case, the DVRB indices can be sequentially correlated with a subset (for example, subset 1) used for DVRBs, between the subsets, as shown in FIG. 18. If the DVRB indices can no longer be correlated with a subset, they can be correlated with a next subset (for example, subset 2).

On the other hand, it can be seen that the DVRB indices are arranged consecutively in FIG. 11, but not consecutively arranged in FIG. 12, 13, 14, 16, 17 and 18. In this way, the DVRB indices can be changed before being correlated with the PRB indices, and this change can be made by a block interleaver. Hereinafter, the structure of a block interleaver according to the present invention will be described.

<Completion 6>

Hereinafter, a description of a method for configuring an interleaver having a desired degree equal to an order of diversity will be given, according to an embodiment of the present invention.

In detail, in a method for correspondence of consecutive DVRB indices with non-contiguous distributed PRBs, a method is proposed that uses a block interleaver and configures the interleaver so that

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

have a degree equal to an order of objective diversity NordenDiv. The interleaver grade can be defined as follows.

That is, in a block interleaver that has m rows and n columns, when data is written, the data is written while its index is increased sequentially. At this time, the writing is performed in such a way that, after a column is filled in completely, a column index is increased by one and a next column is filled. In each column, writing is performed while increasing a row index. To read from the interleaver, the reading is performed in such a way that, after a row is read completely, a row index is increased by one and a next row is read. In this case, the interleaver can be known as m degree interleaver.

On the contrary, in a block interleaver that has m rows and n columns, data writing can be done in such a way that, after a row is filled, the process goes to a next row, and the data reading is You can perform in such a way that, after a column is read, the process moves to a next column. In this case, the interleaver can be known as a n-degree interleaver.

In detail, NordenDiv is limited to a multiple of Nd. That is, NordenDiv = K Nd. Here, K is a positive integer. Also, a block interleaver of a NordenDiv grade is used.

FIG. 19 is an illustration when the number of RBs used in the interleaving is Ndvrb = 24 and Nd = 2 and NordenDiv = 2x3 = 6.

With reference to FIG. 19, to write in an interleaver, the data is written while its index is increased sequentially. At this time, the writing is performed in such a way that, after a column is completely filled in, a column index is increased by one and a next column is filled. In a column, writing is done while increasing a row index. To read from the interleaver, the reading is performed in such a way that, after a row is read completely, a row index is increased by one and a next row is read. In a row, the reading is performed while increasing a column index. In the case where reading / writing is performed in this way, the interleaver's degree is the number of rows, which is established in an order of objective diversity, 6.

In the case where the interleaver is configured in this way, an order of DVRB indices of a sequence of data emitted from the interleaver can be used as an index order of the first divided parts of the DVRBs, and an order of DVRB indices. of a sequence of data obtained by cyclically displacing the sequence of data emitted by Ndvrb / Nd can be used as an index order of the remaining divided parts. As a result, Nd divided parts generated from the DVRB are correlated only with Nd PRB in pairs, and the difference between matched DVRB indices is K.

For example, in FIG. 19, Ndvrb / Nd = Ndvrb (= 24) / Nd (= 2) = 24/2 = 12, and K = 3. It can also be seen from the FlG. 19 that an order of DVRB 1901 indices of a data stream emitted from the interleaver is given as "0 ^ 6 ^ 12 ^ 18 ^ 1 ^ 7 ^ 13 ^ 19 ^ 2 ^ 8 ^ 14 ^ 20 ^ 3 ^ 9 ^ 15 ^ 21 ^ 4 ^ 10 ^ 16 ^ 22 ^ 5 ^ ■ 11 ^ 17 ^ 23 ”, and an order of DVRB 1902 indices of a sequence of data obtained by cyclically displacing the sequence of data emitted by Ndvrb / Nd = 12 is Give as “3 ^ 9 ^ 15 ^ 21 ^ 4 ^ 10 ^ 16 ^ 22 ^ 5 ^ 11 ^ 17 ^ 23 ^ 0 ^ 6 ^ 12 ^ 18 ^ 1 ^ 7 ^ 13 ^ 19 ^ 2 ^ 8 ^ 14 ^ 20 " Also, the DVRBs are paired. With reference to 1903 of FIG. 19, for example, it can be seen that a DVRB0 and a DVRB3 are paired. It can also be seen that the respective combinations of the divided parts generated from DVRB0 and DVRB3 are assigned to a PRB0 and a PRB12, respectively. This applies similarly to other DVRBs that have other indexes.

According to this embodiment, it is possible to effectively manage the relationship between the DVRBs and the PRBs with which the DVRBs are correlated.

<Completion 7>

Hereinafter, a method for filling nulls in a rectangular interleaver according to an embodiment of the present invention will be described.

In the following description, the number of nulls filled in the interleaver can be represented by "Null".

According to embodiment 6, it is possible to completely fill in the data in the interleaver because Ndvrb is a multiple of NordenDiv. However, when Ndvrb is not a multiple of NordenDiv, it is necessary to consider a method of filling in nulls because it is impossible to completely fill in the data in the interleaver.

For a cyclic shift by Ndvrb / Nd, Ndvrb should be a multiple of Nd. In order to completely fill in the data in a rectangular interleaver, Ndvrb should be a multiple of NordenDiv. However, when K> 1, Ndvrb may not be a multiple of NordenDiv even if it is a multiple of Nd. In this case, generally, the data is filled sequentially in the block interleaver, and then nulls are filled in the remaining spaces of the block interleaver. From then on, a reading is made. If the data is

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

fill in column by column, then the data is read row by row, or if the data is filled in row by row, then the data is read column by column. In this case, no reading is performed for nulls.

FIG. 20a and 20b illustrate a general block interleaver operation when the number of RBs used in an interleaving operation is 22, that is, Ndvrb = 22, Nd = 2, and NOrdenDiv = 2x3 = 6, that is, when Ndvrb is not a multiple of NOrdenDiv.

With reference to FIG. 20a, the difference in indexes between matched DVRBs has a random value. For example, the pairs of DVRB (0, 20), (6, 3) and (12, 9) (indicated by “2001”, “2002” and “2003” have index differences of 20 (20 - 0 = 20 ), 3 (6 - 3 = 3) and 3 (12 - 9 = 3), respectively, therefore, it can be seen that the difference in indexes between the paired DVRBs is not fixed at a certain value. DVRB programming is complicated, compared to the case where the difference in indexes between paired DVRBs has a fixed value.

Meanwhile, when NRestante is assumed to represent a remainder when Ndvrb is divided by NOrdenDiv, nulls are filled in the elements of a last column, except for elements corresponding to NRestante values, as shown in FIG. 20a or 20b. For example, with reference to FIG. 20a, nulls can be filled in two elements of the last column, except for four elements that correspond to four values, because the rest when Ndvrb (= 22) is divided by NOrdenDiv (= 6) is 4 (NRestant = 4) . Although nulls are filled back in the previous example, they can be placed before a first index value. For example, NRstant values are filled in elements, starting from a first element. Also, nulls can be arranged in predetermined positions, respectively.

FIG. 21a and 21b illustrate a method of null arrangement according to an embodiment of the present invention. With reference to FIG. 21a and 21b, it can be seen that the nulls are uniformly distributed, compared to the case of FIG. 20a and 20b.

In this embodiment, when the nulls are to be filled in a rectangular block interleaver, NOrdenDiv corresponding to the degree of the interleaver is divided into Nd groups each having a size of K, and the nulls are evenly distributed in all groups. For example, as shown in FIG. 21a, the interleaver can be divided into Nd (= 2) groups G2101 and G2102. In this case, K = 3. A null is written in the first group G2101. Similarly, a null is written in the second group G2102. In this way, the nulls are written distributively.

For example, when writing is performed in such a way that the values are filled in sequentially, NR this values remain. When the indices corresponding to the remaining values are arranged in Nd groups so that they are distributed uniformly, it is possible to arrange nulls evenly. For example, in the case of FIG. 21a, NRstante (= 4) data spaces remain. When the indexes 18, 19, 20 and 21 corresponding to the data spaces are arranged in ND (= 2) groups so that they are uniformly distributed, it is possible to arrange a null in each group.

As a result, the difference between paired DVRB rates can be maintained to be K or less (for example, K = 3). Therefore, there is an advantage in that a more efficient DVRB allocation can be achieved.

<Completion 8>

Hereinafter, a method for establishing a relative distance between divided parts of each DVRB correlated with the PRBs to 0 according to an embodiment of the present invention will be described.

FIG. 22 illustrates a method for mapping interleaved DVRB indices while Space = 0 according to an embodiment of the present invention.

Meanwhile, where M DVRB is assigned to a UE in a scheme for correspondence of consecutive DVRB indices with non-contiguous distributed PRBs, a reference value Mth can be established for M. Based on the reference value Mth, the divided parts of Each DVRB can be assigned distributively to different PRBs, respectively, to raise the order of diversity. Alternatively, the divided parts of each DVRB can be assigned to the same PRB without being distributed to different PRBs. In this case, it is possible to reduce the number of PRBs, with which the DVRBs are distributively correlated, and thus limit the order of diversity.

That is, this method is a scheme in which the divided parts of each DVRB are distributed to raise the order of diversity, when M is less than a specific reference value (= Mth), while when M is not less than the specific reference value (= Mth), the divided parts of each DVRB are assigned to the same PRB without being distributed, to reduce the number of PRBs, with which the DVRBs are distributionally correlated, and thus limit the order of diversity.

That is, in this scheme, DVRB indices of a data stream emitted from the interleaver are applied, in common, to all the divided parts of each DVRB so that they are correlated with the PRBs, as shown in FIG. 22. For example, with reference to FIG. 9, the DVRB indices of a data stream

5

10

fifteen

twenty

25

30

35

40

Four. Five

issued from the interleaver have an order of “0 ^ 6 ^ -12 ^ 18 ^ 1 ^ 7 ^ 13 ^ 19 ^ 2 ^ 8 ^ 14 ^ -20 ^ 3 ^ 9 ^ 15 ^ 21 ^ 4 ^ 10 ^ 16 ^ - 22 ^ 5 ^ 11 ^ 17 ^ 23 ”. In this case, each index of data sequence DVRB applies, in common, to the first and second divided parts 2201 and 2202 of each DVRB.

<Accomplishment 9>

Hereinafter, a method will be described, in which both embodiments 6 and 8 described above are used, according to an embodiment of the present invention.

FIG. 23 illustrates the case in which a UE1 is multiplexed simultaneously, which is programmed in a correspondence scheme of the respective divided parts of each DVRB with different PRBs, as shown in FIG. 19, and a UE2, which is programmed in a correspondence scheme of the divided parts of each DVRB with the same PRB, as shown in FIG. 22. That is, FIG. 23 illustrates the case in which UE1 and UE2 are programmed simultaneously according to the methods of embodiments 6 and 8, respectively.

For example, with reference to FIG. 23, a DVRB0, DVRB1, DVRB2, DVRB3 and DVRB4 (2301) are assigned to the UE1, while a DVRB6, DVRB7, DVRB8, DVRB9, DVRB10 and DVRB11 (2302) are assigned to the UE2. However, the UE1 is programmed in such a way that the divided parts of each DVRB are correlated with different PRBs, respectively, while the UE2 is programmed in such a way that the divided parts of each DVRB are correlated with the same PRB. Accordingly, the PRBs used for UE1 and UE2 include a PRB0, PRB1, PRB4, PRB5, PRB8, PRB9, PRB12, PRB13, PRB16, PRB17, PRB20 and PRB21, as shown by "2303" in FIG. 23. In this case, however, PRB8 and PRB20 are partially used.

When the divided parts of each DVRB are correlated with distributed PRBs, respectively, the difference between paired DVRB indices is limited to a value of K or less. Therefore, this scheme has no influence on the DVRBs separated from each other by a space of more than K. Therefore, it is possible to easily distinguish usable indices in the “case in which the divided parts of each DVRB correlate with it. PRB ”of unusable indexes.

<Completion 10>

Hereinafter, a method of limiting an Ndvrb will be described, to prevent the generation of a null, according to an embodiment of the present invention.

Again with reference to FIG. 20, it can be seen that the difference between the matched DVRB indices for the PRBs cannot be set to a specific value. In order to reduce the difference in DVRB indices to a specific value or less, the method of FIG. 21 can be used as described above.

When the method of FIG. 21 is used to distribute nulls, the interleaver complexity increases due to null processing. In order to avoid such a phenomenon, a method for limiting Ndvrb can be considered so that no null is generated.

In the illustrated interleaver, the number of RB used for DVRBs, that is, Ndvrb, is limited to a multiple of the order of diversity, that is, NordenDiv so that no nulls are filled in a rectangular matrix of the interleaver.

In a grade D block interleaver, no null is filled in the interleaver's rectangular matrix when the number of RB used for DVRBs, that is, Ndvrb, is limited to a multiple of D.

Hereinafter, various embodiments using the interleaver according to the present invention will be described when K = 2 and Nd = 2. The relationship between the DVRB and PRB indices can be expressed by a mathematical expression.

FIG. 24 is a view to explain the relationship between the DVRB and PRB indices.

With reference to the following description and FIG. 24, the parameters used in mathematical expressions can be understood.

p: PRB index (0 <p <Ndvrb -1)

d: DVRB index (0 <d <Ndvrb -1)

pi, d: Index of a first interval of a PRB with which a given DVRB index d is correlated d p2, d: Index of a second interval of a PRB with which a given DVRB index d correlates dp1: Index of DVRB included in a first interval of a given PRB p index dp2: DVRB index included in a second interval of a given PRB p index

The constants used in Expressions 1 to 11 that express the relationship between the DVRB and PRB indices are defined as follows.

C: Number of columns of block interleaver R: Number of rows of block interleaver 5 Ndvrb: Number of RBs used for DVRBs

R = TNDvrb / C1

Nprb: PRB number in the system bandwidth.

FIG. 25a is a view to explain the constants described above.

When K = 2, Nd = 2 and Ndvrb is a multiple of C, the relationship between the PRB and DVRB indices can be derived 10 using Expressions 1 to 3. First, if a PRB index is given p, a DVRB index can be derived using Expression 1 or 2. In the following description, "mod (x, y)" means "x mod y", and "mod" means a

module operation Also, "| _J" means a descending operation, and represents the largest of the

integers equal to or less than a number indicated in "_ J". On the other hand, "p! ”Means an ascending operation, and represents the smallest of the integers equal to or greater than a number indicated in“ P 1 ”. Also, “round” () ”represents an integer closer to a number indicated in“ () ”. "Min (x, y)"

represents the value that is not larger between x and y, while "max (x, y)" represents the value that is not smaller between x and y.

Expression 1

dpt = mod (p, R) ■ C + _p / RJ 20 dp2 = mod (p ’, R) ■ C + | _p '/ RJ

where p ’= mod (p + Ndvrb / 2, Ndvrb)

Expression 2

dp¡ = mod {p, R) C + \ _p! R \

idp¡ - 2, when mod (í / pi, C)> 2 Pl +2, when mod (¿? pi, C) <2

On the other hand, when Ndvrb is a multiple of C, and an index of DVRB d is given, an index of PRB 25 can be derived using Expression 3.

Expression 3

Pu = mod (d, C) R + [d / C}

Pía = mod (Pu + NDVRB ¡2, Nmm)

FIG. 25b illustrates a general method for filling nulls in an interleaver. This method applies to the case where K = 2, Nd = 2 and Ndvrb is a multiple of Nd. The method of FIG. 25b is similar to the method of FIG. 20a and 20b. 30 According to the method of FIG. 25b, if a PRB p index is given, a DVRB index can be derived using Expression 4.

Expression 4

5

10

image3

On the other hand, if a DVRB index d is given, a PRB index can be derived using Expression 5. Expression 5

Pu = •

mod (you, C) - 3 mod (d, C) -t- 3

Pld "" 1 i when mod (N'RD, C) ^ 0 P \, d, when mod (N'rb, C) "0

where p '{¡= modfí /, C) • R + \ _d fc \

Pi.d = modipoj d + NDVflB / 2, N DVRB)

<Embodiment 11>

FIG. 25c illustrates a method for filling nulls in an interleaver according to an embodiment of the present invention. This method applies to the case where K = 2, Nd = 2 and Ndvrb is a multiple of Nd.

FIG. 25c illustrates a method corresponding to the method of embodiment 7 and FIG. 21a and 21b. The method of FIG. 25c can be explained using Expressions 6 to 8. According to the method of FIG. 25c, if a PRB p index is given, a DVRB index can be derived using Expression 6 or 7.

Expression 6

dp¡ ~ mod (¿í ', R) C + \ _pr¡RJ

p-¡-], when mod (^ 0 and

where =, when I modified ^ jjg.O ^ O and

p

p> 2R ~ \

p = 3R ~ 2

p ± 3R-2

when mod (jVDWS, C) = 0 or p <2R-i

dpi ^ inodfp *, #) - C + [_ /? * //? J

where

P =

pm + \, when niod (N DVRB, C) 0 and p "> 2R - 1

2R ~ 1, when mod (ArDraj!) C) * 0 and pm = 3R-2

p, when mod (NDVItB, C) = 0 or p "<2R- \

p "* 3R-2

where p ~~ niocl (p + NDVRB / 2, N DVRB) Expression 7

d = mod (/? ', R) • C + \ _p í

where

P =

'p + 1, when mod (/ VDWfB. (7) ^ 0 and p> 2R- \

2 / f-l, quandomod (/ VDVRB, C) ^ 0 and p = 3R ~ 2

P, when mod (ArDrafl, C) = 0 or p <2R- \

dn = <

,, when mod (¿/, C)> 2

to i'i

¿+2, when mod (¿/, C) <2

p ^ 3R - 2

Nr

- 1, when mod (d, C) <2

^ dvfb “, when mod (V /, C) <2

Y

Y

Y

d:> ^ R DVRR 2

dp. - R DVRB ~ “

^ i .7, v 1

T R DVRB 1

On the other hand, in the method of FIG. 25c, if a DVRB index d is given, a PRB 5 index can be derived using Expression 8.

Expression 8

P u =

p'd -1. when mod (iVDVR¡¡, 0 ^ 0 3R-2, when inod (A ^ oraB, C) * 0 Pu, when mod (AfDVRB, C) = 0

mod (d, C)> 2 d ~ NDvrb ~ ^ (mod (¿, C) <2 and

d ± N

DVRB

-one)

where p [d = moá (d, C) -R + [d! C \ p2 d = mo d (pu + N

DVRB ‘^ DVRB)

Realization 12>

FIG. 25d illustrates a method implemented using the method of embodiment 7 and FIG. 21a and 21b when K = 10 2, Nd = 2, and the interleaver size (= C x R) is set so that CR = Ndvrb + Nnuio. Here, "Nnuh"

represents the number of nulls to be included in the interleaver. This Nnuh value can be a default value. According to this method, if a DVRB p index is given, a DVRB index can be derived using Expression 9 or 10.

Expression 9

image4

dP] = mod (p ', 2 /?) • Cf 2 + | _p' / 2R¡

where

jp + R- A'nul0 / 2

when; Vnu | 0 * 0 when M at O

nn n 'v'

Y

Y

R-N ^ nzpKR

Expression 10

í / p, = mod (p ", /?) • C + [p * 7 / f J

where

r \ p ", when An¡j | o = 0 to p" <R - Nn¡¡¡0 / 2 or R <p <2R- N „u¡012

P "\ p" + N „aJl when * ^ * 0 y (2R - N ^ t 2 <p" <3R-ffnm or p "> 2R-NnaJ2)

dPi ^ mod {p ', 2R) -CI2 + lp' / 2Rj

where

• Jpm + R ~ N ^ f2, when * ° "R-N„ lt, l2 <pm <R

P \ p "+ R, when JV„ uta * 0 and 3R ~ Nnub <p "<3P - Nmt¡ 12

where p * = mod (p + / 2,)

On the other hand, if a DVRB index d is given, a PRB index can be derived using Expression 11.

5 Expression 11

f Pu, when N n¡líD = 0 or (d <NDVXB - Nnub and mod (</, C) <2)

P '"! [Pu - ^„ u, 0/2, when Nnu | D * 0 and (d <NDVRB - NnulD and mod (¿, C)> 2)

where, pu = mod (¿, C) • R + \ d / C¡

R + N, luti / 2, when * 0 and (íi> íVr> wfi - and mod (d, C / 2) = 0)

R, when Nm0 * 0 and (d> NDVRB - Null and mod (d.C72) = I)

where p [d - mod (<i, C / 2) * 2 / f + [_2í¿ / Cj

Í ^ .í / = m ° d (í ']. ¿+ ^ DVRB! 2' ^ UVIW)

image5

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

Again with reference to the description given with reference to FIG. 15, the case in which a combination of the bitmap scheme using the RBG scheme and the subset scheme and the compact scheme can be taken into consideration. Problems that possibly occur in this case will be described with reference to FIG. 26 and 27.

FIG. 26 and 27 illustrate examples of a method that uses a combination of the bitmap scheme using the RBG scheme and the subset scheme and the compact scheme, respectively.

As shown in FIG. 26, each DVRB can be divided into two parts, and a second of the divided parts can be cyclically moved in a predetermined space (Space = Ndvrb / Nd = 50/2). In this case, only a part of the resource elements of an RBG0 consisting of PRB is correlated by the first divided part of DVRB, and only the parts of the resource elements of RBG8 and RBG9 that consist of each PRB are correlated by the second split part of DVRB. For this reason, RBG0, RBG8 and RBG9 cannot be applied to a scheme using a resource allocation on a RBG basis.

In order to solve this problem, the space can be set to be a multiple of the number of RBs included in an RBG, that is, Mrbg. That is, space can satisfy a condition “Space = Mrbg * k” (k is a natural number). When the space is set to satisfy this condition, it can have a value of, for example, 27 (Space = Mrbg * k = 3 * 9 = 27). When Space = 27, each DVRB can be divided into two parts, and a second of the divided parts can be cyclically moved through space (Space = 27). In this case, only a part of the resource elements of the RBG0, which consists of the PRBs, is correlated by the first divided part of DVRB, and only a part of the resource elements of the RBG9, which consists of the PRBs, are correlates by the second split part of DVRB. Therefore, in the method of FIG. 27, RBG8 can be applied to a scheme using an allocation of resources on a RBG basis, different from the method of FIG. 26.

In the method of FIG. 27, however, the DVRB indexes matched in one PRB cannot be matched in another PRB. Again with reference to FIG. 26, the indexes of DVRB 1 and 26 matched in PRB1 (2601) are also matched in PRB26 (2603). In the method of FIG. 27, however, the indexes of DVRB 1 and 27 paired in PRB1 (2701) cannot be matched in PRB25 or PRB27 (2703 or 2705).

In the case of FIG. 26 or 27, DVRB1 and DVRB2 correlate with PRB1, PRB2, PRB25 and PRB26. In this case, parts of the resource elements of PRB1, PRB2, PRB25 and PRB26 are left uncorrelated.

In the case of FIG. 26, if DVRB25 and DVRB26 are additionally correlated with PRBs, they completely fill in the remaining spaces of PRB1, PRB2, PRB25 and PRB26.

In the case of FIG. 27, however, if the DVRB25 and DVRB26 are additionally correlated with the PRBs, the DVRB25 and the DVRB26 correlate with the PRB0, PRB25, PRB26 and PRB49. As a result, the uncorrelated resource element parts of the PRB1 and PRB2 are still not filled with the DVRBs. That is, the case of FIG. 27 has a drawback that, normally, there are PRBs that remain uncorrelated.

The problem occurs because the cyclic shift is performed so that a space value is not equal to Ndvrb / Nd. When Ndvrb / Nd is a multiple of Mrbg, the problem described above is solved because the cyclic shift corresponds to a multiple of Mrbg.

<Embodiment 13>

In order to simultaneously solve the problems of FIG. 26 and 27, therefore, the number of RBs used for DVRBs, that is, Ndvrb, is limited to a multiple of NdMrbg according to an embodiment of the present invention.

<Embodiment 14>

Meanwhile, it can be seen that, in the previous cases, the first and second divided parts of each DVRB belong to different subsets, respectively. In order to make the two divided parts of each DVRB belong to the same subset, the space should be established to be a multiple of the square of

Mrbg (Mrbg2).

Therefore, in another embodiment of the present invention, the number of RBs used for DVRBs, that is, Ndvrb, is limited to a multiple of Nd Mrbg2, in order to make the two divided parts of each DVRB belong to the same subset, and to make the DVRB pair.

FIG. 28 illustrates the case where Ndvrb is established to be a multiple of Nd Mrbg.

As shown in FIG. 28, the divided parts of DVRB can always be matched in the PRBs according to a cyclic shift because the space is a multiple of Mrbg Nd. It is also possible to reduce the number of RBGs in which there are resource elements that have parts not filled with DVRBs.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

<Completion 15>

FIG. 29 illustrates the case in which the DVRB indices are interleaved according to the method of FIG. 28.

When the DVRB indices are interleaved as shown in FIG. 29, it may be possible to set Ndvrb to a multiple of NdMrbg when the DVRB indices correlate with the PRBs. In this case, however, there may be an occasion when the rectangular interleaver matrix is incompletely filled with DVRB indices, as shown in FIG. 20a and 20b. In this case, therefore, it is necessary to fill in nulls in unfilled parts of the rectangular interleaver matrix. In order to avoid the occasion that null refilling requires in a grade D block interleaver, it is necessary to limit the number of RBs used for DVRBs to a multiple of D.

Accordingly, in one embodiment of the present invention, the space is established to be a multiple of Mrbg, and the second divided part of each DVRB is cyclically displaced in Nrb / Nd so that the DVRB indices correlated with a PRB are matched . Also, in order to avoid filling in nulls in the block interleaver, the number of RBs used for DVRBs, that is, Ndvrb, is limited to a common multiple of Nd Mrbg and D. If D is equal to the order of diversity (NordenDiv = KNd) used in the interleaver in this case, Ndvrb is limited to a common multiple of Nd Mrbg and K Nd.

<Completion 16>

In another embodiment of the present invention, the space is established to be a multiple of Mrbg's square, in order to make the two divided parts of each DVRB be located in the same subset. Also, the second split part of each DVRB is cyclically shifted in Nrb / Nd so that the DVRB indexes correlated with a PRB are matched. In order to avoid filling nulls in the block interleaver, the number of RBs used for DVRBs, that is, Ndvrb, is limited to a common multiple of Nd Mrbg2 and D. If D is set in the order of diversity (NordenDiv = K Nd) used in the interleaver in this case, Ndvrb is limited to a common multiple of NdMrbg ^ KNd.

<Completion 17>

Meanwhile, FIG. 30 illustrates the case in which D is set in the number of columns, that is, C, and C is set to NordenDiv (NordenDiv = K Nd).

Of course, in the case of FIG. 30, the writing is performed in such a way that, after a column is completely filled, a next column is filled in and the reading is done in such a way that, after a row is completely read, a next row is read.

In the embodiment of FIG. 30, Ndvrb is set so that consecutive DVRB indices are assigned to the same subset. The illustrated rectangular interleaver is configured so that consecutive indices are filled in the same subset when the number of rows is a multiple of Mrbg2. Since the number of rows, R, is Ndvrb / D (R = Ndvrb / D), the number of RBs used for DVRBs, that is, Ndvrb, is limited to a multiple of DMrbg2.

In order to correlate the two divided parts of each DVRB with the PRBs in the same subset, the number of RBs used for DVRBs, that is, Ndvrb, is limited to a common multiple of DMRBG2 and NdMrbg2. When D = K Nd, Ndvrb is limited to KNdMrbg2 because the common multiple of KNdMrbg2 and NdMrbg ^ s KNdMrbg2

Finally, the number of RBs used for DVRBs can be a maximum number of DVRBs that meet the limitations described above within the PRB number throughout the system. The RBs used for DVRBs can be used in an interleaved manner.

<Completion 18>

Hereinafter, a correspondence method using temporary PRB indices will be described when Nprb and Ndvrb have different lengths according to an embodiment of the present invention.

FIG. 31 illustrates methods in which, when Nprb and Ndvrb have different lengths, the result of correspondence with the PRBs performed using the DVRB interleaver of FIG. 29 is processed once again to make the DVRBs finally match the PRBs.

One of the schemes shown by (a), (b), (c) and (d) of FIG 31 can be selected according to the use of system resources. In this scheme, the p-value in the correlational expressions described above of the DVRB and PRB indices is defined as a temporary pRb index. In this case, a value or obtained after adding Ncompensation to p exceeding Numbai is used as the final PRB index.

In this case, four alignment schemes illustrated respectively in FIG. 31 can be expressed by Expression 12.

5

10

fifteen

twenty

25

30

Expression 12

(a): Numbral

^ threshold ^ ^ compensation ^

jV ¡2 N

¥ DVRB ’1 compensation

^ PRB ^ DVRB

(c): Nl

N,

= 0, N .. = NPRB - Ndvrb

RKD uvtui compensation

N umbrai ~ 0> ^ compensation “LPRB ^ DVRb) ^ \ °

compensation

~ iPRB ^ DVRB) 12 "|

Here, (a) represents a justified alignment, (b) represents a left alignment, (c) represents a right alignment and (d) represents a central alignment. Meanwhile, if a PRB index is given or, a DVRB index d can be derived from Expression 13, using a temporary PRB index p.

Expression 13

image6

On the other hand, if the DVRB index d is given, a PRB index can be derived or from Expression 14, using a temporary PRB index p.

Expression 14

o = Plí1 + 7 when Pi’d ~ Numbm '

'' d [P¡, d, when PlM <^

<Completion 19>

Hereinafter, a correspondence method capable of increasing Ndvrb to a maximum while satisfying space limitations according to an embodiment of the present invention will be described.

The previous embodiments have proposed interleaver structures to reduce the number of PRBs, in which there are resource elements that have parts not filled with the DVRBs, where the RBG scheme and / or the subset scheme for the allocation of the LVRB The above embodiments have also proposed methods to limit the number of RBs used for DVRBs, that is, Ndvrb.

However, as the limitation condition caused by Mrbg becomes more stringent, the limitation on the number of RBs usable for DVRBs, that is, Ndvrb, increases among the total number of PRBs, that is, Nprb.

FIG. 32 illustrates the case using a rectangular interleaver having conditions of "Nprb = 32", "Mrbg = 3", "K = 2" and "Nd = 2".

When Ndvrb is established to be a multiple of Nd ■ Mrbg2 (= 18), to allow the two divided parts of each DVRB to be correlated with PRBs belonging to the same subset, while having a maximum value that does not exceed Nprb, the set Ndvrb is equal to 18 (Ndvrb = 18).

In order to allow the two divided parts of each DVRB to be correlated with the PRBs belonging to the same subset in the case of FIG. 32, Ndvrb is set to be 18 (Ndvrb = 18). In this case, 14 RB (32 -18 = 14) cannot be used for DVRBs.

In this case, it can be seen that Nespace is 9 (Nespace = 18/2 = 9), and the DVRB0 correlates with the first respective RBs of RBG0 and RBG3 that belong to the same subset.

Accordingly, the present invention proposes a method to satisfy the space limitation conditions when Nd = 2 establishing compensation and a threshold value, to which the compensation will be applied, as previously proposed, without directly reflecting the conditions of limitation of space in Ndvrb.

1) First, the desired space limitation conditions are established. For example, the space can be set to a multiple of Mrbg or a multiple of Mrbg2

2) Next, a number closer to Nprb / 2 between numbers that satisfy the space limitation conditions is set to Nespace.

3) When Nespace is smaller than Nprb / 2, the same correspondence as that of FIG. twenty.

4) When Nespace is equal to or greater than Nprb / 2, and null stuffing is allowed in the interleaver, Ndvrb is set so that Ndvrb = (Nprb - Nespace) • 2. However, when refilling is not allowed of nulls in the

interleaver, Ndvrb is set so that Ndvrb = [min (NPRB - Nespace, Nespace) 2 / CJC.

5) Compensation is applied to half or more of Ndvrb. That is, a reference value for the application of compensation, that is, Numbral, is set so that Numbrai = Ndvrb / 2.

6) The compensation is established so that the temporary PRBs, to which the compensation applies, 15 satisfy the space limitation conditions.

That is, Ncompensation is set so that Ncompensation = Nespace - Numbral.

This can be expressed by Expression 15 as a generalized mathematical expression Expression 15

1. Establishment of Nespace according to space conditions:

20 Under a multiple condition of Mrbg2:

Nespace = rounding (NpRB / (2 • Mrbg2)) • Mrbg2 Under a multiple condition of Mrbg:

Nespace = rounding (NpRB / (2 • Mrbg)) • Mrbg

2. Establishment of Ndvrb:

25 Under a condition of null allowed:

NdVRB = min (NpRB - Nespace, Nespace) • 2 Under a null condition not allowed:

Ndvrb = Lmin (NPRB - Nespace, Nespace) 2 / C JC

3. Establishment of Numbrai: Numbrai = Ndvrb / 2

30 4. Establishment of Compensation: Compensation = Nespace - Numbral

FIG. 33 illustrates the application of a DVRB correspondence rule proposed in the present invention when Nprb = 32, Mrbg = 3, and a rectangular interleaver of K = 2 and Nd = 2.

When Nespace is set to be a multiple of Mrbg2 (= 9) while it is the closest to Nprb / 2, in order to correlate the two divided parts of each DVRB with the PRBs belonging to the same subset, respectively , the set Nespace is equal to 18 (Nespace = 18). In this case, 28 RB ((32-18) x2 = 28) are used for DVRBs. That is, the conditions of "Ndvrb = 28", "Numbral = 28/2 = 14", and "Compensation = 18-14 = 4" are established. Therefore, the temporal PRB indices, with which the DVRB indices interleaved by the rectangular interleaver are correlated, are compared with Numbral. When Ncompensation is added to temporary PRB indices that satisfy Numbral, a result is obtained as shown in FIG. 33. With reference to FIG. 40 33, it can be seen that the two divided parts of the DVRB0 correlate with the first respective RBs of the RBG0 and RBG6 that belong to the same subset. When this method is compared with the method of FIG. 32, it can also be seen that the number of RBs usable for DVRBs is increased from 18 to 28. Since the space is also increased, the diversity in DVRB correspondence can be further increased.

<Completion 20>

Hereinafter, a correspondence method capable of increasing Ndvrb to a maximum will be described while consecutive indices are correlated with specific positions according to an embodiment of the present invention.

When several DVRBs are assigned to a UE, the assigned DVRBs are consecutive DVRBs. In this case, therefore, it is preferable to establish contiguous indices so that they are placed at intervals of a multiple of 5 Mrbg or a multiple of Mrbg2, for the programming of the LVRBs, in a manner similar to the establishment of space. When it is assumed, in this case, that the degree of the interleaver is equal to the number of columns, that is, C, the number of rows, that is, R, should be a multiple of Mrbg or a multiple of Mrbg2. Therefore, the interleaver size, that is, Nintercalator = CR, should be a multiple of CMrbg or a multiple of CMrbg2 In this way, if Ndvrb is given previously, a minimum interleaver size that satisfies the above conditions can be derived. as follows.

Under a non-multiple condition, Nintercalator = | ”-Ng ^ g / C" j'C.

In this case, therefore, R = NintercaladorlC = | "N'DVRB / C" | .

Under the condition of multiple CMrbg, Nintercalator = \ Ndvrb / (CMrbg)} CMrbg. In this case, therefore, R = NintercaladorlC = \ Ndvrb / (CMrbo) \ Mrbo.

fifteen

Under the condition of multiple C Mrbg2, Nintercalator =

Ndvrb / (C-MlBG) • CM2

RBG

Ndvrb¡ (C-M2rbg)

In this case, therefore, R - NintercaladorlC '

The number of nulls included in the interleaver is as follows

Under a non-multiple condition, Null = Nintercalator - Ndvrb = \ Ndvrb / C ~ \ C - N1

CM

RBG

DVRB ■

Under the condition of multiple CMrbg, Null = Nintercalator - Ndvrb = \ Ndvrb / (C Mrbo) \ C Mrbo - Ndvrb.

20 Under the condition of multiple C Mrbg2, Null = Nintercalator - Ndvrb =

The exemplary embodiments described above are combinations of elements and features of the present invention. Elements or features can be considered selective unless otherwise mentioned. Each element or feature can be implemented without being combined with other elements or features. In addition, the embodiments of the present invention can be interpreted by combining parts of the elements and features. The operation orders described in the embodiments of the present invention can be rearranged. Some constructions of any embodiment may be included in another embodiment and may be replaced by corresponding constructions of another embodiment. It is evident that the present invention can be incorporated by a combination of claims that do not have an explicit cited relationship in the appended claims or may include new claims by correction after the application.

The embodiments of the present invention can be achieved by various means, for example, hardware, microprogram, software or a combination thereof. In a hardware configuration, the embodiments of the present invention can be implemented by one or more specific application integrated circuits (ASICs), digital signal processors (DSP), digital signal processing devices (DSPD), programmable logic devices (PLD), field programmable door groupings (FPGA), processors, controllers, microcontrollers, microprocessors, etc.

In a microprogram or software configuration, the embodiments of the present invention can be achieved by a module, a procedure, a function, etc. that perform the functions or operations described above. A software code can be stored in a memory unit and operated by a processor. The memory unit is located inside or outside the processor and can transmit data to and receive 40 data from the processor through various known means.

Industrial applicability

The present invention is applicable to a transmitter and receiver used in a wireless broadband mobile communication system.

image7

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 spirit or scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of this invention provided that they fall within the scope of the appended claims and their equivalents.

Claims (13)

5 10 fifteen twenty 25 30 35 40 Four. Five 1. A method for transmitting downlink data using resource blocks with distributive correspondence of virtual resource blocks, VRB, consecutively assigned with physical resource blocks, PRB, at a base station in a wireless mobile communication system, the method comprising: transmit downlink data correlated with the PRBs to a user equipment, wherein the VRB indices, which are interleaved by a block interleaver, are correlated with PRB indices for each of a first interval and a second interval of a subframe with a predetermined space (1105, 1203) for distribution , characterized by: VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, where the PRB indices, which are equal to or greater than Numbrai, for the first interval and the second interval of the subframe are shifted by an amount of Ncompensation, where Ncompensation denotes a compensation value and Numbrai denotes a threshold value of the PRB indices to which the compensation value applies, where a number, C, of columns of the block interleaver is equal to 4, and a number, R, of rows of the block interleaver is given as: image 1 where Ndvrb is a number of resource blocks used for VRBs, Mrbg is a number of PRBs that constitute the resource block group, RBG, Nintercaiador is a size of the block interleaver, where, when Ndvrb is smaller than Nintercaiador, the nulls are uniformly inserted into the last Nnuio / 2 rows of the 2nd and 4th columns of the block interleaver, where Nnuo is equal to a number of nulls, where, when the VRB indices are read from the block interleaver, the nulls are ignored, where Ndvrb is determined as (Nprb - Nespace) 2 where Nespace denotes a predetermined space value that is a multiple of a square of Mrbg, and Nprb denotes a number of the PRBs in a system bandwidth, when Nespace is greater or equal to Nprb / 2, and where Ncompensation is determined as Nespace - Numbrai, and Numbrai is equal to Ndvrb / 2. 2. A method for receiving a downlink data packet in a wireless mobile communication system that supports a resource allocation scheme that distributionally correlates virtual resource blocks, VRBs, consecutively assigned with physical resource blocks, PRB, the method that comprises: receive downlink control information that includes resource allocation information for downlink data from a base station; Y receive the downlink data correlated with the PRBs based on the downlink control information, where the resource allocation information indicates VRB assignments for the user equipment, where the rates of the PRBs with which the downlink data are correlated are determined based on the correspondence relationship between the VRBs and the PRBs, where the correspondence relationship is defined as virtual resource block indices, VRBs, which are interleaved by a block interleaver, are correlated with PRB indices for each of a first interval and a second interval of a subframe with a default space (1105, 1203) for distribution, characterized by: VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, where the PRB indices, which are equal to or greater than Numbrai, for the first interval and the second interval of the subframe are shifted by an amount of Ncompensation, where Ncompensation denotes a value of 5 10 fifteen twenty 25 30 35 compensation and Numbral denotes a threshold value of the PRB indices to which the compensation value applies, where a number, C, of columns of the block interleaver is equal to 4, and a number, R, of rows of the block interleaver is given as: image2 where Ndvrb is a number of resource blocks used for VRBs, Mrbg is a number of PRBs that constitute a group of resource blocks, RBG, Nintercalator is a size of the block interleaver, where, when Ndvrb is smaller than Nintercaiador, nulls are inserted in the last Nnuio / 2 rows of the 2nd and 4th columns of the block interleaver, where Nnuio is equal to a number of nulls, where, when the VRB indices are read from the block interleaver, the nulls are ignored, where Ndvrb is determined as (Nprb - Nespace) 2 where Nespace denotes a predetermined space value that is a multiple of a square of Mrbg, and Nprb denotes a number of the PRBs in a system bandwidth, when Nespace is greater or same as Nprb / 2, and where Ncompensation is determined as Nespace - Numbral, and Numbral is equal to Ndvrb / 2. 3. The method according to claim 1 or claim 2, wherein, when an index d of one of the virtual resource blocks is given, an index p1, d of one of the physical resource blocks in the first interval correlated with The index d is given by: \ Pu when N - 0 null when N, ^ 0 * null or (d <NDVRg Nnuo and y (d <N DVRB - Null and mod (rf, C) <2) mod (J, C) S 2) where p \, ü = ^ oá (d, C) R + [diC \ j Pu ~ R + ^ null12 - CU5ndo ^ * 0 y) / u -R, when Nnuk¡ * 0 and (d> NDvm Nnu¡0 and (d> Ndvkb - Null and mod (d, C / 2) -0) mod (rf, C / 2) = l) where p'¿ = mod (d, C / 2) ■ 2R + [2d IC \ and an index p2, d of one of the blocks of physical resources in the second interval correlated with the index d is given by: image3 where mod means a module operation. 4. The method according to claim 1 or claim 2, wherein, when an index d of one of the virtual resource blocks is given, if an index p1, d of one of the physical resource blocks in the first correlated interval with the index d is greater than Ndvrb / 2, then the value of p1, d is replaced by p1, d + Nprb - Ndvrb, and if an index p2, d of one of the blocks of physical resources in the second interval correlated with the index d is greater than Ndvrb / 2, the value of p2, d is replaced by p2, d + Nprb - Ndvrb, and Nprb is the number of physical resource blocks in the system. 5. The method according to claim 1 or claim 2, wherein the space (1105, 1203) for distribution is 0 when the number of virtual resource blocks is greater than or equal to a predetermined threshold value. 6. The method according to claim 1 or claim 2, wherein a block interleaver degree is a multiple of a number of physical resource blocks with which a virtual resource block is correlated. 7. The method according to claim 1 or claim 2, wherein Ndvrb is given as: Novkb = mÜl (NPRB - Nespaci0, Ncsp¡¡cio) '2 5 10 fifteen twenty 25 30 35 40 where Nespace denotes a predetermined space value (1105, 1203), and Nprb denotes a number of the PRBs in a system bandwidth. 8. The method according to any one of claims 1 to 7, wherein Ndvrb is a multiple of the order of diversity determined by the distribution. 9. A base station that transmits downlink data using use resource blocks with distributive correspondence of virtual resource blocks, VRBs, allocated consecutively with physical resource blocks, PRB, in a wireless mobile communication system, the station base comprising: a processor to control a base station operation; and a memory unit driven by the processor, wherein the processor is configured to transmit downlink data correlated with the PRBs to a user equipment; wherein the VRB indices, which are interleaved by a block interleaver, are correlated with PRB indices for each of a first interval and a second interval of a subframe with a predetermined space (1105, 1203) for distribution , characterized by: VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, where the PRB indices, which are equal to or greater than Numbrai, for the first interval and the second interval of the subframe are shifted by an amount of Ncompensation, where Ncompensation denotes a compensation value and Numbrai denotes a threshold value of the PRB indices to which the compensation value applies, where a number, C, of columns of the block interleaver is equal to 4, and a number, R, of rows of the block interleaver is given as: image4 where Ndvrb is a number of resource blocks used for VRBs, Mrbg is a number of PRBs that constitute a group of resource blocks, RBG, Nintercalator is a size of the block interleaver, where, when Ndvrb is smaller than Nintercaiador, nulls are inserted in the last Nnuiol2 rows of the 2nd and 4th columns of the block interleaver, where Nnuio is equal to a number of nulls, where, when the VRB indices are read from the block interleaver, the nulls are ignored, where Ndvrb is determined as (Nprb - Nespace) 2 where Nespace denotes a predetermined space value that is a multiple of a square of Mrbg, and Nprb denotes a number of the PRBs in a system bandwidth, when Nespace is greater or equal to Nprb / 2, and where Ncompensation is determined as Nespace - Numbrai, and Numbrai is equal to Ndvrb / 2. 10. The base station according to claim 9, wherein, when an index d of one of the virtual resource blocks is given, an index pi, d of one of the physical resource blocks in the first interval correlated with the index d is given by: \ Pu when N - 0 null when N, ^ 0 * null or (d <NDVRg Nnuo and y (d <N DVRB - Null and mod (rf, C) <2) mod (J, C) S 2) where p \, ü = ^ oá (d, C) R + [diC \ j Pu ~ R + Nnuto 12 - CU5ndo ^ * 0 y) / u, when Nnuk¡ * 0 and (d> NDvm Nnu¡0 and (d> Ndvkb - Null and mod (d, C / 2) -0) mod (rf, C / 2) = l) 5 10 fifteen twenty 25 30 35 40 where p'¿ = moá (d, C / 2) ■ 2R + [2d tc \ and an index p2, d of one of the blocks of physical resources in the second interval correlated with the index d is given by: image5 where mod means a module operation. 11. The method according to claim 1 or claim 9, wherein Ndvrb is given as: Novkb = - Nesptci0, N'Speao) • 2 where Nespace denotes a predetermined space value (1105, 1203), and Nprb denotes a number of the PRBs in a system bandwidth. 12. A user equipment that receives downlink data using resource blocks in a wireless mobile communication system that supports a resource allocation scheme distributing correlatively virtual resource blocks, VRBs, allocated consecutively with physical resource blocks, PRB, the user equipment comprising: a processor to control an operation of the user equipment; Y a memory unit driven by the processor, where the processor is configured to: receive downlink control information that includes resource allocation information for downlink data from a base station; Y receive the downlink data correlated with the PRBs based on the downlink control information, where the resource allocation information indicates VRB assignments for the user equipment, where the rates of the PRBs with which the downlink data are correlated are determined based on the correspondence relationship between the VRBs and the PRBs, where the correspondence relationship is defined as virtual resource block indices, VRBs, which are interleaved by a block interleaver, are correlated with the PRB indices for each of a first interval and a second interval of a subframe with a predetermined space (1105, 1203) for distribution, characterized by: VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, where the PRB indices, which are equal to or greater than Numbrai, for the first interval and the second interval of the subframe are shifted by an amount of Ncompensation, where Ncompensation denotes a compensation value and Numbrai denotes a threshold value of the PRB indices to which the compensation value applies, where a number, C, of columns of the block interleaver is equal to 4, and a number, R, of rows of the block interleaver is given as: image6 where Ndvrb is a number of resource blocks used for VRBs, Mrbg is a number of PRBs that constitute a group of resource blocks, RBG, Nintercalator is a size of the block interleaver, where, when Ndvrb is smaller than Nintercalator, nulls are inserted in the last Nnuio / 2 rows of the 2nd and 4th columns of the block interleaver, where Nnuio is equal to a number of nulls, where, when the VRB indices are read from the block interleaver, the nulls are ignored, where Ndvrb is determined as (Nprb - Nespace) -2 where Nespace denotes a predetermined space value that is a multiple of a square of Mrbg, and Nprb denotes a number of PRBs in a system bandwidth, when Nespace is greater than or equal to Nprb / 2, and where Ncompensation is determined as Nespace - Numbral, and Numbral is equal to Ndvrb / 2. The user equipment according to claim 12, wherein, when an index d of one of the blocks of virtual resources, an index pi, d of one of the blocks of physical resources in the first interval correlated with the index d is given by: 10 Pxa = ' Pu , when N ... = 0 or (d <NDVIiB - N Pu-NnU, or / 2 Nimlo * 0 0d <N, - N DVRB * * null mod (rf, C) <2) mod (J, C) S 2) where p '] d = mod {d, C) R + [d! C \ image7 where p \ d = mod (d, C72) ■ 2R + [_2d! C \ and an index p2, d of one of the blocks of physical resources in the second interval correlated with the index d is given by: P2, ¡i i7iod (7> i (y + Ndvrb / 2, N DVRB) 15 where mod means a module operation. 14. The user equipment according to claim 12, wherein Ndvrb is given as: N dvrb = mÜl (N PRB - Ncspt¡cl0, Nespacio) ■ 2 where Nespace denotes a predetermined space value (1105, 1203), and Nprb denotes a number of the PRBs in a system bandwidth. twenty