RU2556389C2 - Method of transmitting/receiving downlink data using resource blocks in wireless mobile communication network system and device therefor - Google Patents

Abstract

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to a method of transmitting/receiving downlink data in an orthogonal frequency-division multiplexing (OFDM) cellular packet data communication system. The method of transmitting downlink data using resource blocks in a base station comprises transmitting to user equipment downlink data mapped to physical resource blocks (PRB), wherein virtual resource block (VRB) indices are mapped to PRB indices for a first slot and a second slot of a subframe, and PRB indices for the second slot are shifted relative to the PRB indices for the first slot based a predetermined gap, wherein the predetermined shift is applied to the PRB index when the index of said PRB is equal to or greater than a predetermined threshold.

EFFECT: providing efficient transmission of downlink data.

22 cl, 33 dwg

Description

Technical field

The present invention relates to a broadband wireless mobile communication system and, in particular, to a method for transmitting / receiving downlink data in a cellular communication system for transmitting packet data with orthogonal frequency division multiplexing ("OFDM" orthogonal frequency division multiplexing).

State of the art

In a wireless cellular communication system for transmitting orthogonal frequency division multiplexed (OFDM) packet data, uplink / downlink packet data transmission is performed based on a subframe, and one subframe is determined by a specific time interval including a plurality of orthogonal frequency division multiplexing symbols, further OFDM characters.

The 3rd Generation Partnership Project (3GPP) supports type 1 radio frame structure applied to frequency division duplex (FDD), and type 2 radio frame structure applied to time division duplex - TDD). A type 1 structure of a radio frame is shown in FIG. Type 1 radio frames include ten subframes, each of which consists of two slots (two time intervals). The type 2 structure of the radio frame is shown in FIG. Type 2 radio frames include two half-frames, each of which is composed of five subframes, a downlink pilot time slot (DwPTS), then a gap period (GP), and an uplink pilot time slot piloting time slot - UpPTS), with one subframe consisting of two slots. Thus, one subframe is composed of two slots, regardless of the type of radio frame.

$$N_{SC}^{RB}$$

поднесущих и $$N_{symb}^{DL}$$

OFDM-символов. Здесь, $$N_{RB}^{DL}$$

представляет число ресурсных блоков (resource block - RB) на нисходящей линии связи, $$N_{SC}^{RB}$$

представляет число поднесущих, составляющих один ресурсный блок (RB), и $$N_{symb}^{DL}$$

представляет число OFDM-символов в одном слоте нисходящей линии связи. Структура этой ресурсной сетки показана на Фиг.3.The signal transmitted in each slot can be described by a resource grid, including $$N_{RB}^{DL}$$

$$N_{SC}^{RB}$$

subcarriers and $$N_{symb}^{DL}$$

OFDM characters. Here, $$N_{RB}^{DL}$$

represents the number of resource blocks (resource blocks - RB) on the downlink, $$N_{SC}^{RB}$$

represents the number of subcarriers making up one resource block (RB), and $$N_{symb}^{DL}$$

represents the number of OFDM symbols in one downlink slot. The structure of this resource grid is shown in FIG. 3.

Resource Blocks (RBs) are used to describe the mapping of the relationship between certain physical channels and resource elements. Resource blocks (RB) can be classified into physical resource blocks (PRB) and virtual resource blocks (VRB), which means that the resource block (RB) can be either a physical resource block (PRB), or virtual resource block (VRB). A mapping of the relationship between virtual resource blocks (VRBs) and physical resource blocks (PRBs) may be described based on a subframe. In more detail, it can be described in units of each of the slots making up one subframe. Also, a mapping of the relationship between virtual resource blocks (VRBs) and physical resource blocks (PRBs) can be described using a mapping of the relationship between virtual resource block indices (VRBs) and physical resource block indices (PRBs). A detailed description of this will be given below in embodiments of the present invention.

последовательными OFDM-символами во временной области и $$N_{SC}^{RB}$$

последовательными поднесущими в частотной области. Один физический ресурсный блок (PRB) поэтому составлен из $$N_{symb}^{DL}$$

$$N_{SC}^{RB}$$

ресурсных элементов. В частотной области физическим ресурсным блокам (PRB) присваиваются номера от 0 до $$N_{RB}^{DL}-1$$

.Physical Resource Block (PRB) is defined $$N_{symb}^{DL}$$

consecutive OFDM symbols in the time domain and $$N_{SC}^{RB}$$

serial subcarriers in the frequency domain. One physical resource block (PRB) is therefore composed of $$N_{symb}^{DL}$$

$$N_{SC}^{RB}$$

resource elements. In the frequency domain, physical resource blocks (PRBs) are assigned numbers from 0 to $$N_{RB}^{DL}-\mathrm{one}$$

.

виртуальным ресурсным блокам (VRB), принадлежащим первому из двух слотов, составляющих один субкадр, каждому назначается любой индекс от 0 до $$N_{RB}^{DL}-1$$

, и аналогично $$N_{RB}^{DL}$$

виртуальным ресурсным блокам (VRB), принадлежащим второму из этих двух слотов, каждому назначается любой индекс от 0 до $$N_{RB}^{DL}-1$$

.A virtual resource block (VRB) may be the same size as a physical resource block (PRB). There are two specific types of virtual resource blocks (VRBs), the first type is a localized type, and the second type is a distributed type. For each type of virtual resource block (VRB), usually a pair of virtual resource blocks (VRB) has a separate virtual resource block index - “VRB index” (may be referred to as the number of virtual resource block - “VRB number”), and highlighted for two slots of one subframe. In other words, $$N_{RB}^{DL}$$

virtual resource blocks (VRB) belonging to the first of two slots constituting one subframe, each is assigned any index from 0 to $$N_{RB}^{DL}-\mathrm{one}$$

, and similarly $$N_{RB}^{DL}$$

virtual resource blocks (VRB) belonging to the second of these two slots, each is assigned any index from 0 to $$N_{RB}^{DL}-\mathrm{one}$$

.

The virtual resource block index (VRB) corresponding to a specific virtual frequency band of the first slot has the same value as the virtual resource block index (VRB) corresponding to this specific virtual frequency band of the second slot. Thus, assuming that the virtual resource block (VRB) corresponding to the i-th virtual frequency band of the first slot is denoted by VRB1 (i), the virtual resource block (VRB) corresponding to the j-th virtual frequency band of the first slot is denoted VRB2 (j ), and the index numbers of the virtual resource blocks VRB1 (i) and VRB2 (j) are denoted by index (VRBl (i)) and index (VRB2 (j)), respectively, the relation index (VRB1 (k)) = index (VRB2 ( k)) (see Fig. 4a).

Similarly, the index of a physical resource block (PRB) corresponding to a certain frequency band of the first slot has the same value as the index of a physical resource block (PRB) corresponding to a certain frequency band of the second slot. Thus, assuming that the physical resource block (PRB) corresponding to the i-th frequency band of the first slot is denoted by PRB1 (i), the physical resource block (PRB) corresponding to the j-th frequency band of the second slot is denoted PRB2 (j), and index numbers PRB1 (i) and PRB2 (j) are denoted by index (PRB1 (i)) and index (PRB2 (j)), respectively, the relation index (PRB1 (k)) = index (PRB2 (k)) is established (see Fig. 4b).

Part of the plurality of the aforementioned virtual resource blocks (VRBs) is allocated as a localized type, and other virtual resource blocks (VRBs) are allocated as a distributed type. Hereinafter, virtual resource blocks (VRBs) distributed as a localized type will be referred to as localized virtual resource blocks (LVRBs), and virtual resource blocks (VRBs) distributed as a distributed type will be referred to as distributed virtual resource blocks. blocks (distributed virtual resource block - DVRB).

Localized virtual resource blocks (LVRBs) are mapped directly to physical resource blocks (PRBs), and the indices of localized virtual resource blocks (LVRBs) correspond to indices of physical resource blocks (PRBs). That is, localized virtual resource blocks (LVRB) having index i correspond to physical resource blocks (PRB) having index L. That is, a localized virtual resource block LVRB1 having index i corresponds to a physical resource block PRB1 having index i and localized the virtual resource block LVRB2 having index i corresponds to a physical resource block PRB2 having index i (see FIG. 5). In this case, it is assumed that all virtual resource blocks (VRB) in FIG. 5 are allocated as localized virtual resource blocks (LVRB).

Distributed Virtual Resource Blocks (DVRBs) cannot directly map to physical resource blocks (PRBs). Thus, virtual block indices (DVRBs) can be mapped to physical resource blocks (PRBs) after they are subjected to a number of processes.

First, sequential indexes of distributed virtual resource blocks (DVRBs) may be interleaved in a block interleaver. Here, a sequence of consecutive indices means that the index number is sequentially increased by one, starting from 0. The sequence of indices from the output of the interleaver is sequentially mapped to the sequence of consecutive indices of physical resource blocks PRB1 (see FIG. 6). It is assumed that all virtual resource blocks (VRB) in FIG. 6 are allocated as distributed virtual resource blocks (DVRB). On the other hand, the sequence of indices from the output of the interleaver is cyclically shifted by a predetermined number, and the cyclically shifted sequence of indices is sequentially mapped to a sequence of successive indices of physical resource blocks PRB2 (see FIG. 7). It is assumed that all virtual resource blocks (VRB) in FIG. 7 are allocated as distributed virtual resource blocks (DVRB). Thus, the index of physical resource blocks (PRB) and the index of distributed virtual resource blocks (DVRB) can be displayed on two slots.

On the other hand, in the above processes, a sequence of sequential indices of distributed virtual resource blocks (DVRBs) can be sequentially mapped to a sequence of consecutive indices of physical resource blocks PRB1 without passing through an interleaver. Also, a sequence of consecutive indices of distributed virtual resource blocks (DVRBs) can be cyclically shifted by a predetermined number without going through an interleaver, and a cyclically shifted sequence of indices can be sequentially mapped to a sequence of consecutive indices of physical resource blocks PRB2.

According to the aforementioned processes for mapping distributed virtual resource blocks (DVRB) to physical resource blocks (PRB), physical resource blocks PRB1 (i) and PRB2 (i) having the same index i can be mapped to distributed virtual resource blocks DVRB1 (m ) and DVRB2 (n) having different indices m and n. For example, as shown in FIGS. 6 and 7, the physical resource blocks PRB1 (1) and PRB2 (1) are mapped to the distributed virtual resource blocks DVRB1 (6) and DVRB2 (9) having different indices. The effect of frequency diversity can be obtained based on the mapping scheme of distributed virtual resource blocks (DVRB).

In the case when the virtual resource blocks VRB (l), from among the virtual resource blocks (VRB), are distributed as distributed virtual resource blocks (DVRB), as in Fig. 8, then if the methods in Figs. 6 and 7 are used, the localized virtual resource blocks (LVRB) cannot be assigned to physical resource blocks PRB2 (6) and PRB1 (9), although virtual resource blocks (VRB) have not yet been assigned to physical resource blocks PRB2 (6) and PRB1 (9). The reason is as follows: according to the aforementioned map of localized virtual resource blocks (LVRB), mapping of localized virtual resource blocks (LVRB) to physical resource blocks PRB2 (6) and PRB1 (9) means that these localized virtual resource blocks (LVRB) are also mapped to physical resource blocks PRB1 (6) and PRB2 (9); however, these physical resource blocks PRB1 (6) and PRB2 (9) have already been mapped by the aforementioned virtual resource blocks VRB1 (1) and VRB2 (1). In this regard, it should be understood that the display of localized virtual resource blocks (LVRB) may be limited by the results of the mapping of distributed virtual resource blocks (DVRB). Therefore, there is a need to determine the rules for displaying distributed virtual resource blocks (DVRB), taking into account the display of localized virtual resource blocks (LVRB).

In a multi-radio broadband wireless mobile communication system, resources can be allocated to each terminal using a scheme with localized virtual resource blocks (LVRB) and / or a scheme with distributed virtual resource blocks (DVRB). Information indicating which circuitry is being used can be transmitted in bitmap format (bit format). At this time, the distribution of radio resources to each terminal can be performed in units of one resource block (RB). In this case, resources can be allocated with a granularity of one resource block (“1” RB), but a large number of bits are required for overhead signals to transmit distribution information in a bitmap format. Alternatively, a resource block group (RBG) consisting of physical resource blocks (PRB) with k consecutive indices (for example, k = 3) can be defined, and resources can be allocated with a granularity one group of resource blocks (“1” RBG) . In this case, resource block allocation (RB) is simple, but there is an advantage in that the number of bits for overhead is reduced.

In this case, localized virtual resource blocks (LVRBs) can be mapped to physical resource blocks (PRBs) based on a group of physical resource blocks (RBGs). For example, physical resource blocks (PRB) having three consecutive indexes, PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1) and PRB2 (i + 2 ), can constitute one group of resource blocks (RBG), and localized virtual resource blocks (LVRB) can be mapped to this RBG group in units of a group of resource blocks (RBG). However, in the case when one or more physical resource blocks PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1) and PRB2 (i + 2) were previously mapped using distributed virtual resource blocks (DVRBs), this group of resource blocks (RBGs) cannot be mapped using localized virtual resource blocks (LVRBs) based on a group of resource blocks (RBGs). Thus, distributed virtual resource block (DVRB) mapping rules can restrict the display of a localized virtual resource block (LVRB) to resource block group (RBG) units.

As mentioned above, since the rules for displaying distributed virtual resource blocks (DVRBs) can influence the rules for displaying localized virtual resource blocks (LVRBs), there is a need to define the rules for displaying distributed virtual resource blocks (DVRBs) taking into account the display of localized virtual resource blocks (LVRBs).

Disclosure of invention

Technical problem

An object of the present invention, designed to solve the aforementioned problem, is a method for transmitting / receiving downlink data in a cellular communication system for wireless transmission of packet resource scheduling data using efficient joint scheduling of an FSS scheme and scheduling of an FDS scheme.

Technical solution

The objective of the present invention can be solved by proposing, for a wireless mobile communication system that supports a resource allocation scheme in which one group of resource blocks (RBG), including consecutive physical resource blocks, is indicated by one bit, a method for transmitting / receiving downstream data using resource blocks in a wireless mobile communication system.

To solve this problem, a method for transmitting downstream data using resource blocks in a base station in a wireless mobile communication system is proposed, comprising: transmitting downlink data mapped to physical resource blocks (PRB) to user equipment, wherein virtual resource block indices (VRB) are mapped to the physical resource block indices (PRB) for the first slot and the second subframe slot, while the physical resource block indices (PRB) for the second slot are offset relative to the physical indices resource block (PRB) for the first slot based on a predetermined space, wherein a predetermined offset is applied to the index of the physical resource block (PRB) when the index of this physical resource block (PRB) is equal to or greater than a predetermined threshold value.

