KR20130031604A - Transmission point, resource allocation method, user equipment, and resource allocation information receiving method - Google Patents

Abstract

PURPOSE: A transmission end, a resource allocation method, a terminal, and a resource allocation information receiving method are provided to efficiently perform resource allocation. CONSTITUTION: An encoder(1002) generates resource allocation information in which a length index and an offset of a cluster are converted. The length index expresses one or more resource blocks or the length of the cluster which resource block groups are continued. A transmitter(1003) transmits the resource allocation information to a terminal. The length of the cluster is expressed with the number of resource blocks or resource block groups. [Reference numerals] (1001) Preprocessor; (1002) Encoder; (1003) Transmitter

Description

Transmission Point, Resource Allocation Method, UE, and Resource Allocation Information Receiving Method {Transmission Point, Resource Allocation Method, User Equipment, and Resource Allocation Information Receiving Method}

The present invention relates to resource allocation in a wireless communication system.

In a wireless communication system, one of the basic principles of a wireless connection is that shared channel transmission, that is, time-frequency resources can be dynamically shared between user terminals. To this end, the transmitting end may control allocation of uplink and downlink resources. Information about such resource allocation may be transmitted from a transmitting end to a terminal through a control channel, and the control channel is located in a predetermined control region separated from the data region in downlink time-frequency space.

In order to improve the performance of a wireless communication system, technologies such as multiple-input multiple-output (MIMO) and coordinated multi-point transmission / reception (CoMP) have been considered. More control information may be required to use this technique. However, the limited control region may be insufficient to include many control channels through which resource allocation information is transmitted.

An object of the present invention is to provide an apparatus and method for efficient resource allocation in a wireless communication system.

In order to achieve the above object, an embodiment of the present invention includes an encoder for generating resource allocation information obtained by converting a length index indicating the length of a cluster in which one or more resource blocks or resource block groups are consecutive and the offset of the cluster; And a transmitter for transmitting the resource allocation information to a terminal, wherein the length of the cluster is expressed by the number of resource blocks or resource block groups, and the number is a multiple of a predetermined real number. do.

According to another embodiment of the present invention, an encoding step of generating resource allocation information obtained by converting a length index indicating a length of a cluster in which one or more resource blocks or resource block groups are continuous and an offset of the clusters; And transmitting the resource allocation information to a terminal, wherein the length of the cluster is expressed by the number of resource blocks or resource block groups, and the number is a multiple of a predetermined real number. To provide.

Another embodiment of the present invention includes a receiver for receiving resource allocation information encoded with information on resources allocated for a cluster; And a decoder for decoding the resource allocation information to extract the length index of the cluster and the offset of the cluster, and converting the length index of the cluster to the length of the cluster, wherein the length of the cluster is a resource block or a resource block. Expressed as the number of groups, the number provides a terminal multiple times a predetermined real number.

Another embodiment of the present invention, the receiving step of receiving the resource allocation information encoded information on the resources allocated for the cluster; And a decoding step of decoding the resource allocation information to extract the length index of the cluster and the offset of the cluster, and converting the length index of the cluster to the length of the cluster, wherein the length of the cluster is a resource block or resource. Represented by the number of block groups, the number is a multiple of the predetermined real number provides a method for receiving resource allocation information.

1 illustrates a communication system to which embodiments of the present invention are applied.
2 shows a subframe in which downlink transmission is performed.
3 (a) illustrates a type 0 resource allocation scheme, FIG. 3 (b) illustrates a type 1 resource allocation scheme, and FIG. 3 (c) illustrates a type 2 resource allocation scheme.
4 shows an example of using a portion of the data area 202 for control information.
5 shows another example when a part of the data area 202 is used for control information.
6 shows the possible cluster lengths when N = 10 as an example.
FIG. 7 shows, as an example, the positional change of the cluster and thus the offset j of the cluster when the length of the cluster is 4 (i = 2).
8 is a flowchart illustrating a method of transmitting resource allocation information by a transmitter according to an embodiment.
9 is a flowchart illustrating a method for receiving resource allocation information of a terminal according to an embodiment.
10 is a block diagram illustrating a configuration of a transmission stage according to an embodiment.
11 is a block diagram illustrating a configuration of a terminal according to an embodiment.
12 is a block diagram illustrating a configuration of a terminal according to another embodiment.

Hereinafter, some embodiments of the present invention will be described in detail with reference to exemplary drawings. In adding reference numerals to the components of each drawing, it should be noted that the same reference numerals are assigned to the same components as much as possible even though they are shown in different drawings. In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.

