JP6552553B2 - Scheduling method for distributed virtual resource block - Google Patents

Description

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

  In the cellular OFDM wireless packet communication system, uplink / downlink data packet transmission is performed in units of subframes, and one subframe is defined by a certain time interval including a plurality of OFDM symbols.

  3GPP (Third Generation Partnership Project) supports a type 1 radio frame structure applicable to FDD (Frequency Division Duplex) and a type 2 radio frame structure applicable to TDD (Time Division Duplex). FIG. 1 shows the structure of a type 1 radio frame. A type 1 radio frame is composed of ten subframes, and one subframe is composed of two slots. FIG. 2 shows the structure of a type 2 radio frame. A type 2 radio frame is composed of two half frames, each half frame having five subframes, DwPTS (Downlink Piloting Time Slot), GP (Gap Period), and UpPTS (Uplink Piloting Time Slot). And one subframe is composed of two slots. That is, regardless of the type of radio frame, one subframe is made up of two slots.

  The signal transmitted in each slot is

Subcarriers (Subcarriers) and

Can be represented by a resource grid composed of OFDM symbols (Symbol) of here,

Indicates the number of resource blocks (RBs) in downlink,

Indicates the number of subcarriers constituting one RB,

Indicates the number of OFDM symbols in one downlink slot. This resource lattice structure is shown in FIG.

  An RB is used to represent a mapping relationship between a certain physical channel and a resource element. RBs can be classified into physical resource blocks (PRBs) and virtual resource blocks (VRBs). The mapping relationship between VRBs and PRBs can be expressed in units of one subframe. More specifically, it can be expressed in units of slots constituting one subframe. The mapping relationship between the VRB and the PRB can be expressed using the mapping relationship between the VRB index and the PRB index. A specific description of this will be further described later in the examples of the present invention.

  PRB in the time domain

Consecutive OFDM symbols in the frequency domain

Defined by consecutive subcarriers. Therefore, one PRB is

Composed of resource elements of PRB from 0 in the frequency domain

The numbers up to are assigned.

  The VRBs can have the same size as the PRBs. Two types of VRBs are defined, one type being Localized Type and the other type being Distributed Type. For each type of VRB, a pair of VRBs have a single VRB index (hereinafter also referred to as a VRB number (Number)) and are allocated over two slots in one subframe. In other words, of the two slots that make up a subframe, it belongs to the first slot.

Each of the VRBs from 0

Any one of the indexes up to is assigned and belongs to the second slot of the two slots

Similarly for each VRB from 0

Any one of the indices is assigned.

  The index of the VRB corresponding to the specific virtual frequency band of the first slot has the same value as the index of the VRB corresponding to the specific virtual frequency band of the second slot. That is, the VRB corresponding to the i-th virtual frequency band of the first slot is described as VRB1 (i), the VRB corresponding to the j-th virtual frequency band of the second slot is described as VRB2 (j), and VRB1 If the index numbers of i) and VRB2 (j) are expressed as index (VRB1 (i)) and index (VRB2 (j)), respectively, the relationship of index (VRB1 (k)) = index (VRB2 (k)) is established. (See FIG. 4a).

  Similarly, the index of the PRB corresponding to the specific frequency band of the first slot has the same value as the index of the PRB corresponding to the specific frequency band of the second slot. That is, PRB corresponding to the i-th frequency band of the first slot is denoted as PRB1 (i), PRB corresponding to the j-th frequency band of the second slot is denoted as PRB2 (j), PRB1 (j) If the index numbers of and PRB2 (j) are expressed as index (PRB1 (i)) and index (PRB2 (j)), respectively, the relationship of index (PRB1 (k)) = index (PRB2 (k)) holds See Figure 4b).

  Of the plurality of VRBs described above, some may be assigned as local and some may be assigned as distributed. Hereinafter, a VRB assigned as a local type is referred to as a local VRB (Localized Virtual Resource Block; LVRB), and a VRB assigned as a distributed type is referred to as a distributed VRB (Distributed Virtual Resource Block);

  LVRBs (local type VRBs, localized VRBs) are directly mapped to PRBs, and LVRB indexes correspond to PRB indexes. The LVRB with index i corresponds to the PRB with index i. That is, LVRB1 having index i corresponds to PRB1 having index i, and LVRB2 having index i corresponds to PRB2 having index i (see FIG. 5). In this case, it is assumed that all VRBs in FIG. 5 are assigned as LVRBs.

  DVRBs (distributed VRBs) may not be mapped directly to PRBs. That is, the DVRB index may be mapped to the PRB after going through a series of processes.

  First, a continuous index sequence of the DVRB can be changed in order by a block interleaver. Here, the continuous index sequence means an index number starting from 0 and sequentially increasing while increasing by one. The index sequence output from the interleaver is sequentially mapped to the continuous index sequence of PRB1 (see FIG. 6). Assume that all VRBs in FIG. 6 are assigned as DVRBs. Subsequently, the index sequence output from the interleaver is cyclically shifted (Cyclic Shift) by a predetermined number, and the cyclically shifted index sequence is sequentially mapped to the continuous index sequence of PRB 2 (see FIG. 7). Assume that all VRBs in FIG. 7 are allocated as DVRBs. In this way, PRB index and DVRB index can be mapped over two slots.

  In this process, continuous index sequences of DVRBs not passing through the interleaver may be sequentially mapped to continuous index sequences of PRB1. Alternatively, the continuous index sequence of DVRBs not passing through the interleaver may be cyclically shifted by a predetermined number, and the cyclically shifted index sequence may be sequentially mapped to the continuous index sequence of PRB2.

  According to the above process of mapping DVRB to PRB, PRB1 (i) and PRB2 (i) having the same index i are mapped to DVRB1 (m) and DVRB2 (n) having different indexes m and n. be able to. For example, referring to FIGS. 6 and 7, PRB1 (1) and PRB2 (1) are mapped to DVRB1 (6) and DVRB2 (9) having different indexes, respectively. The frequency diversity effect can be obtained by the DVRB mapping method.

  As shown in FIG. 8, when VRB (1) is assigned as DVRB among VRBs, VRB is still assigned to PRB2 (6) and PRB1 (9) when using the method according to FIG. 6 and FIG. Although it is not in the state, LVRB can not be assigned to this PRB2 (6) and PRB1 (9). Because, according to the above-described LVRB mapping method, LVRB is mapped to PRB2 (6) and PRB1 (9), that LVRB is also mapped to PRB1 (6) and PRB2 (9). This means that PRB1 (6) and PRB2 (9) are already mapped by VRB1 (1) and VRB2 (1) described above. Therefore, it can be understood that the mapping result of the DVRB may limit the mapping of the LVRB. Therefore, it is necessary to determine the mapping rule of DVRB in consideration of the mapping of LVRB.

  In a broadband wireless mobile communication system using multiple carriers, radio resources can be allocated to each terminal in an LVRB and / or DVRB scheme. This allocation information can be transmitted in the form of a bitmap. At this time, allocation of radio resources to each terminal can be performed in units of one RB. In this case, resources can be allocated with a granularity of '1' RB (Granularity of '1' RB), but a lot of bit overhead is required to transmit the allocation information in a bitmap format. Unlike this, it is possible to define an RBG (RB Group) consisting of PRbs of continuous k indexes, and allocate resources with 1 RBG granularity ('Granularity of' 1 'RBG), but in this case, RB Although the allocation can not be elaborated, it has the advantage of reducing bit overhead. At this time, for example, k = 3.

  In this case, LVRB can be mapped to PRB in RBG units. For example, a PRB having three consecutive indexes, that is, PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1), and PRB2 (i + 2) have one RBG. LVRBs can be mapped to this RBG in units of RBG. However, if one or more of PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1), and PRB2 (i + 2) are pre-mapped by DVRB, this RBG is It can not map to LVRB in RBG unit. That is, DVRB mapping rules may limit the mapping of LVRBs in RBG units.

  As described above, since the DVRB mapping rule affects the LVRB mapping, it is necessary to define the DVRB mapping rule in consideration of the LVRB mapping.

  An object of the present invention is to provide a resource scheduling method for efficiently combining FSS scheduling and FDS scheduling.

In order to achieve the above object, in one aspect of the present invention, one RBG consisting of consecutive physical resource blocks is continuously allocated in a wireless mobile communication system supporting a resource allocation scheme represented by one bit. The resource block mapping method for distributing and mapping the virtual resource blocks to physical resource blocks is determined from the index number where the virtual resource block starts and the resource indication value (RIV) indicating the length of the virtual resource block. Performing interleaving for the index of the virtual resource block using the block interleaver, and setting the interleaving index above the first slot of one subframe configured of the first slot and the second slot. The indexes of the physical resource block are sequentially mapped to the index of the physical resource block, and the interleaved index is cyclically shifted by the size of the gap (Gap) for the distribution on the second slot. And the step of sequentially mapping, and the size of the gap (Gap) is a multiple of the square of the number of continuous physical resource blocks (M _RBG ) constituting the _RBG .

Preferably, when the block interleaver degree (Degree) is defined as the number C of block interleavers C = 4, the number R of block interleavers R is expressed by Equation 1. The number N _{null of} Nulls to be given and embedded in the block interleaver is given by Equation 2.

Here, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and _NDVRB represents the number of virtual resource blocks allocated in a distributed manner.

Here, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and _NDVRB represents the number of virtual resource blocks allocated in a distributed manner.

Preferably, the order (Degree) of the block interleaver is the same as the diversity order (Diversity Order, N _DivOrder ) determined by the variance.

Preferably, when the index d of the virtual resource block allocated in a distributed manner is given, the index p _{1, d} of the physical resource block on the first slot mapped to _{the d} is given by Equation 3. The index p _{2, d} of the physical resource block on the second slot mapped to _d is given by Equation 4. Here, R represents the number of rows (Row) of the block interleaver, C represents the number of columns (Column) of the block interleaver, and _NDVRB is used as a distributed virtual resource block. Represents the number of resource blocks (Number of RBs used for DVRB), N _null represents the number of nulls embedded in the block interleaver, and mod represents a modulo operation.

  Here, C may be the same as the degree of the block interleaver (Degree).

