ES2687096T3 - Method for planning distributed blocks of virtual resources - Google Patents

Abstract

A method for transmitting downlink data using resource blocks by distributively mapping virtual resource blocks, VRB, consecutively assigned to physical resource blocks, PRB, at a base station in a wireless mobile communication system, the method comprising: transmitting data from the downlink mapped to PRBs to a user equipment, where the VRB indices, which are interleaved by a block interleaver, are mapped to PRB indices for a first slot and a second slot of a subframe, and the indices of the PRBs for the second slot are offset relative to the indices of the PRBs for the first slot based on a predetermined gap; characterized in that the VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, and the PRB indices, which are equal to or greater than Nthreshold, for the first slot and the second slot of the subframe is shifted by an amount of Ndeviac, where Ndeviac denotes a deviation value and Nthreshold denotes a threshold value for the PRB indices to which the deviation value applies, in which 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: where NDVRB is the number of VRBs, MRBG is a number of the PRBs that constitute a resource block group, RBG, Ninterleaver is a block interleaver size, where when NDVRB is smaller than Ninterleaver, nulls are inserted in the last Nnull / 2 rows of the 2nd and 4th column of the block interleaver uniformly, where Nnull is equal to a number of the nulls, in which, when the VRB indices are read from the block interleaver, the nulls are ignored, in which NDVRB is determined as (NPRB - Nhueco) · 2 in which Nhueco denotes a value of a predetermined gap that is a multiple of a square of MRBG, and NPRB denotes a number of PRBs in a system bandwidth, when N gap is greater than or equal to NPRB / 2, where Ndeviac is determined as Nhueco - Numbral, and Numbral is determined as NDVRB / 2; and in which Nhueco is determined as Nhueco> = rounding (NPRB / (2 · MRBG2)) · MRBG2, in which rounding () denotes an integer that is the closest to the number within parentheses ().

Description

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

DESCRIPTION

Method for planning distributed blocks of virtual resources Technical sector

The present invention relates to wireless broadband mobile communication systems, and more particularly, to the planning of radio resources for packet data transmission in the up / down link in a cellular OFDM wireless packet communication system.

State of the art

In a cellular orthogonal frequency division multiplexing (OFDM) wireless packet communication system, the transmission of data packets in the up / down link is performed by subframe and a subframe is defined by a certain time interval that includes a plurality of OFDM symbols.

The Third Generation Partnership Project (3GPP) supports a type 1 radio frame structure applicable to frequency division duplexing (FDD), and a type 2 radio frame structure applicable to time division duplexing (TDD) . The structure of a type 1 radio frame is shown in Figure 1. The type 1 radio frame includes ten subframes, each consisting of two slots. The structure of the type 2 radio frame is shown in Figure 2. The type 2 radio frame includes two semi-frames, each of which consists of five subframes, a downlink pilot time slot (DwPTS), a gap period (GP), and an uplink pilot time slot (UpPTS), in which a subframe consists of two slots. That is, a subframe is composed of two slots regardless of the type of radio frame.

A signal transmitted in each slot can be described as a resource grid that includes ¿V »Iv sc

IX TDL X 7DL

/ Vdmb OFDM symbols. In this case, ¡and RB represents the number of resource blocks (RB) in

A Tm A TDl

a downlink, Nse represents the number of subcarriers that constitute an RB, and Ns¡ „, b represents the number of OFDM symbols in a downlink slot. The structure of this resource grid is shown in Figure 3.

RBs are used to describe a mapping 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 a PRB or a VRB. A mapping relationship between VRBs and PRBs can be described for each subframe. In more detail, it can be described in units of each of the slots that constitute a subframe. Also, the mapping relationship between VRBs and PRBs can be described using the mapping relationship between VRB indices and PRB indices. A detailed description of this will also be given in embodiments of the present invention.

IX TDL x

/ Vdmb consecutive OFDM symbols in a time domain and Jy sc subcarriers

mdl aj-rb

consecutive in a frequency domain. A PRB is therefore composed of ¿V simb ** SC resource elements. PRBs are assigned numbers from 0 to Nr¡¡ * 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 VRB has a single common vRb index (which can be referred to herein as a VR VRB number ’) and is

1 rf

two slots that constitute a subframe are each assigned an index from 0 to ¡and RB ~ 1 ’and the A1 rb VRB belonging to a second of the two slots are assigned in the same way any index from 0 to

located in two slots of a subframe. In other words, the] and R „VRB that belong to a first of the

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

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

In the same way, the index of a PRB corresponding to a specific frequency band of the first slot has the same value as the index of a PRB corresponding to the specific frequency band of the second slot. That is, assuming that a PRB corresponding to a frequency band of the first slot is indicated by PRB1 (i), a PRB corresponding to a frequency band of the second slot is indicated by PRB2 (j) and the numbers of PRB1 index (i) and PRB2 (j) are indicated by index (PRB1 (i)) and index (PRB2 (j)), respectively, an index relationship (PRB1 (k)) = index (PRB2 ( k)) (see Figure 4b).

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

The document “Resource block allocation - mapping rules”, 3GPP R1-060286, February 13-17, 2006, describes the principles for mapping virtual resource blocks on the physical channel resources of the downlink in LTE systems in a distributed or located.

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

US 2004/178934 A1 and US 2005/0135493 disclose bit interleaving schemes for OFDM systems. In US 2004/178934 A1, the coded bits of a multi-band OFDM ultra-wideband system are interleaved with each OFDM symbol and through the OFDM symbols. In US 2005/0135493 A1, an adaptive interleaver exchanges a variable number of bits encoded by the OFDM symbol.

International Patent Application Publication No. WO 2007/097628 discloses a method and apparatus for assigning a radio resource using a localized transmission scheme and a distributed transmission scheme in combination with an OFDM access system.

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

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

The 3GPP draft No. R1-075116, entitled "Update of 36.213," discloses updates to the 3GPP 36.213 technical specification.

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

The 3GPP draft No. R1-081021, entitled "Remaining issues for DVRB to PRB mapping", explains details of the DVRB to PRB mapping.

The 3GPP draft No. R1-081119, entitled "Way forward DVRB to PRB mapping", explains DVRB mapping and gap values.

The NORTEL document: “DVRB mapping”, draft 3GPP, R1-080377, F-06921, SOPHIA-ANTIPOLIS CEDEX; FRANCE, vol. RAN WG1, no. Seville, Spain, January 10, 2008, proposes a mapping between DVRB and PRB that allows the compact allocation of RB to be used as frequently as possible, saving the additional overhead required with freedom of allocation of higher RB.

WO2009 / 088911 discloses an apparatus for communication using a wireless communication network that includes an interleaver and a transceiver.

The localized VRBs (LVRB) are mapped directly to PRBs and the LVRB indices correspond to the PRB indices. Also, index LVRBs correspond to index PRBs. That is, an LVRB1 that has an index i corresponds to a PRB1 that has an index i, and an LVRB2 that has an index i corresponds to a PRB2 that has an index i (see Figure 5). In this case, it is assumed that the VRBs in Figure 5 are all assigned as LVRB.

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

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

First, the order of a sequence of consecutive indices of the DVRBs can be interleaved by a block interleaver. In this case, the sequence of consecutive indices means that the index number is sequentially increased by one starting from 0. A sequence of indices produced from the interleaver is sequentially mapped to a sequence of consecutive indices of the PRB1 (see Figure 6). . It is assumed that the VRBs in Figure 6 are all assigned as DVRB. On the other hand, the sequence of indices produced from the interleaver is cyclically shifted by a predetermined number and the cyclically shifted index sequence is mapped sequentially to a sequence of consecutive indices of the PRB2 (see Figure 7). It is assumed that the vRb of Figure 7 are all assigned as DVRB. In this way, PRB indices and DVRB indices can be mapped over two slots.

On the other hand, in the above processes, a sequence of consecutive indices of the DVRBs can be sequentially mapped to the sequence of consecutive indices of the PRB1s without passing through the interleaver. Also, the sequence of consecutive indices of the DVRBs can be cyclically moved in a predetermined number without passing through the interleaver and the sequence of cyclically displaced indices can be sequentially mapped to the sequence of consecutive indices of the PRB2.

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

In the case where the VRBs (1), among the VRBs, are assigned as DVRBs, in Figure 8, if the methods of Figures 6 and 7 are used, the LVRBs cannot be assigned to a PRB2 (6) already 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 above-mentioned LVRB mapping scheme, that LVRBs are mapped to PRB2 (6) and PRB1 (9) means that LVRBs are also mapped to a PRB1 (6) and a PRB2 (9); however, PRB1 (6) and PRB2 (9) have already been mapped by the VRB1 (1) and VRB2 (1) mentioned above. In this sense, it will be understood that the LVRB mapping can be restricted by the results of the DVRB mapping. Therefore, there is a need to determine the DVRB mapping rules taking into account the LVRB mapping.

