JP7116708B2 - Distributed Virtual Resource Block Scheduling Method - Google Patents

Description

TECHNICAL FIELD 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 a cellular OFDM wireless packet communication system, uplink/downlink data packet transmission is performed in units of subframes, and one subframe is defined as 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 consists of 10 subframes, and one subframe consists of 2 slots. FIG. 2 shows the structure of a type 2 radio frame. The 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 consists of two slots. That is, one subframe is composed of two slots regardless of the type of radio frame.

The signal transmitted in each slot is

Subcarrier of and

can be represented by a resource grid formed of OFDM symbols. here,

indicates the number of resource blocks (RB) in the 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.

RB is used to represent a mapping relationship between a physical channel and resource elements. RBs can be classified into physical resource blocks (PRBs) and virtual resource blocks (VRBs). A 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 VRBs and PRBs can be expressed using the mapping relationship between VRB indexes and PRB indexes. A detailed description thereof will be given later in the embodiment of the present invention.

PRB is

consecutive OFDM symbols and in the frequency domain

are defined by consecutive subcarriers of Therefore, one PRB is

resource elements. PRB is from 0 to

are assigned numbers up to

A VRB may have the same size as a PRB. Two types of VRB are defined, one type is Localized Type and the other type is Distributed Type. For each type of VRB, a pair of VRBs have a single VRB index (hereinafter also referred to as VRB number) and are allocated over two slots in one subframe. In other words, of the two slots forming one subframe, the

, respectively, from 0 to

and belong to the second of the two slots

Similarly for the VRB of , from 0 to

is assigned an index of one of

The VRB index corresponding to the specific virtual frequency band of the first slot has the same value as the VRB index 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 denoted as VRB1(i), the VRB corresponding to the j-th virtual frequency band of the second slot is denoted as VRB2(j), and VRB1( If the index numbers of i) and VRB2(j) are respectively written as index(VRB1(i)) and index(VRB2(j)), the relationship of index(VRB1(k))=index(VRB2(k)) is holds (see Fig. 4a).

Similarly, the PRB index corresponding to the specific frequency band of the first slot has the same value as the PRB index corresponding to the specific frequency band of the second slot. That is, the PRB corresponding to the i-th frequency band of the first slot is denoted as PRB1 (i), the PRB corresponding to the j-th frequency band of the second slot is denoted as PRB2 (j), and PRB1 (j) and PRB2 (j) are represented 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 allocated as local type and some may be allocated as distributed type. Hereinafter, a VRB assigned as a local type will be referred to as a localized VRB (Localized Virtual Resource Block; LVRB), and a VRB assigned as a distributed type will be referred to as a distributed VRB (Distributed Virtual Resource Block; DVRB).

LVRBs (localized VRBs) are directly mapped to PRBs, and the LVRB index corresponds to the PRB index. And the LVRB with index i corresponds to the PRB with index i. That is, LVRB1 with index i corresponds to PRB1 with index i, and LVRB2 with index i corresponds to PRB2 with index i (see FIG. 5). In this case, assume that all VRBs in FIG. 5 are assigned as LVRBs.

A DVRB (Distributed VRB) may not be directly mapped to a PRB. That is, the DVRB index can also be mapped to the PRB after going through a series of processes.

First, consecutive index sequences of DVRBs can be reordered by a block interleaver. Here, the continuous index string means that the index number starts from 0 and increases one by one. The index columns output from the interleaver are sequentially mapped to consecutive index columns of PRB1 (see FIG. 6). Assume that all the VRBs in FIG. 6 are assigned as DVRBs. Subsequently, the index string output from the interleaver is cyclic-shifted by a predetermined number, and the cyclically-shifted index string is sequentially mapped to the continuous index string of PRB2 (Fig. 7). Assume that all the VRBs in FIG. 7 are assigned as DVRBs. In this manner, PRB indices and DVRB indices can be mapped across two slots.

In this process, consecutive index columns of DVRB without interleaver can be sequentially mapped to consecutive index columns of PRB1. Also, consecutive index strings of DVRBs that do not pass through an interleaver may be cyclically shifted by a predetermined number, and the cyclically shifted index strings may be sequentially mapped to consecutive index strings of PRB2.

According to the above process of mapping DVRBs to PRBs, PRB1(i) and PRB2(i) with the same index i are mapped to DVRB1(m) and DVRB2(n) with different indices m, 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) with different indices, respectively. A frequency diversity effect can be obtained by the DVRB mapping scheme.

As shown in FIG. 8, when VRB(1) among VRBs is allocated as DVRB, PRB2(6) and PRB1(9) are still allocated VRBs when using the methods of FIGS. LVRB cannot be assigned to PRB2(6) and PRB1(9). This is because, according to the LVRB mapping method described above, mapping LVRBs to PRB2 (6) and PRB1 (9) means that LVRBs are also mapped to PRB1 (6) and PRB2 (9). This is because PRB1(6) and PRB2(9) have already been mapped by VRB1(1) and VRB2(1) above. Therefore, it can be understood that the LVRB mapping may be restricted according to the DVRB mapping result. Therefore, it is necessary to determine the DVRB mapping rule in consideration of the LVRB mapping.

In a broadband wireless mobile communication system using multi-carriers, radio resources can be allocated to each terminal using LVRB and/or DVRB schemes. This allocation information can be transmitted in bitmap form. 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, 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) composed of PRBs of consecutive k indices and allocate resources with a granularity of '1' RBG). Allocation cannot be done finely, but it has the advantage of reducing bit overhead. At this time, k=3, for example.

In this case, LVRBs can be mapped to PRBs in units of RBGs. For example, PRBs with three consecutive indices, that is, PRB1(i), PRB1(i+1), PRB1(i+2), PRB2(i), PRB2(i+1), PRB2(i+2), represent one RBG. configurable and can map LVRBs to this RBG on an RBG-by-RBG basis. However, if one or more of PRB1(i), PRB1(i+1), PRB1(i+2), PRB2(i), PRB2(i+1), PRB2(i+2) are pre-mapped by the DVRB, this RBG is It is not possible to map to LVRB on an RBG basis. That is, the DVRB mapping rule may limit the RBG unit mapping of the LVRB.

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

SUMMARY OF THE INVENTION It is an object of the present invention 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, in a wireless mobile communication system supporting a resource allocation scheme in which one RBG composed of continuous physical resource blocks is represented by one bit, continuous allocation is performed. A resource block mapping method for distributing and mapping virtual resource blocks to physical resource blocks is determined from an index number where the virtual resource block starts and a resource indication value (RIV) representing the length of the virtual resource block. performing interleaving on indices of virtual resource blocks using a block interleaver; sequentially mapped to the physical resource block index, and on the second slot, the index obtained by cyclically shifting the interleaved index by the size of the gap for distribution is the index of the physical resource block; , wherein the size of the gap (Gap) is a multiple of the square of the number (M _RBG ) of consecutive physical resource blocks constituting the RBG.

Preferably, when the degree of the block interleaver is defined as the number of columns of the block interleaver C=4, the number of rows of the block interleaver R is given by Equation 1: The number of nulls _Nnull given and embedded in the block interleaver is given by Equation (2).

However, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and N _DVRB represents the number of distributed virtual resource blocks.

However, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and N _DVRB represents the number of distributed virtual resource blocks.

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

Preferably, given the distributed allocation virtual resource block index d, the physical resource block index p1,d on the first slot mapped to _{the d} is given by Equation 3: , the index p2 _,d of the physical resource block on the second slot mapped to d is given by Equation (4). where R represents the number of rows of the block interleaver, C represents the number of columns of the block interleaver, and N _DVRBs are used as virtual resource blocks distributed and allocated. number of RBs used for DVRB, N _null is the number of nulls embedded in the block interleaver, and mod is a modulo operation.

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

When p _1,d is greater than N _DVRB /2, the value of p 1, _d is p _1,d +N _PRB −N _DVRB , and when p _2,d is greater than N _DVRB /2 , the value of p 2, _d is p _2,d +N _PRB −N _DVRB . Here, N _PRB represents the number of physical resource blocks in the system.

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

Preferably, when the order of the block interleaver is the number of rows of the block interleaver, the respective groups correspond to the respective rows, and the order of the block interleaver is equal to the block interleaver. If it is the number of columns in the leaver, the respective groups correspond to the respective columns.