When p1 _{, d} is larger than N _DVRB / 2 _, the value of p _{1, d} is p _{1, d} + N _PRB- N _DVRB , and when p _{2, d} is larger than N _DVRB / 2. the _value of _{p 2, d is} a _{p 2, d + N PRB -N} DVRB. Here, N _PRB represents the number of physical resource blocks in the system.

Preferably, the step of performing the interleaving when the number of virtual resource blocks (N _DVRB ) is not an integral multiple of the degree of the block interleaver (Degree of block interleaver) Is divided into groups of the number (N _D ) of physical resource blocks to be mapped, and nulls are uniformly distributed in each of the divided groups.

  Preferably, when the order of the block interleaver is the number of rows (Row) of the block interleaver, the respective groups correspond to the respective rows, and the order of the block interleaver is the block interleaver. In the case of the number of columns of the leaver, the respective groups correspond to the respective columns.

In another aspect of the present invention, a continuously allocated virtual resource block is a physical resource in a wireless mobile communication system supporting a resource allocation method in which one RBG composed of consecutive physical resource blocks is represented by one bit. A resource block mapping method for mapping in a distributed manner is performed by interleaving the index of the virtual resource block determined from the index number where the virtual resource block starts and the resource indication value (RIV) indicating the length of the virtual resource block. And using a block interleaver, and the interleaved index on the first slot of one subframe composed of a first slot and a second slot. The index is sequentially mapped to the index, and the interleaved index is cyclically shifted by the size of the gap (Gap) for the distribution on the second slot, sequentially to the index of the physical resource block. The gap Nap for the dispersion N _gap is given by Equation (5).

However, _MRBG represents the number of continuous physical resource blocks constituting the RBG, and N _PRB represents the number of physical resource blocks of the system.

Preferably, when nulls are allowed to be input to the block interleaver, the number of distributed virtual resource blocks (N _DVRB ) is given by Equation 6.

Preferably, when the index d of the distributed distributed virtual resource blocks is given, the index p _{1, d} of the physical resource block on the first slot mapped to _{the d} is more than N _DVRB / 2. If it is larger _, the value of p _{1, d} is p _{1, d} + N _PRB -N _DVRB , and the index p _{2, d} of the physical resource block on the second slot mapped to _{the d} is N _DVRB / If it is greater than _2, the value of p _{2, d} is p _{1, d} + N _PRB −N _DVRB , where N _DVRB is the number of resource blocks used for virtual resource blocks that are distributed and allocated. (Number of RBs used for DVRB).

In another aspect of the present invention, a continuously allocated virtual resource block is a physical resource in a wireless mobile communication system supporting a resource allocation method in which one RBG composed of consecutive physical resource blocks is represented by one bit. A resource block mapping method for distributedly mapping to blocks detects an index number where the virtual resource block starts and a resource indication value (RIV) representing the length of the virtual resource block, and detects the resource indication value from the detected resource indication value. A step of determining an index of the virtual resource block, and interleaving with respect to the determined index of the virtual resource block using a block interleaver, distributing the virtual resource block to physical resource blocks and mapping. Includes a mapping step of graying, and the block interleaver of degree (Degree) is the same as the diversity order determined by the distribution (Diversity _{Order, N DivOrder).}

In another aspect of the present invention, in a wireless mobile communication system supporting a resource allocation scheme in which one RBG composed of consecutive physical resource blocks is represented by one bit, the continuously allocated virtual resource blocks are represented as physical resources. A resource block mapping method for distributing and mapping blocks includes determining an index of the virtual resource block from an index number at which the virtual resource block starts and a resource indication value (RIV) indicating the length of the virtual resource block; A mapping step of performing interleaving on the determined index of the virtual resource block using a block interleaver and distributing and mapping the virtual resource block to the physical resource block. When the number of the virtual resource blocks _{(N DVRB)} is not an integer multiple of the degree of the block interleaver (Degree of block interleaver), physical mapping described above stage, the interleaver, which one virtual resource block is mapped And _D. Divide into groups of the number of resource blocks (N _D ), and evenly distribute nulls among the divided groups.

  Preferably, when the order of the block interleaver is the number of rows (Row) of the block interleaver, the respective groups correspond to the respective rows, and the order of the block interleaver is the block interleaver. In the case of the number of columns of the leaver, the respective groups correspond to the respective columns.

  Preferably, the control information is DCI transmitted through PDCCH.

  Preferably, the size of the gap is a function of system bandwidth.

Preferably, when the index p of the physical resource block is given, the interleaved index d _p1 mapped to the p is given by Equation 7 or Equation 8, and the cyclic shift mapped to the p The index d _p2 is given by Equation 9 or Equation 10. However, R represents the number of rows (Row) of the block interleaver, C represents the number of columns (Column) of the block interleaver, and _NDVRB is used for distributed virtual resource blocks. Represents the number of resource blocks to be processed, and mod means a modulo operation.

Preferably, the diversity order (N _DivOrder ) is an integer multiple of the number (N _D ) of physical resource blocks to which one virtual resource block is mapped.

Preferably, when the number of virtual resource blocks is equal to or greater than a predetermined critical value (M _th ), the size of the gap is zero.

  Preferably, the resource block mapping method further includes receiving information related to the gap size, and the gap size is determined based on the received gap size information.

  In another aspect of the present invention, a resource block mapping method for distributing and mapping continuously allocated virtual resource blocks to physical resource blocks in a wireless mobile communication system supporting an RBG resource allocation method and a subset resource allocation method is provided. Receiving a control information including resource block allocation information indicating that the virtual resource blocks are allocated in a distributed manner and an index of the virtual resource block; and an index of the virtual resource block using a block interleaver In the interleaving, the interleaving is performed in the physical resource block in which the index of the virtual resource block belongs to any one of a plurality of RBG subsets. Until the operation is to be all mapped completed the index includes an index of the virtual resource blocks is performed so as not to be mapped to the index of the physical resource blocks belonging to other subsets, the interleaving execution stage, the.

  Preferably, the resource block mapping method sequentially maps the interleaved index to the index of the physical resource block on the first slot of one subframe including a first slot and a second slot. And sequentially mapping an index obtained by cyclically shifting the interleaved index by the size of the gap (Gap) on the second slot, to the index of the physical resource block. The size of the gap (Gap) is determined such that the virtual resource block mapped on the first slot and the virtual resource block mapped on the second slot are included in the same subset. .

Preferably, the number (N _DVRB ) of the virtual resource blocks is an integer multiple of the diversity order (N _DivOrder ) determined by the distribution.

Preferably, the number of virtual resource blocks (N _DVRB ) is an integer multiple of the number of consecutive physical resource blocks (M _RBG ) constituting the _RBG .

Preferably, the number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks to which one virtual resource block is mapped to the number of continuous physical resource blocks (M _RBG ) configuring the _RBG (N _D ) Multiplied by an integer.

Preferably, the number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks to which one virtual resource block is mapped in the square of the number of continuous physical resource blocks constituting the _RBG (M _RBG ² ). (N _D) is an integer multiple of a value obtained by multiplying the.

Preferably, the number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks to which one virtual resource block is mapped to the number of continuous physical resource blocks (M _RBG ) configuring the _RBG (N _D ) And a common multiple of the degree (D) of the block interleaver.

Preferably, the order (D) of the block interleaver is an integral multiple of the number (N _D ) of physical resource blocks to which one virtual resource block is mapped.

Preferably, the number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks to which one virtual resource block is mapped (N _D ), and the number of consecutive physical resource blocks constituting the RBG is a square (M It is a common multiple of the value multiplied by _RBG ² ) and the order (D) of the block interleaver.

Preferably, the order (D) of the block interleaver is an integral multiple of the number (N _D ) of physical resource blocks to which one virtual resource block is mapped.

Preferably, the number of virtual resource blocks (N _DVRB ) is a value obtained by multiplying the order (D) of the block interleaver by the square of the number of consecutive physical resource blocks constituting the _RBG (M _RBG ² ). It is an integer multiple.

Preferably, the number of virtual resource blocks (N _DVRB ) is obtained by multiplying the degree (D) of the block interleaver by the square of the number of consecutive physical resource blocks constituting the _RBG (M _RBG ² ), and It is a common multiple of a value obtained by multiplying the number (N _D ) of physical resource blocks to which one virtual resource block is mapped by the square (M _RBG ² ) of the number of consecutive physical resource blocks constituting the _RBG .

Preferably, the order (D) of the block interleaver is an integral multiple of the number (N _D ) of physical resource blocks to which one virtual resource block is mapped.

Any of the various aspects of the present invention described above can be applied to base stations and / or mobile stations. When each aspect of the present invention described above is applied to a mobile station, the resource block mapping method is performed before the step of interleaving or the step of determining the index of the virtual resource block from the mobile station of the wireless mobile communication system. The method may further include receiving a resource indication value (RIV).
For example, the present invention provides the following.
(Item 1)
In a radio mobile communication system, a resource block mapping method for distributing and mapping continuously allocated virtual resource blocks to physical resource blocks,
Interleaving the virtual resource block index using a block interleaver;
Sequentially mapping the interleaved index on the first slot and the second slot on one subframe together with a gap for dispersion;
Including
When the index d of the physical resource block on the first slot mapped to _{the d} is larger than N _DVRB / 2, when the index d of the virtual resource block to be distributed and allocated is given. _the value of _{p 1, d} will _{become p 1, d + N PRB -N} DVRB, index _{p 2, d} of the physical resource blocks on the second slot mapped to the index d is than _{N DVRB} / 2 Is larger _, the value of p _{2, d} is p _{1, d} + N _PRB −N _DVRB , where N _DVRB is the number of resource blocks used for distributed virtual resource blocks (number of of A resource block mapping method representing RBs used for DVRB).
(Item 2)
The resource block mapping method according to Item 1, wherein the index p _{1, d} is given by Equation 1 and the index p _{2, d} is given by Equation 2.