1 illustrates a communication system to which embodiments of the present invention are applied.

Communication systems are widely deployed to provide various communication services such as voice, packet data, and the like.

Referring to FIG. 1, a communication system includes a user equipment (UE) 10 and a transmission point 20 that performs uplink and downlink communication with the terminal 10.

In the present specification, the terminal 10 or a user equipment (UE) is a comprehensive concept that means a user terminal in wireless communication. In addition to the UE in WCDMA, LTE, and HSPA, as well as a mobile station (MS) and a UT (GSM) in GSM, It should be interpreted as a concept that includes a user terminal, a subscriber station (SS), and a wireless device.

The transmitting end 20 or cell generally refers to a station communicating with the terminal 10, and includes a base station, a node-B, an evolved node-B, and a base transceiver. It may be called other terms such as a System, an Access Point, a Relay Node, and the like.

In the present specification, the transmission terminal 20 or a cell should be interpreted in a comprehensive sense indicating a part of a region covered by a base station controller (BSC) in a CDMA, a NodeB of a WCDMA, etc., and a radio remote connected to a base station. Comprehensive means any type of device that can communicate with a single terminal, such as a head, relay node, a sector of a macro cell, a site, or a micro cell such as a femtocell or picocell. Used as a concept.

In the present specification, the terminal 10 and the transmitting terminal 20 are used as a transmitting and receiving entity used in implementing the technology or the technical idea described in this specification in a comprehensive sense and are not limited to the terms or words specifically referred to.

Although one terminal 10 and one transmission terminal 20 are shown in FIG. 1, the present invention is not limited thereto. It is possible for one transmission terminal 20 to communicate with the plurality of terminals 10, and one terminal 10 may communicate with the plurality of transmission terminals 20.

There are no limitations to the multiple access scheme applied to a communication system, and the present invention provides the code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal frequency division multiple access (OFDMA), and OFDM. Applicable to various multiple access schemes such as FDMA, OFDM-TDMA, and OFDM-CDMA.

In addition, the present invention is a combination of the TDD (Time Division Duplex) method is transmitted using a different time, uplink transmission and downlink transmission, FDD (Frequency Division Duplex) method is transmitted using a different frequency, combining the TDD and FDD Applicable to hybrid duplexing method.

Specifically, embodiments of the present invention are applicable to asynchronous wireless communication that evolves into Long Term Evolution (LTE) and LTE-advanced through GSM, WCDMA, HSPA, and synchronous wireless communication that evolves into CDMA, CDMA-2000, and UMB. Can be. The present invention should not be construed as being limited or limited to a specific wireless communication field, but should be interpreted as including all technical fields to which the spirit of the present invention can be applied.

The terminal 10 and the transmitting end 20 may perform downlink wireless communication.

In wireless communication, one radioframe or radio frame consists of 10 subframes, and one subframe consists of two slots. The radio frame has a length of 10 ms and the subframe has a length of 1.0 ms. In general, a basic unit of data transmission is a subframe unit, and downlink or uplink scheduling is performed in units of subframes.

One slot may have a plurality of OFDM symbols in the time domain and include at least one subcarrier in the frequency domain. For example, a slot may include seven OFDM symbols (in the case of the Normal Cyclic Prefix) or six OFDM symbols in the time domain and may include 12 subcarriers in the frequency domain. The time-frequency domain defined as one slot may be referred to as a resource block (RB), but is not limited thereto.

The transmitting end 20 may perform downlink transmission to the terminal 10. The transmitter 20 may transmit a physical downlink shared channel (PDSCH) as a downlink data channel for unicast transmission. In addition, the transmitter 20 may schedule downlink control information such as scheduling required for reception of the PDSCH and transmission for uplink data channel (for example, a physical uplink shared channel (PUSCH)). Indicator for distinguishing a physical downlink control channel (PDCCH) as a downlink control channel used for transmitting downlink control information (DCI) including grant information, a region of a PDSCH and a PDCCH Physical Control Format Indicator Channel (PCFICH) for transmitting the PHY, Physical HARQ Indicator Channel (PHICH) for transmitting the HARQ (Hybrid Automatic Repeat request) for uplink transmission The control channel can be transmitted. Hereinafter, the transmission / reception of a signal through each channel will be described in a form in which the corresponding channel is transmitted / received.