In another aspect of the present invention, in a wireless mobile communication system supporting a resource allocation scheme in which one RBG consisting of consecutive physical resource blocks is represented by one bit, the consecutively assigned virtual resource blocks are A resource block mapping method that distributes and maps to blocks includes interleaving for an index of the virtual resource block determined from an index number where the virtual resource block starts and a resource indication value (RIV) representing the length of the virtual resource block. using a block interleaver, and sequentially converting the interleaved index to the index of the physical resource block on the first slot of one subframe consisting of the first slot and the second slot. sequentially mapping, on the second slot, the index obtained by cyclically shifting the interleaved index by the size of the gap for distribution to the index of the physical resource block; , and the size of the gap (Gap) for the dispersion, _{N_gap} , is given by Equation (5).

However, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and N _PRB represents the number of physical resource blocks of the system.

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

Preferably, given the distributed allocation virtual resource block index d, the physical resource block index p _1,d on the first slot mapped to the d is higher than N _DVRB /2. If 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 d is N _DVRB / If 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 distributed allocated virtual resource blocks (number of RBs used for DVRB).

In another aspect of the present invention, in a wireless mobile communication system supporting a resource allocation scheme in which one RBG consisting of consecutive physical resource blocks is represented by one bit, the consecutively assigned virtual resource blocks are A resource block mapping method that distributes and maps 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 from the detected resource indication value, the determining an index of a virtual resource block; and performing interleaving on the determined virtual resource block index using a block interleaver, and distributing and mapping the virtual resource block to physical resource blocks. , and the degree of the block interleaver is the same as the diversity order (Diversity Order, N _DivOrder ) determined by the dispersion.

In another aspect of the present invention, in a wireless mobile communication system supporting a resource allocation scheme in which one RBG consisting of consecutive physical resource blocks is represented by one bit, the consecutively assigned virtual resource blocks are A resource block mapping method for distributed mapping in blocks, determining an index of the virtual resource block from an index number where the virtual resource block starts and a resource indication value (RIV) representing a length of the virtual resource block; a mapping step of performing interleaving on the determined virtual resource block index using a block interleaver, and distributing and mapping the virtual resource blocks to physical resource blocks; N _DVRB ) is not an integer multiple of the degree of block interleaver (Degree of block interleaver), the mapping step defines the interleaver as the number of physical resource blocks (N _D ) to which one virtual resource block is mapped. ) and evenly distributing nulls in each of the divided groups.

Preferably, when the order of the block interleaver is the number of rows of the block interleaver, the respective groups correspond to the respective rows, and the order of the block interleaver is equal to the block interleaver. If it is the number of columns in the leaver, the respective groups correspond to the respective columns.

Preferably, the control information is DCI transmitted through PDCCH.

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

Preferably, given the physical resource block index p, 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. where R represents the number of rows of the block interleaver, C represents the number of columns of the block interleaver, and N _DVRB is used for distributed virtual resource blocks. mod represents the number of resource blocks used, and mod means modulo operation.

Preferably, 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.

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

Preferably, the resource block mapping method further includes receiving information about the size of the gap, and the size of the gap is determined by the received information about the size of the gap.

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 scheme and a subset resource allocation scheme is: , a receiving step of receiving control information including resource block allocation information indicating that the virtual resource blocks are allocated in a distributed manner and the indices of the virtual resource blocks; and a block interleaver for the indices of the virtual resource blocks. Performing interleaving, wherein the interleaving is completed by mapping the indices of the virtual resource blocks to the indices of the physical resource blocks belonging to one of the plurality of RBG subsets. and performing interleaving, which is performed such that the indices of the virtual resource blocks are not mapped to the indices of physical resource blocks belonging to other subsets.

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

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

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

Preferably, the number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks (N _D ) to which one virtual resource block is mapped to the number of consecutive physical resource blocks (M _RBG ) constituting the RBG. ) is an integral multiple of the value multiplied by

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 square of the number of consecutive physical resource blocks constituting the RBG (M _RBG ² ). It is an integral multiple of the value multiplied by (N _D ).