Moreover, the predetermined threshold value is N _VRB / 2,

where N _VRB is the number of consecutive virtual resource block (VRB) indices.

In addition, a predetermined offset is defined as

N _gap. -N _VRB / 2,

where N _gap. represents the value of a predefined space.

In this case, N _{VRB are} set as

N _VRB = 2 · min (N _gap ., N _PRB -N _gap ),

where N _PRB is equal to the number of physical resource blocks (PRB).

In addition, successive virtual resource block (VRB) indices are interleaved in such a way that the virtual resource block (VRB) indices write row by row into a rectangular matrix and read column by column, and the number of rows R of the rectangular matrix is set as

R = [N _DVHB / (C · M _RBG )] · M _RBG

where C equals the number of columns of a rectangular matrix, a M _RBG is the number of consecutive physical resource blocks (PRB), which constitute the resource block group (RBG).

In addition, C may be equal to 4.

In addition, the rectangular matrix includes ND groups, with C equal to K · N _D , and when N _null zeros are added to the rectangular matrix, zeros are added to the last N _null / ND rows of the Kth column in each of the ND groups rectangular matrix, while zeros are ignored when the index of virtual resource blocks (VRB) is read from the rectangular matrix,

moreover, N _null = [N _VRB / (C · M _RBG )] · C · M _RBG -N _VRB . = C · RN _VRB .

Moreover, K is 2 and N _D is 2.

In addition, the index p _{1, d of} one of the physical resource blocks (PRB) for the first slot displayed on the index d of one of the virtual resource blocks (VRB) is set as

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}}-R+N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d\ge N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=0\right)\\ p_{\mathrm{one,}d}^{\text{'}\text{'}}-R,\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d\ge N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=\mathrm{one}\right)\end{array}$$

,in cases where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=2R\mathrm{mod}\left(d,C/2\right)+\left[2d/C\right]$$

,

And How

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}},\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d<N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=0\right)\\ p_{\mathrm{one,}d}^{\text{'}\text{'}}-N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d<N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C\right)\ge 2\right)\end{array}$$

;in cases where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=\mathrm{mod}\left(d,C\right)\cdot R+\left[d/C\right]$$

;

the index p _{2, d of} one of the physical resource blocks (PRB) for the second slot displayed on the index d of one of the virtual resource blocks (VRB) is set as

p _{2, d} = (p _{1, d} + N _VRB / 2) modN _VRB .

In addition, the index of one O _{i, d} from 3 physical resource blocks (PRB) for the i-th slot (i = 1, 2) displayed on the index d of one of the virtual resource blocks (VRB) is set as

. $$o_{i,d}=\{\begin{array}{c}{p}_{i,d},when{p}_{i,d}<N_{VRB}/2\\ p_{i,d}+N_{gap}-N_{VRB}/2when{p}_{i,d}\ge N_{VRB}/2\end{array}$$

.

To solve this problem, there is also proposed a method for receiving downstream data using resource blocks in user equipment in a wireless mobile communication system, comprising: receiving downlink control information from the base station, including resource allocation information for downlink data, and receiving downlink data displayed physical resource blocks (PRBs) based on this downlink control information, wherein resource allocation information indicates p the allocation of virtual resource blocks (VRBs) for user equipment, wherein the indices of physical resource blocks (PRBs) onto which downstream data is mapped are determined based on a mapping relationship between virtual resource blocks (VRBs) and physical resource blocks (PRBs), wherein the mappings are set so that the virtual resource block indices (VRB) are mapped to the physical resource block indices (PRB) for the first slot and the second subframe slot, while the indices of the physical resource blocks ( PRB) for the second slot is offset relative to the physical resource block index (PRB) for the first slot based on a predetermined space, and a predetermined offset is applied to the physical resource block index (PRB) when the index of this physical resource block (PRB) is equal to or greater a predetermined threshold value.

In this case, the predetermined threshold value is N _VRB / 2, where N _VRB is the number of consecutive indexes of virtual resource blocks (VRB).

Moreover, a predetermined offset is set as

N _gap. -N _VRB / 2,

where N _gap . represents the value of a predefined space.

Furthermore, consecutive indexes virtual resource block (VRB) is interleaved, and wherein the number of consecutive indices of virtual resource block _(VRB) -N VRB is given as

N _VRB = 2 · min (N _gap ., N _PRB -N _gap ),

where N _gap . represents the value of a predetermined space, and N _PRB is equal to the number of physical resource blocks (PRB).

In this case, successive virtual resource block (VRB) indices are interleaved in such a way that the virtual resource block (VRB) indices write row by row into a rectangular matrix and read column by column, and the number of rows R of the rectangular matrix is specified as

R = [N _DVRB / (C · M _RBG )] · M _RBG ,

where C is equal to the number of columns of the rectangular matrix, and M _RBG is equal to the number of consecutive physical resource blocks (PRB) that make up the group of resource blocks (RBG).

In this case, C may be equal to 4.

In addition, the rectangular matrix includes N _D groups, with C equal to K · N _D , and when N _null zeros are added to the rectangular matrix, zeros are added to the last N _null / N _D rows of the Kth column in each of N _D groups of a rectangular matrix, while zeros are ignored when indexes of virtual resource blocks (VRB) are read from a rectangular matrix,

moreover, N _null = [N _VRB / (C · M _RBG )] · C · M _RBG -N _VRB . = C · RN _VRB .

Wherein K equals 2 and N _D = 2.

In addition, the index p _{1, d of} one of the physical resource blocks (PRB) for the first slot displayed on the index d of one of the virtual resource blocks (VRB) is set as

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}}-R+N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d\ge N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=0\right)\\ p_{\mathrm{one,}d}^{\text{'}\text{'}}-R,\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d\ge N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=\mathrm{one}\right)\end{array}$$

in cases where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=2R\mathrm{mod}\left(d,C/2\right)+\left[2d/C\right]$$

And How

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}},\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d<N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=0\right)\\ p_{\mathrm{one,}d}^{\text{'}\text{'}}-N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d<N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C\right)\ge 2\right)\end{array}$$

;in cases where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=\mathrm{mod}\left(d,C\right)\cdot R+\left[d/C\right]$$

;

the index p _{2, d of} one of the physical resource blocks (PRB) for the second slot displayed on the index d of one of the virtual resource blocks (VRB) is set as

P _{2, d} = (p _{1, d} + N _VRB / 2) modN _VRB.

Moreover, the index O _{i, d of} one of the physical resource blocks (PRB) for the i-th slot (i = 1, 2) displayed on the index d of one of the virtual resource blocks (VRB) is set as