2 shows a subframe in which downlink transmission is performed. In FIG. 2, the horizontal axis represents time (symbol) and the vertical axis represents frequency. In one subframe, the initial 1 to 3 symbols may be set to the control region 201 through which control information is transmitted. The control region 201 may include a control channel such as PDCCH, PCFICH, PHICH, and the like. The remaining area in the subframe may be set as the data area 202. The data area 202 may include a data channel such as a PDSCH. Resource allocation information on frequency and time resources allocated to each terminal in the data region 202 may be transmitted through a PDCCH.

In the LTE / LTE-A wireless communication system, information and control information on uplink / downlink resource allocation is performed through the PDCCH. The PDCCH may be allocated in a control channel element (CCE) unit in the control region 201. One CCE consists of nine Resource Element Groups (REGs), one REG is 8 bits, and one CCE consists of 72 bits. The number of CCEs to which the PDCCH is allocated can be increased by an exponential function to 1, 2, 4, or 8 with different aggregation levels depending on the situation.

Downlink Control Information (DCI), which is control information transmitted through the PDCCH, may include information of a resource region for resource allocation.

The resource region for resource allocation may be configured as a time frequency unit of a resource block (RB). Alternatively, in the case of broadband, since the number of resource blocks increases, a bit request amount for indicating resource allocation information may increase, and thus, several resource blocks may be combined to allocate resources in units of a resource block group (RBG). . Resource allocation information represented by a resource block or a resource block group may be transmitted in the form of a resource indication value (RIV) in a resource allocation field in a PDCCH.

For example, the bandwidth considered in LTE is 1.4 / 3/5/10/15/20 MHz, and these may be represented as 6/15/25/50/75/100 as the number of resource blocks. The size P of the resource block group represented by the number of resource blocks in each band is 1/2/2/3/4/4. Therefore, the number of resource block groups corresponding to each band is 6/8/13/17/19/25.

There may be a type 0, a type 1, a type 2, and the like according to a method in which resource allocation information is expressed in the above-described resource allocation field.

3 (a) illustrates a type 0 resource allocation scheme, FIG. 3 (b) illustrates a type 1 resource allocation scheme, and FIG. 3 (c) illustrates a type 2 resource allocation scheme.

일 때

가 된다.Referring to the exemplary diagram of FIG. 3A, the type 0 resource allocation method is a method of representing a resource allocation area in the form of a bitmap. For each resource block or resource block group, the resource block (or resource block group) to which the resource is allocated is represented by 1, and the resource block (or resource block group) that is not allocated to the resource is represented by 0. Resource allocation for a group). The amount of bits required when a resource allocation is represented by this type 0 is determined by the number of resource blocks.

when

.

비트는 이러한 주기(P)를 갖는 서브셋의 크기를 나타내고, 1비트가 오프셋을 나타내어, 필요한 비트양은

가 된다. 이러한 타입 1의 비트양은 타입 0의 비트양과 동일하게 사용하도록 설계될 수 있다. 타입 0과 타입 1이 같이 사용되는 경우, 타입 0과 타입 1을 구분하기 위한 구분 비트(differential bit)가 추가될 수 있다.Referring to the exemplary diagram of FIG. 3 (b), the type 1 resource allocation scheme is a scheme for indicating a resource allocation region in a periodic form. When a resource block to which a resource is allocated is distributed in the entire resource area at regular intervals (P),

The bits represent the size of the subset having this period P and one bit represents the offset, so the amount of bits required

. This type 1 bit amount can be designed to use the same amount of type 0 bit amount. When type 0 and type 1 are used together, a differential bit for distinguishing type 0 and type 1 may be added.

이다. Referring to the exemplary diagram of FIG. 3 (c), the type 2 resource allocation scheme is a scheme used when allocating resource regions having a continuous length. In the case of type 2, the RIV is expressed as an offset from the start point of a continuous resource allocation area (hereinafter referred to as "cluster") in the entire resource area and the length of the resource allocation area. Whereas type 0 and type 1 represent non-contiguous resource allocations, type 2 represents only contiguous resource regions and requires only a large amount of resource blocks for type 0 and type 1 in a large number of resource blocks in a system having a large bandwidth. Small compared to The bit requirement required in this type 2 is

to be.

In order to improve the performance of a wireless communication system, technologies such as multiple-input multiple-output (MIMO) and coordinated multi-point transmission / reception (CoMP) are being considered. When applying this technique, more control information may be required. Resources of the control region 201 may be insufficient for allocating a plurality of PDCCHs for transmitting control information.