Preferably, the number of virtual resource blocks (N _DVRB ) is the number of physical resource blocks (N _D ) in which one virtual resource block is mapped to the number of consecutive physical resource blocks (M _RBG ) constituting the 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 obtained by multiplying the number of physical resource blocks (N _D ) to which one virtual resource block is mapped to the square of the number (M _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 (M _RBG ² ) forming the RBG. It is an integer multiple.

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 (M _RBG ² ) constituting the RBG; It is a common multiple of a value obtained by multiplying the number of physical resource blocks (N _D ) to which one virtual resource block is mapped by the square of the number of consecutive physical resource blocks (M _RBG ² ) forming 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 invention described above are applicable 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, prior to the interleaving step or the step of determining the virtual resource block index, from a mobile station of a wireless mobile communication system: It can further include receiving a resource indication value (RIV).
The present invention provides, for example, the following.
(Item 1)
A resource block mapping method for distributing and mapping consecutively allocated virtual resource blocks to physical resource blocks in a wireless mobile communication system,
interleaving the indices of the virtual resource blocks using a block interleaver;
sequentially mapping the interleaved indices onto first and second slots on one subframe with gaps for dispersion;
including
Given the distributed allocation virtual resource block index d, if the physical resource block index p _1,d on the first slot mapped to the d is greater than N _DVRB /2 , 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 d is greater than N _DVRB /2 is also large, 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 allocation of virtual resource blocks (number of RBs used for DVRB), a resource block mapping method.
(Item 2)
The resource block mapping method according to item 1, wherein the index p1, _d is given by Equation 1 and the index p2 _,d is given by Equation 2.

where R represents the number of rows of the block interleaver, C represents the number of columns of the block interleaver, and N _DVRB is the resource used for distributed virtual resource blocks. It represents the number of blocks (number of RBs used for DVRB), and mod means modulo operation.
(Item 3)
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, and the gap constitutes the RBG. Resource block mapping method according to item 1, which 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 gap size N _gap for the distribution is given by Equation 1.

However, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and N _PRB represents the number of physical resource blocks of the system.
(Item 5)
The resource block mapping method according to item 1, wherein the order (Degree) of the block interleaver is the same as the diversity order (Diversity Order, N _DivOrder ) determined by the dispersion.
(Item 6)
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 number of virtual resource _blocks ( ^N _DVRB ) is the number of physical resource blocks to which one virtual resource block is mapped (N _D ), the resource block mapping method according to item 1.
(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 columns of the block interleaver = 4, the number R of rows of the block interleaver is given by Equation 1, The resource block mapping method according to item 1, wherein the number of nulls N _null to be filled in the leaver is given by Equation 2.

However, M _RBG represents the number of consecutive physical resource blocks constituting the RBG, and N _DVRB represents the number of distributed virtual resource blocks.
(Item 8)
The resource block mapping method of item 7, wherein the number of distributed virtual resource blocks (N _DVRB ) is given by Equation 3 when nulls are allowed to be input to the block interleaver. .

(Item 9)
6. The resource block mapping method according to Item 5, wherein the diversity order (N _DivOrder ) is an integer multiple of the number of physical resource blocks (N _D ) to which one virtual resource block is mapped.
(Item 10)
The method further comprises receiving a resource indication value (RIV) at a mobile terminal of the wireless mobile communication system;
10. The method of any one of items 1 to 9, wherein the resource indication value is used to determine the index of the virtual resource block and to signal the index number where the virtual resource block begins and the length of the virtual resource block. resource block mapping method.
(Item 11)
Resource block mapping according to any one of items 1 to 9, wherein the gap size is 0 if the number of virtual resource blocks is equal to or greater than a predetermined threshold value (M _th ). Method.
(Item 12)
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 dispersion.

Advantageous Effects of Invention According to the present invention, it is possible to efficiently combine FSS-based scheduling and FDS-based scheduling to easily implement a scheduling information transfer method.

The accompanying drawings, which are included as part of the detailed description to aid understanding of the invention, provide embodiments of the invention and, together with the detailed description, explain the technical ideas of the invention.
FIG. 2 is a diagram showing an example of a radio frame structure applicable to FDD; 1 is a diagram illustrating an example of a structure of a radio frame applicable to TDD; FIG. 1 is a diagram illustrating an example of a resource grid structure that constitutes a 3GPP transmission slot; FIG. FIG. 4a is a diagram showing an example of the structure of virtual resource blocks within one subframe. FIG. 4b is a diagram showing an example of a PRB structure within one subframe. FIG. 2 illustrates an example of how LVRBs are mapped to PRBs; FIG. 4 is a diagram showing an example of how a DVRB in the first slot is mapped to a PRB; FIG. 10 is a diagram showing an example of how a DVRB in the second slot is mapped to a PRB; FIG. 2 illustrates an example of how DVRBs are mapped to PRBs; FIG. 2 illustrates an example of how DVRBs and LVRBs are mapped to PRBs; FIG. 2 is a diagram illustrating an example of a method of allocating resource blocks according to a compact scheme; FIG. 2 is a diagram showing an example of how two DVRBs with consecutive indices are mapped to multiple adjacent PRBs; FIG. 2 is a diagram showing an example of how two DVRBs with consecutive indices are mapped to multiple separated PRBs; FIG. 4 is a diagram showing an example of how four DVRBs with consecutive indices are mapped to multiple separated PRBs; FIG. 4 is a diagram illustrating an example of a resource block mapping method when Gap=0 is set according to an embodiment of the present invention; FIG. 4 is a diagram for explaining a bitmap configuration; FIG. 4 is a diagram showing an example of a method of mapping by combining a bitmap method and a compact method; FIG. 3 illustrates a DVRB mapping method according to one embodiment of the present invention; FIG. 3 illustrates a DVRB mapping method according to one embodiment of the present invention; FIG. 3 is a diagram illustrating an example of a method for interleaving DVRB indices; FIG. 4 is a diagram illustrating operation of a general interleaver when the number of resource blocks used for interleaving is not an integer multiple of the diversity order; FIG. 4 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. 4 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. 4 is a diagram illustrating an example of a method of mapping DVRB indices using different Gap values for each UE 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 showing a general method of padding nulls in the interleaver. Figures 25c and 25 are diagrams illustrating a method of null padding an interleaver according to one embodiment of the present invention. FIG. 10 is a diagram showing an example of a method of using a combination of the bitmap method using the RBG method and the subset method and the compact method. FIG. 10 is a diagram showing an example of a method of using a combination of the bitmap method using the RBG method and the subset method and the compact method. According to an embodiment of the present invention, the number of DVRBs is obtained by multiplying the number of physical resource blocks (N _D ) to which one virtual resource block is mapped by 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 of FIG. 28; FIG. FIG. 4 is a diagram illustrating an example of setting the degree of a block interleaver to the number C of columns of the block interleaver, setting C to the diversity degree, and mapping according to an embodiment of the present invention; FIG. 4 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. 4 is a diagram illustrating an example of a mapping method capable of maximizing the number of DVRBs according to a given gap according to an embodiment of the present invention; FIG. 4 is a diagram illustrating an example of a mapping method capable of maximizing the number of DVRBs according to a given gap according to an embodiment of the present invention;

Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings. The detailed description, which is disclosed below in conjunction with the accompanying drawings, describes exemplary embodiments of the invention, and is not intended to represent the only embodiments in which the invention can be practiced. The following detailed description includes specific details to aid in 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, although the following description focuses on certain terms, it is not necessary to be limited to those terms, and the same meaning can be expressed by any term. In the entire specification, the same or similar components are denoted by the same reference numerals.

When the subframe is composed of the first slot and the second slot, as described above, index (PRB1 (i)) represents the index of the PRB of the i-th frequency band of the first slot, and index (PRB2 (j) ) represents the index of the PRB of the j-th frequency band of the second slot, and the relation of index(PRB1(k))=index(PRB2(k)) holds. Also, index(VRB1(i)) represents the VRB index of the i-th virtual frequency band of the first slot, and index(VRB2(j)) represents 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. Also, VRBs are classified into DVRBs and LVRBs.

The rule of mapping LVRB1 to PRB1 and the rule of mapping LVRB2 to PRB2 are the same. However, the rule that DVRB1 is mapped to PRB1 is different from the rule that DVRB2 is mapped to PRB2. That is, the DVRB is 'divided' and mapped to the PRB.

3GPP defines one RB in one slot unit. However, in the detailed description of the present invention, an RB is defined in units of one subframe, and the DVRB mapping rule is generalized by dividing this RB into ND sub- _RBs on the time axis. . For example, when N _D =2, the PRB defined in units of one subframe is divided into the first sub-PRB and the second sub-PRB, and the VRB defined in units of one subframe is divided into the first It is divided into a sub-VRB and a second sub-VRB.

In this case, the first sub-PRB corresponds to PRB1 described above, and the second sub-PRB corresponds to PRB2 described above. The first sub-VRB corresponds to VRB1 described above, and the second sub-VRB corresponds to VRB2 described above. Also, in both the detailed description of the present invention and 3GPP, the DVRB mapping rule for obtaining the frequency effect is described on the basis of one subframe. Therefore, it can be seen that the embodiments of the detailed description of the present invention are concepts including the RB mapping method in 3GPP.

Terms used in the detailed description of this application are defined below.
'RE (Resource Element)' represents the smallest frequency-time unit to which modulation symbols of data or other control channels 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. Generally, one PRB is composed of multiple REs that are continuous in the frequency-time domain, and multiple 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 one VRB is mapped to one PRB when data is actually transmitted, or One VRB can be mapped to a partial region of multiple PRBs.

'LVRB (Localized Virtual Resource Block)' is one 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.
'DVRB (Distributed Virtual Resource Block)' 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 how DVRBs and LVRBs are mapped to PRBs, where N _D =3 in FIG. After dividing any DVRB into three parts, each divided part can be mapped to a different PRB. At this time, a segmented part of another DVRB is mapped to the remaining part of each PRB where the corresponding DVRB is not mapped.

'N _PRB ' represents the number of PRBs in the system. When the system band is divided, it may be the number of PRBs 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} ' represents the maximum number of LVRBs allocated to one UE.

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

'N _subset ' represents the number of subsets.

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

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

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

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

Downlink data transmission from a base station to a specific terminal or uplink data transmission from a specific terminal to the base station is performed through one or more VRBs within one subframe. At this time, when transmitting data to a specific terminal, the base station must inform the terminal through which VRB among a plurality of VRBs the data will be transmitted. In addition, in order to enable a specific terminal to transmit data, the corresponding terminal is notified of which VRB the data can be transmitted through.

Methods for transmitting data are roughly classified into an FDS (Frequency Diversity Scheduling) method and an FSS (Frequency Selective Scheduling) method. An FDS (Frequency Diversity Scheduling) scheme is a scheme for obtaining reception performance gain through frequency diversity, and an FSS (Frequency Selective Scheduling) scheme is a scheme for obtaining 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 allows the symbols in one data packet to undergo various radio channel fading. The entire packet is prevented from undergoing adverse fading, resulting in improved reception performance. In contrast, the FSS scheme obtains improved reception performance by transmitting data packets over one or more consecutive frequency regions of the system frequency region that are favorably fading. In an actual cellular OFDM wireless packet communication system, there are multiple terminals in one cell. In this case, since the radio channel conditions of each terminal have different characteristics, FDS data transmission must be performed for some terminals and FSS data transmission must be performed for other terminals even within one subframe. must. Therefore, specific FDS transmission schemes and FSS transmission schemes should be designed so that both schemes can be efficiently multiplexed within one subframe. On the other hand, in the FSS scheme, gain can be obtained by selectively using a band that is advantageous to the UE in the entire band, but in the FDS scheme, sufficient diversity is obtained 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 spacing is maintained such that Therefore, when scheduling, priority is given to FSS frequency selective scheduling, which is advantageous in improving the performance of the entire system.

Since the FSS scheme transmits data using subcarriers that are contiguously adjacent in the frequency domain, it is preferable to transmit data using LVRB. In this case, if there are N _PRBs in one subframe and a maximum of N _LVRBs can be used in the system, the base station sends a bitmap of N _LVRB bits to each terminal. By transmitting the information, it is possible to inform the terminal through 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 bitmap information transmitted as scheduling information to each terminal indicates whether or not data is transmitted through the corresponding LVRB among the N _{LVRB LVRBs} . This scheme has the 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 contiguous RBs is allocated to the terminal, the information of the allocated RBs can be represented by the start point and the number of RBs. Such schemes are referred to as 'compact schemes' in this document.

FIG. 10 is a diagram illustrating an example of a method of allocating resource blocks according to a compact scheme.

In this case, as shown in FIG. 10, the length of RBs that can be used differs depending on each starting point, and the final number of combinations of RB allocation is N _LVRB (N _LVRB +1)/2. Therefore, the number of bits required for this is ceiling(log ₂ (N _LVRB (N _LVRB +1)/2)) bits. where ceiling(x) means the value rounded up to the nearest integer. This method has the advantage that the increase in the number of bits due to the increase in the number of _NLVRBs is relatively small compared to the bitmap method.

On the other hand, in the case of a method of notifying UE (User Equipment) of DVRB allocation, the position of each divided part of DVRB distributed and transmitted for diversity gain is promised in advance or the position is directly notified. Additional information is required. Here, preferably, if the number of bits for signaling for DVRB is set to be the same as the number of bits for LVRB transmission in the compact scheme described above, the signaling bit format in the downlink can be simplified, and as a result, the same channel coding can be used.

Here, when multiple DVRBs are allocated to one UE, the UE is provided with the DVRB index of the starting point of the DVRB, the length (=the number of DVRBs allocated), the relative Signal the position (eg, the gap between the splits).

FIG. 11 is a diagram illustrating an example of how two DVRBs with consecutive indices are mapped to multiple adjacent PRBs.

As shown in FIG. 11 , when mapping multiple DVRBs with consecutive indices to multiple 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 parts belonging to the upper division part and the lower division part are adjacent to each other, and the diversity order is two.

FIG. 12 is a diagram illustrating an example of how two DVRBs with consecutive indices are mapped to multiple separated PRBs.

In the method according to FIG. 12, when mapping DVRBs to PRBs, consecutive DVRB indices 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, the DVRB indices are arranged in the order 0, 8, 16, 4, 12, 20, . can be obtained. In this case, not only the dispersion due to the gap 1203 but also the dispersion within each dividing section 1201 and 1202 can be obtained. Therefore, as shown in FIG. 12, when two DVRBs are allocated to a UE, the diversity order is increased to 4, and there is an advantage that a greater diversity gain can be obtained.

At this time, the Gap value 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 indices. Second, the value of Gap can be represented by a difference value of indices between PRBs to which DVRBs are mapped. In FIG. 12, Gap=1 according to the first method and Gap=3 according to the second method. 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, using the second method has the advantage of being able to grasp the physical distance between the partitions.

FIG. 13 shows a case where one UE is allocated four DVRBs using the same rule as in FIG.

The diversity order increases to seven, as shown in FIG. However, the diversity gain converges as the diversity order increases. According to existing research results, the increase in gain is very small for orders of approximately 4 or more. Also, among the PRBs, PRBs 1301, 1302, 1303, 1304, and 1305, which have portions that remain without being mapped by DVRB, must be mapped with DVRBs assigned to other UEs. The disadvantage is that some of these PRBs 1301, 1302, 1303, 1304, 1305 can only be unused and left empty if there are no UEs. Also, by distributing the DVRBs, the continuity of the available PRBs is lost, which imposes restrictions on continuous LVRB allocation.

Therefore, there is a need for a method that can limit the diversity order to an appropriate level and perform distributed allocation.

Embodiments 1 and 2 of the present invention relate to a method of setting the relative distance between divisions of DVRBs mapped to PRBs to zero. In these embodiments, in a scheme in which consecutive indices of DVRBs are mapped to PRBs separated from each other, when multiple DVRBs are assigned to one UE, each partition of each DVRB is distributed to different PRBs. can be assigned to each other, thereby increasing the diversity order. Alternatively, under the same conditions, by assigning the divided parts of each DVRB to the same PRB instead of distributing them to different PRBs, the number of PRBs to which the DVRBs are distributed can be reduced, Diversity orders can be limited.

<Example 1>
This embodiment relates to a method of switching between distributed/non-distributed modes of the divider by setting a reference value for the number of DVRBs assigned to one UE. be. Here, 'distributed mode' indicates a mode in which the gap between DVRB partitions has a value other than 0, and 'non-distributed mode' indicates a mode in which the gap between DVRB partitions is 0.

When the number of DVRBs allocated to one UE is M, and the value of M is less than a specific reference value (=M _th ), the diversity order can be increased by distributing and allocating the divided parts of the DVRBs.

Conversely, when the M value is equal to or greater than the reference value (=M _th ), the divided parts are not distributed and allocated to the same PRB. By assigning to the same PRB in this way, the number of PRBs to which DVRBs are distributed and mapped can be reduced, thereby limiting the diversity order.

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

For example, if M _th =3 and the number of DVRBs is 2, the DVRB partitions can be distributed and mapped as shown in FIG. In contrast, when M _th =3, if the number of DVRBs is 4, setting Gap to 0 allows the DVRB partitions to be mapped 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 between distributed and non-distributed modes of the divider using a control signal. Here, 'distributed mode' indicates a mode in which the gap between DVRB partitions has a value other than 0, and 'non-distributed mode' indicates a mode in which the gap between DVRB partitions is 0.

Example 2 is a modification of Example 1. In Example 2, distributed/non-distributed modes are switched by transmitting and receiving control signals as needed without setting _Mth . Depending on the transmitted and received control signals, the DVRB partitions can be distributed to increase the diversity order, or the DVRB partitions can be mapped to the same PRB to lower the diversity order.

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

For example, when the control signal represents Gap=3, the DVRB dividers are distributed and mapped as shown in FIG. 12 or 13, and when the control signal represents Gap=0, the DVRB dividers are mapped as shown in FIG. to the PRBs of

As described above, in order to freely schedule the number of PRBs in the system (N _PRB ) on a PRB basis, it is necessary to transmit a bitmap of N _PRB bits to each UE to be scheduled. If the number of PRBs in the system (N _PRB ) is large, the control information overhead increases to transmit it. Therefore, it is possible to consider a method of reducing the scheduling unit or dividing the band and then transmitting the data by dividing the scheduling unit only in a part of the band.

In 3GPP LTE, a scheme for configuring bitmaps has been proposed in consideration of the overhead in transmitting bitmaps as described above.

An example of this bitmap configuration is shown in FIG.

First, a signal for resource allocation consists of a header 1501 and a bitmap 1502 . The header 1501 informs the structure of the transmitted bitmap 1502, ie, the bitmap scheme, by informing the signaling scheme.

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

In the RBG method, RBs are collectively grouped into a plurality of groups. RBs are mapped using one group as a basic unit. That is, a plurality of RBs forming one group have association with mapping. As the size of the group increases, finer resource allocation becomes more difficult, but the number of bits in the bitmap can be reduced. Referring to FIG. 15, since N _PRB =32, a bitmap of 32 bits in total is required to allocate resources in units of 1 RB. However, by grouping three RBs (P=3) and allocating resources in units of RBGs (RB Groups), a total of 11 groups of RBs can be obtained. Therefore, only an 11-bit bitmap is required, and the amount of control information can be greatly reduced. However, when allocating in units of such RBG groups, it is not possible to allocate in units of 1 RB, and detailed resource allocation becomes impossible.

A subset scheme can be used to complement this. In this scheme, a plurality of RBGs are configured in one subset, and resources are allocated in units of RBs within each subset. To use the 11-bit bitmap in the RBG scheme of FIG. 15 described above, '3' subsets (subset 1, subset 2, subset 3) can be configured. Here, '3' is the number of RBs forming each RBG described above. Then, NRB/P=ceiling(32/3)=11, and 11 bits can be used to allocate RBs in each subset in RB units. However, it must tell which scheme the bitmap uses, RBG scheme or subset scheme, and if it uses the subset scheme, which subset to use, so header information 1501 is required.

If the header information 1501 only indicates which of the RBG method and the subset method is to be used, and the type of subset is indicated using some bits of the bitmap used for RBG, then the entire subset It may not be possible to utilize all RBs in the For example, referring to FIG. 15, since a total of 3 subsets are set, a 2-bit subset indicator 1503 is required to distinguish the subsets. At this time, a total of 12 RBs are assigned to the subsets 11504 and 1505. If the 2 bits of the subset indicator are removed from the bitmap consisting of a total of 11 bits, only 9 bits remain. RB cannot be indicated individually. To solve this, a 1-bit shift indicator can be assigned in the RBG bitmap and used to shift the position of the RB indicated by the subset bitmap. For example, if the subset indicator 1503 indicates subset 1 and the shift indicator 1506 indicates 'shift 0', the remaining 8-bit bitmaps are RB0, RB1, RB2, RB9, RB10, RB11, RB18. , RB19 (see 1504). In contrast, when the subset indicator 1503 indicates subset 1 and the shift indicator 1506 indicates 'shift 1', the remaining 8-bit bitmaps are RB10, RB11, RB18, RB19, RB20, RB27. , RB28 and RB29 (see 1505).

In the above example, the subset indicator 1503 points to subset 1 (1504, 1505), but the subset indicator 1503 can point to subset 2 or subset 3 as well. Therefore, it can be seen that 8 RBs can be mapped in units of 1 RB for the combination of each subset indicator 1503 and each movement indicator 1506 . Also, referring to FIG. 15 , in this embodiment, the numbers of RBs allocated to subset 1, subset 2, and subset 3 are 12, 11, and 9, respectively. cannot be used, 3 RBs cannot be used for subset 2, and 1 RB cannot be used for subset 3 (the shaded area is reference). FIG. 15 is for illustration purposes and the present embodiment is not limited by this drawing.

It is possible to consider the case of using a combination of the bitmap method using the RBG method and the subset method and the compact method.

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

When mapping and transmitting DVRBs as shown in FIG. 16, some resource elements of RBG0, RBG1, RBG2, and RBG4 are filled with DVRBs. Of these, RBG0 is included in subset 1, RBG1 and RBG4 are included in subset 2, and RBG2 is included in subset 3. Here, RBG0, RBG1, RBG2 and RBG4 cannot be assigned to the UE by the RBG scheme. Among RBGs, remaining RBs (PRB0, PRB4, PRB8, and PRB12) allocated as DVRBs should be allocated to UEs in a subset manner. However, since UEs to which RBs are allocated by the subset method can only be allocated RBs in one subset, the remaining RBs belonging to other subsets must be allocated to different UEs. Therefore, DVRB scheduling will constrain LVRB scheduling.

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

Examples 3-5 relate to methods for setting the relative distances of the DVRB partitions mapped to the PRBs in order to reduce the impact on the LVRB.

<Example 3>
Embodiment 3 relates to a method of mapping to RBs belonging to one specific subset when mapping a segmented portion of DVRB, mapping to RBs belonging to another subset after mapping all to RBs of the specific subset. be.

According to this embodiment, when continuous DVRB indexing is mapped to distributed PRBs, it is mapped so as to be distributed within one subset, and if it cannot be mapped further within one subset, it is mapped in another subset. be able to. Interleaving of consecutive DVRBs is also performed within a subset.

17 and 18 are DVRB mapping methods according to one embodiment of the present invention.

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

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

<Example 4>
Example 4 relates to a method of restricting mapping of DVRB segmentation parts to PRBs included in the same subset.

In Example 4, the gap information can be used to map divided parts of the same DVRB into the same subset. At this time, a parameter for the entire PRB can be used like the 'Gap' described above. Alternatively, another parameter for one subset, namely 'Gap _subset ' can be used. This will be explained in detail below.

A method of distributing and filling consecutive DVRBs in one subset and a method of mapping the divided parts of DVRBs in the same subset can be used simultaneously. In this case, it is possible to use Gap _subset , which means the difference in the number of PRBs within the same subset, as the information representing the relative positional difference between the DVRB segments. 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, and 29. In this case, PRB 18 is separated from PRB 0 in subset 1 by 6 (Gap _subset =6) indices. On the other hand, PRB18 can be indicated as being separated from PRB0 by 18 (Gap=18) indexes when displaying the entire PRB.

<Example 5>
Example 5 relates to a method of setting the relative distance between DVRB partitions to a multiple of the square of the RBG size.

As in this embodiment, when Gap is set by limiting it to multiples of the size of RBG, the following characteristics are obtained. That is, when displaying the relative positional 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 the positional difference value for the entire PRB. In some cases, the relative distance between DVRB splits is limited to a multiple of the RBG magnitude squared (P ² ).

For example, referring to FIG. 15, it can be seen that P=3 and P ² =9. At this time, since Gap _subset =6 between the first DVRB division unit 1701 and the second DVRB division unit 1702, it is a multiple of P (=3) and Since the gap with the dividing unit 1702 is 18, it can be confirmed that it is a multiple of P ² (=9).

When using the scheme according to this embodiment, the RBGs for which only some resource elements are used have a high probability of belonging to the same subset, so the remaining unused resource elements or RBs will reside in the same subset. Therefore, subset-based allocation can be efficiently used.

Referring to FIG. 17, RBG10 has an RBG size of 2, which is different from other RBG sizes (=3). In this case, RBG 10 may not be available for DVRB for convenience of DVRB index configuration. 17 and 18, the number of RBGs belonging to subset 1 is four including RBG9, the number of RBGs belonging to subset 2 is three except for RBG10, and the number of RBGs belonging to subset 3. are three in total. In this case, RBG9 among the four RBGs belonging to subset 1 may not be used for the DVRB for convenience of DVRB index configuration.

In this case, first, as shown in FIG. 18, the DVRB index can be sequentially mapped to one subset area (eg, subset 1) used for DVRB among the subsets. When it can no longer be mapped to this one subset, it can be mapped to a region of the next subset (eg, subset 2).

Although the DVRB indexes are arranged continuously in FIG. 11 described above, it can be seen that the DVRB indexes are arranged discontinuously in FIGS. . In this way, the DVRB indices can be rearranged before being mapped to the PRB indices, and such changes can be made by the block interleaver. The structure of the block interleaver according to the present invention will now be described.

<Example 6>
Hereinafter, as an embodiment according to the present invention, a method of configuring an interleaver in which a desired interleaver degree is the same as a diversity order will be described.

Specifically, in the method of mapping consecutive indices of DVRBs to non-adjacent distributed PRBs, 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 to configure the interleaver such that The order of the interleaver can be defined as follows.

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

Conversely, in a block interleaver consisting of m rows and n columns, when data is recorded, one row is filled and then the next row is recorded, and when data is read, one row is recorded. You can take the method of filling one column and then proceeding to the next column. In this case, the interleaver can be called an interleaver of order n.

Specifically, first, N _DivOrder is limited to integer multiples of N _D . That is, it is restricted to N _DivOrder =K·N _D . where K is a positive integer. Also, a block interleaver with order N _DivOrder is used.

FIG. 19 is a diagram illustrating when 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 data is recorded in the interleaver, data indexes are sequentially increased and recorded. In this case, when one column is completely filled, the column index is incremented by 1. Record by filling in the next column. However, the data is recorded while increasing the row index in one column. Next, when reading from the interleaver, after reading from one row, the row index is incremented by 1 and the next row is read. However, reading is performed while increasing the column index within one row (Row). When using such a read/write scheme, 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, the DVRB index order of the data string output from the interleaver is used as the index order of the first division of the DVRB, and the data string is cyclically shifted by N _DVRB /N _D. ) can be used as the index order for the rest of the partitions. As a result, the ND partitions generated from the _DVRBs are pairwise mapped only to the ND _PRBs , and the difference between the pairwise DVRB indices is K.