$$o_{i,d}=\{\begin{array}{c}{p}_{i,d},when{p}_{i,d}<N_{VRB}/2\\ p_{i,d}+N_{gap}-N_{VRB}/2when{p}_{i,d}\ge N_{VRB}/2\end{array}$$

To solve this problem, a base station is also proposed that transmits downstream data using resource blocks in a wireless mobile communication system, comprising: a processor for controlling the operation of the base station; and a memory block controlled by the processor, wherein the processor is configured to transmit downstream data mapped to physical resource blocks (PRBs) to user equipment, wherein virtual resource block indices (VRBs) are mapped to physical resource block indices (PRBs) for the first slot and a second subframe slot, and wherein the physical resource block indices (PRB) for the second slot are offset relative to the physical resource block indices (PRB) for the first slot based on a predetermined space, and anee certain offset is applied to the indices of physical resource blocks (PRB), equal to or greater than a predetermined threshold value.

To solve this problem, it is also proposed user equipment for receiving downstream data using resource blocks in a wireless mobile communication system, comprising: a processor for controlling the operation of user equipment, and a memory unit controlled by the processor, the processor being configured to receive control information from the base station downlink, including resource allocation information for transmitting downlink data, and to receive downlink data mapped to physical resource blocks (PRBs) based on downlink control information, wherein resource allocation information indicates a distribution of virtual resource blocks (VRBs) for user equipment, with virtual resource block indices (VRBs) to which are mapped downstream data is determined based on the mapping relationship between the virtual resource blocks (VRB) and the physical resource blocks (PRB), wherein the mapping relationship is set so that the virtual indices the resource blocks (VRBs) are mapped to the physical resource block indices (PRBs) for the first slot and the second subframe slot, while the physical resource block indices (PRBs) for the second slot are offset relative to the physical resource block indices (PRBs) for the second slot based on advance a specific gap, and a predetermined offset is applied to the index of a physical resource block (PRB) when the index of this physical resource block (PRB) is equal to or greater than a predetermined threshold value.

All of the above various aspects of the present invention are applicable to a base station and / or mobile station.

Benefits

According to the present invention, it is possible to efficiently combine FSS scheduling and FDS scheduling and efficiently transmit / receive downlink data.

Description of drawings

The accompanying drawings, which are included in the application 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:

1 shows an example of a radio frame structure applicable to frequency division duplex (FDD).

Figure 2 shows an example of a radio frame structure applicable to time division duplex (TDD).

Figure 3 shows an example of a resource grid structure constituting a transmission slot in the 3GPP standard.

Figure 4a shows an example of a virtual resource block (VRB) structure in one subframe.

Fig. 4b shows an example of a structure of physical resource blocks (PRBs) in one subframe.

Figure 5 shows an example of a method for mapping localized virtual resource blocks (LVRB) to physical resource blocks (PRB).

FIG. 6 shows an example of a method for mapping distributed virtual resource blocks (DVRBs) in a first slot to physical resource blocks (PRBs).

7 shows an example of a method for mapping distributed virtual resource blocks (DVRBs) in a second slot to physical resource blocks (PRBs).

FIG. 8 shows an example of a method for mapping distributed virtual resource blocks (DVRBs) to physical resource blocks (PRBs).

Figure 9 shows an example of a method for mapping distributed virtual resource blocks (DVRB) and localized virtual resource blocks (LVRB) to physical resource blocks (PRB).

Figure 10 shows an example of a method for allocating resource blocks in accordance with a compact scheme.

11 shows an example of a method for mapping two distributed virtual resource blocks (DVRBs) having consecutive indices onto a plurality of adjacent physical resource blocks (PRBs).

12 shows an example of a method for mapping two distributed virtual resource blocks (DVRBs) having consecutive indices onto a plurality of spaced physical resource blocks (PRBs).

13 shows an example of a method for mapping four distributed virtual resource blocks (DVRBs) having consecutive indices onto a plurality of spaced physical resource blocks (PRBs).

On Fig shows an example of a method of displaying resource blocks in the case where the gap Gap = 0, according to one of the embodiments of the present invention.

On Fig shows the configuration of the bitmap (bitmap).

FIG. 16 shows an example of a mapping method based on a combination of a bitmap circuit and a compact circuit.

17 and 18, a method for mapping distributed virtual resource blocks (DVRBs) according to one embodiment of the present invention is shown.

On Fig shows an example of a method of interleaving indices of blocks of distributed virtual resource blocks (DVRB).

On figa and 20b shows a diagram of a conventional interleaver, when the number of resource blocks used in the operation of interleaving is not a multiple of the diversity factor.

21a and 21b show a method of adding zeros when the number of resource blocks used in the interleaving operation is not a multiple of the diversity factor, in accordance with one embodiment of the present invention.

On Fig shows a method of displaying interleaved indices of distributed virtual resource blocks (DVRB) with a space Gap = 0 in accordance with one embodiments of the present invention.

On Fig shows an example of a method for displaying indices of distributed virtual resource blocks (DVRB), using different spaces for different terminals.

24 explains the relationship between distributed virtual resource indexes (DVRB) and physical resource block indexes (PRBs).

Figa explains the relationship between the distributed virtual resource indices (DVRB) and the physical resource block indices (PRB).

25b shows a conventional method for adding zeros to an interleaver.

25c and 25d, respectively, show examples of a method for adding zeros to an interleaver in one embodiment of the present invention.

Figures 26 and 27 show examples of a method using a combination of a bitmap scheme using a resource side group (RBG) scheme and a subset scheme and a compact scheme, respectively.

On Fig shows a case in which the number of distributed virtual resource blocks (DVRB) is set to a multiple (Nd) - the number of physical resource blocks (PRB), which displays one virtual resource block (VRB), and M _RBG - the number of consecutive physical resource blocks blocks constituting an RBG group, in accordance with one embodiment of the present invention.

On Fig shows a case in which the indices of the distributed virtual resource blocks (DVRB) are interleaved in accordance with the method of Fig. 28.

30 is a diagram illustrating an example in which a mapping is performed under the condition that the degree of block interleaver is set equal to the number of columns of the block interleaver, namely, C and C are set equal to the diversity ratio, in accordance with one embodiment of the present invention.

FIG. 31 is a diagram illustrating an example of a display method according to one embodiment of the present invention, when the number of physical PRBs and the number of virtual DVRBs are different from each other.

FIGS. 32 and 33 show examples of a display method capable of increasing the number of distributed virtual resource blocks (DVRB) using a predetermined space in accordance with one embodiment of the present invention.

Examples of carrying out the invention

Next will be given a detailed description of the preferred embodiments of the present invention with reference to the accompanying drawings. The detailed description that will be given below with reference to the accompanying drawings is intended to explain examples of embodiments of the present invention rather than to show the only embodiments that can be implemented according to the invention. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without these specific details. For example, the following description will be given focusing on specific terms, but the present invention is not limited to these meanings, and any other terms may be used to represent the same meaning. In addition, wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or similar parts.

In the case where the subframe consists of the first slot and the second slot, index (PRB1 (i)) is the index of the physical resource block (PRB) in the i-th frequency band of the first slot, index (PRB2 (j)) is the index of the physical resource block (PRB) of the jth frequency band of the second slot and the relation index (PRB1 (k) = index (PRB2 (k)) is set, as stated earlier. In addition, index (VRB1 (i)) is the index of the virtual resource block ( VRB) of the i-th virtual band of the first slot, index (VRB2 (j)) is the index of the VRB block of the j-th virtual band of the second slot and the relation index (VRB1 (k)) = index (VRB2 (k) is established. At the same time, virtual blocks VRB1 are mapped to physical blocks PRB1, and virtual blocks VRB2 are mapped to physical blocks PRB2. In addition, virtual blocks VRB are classified into distributed virtual resource blocks (DVRB) and localized virtual resource blocks (LVRB).

The rules for mapping localized virtual resource blocks LVRB1 to physical blocks PRB1 and the rules for mapping localized virtual resource blocks LVRB2 to physical blocks PRB2 are the same. However, the rules for mapping the distributed virtual resource blocks of DVRB 1 to the physical resource blocks of PRB 1 and the rules for mapping the distributed virtual resource blocks of DVRB2 to the physical resource blocks of PRB2 are different. Thus, the distributed virtual resource blocks of the DVRB are “divided into groups” and mapped to physical resource blocks (PRBs).

In the 3GPP standard, one resource block (RB) is defined in units of one slot. However, in the detailed description of the present invention, one RB block is determined in units of one subframe, and this RB block is divided along the time axis into ND resource subblocks (sub-RBs) so that the rules for displaying distributed virtual resource blocks (DVRBs) are generalized and are described. For example, in the case where ND = 2, the physical resource block (PRB) defined in units of one subframe is divided into the first physical resource subblock (sub-PRB) and the second sub-PRB, and the virtual resource block (VRB) defined in units of one subframe, is divided into the first virtual resource subunit (sub-VRB) and the second sub-VRB.

In this case, the first sub-PRB corresponds to the aforementioned physical resource block PRB1, and the second sub-PRB corresponds to the aforementioned physical resource block PRB2. In addition, the first sub-VRB corresponds to the aforementioned virtual block VRB1, and the second sub-VRB corresponds to the aforementioned virtual block VRB2. In addition, in both the detailed description of the present invention and the 3GPP standard, the rules for displaying a distributed virtual resource block (DVRB) to obtain a frequency effect are described based on one subframe. Therefore, it will be understood that all embodiments from the detailed description of the invention are concepts including a method for mapping resource blocks (RB) according to the 3GPP standard.

Further, the terms used in this application in the detailed description of the invention are defined as follows.

A Resource Element (RE) represents the smallest time-frequency unit into which data or a modulated symbol of a control channel is mapped. It is envisaged that the signal is transmitted in one OFDM symbol over M subcarriers (subcarrier frequencies) and N OFDM symbols are transmitted in one subframe, while M × N resource elements (RE) are present in one subframe.

A “physical resource block” (PRB) represents a unit of a time-frequency resource for transmitting data. Typically, one physical resource block (PRB) consists of a plurality of consecutive resource elements (REs) in a time-frequency domain, and a plurality of physical resource blocks (PRBs) are determined in one subframe.

A “virtual resource block” (VRB) represents a virtual resource unit for transmitting data. Typically, the number of resource elements (RE) included in one virtual resource block (VRB) is equal to the number of resource elements (RE) included in one physical resource block (PRB), and when data is transmitted, one virtual resource block (VRB) can mapped to a single physical resource block (PRB) or multiple areas of a plurality of physical resource blocks (PRB).

A “localized virtual resource block” (LVRB) is one type of virtual resource block (VRB). One localized virtual resource block (LVRB) is mapped to one physical resource block (PRB). The physical resource block (PRB) displayed to one localized virtual resource block (LVRB) is different from the physical resource block (PRB) displayed to another localized virtual resource block (LVRB).

A “Distributed Virtual Resource Block” (DVRB) is another type of virtual resource block (VRB). One distributed virtual resource block (DVRB) is mapped onto a plurality of physical resource blocks (PRB) in a distributed manner.

The number 'N _D ' = 'N _d ' represents the number of physical resource blocks (PRB) onto which one distributed virtual resource block (DVRB) is mapped. FIG. 9 illustrates an example of a method for mapping distributed virtual resource blocks (DVRBs) and localized virtual resource blocks (LVRBs) to physical resource blocks (PRBs). In Fig. 9, N _D = 3. An arbitrary distributed virtual resource block (DVRB) can be divided into three parts, and accordingly, the divided parts can be displayed on different physical resource blocks (PRB). Here, the remaining part of each physical resource block (PRB) not displayed by an arbitrary distributed virtual resource block (DVRB) is displayed by the divided part of another distributed virtual resource block (DVRB).

The number "N _PRB " represents the number of physical resource blocks (PRB) in the system. In the case where the system bandwidth is divided, N _PRB may be the number of physical resource blocks (PRB) in the divided part.

The number "N _LVRB " represents the number of localized virtual resource blocks (LVRB) available in the system.

The number “N _DVRB ” represents the number of distributed virtual resource blocks (DVRBs) available in the system.

The number "N _{LVRB_UE} " represents the maximum number of localized virtual resource blocks (LVRB) allocated to one user equipment (UE) (terminal).

The number «N _{DVRB_UE»} represents the maximum number of distributed virtual resource block (DVRB), allocated to one user equipment (UE).

The number "N _subset " represents the number of subsets.

The number "N _DivOrder " represents the diversity _ratio required in the system. Here, the diversity ratio is determined by the number of resource blocks (RB) that are not adjacent to each other.

Here, “number of resource blocks” (RB) means the number of resource blocks (RB) distributed along the frequency axis. Thus, even in the case where resource blocks (RB) can be divided by time slots constituting a subframe, “number of resource blocks” (RB) means the number of resource blocks (RB) distributed along the frequency axis of the same slot.

Fig.9 shows an example of the definitions of a localized virtual resource block (LVRB) and a distributed virtual resource block (DVRB).

As can be seen from FIG. 9, each resource element (RE) of one localized virtual resource block (LVRB) is one-to-one mapped onto each resource element (RE) of one physical resource block (PRB). For example, one localized virtual resource block (LVRB) is mapped to a physical resource block “PRB0” (901). In contrast, one distributed virtual resource block (DVRB) is divided into three parts, and the divided parts are mapped to different physical resource blocks (PRB), respectively. For example, the distributed virtual resource block DVRB0 is divided into three parts, and the divided parts are mapped to physical resource blocks PRB1, PRB4, and PRB6, respectively. Similarly, the distributed virtual resource blocks DVRB1 and DVRB2 are each divided into three parts, and the divided parts are mapped to the remaining resources of the physical resource blocks PRB1, PRB4 and PRB6. Although in this example each distributed virtual resource block (DVRB) is divided into three parts, the present invention is not limited to this. For example, each distributed virtual resource block (DVRB) can be divided into two parts.

The transmission of downstream data from the base station to a specific terminal or the transmission of upstream data from this specific terminal to the base station is via one or more virtual resource blocks (VRB) in one subframe. When the base station transmits data to a specific terminal, it must notify that terminal which block of these virtual resource blocks (VRBs) is used to transmit data. In addition, to allow this specific terminal to transmit data, the base station must notify the terminal which block of virtual resource blocks (VRBs) is allowed to be used for data transmission.

Data transmission schemes can generally be classified into frequency diversity scheduling (FDS) schemes and frequency selective scheduling (FSS) schemes. The frequency diversity scheduling scheme (FDS) is a scheme in which gain in reception characteristics is obtained through frequency diversity, and the frequency selective scheduling (FSS) scheme is a scheme in which gain in reception characteristics is obtained through frequency selective planning.

In the FDS scheme, at the stage of transmission, one data packet is transmitted on subcarriers widely distributed in the frequency domain of the system so that the symbols in the data packet undergo various fading in the radio channel. Therefore, improving reception characteristics is ensured by preventing the entire data packet from undergoing adverse fading. In contrast, in the FSS scheme, an improvement in reception characteristics is achieved by transmitting a data packet over one or more consecutive frequency regions in the frequency region of the system that are in a favorable fading state. In a cellular OFDM orthogonal frequency division multiplexed (OFDM) cellular communication system, a plurality of terminals are present in one cell. Here, since the radio channels of the respective terminals have different characteristics, it is necessary to perform data transmission according to the FDS scheme relative to a specific terminal and data transmission according to the FSS scheme to another terminal even within the same subframe. As a result, the detailed FDS transmission scheme and the detailed FSS transmission scheme must be designed so that these two schemes can be efficiently multiplexed within one subframe. On the other hand, in the FSS scheme, a gain can be obtained by selectively using a user-friendly (UE) band among all available bands. In contrast, the FDS does not evaluate whether a particular band is good or bad, and as long as frequency separation is able to adequately provide diversity, there is no need to select and transmit in a specific frequency band. Accordingly, to improve the performance of the entire system, it is advantageous to carry out frequency-selective scheduling according to the FSS scheme, preferably when planning.

In the FSS scheme, since the data is transmitted using subcarriers sequentially adjacent in the frequency domain, it is preferable that the data is transmitted using localized virtual resource blocks (LVRB). It is assumed here that N _{PRB of} physical resource blocks (PRB) is present in one subframe and a maximum of N _LVRB localized virtual resource blocks (LVRB) are available in the system, that the base station can transmit bitmap information from N _LVRB bits to each terminal, to notify this terminal of a block of localized virtual resource blocks (LVRB) through which downstream data will be transmitted, or of a block of localized virtual resource blocks (LVRB) through which upward data can be transmitted. Thus, each bit of information of a bitmap of N _LVRB bits, which is transmitted to each terminal as scheduling information, indicates whether data will be transmitted or whether data can be transmitted through a localized virtual resource block (LVRB) corresponding to this bit from among N _LVRB localized virtual resource blocks (LVRB). This scheme is disadvantageous in that when the value of N _LVRB becomes larger, the number of bits that will be transmitted to each terminal becomes larger in proportion to this number.

On the other hand, it is assumed that the terminal can be assigned only one set of adjacent resource blocks (RB), information about the assigned resource blocks (RB) can be expressed by the starting point of the resource blocks (RB) and their number. This circuit is referred to in this description as a “compact circuit."

Figure 10 shows an example of a method for allocating resource blocks through a compact circuit.

In this case, as shown in FIG. 10, the length of the available resource blocks (RB) is different depending on the corresponding starting points, and the number of combinations for allocating resource blocks (RB) is ultimately equal to N _LVRB (N _LVRB +1) / 2. Accordingly, the number of bits required for combinations is ceiling (log ₂ (N _LVRB (N _LVRB + 1) / 2)). Here, ceiling (x) means rounding "x" to the nearest integer. This method is advantageous in comparison with the bitmap scheme in that the number of bits does not increase significantly as the number N _{LVRB increases} .

On the other hand, for the method of notifying the user equipment (UE) about the allocation of distributed virtual resource blocks (DVRB), you must first "promise" the location of the corresponding divided parts of the distributed virtual resource blocks (DVRB) transmitted distributively to benefit from diversity. Alternatively, additional information may be required to directly notify locations. Preferably, it is assumed that the number of bits for signaling for distributed virtual resource blocks (DVRBs) is set equal to the number of bits when transmitting the localized virtual resource blocks (LVRBs) of the above-mentioned compact scheme, and it is possible to simplify the format of the bit-signaling when transmitting in the downstream direction communication lines). As a result, there are advantages that the same channel coding can be used, etc.

Here, in the case where a plurality of distributed virtual resource blocks (DVRBs) is allocated to a single user equipment (UE), this user equipment (UE) is notified of the DVRB index of the starting point of the distributed virtual resource blocks (DVRBs), length (= number of distributed virtual resource blocks distributed blocks (DVRB)) and the relative position difference between the divided parts of each distributed virtual resource block (DVRB) (for example, a space between the divided parts).

11 illustrates an example of a method for mapping two distributed virtual resource blocks (DVRBs) having consecutive indices onto a plurality of adjacent physical resource blocks (PRBs).

As shown in FIG. 11, in a case where a plurality of distributed virtual resource blocks (DVRBs) having consecutive indices are mapped onto a plurality of adjacent physical resource blocks (PRBs), the first divided parts 1101 and 1102 and the second divided parts 1103 and 1104 are separated from each other by a space 1105, while the divided parts belonging to each of the upper divided parts and the lower divided parts are adjacent to each other, so that the diversity ratio becomes 2.

12 shows an example of a method for mapping two DVRBs having consecutive indices onto a plurality of spaced physical resource blocks (PRBs). In this application, the term "spaced physical resource blocks (PRB)" means that the physical resource blocks (PRB) are not adjacent to each other.

In the method of FIG. 12, when distributed virtual resource blocks (DVRBs) are allowed to correspond to physical resource blocks (PRBs), consecutive indices of a distributed virtual resource blocks (DVRBs) may be allowed to be allocated not to correspond to adjacent physical resource blocks (PRBs). For example, the distributed virtual resource block (DVRB) index “0” and the distributed virtual resource block (DVRB) index “1” are not adjacent to each other. In other words, in FIG. 12, the indices of distributed virtual resource blocks (DVRBs) are located in the order “0, 8, 16, 4, 12, 20 ...”, and this arrangement can be obtained by entering the sequential indices shown in FIG. 11 in for example block interleaver. In this case, it is possible to obtain a distribution within each of the divided portions 1201 and 1202, as well as distribution using a space 1203. Therefore, when two distributed virtual resource blocks (DVRBs) are allocated to the user equipment (NOT), as shown in FIG. 12 , the diversity factor increases to 4, leading to the advantage that the diversity gain can be obtained even more.

Here, the space value indicating the relative difference in location between the divided parts can be expressed in two ways. First, the space value can be expressed as the difference between the DVRB block indices. Secondly, the value of the interval can be expressed by the difference between the indices of physical resource blocks (PRB) onto which the distributed virtual resource blocks (DVRB) are mapped. In the case of Fig. 12, the gap value "Gap = 1" in the first method, while in the second method, the gap value "Gap = 3". 12 shows the last case with a space 1203. In addition, if the total number of system resource blocks (RB) is changed, the allocation of distributed virtual resource block (DVRB) indices can be changed accordingly. In this case, the use of the second method has the advantage of seizing the physical distance between the divided parts.

FIG. 13 shows when four distributed virtual resource blocks (DVRBs) are allocated to one user equipment (UE) according to the same rules as in FIG. 12.

As can be seen from FIG. 13, the diversity ratio increases to 7. However, since the diversity ratio increases, the diversity gain tends to its limit. The results of existing studies show that the increase in diversity gain is not significant when the diversity ratio is approximately 4 or more. Non-displayable parts of PRB blocks 1301, 1302, 1303, 1304 and 1305 can be allocated and displayed for other user equipment (UE) that uses distributed virtual resource blocks (DVRB), however, non-displayed parts cannot be distributed and displayed for other user equipment ( UE) that uses localized virtual resource blocks (LVRB). Therefore, when there are no other units of user equipment (UE) using distributed virtual resource blocks (DVRB), the disadvantage is that the non-displayed parts of the PRB blocks 1301, 1302, 1303, 1304 and 1305 remain empty, are not used. In addition, the distributed allocation of distributed virtual resource blocks (DVRBs) disrupts the sequence of available physical resource blocks (PRBs), leading to a restriction in the allocation of localized virtual resource blocks (LVRBs).

As a result, a method is needed to limit the diversity factor to an appropriate level in order to perform distributed allocation.

The first embodiment and the second embodiment of the present invention are directed to methods for setting the relative distance between the divided parts of the distributed virtual resource blocks (DVRB) displayed on the physical resource blocks (PRB) to 0. In these embodiments, in a circuit for displaying sequential distributed indices virtual resource blocks (DVRBs) to spaced physical resource blocks (PRBs) when multiple distributed virtual resource blocks (DVRBs) are allocated to one unit user equipment (UE), the corresponding divided parts of each of these distributed virtual resource blocks (DVRB) can be distributively allocated to different physical resource blocks (PRB), thereby increasing the diversity ratio. Alternatively, under the same conditions, the corresponding divided parts of each distributed virtual resource block (DVRB) can be assigned to the same physical resource block (PRB), instead of distributively assigned to different PRB blocks. In this case, it becomes possible to reduce the number of physical resource blocks (PRBs) into which distributed virtual resource blocks (DVRBs) are distributed distributively, thereby limiting the diversity factor.

<Embodiment 1>

This embodiment is directed to a method of translating the divided parts into distributed / unallocated modes by setting a reference value for the number of distributed virtual resource blocks (DVRBs) allocated to one unit of user equipment (UE). Here, “distributed mode” refers to a mode where the space between the divided parts of the distributed virtual resource block (DVRB) is not 0, and “unallocated mode” refers to the mode where the space between the divided parts of the distributed virtual resource block (DVRB) is 0.

Assume that the number of distributed virtual resource blocks (DVRBs) assigned to one user equipment unit (UE) is M. When M is less than a certain reference value (= M _th ), the divided parts of each distributed virtual resource block (DVRB) are allocated distributively, thus increasing the diversity ratio.

Conversely, when M is greater than or equal to the reference value (= M _th ), the divided parts are allocated to the same physical resource block (PRB), and are not distributed distributively. This distribution of the divided parts to the same PRB can reduce the number of PRBs onto which the distributed virtual resource blocks (DVRBs) are mapped distributively, thereby limiting the diversity ratio.

Thus, in the case where M is greater than or equal to the reference value of M _th , a space that is the relative distance between the divided parts of each distributed virtual resource block (DVRB) displayed on the physical resource blocks (PRB) is set to 0.

For example, if the number of distributed virtual resource blocks (DVRBs) is 2, provided that M _th = 3, then the divided parts of each distributed virtual resource blocks (DVRBs) can be distributively displayed, as shown in FIG. On the contrary, if the number of distributed virtual resource blocks (DVRB) is 4, provided that M _th = 3, then the interval is set to 0 so that the divided parts of each distributed virtual resource block (DVRB) can be mapped to the same physical resource block (PRB).

Fig. 14 illustrates an example of a method for displaying resource blocks in the case where the gap Gap = 0 according to Embodiment 1 of the invention.

<Embodiment 2>

This embodiment is directed to a method for translating the divided parts into a distributed / unallocated mode using a control signal. Here, “distributed mode” refers to a mode where the space between the divided parts of the distributed virtual resource block (DVRB) is not 0, and “unallocated mode” refers to the mode where the space between the divided parts of the distributed virtual resource block (DVRB) is 0.

Embodiment 2 is a modified version of Embodiment 1. In Embodiment 2, M _{th is} not defined and, as necessary, a control signal is transmitted and received to translate the divided parts into distributed / unallocated modes. In response to the transmitted and received control signal, the divided parts of the distributed virtual resource block (DVRB) can be distributed to increase the diversity ratio or can be mapped to the same PRB to lower the diversity ratio.

For example, a control signal may be determined to indicate a space value, which is the relative distance between the divided parts of each distributed virtual resource block (DVRB) mapped to physical resource blocks (PRB). Thus, the control signal can be determined to indicate the value of the space itself.

For example, in the case where the control signal indicates that the interval Gap = 3, the divided parts of the distributed virtual resource block (DVRB) are distributively displayed, as shown in Fig. 12 or 13. Also, in the case where the control signal indicates that the Gap interval = 0, the divided parts of the distributed virtual resource block (DVRB) are mapped to the same physical resource block (PRB), as shown in FIG.

As stated earlier, in order to freely plan the number of N _PRB physical resource blocks (PRB) in a system based on PRB blocks, for planning, it is necessary to transmit a bit array of N _PRB bits to each user equipment unit (UE). When the number of N _PRB physical resource blocks (PRB) in the system is large, the overhead of control information increases to transmit a bit array of N _PRB bits. Therefore, you can consider a method of scaling down a planning unit or dividing the entire bandwidth and then transmitting in different planning units in only certain bandwidths.

The 3GPP LTE standard proposes a bitmap configuration scheme taking into account overhead when the bitmap is transmitted as indicated above.

15 illustrates a configuration of a bitmap.

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

A bitmap scheme is classified into two types, a resource block group (RBG) scheme and a subset scheme.

In the resource block group (RBG) scheme, resource blocks (RB) are grouped into a plurality of groups. Resource Blocks (RB) are displayed in units of one group. Thus, a plurality of resource blocks (RBs) forming one group has a mapping association. When the group size is larger, it is difficult to perform resource allocation in detail, but it is possible to reduce the number of bits in the bitmap. In accordance with Figure 15, because N _PRB = 32, a bitmap of a total of 32 bits is required for one unit of resource allocation of resource blocks (RB). However, provided that the three resource blocks (RB) are grouped (P = 3) and the resources are allocated based on the group of resource blocks (RBG), all resource blocks (RB) can be divided into eleven groups in total. As a result, a bitmap of only 11 bits is required, thus significantly reducing the amount of control information. In comparison, when resources are allocated based on this group of resource blocks (RBGs), they cannot be allocated in units of one resource block (RBs), so that they cannot be allocated in detail.

To make up for this, a subset scheme is used. In this scheme, a plurality of resource block groups (RBGs) are set as one subset, and resources are allocated based on resource blocks (RBs) within each subset. In order to use a bitmap of 11 bits in the above resource block group (RBG) scheme in FIG. 15, it is possible to form “3” subsets (subset 1, subset 2 and subset 3). Here, “3” represents the number of resource blocks (RB) constituting each group of resource blocks (RBG) indicated above. As a result, N _RB / P = ceiling (32/3) = 11, so that resource blocks (RB) in each subset can be allocated based on resource blocks (RB) with 11 bits. Here, header information 1501 is required to indicate which of the schemes (resource block group (RBG) scheme or subset scheme) is used for the bitmap, and which subset is used if the subset scheme is used.

It is assumed that the header information 1501 simply indicates which scheme is used (resource block group (RBG) scheme or subset scheme), and some bits of the bitmap used for resource block groups (RBG) are used to indicate the type of subset, and not all resource blocks (RB) in all subsets can be used. For example, referring to FIG. 15, since a total of three subsets are specified, a 2-bit indicator 1503 of the subsets is required to identify the subsets. Here, a total of 12 resource blocks (RBs) are assigned to subset 1 (1504 or 1505), but only 9 bits remain in the bitmap out of a total of 11 bits if 2 bits of indicator 1503 subsets are excluded from the bitmap. It is not possible to individually indicate all twelve resource blocks (RB) with 9 bits. To solve this, one bit of the RBG bitmap can be assigned as a shift indicator 1506 so that it can be used to shift the location of the resource block (RB) indicated by the subset bitmap. For example, in the case where the subset indicator 1503 indicates subset 1 and the shift indicator 1506 indicates “shift 0”, the remaining 8 bits of the bitmap are used to indicate blocks 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 shift indicator 1506 indicates “shift 1”, the remaining 8 bits of the bitmap are used to indicate blocks RB10, RB11, RB18, RB19, RB20, RB27, RB28 and RB29 ( see 1505).

Although the subset indicator 1503 was described in the above example to indicate subset 1 (1504 or 1505), it can indicate subset 2 or subset 3. Accordingly, you can notice that eight resource blocks (RB) can be displayed in units of one resource block (RB ) with respect to each combination of a subset indicator 1503 and a shift indicator 1506. Also, referring to FIG. 15, in an existing embodiment 5, the number of resource blocks (RBs) assigned to a subset 1, a subset 2, and a subset 3 are 12, 11, and 9, which are different, respectively. Accordingly, it can be noted that four resource blocks (RB) cannot be used in case of subset 1, three resource blocks (RB) cannot be used in case of subset 2, 10, and one resource block (RB) cannot be used in case of subset 3 ( see shaded areas). FIG. 15 is only an illustration, and the existing embodiment is thus not limited to this.

Consideration can be made by using a combination of a bitmap scheme using a resource block group (RBG) scheme, and a 15 subset scheme, and a compact scheme.

FIG. 16 shows an example of a mapping method based on a combination of a bitmap circuit and a compact circuit.

In the case where the distributed virtual resource blocks (DVRB) are displayed and transmitted, as shown in FIG. 16, some resource 20 elements from the groups RBG0, RBG1, RBG2 and RBG4 are filled with distributed virtual resource blocks (DVRB). Among them, the RBG0 group is included in subset 1, the RBG1 and RBG4 groups are included in subset 2, and the RBG2 group is included in subset 3. Here it is not possible to distinguish the RBG0, RBG1, RBG2, and RBG4 groups for user equipment 25 (UE) in the resource group diagram blocks (RBG). Resource Blocks (RBs) (PRB0, PRB4, PRB8, and PRB12) remain in the RBGs after the allocation is performed, since distributed virtual resource blocks (DVRBs) must be allocated to user equipment units (UEs) in this subset scheme. However, since the user equipment (UE) allocated in the subset scheme can only be allocated a physical resource block (RB) in one subset, the remaining resource blocks (RB) belonging to other subsets remain unallocated to different units of user equipment (UE). As a result, the planning of localized virtual resource blocks (LVRB) is limited to the planning of distributed virtual resource blocks (DVRB).

Therefore, there is a need for a method for deploying distributed DVRBs that can reduce the planning constraints of localized virtual resource blocks (LVRBs).

Embodiments of the present invention from the third to the fifth are directed to methods for setting the relative distance between the divided parts of the distributed virtual resource blocks (DVRB) displayed on the physical resource blocks (PRB) in order to reduce the effect on the localized virtual resource blocks (LVRB).

<Embodiment 3>

Embodiment 3 is directed to a method where divided parts of distributed virtual resource blocks (DVRBs) are mapped, mapping divided parts to resource blocks (RBs) belonging to one particular subset, and then mapping the divided parts to resource blocks (RBs) belonging to other subsets, after mapping the divided parts to all resource blocks (RBs) of that particular subset.

According to this embodiment, when sequential indices of distributed virtual resource blocks (DVRBs) are mapped to distributed physical resource blocks (PRBs), they can be mapped distributively within one subset and then mapped to other subsets when they can no longer be mapped within that one subsets. Also, interleaving of sequential distributed virtual resource blocks (DVRBs) is performed within a subset.

17 and 18, a method for mapping distributed virtual resource blocks (DVRBs) according to one embodiment of the present invention is shown.

Distributed virtual resource blocks from DVRB0 to DVRB 11 are distributively displayed within subset 1 (1703), blocks from DVRB 12 to DVRB22 are then distributedly displayed within subset 2 (1704), and blocks from DVRB23 to DVRB31 are then distributedly displayed within subset 3 ( 1705). This mapping may be performed in a manner using a block interleaver for each subset, or in any other way.

This systematization can be achieved through the control circuit of the interleaver blocks.

<Embodiment 4>

Embodiment 4 is directed to a method of restricting the mapping of divided portions of a distributed virtual resource block (DVRB) to physical resource blocks (PRB) included in the same subset.

In Embodiment 4, space information can be used to display the divided parts of the same distributed virtual resource block (DVRB) within the same subset. Here, a parameter can be used for all physical resource blocks (PRBs), such as the aforementioned “Gap” space. Alternatively, another parameter may be used for one subset of the “Gapsubset” - this will be described in detail below.

It is possible to share a method for distributively populating sequential distributed virtual resource blocks (DVRBs) within a single subset and a method for displaying the divided parts of any distributed virtual resource blocks (DVRBs) within the same subset. In this case, it is preferable that the parameter «Gap _subset», meaning the difference between the numbers of physical resource blocks (PRB) within the same subset, can be used as information indicating the relative difference in position between the separated parts of the distributed virtual resource block (DVRB ) The meaning of the “Gap _subset ” parameter can be understood from FIG. The PRB blocks included in subset 1 are the blocks PRB0, PRB1, PRB2, PRB9, PRB10, PRB11, PRB18, PRB19, PRB20, PRB27, PRB28 and PRB29. Here, block PRB18 is spaced from block PRB0 within subset 1 by 6 indices (Gap _subset = 6). On the other hand, with respect to all physical resource blocks (PRB), the PRB18 block may be indicated to be 18 indices from the PRB0 block (Gap = 18).

<Embodiment 5>

Embodiment 5 is directed to a method for setting the relative distance between the divided parts of a distributed virtual resource block (DVRB) as a multiple of the square of the size of the resource block group (RBG).

Limiting the setting of the Gap space to a multiple of the resource block group (RBG) size, as in the present embodiment, provides the characteristics as described below. That is, when the relative distance between the divided parts of the distributed virtual resource block (DVRB) is indicated as the relative difference in location within the same subset, it is set to a multiple of the size (P) of the resource block group (RBG). Alternatively, when the relative distance between the divided parts of the DVRB is indicated as a location difference with respect to all physical resource blocks (PRB), it is limited to a multiple of the square (P) of the size of the resource block group (RBG).

For example, referring to FIG. 15, it can be noted that P = 3 and P ² = 9. Here, you can see that the relative distance between the first divided part 1701 and the second divided part 1702 of the DVRB is a multiple of P (= 3) since Gap _subset = 6 and a multiple of P ² (= 9) since Gap = 18.

In the case where a scheme based on this embodiment is used, since the probability that resource block groups (RBGs) of each of which use only certain resource elements will belong to the same subset is high, it is expected that the resource elements or resource blocks (RBs) left unused are present in the same subset. Therefore, it is possible to effectively use the distribution of the subset scheme.

Referring to FIG. 17, since the size of the RBG10 group is 2, it differs from the sizes (= 3) of other resource block groups (RBG). In this case, for the convenience of allocating indices of a distributed virtual resource block (DVRB), the RBG10 group cannot be used for distributed virtual resource blocks (DVRB). Also, as shown in FIGS. 17 and 18, a total of four groups of resource blocks (RBG), including a group of RBG9, belong to subset 1, a total of three groups of resource blocks (RBG), if we exclude the group RBG10, belong to subset 2, and a total of three groups resource blocks (RBGs) belong to subset 3. Here, for the convenience of allocating indices of a distributed virtual resource block (DVRB), group RBG9, among the four RBG groups belonging to subset 1, cannot be used for distributed virtual resource blocks (DVRB). Thus, the total complexity of the three groups of resource blocks (RBG) per subset can be used for distributed virtual resource blocks (DVRB).

In this case, as shown in FIG. 18, the indices of distributed virtual resource blocks (DVRBs) can be sequentially mapped to one subset (e.g., subset 1) used for distributed virtual resource blocks (DVRBs) among the subsets. If the indices of distributed virtual resource blocks (DVRBs) can no longer be mapped to one subset, then they can be mapped to the next subset (for example, subset 2).

On the other hand, it can be noted that the distributed virtual resource block (DVRB) indices are sequentially located in FIG. 11, but inconsistently located in FIGS. 12, 13, 14, 16, 17 and 18. Thus, the distributed virtual resource block indices (DVRBs) can be changed in location before being mapped to physical resource block (PRB) indices, and this change can be made by block interleaver. Next, a block interleaver structure according to the present invention will be described.

<Embodiment 6>

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

In detail, in a method for mapping sequential indices of distributed virtual resource blocks (DVRBs) to non-contiguous distributed physical resource blocks (PRBs), a method is proposed that uses a block interleaver and configures this interleaver so that it has a degree equal to a given diversity _ratio N _DivOrder · Degree interleaver can be defined as follows.

Thus, in a block interleaver having m rows and n columns, when data is recorded, data is recorded while their index is sequentially increased. Here, the record is performed in such a way that after one column is completely filled, the column index is increased by one and the next column is filled. In each column, recording is performed while the row index increases. When reading from the interleaver, the reading is performed in such a way that after one line is completely read, the row index is increased by one, and the next line is read. In this case, the interleaver may be called an interleaver of degree m.

On the other hand, in a block interleaver having m rows and n columns, data can be written in such a way that after one line is full, the process moves to the next line, and data can be read in such a way that after one column is read, the process advances to the next column. In this case, the interleaver may be called an interleaver of degree n.

In detail, N _{DivOrder is} limited to a multiple of N _D. Thus, N _DivOrder = K · N _D. Here, K is a positive integer. An interleaver of degree N _DivOrder blocks is also used.

Fig. 19 is an example where the number of resource blocks (RB) used in interleaving is N _DVRB = 24, N _D = 2, and N _DivOrder = 2 × 3 = 6.

With reference to FIG. 19, when writing to the interleaver, data is recorded while their index is sequentially increased. Here, the recording is performed in such a way that after one column is completely full, the column index is increased by one, and the next column is filled. In one column, recording is performed while the row index increases. When reading from the interleaver, the reading is performed in such a way that after one line is completely read, the row index is increased by one and the next line is read. In one row, reading is performed while the column index increases. In the case when the read / write is performed in this way, the degree of interleaver is the number of lines, which is set equal to a given diversity ratio, 6.

In the case where the interleaver is configured in this way, the order of the indices of the distributed virtual resource block (DVRB) of the data sequence output from the interleaver can be used as the order of the indices of the first divided parts of the distributed virtual resource blocks (DVRB), and the order of the indices of the distributed virtual resource blocks (DVRB) ) the data sequence obtained by cyclic shift of the output data sequence by N _DVRB / N _D , can be used as a sequence of indices existing divided parts. As a result, N _D divided parts generated from the distributed virtual resource block (DVRB), N _D are displayed on the physical resource block (PRB) pairs only, and the difference between the indexes paired distributed virtual resource block (DVRB) is equal to K.

For example, in _FIG . 19, N _DVRB / N _D = N _DVRB (= 24) / N _D (= 2) = _24/2 = 12 and K = 3. It can also be seen from Fig. 19 that the sequence of 1901 indices of distributed virtual resource blocks (DVRB) of the data sequence from the interleaver output has the form “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 the sequence of 1902 indices of distributed virtual resource blocks (DVRB) of the data sequence obtained by cyclic shift of this data sequence output from the interleaver by N _DVRB / N _D = 12, has the form “3 → 9 → 15 → 21 → 4 → 10 → 16 → 22 → 5 → 11 → 17 → 23 → 0 → 6 → 12 → 18 → 17 → 13 → 19 → 2 → 8 → 14 → 20 ". Distributed virtual resource blocks (DVRBs) are also paired. With reference to 1903 of FIG. 19, for example, it can be seen that the blocks DVRB0 and DVRB3 are paired. You can also notice that the corresponding combinations of the divided parts generated from the distributed virtual resource blocks DVRB0 and DVRB3 are mapped to the physical resource blocks PRB0 and PRB12, respectively. Similarly, this applies to other distributed virtual resource blocks (DVRBs) having different indices.

According to this embodiment, it is possible to efficiently control the relationship between the distributed virtual resource blocks (DVRB) and the physical resource blocks (PRB) onto which these distributed virtual resource blocks (DVRB) are mapped.

<Embodiment 7>

Next, a method for filling in zeros of a rectangular interleaver in accordance with one embodiment of the present invention will be described.

In the following description the number of zeros to fill the interleaver may be represented by the value «N _null».

In accordance with an embodiment 6 of the invention, it is possible to completely fill data interleaver because N _DVRB value is a multiple value of N _DivOrder. However, when the N _DVRB value is not a multiple of the N _DivOrder value, it is necessary to consider the method of filling with zeros, since it is impossible to completely fill the interleaver.

For a cyclic shift by N _DVRB / N _D , the value of N _DVRB must be a multiple of the value of N _D. To fully populate the rectangular interleaver, N _DVRB value must be a multiple of N _DivOrder value .However, when K> 1, the value of N _DVRB may not be a multiple of the N _DivOrder, even though it is a multiple value of N _D. In this case, usually, the block interleaver is sequentially filled with data, and then the remaining places of the block interleaver are filled with zeros. After that, reading is performed. If data is filled column by column, then data is read line by line, or if data is filled line by line, then data is read column by column. In this case, reading is not performed for zeros.

20 a and 20 b show the normal operation of the block interleaver when the number of resource blocks (RB) used in the interleaving operation is 22, namely, N _DVRB = 22, ND = 2 and N _DivOrder = 2 × 3 = 6, i.e. when N _{DVRB is} not a multiple of the value of N _DivOrder .

With reference to FIG. 20a, an index difference between paired distributed virtual resource blocks (DVRBs) is a random value. For example, the pairs of the distributed virtual resource block DVRB (0, 20), (6, 3) and (12, 9) (indicated by the positions “2001”, “2002” and “2003”) have an index difference of 20 (20-0 = 20 ), 3 (6-3 = 3) and 3 (12-9 = 3), respectively. Accordingly, it can be noted that the difference in the indices between the paired blocks of the DVRB is not fixed by a certain value. Therefore, planning distributed virtual resource blocks (DVRB) is difficult compared to the case in which the index difference between the paired blocks of distributed virtual resource blocks (DVRB) is a constant.

In addition, when it is assumed that N _Remain represents the remainder when the N _DVRB is divided by N _DivOrder , zeros fill the elements of the last column, with the exception of elements corresponding to N _Remain values, as shown in FIG. For example, referring to Fig. 20a, two elements of the last column can be filled with zeros, with the exception of four elements corresponding to four values, since the remainder when N _DVRB (= 22) is divided by N _DivOrder (= 6) is 4 (N _Remain = 4 ) Although the trailing part is filled with zeros in the above example, they can be placed before the value of the first index. For example, N _Remain values populate items starting with the first item. Also, zeros can be placed at predetermined locations, respectively.

21a and 21b illustrate a method for arranging zeros according to one embodiment of the present invention. Referring to FIGS. 21a and 21b, it can be seen that, compared to the case of FIGS. 20a and 20b, the zeros are uniformly distributed.

In this embodiment, when the rectangular block interleaver is filled with zeros, the N _DivOrder value corresponding to the degree of the interleaver is divided into ND groups, each of which is of size K, and the zeros are uniformly distributed in all groups. For example, as shown in FIG. 21a, the interleaver can be divided into N _D (= 2) groups G2101 and G2102. In the case under consideration, K = 3. One zero is recorded in the first group G2101. Similarly, one zero is recorded in the second group G2102. Thus, zeros are written distributively.

For example, when a record is performed in such a way that the values are sequentially populated, the result is N _Remain values. When the indices corresponding to the remaining values are placed in N _D groups so that they are uniformly distributed, a homogeneous distribution of zeros is possible. For example, in the case of FIG. 21a, N _Remain (= 4) data locations remain. When the indices 18, 19, 20, and 21 corresponding to the data places are placed in N _D (= 2) groups so that they are uniformly distributed, it is possible to place one zero in each group.

As a result, the difference between the paired indices of the distributed virtual resource blocks (DVRB) can be kept equal to K or less (for example, K = 3). Accordingly, there is an advantage in that a more efficient allocation of DVRB blocks can be achieved.

<Embodiment 8>

Next, a method for setting the relative distance between the divided parts of each distributed virtual resource block (DVRB) displayed on the physical resource blocks (PRB) to 0, in accordance with one embodiment of the present invention, will be described.

On Fig shows a method for displaying interleaved indices of a distributed virtual resource block (DVRB), while the space Gap = 0, in accordance with one embodiment of the present invention.

In addition, when M distributed virtual resource blocks (DVRBs) are allocated to one user equipment unit (UE) (terminal) in a mapping scheme of sequential indices of distributed virtual resource blocks (DVRBs) to non-adjacent, distributed physical resource blocks (PRBs), a reference value M _th for M based on the reference value M _th, the divided parts of each of the distributed virtual resource block (DVRB), respectively, may be distributively assigned to different physical resource blocks (P RB) to increase the diversity ratio. Alternatively, the divided parts of each distributed virtual resource block (DVRB) can be assigned to the same physical resource block (PRB), without being allocated to different physical resource blocks (PRB). In this case, it is possible to reduce the number of physical resource blocks (PRBs) onto which the distributed virtual resource blocks (DVRBs) are distributed and thus limit the diversity ratio.

Thus, this method is a scheme in which the divided parts of each distributed virtual resource block (DVRB) are distributed to increase the diversity factor when M is less than a certain reference value (= M _th ), whereas in the case when M is not less than a specific reference value (= M _th), divided parts of each of the distributed virtual resource block (DVRB) is assigned to the same PRB without performing block distribution to reduce the number of physical resource blocks (PRB), on a cat Distributed virtual resource blocks (DVRBs) are displayed in a distributive manner, and thus limit diversity diversity.

Thus, in this scheme, the distributed virtual resource block (DVRB) indices of the data sequence from the interleaver output are usually applied to all divided parts of each distributed virtual resource block (DVRB) so that they are mapped to physical resource blocks (PRB), such as shown in Fig.22. For example, referring to FIG. 9, indices of a distributed virtual resource block (DVRB) of a data sequence from an interleaver output have the order “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 distributed virtual resource block (DVRB) index of the data sequence is usually applied to the first and second divided parts 2201 and 2202 of each distributed virtual resource block (DVRB).

<Embodiment 9>

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

FIG. 23 shows a case in which user equipment UE1 is simultaneously multiplexed, which is scheduled in a mapping scheme of respective divided parts of each distributed virtual resource block (DVRB) to different physical resource blocks (PRB), as shown in FIG. 19, and user equipment UE2, which is scheduled in a mapping scheme of the divided parts of each distributed virtual resource block (DVRB) to the same PRB block, as shown in FIG. Thus, FIG. 23 shows a case in which user equipment UE1 and UE2 are simultaneously scheduled in accordance with the methods of Embodiments 6 and 8, respectively.

For example, referring to FIG. 23, the distributed virtual resource blocks DVRBO, DVRB1, DVRB2, DVRB3 and DVRB4 (2301) are allocated to the user equipment UE1, while the distributed virtual resource blocks DVRB6, DVRB7, DVRB8, DVRB9, DVRB 10 and 10 are allocated to the user equipment UE1 DVRB 11 (2302). However, the user equipment UE1 is scheduled such that the divided parts of each DVRB are mapped to different physical resource blocks (PRBs), respectively, while the user equipment UE2 is planned so that the divided parts of each DVRB are mapped to the same physical resource block PRB. Accordingly, the PRBs used for user equipment UE1 and UE2 include PRBO, PRB1, PRB4, PRB5, PRB8, PRB9, PRB 12, PRB13, PRB16, PRB17, PRB20 and PRB21, as shown at 2303 in FIG. 23 . In this case, however, the PRB8 and PRB20 units are partially used.

When the divided parts of each distributed virtual resource block (DVRB) are respectively mapped to distributed physical resource blocks (PRB), the difference between the pair indexes of the DVRB blocks is limited to K or less. Accordingly, this scheme does not affect distributed virtual resource blocks (DVRB), spaced from each other with a space greater than K. Accordingly, it is possible to easily distinguish indices suitable for use in the “case in which the divided parts of each DVRB block are mapped to one and the same PRB block "from" inappropriate "indexes.

<Embodiment 10>

Next, a method for limiting N _DVRB to prevent generation of zero will be described in accordance with one embodiment of the present invention.

Referring again to FIG. 20, it can be noted that the difference between the distributed virtual resource block (DVRB) indices paired for the PRB blocks may not be fixed by a certain value. In order to reduce the distributed virtual resource block (DVRB) index difference to a certain value or less, as described above, the method of FIG. 21 can be used.

When the method of FIG. 21 is used to distribute zeros, the interleaver complexity is increased due to the processing of zeros. To prevent such a phenomenon, a method can be considered in order to limit N _DVRB so that zero is not generated.

In the illustrated interleaver, the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely N _DVRB , is limited by a multiple of the diversity _factor , namely N _DivOrder , so that the rectangular interleaver matrix is not filled with zeros.

In a block interleaver of degree D, the rectangular interleaver matrix is not filled with zeros when the number of resource blocks (RB) used for DVRB blocks, namely N _DVRB , is limited to a multiple of D.

Next will be described several embodiments using the interleaver according to the present invention when K = 2 and N _D = 2. The relationship between the indices of physical resource blocks (PRB) and distributed virtual resource blocks (DVRB) can be expressed by a mathematical expression.

24 illustrates the relationship between the indices of PRB and DVRB blocks.

Referring to the following description and FIG. 24, the following parameters are intended to be used in mathematical expressions.

p: the index of the physical resource block is PRB (0≤p≤N _DVRB -1),

d: DVRB Distributed Virtual Resource Block Index (0≤d≤N _DVRB -1),

P _{1, d} : index of the first slot of the PRB block onto which this index d of the DVRB block is mapped,

p _{2, d} : index of the second slot of the PRB block onto which this index d of the DVRB block is mapped,

d _p1 : index of a distributed virtual resource block (DVRB) included in the first slot of a given index p of a physical resource block (PRB),

d _p2 : index of the distributed virtual resource block (DVRB) included in the second slot of this index p of the physical resource block (PRB).

The constants used in expressions 1-11 expressing the relationship between the DVRB and PRB block indices are defined as follows.

C: the number of columns of the interleaver blocks,

R: number of rows of block interleaver,

N _DVRB : the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB),