In a wireless broadband mobile communications system that uses multi-carrier, radio resources can be allocated to each terminal with an LVRB and / or DVRB scheme. Information that indicates which scheme is used can be transmitted in a bitmap format. In this situation, the allocation of radio resources to each terminal can be carried out in units of an RB. In this case, the 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 RB (RBG) consisting of PRBs of consecutive k indices (for example, k = 3) can be defined and resources with a granularity of '1' RBG can be allocated. In this case, the allocation of RB is not carried out in a sophisticated way, but there is an advantage that bit overload is reduced.

In this case, the LVRB can be mapped to PRB based on RBG. For example, a PRB that has three consecutive indices, a PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1) and PrB2 (í + 2), it can constitute an RBG, and the LVRB can be mapped to 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 ) were previously mapped by the DVRB, this RBG cannot be mapped by the LVRB based on the RBG. That is, DVRB mapping rules can restrict the mapping of LVRB into RBG units.

As mentioned above, because DVRB mapping rules can affect LVRB mapping, there is a need to determine DVRB mapping rules taking into account LVRB mapping.

Divulgation

Technical problem

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

Object of the invention

The object of the present invention can be achieved by providing, in a wireless mobile communication system, a method performed at a base station for downlink data transmission using resource blocks distributing VRB distributively mapped consecutively to PRB. The method is as defined in claim 1.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

In another aspect of the present invention, provided herein is, in a wireless mobile communications system, a method performed on a user equipment for receiving downlink data using resource blocks distributing VRB distributively mapped consecutively to PRB. The method is as defined in claim 2.

In another aspect of the present invention, provided herein is, in a wireless mobile communication system, transmission by a downlink database station using resource blocks distributing VRB distributively mapped consecutively to PRB. The base station is as defined in claim 5. In another aspect of the present invention, provided herein is, in a wireless mobile communication system, a user equipment for receiving downlink data using blocks of resources distributing VRB distributively mapped consecutively to PRB. The user equipment is as defined in claim 9. The various aspects mentioned above of the present invention are all applicable to a base station and / or mobile station. In the case where the aspects mentioned above in the present invention are applied to the mobile station, the resource block mapping method may additionally include receiving a resource indication value (RIV) from the mobile station of the system wireless mobile communications, prior to the interleaving stage or the stage of determining the indices of the virtual resource blocks.

Advantageous effects

In accordance with the present invention, it is possible to efficiently combine the planning of an FSS scheme and the planning of an FDS scheme and simply implement a method of transferring planning information.

Description of the figures

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:

Figure 1 is a view showing an example of a radio frame structure applicable to FDD.

Figure 2 is a view showing an example of a radio frame structure applicable to TDD.

Figure 3 is a view showing an example of a resource grid structure that constitutes a 3GPP transmission slot.

Figure 4a is a view showing an example of the structure of the VRBs in a subframe.

Figure 4b is a view showing an example of the structure of PRBs in a subframe.

Figure 5 is a view illustrating an example of a method for mapping LVRB to PRB.

Figure 6 is a view illustrating an example of a method for mapping DVRBs in a first PRB slot.

Figure 7 is a view illustrating an example of a method for mapping DVRBs in a second PRB slot.

Figure 8 is a view illustrating an example of a method for mapping the DVRB to PRB.

Figure 9 is a view illustrating an example of a method for mapping DVRB and LVRB to PRB.

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

Figure 11 is a view illustrating an example of a method for mapping two DVRBs having consecutive indices to a plurality of contiguous PRBs.

Figure 12 is a view illustrating an example of a method for mapping two DVRBs having consecutive indices to a plurality of spaced PRBs.

Figure 13 is a view illustrating an example of a method for mapping four DVRBs having consecutive indices to a plurality of spaced PRBs.

Figure 14 is a view illustrating an example of a resource block mapping method in the case where Gap = 0, in accordance with an embodiment of the present invention.

Figure 15 is a view illustrating a bitmap configuration.

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

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

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

Figures 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.

Figures 21a and 21b are views illustrating a method for insertion of nulls when the number of resource blocks used in an interleaving operation is not a multiple of an order of diversity, in accordance with an embodiment of the present invention.

Figure 22 is a view illustrating a method for mapping DVRB indices with Gap = 0 according

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

with an embodiment of the present invention.

Figure 23 is a view illustrating an example of a method for mapping DVRB indices, using different gaps for different terminals.

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

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

Figure 25b is a view illustrating a general method for insertion of nulls in an interleaver.

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

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

Figure 28 is a view illustrating the case in which the number of DVRBs is set to a multiple of the number of

Physical resource blocks (PRB), to which a virtual resource block (VRB), Nd, and the number of consecutive physical resource blocks that constitute an RBG, Mrbg, are mapped in accordance with an embodiment of the present invention.

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

Figure 30 is a view illustrating an example in which the mapping is performed under the condition that the degree of a block interleaver is fixed to the number of columns in the block interleaver, namely C, and C is fixed to a order of diversity, in accordance with an embodiment of the present invention.

Figure 31 is a view illustrating an example of a mapping method according to an embodiment of the present invention when the number of the PRBs and the number of the DVRBs are different from each other.

Figures 32 and 33 are views illustrating examples of a mapping method capable of increasing the number of DVRBs, using a given gap, in accordance with an embodiment of the present invention.

Detailed description of the invention

Reference will now be made in detail to the preferred embodiments of the present invention with reference to the accompanying drawings. The detailed description, given below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention, rather than to show the only embodiments that can be implemented in accordance with the invention. The following detailed description includes specific details to provide a comprehensive 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 description that follows will be centered around specific terms, but the present invention is not limited thereto and any other thermal may be used to represent the same meanings. Also, whenever possible, the same reference numbers will be used throughout the drawings to refer to the same or similar parts.

In the event that a subframe consists of a first slot and a second slot, index (PRB1 (i)) represents an index of a PRB of a frequency band of the first slot, index (PRB2 (j)) represents a index of a PRB of a frequency band of the second slot, and the index ratio (PRB1 (k)) = index (PRB2 (k)) is established, as previously indicated. Also, index (VRB1 (i)) represents an index of a VRB of a virtual frequency band of the first slot, index (VRB2 (j)) represents an index of a VRB of a virtual frequency band of the second slot, and an index relationship is established (VRB1 (k)) = index (VRB2 (k)). In this situation, the VRB1 are mapped to the PRB1 and the VRB2 are mapped to the PRB2. Also, VRBs are classified into DVRB and LVRB.

The rules for mapping LVRB1 to PRB1 and rules for mapping LVRB2 to PRB2 are the same. However, the rules for mapping DVRB1 to PRB1 and the rules for mapping DVRB2 to PRB2 are different. That is, DVRBs "divide" and map to PRBs.

In 3GPP, an RB is defined in units of a slot. However, in the detailed description of the invention, a RB is defined in units of a subframe, and this RB is divided into Nd sub-RB in a time axis, so that the DVRB mapping 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 sub-PRB and a second sub-PRB, and a VRB divided into units of a subframe is divided into a first sub-VRB and a second sub-VRB.

In this case, the first sub-PRB corresponds to the aforementioned PRB1, and the second sub-PRB corresponds to the aforementioned PRB2. Also, the first sub-VRB corresponds to the above-mentioned VRB1, and the second sub-VRB corresponds to the above-mentioned VRB2. Also, both in the detailed description of the invention and in the 3GPP, the DVRB mapping rules for obtaining a frequency effect are described 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 mapping method in the 3GPP.

Hereinafter, the terms used in the detailed description of the present application are defined as follows.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

A 'resource element (RE)' represents a smaller frequency-time unit in which the data is mapped or a modulated symbol of a control channel. Assuming that a signal is transmitted in an OFDM symbol over M subcarriers and N OFDM symbols are transmitted in a subframe, they are presented in a MxN RE subframe.

A 'physical resources block (PRB)' represents a unit of 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 the PRBs are defined in a subframe.

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

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

A 'distributed virtual resources block (DVRB)' is another type of VRB. A DVRB is mapped to a plurality of PRB in a distributed way.

'Nd' = 'Nd' represents the number of PRBs to which a DVRB is mapped.