In order to increase the maximum number of PDCCHs in the control region 201, it may be considered to increase the efficiency of the existing control region. It may be considered to simply define a newly defined PDCCH existing in the existing control region. That is, the smaller the payload length of the DCI format of the PDCCH may be considered to reduce the size of the payload in consideration of the characteristics that the code rate in terms of the encoder is lowered and the performance is increased. If the code rate is relatively large, the aggregation level is increased for a terminal having a poor channel situation, thereby increasing the number of CCEs occupying in the existing control region and reducing the maximum number of PDCCHs possible in the control region as a whole. The compact PDCCH may serve to prevent this increase in aggregation level as much as possible. When comparing the conventional PDCCH with the simple PDCCH, it is necessary to shorten each field of the DCI format, and compression in a resource allocation area becomes essential.

Alternatively, in order to solve the space problem of the insufficient control area 201, a part of the data area 202 may be used for control information.

4 shows an example of using a portion of the data area 202 for control information. In the data area 202, an extended PDCCH (E-PDCCH) 402 including resource allocation information and control information of the PDSCH 401 is allocated. In the control region 201, there is a PDCCH 403 including information on resources to which the extended PDCCH 402 is allocated. The PDCCH 403 includes or minimally includes resource allocation information and other control information of the PDSCH 401 (or PUSCH), and the allocation information and related control information of the extended PDCCH 402 (e.g., Modulation and Coding Schemes, MIMO schemes, etc.) can be made smaller than the conventional PDCCH. The terminal finds the PDCCH 403 allocated to the user through blind decoding in the search space in the control region 201, and the PDCCH 403 provides information about a resource allocated to the extended PDCCH 402. In the case of including a PDCCH, the extended PDCCH 402 is read using the PDCCH. The UE may grasp information on a resource to which the PDSCH 401 (or PUSCH) is allocated through the extended PDCCH 402.

5 shows another example when a part of the data area 202 is used for control information. In the data area 202, an extended PDCCH search space 502 to which an extended PDCCH including resource allocation information and control information of the PDSCH 501 (or PUSCH) is allocated is set. A plurality of control information may be located in the extended PDCCH search space 502. In the control region 201, there are PDCCHs 503 and 504 that contain information about resources to which the extended PDCCH search space 502 is allocated. The PDCCHs 503 and 504 may include or minimally include resource allocation information and other control information of the PDSCH 501 and include allocation information and related control information (MCS, MIMO scheme, etc.) of the extended PDCCH search space 502. The size can be made smaller than that of the conventional PDCCH. The plurality of PDCCHs 503 and 504 may designate the same extended PDCCH search space 502. The UE finds the PDCCHs 503 and 504 allocated to the user through blind decoding in the search space in the control region 201, and the PDCCHs 503 and 504 are assigned to resources allocated to the extended PDCCH search space 502. In the case of a PDCCH including information, the location of the extended PDCCH search space 502 can be known using the information. The UE may find an extended PDCCH allocated to itself through blind decoding in the extended PDCCH search space 502 and use the same to grasp information on a resource allocated to the PDSCH 501 (or PUSCH).

In the examples of FIGS. 4 and 5, the PDCCH including resource allocation information for the extended PDCCH or extended PDCCH search space needs to be distinguished from the existing PDCCH, and in this specification, resource allocation for the extended PDCCH or extended PDCCH search space. A PDCCH including information will be referred to as an indication PDCCH. The indication PDCCH and the existing PDCCH may be distinguished by a newly defined transmission mode, or may be distinguished by classification information included in the PDCCH to distinguish the indication PDCCH and the existing PDCCH.

The increase of the aggregation level for the extended PDCCH may be controlled by the expansion of resource allocation of the extended PDCCH indicated by the indicated PDCCH. For example, if the amount of resources allocated to the extended PDCCH is doubled, the corresponding aggregation level may be doubled. At this time, the increase of the aggregation level is not linear (for example, 1,2,3,4 ……) but exponentially (1,2,4,8 ……).

The indication PDCCH may exist in a common search space in a common search space in a control region and be commonly transmitted to terminals, or may exist in a UE specific search space and be transmitted for each terminal. It may be.

The above-described resource allocation and search space designation may coincide with the order and arrangement of actual physical resource allocation, or may have a dual structure corresponding to logical resources and secondaryly mapped to physical resources.

In the continuous resource allocation of the above-described example, the continuous resource allocation area (cluster) is capable of all continuous resource allocations of length consisting of integer multiples of resource allocation units (resource blocks or resource block groups). That is, for continuous resource allocation for the PDSCH of FIG. 2, continuous resource allocation for the extended PDCCH of FIG. 4, or continuous resource allocation for the extended PDCCH search space of FIG. 5, the resource allocation type 2 is used to transmit the PDCCH. The transmitted DCI may indicate a possible case for all consecutive resource allocations consisting of integer multiples of resource allocation units.