For example, in FIG. 19, N _DVRB /N _D =N _DVRB (=24)/N _D (=2)=24/2=12 and K=3. The DVRB index order 1901 of the data stream 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 stream obtained by circularly shifting this data stream 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". Two DVRBs are paired. Referring to 1903 in FIG. 19, it can be seen that DVRB0 and DVRB3 form a pair. It can be seen that the division parts generated from DVRB0 and DVRB3 are combined and mapped to PRB0 and PRB12, respectively. The same is true for DVRBs with other indices.

This embodiment effectively manages the relationship between the DVRB and the PRBs to which the DVRB is mapped.

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

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

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

To circularly shift by _NDVRB /ND, _NDVRB must _{be an integer multiple of ND, and to fill the rectangular interleaver without gaps, NDVRB must be} an integer multiple of _NDivOrder . must. However, if K>1, the _NDVRB may be an integer multiple of _ND , but the _NDVRB may not be an integer multiple of _NDivOrder . In such a case, it is common to fill the block interleaver sequentially, fill the rest with nulls, and then read the data. , or read the data column by column when the data is filled by row. In this case, null values are read.

20a and 20b are general when 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 . FIG. 10 is a diagram showing the operation 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 pairs (see 2001, 2002, 2003) and the index difference values for each pair are 20-0=20,6 It can be seen that -3=3 and 12-9=3, and are not fixed at constant values. Therefore, DVRB scheduling is more complicated than if the pair index difference had a constant value.