Figure 9 illustrates an example of a method of mapping DVRB and LVRB to PRB. In Figure 9, Nd = 3. An arbitrary DVRB can be divided into three parts and the divided parts can be mapped to different PRBs, respectively. In this situation, the remaining part of each PRB, not mapped by the arbitrary DVRB, is mapped to a divided part of a different DVRB.

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

Nlvrb 'represents the number of LVRBs available in the system.

Ndvrb 'represents the number of DVRBs available in the system.

Nlvrb_ue 'represents the maximum number of LVRBs assignable to a user equipment (UE).

Ndvrb_ue 'represents the maximum number of DVRBs assignable to a UE.

Nsubset 'represents the number of subsets.

NordenDiv 'represents the order of diversity required in the system. In this case, the order of diversity is defined by the number of RBs that are not adjacent to each other.

In this case, 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 by time slots that constitute a subframe, the "RB number" means the number of RB divided on the frequency axis of the same slot.

Figure 9 shows an example of definitions of the LVRB and DVRB.

As can be seen in Figure 9, each RE of an LVRB is mapped one by one to each RE of a PRB. For example, an LVRB is mapped to a PRB0 (901). In contrast, a DVRB is divided into three parts and the divided parts are mapped to different PRBs, respectively. For example, a DVRB0 is divided into three parts and the divided parts are mapped to a PRB1, PRB4 and PRB6, respectively. In the same way, a DVRB1 and a DVRB2 are each divided into three parts and the divided parts are mapped to the remaining resources of PRB1, PRB4 and PRB6. Although each DVRB is divided into three parts in this example, the present invention is not limited thereto. For example, each DVRB can be divided into two parts.

The downlink data transmission from a base station to a specific terminal or uplink data transmission from the specific terminal to the base station is performed through one or more VRBs in a subframe. When the base station transmits data to the specific terminal, it must notify the terminal from which one of the VRBs is used for data transmission. Also, to allow the specific terminal to transmit data, the base station must notify the terminal of which one of the VRBs is allowed to use for data transmission.

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

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

of the frequency

In the FDS scheme, a transmission stage transmits a data packet on subcarriers widely distributed in a frequency domain of the system so that the symbols in the data packet can undergo various attenuations of the radio channel. 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 through one or more consecutive frequency areas in the system frequency domain that are in a state of favorable fading. In a wireless communication system by cellular OFDM packets, a plurality of terminals are present in a cell. In this situation, because the conditions of the radio channel of the respective terminals have different characteristics, it is necessary to perform a data transmission of the FDS scheme with respect to a certain terminal and the data transmission of the FSS scheme with respect to a terminal different 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 band favorable to a UE from among all available bands. On the contrary, in the FDS scheme, an evaluation of whether a specific band is good or bad is not performed, and, provided that a frequency separation is maintained capable of adequately obtaining a diversity, there is no need to select and transmit in a specific frequency band Consequently, it is advantageous for an improvement in the entire system performance to preferably perform the selective frequency planning of the FSS scheme when it is planned.

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 LVRB. In this situation, assuming that Nprb PRB are present in a subframe and 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 which of the LVRBs to through which the downlink data will be transmitted or from which of the LVRBs through which the uplink data will be transmitted. That is, each bit of the NLVRB-bit bitmap information, which is transmitted to each terminal as planning information, indicates whether the data will be transmitted or can be transmitted through an LVRB corresponding to this bit, among the Nlvrb LVRB. This scheme is inconvenient in that, when the number of Nlvrb becomes larger, the number of bits to be transmitted to each terminal becomes larger in proportion to it.

On the other hand, assuming 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 referred to as a "compact scheme" herein.

Figure 10 illustrates an example of a method for allocating resource blocks by this compact scheme.