However, as described above, in order to reduce the size of the PDCCH for transmitting resource allocation information of the PDSCH (or PUSCH) in FIG. 2 and the indication PDCCH in FIGS. 4 and 5, it may be required to reduce the size of the resource allocation information. have. Meanwhile, in FIG. 4 and FIG. 5, the size of the extended PDCCH may increase exponentially.

In continuous resource allocation according to the following embodiments, the resource allocation area is made possible only for a specific length.

The length of the possible resource allocation area is in the form of a sequence that increases exponentially. In this case, the length of the resource allocation region can be expressed by Equation 1 below.

[Equation 1]

가 된다. 예를 들면, N=100(N은 자원 블록 또는 자원 블록 그룹의 개수)인 경우, f(7)=128로 100을 초과하므로, 0≤i≤6인 경우에만 f(i)의 값이 정의된다. 이와 같이 최대값으로 i=6까지의 자원 할당을 고려할 수 있지만 이보다 작은 최대값을 가정할 수도 있다. 예를 들면, i=3까지를 고려하면 f(0)=1, f(1)=2, f(2)=4, f(3)=8의 4가지 경우에 대하여만 클러스터의 길이가 가능하다. 이하에서 클러스터의 길이를 나타내는 정수 i를 클러스터의 길이 인덱스로 부르기로 한다. In Equation 1, f (i) is the length of a continuous resource allocation area (cluster), and A, B, and C are real numbers. As an example, when A = 1, B = 2, and C = 1,

. For example, in the case of N = 100 (N is the number of resource blocks or resource block groups), f (7) = 128 exceeds 100, so the value of f (i) is defined only when 0≤i≤6. do. As such, resource allocation up to i = 6 may be considered as the maximum value, but a smaller maximum value may be assumed. For example, considering i = 3, the cluster length is possible only in four cases, f (0) = 1, f (1) = 2, f (2) = 4, f (3) = 8. Do. Hereinafter, an integer i representing the length of the cluster will be referred to as a length index of the cluster.

6 shows the possible cluster lengths when N = 10 as an example. In the example of FIG. 6, the length index i has a value of 0 to 3, and the length of the cluster has one of 1, 2, 4, and 8.

In the example of FIG. 6, the position of the cluster may change, and the position of the cluster may be represented by an offset of the cluster, which may be represented by an index of the first resource allocation unit (resource block or resource block group) of the cluster.

FIG. 7 shows, as an example, the positional change of the cluster and thus the offset j of the cluster when the length of the cluster is 4 (i = 2). Referring to FIG. 7, when the length of the cluster is 4, it can be seen that the offset j of the cluster has a value of 0 to 6. FIG.