Here, R represents the number of rows of the block interleaver, C represents the number of columns of the block interleaver, and _NDVRB is a resource used for virtual resource blocks allocated in a distributed manner. It represents the number of blocks (RBs used for DVRB), and mod means modular arithmetic.
(Item 3)
The radio mobile communication system supports a resource allocation method in which one resource block group (RBG) including physical resource blocks is represented by one bit, and the gap is a continuous sequence of the RBG. The resource block mapping method according to item 1, wherein the resource block mapping method is a multiple of the square of the number of physical resource blocks (M _RBG ² ).
(Item 4)
The wireless mobile communication system supports a resource allocation scheme in which one resource block group (RBG) including physical resource blocks is represented by one bit,
The resource block mapping method according to Item 1, wherein the size N _gap of the gap (Gap) for the distribution is given by Equation 1.

Where M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and N _PRB represents the number of physical resource blocks in the system.
(Item 5)
The resource block mapping method according to Item 1, wherein a degree (Degree) of the block interleaver is the same as a diversity order (N _DivOrder ) determined by the distribution.
(Item 6)
The radio mobile communication system supports a resource allocation method in which one resource block group (RBG) including physical resource blocks is represented by one bit,
The number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks to which one virtual resource block is mapped in the square of the number of continuous physical resource blocks constituting the _RBG (M _RBG ² ) (N _D The resource block mapping method according to Item 1, wherein the resource block mapping method is an integer multiple of a value multiplied by.
(Item 7)
The wireless mobile communication system supports a resource allocation scheme in which one resource block group (RBG) including physical resource blocks is represented by one bit,
When the order of the block interleaver is defined as the number C of the block interleaver C = 4, the number R of the block interleaver R is given by Equation 1, and the block interleaver the number _{N null} null (null) to be filled in Lieber is given by equation 2, the resource block mapping method of claim 1.


Here, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and _NDVRB represents the number of virtual resource blocks allocated in a distributed manner.
(Item 8)
The resource block mapping method according to Item 7, wherein the number of distributed virtual resource blocks (N _DVRB ), which is distributed and allocated, is allowed when the block interleaver is allowed to receive a null. .

(Item 9)
_6. The resource block mapping method according to item 5, wherein the diversity order (N _DivOrder ) is an integral multiple of the number of physical resource blocks (N _D ) to which one virtual resource block is mapped.
(Item 10)
The method further includes receiving a Resource Indication Value (RIV) at a mobile terminal of the wireless mobile communication system,
The resource indication value is used to determine an index of the virtual resource block and to indicate an index number at which the virtual resource block starts and a length of the virtual resource block, according to any one of items 1 to 9. Resource block mapping method.
(Item 11)
The resource block mapping according to any one of items 1 to 9, wherein the size of the gap is 0 when the number of virtual resource blocks is equal to or greater than a predetermined critical value (M _th ). Method.
(Item 12)
_10. The resource block mapping method according to any one of items 1 to 9, wherein the number of virtual resource blocks (N _DVRB ) is a multiple of the diversity order (N _DivOrder ) determined by distribution.

  According to the present invention, the scheduling information transmission method can be easily realized by effectively combining the FSS scheduling and the FDS scheduling.

The accompanying drawings, which are included as part of the detailed description to assist in understanding the present invention, provide examples of the present invention and together with the detailed description, explain the technical idea of the present invention.
It is a figure which shows an example of the radio | wireless frame structure applicable to FDD. It is a figure which shows an example of the structure of the radio | wireless frame applicable to TDD. It is a figure which shows an example of the resource grid structure (Resource Grid structure) which comprises the transmission slot (transmission slot) of 3GPP. FIG. 4a is a diagram illustrating an example of the structure of a virtual resource block in one subframe. FIG. 4b is a diagram illustrating an example of the structure of a PRB in one subframe. It is a figure which shows an example of the method by which LVRB is mapped by PRB. FIG. 7 is a diagram illustrating an example of a method in which DVRBs in the first slot are mapped to PRBs. It is a figure which shows an example of the method by which DVRB in a 2nd slot is mapped by PRB. It is a figure which shows an example of the method by which DVRB is mapped by PRB. FIG. 7 is a diagram illustrating an example of a method in which DVRBs and LVRBs are mapped to PRBs. It is a figure which shows an example of the method of allocating a resource block by a compact system. FIG. 7 is a diagram illustrating an example of a method in which two DVRBs having consecutive indexes are mapped to a plurality of adjacent PRBs. FIG. 7 is a diagram illustrating an example of a method in which two DVRBs having consecutive indexes are mapped to a plurality of disjointed PRBs. FIG. 5 is a diagram illustrating an example of a method in which four DVRBs having consecutive indexes are mapped to a plurality of disjointed PRBs. FIG. 7 is a diagram illustrating an example of a resource block mapping method when setting Gap = 0 according to an embodiment of the present invention. It is a figure explaining a bitmap structure. It is a figure which shows an example of the method of mapping combining a bitmap system and a compact system. FIG. 6 is a diagram illustrating a DVRB mapping method according to an embodiment of the present invention. FIG. 6 is a diagram illustrating a DVRB mapping method according to an embodiment of the present invention. It is a figure which shows an example of the method of interleaving the index of DVRB. It is a figure which shows the operation | movement of a general interleaver when the number of the resource blocks used for interleaving is not an integral multiple of a diversity order (diversity order). FIG. 6 is a diagram illustrating a method of inserting nulls when the number of resource blocks used for interleaving is not an integer multiple of the diversity order according to an embodiment of the present invention. FIG. 6 is a diagram illustrating a method of mapping an interleaved DVRB index with a value of Gap = 0 according to an embodiment of the present invention. FIG. 10 is a diagram illustrating an example of a method for mapping DVRB indexes using different gap values for each terminal according to an embodiment of the present invention; It is a figure for demonstrating the relationship between a DVRB index and a PRB index. FIG. 25a is a diagram for explaining the relationship between the DVRB index and the PRB index. FIG. 25b is a diagram illustrating a general method for filling the interleaver with nulls. FIGS. 25c and 25 are diagrams illustrating a method of padding the interleaver with nulls according to one embodiment of the present invention. It is a figure which shows an example of the method of using the bit map method which uses a RBG system and a subset system, and a compact system in combination. It is a figure which shows an example of the method of using the bit map method which uses a RBG system and a subset system, and a compact system in combination. According to an embodiment of the present invention, the number of DVRBs is multiplied by the number of physical resource blocks (N _D ) to which one virtual resource block is mapped, and the number of consecutive physical resource blocks (M _RBG ) constituting the _RBG. This is an example of setting a multiple of the value. FIG. 29 is an example of interleaving DVRB indexes in the method according to FIG. 28. FIG. FIG. 7 is a diagram illustrating an example in which a block interleaver degree is set to a block interleaver column number C and C is set to a diversity order according to an embodiment of the present invention. FIG. 7 is a diagram illustrating an example of a mapping method when the number of PRBs and the number of DVRBs are different according to an embodiment of the present invention. FIG. 6 is a diagram illustrating an example of a mapping method capable of maximizing the number of DVRBs with a given gap according to an embodiment of the present invention. FIG. 6 is a diagram illustrating an example of a mapping method capable of maximizing the number of DVRBs with a given gap according to an embodiment of the present invention.

  Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the attached drawings. The detailed description disclosed below in connection with the appended drawings is intended as a description of exemplary embodiments of the invention and is not intended to represent the only embodiments in which the invention may be practiced. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, it will be understood by those skilled in the art that the present invention may be practiced without such specific details. For example, in the following description, description will be made centering on certain terms, but it is not necessary to be limited to these terms, and the same meaning can be expressed even when referred to as arbitrary terms. The same or similar components throughout the present specification will be described with the same reference numerals.

  When the subframe is composed of the first slot and the second slot, as described above, the index (PRB1 (i)) represents the PRB index of the i-th frequency band of the first slot, and the index (PRB2 (j) Represents the index of the PRB in the j-th frequency band of the second slot, and the relationship of index (PRB1 (k)) = index (PRB2 (k)) is established. Also, index (VRB1 (i)) represents the VRB index of the i-th virtual frequency band of the first slot, and index (VRB2 (j)) is the VRB of the j-th virtual frequency band of the second slot It represents an index, and the relationship of index (VRB1 (k)) = index (VRB2 (k)) is established. At this time, VRB1 is mapped to PRB1, and VRB2 is mapped to PRB2. VRB is classified into DVRB and LVRB.

  The rule in which LVRB1 is mapped to PRB1 and the rule in which LVRB2 is mapped to PRB2 are identical. However, the rule in which DVRB1 is mapped to PRB1 is different from the rule in which DVRB2 is mapped to PRB2. That is, DVRB is “divided” and mapped to PRB.

In 3GPP, one RB is defined for each slot. However, the detailed description of the present invention, to define the RB in units of one subframe, are generalized and described that the DVRB mapping rules and this RB is divided on the time axis into N _D sub RB . For example, in the case of N _D = 2, a PRB defined in one subframe unit is divided into a first sub PRB and a second sub PRB, and a VRB defined in one subframe unit is It is divided into a sub VRB and a second sub VRB.

  In this case, the first sub PRB corresponds to the above-described PRB1, and the second sub PRB corresponds to the above-described PRB2. The first sub VRB corresponds to the above-described VRB1, and the second sub VRB corresponds to the above-described VRB2. Also, in any of the detailed description of the present invention and in 3GPP, the mapping rule of DVRB for obtaining frequency effect is described based on one subframe. Therefore, it is understood that any of the embodiments of the detailed description of the present invention is a concept including an RB mapping method in 3GPP.

Hereinafter, terms used in the detailed description of this application are defined as follows.
'RE (Resource Element)' represents the smallest frequency-time unit to which data or other control channel modulation symbols are mapped. If a signal is transmitted through M subcarriers in one OFDM symbol and N OFDM symbols are transmitted in one subframe, there are M × N REs in one subframe.
'PRB (Physical Resource Block)' represents a unit frequency-time resource for transmitting data. In general, one PRB is composed of a plurality of consecutive REs in the frequency-time domain, and a plurality of PRBs are defined in one subframe.

  'VRB (Virtual Resource Block)' represents a virtual unit resource for data transmission. In general, the number of REs included in one VRB is the same as the number of REs included in one PRB, and when data is actually transmitted, one VRB is mapped to one PRB, or One VRB can be mapped to a partial region of a plurality of PRBs.

'LVRB (Localized Virtual Resource Block)' is a type of VRB. One LVRB is mapped to one PRB, and PRBs to which different LVRBs are mapped do not overlap. LVRB may be interpreted as PRB as it is.
'Distributed Virtual Resource Block (DVRB)' is another type of VRB. One DVRB is mapped to some REs in a plurality of PRBs, and REs mapped to different DVRBs do not overlap.

'N _D ' = 'N _d ' represents the number of PRBs to which one DVRB is mapped. FIG. 9 is a diagram illustrating an example of a method in which DVRB and LVRB are mapped to PRB, and N _D = 3 in FIG. After dividing an arbitrary DVRB into three parts, each divided part can be mapped to different PRBs. At this time, divided portions of other DVRBs are mapped to portions remaining without mapping the corresponding DVRBs in each PRB.

'N _PRB ' represents the number of PRBs in the system. In the case of dividing the system band, it may be the number of PRBs in the part defined by division.

'N _LVRB ' represents the number of LVRBs available in the system.

'N _DVRB ' represents the number of DVRBs available in the system.

'N _{LVRB_UE} ' indicates the number of maximum LVRBs allocated to one UE.

'N _{DVRB_UE} ' represents the maximum number of DVRBs allocated to one UE.

' _Nsubset ' represents the number of subsets.

'N _DivOrder ' represents the diversity order required by the system. Here, the diversity order is defined by the number of non-adjacent RBs.

  Here, “the number of RBs” means the number of RBs divided on the frequency axis. That is, even if RBs can be divided by slots constituting a subframe, 'number of RBs' means the number of RBs divided by the frequency axis of the same slot.

  FIG. 9 is a diagram illustrating a definition example of LVRB and DVRB.

  As shown in FIG. 9, each RE of one LVRB is mapped to each RE of one PRB on a one-to-one basis. For example, one LVRB is mapped to PRB0 (901). On the other hand, one DVRB is divided into three divisions, and each division is mapped to a different PRB. For example, DVRB0 is divided into three divisions, and each division is mapped to PRB1, PRB4, and PRB6, respectively. Similarly, DVRB1 and DVRB2 are each divided into three division units, and each division unit is mapped to the remaining resources in PRB1, PRB4, and PRB6. Although the DVRB is divided into three divisions in this example, the present invention is not limited to this. That is, for example, it can be divided into two divisions.

  The downlink data transmission from the base station to the specific terminal or the uplink data transmission from the specific terminal to the base station is performed through one or a plurality of VRBs in one subframe. At this time, the base station must inform the terminal of which VRB among the plurality of VRBs the data is to be transmitted when transmitting data to the specific terminal. Also, in order to allow a specific terminal to transmit data, the terminal is informed of which VRBs can transmit data.

  Methods for transmitting data are roughly classified into an FDS (Frequency Diversity Scheduling) method and an FSS (Frequency Selective Scheduling) method. The FDS (Frequency Diversity Scheduling) scheme is a scheme for obtaining a reception performance gain through frequency diversity, and the FSS (Frequency Selective Scheduling) scheme is a scheme for obtaining a reception performance gain through frequency selective scheduling.

  In the FDS scheme, the transmitting end transmits one data packet through subcarriers widely distributed in the system frequency domain, and the symbols in one data packet pass through various radio channel fading. The entire packet is prevented from undergoing adverse fading, resulting in improved reception performance. In contrast, in the FSS scheme, the reception performance is improved by transmitting the data packet through one or a plurality of continuous frequency regions in an advantageous fading state in the system frequency region. In an actual cellular OFDM wireless packet communication system, a plurality of terminals exist in one cell. In this case, the radio channel conditions of each terminal have different characteristics, so even within one subframe, FDS system data must be transmitted to a certain terminal and FSS system data must be transmitted to other terminals. You must. Therefore, a specific FDS transmission scheme and FSS transmission scheme must be designed so that both of these schemes can be efficiently multiplexed within one subframe. On the other hand, in the FSS system, gain (Gain) can be obtained by selectively using a band advantageous to the UE in the entire band, but in the FDS system, diversity is sufficiently performed without comparing the quality of a specific band. It is not necessary to select and transmit a specific frequency band as long as the frequency interval that can be obtained is maintained. Therefore, when scheduling, it is advantageous to improve the performance of the overall system by prioritizing FSS frequency selective scheduling.

In the FSS system, since data is transmitted using subcarriers that are continuously adjacent in the frequency domain, it is preferable to transmit data using LVRB. In this case, if there are N _{PRB PRBs in} one subframe, and at this time, it is possible to use up to N _{LVRB LVRBs} in the system, the base station has a bitmap of N _LVRB bits in each terminal. By transmitting the information, it is possible to inform the terminal of which LVRB the downlink data is transmitted or through which LVRB the uplink data can be transmitted. That is, each bit of the N _LVRB bit bitmap information transmitted as scheduling information to each terminal represents whether data is transmitted through the LVRB corresponding to the bit among the N _{LVRB LVRBs} . Such a method has a disadvantage that the number of bits to be transmitted to the terminal increases in proportion to the number of N _LVRBs .

  On the other hand, if only one set of adjacent RBs is allocated to the terminal, the allocated RB information can be expressed by the start point and the number of RBs. Such a scheme is called 'compact scheme' in this document.

  FIG. 10 is a diagram showing an example of a method of allocating resource blocks by the compact method.

In this case, as shown in FIG. 10, the length of available RBs differs according to each start point, and the number of combinations of RB allocation finally becomes N _LVRB (N _LVRB +1) / 2. Therefore, the number of bits required for this is ceiling (log ₂ (N _LVRB (N _LVRB +1) / 2)) bits. Here, ceiling (x) means a value rounded up to the nearest integer. This method has an advantage that the increase in the number of bits due to the increase in the number of N _LVRBs is relatively small compared to the bit map method.

  On the other hand, in the case of a method of notifying the UE (User Equipment) of the allocation of DVRB, the position of each division part of DVRB transmitted in a distributed manner for diversity gain is promised in advance, or this position is directly notified. Additional information is needed. Here, preferably, if the number of bits for signaling to the DVRB is set to be the same as the number of bits during LVRB transmission in the above-described compact scheme, the signaling bit format in downlink can be simplified, and as a result, the same. There are advantages such as being able to use channel coding.

  Here, when a plurality of DVRBs are allocated to one UE, the DVRB index, length (= number of allocated DVRBs) of DVRB to the UE, and the relative relationship between the divided parts divided in one DVRB The position (for example, the gap between the divided portions) is notified.

  FIG. 11 is a diagram illustrating an example of a method in which two DVRBs having consecutive indexes are mapped to a plurality of adjacent PRBs.

  As shown in FIG. 11, when a plurality of DVRBs having consecutive indexes are mapped to a plurality of adjacent PRBs, the first division units 1101 and 1102 and the second division units 1103 and 1104 are separated from each other by a gap 1105. However, the division units belonging to the upper division unit and the lower division unit are adjacent to each other, and the diversity order is 2.

  FIG. 12 is a diagram illustrating an example of a method in which two DVRBs having consecutive indexes are mapped to a plurality of distant PRBs.

  In the method according to FIG. 12, when DVRBs are associated with PRBs, continuous DVRB indexes can be distributed without corresponding to adjacent PRBs. For example, DVRB index '0' and DVRB index '1' are not arranged adjacent to each other. In other words, in FIG. 12, DVRB indexes are arranged in the order of 0, 8, 16, 4, 12, 20,..., And this arrangement is performed by inputting the continuous indexes in FIG. Can be obtained. In this case, not only dispersion by the gap 1203 but also dispersion in each of the division units 1201 and 1202 can be obtained. Therefore, as shown in FIG. 12, when the two DVRBs are assigned to the UE, the diversity order increases to 4 and there is an advantage that more increased diversity gain can be obtained.

  At this time, the value of Gap representing the relative position between the divisions can be expressed in two ways. First, the value of Gap can be represented by the difference value of the DVRB index. Second, the value of Gap can be represented by the difference value of the index between PRBs to which the DVRB is mapped. In FIG. 12, according to the first method, Gap = 1 and according to the second method, Gap = 3. FIG. 12 shows the latter case (1203). On the other hand, if the total number of RBs in the system changes, the DVRB index configuration may change. In this case, if the second method is used, there is an advantage that the physical distance between the divided parts can be grasped.

  FIG. 13 is a diagram showing the case where four DVRBs are assigned to one UE, using the same rules as FIG.

  As shown in FIG. 13, the diversity order is increased to seven. However, the diversity gain converges as the diversity order increases. According to the existing research results, the increase in gain is small at general order 4 or more. In addition, since PRRBs 1301, 1302, 1303, 1304, and 1305 in which PRRBs remain unmapped by the PRRBs must be mapped to DVRBs assigned to other UEs, there are other uses of DVRBs. If there is no UE, there is a disadvantage that some of these PRBs 1301, 1302, 1303, 1304 and 1305 can only be left empty without being used. Also, the distributed arrangement of DVRBs compromises the continuity of the available PRBs, thus creating a constraint on continuous LVRB allocation.

  Therefore, there is a need for a method that can decentralize allocation by limiting the diversity order to an appropriate level.

  Embodiments 1 and 2 of the present invention relate to a method of setting the relative distance between divided parts of DVRBs mapped to PRBs to zero. In these embodiments, when a plurality of DVRBs are allocated to one UE in a scheme in which consecutive DVRB indexes are mapped to PRBs that are separated from each other, each DVRB is divided into different PRBs. This can increase the diversity order. Alternatively, under the same conditions, it is possible to reduce the number of PRBs to which the DVRBs are distributed and allocated by allocating the divisions of the DVRBs to the same PRBs instead of distributing them to different PRBs. Diversity order can be limited.

Example 1
This embodiment relates to a method of switching the distributed / non-distributed mode of the division unit by setting a reference value for the number of DVRBs assigned to one UE (reference value for the number of DVRBs assigned to one UE). is there. Here, “distributed mode” indicates a mode in which the gap between DVRB division units has a value other than 0, and “non-dispersion mode” indicates a mode in which the gap between DVRB division units is 0.

When the number of DVRBs allocated to one UE is M, when the M value is less than a specific reference value (= M _th ), the diversity order can be increased by distributing and dividing DVRB division units.

Conversely, when the M value is greater than or equal to the reference value (= M _th ), the division parts are allocated to the same PRB without being distributed and allocated. By assigning to the same PRB in this manner, the number of PRBs to which DVRBs are distributed and mapped can be reduced, and thus the diversity order is limited.

That is, when the M value is equal to or greater than the reference value M _th , Gap, which is a relative distance between divided parts of the DVRB mapped to the PRB, is set to zero.

For example, when M _th = 3 is set, if the number of DVRBs is 2, the DVRB dividing unit can be distributed and mapped as shown in FIG. On the other hand, when M _th = 3 is set, if the number of DVRBs is four, setting the gap to zero makes it possible to map the DVRB division parts to the same PRB.

  FIG. 14 is a diagram illustrating an example of a resource block mapping method when Gap = 0 is set in the first embodiment.

Example 2
This embodiment relates to a method of switching the dispersion / non-dispersion mode of the division unit using a control signal. Here, “distributed mode” indicates a mode in which the gap between DVRB division units has a value other than 0, and “non-dispersion mode” indicates a mode in which the gap between DVRB division units is 0.

Example 2 is a modified version of the embodiment 1. In the embodiment 2, without setting the M _th, switches to the distributed / non-distributed mode by sending and receiving control signals as required. Depending on the transmitted and received control signals, the DVRB divisions may be dispersed to increase the diversity order, or the divisions of the DVRB may be mapped to the same PRB to reduce the diversity order.

  For example, the control signal can be defined to represent the value of Gap, which is the relative distance between the divided parts of the DVRB mapped to the PRB. That is, the control signal can be defined to represent the Gap value itself.

  For example, when the control signal represents Gap = 3, the DVRB division unit is distributed and mapped as shown in FIG. 12 or FIG. 13, and when the control signal represents Gap = 0, the DVRB division unit is the same as shown in FIG. Map to PRB.

As described above, in order to freely schedule the number of PRBs (N _PRB ) of the system in units of PRBs, it is necessary to transmit a bitmap of N _PRB bits to each scheduled UE. If the number of PRBs in the system (N _PRB ) is large, the overhead of control information increases in order to transmit this. Therefore, it is possible to consider a method in which the scheduling unit is reduced or the transmission is performed by dividing the scheduling unit only in a part of the band after dividing the band.

  In 3GPP LTE, a scheme has been proposed in which a bitmap is configured in consideration of the overhead in transmitting the bitmap as described above.

  An example of this bitmap configuration is shown in FIG.

  First, a signal for resource allocation is composed of a header 1501 and a bit map 1502. The header 1501 indicates the structure of the bit map 1502 to be transmitted, that is, the bit map method by notifying the signaling method.

  First, bitmaps are classified into two methods, an RBG method and a subset method.

In the RBG method, RBs are grouped into a plurality of groups. RB is mapped using one group as a basic unit. That is, a plurality of RBs constituting one group have association with mapping. As the size of the group increases, it becomes more difficult to make the resource allocation finer, but the number of bits in the bitmap can be reduced. Referring to FIG. 15, since N _PRB = 32, in order to allocate resources in units of 1 RB, a bit map of a total of 32 bits is required. However, if 3 RBs are grouped (P = 3) and resources are allocated in units of RBG (RB Group), the total RBs can be made into 11 groups. Therefore, only an 11-bit bitmap is required, and the amount of control information can be greatly reduced. However, when such allocation is performed in units of RBG groups, allocation cannot be performed in units of 1 RB, and precise resource allocation becomes impossible.

  The subset scheme can be used to compensate for this. In this scheme, multiple RBGs are configured in one subset, and resources are allocated in RB units in each subset. In order to use the 11-bit bitmap in the RBG method of FIG. 15 described above, '3' subsets (subset 1, subset 2, subset 3) can be configured. Here, '3' is the number of RBs constituting each RBG described above. In this case, NRB / P = ceiling (32/3) = 11, and RBs in each subset can be allocated in RB units with 11 bits. However, it is necessary to indicate which of the RBG method and the subset method is used for the bitmap, and which subset is used if the subset method is used, and thus the header information 1501 is required.

  If the header information 1501 indicates only which one of the RBG method and the subset method is used, and the type of the subset is specified using a part of bits of the bitmap used for the RBG, the entire subset In some cases, it may not be possible to utilize all of the RBs. For example, referring to FIG. 15, since a total of three subsets are set, a 2-bit subset indicator (Subset Indicator) 1503 is required to distinguish the subsets. At this time, a total of 12 RBs are allocated to the subsets 11504 and 1505, and there are only 9 bits remaining from the bit map consisting of 11 bits in total except for two bits of the subset indicator, and only 12 bits are 12 It is not possible to individually indicate all RBs individually. In order to solve this, a 1-bit shift indicator of the RBG bitmap can be allocated and used to shift the position of the RB indicated by the subset bitmap. For example, if subset indicator 1503 indicates subset 1 and move indicator 1506 indicates 'shift 0', the remaining 8-bit bitmaps are RB0, RB1, RB2, RB9, RB10, RB11, RB18. , RB 19 (see 1504). In contrast, when the subset indicator 1503 indicates subset 1 and the movement indicator 1506 indicates 'shift 1', the remaining 8-bit bitmaps are RB10, RB11, RB18, RB19, RB20, RB27. , RB28, RB29 (see 1505).

  In the above example, the case where the subset indicator 1503 indicates the subset 1 (1504, 1505) is taken up. However, the subset indicator 1503 may indicate the subset 2 or the subset 3. Therefore, it can be understood that eight RBs can be mapped in units of one RB for the combination of each subset indicator 1503 and each movement indicator 1506. Referring to FIG. 15, in this embodiment, the number of RBs assigned to subset 1, subset 2 and subset 3 is different from 12, 11 and 9, respectively. In the case of subset 2, 3 RBs cannot be used, and in the case of subset 3, 1 RB cannot be used. reference). FIG. 15 is for explanation, and the present embodiment is not limited by this drawing.

  It is possible to consider the case where the bit map method using the RBG method and the subset method and the compact method are used in combination.

  FIG. 16 is a diagram showing an example of a method of mapping by combining the bit map method and the compact method.

  When mapping DVRB by mapping as shown in FIG. 16, some resource elements of RBG0, RBG1, RBG2, and RBG4 are filled with DVRB. Among these, RBG 0 is included in subset 1, RBG 1 and RBG 4 are included in subset 2, and RBG 2 is included in subset 3. Here, RBG0, RBG1, RBG2, and RBG4 can not be allocated to UEs by the RBG scheme. Then, among the RBGs, the remaining RBs (PRB0, PRB4, PRB8, PRB12) allocated as DVRBs must be allocated to UEs in the subset scheme. However, since UEs to which RBs are assigned in the subset scheme can only be assigned RBs in one subset, the remaining RBs belonging to other subsets can only be assigned to different UEs. Therefore, DVRB scheduling imposes constraints on LVRB scheduling.

  Therefore, there is a need for a DVRB configuration method to reduce the scheduling constraints of LVRBs.

  The third to fifth embodiments relate to a method for setting the relative distance of the divided parts of the DVRB mapped to the PRB in order to reduce the influence on the LVRB.

Example 3
The third embodiment relates to a method of mapping a division part of a DVRB to RBs belonging to one specific subset, mapping to RBs of the specific subset, and then mapping to RBs belonging to another subset. is there.

  According to this embodiment, when mapping consecutive DVRBs to distributed PRBs, they are mapped so as to be distributed within one subset, and if they can not be mapped further within one subset, they are mapped with another subset. be able to. Continuous DVRB interleaving is also performed within the subset.

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

  DVRB 0-11 are distributed and mapped within subset 1 (1703), then DVRB 12-22 are distributed and mapped within subset 2 (1704), and then DVRB 23-31 are within subset 3. Are distributed and mapped (1705). Such mapping may be performed by methods using block interleavers for each subset and other methods.

  Such an arrangement can be achieved by adjusting the operation of the block interleaver.

Example 4
The fourth embodiment relates to a method for limiting the DVRB dividing unit to map to PRBs included in the same subset.

In the fourth embodiment, the gap information of the same DVRB can be mapped in the same subset using the gap information. At this time, parameters for the entire PRB can be used as in the above-described “Gap”. Or you can use other parameters for one subset, ie 'Gap _subset '. This will be described in detail below.

It is possible to simultaneously use a method of distributing and filling consecutive DVRBs in one subset and a method of mapping DVRB divisions in the same subset. In this case, it is preferable to use Gap _subset , which means a difference in the number of PRBs in the same subset, as information indicating a relative position difference between DVRB division units. Referring to FIG. 17, the meaning of Gap _subset can be understood. PRBs included in subset 1 are PRBs 0, 1, 2, 9, 10, 11, 18, 19, 20, 27, 28, 29. In this case, the PRB 18 is separated from the PRB 0 by 6 (Gap _subset = 6) indexes in the subset 1. On the other hand, when displaying the entire PRB as a target, the PRB 18 can display that 18 (Gap = 18) indices are apart from PRB0.

Example 5
The fifth embodiment relates to a method of setting the relative distance between the DVRB divisions to a multiple of the square of the size of the RBG.

In the case where the gap is set to a multiple unit of the size of the RBG as in the present embodiment, the following characteristics are obtained. That is, when displaying the relative position difference within one subset, the relative distance between the DVRB divisions is set to a multiple of the RBG size (P), and is displayed as a positional difference value with respect to the entire PRB. In some cases, the relative distance between DVRB divisions is limited to a multiple of the square of the RBG size (P ² ).

For example, referring to FIG. 15, it can be seen that P = 3 and P ² = 9. At this time, since a _{Gap, subset} = 6 between the first divided portion 1701 of DVRB 2 th division section 1702, a multiple of P (= 3), and first divided parts 1701 of DVRB 2 th Since Gap = 18 with the dividing unit 1702, it can be confirmed that it is a multiple of P ² (= 9).

  When the method according to this embodiment is used, RBGs in which only some of the resource elements are used have a high probability of belonging to the same subset, so that resource elements or RBs that remain unused are in the same subset. Therefore, the subset scheme allocation can be used efficiently.

  Referring to FIG. 17, the RBG 10 is different from other RBG sizes (= 3) because the RBG size is two. In this case, RBG 10 may not be available for DVRB, for convenience of DVRB index configuration. Referring to FIGS. 17 and 18, there are a total of 4 RBGs belonging to subset 1 including RBG 9, and 3 RBGs belonging to subset 2 except for RBG 10, and RBGs belonging to subset 3. There are a total of three. In this case, for convenience of the DVRB index configuration, RBG 9 out of the four RBGs belonging to subset 1 may not be used for DVRB.

  In such a case, first, as shown in FIG. 18, DVRB indexes can be mapped sequentially to one subset area (for example, subset 1) used for the DVRB among the subsets. If this one subset can not be mapped any more, it can be mapped to the next subset region (eg, subset 2).

  In FIG. 11 described above, the DVRB index is continuously arranged, but in FIGS. 12, 13, 14, 16, 16, and 18, it can be confirmed that the DVRB index is discontinuously arranged. . In this way, the DVRB index can change its arrangement before being mapped to the PRB index, and such changes can be made by the block interleaver. Hereinafter, the structure of the block interleaver according to the present invention will be described.

<Example 6>
Hereinafter, as an embodiment according to the present invention, a method for configuring an interleaver having a desired interleaver order (Degree) equal to a diversity order will be described.

Specifically, in the method of mapping consecutive indexes of DVRB to PRBs that are distributed without being adjacent to each other, a block interleaver is used, and the order of the interleaver is the same as the target diversity order (N _DivOrder ). We propose a method for configuring the interleaver. The order of the interleaver can be defined as follows:

  That is, in a block interleaver consisting of m rows and n columns, when data is recorded, the data is recorded while sequentially increasing its index. At this time, if one column (Column) is completely filled up, the column index (Column index) is increased by 1, and the next column is filled up and recorded. In one column (Column), recording is performed while increasing the row index (Row index). Next, when reading from the interleaver, after reading from one row (Row), the row index is increased by one and read from the next row. In this case, the interleaver can be referred to as an interleaver of degree m.

  On the other hand, a block interleaver consisting of m rows and n columns. When recording data, one row is filled and then it proceeds to the next row, and when reading data, one block is inserted. It is possible to fill one column and proceed to the next column. In this case, the interleaver can be called an interleaver of order n.

Specifically, first, N _DivOrder is limited to an integer multiple of N _D. That _is limited to _{N DivOrder} = K · _{N D.} Here, K is a positive integer. In addition, a block interleaver whose degree is N _DivOrder is used.

FIG. 19 is a diagram illustrating a case where the number of RBs used for interleaving is N _DVRB = 24, N _D = 2 and N _DivOrder = 2 × 3 = 6.

  Referring to FIG. 19, when recording in the interleaver, the data index is recorded while being increased sequentially. In this case, when one column is completely filled, the column index is increased by one. Record in the next column filling method. However, recording is performed while increasing the row index in one column (Column). Next, when reading from the interleaver, after reading all from one line, the line index is increased by 1 and read from the next line. However, reading is performed while increasing the column index in one row (Row). When such a read / write scheme is used, the order of the interleaver is the number of rows, and the number of rows is set to 6, which is the required diversity order.

When configured in this manner, a DVRB index order of a data sequence outputted from the interleaver can be used as an index order of first divided parts of DVRB, the data string by _N DVRB / _{N D} cyclic shift (Cyclic Shift The DVRB index order of the received data string can be used as the index order of the remaining partitions. As a result, the only mapped to the N _D PRB forms a the N _D divided parts pairs generated from DVRB, the difference between the DVRB indexes paired becomes K.

For example, in FIG. _{19, N DVRB / N D =} N DVRB (= 24) / N D (= 2) = 24/2 = a 12, a K = 3. The DVRB index order 1901 of the data string output from the interleaver is “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 DVRB index order 1902 of the data sequence obtained by cyclically shifting this data sequence by N _DVRB / N _D = 12 is“ 3 → 9 → 15 ”. → 21 → 4 → 10 → 16 → 22 → 5 → 11 → 17 → 23 → 0 → 6 → 12 → 18 → 1 → 7 → 13 → 19 → 2 → 8 → 14 → 20 ”. And DVRB makes a pair 2 each. Referring to 1903 of FIG. 19, it can be seen that DVRB0 and DVRB3 form a pair. It can be confirmed that the division units generated from DVRB0 and DVRB3 are combined and mapped to PRB0 and PRB12, respectively. The same applies to DVRBs having other indexes.

  According to this embodiment, the relationship between DVRB and PRRB to which DVRB is mapped can be effectively managed.

<Example 7>
Hereinafter, a method of filling a null value in a rectangular interleaver will be described as an embodiment according to the present invention.

In this specification below, the number of nulls filled in the interleaver can be denoted as 'N _null '.

In Example 6, since N _DVRB is an integer multiple of N _DivOrder , the interleaver could be completely filled with data. However, if N _DVRB is not an integral multiple of N _DivOrder , the interleaver cannot be completely filled, and a method of filling the null value needs to be considered.

To cyclic shift by N _DVRB / _{N D is, N DVRB} must be an integral multiple of _{N D,} to fill without gaps rectangular shape interleaver not become _{N DVRB} is an integer multiple of _{N DivOrder} I must. However, in the case of K> 1 _{is N DVRB} is an integer multiple of _{N D,} when _{N DVRB} is not a multiple of _{N DivOrder} occurs. In such a case, generally, the block interleaver is sequentially filled, the rest is filled with nulls, and then the data is read, but at this time, when the data is filled column by column, the data is read row by row Or, if the data is filled by row, read the data by column. In this case, the null value is read and read.

20a and 20b show a general case where the number of RBs used for interleaving is N _DVRB = 22, N _D = 2, N _DivOrder = 2 × 3 = 6, and N _DVRB is not an integer multiple of N _DivOrder. It is a figure which shows operation | movement of a block interleaver.

  Referring to FIG. 20a, the index difference between paired DVRBs has an arbitrary value. For example, (0, 20), (6, 3), (12, 9) form a pair (see 2001, 2002, 2003), and the index difference value of each pair is 20-0 = 20, 6 It can be seen that −3 = 3 and 12−9 = 3, which are not fixed values. Therefore, DVRB scheduling is more complicated than when the pair index difference has a constant value.

On the other hand, if the remainder when N _DVRB is divided by N _DivOrder is N _Remain , as shown in FIGS. 20a and 20b, the last column (Column) has the remaining elements excluding N _Remain values. Filled with nulls. For example, referring to FIG. 20a, the remainder when N _DVRB (= 22) is divided by N _DivOrder (= 6) is N _Remain (= 4). Elements can be filled with nulls. Here, although the example of filling in the null after is raised, the null can be positioned before the initial value of the index. For example, N _Remain values are filled from the top. Note that a null can be present at any specified position.

  21a and 21b relate to a null placement method according to one embodiment of the present invention. When compared with FIG. 20, it can be seen that the null values are uniformly dispersed.

In this embodiment, when nulls are to be filled in a rectangular block interleaver, dividing the N _DivOrder corresponding to the degree of the interleaver in N _D groups each having a size of K, uniformly a null in all groups Fill to be distributed. For example, in FIG. 21 a, the interleaver is divided into N _D (= 2) groups (G 2101, G 2102). At this time, K = 3. One null is recorded in group 1 (G2101), and one null is also recorded in group 2 (G2102), so that nulls are recorded in a distributed manner.

For example, when writing while sequentially filling in values, N _Remain values will remain at the end, but if indexes corresponding to this part are evenly distributed and arranged in N _D groups, null will be null. Are arranged uniformly. For example, in FIG. 21a, N _Remain (= 4) data spaces remain at the end, but the indexes 18, 19, 20, and 21 corresponding to this portion are uniformly distributed to ND (= 2) groups. Can be placed for each group.

  As a result, the difference between the paired DVRB indexes is maintained below the value of K (e.g., K = 3), which has the advantage of more efficient DVRB allocation.

<Example 8>
Hereinafter, as an embodiment according to the present invention, a method for setting a relative distance between divided parts of a DVRB mapped to a PRB to 0 will be described.

  FIG. 22 illustrates a method of mapping interleaved DVRB indices with a value of Gap = 0 according to an embodiment of the present invention.

On the other hand, consecutive indexes of DVRB, in a scheme for mapping the PRB dispersed without adjacent if the M DVRB are allocated to one UE, it is possible to set the reference value M _th related M. Based on the reference value M _th, the divided parts of each DVRB, it is possible to increase the diversity order by distributively assigned to different PRB. Alternatively, it is possible to reduce the number of PRBs to which the DVRBs are distributed and map, and to limit the diversity order, by allocating divided parts of each DVRB to the same PRBs without distributing them to different PRBs.

For example, when the M value is less than the specific reference value (= M _th ), the DVRB division unit is distributed to increase the diversity order, and when the M value is equal to or greater than the reference value (= M _th ), the division unit is not distributed. By assigning the same PRB to the same PRB, the number of PRBs to which DVRB is distributed mapped is reduced, and the diversity order is limited.

  That is, as shown in FIG. 22, the DVRB index of the data string output from the interleaver is commonly applied to all the DVRB division units and mapped to the PRB. For example, referring to FIG. 9, the DVRB index order of the data string output from the interleaver is “0 → 6 → 12 → 18 → 1 → 7 → 13 → 19 → 2 → 8 → 14 → 20 → 3 → 9 → 15 → 21 → 4 → 10 → 16 → 22 → 5 → 11 → 17 → 23 ”, but this DVRB index is commonly applied to the first dividing unit 2201 and the second dividing unit 2202 of DVRB. Is done.

<Example 9>
Hereinafter, as one embodiment according to the present invention, a method of using the above-mentioned Embodiment 6 and Embodiment 8 together will be described.

  FIG. 23 shows a configuration in which UE1 is scheduled in a manner in which DVRB division units are mapped to different PRBs as shown in FIG. 19, and DVRB division units are mapped to the same PRB as shown in FIG. It is a figure which shows the case where UE2 scheduled by the method which was performed is multiplexed simultaneously. That is, a case where scheduling is performed together by the method of the sixth embodiment and the eighth embodiment is shown.

  For example, referring to FIG. 23, DVRB0, DVRB1, DVRB2, DVRB3, and DVRB4 are allocated to UE1 (2301), and DVRB6, DVRB7, DVRB8, DVRB9, DVRB10, and DVRB11 are allocated to UE2 (2302). However, UE1 is scheduled by a scheme configured such that the DVRB division unit is mapped to different PRBs, and UE2 is scheduled by a scheme configured such that the division unit is mapped to the same PRB. Accordingly, the PRBs used for UE1 and UE2 are PRB0, PRB1, PRB4, PRB5, PRB8, PRB9, PRB12, PRB13, PRB16, PRB17, PRB20, and PRB21, as can be seen from 2303 in FIG. However, it can be seen that only part of PRB8 and PRB20 is used.

  When DVRB partitioning units are mapped to distributed PRBs, the difference in index of DVRBs in pairs is limited to K or less and does not affect DVRBs separated by more than K values. Indexes that cannot be used when mapping and indexes that can be used can be easily grasped.

Example 10
Hereinafter, as one embodiment according to the present invention, a method of limiting _NDVRB so as not to generate null will be described.

  Referring back to FIG. 20, it can be understood that the difference value of the paired DVRB indexes in the PRB may not be fixed at a constant value. In order to make this difference value equal to or smaller than a certain value, the above-described method of FIG.

However, the method according to FIG. 21 is a method of distributing nulls, and using this method increases the complexity of interleaver due to null processing. To prevent this, one can consider how to limit _NDVRB so that nulls do not occur.

In the illustrated interleaver, the matrix of rectangular interleavers is prevented from being filled with nulls by limiting the number of RBs used for _DVRBs (N _DVRB ) to be a diversity order, ie, a multiple of N _DivOrder .

In the case of a block interleaver whose degree (Degree) is D (Interleaver of degree D), if the number of RBs (N _DVRB ) used for _DVRB is limited to be a multiple of D, a rectangular matrix is filled with nulls. Absent.

Hereinafter, various embodiments using the interleaver according to the present invention will be described when K = 2 and N _D = 2. At this time, the relationship between the DVRB index and the PRB index can be expressed by a mathematical expression.

  FIG. 24 is a diagram for explaining the relationship between the DVRB index and the PRB index. The variables used in the mathematical expression can be understood with reference to the description below and FIG.

  Constants used in mathematical expressions 1 to 11 representing the relationship between the DVRB index and the PRB index are defined as follows.

  FIG. 25a is a diagram for explaining the above-described constant.

K = 2, N _D = 2,

But

If it is a multiple of, the relationship between the PRB index and the DVRB index can be obtained by mathematical formulas 1 to 3. First, the DVRB index when the PRB index p is given can be obtained by mathematical formula 1 or mathematical formula 2. Hereinafter, in this document, mod (x, y) means x mod y, and 'mod' means modulo operation. Also,

Means a truncation operation,

Indicates the largest number among integers smaller than or equal to the number in. Also,

Means rounding up,

Represents the smallest number among integers greater than or equal to the numbers in. Also, round (•) represents an integer closest to the number in (). Min (x, y) represents a smaller value of x and y, and max (x, y) represents a smaller value of x and y.

  vice versa,

But

When the DVRB index d is given, the PRB index when the DVRB index d is given can be obtained by Equation 3.

Figure 25b is a general way to fill the interleaver with nulls, K = 2, N _D = 2,

But

It is a figure which shows the case where it is a multiple of. The method according to FIG. 25 b is substantially similar to the method according to FIG. In FIG. 25b, the DVRB index when the PRB index p is given can be obtained using Equation 4.

  On the other hand, the PRB index when the DVRB index d is given can be obtained by Equation 5.

Example 11
FIG. 25c is a method of padding the interleaver with nulls according to an embodiment of the present invention, where K = 2 and N _D = 2;

But

It is a figure which shows the case where it is a multiple of.

  FIG. 25 c corresponds to the method according to Example 7 and FIG. 21 described above. The method according to FIG. 25c can be described using mathematical formulas 6-8. In FIG. 25 c, the DVRB index when the PRB index p is given can be determined using Equation 6 or Equation 7.

  Conversely, the PRB index when the DVRB index d is given in FIG.

Example 12
FIG. 25d shows that K = 2, N _D = 2 and the size of the interleaver (= C × R).

When the setting is made, the method according to the seventh embodiment and FIG. 21 described above is applied. Where

Is the number of nulls included in the interleaver and is a preset value. At this time, the DVRB index when the DVRB index p is given can be determined by the mathematical expression 9 or the mathematical expression 10.

  On the contrary, the PRB index when the DVRB index d is given can be obtained by the mathematical formula 11.

  Referring back to the description of FIG. 15 described above, it is possible to consider the case where the bit map method using the RBG method and the subset method and the compact method are used in combination. Problems that may occur in this case will be described with reference to FIGS.

  FIG. 26 and FIG. 27 are diagrams showing an example of a method of using the RBG method, the bit map method using the subset method and the compact method in combination.

As shown in FIG. 26, after the DVRB is divided into two divided parts, the second divided part can be cyclically shifted by Gap = N _DVRB / N _D = _50/2 . Then, only some resource elements of PRBG RBG0 are mapped by the first division unit of DVRB, and only some resource elements of PRB RBG8 and RBG9 are mapped by the second division unit of DVRB. . Therefore, RBG0, RBG8, and RBG9 cannot be used for the method of assigning in units of RBGs.

In order to solve the above problems, as shown in FIG. 27, the multiple of _MRBG , which is the number of RBs belonging to one RBG, can be set to be the value of Gap. That is, Gap = M _RBG * k (k is a natural number) can be satisfied. If Gap is set in this way, for example, Gap = M _RBG * k = 3 * 9 = 27. If Gap = 27, after dividing DVRB into two division parts, the second division part can be cyclically shifted by Gap = 27. Then, only some resource elements of PRBG RBG0 are mapped by the first division unit of DVRB, and only some resource elements of RBG 9 of PRB are mapped by the second division unit of DVRB. Therefore, unlike the method according to FIG. 26, the method according to FIG. 27 can be used for a system in which RBG 8 is allocated in RBG units.

  However, in the method according to FIG. 27, paired DVRB indexes in one PRB can not be paired with each other in another PRB. Referring back to FIG. 26, the paired DVRB indices (1, 26) (2601) in the PRB 1 are paired (2603) in the PRB 26 as well. However, in FIG. 27, the DVRB index (1, 27) (2701) paired in PRB1 cannot be paired in PRB25 or PRB27 (2703, 2705).

  In the case of FIGS. 26 and 27, DVRB1 and DVRB2 are mapped to PRB1, PRB2, PRB25 and PRB26. At this time, some resource elements of PRB 1, PRB 2, PRB 25 and PRB 26 remain unmapped.

  In this case, if DVRB25 and DVRB26 are further mapped to PRBs in FIG. 26, DVRB25 and DVRB26 are all buried in the remaining spaces of PRB1, PRB2, PRB25, and PRB26.

  However, in FIG. 27, if DVRB25 and DVRB26 are further mapped to PRB, DVRB25 and DVRB26 are mapped to PRB0, PRB25, PRB26, and PRB49. Therefore, some resource elements not mapped among PRB1 and PRB2 are still not embedded in the DVRB, and some resource elements of PRB1 and PRB26 remain unmapped. That is, in FIG. 27, there is a disadvantage that there is always a PRB that remains unmapped.

Such problem arises from the Gap is not a cyclic shift such that _N DVRB / _{N D. Here, N} DVRB / _{N D} is at the multiples of _{M RBG,} the position of the cyclic shift for a multiple of _{M RBG,} the above problems can be solved.

Example 13
Therefore, in order to solve problems of FIGS. 26 and 27 at the same time, in one embodiment according to the present invention, to limit the number of RB used for DVRB the _{(N DVRB)} to a multiple of _N D _{· M RBG.}

<Example 14>
On the other hand, in the above case, it is found that the first division and the second division of the DVRB belong to different subsets. In order to make the two divided parts of each DVRB belong to the same subset, Gap, it must be set to be a multiple of the square _{(M RBG} ²⁾ of _{M RBG.}

Therefore, in another embodiment of the present invention, the number of RBs used in a DVRB (N to ensure that the two splits of the DVRB belong to the same subset and to make the DVRB pair. _DVRB) to be limited to a multiple of _N D _{· M RBG} ^2.

Figure 28 _is an example of setting _{N DVRB} to a multiple of _N D _{· M RBG.}

As shown in FIG. 28, Gap, _is because it is a multiple of _M RBG · _{N D,} divided parts of each DVRB by cyclic shift can be made to always pairs in PRB, also fills a portion of the resource elements It is possible to reduce the number of remaining RBGs.

Example 15
FIG. 29 shows an example of interleaving DVRB indexes in the method according to FIG.

When DVRB indexes are interleaved as shown in FIG. 29, N _DVRB can be set to a multiple of N _D · M _RBG when mapping to PRB. As a result, the rectangular interleaver matrix may not be completely filled as shown in FIG. 20, and therefore, the non-filled portion of the rectangular interleaver matrix must be filled with nulls. Cases can arise. In order to avoid the case where it must be filled with nulls, in the case of a block interleaver whose degree is D (Interleaver of degree D), the number of RBs used for _DVRB (N _DVRB ) is limited to be a multiple of D. Must.

Thus, in one embodiment of the present invention, as the position of the Gap is a multiple of _{M RBG,} the second DVRB divided part by a cyclic shift by _N RB / _{N D,} is mapped to one PRB that DVRB indexes are so paired together, in order to prevent that no null is filled in the block interleaver, RB number used in the DVRB _{(N DVRB) is} limited to a common multiple of the N D _{· M RBG} and D The In this case, emergency, if diversity order using the D to interleaver _{(N DivOrder = K · N D} ), N DVRB _is limited to a common multiple of the N D _{· M RBG} and K · _{N D.}

Example 16
Further, in another embodiment of the present invention, the Gap is set to a multiple of _{M RBG} square in order to position to the same subset of two divided parts of each DVRB, the second DVRB divided part by _N RB / _{N D} The number of RBs used in the _DVRB (N _DVRB ) so that the DVRBs mapped to one PRB are paired with each other by the cyclic shift so that the block interleaver is not filled with nulls. _{It is} limited to a common multiple of the N D _{· M RBG} ² and D. In this case, emergency, if diversity order using the D to interleaver _{(N DivOrder = K · N D} ), N DVRB _is limited to a common multiple of the N D _{· M RBG} ² and K · _{N D.}

Example 17
On the other hand, FIG. 30 is a diagram showing the case where _D is set to the number C of columns and at this time C is set to N _DivOrder = K · N _D.

  However, in FIG. 30, after completely filling one column, writing is performed by filling the next column, and after reading one row completely, the next row is read.

In the embodiment according to FIG. 30, _NDVRB is configured such that consecutive DVRB indexes are assigned to the same subset. The illustrated rectangular interleaver is configured such that consecutive indexes are filled in the same subset when the number of rows is a multiple of M _RBG ² . Since the number of rows is R = N _DVRB / D, the number of RBs used in the _DVRB (N _DVRB ) is limited to a multiple of D · M _RBG ² .

Further, in order to map two DVRB divisions to PRBs in the same subset, the number of RBs used for _DVRB (N _DVRB ) may be limited to a common multiple of D · M _RBG ² and N _D · M _RBG ^2. it can. For _D = K · _{N D,} because the common multiple of _{K ·} N D · _{M RBG} ² and _N D _{· M RBG} ² _{is ^{K · N D · M RBG 2}} , N DVRB is K · _N D · M Limited to multiples of _RBG ² .

  Finally, the number of RBs used as DVRBs may be the maximum number of DVRBs that satisfy the above-described restriction condition within the number of PRBs in the entire system. RBs used for DVRBs can be interleaved and used.

Example 18
Hereinafter, as one embodiment according to the present invention,

A method of mapping using a temporary PRB index when the lengths of L are different will be described.

  FIG.

FIG. 29 illustrates a method of finally corresponding to a PRB by processing the mapping result to the PRB again using the DVRB interleaver according to FIG.

  The scheme according to FIG. 31 can be selected according to the degree of utilization of system resources. In this method, the p value of the above-described relationship between the DVRB index and the PRB index is defined as a temporary PRB index. At this time,

P value exceeding

The value o added to is used as the final PRB index.

  In such a case, the four alignment methods exemplified in FIGS. 31A, 31B, 31C, and 31D can be expressed as in Equation 12.

  Here, (a) indicates justification, (b) indicates left alignment, (c) indicates right alignment, and (d) indicates center alignment. On the other hand, when the PRB index o is given, the DVRB index d can be obtained by the mathematical expression 13 using the temporary PRB index p.

  Also, when the DVRB index d is given, the PRB index o can be obtained by the mathematical equation 14 using the temporary PRB index p.

Embodiment 19
Hereinafter, as an example according to the present invention, while satisfying the Gap restriction condition,

A mapping method that can increase the maximum is described.

In the above embodiment, when an RBG method and / or a subset method is introduced for LVRB allocation, an interleaver structure for reducing the number of remaining PRBs without mapping some resource elements by DVRB is presented. In addition, a method of limiting the number of RBs (N _DVRB ) used for DVRB was presented. However, the larger the restriction condition based on the M _RBG value, the greater

Of these, the restriction on the number of RBs used for _DVRB (N _DVRB ) increases.

  FIG.

, M _RBG = 3, K = 2, N _D = 2 using a rectangular interleaver.

  In FIG. 32, in order to map two divided parts of the DVRB to PRBs belonging to the same subset,

Is set to be a multiple of D · M _RBG ² (= 18).

But

The maximum so as not to exceed

If you ask for

It becomes. In such a case, 32-18 = 14 RBs can not be used for DVRB.

  At this time,

Thus, it can be confirmed that DVRB0 is mapped to the first RB of RBG0 and RBG3 belonging to the same subset.

  Therefore, in the present invention,

In the case of

In this case, a method is proposed in which the offset and the threshold value (Threshold) to which the offset is applied are set and the Gap restriction condition is satisfied as described above.

1) First, a desired gap restriction condition is set. For example, Gap, _can be set to a multiple of a multiple or _{M RBG} ² of _{M RBG.}

    2) Next, among the numbers that can satisfy the Gap restriction condition,

The number that most closely approximates

And set.

    3)