In this case, as shown in Figure 10, the length of the available RBs is different depending on the respective starting points, and the number of combinations of RB assignments is Nlvrb (Nlvrb + 1) / 2 at the end. Consequently, the number of bits required for the combinations is ceiling (log2 (NLVRB (NLVRB + 1) / 2). In this case, ceiling (x) means rounding "x" up to the nearest integer. This method is advantageous over the bitmap scheme because the number of bits does not increase significantly with the increase in the number Nlvrb.

On the other hand, for a method to notify a user equipment (UE) of the DVRB assignment, it is necessary to previously promise 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, assuming that the number of bits for DVRB signaling is set to be equal to the number of bits in the LVRB transmission of the above-mentioned compact scheme, it is possible to simplify a signaling bit format in a downlink. As a result, there are advantages in that the same channel coding can be used, etc.

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

Figure 11 illustrates an example of a method for mapping two DVRBs having consecutive indices to a plurality of contiguous PRBs.

As shown in Figure 11, in the event that a plurality of DVRBs having consecutive indices to a contiguous plurality of PRBs are mapped, the first divided parts 1101 and 1102 and second divided parts 1103 and 1104 are separated from each other by a gap 1105, while the divided parts belonging to each of the upper and lower divided parts are contiguous with each other, so that the

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

Diversity order becomes 2.

Figure 12 illustrates an example of a method for mapping two DVRBs having consecutive indices to a plurality of separate PRBs. In the present application, "separate PRBs" means that the PRBs are not adjacent to each other.

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

In this situation, the value of the gap indicative of the relative position difference between the divided parts can be expressed in two ways. First, the value of the gap can be expressed by a difference between the DVRB indices. Second, the value of the gap can be expressed by a difference between the PRB indices to which a DVRB is mapped. In the case of Figure 12, Hollow = 1 in the first form, while Hollow = 3 in the second form. Figure 12 shows the last case 1203. Meanwhile, if the total number of RB in the system is changed, the arrangement of DVRB indices can be changed accordingly. In this case, the use of a second form has the advantage of capturing a physical distance between the divided parts.

Figure 13 illustrates the case in which a DVRB is assigned to a UE under the same rules as those in Figure 12.

As can be seen in Figure 13, the order of diversity increases to 7. However, when the order of diversity increases, the diversity gain converges. The result of existing studies represents that the increase in diversity gain is insignificant when the order of diversity is approximately 4 or more. Unmapped parts of PRB 1301, 1302, 1303, 1304 and 1305 can be assigned and mapped to other UEs using DVRB, however, unmapped parts cannot be assigned and mapped to other UEs using LVRB. Therefore, when there are no other UEs using DVRB, there is a disadvantage because the unmapped parts of PRB 1301, 1302, 1303, 1304 and 1305 cannot help by being left empty, unused. In addition, the distributed provision of DVRBs breaks the consecutiveness 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 an appropriate level to carry out the distributed allocation.

A first embodiment and second embodiment of the present invention are directed to methods for establishing a relative distance between divided parts of a DVRB mapped to about PRB at 0. In these embodiments, with a scheme for mapping separate DVBB indices consecutive to PRB, when a plurality of DVRBs are assigned to a UE, the respective divided parts of each of the DVRBs can be assigned 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, thus 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. In this case, the "distributed mode" refers to a mode in which the gap between the divided DVRB parts is not 0, and the "undistributed mode" refers to a mode in which the gap between the parts of DVRB divided is 0.

It is assumed 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.

Conversely, when M is greater than or equal to the reference value (= Mth), the divided parts are assigned to the same PRB, not distributively assigned. This allocation of the divided parts to the same PRB can reduce the number of the PRBs to which the DVRBs are mapped, thus limiting the order of diversity.

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

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

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

Figure 14 illustrates an example of a resource block mapping method in the case where Gap = 0, according to embodiment 1.

<Completion 2>

This embodiment is directed to a method for switching split parts to a distributed / non-distributed mode using a control signal. In this case, the "distributed mode" refers to a mode in which the gap between the divided DVRB parts is not 0, and the "undistributed mode" refers to a mode in which the gap 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 mapped to the same PRB to decrease the order of diversity.

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

For example, in the case where the control signal indicates that Hue = 3, the divided DVRB parts are mapped distributively as shown in Figure 12 or 13. Also, in the case where the control signal indicates that Gap = 0, the divided DVRB parts are mapped to the same PRB as shown in Figure 14.

As previously stated, in order to freely plan the PRB Nprb number in the system based on PRBs, it is necessary to transmit a Nprb bitmap to each UE to be planned. When the PRB Nprb number in the system is large, the control information overload is increased for the Nprb bitmap transmission. Therefore, a method for the reduction of a planning unit or the division of the entire band and the realization after transmission in different planning units into only some bands should be considered.

In the 3GPP LTE, a bitmap configuration scheme has been proposed taking into account the overhead when the bitmap is transmitted as set forth above.

Figure 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 being transmitted, namely, a bitmap scheme, by indicating a scheme of bits signaling.

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 mapped into units of a group. That is, a plurality of the RBs that constitute a group have mapping association. When the group size is larger, it is difficult to carry out the allocation of resources in detail, but it is possible to reduce the number of bits in a bitmap. With reference to Figure 15, because Nprb = 32, a bitmap of a total of 32 bits is required for the allocation of resources of an RB unit. However, assuming that three RBs are grouped (P = 3) and resources are allocated based on a group of RB (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 they cannot be allocated in detail.

To complete this, the subset scheme is used. In this scheme, a plurality of RBG is established as a subset, and resources are allocated based on the RBs within each subset. In order to use the 11-bit bitmap in the above-mentioned RBG scheme in Figure 15, it is possible to configure "3" subsets (subset 1, subset 2 and subset 3). In this case, "3" is the number of the RBs that constitute each previously established RBG. As a result, Nrb / P = ceiling (32/3) = 11, so that the RB in each subset can be assigned based on the RB with 11 bits. In this case, header information 1501 is required to indicate which of the RBG schemes 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

60

65

Assuming that header information 1501 only indicates which one is used between the RBG scheme and the subset scheme and some bits of the bitmap used for the RBG are used to indicate the type of subset, not all RBs can be used at all The subsets. For example, with reference to Figure 15, because a total of three subsets is established, a 2-bit subset indicator 1503 is required to identify the subsets. In this situation, a total of 12 RBs are assigned to subset 1 1504 or 1505, and only 9 bits are left on 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 twelve RBs with 9 bits. To solve this, a bit of the RBG bitmap can be assigned as a shift 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, RB18 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. Accordingly, it can be seen that eight RBs can be mapped into units of a RB with respect to each combination of subset indicator 1503 and displacement indicator 1506. Also, with reference to Figure 15, in the present embodiment, the RB numbers assigned to subset 1, subset 2 and subset 3 are 12, 11 and 9 that are different respectively. Accordingly, 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). Figure 15 is but an illustration, and the present embodiment is therefore not limited thereto.

The use of a bitmap scheme combination using the RBG scheme and the subset scheme and the compact scheme can be considered.

Figure 16 shows an example of a method for mapping based on a combination of the bitmap scheme and the compact scheme.

In the case where DVRBs are mapped and transmitted as shown in Figure 16, some resource elements of a rBg0, RBG1, RBG2 and RBG4 are filled with 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. In this situation, it is possible to assign RBG0, RBG1, RBG2 and RBG4 to UEs in the RBG scheme. Also, the RBs (PRB0, PRB4, PRB8 and PRB12) in the RBGs left after being assigned as DVRBs must be assigned to UEs in the subset scheme. However, because a UE assigned in the subset scheme can have only one RB assigned in a subset, the remaining RBs that belong to other subsets cannot help by being assigned to different UEs. As a result, LVRB planning is restricted by DVRB planning.

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

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

<Accomplishment 3>

Embodiment 3 is directed to a method for, when mapping split parts of DVRB, mapping the divided parts to RB that belong to a specific subset and then mapping the divided parts to RB that belong to other subsets after mapping the divided parts to all the RB of the specific subset.

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

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

DVRB0 to DVRB11 are mapped distributively within a subset 1 (1703), DVRB12 to DVRB22 are then mapped distributively within a subset 2 (1704), and DVRB23 to DVRB31 are then mapped distributively into a subset 3 ( 1705). This mapping 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 the operation scheme of the block interleaver.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

<Completion 4>

Embodiment 4 is directed to a method for limiting the mapping of parts of a split DVRB to PRBs included in the same subset.

In embodiment 4, the gap information can be used to map divided parts to the same DVRB within the same subset. In this situation, a parameter can be used for all PRBs, such as the "Gap" mentioned above. Alternatively, another parameter can be used for a subset, "Huecosubconjunto". This will be described later in detail.

It is possible to use together a method to distributively fill consecutive DVRBs within a subset and a method to map divided parts of each DVRB within the same subset. In this case, preferably, Huecosubconjunto, which means the difference between PRB numbers within the same subset, can be used as information indicative of a relative position difference between parts of the divided DVRB. The meaning of Huecosubconjunto can be understood from Figure 17. The PRBs included in subset 1 are PRB0, PRB1, PRB2, PRB9, PRB10, PRB11, PRB18, PRB19, PRB20, PRB27, PRB28 and PRB29. In this case, PRB18 is separated from PRB0 within subset 1 by 6 indices (Huecosubconjunto = 6). On the other hand, with respect to all PRBs, the PRB18 can be indicated to be separated from the PRB0 by 18 indices (Gap = 18).

<Completion 5>

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

The limited establishment of a gap to a multiple of the size of an RBG as in the present embodiment provides features as follows. 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 the RBG.

For example, with reference to Figure 15, it can be seen that P = 3 and P2 = 9. In this case, 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 Huecosubconjunto = 6, and a multiple of P2 (= 9) because Hueco = 18.

In the case where a scheme based on this embodiment is used, due to the probability that only some of the RBG resource elements in which each of those used belong to the same subset is high, it is expected that RB resource elements left unused are presented in the same subset. Therefore, it is possible to efficiently use the subset scheme assignment.

With reference to Figure 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 the DVRB index, the RBG10 cannot be used for DVRBs. Also, with reference to Figures 17 and 18, a total of four RBGs including a RBG9 belong to subset 1, a total of three RBGs, if RBG10 is excluded, they belong to subset 2, and a total of three RBGs belong to the subset. 3. In this case, for the convenience of the provision of DVRB indices, the RBG9, among the four RBGs belonging to subset 1, can be used for DVRBs. Thus, a total of three RBGs can be used for DVRBs.

In this case, the DVRB indices can be mapped sequentially to a subset (for example, subset 1) used for DVRBs from among the subsets, as shown in Figure 18. If the DVRB indices can no longer be mapped to a subset, they can be mapped to a next subset (for example, subset 2).

On the other hand, it can be seen that the DVRB indices are arranged consecutively in Figure 11, but are not arranged consecutively in Figures 12, 13, 14, 16, 17 and 18. In this way, the DVRB indices can be changed in arrangement before being mapped to 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, in accordance with an embodiment of the present invention.

In detail, in a method for mapping non-contiguous, distributed consecutive DVRB indices to PRBs, a method is proposed that uses a block interleaver and configures the interleaver so that it has a degree equal to an order of objective diversity NOrdenDiv. The interleaver grade can be defined as follows.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

That is, in a block interleaver that has m rows and n columns, when writing a data, the data is written while the index of it is increased sequentially. In this situation, the writing is done in such a way that, after a column is completely filled, a column index is increased by one and a next column is filled. In each column, writing is done while increasing a row index. For reading from the interleaver, the reading is performed in such a way that, after a row is completely read, a row index is increased by one and a row is read next. In this case, the interleaver can be referred to as an m-grade interleaver.

Conversely, in a block interleaver having m rows and n columns, data writing can be performed in such a way that, after a row is filled, the process proceeds to a next row, and data reading can be performed. such that, after a column is read, the process continues to a next column. In this case, the interleaver can be referred to as an interleaver of degree n.

In detail NordenDiv limits a multiple of Nd. That is, NordenDiv = KNd. In this case, K is a positive integer. Also, a block interleaver of a DNordenDiv grade is used.

Figure 19 is an illustration of when the number of RBs used in the interleaving is Ndvrb = 24 and Nd = 2 and

NordenDiv = 2x3 = 6.

With reference to Figure 19, for writing in an interleaver, the data is written while the index thereof increases sequentially. In this situation, the writing is done in such a way that, after a column is completely filled, a column index is increased by one and a next column is filled. In a column, writing is performed while increasing a row index. For reading from the interleaver, the reading is performed in such a way that, after a row is completely read, a row index is increased by one and a next row is read. In a row, the reading is done while increasing a column index. In the case where the reading / writing is done in this way, the interleaver grade is the number of rows, which is set in an order of objective diversity, 6.

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

For example, in Figure 19, Ndvrb / Nd = Ndvrb (= 24) / Nd (= 2) = 24/2 = 12, and K = 3. It can also be seen in Figure 19 that the order of indices of DVRB 1901 of the sequence of data produced 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 data sequence obtained by cyclically moving the data sequence produced by Ndvrb / Nd = 12 is given 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 Figure 19, for example, it can be seen that a DVRB0 and a DVRB3 are paired. It can also be seen that respective combinations of split parts generated from DVRB0 and DVRB3 are mapped 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 to which the DVRBs are mapped.

<Completion 7>

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

From the description that follows, the number of nulls filled in the interleaver can be represented by "Null".

According to embodiment 6, it is possible to completely fill in 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 of Ndvrb / Nd, Ndvrb should be a multiple of Nd. To completely fill in the data in a rectangular interleaver, Ndvrb should be a multiple of NordenDiv. However, when K> 1, Ndvrb cannot 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 the numbers are then filled in the remaining gaps of the block interleaver. Subsequently, the reading is done. If the data is filled column by

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

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, a reading for nulls is not performed.

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

With reference to Figure 20a, the index difference between the 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. Consequently, it can be seen that the index difference between paired DVRBs is not fixed at a certain value. For this reason, DVRB planning becomes complicated, compared to the case where the index difference between paired DVRBs has a fixed value.

Meanwhile, if it is assumed that NR this represents a remainder when Ndvrb is divided by NordenDiv, the nulls are filled in elements of the last column, except for the elements corresponding to the NR values, as shown in Figure 20a or 20b. For example, with reference to Figure 20a, the nulls can be filled in two elements of the last column, except for the four elements corresponding to four values, because the rest when Ndvrb (= 22) is divided by NordenDiv (= 6 ) is 4 (NResto = 4). Although nulls are filled back in the previous example, they can be positioned before a first index value. For example, NRsto values are filled in elements, starting from a first element. Also, the nulls can be arranged in predetermined positions, respectively.

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

In this embodiment, when nulls are to be filled in a rectangular block interleaver, the NordenDiv corresponding to the grade 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 Figure 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. Thus, nulls are written distributively.

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

As a result, the difference between paired DVRB indices can be maintained to be K or less (for example, K = 3). Consequently, there is an advantage 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 mapped to PRB in 0 according to an embodiment of the present invention will be described.

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

In the meantime, even if M DVRB is assigned to a UE in a scheme for mapping non-contiguous, distributed consecutive DVRB indices to PRBs, a reference Mth value can be set for M. Based on the Mth reference value, 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, to which DVRBs are mapped distributively, and therefore to 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, to which the DVRBs are mapped, and therefore to limit the order of diversity.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

That is, in this scheme, the DVRB indices of a sequence of data produced from the interleaver apply, in common, to all the divided parts of each DVRB so that they are mapped to the PRBs, as shown in Figure 22. For example, with reference to Figure 9, the DVRB indices of a sequence of data produced 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 2001 and 2002 of each DVRB.

<Accomplishment 9>

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

Figure 23 illustrates the case in which a UE1, which is subject to a planning in a respective split-part mapping scheme of each DVRB to different PRBs, is shown in Figure 19, and a UE2, which is subjected to a Planning in a mapping scheme of the divided parts of each DVRB to the same PRB, as shown in Figure 22, is multiplexed simultaneously. That is, Figure 23 illustrates the case in which UE1 and UE2 are planned simultaneously according to the methods of embodiments 6 and 8, respectively.

For example, with reference to Figure 23, a DVRB0, DVRB1, DVRB2, DVRB3, and DVRB4 (2301) are assigned to UE1, while UE2 is assigned a DVRB6, DVRB7, DVRB8, DVRB9, DVRB10, and DVRB11 (2302 ). However, UE1 is planned in such a way that the divided parts of each DVRB are mapped to different PRBs, respectively, while UE2 is planned such that the divided parts of each DVRB are mapped to 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 Figure 23 In this case, however, the PRB8 and PRB20 are partially used.

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

<Completion 10>

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

With reference again to Figure 20, it can be seen that the difference between the paired DVRB indices for PRB may not be fixed at a specific value. To reduce the difference in DVRB indices to a specific value or less, the method of Figure 21 can be used as described above.

When the method of Figure 21 is used to distribute nulls, the interleaver complexity is increased due to the processing of the modules. To prevent such a phenomenon, a method for limiting Ndvrb can be considered so that no nulls are generated.

In the illustrated interleaver, the number of RBs used for DVRBs, namely, Ndvrb, is limited to a multiple of the order of diversity, namely, 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 RBs used for DVRB, specifically, 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.

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

With reference to the description that follows and to figure 24, the parameters used in the mathematical expressions can be understood.

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

p1, d: Index of a first slot of a PRB to which a given DVRB index d is mapped p2, d: Index of a second slot of a PRB to which a given DVRB index d is mapped

10

fifteen

twenty

25

30

35

40

Four. Five

dpi: DVRB index included in a first slot of a given PRB p-index dp2. DVRB index included in a second slot 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 Ndvrb: Number of RBs used for DVRBs

R = l Ndvrb / C ~ \

Nprb: Number of PRBs in the system bandwidth.

Figure 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 PRB and DVRB indices can be deduced using expressions 1 to 3. First, if a PRB p index is given, it can be deduced in DVRB index using the expression 1 or 2. In the description that follows, “mod (x, y)” means “x mod y”, and “mod” means a module operation. Also, "L _ |" means a descent operation, and represents the largest of the integers equal to or smaller than the number indicated in "L _" on the other hand, 'í \ "means an ascent operation, and represents the smaller of the integers equal to or greater than a number indicated in 'í \ ”. Also, "rounding ()" represents an integer closer to a number indicated in "()". "Min (x, y)" means the value that is not the largest of x and y, while "max (x, y)" represents the value that is not the smallest of x and y.

[Expression 1]

dpi = mod (p, R) -C + lp / R¡ dp2 = mod (//, R) - C + \ _p '/ R]

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

[Expression 2]

dpi = mod (/ ?, R) ■ C + \ _p / RJ

f dp¡ - 2, when mod (¿// Ji, C)> 2 Pl \ dPi + 2, when mod (dpt, C) <2

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

[Expression 3]

px d - mod (¿/, C) -R + \ _d ÍC]

Pu = mod (pu + Ndvrb / 2, N DVRB)

applies to the case in figures 20a and

DVRB index

using Expression 4.

Figure 25b illustrates a general method for filling nulls in an interleaver. This method is that K = 2, Nd = 2, and Ndvrb is a multiple of Nd. The method of Figure 25b is similar to the method of 20b.

According to the method of Figure 25b, if a p-PRB index is given, a

5

10

fifteen

twenty

25

30

35

40

Four. Five

[Expression 4]

d = mod (//, R) C + \ _p '/ i? j

in which p

p +1

, when mod (iV;, when mod (iV

RB

, C) ^ O and p> 3R-l, C) = 0 or p <3R-l

dpi = mod (pr, R) C + \ _p "/ R J

in which

in which p '' '= mod (p +

Pu

, when mod (A ^ g, C) 0 and pm> 3R-, when mod (N'rb, C) = O or pm <3R -1

Ndvrb / 2, Ndvrb)

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

[Expression 5]

[P \, d ~ 1, when mod (NfRB.C) * 0 and mod (<i, C) = 3 [PUd, when mod {N'm, C) = 0 or mod (¿/, C) ^ 3

where p'i, d = mod (d, C) ■ R + Ld / Cj

p2M = mod (pu + Ndvrb 12, iVDWM)

<Embodiment 11>

Figure 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.

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

[Expression 6]

dpt = mod (p ', R) ■ C + \ j> I /? J

p +1, when mod (NDVKB, C) * 0 and p> 2R-l and p * 3R-l

2R-Í, when mod {NDVRB, C) ^ 0 and p = 3R-2 P, when modCiV ^^ C) = 0 or p <2R- \

in which p

dpi = mod {p ", R) - C + [_pff / i? J

i »

in which p

pm + 1, when mod (iVDvra, C) ^ 0 and pm> 2R- \ and pm / 3 A ’- 2

2R - \, when mod (N DVRB, C) ^ 0 and pm = 3R-2

P, when mod (NDVRB, C) - 0 or pm <2R- \

in which p '' '= mod (p + Ndvrb / 2, Ndvrb)

[Expression 7]

d = mod (p ', R) -C + lp' / R]

5

10

fifteen

twenty

25

30

35

40

in which

P

p + \, when Vñoá (Novm, C) ^ 0 and p> 2R- \

2R-1, when mod (NDVRB, C) ^ 0 and p = 3R-2

P, when mo {N DVRB, C) = 0 or p <2R - \

_ 2, when mod (í /; i, C)> 2

and p # 3R - 2

¿L +2, when moá (d¡h, C) <2 and d

'DVRB

M -1

^ n DVRB 1

N

DVRB

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

■ N i ~

p, * 'DVRB ^

{NDVrb ~ 2 _when mod (d „, C) <2 and d = NDVRB -1

On the other hand, in the method of Figure 25c, if a d-index of DVRB is given, a PRB index can be deduced using the expression 8.

[Expression 8]

Pu

p'Xi- \, when mo {N DVRB, C) 0 and mod (<i, C)> 2

'DVRB

3R-2, when moá (NDVRB, C) = £ 0 and d = N Pi4, when moá {N DVRB, C) = 0

where p'i, d = mod (d, C) ■ R + Ld / Cj

P2, d = moá {Pud + N DVRB f NDVRB)

<Embodiment 12>

one

(mod (d, C) <2 and d ^ N,

i)

Figure 25d illustrates a method implemented using the method of embodiment 7 and Figures 21a and 21b when K = 2, Nd = 2, and the interleaver size (= C x R) is set so that C ■ R = Ndvrb + Nnuo. In this case, “Nnuid represents the number of nulls to be included in the interleaver. This Nnuo value can be a default value. According to this method, if a p-index of DVRB is given, a DVRB index can be deduced using Expression 9 or 10.

in which

in which

[Expression 9]

dpi = mod (p ', R) C + \ _p'IR \

p, when Null = 0 or P <R-Rmio12 or R <p <2R-Nnul0 / 2

p + NnuJ2, when Null * 0 and (2R - Nnul0! 2 <p <3R - Nnul0 or P> 3R-NnulJ2)

dn = mod (p ', 2R) -C / 2 + \ _p' / 2i? J / ÍP + R-Nnu, or / 2> when Null * 0 and R - Null / 2 <p <R

[p + R

, when Nnul0 * 0 and 3 R- Nxulo <p <3R- Nnu¡012 [Expression 10]

d = mod (//, R) ■ C + \ _p * I R \

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

in which

in which

p ", when Null = 0 or pm <R-Null12 or R <pm <2R - Null / 2

P ~ + NnuJ2, when Null * 0 and {2R-NnulJ2 <p ”<2R-Nnul0 or pm> 3R - Nnul0 / 2)

= mod {p \ 2R) -C / 2 + lp "/ 2R]

pm + R- Nnuto / 2, when N nuto * 0 j R-N nutJ2 <pm <R

, P + R, when Nmh * 0 j 3R-Nnuh <p <3R-Null / 2

in which p "'= mod (p + N’rb / 2, N'rb)

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

[Expression 11]

image 1

in which, p'1, d = mod (d, C) ■ R + Ld / Cj

_IP, d-R + N „uio / 2, when Null * 0 and (d> N

Pl’d \ p [d - R, when Null * 0 and (d> N¡

in which, p'1, d = mod (d, C / 2) ■ 2R + L2d / Cj

-N

Null DVRB

- AT

DVRB 1 v Jimmy

j mod (rf, C / 2) = 0) j mod (á, C / 2) = 1)

P:

2 d

mo

i d (pu + N DVRB! ^ DVRB)

With reference again to the description given with reference to Figure 15, the case can be considered, in which a combination of bitmap scheme using the RBG scheme and subset scheme and the compact scheme is used. The problems that possibly occur in this case will be described with reference to Figures 26 and 27.

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

As shown in Figure 26, each DVRB can be divided into two parts, and a second of the divided parts can be cyclically moved in a predetermined gap (Gap = Ndvrb / Nd = 50/2). In this case, only a part of the resource elements of an RBG0 consisting of PRBs are mapped to the first divided part of DVRB, and only parts of the resource elements of RBG8 and RBG9 in which each consists of some PRBs are mapped by the second split part of DVRB. For this reason, RBG0, RBG8 and RBG9 cannot be applied to a scheme that uses a resource allocation based on RBG.

To solve this problem, the gap can be set to be a multiple of the number of the RBs included in an RBG, namely, Mrbg. That is, the gap can satisfy a condition "Gap = MRBG * k" (k is a natural number). When the gap is set to satisfy this condition, it can have a value of, for example, 27 (Gap = MRBG * k = 3 * 9 = 27). When Gap = 27, each DVRB can be divided into two parts, and a second of the split parts can cycle through the gap (Gap = 27). In this case, only a part of the resource elements of the RBG0, which consist of PRBs, are mapped to the first divided part of DVRB, and only a part of the resource elements of RBG9, which consist of some PRBs, are map by the split second part of DVRB. Consequently, in the method of Figure 27, RBG8 can be applied to a scheme that uses a resource allocation based on RBG, different from the method of Figure 26.

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

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

In the case of Figure 26 or 27, in the DVRB1 and DVRB2 the PRB1, PRB2, PRB25 and PRB26 are mapped. In this case, part of the resource elements of PRB1, PRB2, PRB25, and PRB26 are left unmapped.

In the case of Figure 26, if the DVRB25 and DVRB26 are additionally mapped to PRBs, they completely fill in the remaining gaps of pRb1, PRB2, PRB25, and PRB26.

In the case of Figure 27, however, if the DVRB25 and DVRB26 are additionally mapped to PRBs, the DVRB25 and DVRB26 are mapped to PRB0, PRB25, PRB26, and PRB49. As a result, the parts of unmapped resource elements of the PRB1 and PRB2 are still not filled in with the DVRBs. That is, in the case of Figure 27 it has a drawback that, normally, there are PRBs left without being mapped.

The problem occurs because the cyclic shift is performed so that a gap 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>

To simultaneously solve the problems of Figures 26 and 27, accordingly, the number of RBs used for DVRBs, namely, 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. To make the two divided parts of each DVRB belong to the same subset, the gap must be set 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, namely, Ndvrb, is limited to a multiple of NdMrbg2, to make the two divided parts of each DVRB belong to the same subset, and to make the DVRBs match.

Figure 28 illustrates the case in which Ndvrb is set to be a multiple of NdMrbg.

As shown in Figure 28, the divided parts of the DVRB can always be paired in PRBs according to a cyclic shift because the gap is a multiple of MrbgNd. It is also possible to reduce the number of RBGs in which the resource elements have parts not filled with DVRB.

<Completion 15>

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

When DVRB indices are interleaved as shown in Figure 29, it is possible to set Ndvrb to a multiple of NdMrbg when DVRB indices are mapped to PRBs. In this case, however, there may be an occasion when the matrix of the rectangular interleaver is incompletely filled with the DVRB indices, as shown in Figures 20a and 20b. In this case, consequently, it is necessary to fill in nulls in unfilled parts of the matrix of the rectangular interleaver. To avoid the time when null refilling is required 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 gap is set to be a multiple of Mrbg, and the second divided part of each DVRB is cyclically moved in Nrb / Nd so that the DVRB indices mapped to a PRB are paired Also, to avoid filling in nulls in the block interleaver, the number of RBs used for DVRBs, specifically, Ndvrb, is limited to a common multiple of NdMrbg 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 NdMrbg and KNd.

<Completion 16>

In another embodiment of the present invention, the gap is set to be a multiple of Mrbg's square, so that the two divided parts of each DVRB are located in the same subset. Also, the second split part of each DVRB is cyclically shifted in Nrb / Nd so that the DVRB indices mapped to a PRB are paired. To avoid filling nulls in the block interleaver, the number of RBs used for DVRBs, namely Ndvrb, is limited to a common multiple of NdMrbg2 and D. If D is set in the order of diversity (NordenDiv = KNd ) used in the interleaver in this case, Ndvrb is limited to a common multiple of NdMrbg2 and KNd.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

<Completion 17>

On the other hand, Figure 30 illustrates the case in which D is set in the number of columns, namely, C, and C is set to NOrdenDiv (NOrdenDiv = K-Nd).

Naturally, in the case of Figure 30, the writing is done in such a way that, after a column is completely filled in, a next column is filled in, and the reading is done in such a way that, after it is completely read one row, read a next row.

In the embodiment of Figure 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, specifically, Ndvrb, is limited to a multiple of D-Mrbg2.

To map the two divided parts of each DVRB to the PRBs in the same subset, the number of the RBs used for the DVRBs, namely, Ndvrb, is limited to a common multiple of D-Mrbg2 and Nd-Mrbg2. When D = K-Nd, Ndvrb is limited to K-NdMrbg2 because the common multiple of K-NdMrbg2 and NdMrbg2 is K-Nd-Mrbg2.

Finally, the number of RBs used for DVRBs can be a maximum number of DVRBs that satisfy the limitations described above within the number of PRBs in the entire system. The RBs used for DVRBs can be used in an interleaved form.

<Completion 18>

Hereinafter in the present description, a mapping method using temporary PRB indices will be described when Nprb and Ndvrb have different lengths in accordance with an embodiment of the present invention.

Figure 31 illustrates methods in which, when Nprb and Ndvrb have different lengths, the result of the PRB mapping using the DVRB interleaver of Figure 29 is processed once again to make the DVRBs finally correspond to the PRBs.

One of the schemes shown by (a), (b), (c), and (d) of Figure 31 can be selected according to the use of system resources. In this scheme, the p-value in the previously described correlational expressions of the DVRB and PRB indices are defined as a temporary PRB index. In this case, a value or obtained after the addition of Ndesviac to p that exceeds Numbrai is used as a final PRB index.

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

[Expression 12]

 (to):

 N -N / 2 iV threshold iV DVRB 1 ^ ’N = deviation N -N iV PRB 1 v DVRB

 (b):

 N = 0 ’threshold 9 N deviation = 0

 (C):

 N = 0 N deviation = M - iV PRB N iV DVRB

 (d):

 N = 0 ’threshold’ N deviation = R ^ ™ ~~ ^ DVRB) ^ ^ J

 ^ deviation R ^ PflB

 _ NDVRB)! 2 \

In this case, (a) represents a justified alignment, (b) represents a left alignment, (c) represents a right alignment, and (d) represents a centered alignment. On the other hand, if an index or PRB is given, a DVRB index d can be deduced from Expression 13, using the temporary PRB index p.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

[Expression 13]

image2

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

[Expression 14]

ÍPu + Naesv, ac, when PUd> Numbral \ Pi.d, when pu <Numbral

<Completion 19>

Hereinafter, a mapping method capable of increasing Ndvrb to a maximum while satisfying the gap limitations in accordance with an embodiment of the present invention will be described.

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

However, since the limitation condition caused by Mrbg becomes more stringent, the limitation of the number of RBs usable for DVRBs, specifically, Ndvrb, among the total number of PRBs, namely, Nprb, is increased.

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

When Ndvrb, it is set to be a multiple of NdMrbg2 (= 18), to allow the two divided parts of each DVRB to be mapped to the pRb that belong to the same subset, while having a maximum value that does not exceed Nprb, the Ndvrb set is equal to 18 (Ndvrb = 18).

To allow the two divided parts of each DVRB to be mapped to the PRBs belonging to the same subset in the case of Figure 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 Nhueco is 9 (Nhueco = 18/2 = 9), and the DVRB0 is mapped to the first respective RB of the RBG0 and RBG3 that belong to the same subset.

Accordingly, the present invention proposes a method for satisfying the boundary constraint conditions when Nd = 2 by establishing a deviation and a threshold value, to which the deviation can be applied, as previously proposed, without directly reflecting the boundary limitation conditions on Ndvrb.

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

2) Next, a number closer to Nprb / 2 is established from among the numbers that satisfy the gap limitation conditions, such as the Nhueco.

3) When Nhueco is smaller than Nprb / 2, the same mapping is used as in Figure 20.

4) When Nhueco is equal to or greater than Nprb / 2, and null refilling is allowed in the interleaver, Ndvrb is established in such a way that Ndvrb = (Nprb - Nhueco) 2. However, when refilling is not allowed nulls in the interleaver, Ndvrb is set so that

NDVRB = I_niin (./ VWJB - Nhueco ’Nhueco) • 2 / cj - C.

5) A deviation is applied to one half or more of Ndvrb. That is, a reference value is established for the application of the deviation, namely Numbral, so that

N = N / 2

1 Y threshold 1 v DVRB 1 ^ •

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

6) The deviation is established so that the temporary PRBs, to which the deviation is applied, satisfy the conditions of limitation of the gap.

That is, Ndesviac is set so that Ndesviac = Nhueco - Numbral.

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

[Expression 15]

1. Fixing of Nhueco according to the conditions for hollow:

Under a multiple Mrbg2 condition:

Nhueco = rounding (NpRB / (2 ■ Mrbg2)) ■ Mrbg2 Under a multiple Mrbg condition:

Nhueco = rounding (NpRB / (2 ■ Mrbg)) ■ Mrbg

2. Ndvrb fixation:

Under a condition of nulls allowed:

Ndvrb = min (NpRB - Nhueco, Nhueco) ■ 2 Under a condition of no nulls allowed:

Ndvrb = Lmin (NpRB - Nh ueco, Nhueco) ■ 2 / Cj- C

3. Numbral Setting: Numbral = NDVRB / 2

4. Ndesviac fixation: Ndesviac = Nhueco - Numbral

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

When Nhueco is set to be a multiple of Mrbg2 (= 9) while it is closer to Nprb / 2, to map the two divided parts of each DVRB to PRBs that belong to the same subset, respectively, the fixed Nhueco = 18 (Nhueco = 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 "Ndesviac = 18-14 = 4" are established. Consequently, the temporal PRB indices, to which the DVRB indices interspersed by the rectangular interleaver are mapped, are compared with Numbral. When Ndesviac is added to the temporary PRB indices that satisfy Numbrai, a result is obtained as shown in Figure 33. With reference to Figure 33, it can be seen that the two divided parts of DVRB are mapped to the first respective RBs of the RBG0 and RBG6 that belong to the same subset. When this method is compared with the method of Figure 32, it can also be seen that the number of RBs usable for DVRB increases from 18 to 28. Since the gap is also increased, the diversity of DVRB mapping can be further increased.

<Completion 20>

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

When several DVRBs are assigned to a UE, the assigned DVRBs are consecutive DVRBs. In this case, therefore, it is preferable to set contiguous indexes so that they are positioned at intervals of a multiple of Mrbg or a multiple of Mrbg2, for planning of the LVRB, similar to the fixing of the gap. When it is assumed, in this case, that the grade of the interleaver is equal to the number of columns, namely, C, the number of rows, namely, R, should be a multiple of Mrbg or a multiple of Mrbg2. Consequently, the size of the interleaver, specifically Nntercator = C R, should be a multiple of CMrbg or a multiple of CMrbg2.

Thus, if Ndvrb is previously given, a minimum interleaver size that satisfies the above conditions can be deduced as follows.

Under no multiple condition, Nntercaiador = [Ndvrb / C ~ \ -C.

In this case, consequently, R = Nintercaiador / C = f Ndvrb / C \.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

Under the condition of multiple CMrbg, Nintercaiador = \ Ndvrb / (C-Mrbg) 1-C-Mrbg.

In this case, therefore, R = Nntercaiador / C = \ Ndvrb / (CMrbg) 1Mrbg.

Under the condition of multiple CMrbg2, Nintercalator = \ Ndvrb / (CMrbg2) 1cMrbg2.

In this case, therefore, R = Nntercaiador / C = \ Ndvrb / (C- Mrbg2) 1- Mrbg2.

The number of nulls included in the interleaver is as follows.

Under no multiple condition,

Null = Nintercalator - NdVRB = \ NdVRb / C1 ■ C - NdVRB.

Under the condition of multiple CMrbg,

Null = Nintercalator - NdVRB = \ NdVRb / (C ■ Mrbg) 1 ■ C-Mrbg —NdVRB. Under the condition of multiple CMrbg2,

Null = Nintercalator - NdVRB = \ NdVRb / (C-MrbG2) 1 CMrbg2 —NdVRB.

The exemplary embodiments described herein above are combinations of elements and features of the present invention. The 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. Additionally, the embodiments of the present invention can be constructed by combining parts of the elements and / or features. The operating orders described in the embodiments of the present invention can be rearranged. Some constructions of any one of the embodiments may be included in another embodiment and may be substituted with corresponding constructions of another embodiment. It is clear that the present invention can be realized by a combination of claims that do not have an explicitly cited relationship in the appended claims or may include new claims by modification upon request.

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

In a firmware 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 controlled by a processor. The memory unit is located inside or outside the processor and can transmit data to, and receive data from, the processor through various known means.

[Industrial Applicability]

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

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of the present invention provided they fall within the scope of the appended claims and their equivalents.

Claims (9)

5 10 fifteen twenty 25 30 35 40 Four. Five fifty 55 60 65 1. A method for transmitting downlink data using resource blocks distributively mapping virtual resource blocks, VRB, consecutively assigned to physical resource blocks, PRB, at a base station in a wireless mobile communications system, the method comprising: transmit downlink data mapped to PRBs to a user equipment, wherein the VRB indices, which are interleaved by a block interleaver, are mapped to PRB indices for a first slot and a second slot of a subframe, and the PRB indices for the second slot are shifted with with respect to the PRB indices for the first slot based on a predetermined gap; characterized by that VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, and PRB indices, which are equal to or greater than Numbral, for the first slot and the second slot of the subframe they move in an amount of Ndesviac, in which Ndesviac denotes a deviation value and Numbral denotes a threshold value for the PRB indices to which the deviation value is applied, in which 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: R = Nintercalator / C = \ NdVRB ¡(C ■ Mrbg) 1 ‘Mrbg where Ndvrb is the number of VRBs, Mrbg is a number of PRBs that constitute a group of resource blocks, RBG, Nintercalator is a size of the block interleaver, in which, when Ndvrb is smaller than Nintercalator, nulls are inserted in the last Null / 2 rows of the 2nd and 4th column of the block interleaver uniformly, in which Null is equal to a number of nulls, in which, when the VRB indexes are read from the block interleaver, the nulls are ignored, in which Ndvrb is determined as (Nprb - Nhueco) 2 in which Nhueco denotes a value of a hole default which is a multiple of a square of Mrbg, and Nprb denotes a number of the PRBs in a width system bandwidth, when Nhueco is greater than or equal to Nprb / 2, in which Ndesviac is determined as Nhueco - Numbral, and Numbral is determined as Ndvrb / 2; and in which Nhueco is determined as Nhueco = rounding (NPRB / (2MRBG2)) MRBG2, in which rounding () denotes an integer that is closest to the number inside parentheses (). 2. A method for receiving downlink data using resource blocks distributively mapping virtual resource blocks, VRB, consecutively assigned, to physical resource blocks, PRB, in a user equipment in a wireless mobile communications system, the method comprising : receive downlink control information including resource allocation information for downlink data from a base station; Y receive the downlink data mapped to the PRBs based on the downlink control information, in which the resource allocation information indicates VRB assignments for the user equipment, in which the rates of the PRBs to which the downlink data is mapped are determined based on a mapping relationship between the VRBs and the PRB, wherein the mapping ratio is defined as indexes of the VRBs that are interleaved by a block interleaver and mapped to the PRB indices for a first slot and a second slot of a subframe, and the PRB indices for the second slot moves relative to the PRB indices for the first slot based on a predetermined gap; characterized by that VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, and PRB indices, which are equal to or greater than Numbral, for the first slot and the second slot of the subframe they move in an amount of Ndesviac, in which Ndesviac denotes a deviation value and Numbral denotes a threshold value for the PRB indices to which the deviation value is applied, in which 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: R = Interleaver ¡C = [NüVRB / (C ■ Mrbg) 1 'Mrbg where Ndvrb is the number of VRBs, Mrbg is a number of PRBs that constitute a group of resource blocks, RBG, Nintercalator is a size of the block interleaver, in which, when Ndvrb is smaller than Nintercalator, nulls are inserted into the last Null / 2 rows of the 2nd and 4th column of the block interleaver evenly, in which Null equals a number of nulls, in which , when the VRB indexes are read from the block interleaver, the nulls are ignored, 5 10 fifteen twenty 25 30 35 40 Four. Five fifty 55 60 65 in which Ndvrb is determined as (Nprb - Nhueco) ■ 2 in which Nhueco denotes a predetermined gap value that is a multiple of a square of Mrbg, and Nprb denotes a number of PRBs in a system bandwidth , when Nhueco is greater than Nprb / 2, in which Ndesviac is determined as Nhueco - Numbral, and Numbral is determined as Ndvrb / 2; and in which Nhueco is determined as Nhueco = rounding (NpRB / (2MRBG2)) MRBG2, in which rounding () denotes an integer that is closest to the number inside parentheses (). 3. The method according to claim 1 or claim 2, wherein the block interleaver is composed of a number, Nd, of parts, and when nulls are inserted into the block interleaver, the nulls are inserted into Nd parts so that the nulls are evenly distributed over the Nd parts, and in which when the VRB indices are read from the block interleaver, the nulls are ignored. 4. The method according to claim 3, wherein Nd is equal to 2. 5. A base station that transmits downlink data using resource blocks distributively mapping virtual resource blocks, VRB, consecutively assigned, to physical resource blocks, PRB, in a wireless mobile communications system, the base station comprising: a processor for the control of a base station operation; and a memory unit controlled by the processor, in which the processor is configured to transmit downlink data mapped to the PRBs to a user equipment, wherein the VRB indices, which are interleaved by a block interleaver, are mapped to PRB indices for a first slot and a second slot of a subframe, and the PRB indices for the second slot are shifted with with respect to the PRB indices for the first slot based on a predetermined gap; characterized by VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, and PRB indices, which are equal to or greater than Numbral, for the first slot and the second slot of the subframe they move in an amount of Ndesviac, in which Ndesviac denotes a deviation value and Numbral denotes a threshold value for the PRB indices to which the deviation value is applied, in which 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: R = Nintercalator / C = \ NdVRB / (C • Mrbg) 1 'Mrbg where Ndvrb is the number of the VRBs, Mrbg is a number of the PRBs that constitute a group of resource blocks, RBG, Nintercaiador is a size of the block interleaver, in which, when Ndvrb is smaller than Nntercalator, nulls are inserted into the last Null / 2 rows of the 2nd and 4th column of the block interleaver evenly, in which Null equals a number of the nulls, in which , when the VRB indices are read from the block interleaver, the nulls are ignored, in which Ndvrb is determined as (Nprb - Nhueco) ■ 2 in which Nhueco denotes a predetermined gap value that is a multiple of a square of Mrbg, and Nprb denotes a number of the PRBs in a system bandwidth, when Nhueco is greater than Nprb / 2, in which Ndesviac is determined as Nhueco - Numbral, and Numbral is determined as Ndvrb / 2; and in which Nhueco is determined as Nhueco = rounding (NPRB / (2MRBG2)) MRBG2, in which rounding () denotes an integer that is closest to the number inside parentheses (). 6. The base station according to claim 5, wherein the block interleaver is composed of a number, Nd, of parts, and when nulls are inserted into the block interleaver, the nulls are inserted into Nd parts so that nulls are distributed evenly over the Nd parts, and in which when the VRB indices are read from the block interleaver, the nulls are ignored. 7. The base station according to claim 6, wherein Nd is equal to 2. 8. The base station according to claim 5, wherein when Ndvrb is smaller than Nintercalator, nulls are inserted into the last Null / 2 rows of the second and fourth columns of the block interleaver evenly, in which Null is equal to the number of nulls. 9. A user equipment for receiving downlink data using resource blocks distributively mapping virtual resource blocks, VRBs, consecutively assigned, to physical resource blocks, PRBs, in a wireless mobile communications system, the equipment comprising Username: a processor for the control of an operation of the user equipment; Y 5 10 fifteen twenty 25 30 35 a memory unit controlled by the processor, wherein the processor is configured to receive downlink control information including resource allocation information for the downlink data from a base station and to receive the downlink data mapped to the PRBs based on the control information of the downlink, in which the resource allocation information indicates VRB assignments for the user equipment, in which the rates of the PRBs to which the downlink data is mapped are determined based on a mapping relationship between the VRBs and the PRB, wherein the VRB indices, which are interleaved by a block interleaver, are mapped to the PRB indices for a first slot and a second slot of a subframe, and the PRB indices for the second slot are shifted with respect to the PRB indices for the first slot based on a predetermined gap; characterized by that VRB indices are written row by row in the block interleaver and read column by column from the block interleaver, and PRB indices, which are equal to or greater than Numbral, for the first slot and the second slot of the subframe they move in an amount of Ndesviac, in which Ndesviac denotes a deviation value and Numbral denotes a threshold value for the PRB indices to which the deviation value is applied, in which 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: R = Nintercalator / C = \ NdVRB ¡(C ■ Mrbg) 1 ‘Mrbg where Ndvrb is the number of VRBs, Mrbg is a number of PRBs that constitute a group of resource blocks, RBG, Nintercalator is a size of the block interleaver, in which, when Ndvrb is smaller than Nintercalator, nulls are inserted into the last Null / 2 rows of the 2nd and 4th column of the block interleaver evenly, in which Null equals a number of nulls, in which , when the VRB indices are read from the block interleaver, the nulls are ignored, in which Ndvrb is determined as (Nprb - Nhueco) ■ 2 in which Nhueco denotes a predetermined gap value that is a multiple of a square of Mrbg, and Nprb denotes a number of the PRBs in a system bandwidth, when Nhueco is greater than Nprb / 2, in which Ndesviac is determined as Nhueco - Numbral, and Numbral is determined as Ndvrb / 2; and in which Nhueco is determined as Nhueco = rounding (NPRB / (2MRBG2)) MRBG2, in which rounding () denotes an integer that is closest to the number inside parentheses ().