R = [N _DVRB / C],

NPRb: The number of physical resource blocks (PRB) in the system bandwidth.

Figa explains the above constants.

When K = 2, N _D = 2, and N _DVRB is a multiple of C, the relationship between the indices of physical resource blocks (PRB) and distributed virtual resource blocks (DVRB) can be obtained using Expressions 1-3. First, if the index p of the physical resource block (PRB) is given, then the index of the distributed virtual resource block (DVRB) can be obtained using Expressions 1 or 2. In the following description, “mod (x, y)” means “x mod y” , and “mod” means a modulo operation. Also, "[·]" means the operation of decreasing and represents the largest of the integers equal to or less than the number indicated in "[·]". On the other hand, "[·]" means the operation of increasing and represents the smallest of integers equal to or greater than the number indicated in "[·]". Also, “round (*)” represents an integer closest to the number indicated in brackets “()”. Also, “min (x, y)” represents a value that is not large among x and y, while “max (x, y)” represents a value that is not smaller among x and y.

[Expression 1]

d _p1 = mod (p, R) · C + [p / R],

_{d p2 = mod (p ',} R) · C + [p' / R],

where p '= mod (p + N _DVRB / 2, N _DVRB ).

[Expression 2]

d _p1 = mod (p, R) C + [p / R]

$$d_{\mathrm{<figure-callout\; id="2"\; label="p"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">p</figure-callout>}2}=\{\begin{array}{c}{d}_{p\mathrm{one}}-2\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(d_{p\mathrm{one}},C\right)\ge 2\\ d_{p\mathrm{one}}+2\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(d_{p\mathrm{one}},C\right)<2\end{array}$$

On the other hand, when N _DVRB is a multiple of C and an index d of a distributed virtual resource block (DVRB) is specified, the index of the physical resource block (PRB) can be obtained using Expression 3.

[Expression 3]

P _{1, d} = mod (d, C) · R + [d / C],

p _{2, d} = mod (p _{1, d} + N _DVRB / 2, N _DVRB ).

Fig. 25b shows a conventional method for filling zeros of an interleaver. This method applies to the case in which K = 2, N _D = 2 and N _DVRB is a multiple of N _d . The method shown in FIG. 25b is similar to the method in FIGS. 20a and 20b. According to the method of FIG. 25b, if the index p of the physical resource block (PRB) is specified, then the index of the distributed virtual resource block (DVRB) can be obtained using Expression 4.

[Expression 4]

d _p1 = mod (p ', R) · C + [p' / R],

$$p\text{'}\text{'}=\{\begin{array}{c}p+\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{RB}^{\text{'}\text{'}},C\right)\ne 0\mathrm{and}p\ge 3R-\mathrm{one}\\ p,\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{RB}^{\text{'}\text{'}},C\right)=0\mathrm{and}p<3R-\mathrm{one}\end{array}$$

d _p2 = mod (p ", R) · C + [p" / R],

Where $$p\text{'}\text{'}=\{\begin{array}{l}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}+\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{RB}^{\text{'}\text{'}},C\right)\ne 0\mathrm{and}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\ge 3R-\mathrm{one}\hfill \\ p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'},\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{RB}^{\text{'}\text{'}},C\right)=0\mathrm{and}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<3R-\mathrm{one}\hfill \end{array}$$

wherein p '''= mod (p + N _DVRB / 2, N _DVRB ).

On the other hand, if the index d of the distributed virtual resource block (DVRB) is specified, then the index of the physical resource block (PRB) can be obtained using Expression 5.

[Expression 5]

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}}-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p\ge 2R-\mathrm{one}\mathrm{and}\text{A.}\text{A.}p\ne 3R-2\\ 2R-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p=3R-2\\ p,\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)=0\mathrm{and}l\mathrm{and}p<2R-\mathrm{one}\end{array}$$

Where

p _{2, d} = mod (p _{1, d} + N _DVRB / 2, N _DVRB )

<Embodiment 11>

FIG. 25c shows a method for filling zeros of an interleaver in accordance with one embodiment of the present invention. This method applies to the case in which K = 2, N _D = 2, and N _DVRB is a multiple of N _D.

Fig. 25c illustrates a method corresponding to the method of Embodiment 7 of the invention and Figs. 21a and 21b. The method shown in FIG. 25c can be explained using Expressions 6-8. According to the method of FIG. 25c, if an index p of a physical resource block (PRB) is specified, then a distributed virtual resource block (DVRB) index can be obtained using Expressions 6 or 7.

[Expression 6]

d _p1 = mod (p ', R) · C + [p' / R]

$$p\text{'}\text{'}=\{\begin{array}{c}p+\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p\ge 2R-\mathrm{one}\mathrm{and}\text{A.}\text{A.}p\ne 3R-2\\ 2R-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p=3R-2\\ p,\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)=0\mathrm{and}l\mathrm{and}p<2R-\mathrm{one}\end{array}$$

d _p2 = mod (p ", R) · C + [p"'/ R]

$$p\text{'}\text{'}\text{'}\text{'}=\{\begin{array}{c}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}+\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\ge 2R-\mathrm{one}\mathrm{and}\text{A.}\text{A.}p\ne 3R-2\\ 2R-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p=3R-2\\ p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'},\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)=0\mathrm{and}l\mathrm{and}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<2R-\mathrm{one}\end{array}$$

wherein p '''= mod (p + N DVRB / 2, N _DVRB)

[Expression 7]

d _p1 = mod (p ', R) · C + [p' / R]

$$p\text{'}\text{'}=\{\begin{array}{c}p+\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p\ge 2R-\mathrm{one}\mathrm{and}\text{A.}\text{A.}p\ne 3R-2\\ 2R-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}p=3R-2\\ p,\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)=0\mathrm{and}l\mathrm{and}p<2R-\mathrm{one}\end{array}$$