If smaller, the mapping as illustrated in FIG. 20 is applied.

    4)

Is greater than or equal to and if the interleaver allows nulls,

become. However, if you do not allow nulls in the interleaver,

become.

    5)

Apply an offset to more than half of. That is, the offset application standard value

Set to.

6) The offset is set so that the temporary PRB to which the offset is applied satisfies the Gap restriction condition.
That is,

become.
This can be expressed as generalized mathematical formula 15.

  FIG.

, M _RBG = 3, and K = 2 and N _D = 2 rectangular interleavers, this is an example of applying the DVRB mapping rule proposed in the present invention.

  In order to map two divided parts of the DVRB to PRBs belonging to the same subset,

_Satisfies a multiple of M _RBG ² (= 9),

To be the closest to

If you set

become. In such a case, (32-18) × 2 = 28 RBs are used for DVRB. That is,

And

become. Therefore, the temporary PRB index to which the DVRB index interleaved by the rectangular interleaver is mapped is

Compare with

To the index of the temporary PRB that satisfies

Is added, as shown in FIG. Referring to FIG. 33, it can be confirmed that the two division units of DVRB0 are mapped to the first RBs of RBG0 and RBG6 belonging to the same subset. Further, as compared with the method according to FIG. 32, it can be confirmed that the number of RBs usable for the DVRB increases from 18 to 28 under the same gap restriction condition. Also, diversity in DVRB mapping can be further increased by increasing the gap distance.