On the other hand, if N _Remain is the remainder when N _DVRB is divided by N _DivOrder , the last column (Column) has the remaining elements excluding N _Remain values as shown in FIGS. 20a and 20b. padded with nulls. For example, referring to FIG. 20a, the remainder value when dividing N _DVRB (=22) by N _DivOrder (=6) is N _Remain (=4), so 2 elements can be null-padded. Here, I gave an example of padding nulls behind, but nulls can also be positioned before the initial value of the index. For example, N _Remain values are filled from the beginning. Note that nulls can also be present at any specified position.

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

In this embodiment, when null values are to be embedded in a rectangular block interleaver, N _DivOrder corresponding to the order of the interleaver is divided into _ND groups of size K, and nulls are distributed uniformly to all groups. Fill so that it is dispersed. For example, in FIG. 21a, the interleaver is divided into N _D (=2) groups (G2101, G2102). At this time, K=3. One null is recorded in group 1 (G2101) and one null is also recorded in group 2 (G2102), so nulls are recorded in a distributed manner.

For example, when writing while sequentially filling in values, _{N Remain} values remain at the end. are evenly distributed. For example, in FIG. 21a, N _Remain (=4) data spaces are left at the end. , one null can be placed in each group.

As a result, the difference between pairs of DVRB indices is kept below a value of K (eg, K=3), which has the advantage of more efficient DVRB allocation.