$$d_{\mathrm{<figure-callout\; id="2"\; label="p"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">p</figure-callout>}2}=\{\begin{array}{c}{d}_{p\mathrm{one}}-2\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(d_{p\mathrm{one}},C\right)\ge 2\\ \begin{array}{l}{d}_{p\mathrm{one}}+2\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(d_{p\mathrm{one}},C\right)<2\mathrm{and}{d}_{p\mathrm{one}}\ne N_{DVRB}-2\mathrm{and}{d}_{p\mathrm{one}}\ne N_{DVRB}-\mathrm{one}\\ N_{DVRB}-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(d_{p\mathrm{one}},C\right)<2\mathrm{and}{d}_{p\mathrm{one}}\ne N_{DVRB}-2\\ N_{DVRB}-2\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(d_{p\mathrm{one}},C\right)<2\mathrm{and}{d}_{p\mathrm{one}}\ne N_{DVRB}-\mathrm{one}\end{array}\end{array}$$

On the other hand, in the method of FIG. 25c, if the index d of the distributed virtual resource block (DVRB) is specified, then the index of the physical resource block (PRB) can be obtained using Expression 8.

[Expression 8]

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}}-\mathrm{one,}\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}\mathrm{mod}\left(d,C\right)\ge 2\\ 3R-2\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)\ne 0\mathrm{and}d=N_{DVRB}-\mathrm{one}\\ p_{\mathrm{one,}d}^{\text{'}\text{'}},\mathrm{to}\mathrm{about}gd\mathrm{but}\mathrm{mod}\left(N_{DVRB},C\right)=0\mathrm{and}l\mathrm{and}\left(\mathrm{mod}\left(d,C\right)<2\mathrm{and}d\ne N_{DVRB}-\mathrm{one}\right)\end{array}$$