Example 20
Hereinafter, as one embodiment according to the present invention, while mapping consecutive indexes to specific positions,

A mapping method that can increase the maximum is described.

When multiple DVRBs are assigned to one UE, consecutive DVRBs are assigned. Therefore, as described above, similarly to the case defining a Gap,, for LVRB scheduling is adjacent index is preferably set to be positioned at multiple intervals multiples and _{M RBG} ² of _{M RBG.} In this case, if the degree of the interleaver is equal to the number C of columns, the number R of rows must be a multiple of the multiple or M _RBG ² of M _RBG. Therefore, the size of the interleaver

Is

Multiple of or

Must be a multiple of. Therefore,

Is given in advance, the minimum interleaver size satisfying such a condition can be obtained as follows.

  The embodiment described above is a combination of components and features of the present invention in a predetermined form. Each component or feature should be considered optional unless specifically stated otherwise. Each component or feature can be implemented in a form that is not combined with other components or features. In addition, it is possible to configure an embodiment of the present invention by combining some components and / or features. The order of operations described in the embodiments of the present invention can be changed. Some components or features of one embodiment may be included in another embodiment, or may be replaced with corresponding components or features of another embodiment. It is obvious that claims which are not explicitly cited in the claims can be combined to constitute an embodiment, or can be included as new claims by amendment after application.

  The embodiments of the present invention can be embodied by various means, such as hardware, firmware, software, or a combination thereof. When implemented in hardware, one embodiment of the present invention includes one or more ASICs (Application Specific Integrated Circuits), DSPs (Digital Signal Processing D), DSPDs (Digital Signal Processing D, Digital Signal Processing D, Digital Signal Processing D). , FPGAs (Field Programmable Gate Arrays), processors, controllers, microcontrollers, microprocessors, and the like.

  In the case of implementation by firmware or software, an embodiment of the present invention may be implemented in the form of a module, procedure, function, or the like that performs the functions or operations described above. The software codes may be stored in a memory unit and driven by a processor. This memory unit is located inside or outside the processor and can exchange data with the processor by various known means.

  The present invention can be used in transmitters and receivers used in broadband wireless mobile communication systems.

  It will be apparent to those skilled in the art that the present invention can be embodied in other specific forms without departing from the spirit and essential characteristics of the present invention. Therefore, the above detailed description should not be construed as restrictive in any respect, and should be considered as illustrative. The scope of the invention should be determined by reasonable interpretation of the appended claims, and all changes that come within the equivalent scope of the invention are included in the scope of the invention.