In general, the offset j of the cluster may have a value from 0 to N-2 ⁱ . When N = 10, when the length index i of the cluster is 0 (when the length of the cluster is 1), the offset j of the cluster may be ten from 0 to 9, and the length index i of the cluster may be If 1 (the cluster length is 2), the cluster's offsets (j) can be nine (0 to 8), and if the cluster's length index (i) is 2 (the cluster's length is 4), Seven offsets j may be 0 to 6, and when the length index i of the cluster is 3 (the length of the cluster is 8), three offsets j of the cluster may be 0 to 2. Therefore, all 29 (= 10 + 9 + 7 + 3) resource allocations are possible.

RIV, a value for indicating the allocated resource, may be calculated based on the length index (i) and the offset (j) of the cluster. Since the length of the cluster is limited to a specific value (eg, power of 2), the maximum value of the RIV may be reduced as compared to the type 2 described above. In addition, if the offset is further limited, the maximum value of the RIV may be further reduced.

As an example, the number is assigned from the case where the offset j is small for a constant length index i, and the number is assigned from the case where the offset j is small for the next length index i when the assignment is made to all offsets. You can consider the case of assignment. For example, when N = 10, when length index i = 0, a value of RIV = 0 ~ 9 is assigned to resource allocation by 10 offsets (j = 0-9), and when length index i = 1 A value of RIV = 10 to 18 is assigned to resource allocation by nine offsets (j = 0 to 8), and RIV = to resource allocation by seven offsets (j = 0 to 6) when length index i = 2. A value of 19 to 25 can be assigned, and a value of RIV = 26 to 28 can be assigned to resource allocation by three offsets (j = 0-2) when the length index i = 3.

In this case, in general, the resource allocation RIV may be represented by Equation 2 below.

&Quot; (2) "

이 되고, 자원 할당을 위해 필요한 비트양은

가 된다. 길이 인덱스(i)의 최대값(i_max)은 0 내지

의 값을 가질 수 있다.In Equation 2, when the maximum value of the length index (i) is i _max , the maximum value of RIV (RIV _max ) is

The amount of bits needed for resource allocation

. The maximum value i _max of the length index i is 0 to

It can have a value of.

As another example, the number is assigned from the case where the offset j is small for the constant length index i, but the number is assumed to be 0 to N-1 with 0 offsets for all the length index i. Consider the case of assigning. For example, when N = 10, when length index i = 0, a value of RIV = 0 ~ 9 is assigned to resource allocation by 10 offsets (j = 0-9), and when length index i = 1 A value of RIV = 10 to 18 is assigned to resource allocation by nine offsets (j = 0 to 8), and RIV = to resource allocation by seven offsets (j = 0 to 6) when length index i = 2. A value of 20 to 26 can be assigned, and a value of RIV = 30 to 32 can be assigned to resource allocation by three offsets (j = 0 to 2) when the length index j = 3.

In this case, in general, the resource allocation RIV may be expressed as Equation 3 below.

&Quot; (3) "

,

,

이 되고, 자원 할당을 위해 필요한 비트양은

가 된다. 길이 인덱스(i)의 최대값(i_max)은 0 내지

의 값을 가질 수 있다.In Equation 3, when the maximum value of the length index (i) is i _max , the maximum value of RIV (RIV _max ) is

The amount of bits needed for resource allocation

. The maximum value i _max of the length index i is 0 to

It can have a value of.

Equation 3 is less efficient than Equation 2 (although the value of RIV _max is large), but the expression is excellent in simplicity and convenience.

As another example, when resource allocation is not made in the range of all resources and the length of resource allocation is made in half of the range of all resources, it is efficient to express the resource allocation RIV as shown in Equation 4 below.

&Quot; (4) "

,

,

The above-described resource allocation may be performed in the case of allocating a resource for PDSCH (in case of FIG. 2), in case of allocating a resource for extended PDCCH (in case of FIG. 4), or in case of allocating a resource for extended PDCCH search space (FIG. 5). In the case of In particular, the resource allocation of the extended PDCCH may increase the aggregation level in an odd form rather than linearly changing the allocation range. In this case, the above-described resource allocation type is advantageous over the above-described resource allocation type 2.

Table 1 below compares the bit requirements required for downlink type 2 resource allocation and the bit requirements required for resource allocation having a power length in the above-described embodiment for each band.

[Table 1]

Referring to Table 1, it can be seen that the bit request amount required in the power-type resource allocation of the above-described embodiment is 1 to 3 bits smaller than the bit request amount required in the conventional downlink type 2 resource allocation.

8 is a flowchart illustrating a method of transmitting resource allocation information by a transmitter according to an embodiment.

Referring to FIG. 8, the scheduler of the transmitter sets a length and an offset of a cluster allocated to the data area (S801). In this case, the cluster may be a resource to which the PDSCH (or PUSCH) shown in FIG. 2 is allocated, a resource to which the extended PDCCH shown in FIG. 4 is allocated, or a resource allocated to the extended PDCCH search space shown in FIG. 5. The length of the cluster may be limited within a specific value. As described above, the length may be expressed by the number of unit resource blocks or unit resource block groups, and the number may be a power of a predetermined real number. For example, the length of the cluster may be 2 ⁱ (i is an integer of 0 or more) resource blocks.

Next, the transmitter calculates values of the length index i and the offset j from the set length and offset of the cluster (S802). The length index i is one-to-one corresponding to the length of the cluster. For example, when the length of the cluster is 2 ⁱ resource blocks, i may be extracted as the length index. The offset j may be the index of the first resource block or resource block group of the cluster.

The transmitting end calculates the value of RIV using the calculated length index i and the offset j (S803). RIV may be calculated using one of Equations 2 to 4 described above. However, the present invention is not limited to the above Equations 2 to 4, and various functions may be applied in which the length index i and the offset j may be uniquely determined from the RIV.

The calculated value of the RIV is configured and transmitted in the resource allocation field in the PDCCH (S804).

In this case, the PDCCH may be a PDCCH including resource allocation information of the PDSCH (or PUSCH), which has a shorter length than that of the conventional PDCCH. PDCCH having a shortened length and a conventional PDCCH may be executed under a newly defined transmission mode. The transmitting end may transmit configuration information on whether to transmit a PDCCH having a reduced length or a conventional PDCCH to the UE before transmitting the PDCCH. Alternatively, classification information indicating whether the PDCCH is a PDCCH having a reduced length or a conventional PDCCH may be included in the PDCCH. After receiving the PDCCH, the UE may identify the type of the PDCCH through the classification information and extract the PDSCH allocation information. Alternatively, a PDCCH having an abbreviated length and a conventional PDCCH may have different lengths, and the terminal may grasp the type of the PDCCH from the length of the PDCCH and extract PDSCH allocation information.

Alternatively, the PDCCH may be an indication PDCCH including resource allocation information of an extended PDCCH or an extended PDCCH search space. The indication PDCCH may provide resource allocation and related control information (MCS, MIMO scheme, etc.) of the extended PDCCH or the extended PDCCH search space. The indication PDCCH and the conventional PDCCH may be executed under a newly defined transmission mode. The transmitting end may transmit setting information on whether to transmit an indication PDCCH or a conventional PDCCH to the terminal before transmitting the PDCCH. Alternatively, division information indicating whether the PDCCH is an indication PDCCH or a conventional PDCCH may be included in the PDCCH. After receiving the PDCCH, the UE may identify the type of the PDCCH through the classification information and extract the PDSCH allocation information. Alternatively, the indicated PDCCH and the conventional PDCCH may have different lengths, and the terminal may grasp the type of the PDCCH from the length of the PDCCH and extract the PDSCH allocation information.

The transmitting end transmits the configured PDCCH (S805).

9 is a flowchart illustrating a method for receiving resource allocation information of a terminal according to an embodiment.

The terminal receives the PDCCH from the transmitting terminal (S901). The received PDCCH may be an abbreviated length PDCCH or indication PDCCH. The RIV value is extracted from the resource allocation information field in the PDCCH (S902). The length index i and the offset j are extracted by decoding the extracted value of the RIV (S903). The length and offset of the allocated resource (cluster) may be extracted from the extracted length index i and the offset j (S904). In this case, the allocated resource may be a PDSCH (or PUSCH), an extended PDCCH, or an extended PDCCH search space.

10 is a block diagram illustrating a configuration of a transmission stage according to an embodiment.

Referring to FIG. 10, the transmitting end may include a preprocessor 1001, an encoder 1002, and a transmitter 1003.

The preprocessor 1001 receives information of the total number N of resource blocks or resource block groups, the length and offset of the cluster set in the data area, and the total number of resource blocks or resource block groups. (N) and the above-described length index i and offset j are output. The cluster may be a resource allocated to a PDSCH (or PUSCH), a resource allocated to an extended PDCCH, or a resource allocated to an extended PDCCH search space.

The encoder 1002 calculates an RIV based on the total number N of resource blocks or resource block groups, the length index i, and the offset j. The value of RIV may be calculated using any one of Equations 2 to 4 described above.

The transmitter 1003 sends the calculated RIV. The value of the RIV may be included in the DCI and transmitted through the PDCCH.

11 is a block diagram illustrating a configuration of a terminal according to an embodiment.

Referring to FIG. 11, the terminal may include a receiver 1101, a decoder 1102, and a postprocessor 1103.

The receiver 1101 receives a signal including control information (PDCCH) from the transmitting end, and extracts the RIV from the control information. In the example of FIG. 11, the RIV has information about a resource allocated to a PDSCH (or PUSCH).

The decoder 1102 decodes the RIV to calculate the length index i and the offset j.

The post processor 1103 extracts the length and offset of the resource to which the PDSCH (or PUSCH) is allocated from the length index i and the offset j. Thus, it is possible to know information about resources to which data channels such as PDSCH and PUSCH are allocated.

12 is a block diagram illustrating a configuration of a terminal according to another embodiment.

Referring to FIG. 12, the terminal may include a receiver 1201, a decoder 1202, a post processor 1203, and an extended PDCCH extractor 1204.

The receiver 1201 receives a signal including control information (PDCCH) from the transmitting end and extracts the RIV from the control information. In the example of FIG. 12, the RIV has information about resources allocated to the extended PDCCH or resources allocated to the extended PDCCH search space.

Decoder 1202 decodes RIV to calculate length index i and offset j.

The postprocessor 1203 extracts the length and offset of the resource to which the extended PDCCH is allocated or the resource to which the extended PDCCH search space is allocated from the length index i and the offset j.

If the length and offset are for a resource to which the extended PDCCH is allocated, the extended PDCCH extractor 1204 extracts resource allocation information of the PDSCH (or PUSCH) from the extended PDCCH. If the length and offset are for a resource to which the extended PDCCH search space is allocated, the extended PDCCH extractor 1204 performs blind decoding in the extended PDCCH search space to find the extended PDCCH set to the UE. Resource allocation information of the PDSCH (or PUSCH) is extracted from the extended PDCCH. Thus, it is possible to know information about resources to which data channels such as PDSCH and PUSCH are allocated.

Although the above embodiments have described resource allocation information for information on resources allocated to a channel such as PDSCH and extended PDCCH in downlink, the present invention is not limited thereto and may be applied to resource allocation in uplink. . Although the above-described embodiments have described that the resource allocation information calculated from the length index and the offset is included in the PDCCH, the present invention is not limited thereto, and the resource allocation information calculated from the length index and the offset includes the extended PDCCH, R-PDCCH, and the like. It is also possible to apply to other control channels.

The foregoing description is merely illustrative of the technical idea of the present invention, and various changes and modifications may be made by those skilled in the art without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are intended to illustrate rather than limit the scope of the present invention, and the scope of the technical idea of the present invention is not limited by these embodiments. The protection scope of the present invention should be interpreted by the following claims, and all technical ideas within the equivalent scope should be interpreted as being included in the scope of the present invention.

Claims (32)

An encoder for generating a length index indicating the length of a cluster in which one or more resource blocks or resource block groups are contiguous and resource allocation information obtained by converting the offset of the cluster; And
And a transmitter for transmitting the resource allocation information to a terminal.
And the length of the cluster is expressed by the number of resource blocks or resource block groups, and the number is a multiple of a predetermined real number. The method of claim 1,
And the length of the cluster is 2 ⁱ (i is an integer of 0 or more) times the resource block or resource block group, and i is a length index. The method of claim 2,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 2,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 2,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 1,
And the cluster is a resource allocated to a downlink data channel. The method of claim 1,
And the cluster is a resource allocated to a control channel configured in a downlink data region. The method of claim 1,
And the cluster is a resource allocated to a control channel search region configured in a downlink data region. An encoding step of generating at least one resource block or a group of resource block groups, the length index indicating the length of the continuous cluster and the resource allocation information obtained by converting the offset of the cluster; And
A transmission step of transmitting the resource allocation information to a terminal;
The length of the cluster is represented by the number of resource blocks or resource block groups, and the number is a multiple of a predetermined real number. The method of claim 9,
Wherein the length of the cluster is 2 ⁱ (i is an integer of 0 or more) times the resource block or resource block group, and i is a length index. 11. The method of claim 10,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. 11. The method of claim 10,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. 11. The method of claim 10,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 9,
And the cluster is a resource allocated to a downlink data channel. The method of claim 9,
And the cluster is a resource allocated to a control channel configured in a downlink data region. The method of claim 9,
And the cluster is a resource allocated to a control channel search region configured in a downlink data region. A receiver for receiving resource allocation information encoded with information about resources allocated for the cluster; And
And a decoder configured to decode the resource allocation information to extract the length index of the cluster and the offset of the cluster, and convert the length index of the cluster to the length of the cluster.
The length of the cluster is represented by the number of resource blocks or resource block groups, and the number is a multiple of a predetermined real number. The method of claim 17,
The length of the cluster is 2 ⁱ (i is an integer of 0 or more) times the unit resource block or a resource block group, i is a terminal, characterized in that the length index. The method of claim 18,
And the resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 18,
And the resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 18,
And the resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 17,
And the cluster is a resource allocated to a downlink data channel. The method of claim 17,
And the cluster is a resource allocated to a control channel configured in a downlink data region. The method of claim 17,
And the cluster is a resource allocated to a control channel search region configured in a downlink data region. A receiving step of receiving resource allocation information encoded with information on resources allocated for the cluster; And
Decoding the resource allocation information to extract the length index of the cluster and the offset of the cluster, and converting the length index of the cluster into the length of the cluster;
The length of the cluster is represented by the number of resource blocks or resource block groups, and the number is a multiple of a predetermined real number. The method of claim 25,
The length of the cluster is 2 ⁱ (i is an integer greater than or equal to 0) times the resource block or resource block group, i is a length index receiving method, characterized in that the length index. The method of claim 26,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 26,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 26,
The resource allocation information is calculated by the following equation.

,

In the above equation, RIV is resource allocation information, j is an offset, and N is the total number of resource blocks or resource block groups. The method of claim 25,
And the cluster is a resource allocated to a downlink data channel. The method of claim 25,
And the cluster is a resource allocated to a control channel configured in a downlink data region. The method of claim 25,
And the cluster is a resource allocated to a control channel search region configured in a downlink data region.

Images