Method for scheduling distributed virtual resource blocks
14 claims: 8 independent, 6 dependent
- 1無線移動通信システム内の基地局においてリソースブロックを用いて下りリンクデータを送信する方法であって、 前記方法は、 物理リソースブロック(PRB)にマッピングされた下りリンクデータをユーザ機器に送信することを含み、 仮想リソースブロック(VRB)のインデックスは、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされ、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて行ごとに書き込まれ、列ごとに読み取られ、前記ブロックインターリーバーの列の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の列に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、方法。
- 2前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の列の最後のN null /N行に挿入され、ここでN null は前記ヌルの数に等しい、請求項1に記載の方法。
- 3Kが2である、請求項1に記載の方法。
- 4Nが2である、請求項1に記載の方法。
- 5無線移動通信システム内の基地局においてリソースブロックを用いて下りリンクデータを送信する方法であって、 前記方法は、 物理リソースブロック(PRB)にマッピングされた下りリンクデータをユーザ機器に送信することを含み、 仮想リソースブロック(VRB)のインデックスは、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされ、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて列ごとに書き込まれ、行ごとに読み取られ、前記ブロックインターリーバーの行の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の行に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、方法。
- 6前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の行の最後のN null /N列に挿入され、ここでN null は前記ヌルの数に等しい、請求項5に記載の方法。
- 7Kが2である、請求項5に記載の方法。
- 8Nが2である、請求項5に記載の方法。
- 9無線移動通信システム内でリソースブロックを用いて下りリンクデータを送信する基地局であって、 前記基地局は、 前記基地局の動作を制御するプロセッサと、 前記プロセッサによって駆動されるメモリユニットと を備え、前記プロセッサは、物理リソースブロック(PRB)にマッピングされた下りリンクデータをユーザ機器に送信するように構成され、 仮想リソースブロック(VRB)のインデックスは、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされ、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて行ごとに書き込まれ、列ごとに読み取られ、前記ブロックインターリーバーの列の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の列に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、基地局。
- 10無線移動通信システム内でリソースブロックを用いて下りリンクデータを送信する基地局であって、 前記基地局は、 前記基地局の動作を制御するプロセッサと、 前記プロセッサによって駆動されるメモリユニットと を備え、前記プロセッサは、物理リソースブロック(PRB)にマッピングされた下りリンクデータをユーザ機器に送信するように構成され、 仮想リソースブロック(VRB)のインデックスは、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされ、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて列ごとに書き込まれ、行ごとに読み取られ、前記ブロックインターリーバーの行の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の行に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、基地局。
- 11無線移動通信システム内のユーザ機器においてリソースブロックを用いて下りリンクデータを受信する方法であって、 前記方法は、 基地局から、前記下りリンクデータに対するリソース割り当て情報を含む下りリンク制御情報を受信することと、 前記下りリンク制御情報に基づいて、物理リソースブロック(PRB)にマッピングされた前記下りリンクデータを受信することと を含み、 前記リソース割り当て情報は、前記ユーザ機器に対する仮想リソースブロック(VRB)割り当てを示し、 前記下りリンクデータがマッピングされる前記PRBのインデックスは、仮想リソースブロック(VRB)と前記PRBとの間のマッピング関係に基づいて決定され、 前記マッピング関係は、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされた前記VRBのインデックスとして定義され、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて行ごとに書き込まれ、列ごとに読み取られ、前記ブロックインターリーバーの列の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の列に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、方法。
- 12無線移動通信システム内のユーザ機器においてリソースブロックを用いて下りリンクデータを受信する方法であって、 前記方法は、 基地局から、前記下りリンクデータに対するリソース割り当て情報を含む下りリンク制御情報を受信することと、 前記下りリンク制御情報に基づいて、物理リソースブロック(PRB)にマッピングされた前記下りリンクデータを受信することと を含み、 前記リソース割り当て情報は、前記ユーザ機器に対する仮想リソースブロック(VRB)割り当てを示し、 前記下りリンクデータがマッピングされる前記PRBのインデックスは、仮想リソースブロック(VRB)と前記PRBとの間のマッピング関係に基づいて決定され、 前記マッピング関係は、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされた前記VRBのインデックスとして定義され、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて列ごとに書き込まれ、行ごとに読み取られ、前記ブロックインターリーバーの行の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の行に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、方法。
- 13無線移動通信システム内でリソースブロックを用いて下りリンクデータを受信するユーザ機器であって、 前記ユーザ機器は、 前記ユーザ機器の動作を制御するプロセッサと、 前記プロセッサによって駆動されるメモリユニットと を備え、前記プロセッサは、 基地局から、前記下りリンクデータに対するリソース割り当て情報を含む下りリンク制御情報を受信することと、 前記下りリンク制御情報に基づいて、物理リソースブロック(PRB)にマッピングされた前記下りリンクデータを受信することと を行うように構成され、 前記リソース割り当て情報は、前記ユーザ機器に対する仮想リソースブロック(VRB)割り当てを示し、 前記下りリンクデータがマッピングされる前記PRBのインデックスは、仮想リソースブロック(VRB)と前記PRBとの間のマッピング関係に基づいて決定され、 前記マッピング関係は、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされた前記VRBのインデックスとして定義され、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて行ごとに書き込まれ、列ごとに読み取られ、前記ブロックインターリーバーの列の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の列に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、ユーザ機器。
- 14無線移動通信システム内でリソースブロックを用いて下りリンクデータを受信するユーザ機器であって、 前記ユーザ機器は、 前記ユーザ機器の動作を制御するプロセッサと、 前記プロセッサによって駆動されるメモリユニットと を備え、前記プロセッサは、 基地局から、前記下りリンクデータに対するリソース割り当て情報を含む下りリンク制御情報を受信することと、 前記下りリンク制御情報に基づいて、物理リソースブロック(PRB)にマッピングされた前記下りリンクデータを受信することと を行うように構成され、 前記リソース割り当て情報は、前記ユーザ機器に対する仮想リソースブロック(VRB)割り当てを示し、 前記下りリンクデータがマッピングされる前記PRBのインデックスは、仮想リソースブロック(VRB)と前記PRBとの間のマッピング関係に基づいて決定され、 前記マッピング関係は、サブフレームのN個のスロットのそれぞれに対する前記PRBのインデックスにマッピングされた前記VRBのインデックスとして定義され、「N」番目のスロットに対する前記PRBのインデックスは、所定のギャップに基づいて、「N-1」番目のスロットに対する前記PRBのインデックスに対してシフトされ、 前記VRBのインデックスは、ブロックインターリーバーによってインターリービングされ、 前記ブロックインターリーバーは、N個の領域を含み、前記VRBのインデックスは、前記ブロックインターリーバーにおいて列ごとに書き込まれ、行ごとに読み取られ、前記ブロックインターリーバーの行の数は、K・Nに等しく、ここで、KおよびNは0より大きい整数であり、 ヌルが前記ブロックインターリーバーに挿入される場合には、前記ヌルは、前記ブロックインターリーバーの前記N個の領域のそれぞれのK番目の行に挿入され、前記VRBのインデックスが前記ブロックインターリーバーから読み取られる場合には、前記ヌルが無視される、ユーザ機器。
Independent claims14
78 paragraphs, as filed
The present invention relates to a wideband radio mobile communication system, and more particularly to radio resource scheduling for transmission of up / downlink packet data in a cellular OFDM radio packet communication system.
In a cellular OFDM wireless packet communication system, uplink / downlink data packet transmission is performed in subframe units, and one subframe is defined in a fixed time interval including a plurality of OFDM symbols.
3GPP (Third Generation Partnership Project) supports Type 1 radio frame structures applicable to FDD (Frequency Division Duplex) and Type 2 radio frame structures applicable to TDD (Time Division Duplex). Figure 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. Figure 2 shows the structure of a Type 2 radio frame. Type 2 radio frames consist 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, regardless of the type of radio frame, one subframe is composed of two slots.
The signal transmitted in each slot is
<chemistry num="1"><img file="JP5048844B2_D0001.tif" /></chemistry>Subcarriers and
<chemistry num="2"><img file="JP5048844B2_D0002.tif" /></chemistry>It can be represented by a resource grid composed of the OFDM symbols of. here,
<chemistry num="3"><img file="JP5048844B2_D0003.tif" /></chemistry>Indicates the number of resource blocks (RBs) on the downlink.
<chemistry num="4"><img file="JP5048844B2_D0004.tif" /></chemistry>Indicates the number of subcarriers that make up one RB,
<chemistry num="5"><img file="JP5048844B2_D0005.tif" /></chemistry>Indicates the number of OFDM symbols in one downlink slot. This resource lattice structure is shown in Fig. 3.
RB is used to represent a mapping relationship between a physical channel and a resource element. RB can be classified into Physical Resource Block (PRB) and Virtual Resource Block (VRB). The mapping relationship between VRB and PRB can be expressed in units of one subframe. More specifically, it can be represented in units of slots constituting one subframe. Then, the mapping relationship between VRB and PRB can be expressed by using the mapping relationship between the index of VRB and the index of PRB. A specific description of this will be described later in the examples of the present invention.
PRB is in the time domain
<chemistry num="6"><img file="JP5048844B2_D0006.tif" /></chemistry>In the contiguous OFDM symbol and frequency domain of
<chemistry num="7"><img file="JP5048844B2_D0007.tif" /></chemistry>Defined by consecutive subcarriers of. Therefore, one PRB is
<chemistry num="8"><img file="JP5048844B2_D0008.tif" /></chemistry>Consists of the resource elements of. PRB starts from 0 in the frequency domain
<chemistry num="9"><img file="JP5048844B2_D0009.tif" /></chemistry>Numbers up to are assigned.
The VRB can have the same size as the PRB. Two types of VRB are defined, one of which is the Localized Type and the other of which is the Distributed Type. For each type of VRB, a pair of VRBs has a single VRB index (hereinafter also referred to as the VRB number) and is assigned over two slots in one subframe. In other words, it belongs to the first slot of the two slots that make up one subframe.
<chemistry num="10"><img file="JP5048844B2_D0010.tif" /></chemistry>From 0 to each VRB
<chemistry num="11"><img file="JP5048844B2_D0011.tif" /></chemistry>One of the indexes up to is assigned, and it belongs to the second slot of the two slots.
<chemistry num="12"><img file="JP5048844B2_D0012.tif" /></chemistry>Similarly for VRB from 0
<chemistry num="13"><img file="JP5048844B2_D0013.tif" /></chemistry>One of the indexes is assigned.
The index of the VRB corresponding to the specific virtual frequency band of the first slot has the same value as the index of the VRB corresponding to the specific virtual frequency band of the second slot. That is, the VRB corresponding to the i-th virtual frequency band of the first slot is referred to as VRB1 (i), the VRB corresponding to the j-th virtual frequency band of the second slot is referred to as VRB2 (j), and VRB1 ( If the index numbers of i) and VRB2 (j) are expressed as index (VRB1 (i)) and index (VRB2 (j)), respectively, the relationship of index (VRB1 (k)) = index (VRB2 (k)) It holds (see Figure 4a).
Similarly, the index of the PRB corresponding to the specific frequency band of the first slot has the same value as the index of the PRB corresponding to the specific frequency band of the second slot. That is, the PRB corresponding to the i-th frequency band of the first slot is referred to as PRB1 (i), the PRB corresponding to the j-th frequency band of the second slot is referred to as PRB2 (j), and PRB1 (j). If the index numbers of and PRB2 (j) are expressed as index (PRB1 (i)) and index (PRB2 (j)), respectively, the relationship of index (PRB1 (k)) = index (PRB2 (k)) is established ( See Figure 4b).
Of the plurality of VRBs described above, some can be assigned as local types and some can be assigned as distributed types. Hereinafter, the VRB assigned as the local type will be referred to as a local type VRB (Localized Virtual Resource Block; LVRB), and the VRB assigned as a distributed type will be referred to as a distributed VRB (Distributed Virtual Resource Block; DVRB).
The LVRB (Localized VRB, Localized VRB) is mapped directly to the PRB, and the LVRB index corresponds to the PRB index. The LVRB of the index i corresponds to the PRB of the index i. That is, LVRB1 having an index i corresponds to PRB1 having an index i, and LVRB2 having an index i corresponds to PRB2 having an index i (see FIG. 5). In this case, it is assumed that all VRBs in FIG. 5 are assigned as LVRBs.
DVRB (Distributed VRB) does not have to be mapped directly to PRB. That is, the DVRB index can also be mapped to the PRB after going through a series of processes.
First, the order of consecutive index columns in DVRB can be changed by the Block Interleaver. Here, the continuous index column means that the index number starts from 0 and gradually increases while increasing by 1. The index columns output from the interleaver are sequentially mapped to the consecutive index columns of PRB1 (see Fig. 6). It is assumed that all VRBs in FIG. 6 are assigned as DVRBs. Subsequently, the index columns output from the interleaver are cyclically shifted by a predetermined number, and the cyclically shifted index columns are sequentially mapped to consecutive index columns of PRB2 (Fig.). 7). It is assumed that all VRBs in FIG. 7 are assigned as DVRBs. In this way, the PRB index and DVRB index can be mapped across the two slots.
In this process, DVRB contiguous index columns that do not go through the interleaver can also be sequentially mapped to PRB1 contiguous index columns. Further, the continuous index columns of the DVRB that do not pass through the interleaver can be cyclically shifted by a predetermined number, and the cyclically shifted index columns can be sequentially mapped to the continuous index columns of the PRB2.
According to the above process of mapping DVRB to PRB, PRB1 (i) and PRB2 (i) with the same index i are mapped to DVRB1 (m) and DVRB2 (n) with different indexes 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) having different indexes, respectively. The frequency diversity effect can be obtained by the DVRB mapping method.
As shown in FIG. 8, when VRB (1) is assigned as DVRB among VRBs, VRB is still assigned to PRB2 (6) and PRB1 (9) when the method according to FIGS. 6 and 7 is used. LVRB cannot be assigned to PRB2 (6) and PRB1 (9). Because, according to the above-mentioned LVRB mapping method, the fact that LVRB is mapped to PRB2 (6) and PRB1 (9) means that LVRB is 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) described above. Therefore, it can be understood that the mapping of LVRB can be restricted by the mapping result of DVRB. Therefore, it is necessary to determine the DVRB mapping rule in consideration of the LVRB mapping.
In a wideband wireless mobile communication system using multiple carriers, wireless resources can be allocated to each terminal by the LVRB and / or DVRB method. This allocation information can be transmitted in the form of a bitmap. At this time, the radio resource can be allocated to each terminal in units of one RB. In this case, resources can be allocated with the granularity of '1' RB, but a large amount of bit overhead is required to transmit the allocation information in the form of a bitmap. Unlike this, it is possible to define an RBG (RB Group) consisting of PRBs with k consecutive indexes and allocate resources with a granularity of '1' RBG of 1 RBG. In this case, the RB Allocation cannot be done finely, but it has the advantage of reducing bit overhead. At this time, for example, k = 3 can be set.
In this case, LVRB can be mapped to PRB in RBG units. For example, a PRB with three consecutive indexes, namely PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1), PRB2 (i + 2). ) Can configure one RBG, and LVRB can be mapped to this RBG in RBG units. However, one or more of PRB1 (i), PRB1 (i + 1), PRB1 (i + 2), PRB2 (i), PRB2 (i + 1), PRB2 (i + 2) are preliminarily used by DVRB. If mapped, this RBG cannot be mapped to LVRB on a RBG basis. That is, DVRB mapping rules may limit the mapping of LVRBs in RBG units.
As mentioned above, the DVRB mapping rule affects the LVRB mapping, so it is necessary to establish a DVRB mapping rule that takes into account the LVRB mapping.
<p> An object of the present invention is to provide a resource scheduling method for effectively combining FSS method scheduling and FDS method scheduling.</p>
<p> In order to achieve the above object, in the uniform phase of the present invention, one RBG consisting of continuous physical resource blocks is continuously allocated in a wireless mobile communication system that supports a resource allocation method represented by one bit. The resource block mapping method for distributing and mapping the virtual resource blocks to the physical resource blocks is determined from the index number at which the virtual resource block starts and the resource indicator value (RIV) representing the length of the virtual resource block. The step of interleaving the index of the virtual resource block using the block interleaver and the interleaved index on the first slot of one subframe composed of the first slot and the second slot are described above. The index of the physical resource block is sequentially mapped to the index of the physical resource block, and the index obtained by cyclically shifting the interleaved index by the size of the gap (Gap) for the distribution on the second slot is the index of the physical resource block. The size of the gap (Gap), including the step of sequentially mapping to, is the number of consecutive physical resource blocks (M) that make up the RBG.<sub>RBG</sub>) Is a multiple of the square.</p><p> Preferably, when the Degree of the block interleaver is defined as the number of columns of the block interleaver C = 4, the number R of the rows of the block interleaver is given by Equation 1. The number of nulls given and filled in the block interleaver N<sub>null</sub>Is given by Equation 2.</p><p><maths num="1"><img file="JP5048844B2_D0014.tif" /></maths> However, M<sub>RBG</sub>Represents the number of consecutive physical resource blocks that make up the above RBG, and N<sub>DVRB</sub>Represents the number of virtual resource blocks allocated in a distributed manner.</p><p><maths num="2"><img file="JP5048844B2_D0015.tif" /></maths> However, M<sub>RBG</sub>Represents the number of consecutive physical resource blocks that make up the above RBG, and N<sub>DVRB</sub>Represents the number of virtual resource blocks allocated in a distributed manner.</p><p> Preferably, the Degree of the block interleaver is the Diversity Order (N) determined by the variance.<sub>DivOrder</sub>) Is the same.</p><p> Preferably, given the index d of the distributedly allocated virtual resource block, the index p of the physical resource block on the first slot mapped to the d.<sub>1, d</sub>Is given by Equation 3 and is the index p of the physical resource block on the second slot mapped to d above.<sub>2, d</sub>Is given by Equation 4. However, R represents the number of rows of the block interleaver, C represents the number of columns of the block interleaver, and N represents the number of columns.<sub>DVRB</sub>Represents the number of RBs used for DVRB, which is the number of RBs used for DVRB.<sub>null</sub>Is the number of nulls to be filled in the block interleaver, and mod is a modulo operation.</p><p><maths num="3"><img file="JP5048844B2_D0016.tif" /></maths></p><p><maths num="4"><img file="JP5048844B2_D0017.tif" /></maths> Here, the C can be the same as the Degree of the block interleaver.</p><p> Above p<sub>1, d</sub>Is N<sub>DVRB</sub>If greater than / 2, p<sub>1, d</sub>The value of is p<sub>1, d</sub>+ N<sub>PRB</sub>-N<sub>DVRB</sub>And the above p<sub>2, d</sub>Is N<sub>DVRB</sub>If greater than / 2, p<sub>2, d</sub>The value of is p<sub>2, d</sub>+ N<sub>PRB</sub>-N<sub>DVRB</sub>Will be. Where N<sub>PRB</sub>Represents the number of physical resource blocks in the system.</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is not an integral multiple of the Degree of block interleaver, the step of performing the interleaving is to use the interleaver as the number of physical resource blocks (N) to which one virtual resource block is mapped.<sub>D</sub>) Is divided into groups, and nulls are evenly distributed in each of the divided groups.</p><p> Preferably, when the order of the block interleaver is the number of rows of the block interleaver, each of the above groups corresponds to each of the above rows, and the order of the block interleaver is the block interleaver. In the case of the number of columns of rivers, each of the above groups corresponds to each of the above columns.</p><p> In another aspect of the present invention, in a wireless mobile communication system that supports a resource allocation method in which one RBG consisting of consecutive physical resource blocks is represented by one bit, the continuously allocated virtual resource blocks are used as physical resources. The resource block mapping method of distributing and mapping to blocks is interleaving for the index of the virtual resource block determined from the index number at which the virtual resource block starts and the resource indicator value (RIV) representing the length of the virtual resource block. In the step of using the block interleaver, and on the first slot of one subframe composed of the first slot and the second slot, the interleaved index is sequentially added to the index of the physical resource block. In the stage of mapping, the interleaved index is cyclically shifted by the size of the gap (Gap) for the distribution on the second slot, and the index is sequentially mapped to the index of the physical resource block. , Including, the size of the gap (Gap) for the above dispersion N<sub>gap</sub>Is given by Equation 5.</p><p><maths num="5"><img file="JP5048844B2_D0018.tif" /></maths> However, M<sub>RBG</sub>Represents the number of consecutive physical resource blocks that make up the above RBG, and N<sub>PRB</sub>Represents the number of physical resource blocks in the system.</p><p> Preferably, the number of distributed virtual resource blocks (N) is distributed when nulls are allowed to be entered in the block interleaver.<sub>DVRB</sub>) Is given by Equation 6.</p><p><maths num="6"><img file="JP5048844B2_D0019.tif" /></maths></p><p> Preferably, given the index d of the distributedly allocated virtual resource block, the index p of the physical resource block on the first slot mapped to the d.<sub>1, d</sub>Is N<sub>DVRB</sub>If greater than / 2, p<sub>1, d</sub>The value of is p<sub>1, d</sub>+ N<sub>PRB</sub>-N<sub>DVRB</sub>And the index p of the physical resource block on the second slot mapped to d<sub>2, d</sub>Is N<sub>DVRB</sub>If greater than / 2, p<sub>2, d</sub>The value of is p<sub>1, d</sub>+ N<sub>PRB</sub>-N<sub>DVRB</sub>And here, N<sub>DVRB</sub>Represents the number of RBs used for DVRB.</p><p> In another aspect of the present invention, in a wireless mobile communication system that supports a resource allocation method in which one RBG consisting of consecutive physical resource blocks is represented by one bit, the continuously allocated virtual resource blocks are used as physical resources. The resource block mapping method that distributes and maps to blocks detects the index number at which the virtual resource block starts and the resource instruction value (RIV) indicating the length of the virtual resource block, and uses the detected resource instruction value as described above. The stage of determining the index of the virtual resource block and the mapping stage of performing interleaving for the index of the determined virtual resource block using the block interleaver and distributing and mapping the virtual resource block to the physical resource block. , And the order of the block interleaver (Degree) is the diversity order (Diversity Order, N) determined by the variance.<sub>DivOrder</sub>) Is the same.</p><p> In another aspect of the present invention, in a wireless mobile communication system that supports a resource allocation method in which one RBG consisting of consecutive physical resource blocks is represented by one bit, the continuously allocated virtual resource blocks are used as physical resources. The resource block mapping method for distributing and mapping to blocks includes the stage of determining the index of the virtual resource block from the index number at which the virtual resource block starts and the resource indicator value (RIV) representing the length of the virtual resource block. The number of the virtual resource blocks including a mapping step in which the index of the virtual resource block determined above is interleaved using the block interleaver and the virtual resource block is distributed and mapped to the physical resource blocks. N<sub>DVRB</sub>If) is not an integral multiple of the Degree of block interleaver, the mapping step maps the interleaver to the number of physical resource blocks (N) to which one virtual resource block is mapped.<sub>D</sub>) Is divided into groups, and nulls are evenly distributed in each of the divided groups.</p><p> Preferably, when the order of the block interleaver is the number of rows of the block interleaver, each of the above groups corresponds to each of the above rows, and the order of the block interleaver is the block interleaver. In the case of the number of columns of rivers, each of the above groups corresponds to each of the above columns.</p><p> Preferably, the control information is a DCI transmitted through the PDCCH.</p><p> Preferably, the size of the gap is a function of system bandwidth.</p><p> Preferably, given the index p of the physical resource block, the interleaved index d that maps to the p.<sub>p1</sub>Is given in Equation 7 or 8 and is mapped to p above in the circularly shifted index d<sub>p2</sub>Is given by Equation 9 or Equation 10. However, R represents the number of rows of the block interleaver, C represents the number of columns of the block interleaver, and N represents the number of columns.<sub>DVRB</sub>Represents the number of resource blocks used for the distributed virtual resource blocks, and mod means modulo arithmetic.</p><p><maths num="7"><img file="JP5048844B2_D0020.tif" /></maths></p><p><maths num="8"><img file="JP5048844B2_D0021.tif" /></maths></p><p><maths num="9"><img file="JP5048844B2_D0022.tif" /></maths></p><p><maths num="10"><img file="JP5048844B2_D0023.tif" /></maths></p><p> Preferably, the diversity order (N)<sub>DivOrder</sub>) Is the number of physical resource blocks to which one virtual resource block is mapped (N)<sub>D</sub>) Is an integral multiple.</p><p> Preferably, the number of the virtual resource blocks is a predetermined critical value (M).<sub>th</sub>) Or more, the size of the gap is 0.</p><p> Preferably, the resource block mapping method further includes the step of receiving information about the size of the gap, and the size of the gap is determined by the information about the size of the received gap.</p><p> In another aspect of the present invention, in a wireless mobile communication system that supports the RBG resource allocation method and the subset resource allocation method, a resource block mapping method in which continuously allocated virtual resource blocks are distributed and mapped to physical resource blocks is used. , The reception stage for receiving the control information including the resource block allocation information indicating that the virtual resource block is distributed and the index of the virtual resource block, and the index of the virtual resource block using the block interleaver. At the stage of interleaving, the interleaving completes the operation in which the indexes of the virtual resource blocks are all mapped to the indexes of the physical resource blocks belonging to any one subset of the plurality of RBG subsets. The above includes an interleaving execution stage in which the index of the virtual resource block is not mapped to the index of the physical resource block belonging to another subset.</p><p> Preferably, the resource block mapping method sequentially maps the interleaved index to the index of the physical resource block on the first slot of one subframe composed of the first slot and the second slot. Then, on the second slot, the index obtained by cyclically shifting the interleaved index by the size of the gap (Gap) is sequentially mapped to the index of the physical resource block, and the distribution is further included. The size of the gap (Gap) for is determined so that the virtual resource block mapped on the first slot and the virtual resource block mapped on the second slot are included in the same subset. ..</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the diversity order (N) determined by the above variance.<sub>DivOrder</sub>) Is an integral multiple.</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the number of consecutive physical resource blocks (M) that make up the above RBG.<sub>RBG</sub>) Is an integral multiple.</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the number of consecutive physical resource blocks (M) that make up the above RBG.<sub>RBG</sub>) Is the number of physical resource blocks (N) to which one virtual resource block is mapped.<sub>D</sub>) Is an integral multiple of the value multiplied by).</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the square of the number of consecutive physical resource blocks that make up the above RBG (M)<sub>RBG</sub><sup>2</sup>) Is the number of physical resource blocks (N) to which one virtual resource block is mapped.<sub>D</sub>) Is an integral multiple of the value multiplied by).</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the number of consecutive physical resource blocks (M) that make up the above RBG.<sub>RBG</sub>The number of physical resource blocks (N) to which one virtual resource block is mapped to)<sub>D</sub>) Is a common multiple of the degree (D) of the block interleaver.</p><p> Preferably, the degree (D) of the block interleaver is the number of physical resource blocks to which one virtual resource block is mapped (N).<sub>D</sub>) Is an integral multiple.</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the number of physical resource blocks to which one virtual resource block is mapped (N)<sub>D</sub>) Is the square of the number of consecutive physical resource blocks that make up the above RBG (M)<sub>RBG</sub><sup>2</sup>) Is a common multiple of the degree (D) of the block interleaver.</p><p> Preferably, the degree (D) of the block interleaver is the number of physical resource blocks to which one virtual resource block is mapped (N).<sub>D</sub>) Is an integral multiple.</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the square (M) of the number of consecutive physical resource blocks constituting the RBG to the order (D) of the block interleaver.<sub>RBG</sub><sup>2</sup>) Is an integral multiple of the value multiplied by).</p><p> Preferably, the number of the above virtual resource blocks (N)<sub>DVRB</sub>) Is the square (M) of the number of consecutive physical resource blocks constituting the RBG to the order (D) of the block interleaver.<sub>RBG</sub><sup>2</sup>The value multiplied by) and the number of physical resource blocks (N) to which one virtual resource block is mapped<sub>D</sub>) Is the square of the number of consecutive physical resource blocks that make up the above RBG (M)<sub>RBG</sub><sup>2</sup>) Is a common multiple of the value multiplied by).</p><p> Preferably, the degree (D) of the block interleaver is the number of physical resource blocks to which one virtual resource block is mapped (N).<sub>D</sub>) Is an integral multiple.</p><p> All 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 is performed from the mobile station of the wireless mobile communication system before the interleaving step or the index determination step of the virtual resource block. It can further include the step of receiving a resource indication (RIV).</p>
<p> According to the present invention, the scheduling information transmission method can be easily realized by effectively combining the FSS method scheduling and the FDS method scheduling.</p>
The accompanying drawings included as part of a detailed description to aid an understanding of the invention provide examples of the invention and will explain the technical ideas of the invention along with the detailed description.
<figref num="1">It is a figure which shows an example of the wireless frame structure applicable to FDD.</figref><figref num="2">It is a figure which shows an example of the structure of the radio frame applicable to TDD.</figref><figref num="3">It is a figure which shows an example of the resource grid structure (Resource Grid structure) which constitutes 3GPP transmission slot (transmission slot).</figref><figref num="4">FIG. 4a is a diagram showing an example of the structure of a virtual resource block in one subframe. FIG. 4b is a diagram showing an example of the structure of PRB in one subframe.</figref><figref num="5">It is a figure which shows an example of the method in which LVRB is mapped to PRB.</figref><figref num="6">It is a figure which shows an example of the method in which the DVRB in the first slot is mapped to the PRB.</figref><figref num="7">It is a figure which shows an example of the method in which the DVRB in the second slot is mapped to PRB.</figref><figref num="8">It is a figure which shows an example of the method in which DVRB is mapped to PRB.</figref><figref num="9">It is a figure which shows an example of the method in which DVRB and LVRB are mapped to PRB.</figref><figref num="10">It is a figure which shows an example of the method of allocating a resource block by a compact method.</figref><figref num="11">It is a figure which shows an example of the method in which two DVRBs having a continuous index are mapped to a plurality of adjacent PRBs.</figref><figref num="12">It is a figure which shows an example of the method in which two DVRBs having a contiguous index are mapped to a plurality of distant PRBs.</figref><figref num="13">It is a figure which shows an example of the method in which four DVRBs having a contiguous index are mapped to a plurality of distant PRBs.</figref><figref num="14">It is a figure which shows an example of the resource block mapping method at the time of setting Gap = 0 according to one Example of this invention.</figref><figref num="15">It is a figure explaining a bitmap structure.</figref><figref num="16">It is a figure which shows an example of the method of mapping by combining the bitmap method and the compact method.</figref><figref num="17">It is a figure which shows the DVRB mapping method by one Example of this invention.</figref><figref num="18">It is a figure which shows the DVRB mapping method by one Example of this invention.</figref><figref num="19">It is a figure which shows an example of the method of interleaving the index of DVRB.</figref><figref num="20">20a and 20b are diagrams showing general interleaver operation when the number of resource blocks used for interleaving is not an integral multiple of the diversity order.</figref><figref num="21">21a and 21b are diagrams showing a method of inserting a null when the number of resource blocks used for interleaving is not an integral multiple of the diversity order according to an embodiment of the present invention.</figref><figref num="22">It is a figure which shows the method of mapping the index of the interleaving DVRB by the value of Gap = 0 by one Example of this invention.</figref><figref num="23">It is a figure which shows an example of the method of mapping the index of DVRB using the Gap value which differs for each terminal by one Example of this invention.</figref><figref num="24">It is a figure for demonstrating the relationship between a DVRB index and a PRB index.</figref><figref num="25">FIG. 25a is a diagram for explaining the relationship between the DVRB index and the PRB index. Figure 25b shows a common method of filling nulls in interleavers. 25c and 25d are diagrams showing a method of filling nulls in the interleaver according to an embodiment of the present invention.</figref><figref num="26">It is a figure which shows an example of the method which uses the bitmap method and the compact method which use the RBG method and the subset method in combination.</figref><figref num="27">It is a figure which shows an example of the method which uses the bitmap method and the compact method which use the RBG method and the subset method in combination.</figref><figref num="28">According to one embodiment of the present invention, the number of DVRBs is set to the number of physical resource blocks to which one virtual resource block is mapped (N).<sub>D</sub>), The number of consecutive physical resource blocks that make up the RBG (M)<sub>RBG</sub>This is an example when it is set as a multiple of the value multiplied by).</figref><figref num="29">This is an example of interleaving the DVRB index in the method according to FIG. 28.</figref><figref num="30">According to an embodiment of the present invention, the degree of the block interleaver is set to the number C of the columns of the block interleaver, and C is set to the diversity order for mapping.</figref><figref num="31">It is a figure which shows an example of the mapping method when the number of PRBs and the number of DVRBs are different by one Example of this invention.</figref><figref num="32">It is a figure which shows an example of the mapping method which can increase the number of DVRBs to the maximum by the given Gap by one Example of this invention.</figref><figref num="33">It is a figure which shows an example of the mapping method which can increase the number of DVRBs to the maximum by the given Gap by one Example of this invention.</figref>
Hereinafter, preferred embodiments according to the present invention will be described in detail with reference to the accompanying drawings. The detailed description disclosed below, along with the accompanying drawings, is intended to illustrate exemplary embodiments of the invention, not to show only embodiments of the invention. The following detailed description includes specific details to aid in a complete understanding of the present invention. However, those skilled in the art can understand that the present invention can be implemented 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 even when they are referred to as arbitrary terms. In the entire specification, the same or similar components will be described with the same drawing 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 PRB in the i-th frequency band of the first slot, and index (PRB2 (j)). ) Represents the index of PRB in the jth frequency band of the second slot, and the relationship of index (PRB1 (k)) = index (PRB2 (k)) is established. In addition, index (VRB1 (i)) represents the index of VRB in the i-th virtual frequency band of the first slot, and index (VRB2 (j)) represents the index of VRB in 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. In addition, VRB is classified into DVRB and LVRB.
The rule that LVRB1 maps to PRB1 and the rule that LVRB2 maps to PRB2 are the same. However, the rule that DVRB1 maps to PRB1 and the rule that DVRB2 maps to PRB2 are different. That is, the DVRB is'divided'and mapped to the PRB.
In 3GPP, one RB is defined for each slot. However, in the detailed description of the present invention, RB is defined in units of one subframe, and this RB is defined as N on the time axis.<sub>D</sub>The DVRB mapping rules are generalized and described by dividing them into sub-RBs. For example, N<sub>D</sub>When = 2, the PRB defined in one subframe unit is divided into the first subPRB and the second subPRB, and the VRB defined in one subframe unit is the first subVRB and the first subVRB. Divided into 2 subVRBs.
In this case, the first sub PRB corresponds to the above-mentioned PRB1 and the second sub-PRB corresponds to the above-mentioned PRB2. The first sub VRB corresponds to the above-mentioned VRB1, and the second sub VRB corresponds to the above-mentioned VRB2. Further, in both the detailed description of the present invention and 3GPP, the mapping rule of DVRB for obtaining the frequency effect is described with reference to one subframe. Therefore, it can be seen that all the examples of the detailed description of the present invention are concepts including the RB mapping method in 3GPP.
Hereinafter, the terms used in the detailed description of this application will be defined as follows. 'RE (Resource Element)' represents the smallest frequency-time unit to which the modulation symbol of the data or other control channel is 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 a plurality of REs that are continuous in the frequency-time domain, and a plurality of PRBs are defined in one subframe.
'VRB (Virtual Resource Block)' represents a virtual unit resource for data transmission. Generally, the number of REs contained in one VRB is the same as the number of REs contained in one PRB, and when data is actually transmitted, one VRB is mapped to one PRB, or One VRB can be mapped to a part of a plurality of PRBs.
'LVRB (Localized Virtual Resource Block)' is a type of VRB. One LVRB is mapped to one PRB, and PRBs to which different LVRBs are mapped do not overlap. LVRB may be interpreted as PRB as it is.
'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<sub>D</sub>'=' N<sub>d</sub>'Represents the number of PRBs to which one DVRB is mapped. FIG. 9 shows an example of how DVRB and LVRB are mapped to PRB.<sub>D</sub>= 3. After dividing any DVRB into three parts, each part can be mapped to different PRBs. At this time, the divided portion of another DVRB is mapped to the portion of each PRB where the corresponding DVRB is not mapped and remains.
'N<sub>PRB</sub>'Represents the number of PRBs in the system. When dividing the bandwidth of the system, it can be the number of PRBs in the divided and defined part.
'N<sub>LVRB</sub>'Represents the number of LVRBs available in the system.
'N<sub>DVRB</sub>'Represents the number of DVRBs available in the system.
'N<sub>LVRB_UE</sub>'Represents the maximum number of LVRBs assigned to one UE.
'N<sub>DVRB_UE</sub>'Represents the maximum number of DVRBs assigned to one UE.
'N<sub>subset</sub>'Represents the number of Subsets.
'N<sub>DivOrder</sub>'Represents the diversity order required by the system. Here, the diversity order is defined by the number of non-adjacent RBs.
Here, "the number of RBs" means the number of RBs divided on the frequency axis. That is, even if RB can be divided by the slots constituting the subframe,'number of RBs' means the number of RBs divided by the frequency axis of the same slot.
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, PRB0 is mapped to one LVRB (901). On the other hand, one DVRB is divided into three divisions, and each division is mapped to a different PRB. For example, DVRB0 is divided into three divisions, and each division is mapped to PRB1, PRB4, and PRB6, respectively. Similarly, DVRB1 and DVRB2 are each divided into three divisions, and each division is mapped to the remaining resources in PRB1, PRB4, and PRB6. In this example, the DVRB is divided into three divisions, but is not limited to this. That is, for example, it can be divided into two divided portions.
The downlink data transmission from the base station to the specific terminal or the uplink data transmission from the specific terminal to the base station is performed through one or more VRBs within one subframe. At this time, when transmitting data to a specific terminal, the base station must inform the terminal of which VRB among the plurality of VRBs the data is transmitted through. In addition, in order to enable a specific terminal to transmit data, the terminal is informed which VRB through which data can be transmitted.
The method of transmitting data is roughly classified into the FDS (Frequency Diversity Scheduling) method and the FSS (Frequency Selective Scheduling) method. The FDS (Frequency Diversity Scheduling) method is a method of obtaining a reception performance gain through frequency diversity, and the FSS (Frequency Selective Scheduling) method is a method of obtaining a reception performance gain through frequency selective scheduling.
In the FDS method, the transmitting end transmits one data packet through subcarriers widely distributed in the system frequency domain so that the symbols in one data packet undergo various radio channel fading. It prevents the entire packet from undergoing unfavorable fading, resulting in improved reception performance. On the other hand, in the FSS method, the reception performance is improved by transmitting the data packet through one or a plurality of continuous frequency domains which are advantageous fading states in the system frequency domain. In an actual cellular OFDM wireless packet communication system, there are a plurality of terminals in one cell. In this case, since the wireless channel status of each terminal has different characteristics, FDS data transmission must be performed to one terminal and FSS data transmission to another terminal even within one subframe. Must be. Therefore, the specific FDS transmission method and FSS transmission method must be designed so that both of these methods can be efficiently multiplexed within one subframe. On the other hand, in the FSS method, gain can be obtained by selectively using a band that is advantageous to the UE in the entire band, but in the FDS method, 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 interval is maintained so that Therefore, when scheduling, it is advantageous to prioritize frequency-selective scheduling of the FSS method in improving the performance of the entire system.
In the FSS method, data is transmitted using subcarriers that are continuously adjacent in the frequency domain, so it is preferable to transmit data using LVRB. In this case, N in one subframe<sub>PRB</sub>There are multiple PRBs, at which time the maximum N in the system<sub>LVRB</sub>If multiple LVRBs could be used, the base station would have N for each terminal.<sub>LVRB</sub>By transmitting the bitmap information of the bit, it is possible to inform the terminal which LVRB the downlink data is transmitted through or which LVRB the uplink data can be transmitted through. That is, N transmitted as scheduling information to each terminal.<sub>LVRB</sub>Each bit of the bitmap information of the bit is N<sub>LVRB</sub>Indicates whether or not data is transmitted through the LVRB corresponding to the bit of the LVRB. Such a method is N<sub>LVRB</sub>There is a disadvantage that the number of bits to be transmitted to the terminal increases in proportion to the number.
On the other hand, if only one set of adjacent RBs is assigned to the terminal, the information of the assigned RBs can be expressed by the start point of the RBs and the number thereof. Such a method is referred to as a'compact method'in this document.
FIG. 10 is a diagram showing an example of a method of allocating resource blocks by the compact method.
In this case, as shown in FIG. 10, the length of RB that can be used differs depending on each starting point, and finally the number of combinations of RB allocation is N.<sub>LVRB</sub>(N<sub>LVRB</sub>+1) / 2. Therefore, the number of bits required for this is ceiling (log)<sub>2</sub>(N<sub>LVRB</sub>(N<sub>LVRB</sub>It becomes +1) / 2)) bits. Here, ceiling (x) means the rounded-up value to the nearest integer. This method is N compared to the bitmap method.<sub>LVRB</sub>It has the advantage that the increase in the number of bits due to the increase in the number is relatively small.
On the other hand, in the case of the method of notifying the UE (User Equipment) of the allocation of the DVRB, the position of each division of the DVRB to be distributed and transmitted for the diversity gain is promised in advance, or this position is directly notified. Additional information is needed. Here, preferably, when the number of bits for signaling to the DVRB is set to be the same as the number of bits during the above-mentioned compact LVRB transmission, the signaling bit format in the downlink can be simplified, and as a result, the same. It has the advantage of being able to use the channel coding of.
Here, when multiple DVRBs are assigned to one UE, the DVRB index of the start point of the DVRB, the length (= the number of DVRBs assigned), and the relative between the divisions divided in one DVRB are assigned to this UE. Notify the position (eg, Gap between splits).
FIG. 11 is a diagram showing an example of a method in which two DVRBs having consecutive indexes are mapped to a plurality of adjacent PRBs.
As shown in FIG. 11, when mapping multiple DVRBs with consecutive indexes to multiple adjacent PRBs, the first split 1101,1102 and the second split 1103,1104 are separated from each other by Gap 1105. However, the divisions belonging to the upper division and the lower division are adjacent to each other, and the diversity order is 2.
FIG. 12 is a diagram showing an example of a method in which two DVRBs having consecutive indexes are mapped to a plurality of distant PRBs.
In the method according to FIG. 12, when the DVRB is made to correspond to the PRB, the continuous DVRB index can be distributed without corresponding to the adjacent PRB. For example, the DVRB index '0' and the DVRB index '1' are not placed adjacent to each other. In other words, in FIG. 12, the DVRB indexes are arranged in the order of 0,8,16,4,12,20, ..., and this arrangement makes the continuous index in FIG. 11, for example, a block interleaver. You can get it by typing. In this case, not only the dispersion by Gap 1203 but also the dispersion within each division 1201 and 1202 can be obtained. Therefore, as shown in FIG. 12, when two DVRBs are assigned to the UE, the diversity order increases to 4, and there is an advantage that a more increased diversity gain can be obtained.
At this time, the value of Gap, which represents the relative position between the divisions, can be represented by two methods. First, the Gap value can be represented by the difference in the DVRB index. Second, the Gap value can be represented by the index difference between the PRBs to which the DVRB is mapped. In FIG. 12, according to the first method, Gap = 1, and according to the second method, Gap = 3. FIG. 12 is a diagram showing 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, the second method has the advantage that the physical distance between the divided parts can be grasped.
FIG. 13 is a diagram showing a case where four DVRBs are assigned to one UE using the same rules as in FIG.
As shown in Figure 13, the diversity order increases to 7. However, the diversity gain converges as the diversity order increases. According to the results of existing studies, the increase in gain is small at approximate orders of 4 and above. Also, of the PRB, there is a part that remains unmapped by the DVRB, so the DVRB assigned to another UE must be mapped to the PRB1301,1302,1303,1304,1305, so use the DVRB. In the absence of the UE, some of these PRBs 1301,1302,1303,1304,1305 have the disadvantage of being unused and empty. In addition, the distributed arrangement of DVRBs impairs the continuity of available PRBs, which imposes restrictions on continuous LVRB allocation.
Therefore, there is a need for a method that can perform distributed allocation by limiting the diversity order to an appropriate level.
The first and second embodiments of the present invention relate to a method of setting the relative distance between the divisions of the DVRB mapped to the PRB to 0. In these examples, in a method of mapping consecutive indexes of DVRBs to PRBs that are separated from each other, when a plurality of DVRBs are assigned to one UE, each division of each DVRB is distributed to different PRBs. This allows the diversity order to be increased. Alternatively, under the same conditions, by assigning each division of each DVRB to the same PRB instead of distributing it to different PRBs, the number of PRBs distributed to the DVRBs can be reduced. The diversity order can be limited.
<p> <Example 1> This embodiment relates to a method of switching between distributed / non-distributed modes of divisions by setting a reference value for the number of DVRB assigned to one UE. is there. Here,'distributed mode' indicates a mode in which the Gap between the DVRB divided portions has a value other than 0, and'non-distributed mode' indicates a mode in which the Gap between the DVRB divided portions is 0.</p><p> When the number of DVRBs assigned to one UE is M, the M value is the specific reference value (= M).<sub>th</sub>If it is less than), the diversity order can be increased by distributing and allocating the divisions of the DVRB.</p><p> Conversely, the M value is the reference value (= M)<sub>th</sub>) When the above, the divided parts are not distributed and assigned to the same PRB. Assigning to the same PRB in this way can reduce the number of PRBs that are distributed and mapped to the DVRB, thus limiting the diversity order.</p><p> That is, the M value is the reference value M<sub>th</sub>In the above case, Gap, which is the relative distance between the divisions of the DVRB mapped to the PRB, is set to 0.</p><p> For example, M<sub>th</sub>When = 3 is set and the number of DVRBs is 2, the DVRB divisions can be distributed and mapped as shown in FIG. Compared to this, M<sub>th</sub>When = 3 is set and the number of DVRBs is 4, the DVRB division can be mapped to the same PRB by setting Gap to 0.</p><p> FIG. 14 is a diagram showing an example of a resource block mapping method when Gap = 0 is set in the first embodiment.</p><p> <Example 2> This embodiment relates to a method of switching the distributed / non-distributed mode of the divided portion using a control signal. Here,'distributed mode' indicates a mode in which the Gap between the DVRB divided portions has a value other than 0, and'non-distributed mode' indicates a mode in which the Gap between the DVRB divided portions is 0.</p><p> Example 2 is a modification of Example 1, and in Example 2, M<sub>th</sub>The distributed / non-distributed mode can be switched by transmitting and receiving a control signal as needed without setting. Depending on the transmitted and received control signals, the DVRB divisions can be dispersed to increase the diversity order, or the DVRB divisions can be mapped to the same PRB to decrease the diversity order.</p><p> For example, the control signal can be defined to represent the Gap value, which is the relative distance between the DVRB dividers mapped to the PRB. That is, the control signal can be defined to represent the Gap value itself.</p><p> For example, when the control signal represents Gap = 3, the DVRB divisions are distributed and mapped as shown in FIG. 12 or 13, and when the control signal represents Gap = 0, the DVRB divisions are the same as shown in FIG. Map to the PRB of.</p><p> As mentioned above, the number of PRBs in the system (N)<sub>PRB</sub>) Is freely scheduled in PRB units, N for each scheduled UE<sub>PRB</sub>It is necessary to transmit a bitmap of bits. Number of PRBs in the system (N<sub>PRB</sub>) Is large, the overhead of control information increases in order to transmit this. Therefore, it is possible to consider a method of reducing the scheduling unit or dividing the band and then transmitting the scheduling unit separately only in a part of the band.</p><p> In 3GPP LTE, a method of constructing a bitmap has been proposed in consideration of the overhead in transmitting the bitmap as described above.</p><p> An example of this bitmap configuration is shown in FIG.</p><p> First, the signal for resource allocation is composed of header 1501 and bitmap 1502. The header 1501 informs the structure of the transmitted bitmap 1502, that is, the bitmap system by notifying the signaling method.</p><p> First, bitmaps are classified into two methods, the RBG method and the subset method.</p><p> In the RBG method, RBs are grouped together into multiple groups. Map RB with one group as the basic unit. That is, a plurality of RBs constituting one group have an association with the mapping. As the size of the group increases, it is difficult to allocate resources in detail, but the number of bits in the bitmap can be reduced. See Figure 15 N<sub>PRB</sub>Since = 32, a total of 32 bits of bitmap is required to allocate resources in 1RB units. However, if 3 RBs are grouped (P = 3) and resources are allocated in RBG (RB Group) units, the total RB can be made into a total of 11 groups. Therefore, only an 11-bit bitmap is required, and the amount of control information can be significantly 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.</p><p> A subset method can be used to complement this. In this method, multiple RBGs are set in one subset, and resources are allocated in RB units within each subset. In order to use the 11-bit bitmap in the RBG method of FIG. 15 above, it is possible to construct '3' subsets (subset 1, subset 2, subset 3). Here, '3' is the number of RBs constituting each of the above-mentioned RBGs. Then N<sub>RB</sub>/ P = ceiling (32/3) = 11, and RB in each subset can be assigned in RB units with 11 bits. However, it is necessary to inform which of the RBG method and the subset method is used by the bitmap, and which subset is used if the subset method is used, and therefore the header information 1501 is required.</p><p> In the unlikely event that the header information 1501 indicates only which method to use, the RBG method or the subset method, and if the type of the subset is specified using some bits of the bitmap used for the RBG, the entire subset is specified. It may not be possible to utilize all the RBs inside. For example, referring to Figure 15, a total of three subsets have been set, so a two-bit Subset Indicator 1503 is needed to distinguish between the subsets. At this time, a total of 12 RBs are assigned to the subset 1 (1504,1505), and only 9 bits remain after excluding the two bits of the subset directive from the bitmap consisting of a total of 11 bits, which is 9 bits. It is not possible to specify all 12 RBs individually by using alone. To solve this, one bit of the RBG bitmap is a move indicator (Shift). Can be used to assign an indicator) and shift the position of the RB indicated by the subset bitmap. For example, if the subset directive 1503 points to subset 1 and the move directive 1506 points to'shift 0', the remaining 8-bit bitmaps are RB0, RB1, RB2, RB9, RB10, RB11, RB18. , Used to indicate RB19 (see 1504). In contrast, if the subset directive 1503 points to subset 1 and the move directive 1506 points to'shift 1', the remaining 8-bit bitmaps are RB10, RB11, RB18, RB19, RB20, RB27. , RB28, RB29 (see 1505).</p><p> In the above example, the subset specifier 1503 points to subset 1 (1504,1505), but the subset specifier 1503 can also point to subset 2 or subset 3. Therefore, it can be seen that eight RBs can be mapped in units of 1RB for each combination of the subset indicator 1503 and each movement indicator 1506. Also, referring to FIG. 15, in this example, the number of RBs assigned to Subset 1, Subset 2, and Subset 3 is different from 12, 11, and 9, respectively, so in the case of Subset 1, 4 RBs. It turns out that you cannot use 3 RBs in the case of subset 2 and 1 RB in the case of subset 3 (shaded area). reference). FIG. 15 is for illustration purposes only and the present embodiment is not limited by this drawing.</p><p> It is possible to consider the case where the bitmap method using the RBG method and the subset method and the compact method are used in combination.</p><p> FIG. 16 is a diagram showing an example of a method of mapping by combining the bitmap method and the compact method.</p><p> When the DVRB is transmitted by mapping as shown in FIG. 16, some resource elements of RBG0, RBG1, RBG2, and RBG4 are filled by the DVRB. 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 method. Then, among the RBGs, the remaining RBs (PRB0, PRB4, PRB8, PRB12) assigned as DVRB must be assigned to the UE in a subset method. However, since only RBs in one subset can be assigned to UEs to which RBs are assigned by the subset method, the remaining RBs belonging to the other subsets can only be assigned to different UEs. Therefore, DVRB scheduling constrains LVRB scheduling.</p><p> Therefore, a DVRB configuration method is needed to reduce the LVRB scheduling constraints.</p><p> Examples 3 to 5 relate to a method of setting the relative distance of the DVRB splits mapped to the PRB for the purpose of reducing the effect on LVRB.</p><p> <Example 3> Example 3 relates to a method of mapping to an RB belonging to one specific subset, mapping to all RBs of the specific subset, and then mapping to an RB belonging to the other subset when mapping the divided portion of the DVRB. is there.</p><p> According to this example, when mapping continuous DVRB indexing to distributed PRBs, it is mapped to be distributed within one subset, and if no further mapping is possible within one subset, it is mapped to another subset. be able to. Also, continuous DVRB interleaving is done within the subset.</p><p> 17 and 18 are DVRB mapping methods according to an embodiment of the present invention.</p><p> DVRB0-11 are distributed and mapped within subset 1 (1703), then DVRB12-22 are distributed and mapped within subset 2 (1704), and then DVRB23-31 are distributed and mapped within subset 3. It is distributed and mapped in (1705). Such mapping can be done by using block interleavers for each subset or by other methods.</p><p> Such an arrangement can be achieved by adjusting the operation method of the block interleaver.</p><p> <Example 4> Example 4 relates to a method of limiting the DVRB division to be mapped to PRBs contained in the same subset.</p><p> In Example 4, Gap information can be used to ensure that the same DVRB partition is mapped within the same subset. At this time, parameters for the entire PRB can also be used as in the above-mentioned'Gap'. Or another parameter for one subset, namely'Gap<sub>subset</sub>You can also use'. This will be described in detail next.</p><p> It is possible to simultaneously use the method of distributing and filling consecutive DVRBs within one subset and the method of mapping the divided parts of DVRBs within the same subset. In this case, preferably, Gap means the difference in the number of PRBs in the same subset as the information representing the relative position difference between the DVRB divisions.<sub>subset</sub>Can be used. See Figure 17 for Gap<sub>subset</sub>Can understand the meaning of. The PRBs included in Subset 1 are PRB0,1,2,9,10,11,18,19,20,27,28,29. In this case, PRB18 is PRB0 to 6 (Gap) within subset 1.<sub>subset</sub>= 6) Only indexes are separated. On the other hand, PRB18 can be displayed as being separated by 18 (Gap = 18) indexes from PRB0 when displaying the entire PRB as a target.</p><p> <Example 5> Example 5 relates to a method of setting the relative distance between the DVRB divisions to a multiple of the square of the magnitude of RBG.</p><p> When Gap is limited to a multiple unit of the size of RBG as in this embodiment, it has the following characteristics. That is, when displaying by the difference in relative positions within one subset, the relative distance between the DVRB divisions is set to a multiple of the RBG size (P) and displayed by the difference in position with respect to the entire PRB. In some cases, the relative distance between the DVRB dividers is the square of the magnitude of the RBG (P).<sup>2</sup>) Is limited to multiples.</p><p> For example, referring to Figure 15, P = 3 and P<sup>2</sup>It turns out that = 9. At this time, the Gap between the first division 1701 and the second division 1702 of the DVRB<sub>subset</sub>Since = 6, it is a multiple of P (= 3), and since Gap = 18 between the first division 1701 and the second division 1702 of the DVRB, P<sup>2</sup>It can be confirmed that it is a multiple of (= 9).</p><p> When the method according to this embodiment is used, RBGs in which only some resource elements are used are likely to belong to the same subset, so that the remaining unused resource elements or RBs exist in the same subset. Therefore, the subset method allocation can be used efficiently.</p><p> Referring to FIG. 17, RBG10 is different from other RBG sizes (= 3) because the size of RBG is 2. In this case, RBG10 may not be available for DVRB for convenience of DVRB index configuration. Also, referring to FIGS. 17 and 18, the total number of RBGs belonging to subset 1 including RBG9 is 4, and the total number of RBGs belonging to subset 2 is 3 excluding RBG10, and the total number of RBGs belonging to subset 3 is 3. Is a total of three. In this case, for convenience of DVRB index configuration, RBG9 of the four RBGs belonging to subset 1 need not be used for DVRB.</p><p> In such a case, first, as shown in FIG. 18, the DVRB index can be sequentially mapped to one subset area (for example, subset 1) used for DVRB among the subsets. When it becomes impossible to map to this one subset any more, it can be mapped to the area of the next subset (for example, subset 2).</p><p> In FIG. 11 above, the DVRB indexes are arranged continuously, but in FIGS. 12, 13, 14, 14, 16, 17, and 18, it can be confirmed that the DVRB indexes are arranged discontinuously. .. In this way, the DVRB index can be repositioned before it is mapped to the PRB index, and such changes can be made by the block interleaver. Hereinafter, the structure of the block interleaver according to the present invention will be described.</p><p> <Example 6> Hereinafter, as an example according to the present invention, a method for constructing an interleaver having a desired interleaver order (Degree) equal to the diversity order (Diversity Order) will be described.</p><p> Specifically, in a method of mapping consecutive indexes of a DVRB to distributed PRBs that are not adjacent to each other, a block interleaver is used, and the degree of the interleaver is the target diversity order (N).<sub>DivOrder</sub>), We propose a method to configure the interleaver so that it is the same as. The degree of the interleaver can be defined as follows.</p><p> That is, in a block interleaver consisting of m rows and n columns, when data is recorded, the index of the data is sequentially increased and recorded. At this time, if one column is filled, the column index is increased by 1 and the next column is filled. Then, in one column (Column), the row index (Row index) is increased and recorded. Next, when reading from the interleaver, after reading all from one row (Row), the row index is incremented by 1 and the next row is read. In this case, the interleaver can be called an interleaver of degree m.</p><p> Conversely, with a block interleaver consisting of m rows and n columns, when recording data, record by filling one row and then proceeding to the next row, and when reading data, one You can fill one column and then move on to the next. In this case, the interleaver can be called an interleaver of degree n.</p><p> Specifically, first, N<sub>DivOrder</sub>Is N<sub>D</sub>Limited to an integral multiple of. That is, N<sub>DivOrder</sub>= K N<sub>D</sub>Limited to. Where K is a positive integer. Also, the order is N<sub>DivOrder</sub>The block interleaver is used.</p><p> In Fig. 19, the number of RBs used for interleaving is N.<sub>DVRB</sub>= 24, N<sub>D</sub>= 2, N<sub>DivOrder</sub>It is a figure which illustrates the case of = 2 × 3 = 6.</p><p> Referring to FIG. 19, when recording in the interleaver, the index of the data is incremented sequentially, and in this case, when one column (Column) is filled, the column index (Column index) is incremented by 1. And record by filling the next column. However, in one column (Column), the row index (Row index) is increased and recorded. Next, when reading from the interleaver, after reading all from one row, the row index is incremented by 1 and the next row is read. However, in one row (Row), read while increasing the column index. When using such a read / write method, the degree of the interleaver is the number of rows, and the number of rows is set to 6, which is the required diversity order.</p><p> When configured in this way, the DVRB index order of the data column output from the interleaver is used as the index order of the first partition of the DVRB, and this data column is N.<sub>DVRB</sub>/ N<sub>D</sub>The DVRB index order of data columns that are only cyclically shifted can be used as the index order of the remaining partitions. As a result, N generated from DVRB<sub>D</sub>N<sub>D</sub>Mapped to only one PRB, the difference between the paired DVRB indexes is K.</p><p> For example, in Figure 19, N<sub>DVRB</sub>/ N<sub>D</sub>= N<sub>DVRB</sub>(= 24) / N<sub>D</sub>(= 2) = 24/2 = 12, and K = 3. The DVRB index order 1901 of the data string output from the interleaver is "0 6 12 18 1 7 13 19 2 8 14 20 3 9 15 21 4 10 16 22 5 11 17 23 , and this data string is N<sub>DVRB</sub>/ N<sub>D</sub>The DVRB index order 1902 for data columns that are cyclically shifted by = 12 is "3 9 15 21 4 10 16 22 5 11 17 23 0 6 12 18 1 It can be seen that it is given in the order of 7 13 19 2 8 14 20 . And DVRBs are paired two by two. With reference to 1903 in FIG. 19, it can be seen that DVRB0 and DVRB3 are paired. It can be confirmed that the divisions generated from DVRB0 and DVRB3 are combined and mapped to PRB0 and PRB12, respectively. The same applies to DVRBs having other indexes.</p><p> According to this embodiment, the relationship between the DVRB and the mapped PRB of the DVRB can be effectively managed.</p><p> <Example 7> Hereinafter, as an example according to the present invention, a method of filling a null value in a rectangular interleaver will be described.</p><p> In this specification below, the number of nulls filled in the interleaver is'N<sub>null</sub>Can be displayed with'.</p><p> In Example 6, N<sub>DVRB</sub>Is N<sub>DivOrder</sub>Because it is an integral multiple of, the interleaver could be completely filled with data. But N<sub>DVRB</sub>Is N<sub>DivOrder</sub>If it is not an integral multiple of, the interleaver cannot be completely filled, and it is necessary to consider how to fill the null value.</p><p> N<sub>DVRB</sub>/ N<sub>D</sub>Only to make a circular shift, N<sub>DVRB</sub>Is N<sub>D</sub>Must be an integral multiple of, N to completely fill the rectangular interleaver<sub>DVRB</sub>Is N<sub>DivOrder</sub>Must be an integral multiple of. But if K> 1, N<sub>DVRB</sub>Is N<sub>D</sub>Although it is an integral multiple of<sub>DVRB</sub>Is N<sub>DivOrder</sub>Occurs when it is not an integral multiple of. In such cases, in general, the block interleaver is filled in sequence, the rest is filled with nulls, and then the data is read, but if the data is filled by column, the data is read by row or by row, or , When the data is filled by row, read the data by column. In this case, the null value is excluded and read.</p><p> In FIGS. 20a and 20b, the number of RBs used for interleaving is N.<sub>DVRB</sub>= 22, N<sub>D</sub>= 2, N<sub>DivOrder</sub>= 2 × 3 = 6 and N<sub>DVRB</sub>Is N<sub>DivOrder</sub>It is a figure which shows the operation of a general block interleaver when it is not an integral multiple of.</p><p> With reference to FIG. 20a, the index difference between the paired DVRBs will have an arbitrary value. For example, (0,20), (6,3), (12,9) are paired (see 2001, 2002, 2003), and the index difference value of each pair is 20-0 = 20,6. It can be seen that -3 = 3 and 12-9 = 3, which are not fixed at a fixed value. Therefore, DVRB scheduling becomes more complicated than when the paired index difference has a constant value.</p><p> On the other hand, N<sub>DVRB</sub>N<sub>DivOrder</sub>The remainder value when divided by N<sub>Remain</sub>If so, the last column is N, as shown in Figures 20a and 20b.<sub>Remain</sub>The remaining elements except the values are filled with nulls. For example, seeing Figure 20a, N<sub>DVRB</sub>(= 22) to N<sub>DivOrder</sub>The remainder when divided by (= 6) is N<sub>Remain</sub>Since (= 4), 2 elements except 4 values can be filled with nulls in the last column. Here, the example of filling the null after is given, but the null can also be positioned before the initial value of the index. For example, N<sub>Remain</sub>Each value is filled from the beginning. The null can exist at any designated position.</p><p> 21a and 21b relate to a null placement method according to an embodiment of the present invention. When compared with FIG. 20, it can be seen that the null values are uniformly dispersed.</p><p> In this embodiment, if the null value must be filled in the rectangular block interleaver, N corresponding to the degree of the interleaver<sub>DivOrder</sub>The K size N<sub>D</sub>Divide into groups and fill in the nulls so that they are evenly distributed across all groups. For example, in Figure 21a, the interleaver is N.<sub>D</sub>Divide into (= 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 that the nulls are recorded in a dispersed manner.</p><p> For example, when writing while filling in the values sequentially, N at the end<sub>Remain</sub>The number of values will remain, but the index corresponding to this part is N<sub>D</sub>When evenly distributed in groups, the nulls are evenly distributed. For example, in Figure 21a, finally N<sub>Remain</sub>(= 4) data spaces remain, but if the indexes 18, 19, 20, 21 corresponding to this part are evenly distributed and arranged in ND (= 2) groups, one for each group. Nulls can be placed.</p><p> As a result, the difference between the paired DVRB indexes is maintained below the K (eg, K = 3) value, which has the advantage that DVRB allocation can be performed more efficiently.</p><p> <Example 8> Hereinafter, as an example according to the present invention, a method of setting the relative distance between the divided portions of the DVRB mapped to the PRB to 0 will be described.</p><p> FIG. 22 is a diagram showing a method of mapping an index of an interleaved DVRB with a value of Gap = 0 according to an embodiment of the present invention.</p><p> On the other hand, in a method of mapping consecutive indexes of DVRBs to distributed PRBs without being adjacent to each other, when M DVRBs are assigned to one UE, the reference value M for M is used.<sub>th</sub>Can be set. The reference value M<sub>th</sub>The diversity order can be increased by allocating the divided parts of each DVRB to different PRBs based on the above. Alternatively, by assigning the divided portions of each DVRB to the same PRB without distributing them to different PRBs, the number of distributed mapped PRBs of the DVRBs can be reduced and the diversity order can be limited.</p><p> For example, the M value is a specific reference value (= M)<sub>th</sub>If it is less than), the division of DVRB is dispersed to increase the diversity order, and the M value is the reference value (= M).<sub>th</sub>) Or more, by allocating the divided parts to the same PRB without distributing them, the number of PRBs distributed and mapped in the DVRB is reduced, and the diversity order is limited.</p><p> That is, as shown in FIG. 22, the DVRB index of the data string output from the interleaver is commonly applied to all DVRB divisions and mapped to the PRB. For example, referring to Fig. 9, the DVRB index order of the data string output from the interleaver is 0 6 12 18 1 7 13 19 2 8 14 20 3 9. 15 21 4 10 16 22 5 11 17 23 , but this DVRB index is applied to the first division 2201 and the second division 2202 of DVRB in common. Will be done.</p><p> <Example 9> Hereinafter, as an example according to the present invention, a method of using both Example 6 and Example 8 described above will be described.</p><p> FIG. 23 shows UE1 scheduled by a method configured so that the DVRB divisions are mapped to different PRBs as shown in FIG. 19, and DVRB divisions are configured to be mapped to the same PRB as shown in FIG. It is a figure which shows the case where UE2 scheduled by the above-mentioned method is multiplexed at the same time. That is, the case where the method of Example 6 and Example 8 are scheduled together is shown.</p><p> For example, referring to FIG. 23, UE1 is assigned DVRB0, DVRB1, DVRB2, DVRB3, DVRB4 (2301), and UE2 is assigned DVRB6, DVRB7, DVRB8, DVRB9, DVRB10, DVRB11 (2302). However, UE1 is scheduled by a method configured so that the DVRB divisions are mapped to different PRBs, and UE2 is scheduled by a method configured so that the divisions 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.</p><p> When the DVRB division is mapped to distributed PRBs, the difference between the indexes of the paired DVRBs is limited to K or less and does not affect the DVRBs that are separated by K value or more. You can easily figure out which indexes are not available and which ones are available when mapped.</p><p> <Example 10> Hereinafter, as an example according to the present invention, N so as not to generate nulls.<sub>DVRB</sub>Explains how to limit.</p><p> With reference to FIG. 20 again, it can be seen that the difference between the paired DVRB indexes in PRB may not be fixed at a constant value. The method of FIG. 21 described above can be used to keep this difference value below a certain value.</p><p> However, the method according to FIG. 21 is a method of dispersing nulls, and when this method is used, the complexity of the interleaver increases due to null processing. To prevent this, N to prevent nulls from occurring<sub>DVRB</sub>Can be considered how to limit.</p><p> In the illustrated interleaver, the number of RBs used for DVRB (N)<sub>DVRB</sub>) Is the diversity order, i.e. N<sub>DivOrder</sub>By limiting it to a multiple of, it prevents the rectangular interleaver matrix from being filled with nulls.</p><p> In the case of a block interleaver with a degree of D (Interleaver of degree D), the number of RBs used for DVRB (N)<sub>DVRB</sub>) Is restricted to be a multiple of D so that the rectangular matrix is not filled with nulls.</p><p> Below, K = 2, N<sub>D</sub>Various examples of using the interleaver according to the present invention will be described when = 2. At this time, the relationship between the DVRB index and the PRB index can be expressed by a mathematical formula.</p><p> FIG. 24 is a diagram for explaining the relationship between the DVRB index and the PRB index. The variables used in mathematical formulas can be understood by referring to the explanation below and Fig. 24.</p><p><chemistry num="14"><img file="JP5048844B2_D0024.tif" /></chemistry></p><p> The constants used in mathematical formulas 1 to 11 that express the relationship between the DVRB index and the PRB index are defined as follows.</p><p><chemistry num="15"><img file="JP5048844B2_D0025.tif" /></chemistry> FIG. 25a is a diagram for explaining the above-mentioned constants.</p><p> K = 2, N<sub>D</sub>= 2</p><p><chemistry num="16"><img file="JP5048844B2_D0026.tif" /></chemistry>If it is a multiple of, the relationship between the PRB index and the DVRB index can be obtained by mathematical formulas 1 to 3. First, the DVRB index when the PRB index p is given can be obtained by mathematical formula 1 or mathematical formula 2. Hereinafter, in this document, mod (x, y) means x mod y, and'mod'means modulo operation. Also,</p><p><chemistry num="17"><img file="JP5048844B2_D0027.tif" /></chemistry>Means truncation operation</p><p><chemistry num="18"><img file="JP5048844B2_D0028.tif" /></chemistry>Represents the largest number of the same integers that are smaller than or equal to the numbers in. Also,</p><p><chemistry num="19"><img file="JP5048844B2_D0029.tif" /></chemistry>Means round-up operation,</p><p><chemistry num="20"><img file="JP5048844B2_D0030.tif" /></chemistry>Represents the smallest number of integers greater than or equal to the number in. Also, round () represents the integer closest to the number in (). Min (x, y) represents the lesser value of x, y, and max (x, y) represents the lesser value of x, y.</p><p><maths num="1"><img file="JP5048844B2_D0031.tif" /></maths></p><p><maths num="2"><img file="JP5048844B2_D0032.tif" /></maths> vice versa,</p><p><chemistry num="21"><img file="JP5048844B2_D0033.tif" /></chemistry>If it is a multiple of, the PRB index given the DVRB index d can be calculated by mathematical formula 3.</p><p><maths num="3"><img file="JP5048844B2_D0034.tif" /></maths> Figure 25b shows a common way to fill nulls in interleavers, K = 2, N.<sub>D</sub>= 2<chemistry num="22"><img file="JP5048844B2_D0035.tif" /></chemistry>It is a figure which shows the case which is a multiple of. The method according to FIG. 25b is substantially the same as the method according to FIG. 20. In FIG. 25b, the DVRB index given the PRB index p can be obtained using mathematical formula 4.</p><p><maths num="4"><img file="JP5048844B2_D0036.tif" /></maths> On the contrary, the PRB index when the DVRB index d is given can be obtained by the mathematical formula 5.</p><p><maths num="5"><img file="JP5048844B2_D0037.tif" /></maths></p><p><Example 11> FIG. 25c shows a method of filling nulls in the interleaver according to an embodiment of the present invention, in which K = 2, N.<sub>D</sub>= 2</p><p><chemistry num="23"><img file="JP5048844B2_D0038.tif" /></chemistry>It is a figure which shows the case which is a multiple of.</p><p> FIG. 25c corresponds to the method according to Example 7 and FIG. 21 described above. The method according to FIG. 25c can be explained using mathematical formulas 6 to 8. In FIG. 25c, the DVRB index given the PRB index p can be determined using mathematical formula 6 or mathematical formula 7.</p><p><maths num="6"><img file="JP5048844B2_D0039.tif" /></maths></p><p><maths num="7"><img file="JP5048844B2_D0040.tif" /></maths> On the contrary, in FIG. 25c, the PRB index when the DVRB index d is given can be obtained by using the mathematical formula 8.</p><p><maths num="8"><img file="JP5048844B2_D0041.tif" /></maths></p><p><Example 12> Figure 25d shows K = 2, N<sub>D</sub>= 2 and the size of the interleaver (= C × R)</p><p><chemistry num="24"><img file="JP5048844B2_D0042.tif" /></chemistry>When set to, the method according to Example 7 and FIG. 21 described above is applied. However, here</p><p><chemistry num="26"><img file="JP5048844B2_D0043.tif" /></chemistry>Is the number of nulls contained in the interleaver, which is a preset value. At this time, the DVRB index when the DVRB index p is given can be obtained by mathematical formula 9 or mathematical formula 10.</p><p><maths num="9"><img file="JP5048844B2_D0044.tif" /></maths></p><p><maths num="10"><img file="JP5048844B2_D0045.tif" /></maths> On the contrary, the PRB index when the DVRB index d is given can be obtained by the mathematical formula 11.</p><p><maths num="11"><img file="JP5048844B2_D0046.tif" /></maths> With reference to the above description with reference to FIG. 15, it is possible to consider the case where the bitmap method and the compact method using the RBG method and the subset method are used in combination. Problems that may occur in this case will be described with reference to FIGS. 26 and 27.</p><p> 26 and 27 are diagrams showing an example of a method in which the bitmap method and the compact method using the RBG method and the subset method are used in combination.</p><p> As shown in FIG. 26, after dividing the DVRB into two divisions, the second division is Gap = N.<sub>DVRB</sub>/ N<sub>D</sub>You can make a circular shift by = 50/2. Then, only some of the resource elements of RBG0 of PRB are mapped by the first division of DVRB, and only some of the resource elements of RBG8 and RBG9 of PRB are mapped by the second division of DVRB. .. Therefore, RBG0, RBG8, and RBG9 cannot be used in the method of allocating in RBG units.</p><p> In order to solve the above problem, as shown in FIG. 27, M is the number of RBs belonging to one RBG.<sub>RBG</sub>Can be set so that a multiple of is the value of Gap. That is, Gap = M<sub>RBG</sub>* k (k is a natural number) can be satisfied. If you set Gap like this, for example, Gap = M<sub>RBG</sub>* k = 3 * 9 = 27 can be. If Gap = 27, after dividing the DVRB into two divisions, the second division can be cyclically shifted by Gap = 27. Then, only a part of the resource elements of RBG0 of PRB is mapped by the first division of DVRB, and only a part of resource elements of RBG9 of PRB is mapped by the second division of DVRB. Therefore, unlike the method according to FIG. 26, the method according to FIG. 27 can be used for the method of allocating RBG8 in RBG units.</p><p> However, in the method according to FIG. 27, DVRB indexes paired in one PRB cannot be paired with each other in another PRB. Referring again to FIG. 26, the paired DVRB indexes (1,26) (2601) within PRB1 are also paired within PRB26 (2603). However, in Figure 27, the paired DVRB indexes (1,27) (2701) within PRB1 cannot be paired with PRB25 or PRB27 (2703,2705).</p><p> In the case of FIGS. 26 and 27, DVRB1 and DVRB2 are mapped to PRB1, PRB2, PRB25, and PRB26. At this time, some resource elements of PRB1, PRB2, PRB25, and PRB26 will remain as they are without being mapped.</p><p> In this case, if DVRB25 and DVRB26 are to be further mapped to PRB in FIG. 26, DVRB25 and DVRB26 are all filled in the remaining spaces of PRB1, PRB2, PRB25, and PRB26.</p><p> However, in FIG. 27, if DVRB25 and DVRB26 are to be further mapped to PRB, DVRB25 and DVRB26 are mapped to PRB0, PRB25, PRB26, and PRB49. Therefore, some of the unmapped resource elements of PRB1 and PRB2 are still not filled in the DVRB, and some of the resource elements of PRB1 and PRB26 remain unmapped. That is, in FIG. 27, there is a disadvantage that there is always a PRB that remains unmapped.</p><p> Such a problem is that Gap is N<sub>DVRB</sub>/ N<sub>D</sub>It arises from not doing a circular shift so that. Where N<sub>DVRB</sub>/ N<sub>D</sub>Is M<sub>RBG</sub>When it is a multiple of, the position of the circular shift is M<sub>RBG</sub>Since it is a multiple of, the above problem is solved.</p><p> <Example 13> Therefore, in order to solve the problems of FIGS. 26 and 27 at the same time, in one embodiment according to the present invention, the number of RBs (N) used for the DVRB.<sub>DVRB</sub>) To N<sub>D</sub> M<sub>RBG</sub>Limit to multiples of.</p><p> <Example 14> On the other hand, in the above case, it is found that the first and second divisions of DVRB belong to different subsets from each other. In order for the two divisions of DVRB to belong to the same subset, Gap is M.<sub>RBG</sub>Squared (M<sub>RBG</sub><sup>2</sup>) Must be set to be a multiple.</p><p> Therefore, in another embodiment of the invention, the number of RBs (N) used in the DVRB to ensure that the two divisions of the DVRB belong to the same subset and that the DVRBs are paired.<sub>DVRB</sub>) To N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>Limit to multiples of.</p><p> Figure 28 shows N<sub>DVRB</sub>N<sub>D</sub> M<sub>RBG</sub>This is an example when the value is set to a multiple of.</p><p> As shown in Figure 28, Gap is M<sub>RBG</sub> N<sub>D</sub>Since it is a multiple of, the DVRB partition can always be paired in the PRB by the circular shift, and the number of RBGs remaining unfilled in some of the resource elements can be reduced.</p><p> <Example 15> FIG. 29 is an example of interleaving the DVRB index in the method according to FIG. 28.</p><p> Interleaving the DVRB index as shown in Figure 29, when mapping to the PRB, N<sub>DVRB</sub>N<sub>D</sub> M<sub>RBG</sub>Can be set to a multiple of. This may result in the rectangular interleaver matrix not being completely filled, as shown in Figure 20, so the unfilled portion of the rectangular interleaver matrix must be filled with nulls. Cases can occur. To avoid having to fill with nulls, for a block interleaver of degree D (Interleaver of degree D), the number of RBs used in the DVRB (N)<sub>DVRB</sub>) Must be a multiple of D.</p><p> Therefore, in one embodiment of the present invention, the position of Gap is M.<sub>RBG</sub>The second division of the DVRB should be a multiple of N<sub>RB</sub>/ N<sub>D</sub>The number of RBs (N) used for the DVRB to make the indexes of the DVRBs mapped to one PRB pair with each other and prevent the block interleaver from being filled with nulls.<sub>DVRB</sub>) Is N<sub>D</sub> M<sub>RBG</sub>Limited to common multiples of and D. In this case, by any chance, the diversity order (N) that uses D for the interleaver<sub>DivOrder</sub>= K N<sub>D</sub>), N<sub>DVRB</sub>Is N<sub>D</sub> M<sub>RBG</sub>And K N<sub>D</sub>Limited to the common multiple of.</p><p> <Example 16> Also, in another embodiment of the invention, Gap is set to M in order to position the two divisions of the DVRB in the same subset.<sub>RBG</sub>Set to a multiple of the square and set the second partition of the DVRB to N<sub>RB</sub>/ N<sub>D</sub>The number of RBs (N) used for the DVRB to make the indexes of the DVRBs mapped to one PRB pair with each other and prevent the block interleaver from being filled with nulls by performing a circular shift only.<sub>DVRB</sub>) Is N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>Limited to common multiples of and D. In this case, by any chance, the diversity order (N) that uses D for the interleaver<sub>DivOrder</sub>= K N<sub>D</sub>), N<sub>DVRB</sub>Is N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>And K N<sub>D</sub>Limited to the common multiple of.</p><p> <Example 17> On the other hand, in FIG. 30, D is set to the number C of columns, and C is N at this time.<sub>DivOrder</sub>= K N<sub>D</sub>It is a figure which shows the case of setting to.</p><p> However, in FIG. 30, after completely filling one column, writing is performed by filling the next column, and after reading one row completely, the next row is read.</p><p> In the example according to FIG. 30, N so that consecutive DVRB indexes are assigned to the same subset.<sub>DVRB</sub>To configure. The illustrated rectangular interleaver has M rows.<sub>RBG</sub><sup>2</sup>If it is a multiple of, it is configured so that consecutive indexes are filled in the same subset. The number of rows is R = N<sub>DVRB</sub>Since it is / D, the number of RBs used for DVRB (N)<sub>DVRB</sub>) Is D M<sub>RBG</sub><sup>2</sup>Limited to multiples of.</p><p> In addition, the number of RBs (N) used in the DVRB to map the two divisions of the DVRB to the same subset of PRBs.<sub>DVRB</sub>) To D M<sub>RBG</sub><sup>2</sup>And N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>It can be limited to the common multiple of. D = K N<sub>D</sub>In the case of K N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>And N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>The common multiple of is K N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>Because it is N<sub>DVRB</sub>Is K N<sub>D</sub> M<sub>RBG</sub><sup>2</sup>Limited to multiples of.</p><p> Ultimately, the number of RBs used as DVRBs can be the maximum number of DVRBs that satisfy the above-mentioned restriction conditions within the number of PRBs in the entire system. The RB used for DVRB can be interleaved and used.</p><p> <Example 18> Hereinafter, as an example according to the present invention,</p><p><chemistry num="26"><img file="JP5048844B2_D0047.tif" /></chemistry>A method of mapping using an extraordinary PRB index when the lengths of are different will be described.</p><p> Figure 31 shows</p><p><chemistry num="27"><img file="JP5048844B2_D0048.tif" /></chemistry>It illustrates a method of finally corresponding to PRB by reprocessing the result of mapping to PRB using the DVRB interleaver shown in FIG. 29 when the lengths of the figures are different.</p><p> The method shown in FIG. 31 can be selected according to the degree of utilization of system resources. In this method, the p-value of the above-mentioned interrelationship expression between the DVRB index and the PRB index is defined as the temporary PRB index. At this time,</p><p><chemistry num="28"><img file="JP5048844B2_D0049.tif" /></chemistry>To a p-value that exceeds</p><p><chemistry num="29"><img file="JP5048844B2_D0050.tif" /></chemistry>Let the value o to which is added be the final PRB index.</p><p> In such a case, the four alignment methods illustrated in (a), (b), (c), and (d) of FIG. 31 can be expressed as mathematical formula 12.</p><p><maths num="12"><img file="JP5048844B2_D0051.tif" /></maths> Here, (a) is justified, (b) is left-aligned, (c) is right-aligned, and (d) is center-aligned. On the other hand, when the PRB index o is given, the DVRB index d can be obtained by the mathematical formula 13 using the temporary PRB index p.</p><p><maths num="13"><img file="JP5048844B2_D0052.tif" /></maths> Further, when the DVRB index d is given, the PRB index o can be obtained by the mathematical formula 14 using the temporary PRB index p.</p><p><maths num="14"><img file="JP5048844B2_D0053.tif" /></maths></p><p><Example 19> Hereinafter, as an example according to the present invention, while satisfying the Gap restriction conditions,</p><p><chemistry num="30"><img file="JP5048844B2_D0054.tif" /></chemistry>The mapping method that can increase the number to the maximum will be described.</p><p> In the above embodiment, when the RBG method and / or the subset method is introduced for LVRB allocation, an interleaver structure for reducing the number of PRBs remaining without mapping some resource elements by DVRB is presented. And the number of RBs used for DVRB (N<sub>DVRB</sub>) Was presented. But M<sub>RBG</sub>The larger the restriction condition by value, the more the total number of PRBs</p><p><chemistry num="31"><img file="JP5048844B2_D0055.tif" /></chemistry>Of these, the number of RBs used for DVRB (N<sub>DVRB</sub>) Becomes more restrictive.</p><p> Figure 32 shows</p><p><chemistry num="32"><img file="JP5048844B2_D0056.tif" /></chemistry>M<sub>RBG</sub>= 3, K = 2, N<sub>D</sub>The case of using a rectangular interleaver with = 2 is shown.</p><p> In Figure 32, to map the two divisions of the DVRB to PRBs that belong to the same subset,</p><p><chemistry num="33"><img file="JP5048844B2_D0057.tif" /></chemistry>Is D M<sub>RBG</sub><sup>2</sup>Set to be a multiple of (= 18), in this case</p><p><chemistry num="34"><img file="JP5048844B2_D0058.tif" /></chemistry>The biggest not to exceed</p><p><chemistry num="35"><img file="JP5048844B2_D0059.tif" /></chemistry>If you ask</p><p><chemistry num="36"><img file="JP5048844B2_D0060.tif" /></chemistry>Will be. In such a case, 32-18 = 14 RBs cannot be used for DVRB.</p><p> At this time,</p><p><chemistry num="37"><img file="JP5048844B2_D0061.tif" /></chemistry>It can be confirmed that DVRB0 is mapped to the first RB of RBG0 and RBG3 belonging to the same subset, respectively.</p><p> Therefore, in the present invention,</p><p><chemistry num="38"><img file="JP5048844B2_D0062.tif" /></chemistry>In the case of, Gap's restriction condition</p><p><chemistry num="39"><img file="JP5048844B2_D0063.tif" /></chemistry>As presented above, we propose a method that satisfies the Gap restriction condition by setting the offset and the critical value (Threshold) to which it is applied, without directly reflecting it in.</p><p> 1) First, set the desired Gap restriction conditions. For example, Gap is M<sub>RBG</sub>Multiple of or M<sub>RBG</sub><sup>2</sup>Can be set to a multiple of.</p><p> 2) Next, out of the number that can meet the Gap restriction condition</p><p><chemistry num="40"><img file="JP5048844B2_D0064.tif" /></chemistry>The number that most closely resembles</p><p><chemistry num="41"><img file="JP5048844B2_D0065.tif" /></chemistry>And set.</p><p> 3) </p><p><chemistry num="42"><img file="JP5048844B2_D0066.tif" /></chemistry>If it is smaller than, the mapping as illustrated in FIG. 20 is applied.</p><p> 4) </p><p><chemistry num="43"><img file="JP5048844B2_D0067.tif" /></chemistry>If it is greater than or equal to and allows nulls in the interleaver</p><p><chemistry num="44"><img file="JP5048844B2_D0068.tif" /></chemistry>become. But if you don't allow nulls in the interleaver</p><p><chemistry num="45"><img file="JP5048844B2_D0069.tif" /></chemistry>become.</p><p> 5) </p><p><chemistry num="46"><img file="JP5048844B2_D0070.tif" /></chemistry>Apply the offset to more than half of. That is, the offset application reference value</p><p><chemistry num="47"><img file="JP5048844B2_D0071.tif" /></chemistry>Set to.</p><p> 6) Set the offset so that the temporary PRB to which the offset is applied meets the Gap restriction condition. That is,</p><p><chemistry num="48"><img file="JP5048844B2_D0072.tif" /></chemistry>become. This can be expressed as the generalized mathematical formula 15.</p><p><maths num="15"><img file="JP5048844B2_D0073.tif" /></maths> Figure 33 shows</p><p><chemistry num="49"><img file="JP5048844B2_D0074.tif" /></chemistry>M<sub>RBG</sub>= 3, K = 2, N<sub>D</sub>This is an example in which the DVRB mapping rule proposed in the present invention is applied when a rectangular interleaver with = 2 is used.</p><p> To map the two divisions of DVRB to PRBs that belong to the same subset</p><p><chemistry num="50"><img file="JP5048844B2_D0075.tif" /></chemistry>Is M<sub>RBG</sub><sup>2</sup>At the same time as satisfying a multiple of (= 9)</p><p><chemistry num="51"><img file="JP5048844B2_D0076.tif" /></chemistry>To be the closest to</p><p><chemistry num="52"><img file="JP5048844B2_D0077.tif" /></chemistry>If you set</p><p><chemistry num="53"><img file="JP5048844B2_D0078.tif" /></chemistry>become. In such a case, (32-18) × 2 = 28 RBs will be used for DVRB. That is,</p><p><chemistry num="54"><img file="JP5048844B2_D0079.tif" /></chemistry>Next,</p><p><chemistry num="55"><img file="JP5048844B2_D0080.tif" /></chemistry>become. Therefore, the index of the extraordinary PRB to which the DVRB index interleaved by the rectangular interleaver is mapped,</p><p><chemistry num="56"><img file="JP5048844B2_D0081.tif" /></chemistry>Compare with.</p><p><chemistry num="57"><img file="JP5048844B2_D0082.tif" /></chemistry>To the index of temporary PRB that meets</p><p><chemistry num="58"><img file="JP5048844B2_D0083.tif" /></chemistry>Is added, as shown in Fig. 33. With reference to FIG. 33, it can be confirmed that the two divisions of DVRB0 are mapped to the first RBs of RBG0 and RBG6 belonging to the same subset. Further, as compared with the method according to FIG. 32, it can be confirmed that the number of RBs that can be used for DVRB increases from 18 to 28 under the same Gap restriction conditions. Also, as the Gap distance increases, diversity in DVRB mapping can be further increased.</p><p><Example 20> Hereinafter, as an example according to the present invention, while mapping continuous indexes to specific positions,</p><p><chemistry num="59"><img file="JP5048844B2_D0084.tif" /></chemistry>The mapping method that can increase the number to the maximum will be described.</p><p> When multiple DVRBs are assigned to one UE, consecutive DVRBs are assigned. Therefore, as mentioned above, the adjacency index is M for LVRB scheduling, as when defining the Gap.<sub>RBG</sub>Multiples of<sub>RBG</sub><sup>2</sup>It is preferable that the positions are set at multiple intervals of. In this case, if the degree of the interleaver is the number of columns C, the number of rows R is M.<sub>RBG</sub>Multiple of or M<sub>RBG</sub><sup>2</sup>Must be a multiple of. Therefore, it is the size of the interleaver</p><p><chemistry num="60"><img file="JP5048844B2_D0085.tif" /></chemistry>Multiple or</p><p><chemistry num="61"><img file="JP5048844B2_D0086.tif" /></chemistry>Must be a multiple of. Therefore,</p><p><chemistry num="62"><img file="JP5048844B2_D0087.tif" /></chemistry>Given in advance, the minimum interleaver size that satisfies these conditions can be determined as follows.</p><p><chemistry num="63"><img file="JP5048844B2_D0088.tif" /></chemistry></p><p> At this time, the number of nulls included in the interleaver is as follows.<chemistry num="64"><img file="JP5048844B2_D0089.tif" /></chemistry></p><p> In the examples described above, the components and features of the present invention are combined in a predetermined form. Each component or feature should be considered as selective unless otherwise explicitly mentioned. Each component or feature can be implemented in a form that does not combine with other components or features. It is also possible to combine some components and / or features to form an embodiment of the present invention. The order of operations described in the examples of the present invention can be changed. A partial configuration or feature of one embodiment may be included in another embodiment or may replace the corresponding configuration or feature of another embodiment. It is self-evident that, within the scope of claims, claims that are not explicitly cited can be combined to form an example, or can be included as a new claim by post-application amendment.</p><p> The embodiments according to the present invention can be embodied by various means such as hardware, firmware, software, or a combination thereof. In the case of hardware implementation, one embodiment of the present invention includes one or more ASICs (Application Specific Integrated Circuits), DSPs (Digital Signal Processors), DSPDs (Digital Signal Processing Devices), PLDs (Programmable Logic Devices). , FPGAs (Field Programmable Gate Arrays), processors, controllers, microcontrollers, microprocessors, etc.</p><p> In the case of realization by firmware or software, one embodiment of the present invention can be embodied in the form of a module, procedure, function or the like that performs the function or operation described above. The software code is stored in a memory unit and can be driven by a processor. This memory unit may be provided inside or outside the processor and exchange data with the processor by various known means.</p><p> It will be obvious to those skilled in the art that the present invention can be embodied in other specific forms without departing from the spirit and essential features of the present invention. Therefore, the above detailed description should not be constrained in any respect and should be considered as an example. The scope of the invention must be determined by a reasonable interpretation of the appended claims, and any modification within the equivalent scope of the invention is within the scope of the invention.</p>
The present invention can be used in transmitters and receivers used in wideband wireless mobile communication systems.
122 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22 Sheet 23 Sheet 24 Sheet 25 Sheet 26 Sheet 27 Sheet 28 Sheet 29 Sheet 30 Sheet 31 Sheet 32 Sheet 33 Sheet 34 Sheet 35 Sheet 36 Sheet 37 Sheet 38 Sheet 39 Sheet 40 Sheet 41 Sheet 42 Sheet 43 Sheet 44 Sheet 45 Sheet 46 Sheet 47 Sheet 48 Sheet 49 Sheet 50 Sheet 51 Sheet 52 Sheet 53 Sheet 54 Sheet 55 Sheet 56 Sheet 57 Sheet 58 Sheet 59 Sheet 60 Sheet 61 Sheet 62 Sheet 63 Sheet 64 Sheet 65 Sheet 66 Sheet 67 Sheet 68 Sheet 69 Sheet 70 Sheet 71 Sheet 72 Sheet 73 Sheet 74 Sheet 75 Sheet 76 Sheet 77 Sheet 78 Sheet 79 Sheet 80 Sheet 81 Sheet 82 Sheet 83 Sheet 84 Sheet 85 Sheet 86 Sheet 87 Sheet 88 Sheet 89 Sheet 90 Sheet 91 Sheet 92 Sheet 93 Sheet 94 Sheet 95 Sheet 96 Sheet 97 Sheet 98 Sheet 99 Sheet 100 Sheet 101 Sheet 102 Sheet 103 Sheet 104 Sheet 105 Sheet 106 Sheet 107 Sheet 108 Sheet 109 Sheet 110 Sheet 111 Sheet 112 Sheet 113 Sheet 114 Sheet 115 Sheet 116 Sheet 117 Sheet 118 Sheet 119 Sheet 120 Sheet 121 Sheet 122
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US11277246B2 | Cited by | United States of America | Search report |
| JP2007288754A | Cites | Japan | – |
| Nortel, Panasonic, LGE,Way Forward on DVRB to PRB index mapping,3GPP TSG-RAN WG1#52,2008年 2月11日,R1-081113 | Non-patent | – | – |
| LG Electronics,DL control signaling for DVRB allocation using compact assignment,3GPP TSG-RAN WG1#52,2008年 2月11日,R1-081007 | Non-patent | – | – |
144 members in 11 offices
Members144
| Document | Office | Kind | |
|---|---|---|---|
| KR100904433B1 | Republic of Korea | B1 | |
| EP2077640A2 | European Patent Office (EPO) | A2 | |
| EP2077641A2 | European Patent Office (EPO) | A2 | |
| EP2077650A2 | European Patent Office (EPO) | A2 | |
| US2009175231A1 | United States of America | A1 | |
| KR20090076779A | Republic of Korea | A | |
| KR20090076780A | Republic of Korea | A | |
| CA2703924A1 | Canada | A1 | |
| CA2711298A1 | Canada | A1 | |
| CA2711319A1 | Canada | A1 | |
| CA2999622A1 | Canada | A1 | |
| CA3157655A1 | Canada | A1 | |
| WO2009088200A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2009088201A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2009088202A2 | World Intellectual Property Organization (WIPO) | A2 | |
| KR100913099B1 | Republic of Korea | B1 | |
| WO2009088201A3 | World Intellectual Property Organization (WIPO) | A3 | |
| WO2009088202A3 | World Intellectual Property Organization (WIPO) | A3 | |
| WO2009088200A3 | World Intellectual Property Organization (WIPO) | A3 | |
| KR100925441B1 | Republic of Korea | B1 | |
| TW200948005A | Taiwan Province of China | A | |
| US2009310475A1 | United States of America | A1 | |
| US2009310476A1 | United States of America | A1 | |
| TW201004250A | Taiwan Province of China | A | |
| TW201004251A | Taiwan Province of China | A | |
| US7729377B2 | United States of America | B2 | |
| US2010195612A1 | United States of America | A1 | |
| US7808949B2 | United States of America | B2 | |
| CN101911508A | China | A | |
| CN101911744A | China | A | |
| CN101911745A | China | A | |
| US2010322182A1 | United States of America | A1 | |
| JP2011504322A | Japan | A | |
| JP2011504336A | Japan | A | |
| US7885230B2 | United States of America | B2 | |
| US2011044270A1 | United States of America | A1 | |
| JP2011507331A | Japan | A | |
| US2011058526A1 | United States of America | A1 | |
| US2011134856A1 | United States of America | A1 | |
| US2011134857A1 | United States of America | A1 | |
| US2011134858A1 | United States of America | A1 | |
| US8018966B2 | United States of America | B2 | |
| RU2010128217A | Russian Federation | A | |
| RU2010128218A | Russian Federation | A | |
| RU2010128219A | Russian Federation | A | |
| US2012163350A1 | United States of America | A1 | |
| EP2077640A3 | European Patent Office (EPO) | A3 | |
| EP2077641A3 | European Patent Office (EPO) | A3 | |
| EP2077650A3 | European Patent Office (EPO) | A3 | |
| JP5048844B2This record | Japan | B2 | |
| US8305988B2 | United States of America | B2 | |
| US8311008B2 | United States of America | B2 | |
| US8315222B2 | United States of America | B2 | |
| JP2012231545A | Japan | A | |
| RU2468511C2 | Russian Federation | C2 | |
| RU2468512C2 | Russian Federation | C2 | |
| JP2012239203A | Japan | A | |
| JP5108954B2 | Japan | B2 | |
| JP5193307B2 | Japan | B2 | |
| CN101911508B | China | B | |
| US8472466B2 | United States of America | B2 | |
| TWI401934B | Taiwan Province of China | B | |
| RU2488219C2 | Russian Federation | C2 | |
| CN101911745B | China | B | |
| CN103220107A | China | A | |
| CA2711319C | Canada | C | |
| CN103269258A | China | A | |
| CA2703924C | Canada | C | |
| CN103326846A | China | A | |
| CN101911744B | China | B | |
| TWI413390B | Taiwan Province of China | B | |
| RU2012118987A | Russian Federation | A | |
| US8599775B2 | United States of America | B2 | |
| US8611290B2 | United States of America | B2 | |
| CN103457712A | China | A | |
| US2013343363A1 | United States of America | A1 | |
| TW201404104A | Taiwan Province of China | A | |
| US8634388B2 | United States of America | B2 | |
| US2014036834A1 | United States of America | A1 | |
| JP5497857B2 | Japan | B2 | |
| JP5512756B2 | Japan | B2 | |
| RU2518934C2 | Russian Federation | C2 | |
| RU2012152805A | Russian Federation | A | |
| JP2014143705A | Japan | A | |
| TWI450550B | Taiwan Province of China | B | |
| JP2014161030A | Japan | A | |
| RU2013125538A | Russian Federation | A | |
| US8982854B2 | United States of America | B2 | |
| RU2556389C2 | Russian Federation | C2 | |
| CN103326846B | China | B | |
| US2015208406A1 | United States of America | A1 | |
| TWI505685B | Taiwan Province of China | B | |
| US9185701B2 | United States of America | B2 | |
| TW201545521A | Taiwan Province of China | A | |
| US2016037516A1 | United States of America | A1 | |
| JP5863864B2 | Japan | B2 | |
| US2016113032A1 | United States of America | A1 | |
| US9408226B2 | United States of America | B2 | |
| CN103457712B | China | B | |
| JP5982415B2 | Japan | B2 |
21 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Certificate of patent or registration of utility modelJAPANESE INTERMEDIATE CODE: R150R150 | R150 | |
| Certificate of patent or registration of utility modelJAPANESE INTERMEDIATE CODE: R150R150 | R150 | |
| First payment of annual fees (during grant procedure)JAPANESE INTERMEDIATE CODE: A61A61 | A61 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Report on retrievalJAPANESE INTERMEDIATE CODE: A971007A977 | A977 | |
| Decision of grant or rejection writtenTRDD | TRDD | |
| Request for written amendment filedJAPANESE INTERMEDIATE CODE: A523A521 | A521 |
Numbers
- Publication
- 5048844
- Application
- 2010536863
Titles2
- Japanese
- 分散型仮想リソースブロックのスケジューリング方法
- English
- Scheduling method for distributed virtual resource blocks
Classification
- CPC, 14
- H04B7/12
- H04L1/0071
- H04W72/0446
- H04L5/0007
- H04L5/0028
- H04L5/0039
- H04L5/0041
- H04L5/0044
- H04L5/006
- H04L5/0064
- H04L5/0085
- H04L5/0092
- H04L5/0037
- H04W88/08
- IPC, 2
- H04J11 00
- H04J1 00