<Example 8>
Hereinafter, as an embodiment according to the present invention, a method of setting the relative distance between divisions of DVRBs mapped to PRBs to 0 will be described.

FIG. 22 is a diagram illustrating 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, in a method of mapping consecutive indices of DVRBs to PRBs distributed without being adjacent, if M DVRBs are allocated to one UE, a reference value M _th for M can be set. Diversity order can be increased by distributing and allocating the divided parts of each DVRB to different PRBs based on the reference value _Mth . Alternatively, by allocating the divided parts of each DVRB to the same PRB instead of distributing them to different PRBs, it is possible to reduce the number of PRBs to which the DVRBs are distributed and mapped and limit the diversity order.

For example, when the M value is less than a specific reference value (=M _th ), the division part of the DVRB is distributed to raise the diversity order, and when the M value is the reference value (=M _th ) or more, the division part is not distributed. DVRBs are allocated to the same PRBs to reduce the number of PRBs to which DVRBs are distributed and mapped, thereby limiting the diversity order.

That is, as shown in FIG. 22, the DVRB index of the data stream output from the interleaver is commonly applied to all DVRB division units and mapped to the PRB. For example, referring to FIG. 9, the DVRB index order of the data stream 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 this DVRB index is commonly applied to the first division part 2201 and the second division part 2202 of the DVRB. be done.

<Example 9>
Hereinafter, as an embodiment according to the present invention, a method of using both the sixth embodiment and the eighth embodiment described above will be described.

FIG. 23 shows a configuration in which UE 1 is scheduled in a manner in which the DVRB division units are mapped to different PRBs as in FIG. 19, and the DVRB division units are mapped to the same PRB as in FIG. 2 is a diagram showing a case in which UEs 2 scheduled according to the method are multiplexed at the same time. FIG. That is, it shows the case of scheduling together by the methods of the sixth embodiment and the eighth embodiment.

For example, referring to FIG. 23, UE1 is assigned DVRB0, DVRB1, DVRB2, DVRB3, and DVRB4 (2301), and UE2 is assigned DVRB6, DVRB7, DVRB8, DVRB9, DVRB10, and DVRB11 (2302). However, UE1 is scheduled in such a manner that the DVRB segments are mapped to different PRBs, and UE2 is scheduled in such a manner that the segmented portions are mapped to the same PRB. Therefore, the PRBs used for UE1 and UE2 are PRB0, PRB1, PRB4, PRB5, PRB8, PRB9, PRB12, PRB13, PRB16, PRB17, PRB20, PRB21 as can be seen from 2303 in FIG. However, it can be seen that PRB8 and PRB20 are only partially used.

When the DVRB partitions are mapped to distributed PRBs, the difference between the indices of the paired DVRBs is limited to K or less and does not affect DVRBs separated by a value of K or more. When mapped, it is possible to easily grasp which indexes cannot be used and which indexes can be used.

<Example 10>
A method for limiting the _NDVRB so that nulls do not occur will now be described as an embodiment according to the present invention.

Referring again to FIG. 20, it can be seen that the differential value of paired DVRB indices in the PRB may not be fixed at a constant value. The method of FIG. 21 described above can be used to make this difference value equal to or less than a certain value.

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

In the illustrated interleaver, the number of RBs used for DVRB (N _DVRB ) is restricted to be a multiple of the diversity order, ie, N _DivOrder , to prevent null padding in the rectangular interleaver matrix.

In the case of a block interleaver with a degree of D (Interleaver of degree D), if the number of RBs used for DVRB (N _DVRB ) is restricted to be a multiple of D, the rectangular matrix will be filled with nulls. do not have.

In the following, various embodiments using the interleaver according to the invention are described for the case K=2 and N _D =2. At this time, the relationship between the DVRB index and the PRB index can be represented by a mathematical formula.

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

Constants used in Equations 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 constants mentioned above.

K=2, N _D =2, and

But

is a multiple of , the relationship between the PRB index and the DVRB index can be obtained by Equations 1-3. First, the DVRB index when the PRB index p is given can be obtained by Equation 1 or Equation 2. Hereinafter, in this document, mod (x, y) means x mod y, and 'mod' means modulo operation. again,

means a truncation operation,

represents the largest integer that is less than or equal to the number in . again,

means round up operation,

Represents the smallest integer greater than or equal to the number in . Also, round(·) represents the nearest integer to the number in parentheses. Min(x, y) represents the non-larger value of x and y, and max(x, y) represents the non-smaller value of x and y.

vice versa,

But

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

FIG. 25b is a general way to fill the interleaver with nulls, where 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. 25b is substantially similar to the method according to FIG. In FIG. 25b, the DVRB index given the PRB index p can be obtained using Equation 4.

Conversely, the PRB index given the DVRB index d can be obtained by Equation 5.

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

But

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

Figure 25c corresponds to the method according to Example 7 and Figure 21 above. The method according to FIG. 25c can be explained using equations 6-8. In FIG. 25c, the DVRB index given the PRB index p can be obtained using Equation 6 or Equation 7.

Conversely, in FIG. 25c, the PRB index given the DVRB index d can be obtained using Equation 8.

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

, the method according to the seventh embodiment and FIG. 21 is applied. However, 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 obtained by Equation 9 or Equation 10.

Conversely, given the DVRB index d, the PRB index can be obtained from Equation 11

Referring again to the description of FIG. 15 above, it is possible to consider the case of using a combination of the bitmap method using the RBG method and the subset method and the compact method. Problems that may occur in this case will be described with reference to FIGS. 26 and 27. FIG.

26 and 27 are diagrams showing an example of a method of using a combination of the bitmap method using the RBG method and the subset method and the compact method.

As shown in FIG. 26, after dividing the DVRB into two partitions, the second partition can be cyclically shifted by Gap=N _DVRB /N _D =50/2. Then, only some of the resource elements of RBG0 of the PRB are mapped by the first division of the DVRB, and only some of the resource elements of RBG8 and RBG9 of the PRB are mapped by the second division of the DVRB. . Therefore, RBG0, RBG8, and RBG9 cannot be used in the RBG-based allocation scheme.

In order to solve the above problem, as shown in FIG. 27, a multiple of M _RBG , which is the number of RBs belonging to one RBG, can be set as the Gap value. That is, Gap=M _RBG *k (where k is a natural number) can be satisfied. With Gap set in this way, for example, Gap=M _RBG *k=3*9=27. If Gap=27, then after dividing the DVRB into two partitions, the second partition can be cyclically shifted by Gap=27. Then, only some of the resource elements of RBG0 of the PRB are mapped by the first division of the DVRB, and only some of the resource elements of RBG9 of the PRB are mapped by the second division of the DVRB. Therefore, unlike the method according to FIG. 26, the method according to FIG. 27 can be used as a method of allocating RBG8 in units of RBGs.