Where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=\mathrm{mod}\left(d,C\right)\cdot R+\left[d/C\right]$$

p _{2, d} = mod (p _{1, d} + N _DVRB / 2, N _DVRB )

<Embodiment 12>

FIG. 25d shows a method implemented using the method of Embodiment 7 and FIGS. 21a and 21b when K = 2, N _D = 2, and the interleaver size (= C × R) is set such that C · R = N _DVRB + N _null . Here, “N _null ” represents the number of zeros to be added to the interleaver. This N _null value may be a predefined value. According to this method, if the index p of the physical resource block (PRB) is specified, then the distributed virtual resource block index (DVRB) can be obtained using Expressions 9 or 10.

[Expression 9]

d _p1 = mod (p ', R) · C + [p' / R],

Where

$$p\text{'}\text{'}=\{\begin{array}{c}p,\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}=0\mathrm{and}l\mathrm{and}p<R-N_{null}/2\mathrm{and}l\mathrm{and}R\le p<2R-N_{null}/2\\ p+N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}l\mathrm{and}\left(2R-N_{null}/2\le p<3R-N_{null}\mathrm{and}l\mathrm{and}p\ge 3R-N_{null}/2\right)\end{array}$$

_{d p1 = mod (p ',} R) · C / 2 + [p' / 2R]

$$p\text{'}\text{'}=\{\begin{array}{c}p+R-N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}R-N_{null}/2\le p<R\\ p+R,\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}3R-N_{null}\le p<3R-N_{null}/2\end{array}$$

[Expression 10]

d _p2 = mod (p ", R) · C + [p"'/ R]

Where

$$p\text{'}\text{'}\text{'}\text{'}=\{\begin{array}{c}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'},\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}=0\mathrm{and}l\mathrm{and}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<R-N_{null}/2\mathrm{and}l\mathrm{and}R\le p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<2R-N_{null}/2\\ p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}+N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}l\mathrm{and}\left(2R-N_{null}/2\le p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<3R-N_{null}\mathrm{and}l\mathrm{and}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\ge 3R-N_{null}/2\right)\end{array}$$

d _p2 = mod (p ", R) · C / 2 + [p"'/ 2R]

Where $$p\text{'}\text{'}\text{'}\text{'}=\{\begin{array}{c}p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}+R-N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}R-N_{null}/2\le p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<R\\ p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}+R,\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}3R-N_{null}\le p\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}<3R-N_{null}/2\end{array}$$

On the other hand, if the index d of the distributed virtual resource block (DVRB) is specified, then the index of the physical resource block (PRB) can be obtained using Expression 11.

[Expression 11]

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}},\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}l\mathrm{and}\left(d<N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C\right)<2\right)\\ p_{\mathrm{one,}d}^{\text{'}\text{'}}-N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d<N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C\right)\ge 2\right)\end{array}$$

,Where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=\mathrm{mod}\left(d,C\right)\cdot R+\left[d/C\right]$$

,

$$p_{\mathrm{one,}d}=\{\begin{array}{c}{p}_{\mathrm{one,}d}^{\text{'}\text{'}}-R+N_{null}/2\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d\ge N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=0\right)\\ p_{\mathrm{one,}d}^{\text{'}\text{'}}-R,\mathrm{to}\mathrm{about}gd\mathrm{but}{N}_{null}\ne 0\mathrm{and}\left(d\ge N_{DVRB}-N_{null}\mathrm{and}\mathrm{mod}\left(d,C/2\right)=\mathrm{one}\right)\end{array}$$

,Where $$p_{\mathrm{one,}d}^{\text{'}\text{'}}=\mathrm{mod}\left(p_{\mathrm{one,}d}+N_{DVRB}/2N_{DVRB}\right)$$

,

p _{2, d} = mod (p _{1, d} + N _DVRB / 2, N _DVRB )

Referring again to the description given with reference to FIG. 15, one can consider a case in which a combination of a bitmap scheme using a resource block group (RBG) scheme and a subset scheme and a compact scheme is used. Problems that may occur in this case will be described with reference to FIGS. 26 and 27.

FIGS. 26 and 27 show examples of a method using, respectively, a combination of a bitmap scheme using an RBG scheme and a subset scheme and a compact scheme.

As shown in FIG. 26, each DVRB can be divided into two parts, and the second part of these divided parts can be cyclically shifted by a predetermined space (Gap = N _DVRB / N _D = _50/2 ). In this case, only a part of the resource elements of the RBG0 group, consisting of physical resource blocks (PRB), is displayed as the first divided part of the distributed virtual resource block (DVRB), and only a part of the resource elements of the groups RBG8 and RBG9, each of which consists of physical resource blocks (PRB) is displayed by the second divided part of the distributed virtual resource block (DVRB). Therefore, the RBGO, RBG8, and RBG9 groups cannot be applied to a scheme using resource allocation based on the resource block group (RBG).

To solve this problem, a space can be set to a multiple of the number of resource blocks (RB) included in one RBG group, namely M _RBG . Thus, a space can satisfy the condition “Gap = M _RBG * k” (where k is a natural number). When a space is set to satisfy this condition, it may have a value of, for example, 27 (Gap = M _RBG * k = 3 * 9 = 27). When the gap is Gap = 27, each distributed virtual resource block (DVRB) can be divided into two parts, and the second of these divided parts can be cyclically shifted to a gap (Gap = 27). In this case, only the part of the resource elements of the RBGO group, which consists of physical resource blocks (PRB), is displayed as the first divided part of the distributed virtual resource block (DVRB), and only the part of the resource elements of the group RBG9, which consists of physical resource blocks (PRB) is displayed as the second divided part of the distributed virtual resource block (DVRB). Accordingly, in the method of FIG. 27, the RBG8 group can be applied to a scheme using resource allocation based on the resource block group (RBG), in contrast to the method of FIG. 26.

However, in the method of FIG. 27, distributed virtual resource block (DVRB) indices paired in one physical resource block (PRB) cannot be paired in another physical resource block (PRB). On the other hand, in FIG. 26, indices 1 and 26 of the distributed virtual resource block (DVRB) paired in PRB1 (2601) are also paired in PRB26 (2603). However, in the method of FIG. 27, distributed virtual resource block (DVRB) indices 1 and 27 paired in PRB 1 (2701) may not be paired in PRB25 or PRB27 (2703 or 2705).