Claims (6)

A user equipment for receiving downlink data using a resource block in a wireless mobile communication system, said user equipment comprising:
A data processing circuit configured to control operation of the user equipment;
A receiver coupled to the data processing circuit;
The receiver
Receiving downlink control information including resource allocation information for the downlink data from a base station;
Receiving the downlink data mapped to a physical resource block (PRB) based on the downlink control information, and
The resource allocation information indicates virtual resource block (VRB) allocation for the user equipment,
Each resource block corresponds to one time slot,
The resource block pair includes a first resource block associated with a first time slot and a second resource block associated with a second time slot adjacent to the first time slot, The first and second resource blocks are assigned to the same frequency index,
The mapping relationship between the VRB pair and the PRB pair is such that the frequency continuous VRB pair is mapped to the frequency non-consecutive PRB pair, and each resource block pair is divided into the first and second resources of the resource block pair. Exists so that there is a frequency gap between the blocks,
The resource allocation information indicates a frequency gap size, the user equipment.   The user equipment according to claim 1, wherein the frequency gap is a relative distance between the first and second resource blocks of the resource block pair.   The user equipment according to claim 1, wherein the frequency gap size is a multiple of the square of the number of consecutive PRBs in a resource block group. A method of receiving downlink data using resource blocks at a user equipment in a wireless mobile communication system, the method comprising
Receiving downlink control information including resource allocation information for the downlink data from a base station;
Receiving the downlink data mapped to a physical resource block (PRB) based on the downlink control information,
The resource allocation information indicates virtual resource block (VRB) allocation for the user equipment,
Each resource block corresponds to one time slot,
The resource block pair includes a first resource block associated with a first time slot and a second resource block associated with a second time slot adjacent to the first time slot, The first and second resource blocks are assigned to the same frequency index,
The mapping relationship between the VRB pair and the PRB pair is such that the frequency continuous VRB pair is mapped to the frequency non-consecutive PRB pair, and each resource block pair is divided into the first and second resources of the resource block pair. Exists so that there is a frequency gap between the blocks,
The resource allocation information indicates a frequency gap size, method. The method of claim 4 , wherein the frequency gap is a relative distance between the first and second resource blocks of the resource block pair. The method of claim 4 , wherein the frequency gap size is a multiple of the square of the number of consecutive PRBs in a resource block group.