However, in the method according to FIG. 27, DVRB indices paired in one PRB cannot be paired with each other in another PRB. Referring again to FIG. 26, DVRB indices (1,26) (2601) paired in PRB1 are also paired in PRB26 (2603). However, in FIG. 27, DVRB indices (1,27) (2701) paired in PRB1 cannot be paired in PRB25 or PRB27 (2703, 2705).

26 and 27, DVRB1 and DVRB2 are mapped to PRB1, PRB2, PRB25 and PRB26. At this time, some resource elements of PRB1, PRB2, PRB25, and PRB26 remain unmapped.

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

However, in FIG. 27, DVRB25 and DVRB26 are mapped to PRB0, PRB25, PRB26 and PRB49, should DVRB25 and DVRB26 be further mapped to PRBs. Therefore, some unmapped resource elements of PRB1 and PRB2 are still not filled in the DVRB, and some resource elements of PRB1 and PRB26 remain unmapped. That is, FIG. 27 has the disadvantage that there are always PRBs left unmapped.

This problem arises because Gap was not _cyclically shifted to be _NDVRB /ND. Here, when N _DVRB /N _D is a multiple of M _RBG , the cyclic shift position is a multiple of M _RBG , so the above problem is solved.

<Example 13>
Therefore, to simultaneously solve the problems of FIGS. 26 and 27, one embodiment according to the present invention limits the number of RBs used for DVRB (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 and second partitions of the DVRB belong to different subsets. In order for two partitions of DVRB to belong to the same subset, Gap should be set to be a multiple of the square of M _RBG (M _RBG ² ).

Therefore, in another embodiment of the present invention, the number of RBs (N _DVRB ) to be multiples of N _D ·M _RBG ² .

FIG. 28 is an example in which _NDVRB is set to a multiple of ND· _{M RBG} .

As shown in FIG. 28 , Gap is a multiple of M _RBG ·N _D , so the cyclic shift allows DVRB divisions to always be paired within PRBs, and some of the resource elements are filled. It is possible to reduce the number of RBGs remaining without being processed.

<Example 15>
FIG. 29 is an example of interleaving the DVRB index in the method according to FIG.

If the DVRB indices are interleaved as shown in FIG. 29, the N _DVRBs can be set to multiples of the N _D ·M _RBGs when mapping to the PRBs. This may lead to cases where the rectangular interleaver matrix is not completely filled, as shown in FIG. 20, so the unfilled portion of the rectangular interleaver matrix must be filled with nulls. Cases can arise. To avoid having to fill with nulls, for a block interleaver of degree D, the number of RBs used for DVRB (N _DVRB ) is restricted to be a multiple of D. Must.

Therefore, in one embodiment of the present invention, the position of the gap is set to be a multiple of M _RBG , and the second division of the DVRB is cyclically shifted by N _RB /N _D to be mapped to one PRB. The number of RBs used for the DVRBs (N _DVRB ) is limited to a common multiple of the N _D ·M _RBGs and D in order to make the indices of the DVRBs paired with each other and prevent null padding in the block interleaver. be. In this case, if D is the diversity order used for the interleaver (N _DivOrder =K·N _D ), then N _DVRB is limited to a common multiple of N _D ·M _RBG and K·N _D .

<Example 16>
Also, in another embodiment of the present invention, Gap is set to a multiple of M _RBG squared in order to locate the two partitions of the DVRB in the same subset, and the second partition of the DVRB is set to N _RB /N _D The number of RBs (N _DVRB ) used for DVRBs to prevent nulls from being filled in the block interleaver by making the indices of DVRBs mapped to one PRB pair with each other by circularly shifting. is restricted to a common multiple of N _D ·M _RBG ² and D. In this case, if _D is the diversity order used for the interleaver (N _DivOrder =K·N _D ), N _DVRB is limited to a common multiple of ND·M _RBG ² and K·N _D .

<Example 17>
On the other hand, FIG. 30 illustrates a case where _D is set to the number of columns C, and C is set to N _DivOrder =K·ND.

However, in FIG. 30, one column is completely filled, then the next column is written, and after one row is completely read, the next row is read.

In the embodiment according to FIG. 30, the N _DVRBs are configured such that consecutive DVRB indices are assigned to the same subset. The illustrated rectangular interleaver is configured such that consecutive indices are padded to 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 for DVRB (N _DVRB ) is limited to multiples of D·M _RBG ² .

Furthermore, in order to map the two partitions of the DVRB to the PRBs of the same subset, the number of RBs used for the DVRB (N _DVRB ) can be limited to a common multiple of D·M _RBG ² and N _D ·M _RBG ² . can. In the case of _D =K·ND, the common multiple of K·ND· _{M RBG} ² and ND· _{M RBG} ² is K·ND· _{M RBG} ² , so _NDVRB is K·ND· _M Limited to ^multiples of _RBG2 .

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

<Example 18>
Hereinafter, as an embodiment according to the present invention,

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

Figure 31 shows

FIG. 29 exemplifies a method of finally corresponding to PRBs by reprocessing the results mapped to PRBs using the DVRB interleaver shown in FIG. 29 when the lengths of .

The method 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 interrelationship between the DVRB index and the PRB index is defined as the temporary PRB index. This time,

for p-values exceeding

is added to the final PRB index.

In this case, the four alignment schemes illustrated in (a), (b), (c), and (d) of FIG. 31 can be expressed as Equation 12.

Here, (a) represents full-end alignment, (b) left alignment, (c) right alignment, and (d) center alignment. On the other hand, when the PRB index o is given, the DVRB index d can be obtained from Equation 13 using the temporary PRB index p.

Also, when the DVRB index d is given, the PRB index o can be obtained from Equation 14 using the temporary PRB index p.

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

Describe a mapping method that can maximize

In the above embodiments, when the RBG scheme and/or the subset scheme are introduced for LVRB allocation, an interleaver structure for reducing the number of PRBs left without some resource elements mapped by the DVRB is presented. and to limit the number of RBs (N _DVRB ) used for DVRB. However, as the restriction condition based on the M _RBG value increases, the total number of PRBs increases.

Of these, restrictions on the number of RBs (N _DVRB ) used for DVRBs are increased.

Figure 32 shows

, M _RBG =3, K=2, and N _D =2.

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

is set to be a multiple of D·M _RBG ² (=18), in this case,

But

maximum

If you ask for

becomes. In such case, 32-18=14 RBs become unavailable for DVRB.

This time,

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

Therefore, in the present invention,

In the case of , the constraint on Gap is

As presented above, we propose a method to satisfy the Gap constraint by setting the offset and the threshold to which it is applied without directly reflecting the .

1) First, a desired Gap restriction condition is set. For example, Gap can be set to a ^multiple of _MRBG or a multiple of _MRBG2 .

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

the number that best approximates

and set.

3)

, then the mapping as illustrated in FIG. 20 is applied.

4)

Greater than or equal to and if the interleaver is null tolerant,

become. But if the interleaver is null tolerant,

become.

5)

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

set to

6) Set the offset so that the temporary PRB to which the offset is applied satisfies the Gap restriction condition.
i.e.

become.
This can be expressed as generalized Equation 15.

Figure 33 shows

, M _RBG =3, using a rectangular interleaver with K=2 and N _D =2, and applying the DVRB mapping rule proposed in the present invention.

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

satisfies a multiple of M _RBG ² (=9), and

to best approximate

If you set

become. In such a case, (32−18)×2=28 RBs are used for DVRB. i.e.

becomes,

become. Therefore, the index of the temporary PRB 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, it becomes as shown in FIG. Referring to FIG. 33, it can be confirmed that the two partitions of DVRB0 are mapped to the first RBs of RBG0 and RBG6 belonging to the same subset. Also, when compared with the method according to FIG. 32, it can be confirmed that the number of RBs that can be used for DVRB is increased from 18 to 28 under the same gap restriction condition. In addition, diversity in DVRB mapping can be further increased by increasing the distance of Gap.

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

Describe a mapping method that can maximize

If multiple DVRBs are assigned to one UE, consecutive DVRBs are assigned. Therefore, as described above, for LVRB scheduling, neighbor indices are preferably set at intervals of multiples of M _RBG or multiples of M _RBG ² , similar to when defining a gap. In this case, if the order of the interleaver is the number of columns, C, the number of ^rows , R, must be a multiple of M _RBG or a multiple of M _RBG2 . Therefore, the size of the interleaver is