In the cases shown in FIGS. 26 or 27, the distributed virtual resource blocks DVRB1 and DVRB2 are mapped to physical resource blocks PRB1, PRB2, PRB25 and PRB26. In this case, the resource element segments of the blocks PRB1, PRB2, PRB25 and PRB26 are left without displaying.

In the case shown in Fig. 26, if the DVRB25 and DVRB26 blocks are additionally mapped to physical resource blocks (PRB), then they completely fill the remaining places (segments) of the blocks PRB1, PRB2, PRB25 and PRB26.

However, in the case of FIG. 27, if the DVRB25 and DVRB26 are additionally mapped to PRB blocks, then the DVRB25 and DVRB26 blocks are mapped to PRBO, PRB25, PRB26, and PRB49. As a result, the unmapped parts (segments) of the resource elements of blocks PRB1 and PRB2 are still left without filling with DVRB blocks. Thus, in the case of FIG. 27, there is a drawback in that there are usually physical resource blocks (PRBs) left without display.

The problem occurs because the cyclic shift is performed in such a way that the space value does not equal N _DVRB / N _D. When N _DVRB / N _D is a multiple of M _RBG , the above problem is solved because the cyclic shift corresponds to a multiple of M _RBG .

<Embodiment 13>

In order to simultaneously solve the problems of the methods of FIGS. 26 and 27, respectively, the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely N _DVRB , is limited to a multiple of N _D · M _RBG in accordance with one of embodiments of the present invention.

<Embodiment 14>

.In addition, it can be noted that in the above cases, the first and second divided parts of each distributed virtual resource block (DVRB) belong to different subsets, respectively. To make the two divided parts of each DVRB block belonging to the same subset, the space must be set as a multiple of the square $$M_{RBG}\left(M_{{}_{RBG}}^2\right)$$

.

, чтобы две разделенные части каждого распределенного виртуального ресурсного блока (DVRB) принадлежали одному и тому же подмножеству, и чтобы сделать распределенные виртуальные ресурсные блоки (DVRB) парными.Therefore, in another embodiment of the present invention, the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely, the value of N _DVRB , is limited to a multiple of $$N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

so that the two divided parts of each distributed virtual resource block (DVRB) belong to the same subset, and to make the distributed virtual resource blocks (DVRB) paired.

On Fig shows a case in which the value of N _{DVRB is} set to a multiple of N _D * M _RBG .

As shown in FIG. 28, the divided portions of the distributed virtual resource blocks (DVRB) can always be paired in the physical resource blocks (PRB) in accordance with the cyclic shift, since the space is a multiple of M _RBG · N _D. It is also possible to reduce the number of RBG groups in which there are resource elements having parts not filled with distributed virtual resource blocks (DVRB).

<Embodiment 15>

On Fig shows a case in which the indices of the distributed virtual resource blocks (DVRB) are subjected to interleaving in accordance with the method shown in Fig.

When the DVRB block indices are interleaved, as shown in FIG. 29, it may be possible to set the N _{DVRB to a} multiple of N _D · M _RBG when the distributed virtual resource block (DVRB) indices are mapped to physical resource blocks (PRBs). However, in this case, there may be a situation, as shown in FIGS. 20a and 20b, that the rectangular interleaver matrix is not completely populated with distributed virtual resource block (DVRB) indices. In this case, accordingly, it is necessary to fill in the blanks of the rectangular interleaver matrix with zeros. To avoid the requirement that zeros are filled with an interleaver of blocks of degree D, it is necessary to limit the number of resource blocks (RB) used for DVRB blocks to a multiple of D.

Accordingly, in one embodiment of the present invention, a space is set as a multiple of M _RBG , and the second divided portion of each DVRB is cyclically shifted by N _RB / N _D so that the distributed virtual resource block (DVRB) indices mapped to one physical resource block ( PRB) are paired. Also, in order to avoid filling the block interleaver with zeros, the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely N _DVRB , is limited to the number that is a multiple of N _D · M _RBG and D. In this case, if D is equal to the diversity _factor (N _DivOrder = K · N _D ) used in the interleaver, then N _{DVRB is} limited to the number common multiple for N _D · M _RBG and K · N _D.

<Embodiment 16>

и D. В этом случае, если D равно кратности разнесения (N_DivOrder=K·N_D), используемой в перемежителе, то N_DVRB ограничивают общим кратным для $$N_D\cdot M_{{}_{RBG}}^2$$

и K·N_D.In another embodiment of the present invention, a space is set as a multiple of the square M _RBG to make the two divided parts of each distributed virtual resource block (DVRB) located on the same subset. Also, the second divided portion of each DVRB block is cyclically shifted by N _RB / N _D so that the distributed virtual resource block (DVRB) indices mapped to one physical resource block (PRB) are paired. To avoid filling the block interleaver with zeros, the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely the value of N _DVRB , is limited to a common multiple of $$N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

and D. In this case, if D is equal to the diversity _factor (N _DivOrder = K · N _D ) used in the interleaver, then N _{DVRBs are} limited to a common multiple for $$N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

and K · N _D.

<Embodiment 17>

In addition, FIG. 30 shows a case in which D is set to the number of columns, namely, C and C are set to N _DivOrder (N _DivOrder = K · N _D ).

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

. Поскольку число строк R равно N_DVRB/D (R=N_DVRB/D), количество ресурсных блоков (RB), используемых для распределенных виртуальных ресурсных блоков (DVRB), а именно N_DVRB, ограничивают числом, кратным $$D\cdot M_{{}_{RBG}}^2$$

.In the embodiment of FIG. 30, the N _{DVRB value is} set such that consecutive distributed virtual resource block (DVRB) indices are assigned to the same subset. An example rectangular interleaver is configured such that consecutive indices fill the same subset when the number of rows is a multiple of $$M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

. Since the number of R rows is N _DVRB / D (R = N _DVRB / D), the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely N _DVRB , is limited to a multiple of $$D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

.

и $$N_D\cdot M_{{}_{RBG}}^2$$

. Когда D=K·N_D, значение N_DVRB ограничивают $$K\cdot N_D\cdot M_{{}_{RBG}}^2$$

, поскольку общее кратное для $$K\cdot N_D\cdot M_{{}_{RBG}}^2$$

и $$N_D\cdot M_{{}_{RBG}}^2$$

равно $$K\cdot N_D\cdot M_{{}_{RBG}}^2$$

.To map the two divided parts of each distributed virtual resource block (DVRB) to physical resource blocks (PRB) in the same subset, the number of resource blocks (RB) used for these DVRB blocks, namely N _DVRB , is limited to a common multiple of $$D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

and $$N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

. When D = K · N _D , the value of N _{DVRB is} limited $$K\cdot N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

, since the common multiple for $$K\cdot N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

and $$N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

equally $$K\cdot N_D\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

.

As a result, the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB) can be the maximum number of distributed virtual resource blocks (DVRB) satisfying the above-described restrictions within the number of physical resource blocks (PRB) in the entire system. Resource Blocks (RBs) used for Distributed Virtual Resource Blocks (DVRBs) may be used in the interleaving method.

<Embodiment 18>

Next, a mapping method using time indices of physical resource blocks (PRBs) when N _PRB and N _DVRB have different durations will be described, in accordance with one embodiment of the present invention.

On Fig shows methods in which, when N _PRB and N _DVRB have different durations, the result of the mapping to blocks of PRB made using the interleaver of distributed virtual resource block (DVRB) Fig.29, once again processed to ultimately make distributed virtual resource blocks (DVRB) corresponding to physical resource blocks (PRB).

One of the circuits shown in FIG. 31 as (a), (b), (c) and (d) can be selected in accordance with the use of system resources. In this design, the p value in the above-described related expressions of the indices of distributed virtual resource blocks (DVRB) and physical resource blocks (PRB) is defined as a temporary index of a physical resource block (PRB). In this case, the value of o obtained after adding N _offset to p greater than N _threshold is used as the final index of the physical resource block (PRB).

In this case, four alignment patterns, respectively shown in FIG. 31, can be represented by Expression 12.

[Expression 12]

(a): N _threshold = N _DVRB / 2, N _offset = N _PRB -N _DVRB ,

(b): N _threshold = 0, Noffset = 0,

(c): N _threshold = 0, N _offset = N _PRB -N _DVRB ,

(d): N _threshold = 0, N _offset = [(N _PRB -N _DVRB ) / 2] or N _offset = [(N _PRB -N _DVRB ) / 2].

Here, (a) represents format alignment (simultaneous left and right alignment), (b) represents left alignment, (c) represents right alignment, and (d) represents central alignment (center alignment). In addition, if a physical resource block (PRB) index is specified, then the distributed virtual resource block (DVRB) index d can be obtained from Expression 13 using the temporary physical resource block (PRB) index p.

[Expression 13]

$$p=\{\begin{array}{c}o-N_{offset},o\ge N_{threshold}+N_{offset}\\ o,\mathrm{to}\mathrm{about}gd\mathrm{but}o<N_{threshold}\end{array}$$

On the other hand, if the index d of the distributed virtual resource block (DVRB) is specified, then the index of the physical resource block (PRB) can be obtained from Expression 14 using the time index p of the physical resource block (PRB).

[Expression 14]

$$o_{i,d}=\{\begin{array}{c}{p}_{i,d}+N_{offset},\mathrm{to}\mathrm{about}gd\mathrm{but}{p}_{i,d}\ge N_{threshold}\\ p_{i,d},\mathrm{to}\mathrm{about}gd\mathrm{but}{p}_{i,d}<N_{threshold}\end{array}$$

<Embodiment 19>

Next, a mapping method capable of maximizing N _DVRB to a maximum while satisfying space limitations in accordance with one embodiment of the present invention will be described.

In previous embodiments, interleaver structures have been proposed in order to reduce the number of physical resource blocks (PRBs) in which there are resource elements having parts (segments) not filled with distributed virtual resource blocks (DVRBs), where the scheme of resource block groups (RBGs) ) and / or subset schema are provided for allocating LVRB blocks. In previous embodiments, methods have also been proposed in order to limit the number of resource blocks (RB) used for distributed virtual resource blocks (DVRB), namely, to limit the value of N _DVRB .

However, since the restriction condition caused by M _RBG becomes more stringent, the restriction on the number of resource blocks (RB) suitable for DVRB blocks, namely, N _DVRB , among the total number of PRB blocks, namely, N _PRB , is strengthened.

On Fig shows a case of using a rectangular interleaver having the conditions "N _PRB = 32", "M _RBG = 3", "K = 2" and "N _D = 2".

, чтобы позволить двум разделенным частям каждого распределенного виртуального ресурсного блока (DVRB) отображаться на блоки PRB, принадлежащие одному и тому же подмножеству, при этом имея максимальное значение, не превышающее N_PRB, то установка N_DVRB равна 18 (N_DVRB=18).When it is established that N _DVRB must be a multiple of $$N_D\cdot M_{{}_{RBG}}^2\left(=\mathrm{eighteen}\right)$$

to allow two divided parts of each distributed virtual resource block (DVRB) to be mapped onto PRB blocks belonging to the same subset, while having a maximum value not exceeding N _PRB , then setting N _DVRB is 18 (N _DVRB = 18).

In order to enable two divided portions of each distributed virtual resource block (DVRB) to be mapped to physical resource blocks (PRB) belonging to the same subset, in the case shown in FIG. 32, the value of N _{DVRB is} set to 18 (N _DVRB = eighteen). In this case, 14 resource blocks (RB) (32-18 = 14) cannot be used for DVRB blocks.

In this case, you can notice that the value of N _gap is 9 (N _gap = 18/2 = 9), and the DVRB0 block is mapped to the corresponding first resource blocks (RB) of the groups RBG0 and RBG3 belonging to the same subset.

Accordingly, the present invention provides a method for satisfying a space constraint when N _D = 2 by setting an offset and a threshold value to which the offset will be applied, as previously proposed, without directly reflecting the space constraint conditions on the N _DVRB .

.1) First, set the desired constraint conditions for the space. For example, a space can be set to a multiple of M _RBG or a multiple of $$M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

.

2) Then, the number closest to N _PRB / 2 among the numbers satisfying the space restriction conditions is set as the value of N _gap .

3) When the N _gap value is less than N _PRB / 2, the same mapping is used as the mapping in FIG.

4) When the value of N _gap is equal to or greater than N _PRB / 2, and zero interleaver is allowed, N _{DVRB is} set so that N _DVRB = (N _PRB -N _gap ) · 2. However, when zero padding of the interleaver is not permitted, N _DVRBs are set such that

N _DVRB = [min (N _PRB -N _gap , N _gap ) · 2 / C] · C.

5) Offset applies to half or more N _DVRBs . Thus, the reference value for applying the offset, namely the value of N _threshold , is set so that N _threshold = N _DVRB / 2.

6) The offset is set so that the temporary physical resource blocks (PRB) to which the offset is applied satisfy the space constraint conditions.

Thus, the value of N _{offset is} set so that N _offset = N _gap -N _threshold .

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

[Expression 15]

1. Setting the value of N _gap according to the conditions for the space:

:Subject to multiplicity $$M_{{}_{RBG}}^2$$

:

$$N_{gap}=round\left(N_{PRB}/\left(2\cdot M_{{}_{RBG}}^2\right)\right)\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

Given the multiplicity M _RBG :

$$N_{gap}=round\left(N_{PRB}/\left(2\cdot M_{RBG}\right)\right)\cdot M_{RBG}$$

2. Setting the value of N _DVRB :

Subject to permission to fill with zeros:

N _DVRB = min (N _PRB -N _gap , N _gap )

Provided there is no permission to fill with zeros:

N _DVRB = [min (N _PRB -N _gap , N _gap ) · 2 / C] · C

3. Setting the reference value N _threshold : N _threshold = N _DVRB / 2

4. Setting the offset N _offset : N _offset = N _gap -N _threshold

On Fig shows the application of the rule of display of distributed virtual resource blocks (DVRB), proposed in the present invention, when N _PRB = 32, M _RBG = 3, and the parameters of the rectangular interleaver K = 2 and N _D = 2.

будучи ближайшим к N_PRB/2, для отображения двух разделенных частей каждого распределенного виртуального ресурсного блока (DVRB) на физические ресурсные блоки (PRB), принадлежащие одному и тому же подмножеству, установка N_gap равна 18 (Ngap=18). В этом случае, 28 ресурсных блоков (RB) ((32-18)×2=28) используются для блоков DVRB. Таким образом, устанавливают условия «N_DVRB=28», «N_threshold=28/2=14» и «N_offset=18-14=4». Соответственно, временные индексы блоков PRB, на которые отображаются индексы блоков DVRB, подвергнутые перемежению в прямоугольном перемежителе, сравнивают со значением N_threshold. Когда N_offset добавляют к временным индексам блоков PRB, удовлетворяющим значению N_threshold, получают результат, как показано на Фиг.33. Обращаясь к Фиг.33, можно заметить, что две разделенные части блока DVRB0 отображаются на соответствующие первые ресурсные блоки (RB) групп RBGO и RBG6, принадлежащие одному и тому же подмножеству. Когда этот способ сравнивается со способом, показанным на Фиг.32, можно также заметить, что количество ресурсных блоков (RB), подходящих для распределенных виртуальных ресурсных блоков DVRB, увеличивается с 18 до 28. Поскольку пробел также увеличивается, разнесение в отображении распределенных виртуальных ресурсных блоков (DVRB) может быть дополнительно увеличено.When the value of N _{gap is} set so that it is a multiple $$M_{{}_{RBG}}^2\left(=9\right)$$

being closest to N _PRB / 2, to map two divided parts of each distributed virtual resource block (DVRB) to physical resource blocks (PRB) belonging to the same subset, the setting of N _gap is 18 (Ngap = 18). In this case, 28 resource blocks (RB) ((32-18) × 2 = 28) are used for DVRB blocks. Thus, the conditions “N _DVRB = 28”, “N _threshold = _28/2 = 14” and “N _offset = 18-14 = 4” are set. Accordingly, the temporal indices of the PRB blocks onto which the DVRB block indices subjected to interleaving in a rectangular interleaver are mapped are compared with the N _threshold value. When N _{offset is} added to the time indices of PRB blocks satisfying the N _threshold value, the result is obtained, as shown in FIG. 33. Turning to FIG. 33, it can be noted that the two divided portions of the DVRB0 block are mapped to the corresponding first resource blocks (RB) of the RBGO and RBG6 groups belonging to the same subset. When this method is compared with the method shown in FIG. 32, it can also be seen that the number of resource blocks (RB) suitable for the distributed virtual resource blocks of the DVRB increases from 18 to 28. Since the space also increases, the diversity in the display of the distributed virtual resource blocks (DVRB) can be further increased.

<Embodiment 20>

Next, a mapping method capable of increasing N _DVRB to a maximum value when mapping consecutive indices to specific locations in accordance with one embodiment of the present invention will be described.

для планирования локализованных виртуальных ресурсных блоков (LVRB) подобно установке пробела. В этом случае, когда предполагается, что степень перемежителя равна количеству столбцов, а именно С, количество строк, а именно R, должно быть кратным M_RBG или кратным $$M_{{}_{RBG}}^2$$

. Соответственно, размер перемежителя, а именно N_interleaver=C·R, должен быть кратным C·M_RBG или кратным $$C\cdot M_{{}_{RBG}}^2$$

. Таким образом, если значение N_DVRB предварительно задано, то минимальный размер перемежителя, удовлетворяющий вышеупомянутым условиям, может быть получен следующим образом.When multiple distributed virtual resource blocks (DVRBs) are allocated to a single user equipment unit (UE), the distributed DVRBs are consecutive distributed virtual resource blocks (DVRBs). In this case, accordingly, it is preferable to set adjacent indices so that they are placed at intervals that are multiples of M _RBG or multiples of $$M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

for planning localized virtual resource blocks (LVRBs) like setting a space. In this case, when it is assumed that the degree of interleaver is equal to the number of columns, namely C, the number of rows, namely R, must be a multiple of M _RBG or a multiple $$M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

. Accordingly, the size of the interleaver, namely, N _interleaver = C · R, must be a multiple of C · M _RBG or a multiple $$C\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

. Thus, if the value of N _{DVRB is} predefined, then the minimum interleaver size satisfying the above conditions can be obtained as follows.

If there is no multiplicity, N _interleaver = [N _DVRB / C] · C.

In this case, respectively, R = N _interleaver / C = [N _DVRB / C].

Given the multiplicity of the value of C · M _RBG , the value of N _interleaver = [N _DVRB / (C · M _RBG )] · C · M _RBG .

In this case, respectively, R = N _interleaver / C = [N _DVRB / (C · M _RBG )] · M _RBG .

, значение $$N_{\mathrm{int}\text{}erleaver}=\left[N_{DVRB}/\left(C\cdot M_{{}_{RBG}}^2\right)\right]\cdot C\cdot M_{{}_{RBG}}^2$$

,Subject to the multiplicity of the value $$C\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

, value $$N_{\mathrm{int}\text{A.}erleaver}=\left[N_{DVRB}/\left(C\cdot M_{{}_{RBG}}^2\right)\right]\cdot C\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

,

accordingly, in this case, $$R=N_{\mathrm{int}\text{A.}erleaver}/C=\left[N_{DVRB}/\left(C\cdot M_{{}_{RBG}}^2\right)\right]\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2.$$

The number of zeros added to the interleaver is as follows. In the absence of multiplicity,

N _null = N _interleaver -N _DVRB = [N _DVRB / C] · CN _DVRB .

Under the condition of multiplicity C · M _RBG ,

N _null = N _interleaver -N _DVRB = [N _DVRB / (C · M _RBG )] · C · M _RBG -N _DVRB .

,Subject to multiplicity $$C\cdot M_{{}_{\mathrm{<figure-callout\; id="2"\; label="R\; B\; G"\; filenames="00000070.png,00000071.png"\; state="\{\{state\}\}">R\; </figure-callout>}BG}}^2$$

,

$$N_{null}=N_{\mathrm{int}\text{A.}erleaver}-N_{DVRB}=\left[N_{DVRB}/\left(C\cdot M_{{}_{RBG}}^2\right)\right]\cdot C\cdot M_{{}_{RBG}}^2-N_{DVRB}.$$

The examples of embodiments of the present invention described above are combinations of elements and functions of the present invention. Elements or functions may be considered selected unless otherwise indicated. Each element or function can be implemented without being combined with other elements or functions. Moreover, embodiments of the present invention can be constructed by combinations of parts of elements and / or functions. The order of operations described in the embodiments of the present invention may be changed. Some structures of any embodiment may be included in another embodiment and may be replaced by corresponding structures of another embodiment of the invention. Obviously, the present invention can be carried out by a combination of claims that do not have an explicit connection with the attached claims or may include new claims, as amended after filing.

Embodiments of the present invention can be achieved by various means, for example, hardware, firmware, software, or a combination thereof. In a hardware configuration, embodiments of the present invention may be implemented through one or more specialized integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), user programmable gate arrays (FPGAs) processors, controllers, microcontrollers, microprocessors, etc.

In a firmware or software configuration, embodiments of the present invention may be provided with blocks, procedure, function, etc., performing the above functions or operations. Computer programs may 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 the processor and receive data from the processor through various known means.

Industrial applicability

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

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

Claims (22)

1. A method for transmitting downstream data using resource blocks in a base station in a wireless mobile communication system, comprising:
transmitting downlink data mapped to physical resource blocks (PRB) to the user equipment,
while the virtual resource block indices (VRB) are mapped to the physical resource block indices (PRB) for the first slot and the second subframe slot, while the physical resource block indices (PRB) for the second slot are offset relative to the physical resource block indices (PRB) for the first slot based on a predefined gap,
wherein a predetermined offset is applied to the index of a physical resource block (PRB) when the index of this physical resource block (PRB) is equal to or greater than a predetermined threshold value. 2. The method according to claim 1, in which
a predetermined threshold value is N _VRB / 2,
where N _VRB is the number of consecutive virtual resource block (VRB) indices. 3. The method according to claim 2, in which a predetermined offset is set as
N _{gap.-N VRB} / 2,
where N _gap . represents the value of a predefined space. 4. The method according to claim 3, in which N _{VRB is} set as
N _VRB = 2 · min (N _gap ., N _PRB -N _gap ),
where N _PRB is equal to the number of physical resource blocks (PRB). 5. The method according to claim 4, in which sequential indexes of virtual resource blocks (VRB) are interleaved in such a way that the indexes of virtual resource blocks (VRB) write row by row into a rectangular matrix and read column by column, and the number of rows R is rectangular matrices specify how
R = [N _DVRB / (C · M _RBG )] · M _RBG,
where C equals the number of columns of a rectangular matrix, a M _RBG is the number of consecutive physical resource blocks (PRB), which constitute the resource block group (RBG). 6. The method according to claim 5, in which C is 4. 7. The method according to 5, in which the rectangular matrix includes N _D groups, wherein C is K · N _D , while when N _null zeros are added to the rectangular matrix, zeros are added to the last N _null / N _D rows of K- column in each of the N _D groups of the rectangular matrix, while zeros are ignored when the index of virtual resource blocks (VRB) is read from the rectangular matrix,
moreover, N _null = [N _VRB / (C · M _RBG )] · C · M _RBG -N _VRB . = C · RN _VRB . 8. The method according to claim 7, in which K is 2 and N _D is 2. 9. The method according to claim 7, in which the index p _{1, d of} one of the physical resource blocks (PRB) for the first slot displayed on the index d of one of the virtual resource blocks (VRB) is set as

in cases where

,
And How

in cases where

;
wherein the index p _{2, d of} one of the physical resource blocks (PRB) for the second slot displayed on the index d of one of the virtual resource blocks (VRB) is set as
P _{2, d} = (p _{1, d} + N _VRB / 2) mod N _VRB. 10. The method according to claim 9, in which the index O _{i, d of} one of the physical resource blocks (PRB) for the i-th slot (i = 1, 2) displayed on the index d of one of the virtual resource blocks (VRB) is set as

11. A method for receiving downstream data using resource blocks in user equipment in a wireless mobile communication system, comprising
receiving downlink control information from the base station including resource allocation information for downlink data; and
receiving downlink data mapped to physical resource blocks (PRBs) based on this downlink control information,
wherein the resource allocation information indicates a virtual resource block (VRB) allocation for user equipment,
while the indices of physical resource blocks (PRB) onto which the downlink data is displayed are determined based on the relationship of the mapping between virtual resource blocks (VRB) and physical resource blocks (PRB),
wherein the mapping relationship is set in such a way that the virtual resource block indices (VRB) are mapped to the physical resource block indices (PRB) for the first slot and the second subframe slot, while the physical resource block indices (PRB) for the second slot are offset relative to the physical resource indices blocks (PRB) for the first slot based on a predetermined space,
wherein a predetermined offset is applied to the index of a physical resource block (PRB) when the index of this physical resource block (PRB) is equal to or greater than a predetermined threshold value. 12. The method according to claim 11, in which the predetermined threshold value is N _VRB / 2, where N _VRB is the number of consecutive indexes of virtual resource blocks (VRB). 13. The method according to item 12, in which a predetermined offset is set as
N _{gap.-N VRB} / 2,
where N _gap . represents the value of a predefined space. 14. The method according to item 13, in which consecutive indexes of virtual resource blocks (VRB) are interleaved, and the number of consecutive indices of virtual resource blocks (VRB) -N _{VRB is} set as
N _VRB = 2 · min (N _gar ., N _PRB -N _gap ),
where N _gap . represents the value of a predetermined space, and N _PRB is equal to the number of physical resource blocks (PRB). 15. The method according to 14, in which consecutive indexes of virtual resource blocks (VRB) are interleaved in such a way that the indexes of virtual resource blocks (VRB) write row by row in a rectangular matrix and read column by column, and the number of rows R is rectangular matrices specify how
R = [N _DVRB / (C · M _RBG )] · M _RBG ,
where C equals the number of columns of a rectangular matrix, a M _RBG is the number of consecutive physical resource blocks (PRB), which constitute the resource block group (RBG). 16. The method according to clause 15, in which C is 4. 17. The method of claim 15, wherein the rectangular matrix includes N _D groups, wherein C is K · N _D , and when N _null zeros are added to the rectangular matrix, zeros are added to the last N _null / N _D rows Of the nth column in each of the N _D groups of the rectangular matrix, while zeros are ignored when the index of virtual resource blocks (VRB) is read from the rectangular matrix,
moreover, N _null = [N _VRB / (C · M _RBG )] · C · M _RBG -N _VRB . = C · RN _VRB . 18. The method according to 17, in which K is 2 and N _D is 2. 19. The method according to 17, in which the index p _{1, d of} one of the physical resource blocks (PRB) for the first slot displayed on the index d of one of the virtual resource blocks (VRB), is set as

in cases where

And How

in cases where

;
the index p _{2, d of} one of the physical resource blocks (PRB) for the second slot displayed on the index d of one of the virtual resource blocks (VRB) is set as
P _{2, d} = (p _{1, d} + N _VRB / 2) modN _VRB. 20. The method according to claim 19, in which the index O _{i, d of} one of the physical resource blocks (PRB) for the i-th slot (i = 1, 2) displayed on the index d of one of the virtual resource blocks (VRB) is set as

21. A base station transmitting downlink data using resource blocks in a wireless mobile communication system, comprising:
a processor for controlling the operation of the base station; and
processor controlled memory unit
wherein the processor is configured to transmit downlink data mapped to physical resource blocks (PRBs) to the user equipment,
while the virtual resource block indices (VRB) are mapped to the physical resource block indices (PRB) for the first slot and the second subframe slot, and the physical resource block indices (PRB) for the second slot are offset relative to the physical resource block indices (PRB) for the first slots based on a predefined space, and
wherein a predetermined offset is applied to the index of physical resource blocks (PRB) equal to or greater than a predetermined threshold value. 22. User equipment for receiving downstream data using resource blocks in a wireless mobile communication system, comprising:
a processor for controlling user equipment and a processor-controlled memory unit,
wherein the processor is configured to receive downlink control information from the base station, including resource allocation information for transmitting downlink data, and to receive downlink data mapped to physical resource blocks (PRB) based on the downlink control information ,
wherein the resource allocation information indicates a virtual resource block (VRB) allocation for user equipment,
while the indices of virtual resource blocks (VRB) onto which the downlink data is mapped are determined based on a mapping relationship between the virtual resource blocks (VRB) and the physical resource blocks (PRB),
wherein the mapping relationship is set in such a way that the virtual resource block (VRB) indices are mapped to the physical resource block (PRB) indices for the first slot and the second subframe slot, while the physical resource block indices (PRB) for the second slot are offset relative to the physical resource indices blocks (PRBs) for a second slot based on a predetermined space, and
wherein a predetermined offset is applied to the index of the physical resource block (PRB) when the index of this physical resource block (PRB) is equal to or greater than a predetermined threshold value.

Images