teeth,

a multiple of or

must be a multiple of therefore,

is given in advance, the minimum interleaver size that satisfies such conditions can be obtained as follows.

The embodiments described above combine the elements and features of the present invention in a 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. Also, some components and/or features may be combined to form an embodiment of the present invention. The order of operations described in embodiments of the invention can be changed. Some features or features of one embodiment may be included in other embodiments or may replace corresponding features or features of other embodiments. It is obvious that claims that are not explicitly cited in the scope of claims can be combined to constitute an embodiment, or that claims can be included as new claims through amendment after the filing of the application.

Embodiments according to the present invention can be implemented by various means such as hardware, firmware, software, or combinations thereof. In the case of a hardware implementation, one embodiment of the invention includes one or more ASICs (Application Specific Integrated Circuits), DSPs (Digital Signal Processors), DSPDs (Digital Signal Processing Devices), PLDs (Programmable Devices), , FPGAs (Field Programmable Gate Arrays), processors, controllers, microcontrollers, microprocessors, and the like.

When implemented in firmware or software, an embodiment of the invention can be implemented in the form of modules, procedures, functions, etc. that perform the functions or operations described above. The software codes can be stored in memory units and executed by processors. This memory unit can be 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 may be embodied in other specific forms without departing from the spirit and essential characteristics of the invention. Therefore, the above detailed description should not be construed as restrictive in any respect, but 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 equivalence range of the invention are included in the scope of the invention.

Claims (18)

A method for transmitting downlink data using resource blocks at a base station in a wireless mobile communication system, comprising:
The method comprises:
transmitting downlink data mapped to physical resource blocks (PRBs) to a user equipment;
The consecutive indices of virtual resource blocks (VRBs) are interleaved when recorded row by row in a rectangular matrix and read out column by column so that the discontinuities of said PRBs for the first and second slots of a subframe are wherein the index of the PRB for the second slot is shifted relative to the index of the PRB for the first slot based on a predetermined gap;
applying a predetermined offset to the index of the PRB when the index of the PRB is greater than or equal to a predetermined threshold value;
the predetermined threshold value is N _VRB /2, where N _VRB is the number of consecutive indices of the VRB;
The method of claim 1, wherein the rectangular matrix comprises _C columns and ND regions, where _C is equal to K·ND and K is equal to 2 or 3. the predetermined offset is defined as N _gap -N _VRB /2;
2. The method of claim 1, wherein _Ngap is the predetermined gap value. _NVRB is

is defined as
3. The method of claim 2, wherein N _PRB is the number of PRBs. the successive indices of the VRBs are interleaved as the indices of the VRBs are recorded row by row and read out column by column in the rectangular matrix;
The number R of rows of the rectangular matrix is

is defined as
4. The method of claim 3, wherein C is the number of columns of the rectangular matrix and M _RBG is the number of consecutive PRBs forming a resource block group (RBG). 5. The method of claim 4, wherein C is equal to four. the rectangular matrix includes ND regions, _C equals K· _ND ;
When N _null nulls are inserted into the rectangular matrix, the nulls are inserted in the last N _null /N _D rows of the K th column in each of the N _D regions of the rectangular matrix. is inserted into the
the nulls are ignored when the indices of the VRBs are read from the rectangular matrix;

5. The method of claim 4, wherein The index P _1,d of one of the PRBs for the first slot mapped to the index d of one VRB of the VRBs is

is defined as
The index P2 _,d of one of the PRBs for the second slot mapped to the index d of one of the VRBs is

7. The method of claim 6, defined as: The index O _i,d of one of the PRBs for the i-th slot (i=1,2) mapped to the index d of one of the VRBs is

8. The method of claim 7 , defined as: A method for receiving downlink data using resource blocks in a user equipment in a wireless mobile communication system, comprising:
The method comprises:
receiving downlink control information including resource allocation information for the downlink data from a base station;
receiving the downlink data mapped to physical resource blocks (PRBs) based on the downlink control information;
the resource allocation information indicates a virtual resource block (VRB) allocation for the user equipment;
The index of the PRB to which the downlink data is mapped is determined based on the mapping relationship between the VRB and the PRB,
The mapping relationship is interleaved when consecutive indices of the VRBs are recorded row by row in a rectangular matrix and read out column by column, thereby yielding a difference of the PRBs for the first and second slots of a subframe. mapped to consecutive indices, defined such that the indices of the PRBs for the second slot are shifted with respect to the indices of the PRBs for the first slot based on a predetermined gap;
applying a predetermined offset to the index of the PRB when the index of the PRB is greater than or equal to a predetermined threshold value;
the predetermined threshold value is N _VRB /2, where N _VRB is the number of consecutive indices of the VRB;
The method of claim 1, wherein the rectangular matrix comprises _C columns and ND regions, where _C is equal to K·ND and K is equal to 2 or 3. the predetermined offset is defined as N _gap -N _VRB /2;
10. The method of claim 9 , wherein _Ngap is the predetermined gap value. consecutive indices of the VRBs are interleaved;
The number of consecutive indexes of the VRB, N _VRB , is

is defined as
11. The method of claim 10 , wherein N _gap is the predetermined gap value and N _PRB is the number of PRBs. the successive indices of the VRBs are interleaved as the indices of the VRBs are recorded row by row and read out column by column in the rectangular matrix;
The number R of rows of the rectangular matrix is

is defined as
12. The method of claim 11 , wherein C is the number of columns of the rectangular matrix and M _RBG is the number of consecutive PRBs forming a resource block group (RBG). 13. The method of claim 12 , wherein C is equal to four. the rectangular matrix includes ND regions, _C equals K· _ND ;
When N _null nulls are inserted into the rectangular matrix, the nulls are inserted in the last N _null /N _D rows of the K th column in each of the N _D regions of the rectangular matrix. is inserted into the
the nulls are ignored when the indices of the VRBs are read from the rectangular matrix;

13. The method of claim 12 , wherein The index P _1,d of one of the PRBs for the first slot mapped to the index d of one VRB of the VRBs is

is defined as
The index P2 _,d of one of the PRBs for the second slot mapped to the index d of one of the VRBs is

15. The method of claim 14 , defined as: The index O _i,d of one of the PRBs for the i-th slot (i=1,2) mapped to the index d of one of the VRBs is

16. The method of claim 15 , defined as: A base station that transmits downlink data using resource blocks in a wireless mobile communication system,
The base station
a processor for controlling operation of the base station;
a memory unit accessible by said processor;
The processor is configured to transmit downlink data mapped to physical resource blocks (PRBs) to a user equipment;
The consecutive indices of virtual resource blocks (VRBs) are interleaved when recorded row by row in a rectangular matrix and read out column by column so that the discontinuities of said PRBs for the first and second slots of a subframe are wherein the index of the PRB for the second slot is shifted with respect to the index of the PRB for the first slot based on a predetermined gap;
applying a predetermined offset to the index of the PRB when the index of the PRB is greater than or equal to a predetermined threshold value;
the predetermined threshold value is N _VRB /2, where N _VRB is the number of consecutive indices of the VRB;
The base station, wherein the rectangular matrix comprises _C columns and ND regions, where _C is equal to K·ND and K is equal to 2 or 3. A user equipment that receives downlink data using resource blocks in a wireless mobile communication system,
The user equipment is
a processor for controlling operation of the user equipment;
a memory unit accessible by said processor;
The processor
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 a virtual resource block (VRB) allocation for the user equipment;
The index of the PRB to which the downlink data is mapped is determined based on the mapping relationship between the VRB and the PRB,
The mapping relationship is interleaved when consecutive indices of the VRBs are recorded row by row in a rectangular matrix and read out column by column, thereby yielding a difference of the PRBs for the first and second slots of a subframe. mapped to consecutive indices, defined such that the indices of the PRBs for the second slot are shifted with respect to the indices of the PRBs for the first slot based on a predetermined gap;
applying a predetermined offset to the index of the PRB when the index of the PRB is greater than or equal to a predetermined threshold value;
the predetermined threshold value is N _VRB /2, where N _VRB is the number of consecutive indices of the VRB;
The user equipment, wherein said rectangular matrix comprises _C columns and ND regions, where _C is equal to K·ND and K is equal to 2 or 3.

Images