WO2013065990A1

WO2013065990A1 - Transmitter, method and terminal for allocating resources, and method of receiving resource allocation information

Info

Publication number: WO2013065990A1
Application number: PCT/KR2012/008741
Authority: WO
Inventors: 홍성권
Original assignee: 주식회사 팬택
Priority date: 2011-11-04
Filing date: 2012-10-24
Publication date: 2013-05-10

Abstract

The present invention relates to resource allocation in a wireless communication system. Specifically, the method comprises: an encoding step in which a resource block or a resource block group generates a resource indication value (RIV) which is a transform of the length (L) and the offset (j) of a contiguous resource allocation region; and a transmission step in which the resource allocation information is transmitted to a terminal, wherein the resource allocation information is calculated by means of a prescribed mathematical equation.

Description

A transmitting end, a resource allocation method, a terminal, and a 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.

Meanwhile, in the recent wireless communication business, interest in machine type communication (MTC) is increasing. Mechanical communication has a low-cost characteristic based on low-speed data communication between a number of machines, and a recent wireless access method that has evolved to be suitable for high-speed data communication is not suitable. For such low-cost mechanical communication, a method using less resources than the conventional method may be required.

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

An embodiment of the present invention includes an encoder for generating resource allocation information (RIV) in which a resource block or a group of resource block groups has a length L of consecutive resource allocation regions and an offset j of the resource allocation region; And a transmitter for transmitting the resource allocation information to the terminal, wherein the resource allocation information is calculated by the following equation.

In the above equation, N is the total number of resource blocks or resource block groups, and L _max is the maximum value of the length of the resource allocation region.

According to another embodiment of the present invention, an encoding step of generating a resource allocation information (RIV) in which a resource block or a resource block group converts a length (L) of consecutive resource allocation regions and an offset (j) of the resource allocation region; And a transmitting step of transmitting the resource allocation information to the terminal, wherein the resource allocation information is calculated by the following equation.

According to another embodiment of the present invention, a resource block or a resource block group includes a receiver for receiving resource allocation information (RIV) encoded with information on a continuous resource allocation region; And a decoder which decodes the resource allocation information to extract the length L and the offset j of the resource allocation region, wherein the resource allocation information is calculated by the following equation. do.

According to another embodiment of the present invention, a resource block or a resource block group receives a resource allocation information (RIV) encoded with information about a continuous resource allocation region; And decoding the resource allocation information to extract a length L and an offset j of the resource allocation region, wherein the resource allocation information is calculated by the following equation. Provides a method for receiving information.

The present invention described above can provide an apparatus and method for efficient resource allocation in a wireless communication system.

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

2 shows a subframe in which downlink transmission is performed.

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

4 illustrates an uplink type 1 resource allocation scheme.

5 shows examples of the case where part of the data area is used for control information.

6 shows an example in which an E-PDCCH search space is configured locally and an example in which distribution is configured.

7 illustrates a case where resources are continuously allocated in downlink or uplink.

8 illustrates a case where resources are discontinuously allocated in downlink or uplink.

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

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

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

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

13 is a flowchart illustrating a method of transmitting resource allocation information by a transmitting end according to another embodiment.

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

15 is a block diagram showing a configuration of a transmission stage according to another embodiment.

16 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 the accompanying 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 addition, in describing the present invention, when it is determined that the detailed description of the related well-known configuration or function may obscure the gist of the present invention, the detailed description thereof will be omitted.

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 transmitter 20 may communicate wirelessly.

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, the basic unit of data transmission is a subframe unit, and downlink or uplink scheduling is performed on a subframe basis.

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 and reception of signals through each channel will be described in the form of transmission and reception of the corresponding channel.

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, or the like according to a method in which resource allocation information is expressed in the above-described resource allocation field in downlink.

Referring to the exemplary diagram of FIG. 3A, the downlink type 0 resource allocation scheme is a scheme of representing a resource allocation region 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). When the resource allocation is expressed by the downlink type 0, the amount of bits required is determined by the number of resource blocks.

when

Becomes

Referring to the exemplary diagram of FIG. 3 (b), the downlink 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

Becomes The bit amount of the downlink type 1 may be designed to be equal to the bit amount of the type 0. 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 downlink type 2 resource allocation scheme is a scheme used when allocating a resource region having a contiguous constant length. In the case of type 2, the RIV is expressed as an offset from the start of the 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 the amount of bits required for a large number of resource blocks in a system having a large bandwidth. Small compared to The bit requirement required in the downlink type 2 is

to be.

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

The resource allocation scheme of uplink type 0 is the same as the resource allocation scheme of downlink type 2. That is, in the case of type 0, the RIV is expressed as an offset at the start of the continuous resource allocation area (cluster) and the length of the resource allocation area in the entire resource area. The bit requirement amount required in the uplink type 0 is that the number of resource blocks

when

to be.

4 illustrates an uplink type 1 resource allocation scheme.

Referring to the exemplary diagram of FIG. 4, the uplink type 1 resource allocation scheme is a scheme in which resource allocation regions are represented by a plurality of non-contiguous clusters. If the number of clusters is larger than four, the signaling overhead for resource allocation is required, while the gain through resource allocation is minimal. Therefore, the resource allocation scheme of uplink type 1 is limited to a limited number of clusters (2 to 4 clusters). ) Can only be considered. The uplink type 1 resource allocation scheme includes indexes ss ₀ , ss ₁ , ss ₂ of resource blocks (or resource block groups) that are starting points of each cluster, and indexes of resource blocks (or resource block groups) that are endpoints (ee _0). , ee ₁ , ee ₂ ) can be used to calculate the RIV value for resource allocation. In the case of limiting the number of clusters to two, the amount of bits required in the uplink type 1 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 the increase of the aggregation level as much as possible. When comparing the conventional PDCCH and the compressed 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.

5A shows an example of using a portion of the data area 202 for control information. In the data area 202, an enhanced PDCCH or extended PDCCH (Enhanced-PDCCH or Extended-PDCCH, E-PDCCH) 502 including resource allocation information and control information of the PDSCH 501 is allocated. In the control region 201, there is a PDCCH 503 including information on resources to which the E-PDCCH 502 is allocated. The PDCCH 503 may include or minimally include resource allocation information and other control information of the PDSCH 501 (or PUSCH), and the allocation information and related control information of the E-PDCCH 502 (eg, MCS (Modulation). and Coding Scheme), MIMO scheme, etc.) and the size can be made smaller than the conventional PDCCH. The terminal finds the PDCCH 503 allocated to the user through blind decoding in the search space in the control region 201, and the information on the resource allocated to the E-PDCCH 502 by the PDCCH 503. In the case of a PDCCH including the E-PDCCH (502) is read using this. The UE may grasp information on the resource to which the PDSCH 501 (or PUSCH) is allocated through the E-PDCCH 502.

5B shows another example when a part of the data area 202 is used for control information. In the data area 202, an E-PDCCH search space 602 to which an E-PDCCH including resource allocation information and control information of the PDSCH 601 (or PUSCH) is allocated is set. A plurality of control information may be located in the E-PDCCH search space 602. Within the control region 201 are

PDCCHs

603 and 604 that contain information about resources to which the E-PDCCH search space 602 has been allocated. The

PDCCHs

603 and 604 may include or minimally include resource allocation information and other control information of the PDSCH 601, and may allocate allocation information and related control information (MCS, MIMO scheme, etc.) of the E-PDCCH search space 602. It can be made smaller than the conventional PDCCH. The plurality of

PDCCHs

603 and 604 may designate the same E-PDCCH search space 602. The UE finds the

PDCCHs

603 and 604 assigned to the user through blind decoding in the search space in the control region 201, and the

PDCCHs

603 and 604 are assigned to the resources allocated to the E-PDCCH search space 602. In the case of a PDCCH including information on the location, the location of the E-PDCCH search space 602 may be known using the information. The UE may find the E-PDCCH allocated to the user through blind decoding in the E-PDCCH search space 602 and use the same to grasp information on a resource to which the PDSCH 601 (or PUSCH) is allocated.

In the example of FIGS. 5A and 5B, the PDCCH including resource allocation information for the E-PDCCH or E-PDCCH search space needs to be distinguished from the existing PDCCH, and in this specification, the E-PDCCH or E-PDCCH search space A PDCCH including resource allocation information for the PDCCH is called 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.

As described above, the indication PDCCH may be designed to have a relatively small information length compared to the existing PDCCH.

On the other hand, the configuration of the E-PDCCH may be configured through the indication PDCCH as described above, it may be configured without the indication PDCCH. That is, configuration information of the E-PDCCH may be transmitted through higher layer signaling (for example, RRC (Radio Resource Control) signaling). This means that a search space is set by higher layer signaling and control information such as related MIMO / MCS is transmitted. The terminal does not grasp the search space dynamically, but semi-statically, it searches for the search space. The UE may perform blind decoding in a given search space and extract an E-PDCCH corresponding to each UE through a cyclic redundancy check (CRC) check.

As described above, the scheme for configuring the E-PDCCH may be a dynamic scheme using the indication PDCCH and a quasi-static scheme using higher layer signaling. The search space for the E-PDCCH may be configured locally or may be distributed.

6 shows an example in which an E-PDCCH search space is configured locally and an example in which distribution is configured. Referring to FIG. 6A, the E-PDCCH search space may be locally set. In this case, the E-PDCCH search space may obtain frequency selective gain by using a specific frequency resource. Referring to FIG. 6B, an E-PDCCH search space may be distributed. In this case, the E-PDCCH search space is distributed in the frequency domain. When the E-PDCCH is distributedly located in the search space, the E-PDCCH may obtain frequency diversity gain. When configuring the E-PDCCH search space through the indication PDCCH or higher layer signaling, a timing problem related to decoding delay may occur differently from the case of the conventional PDCCH. Since the existing PDCCH belongs to the control region corresponding to the front part of the subframe, the signal can be relatively received and decoded first. However, since the E-PDCCH belongs to the data region, decoding is possible after receiving the complete subframe. Therefore, the E-PDCCH has a further restriction on the time required for decoding as compared to the existing PDCCH. This time constraint may result in a limitation on the final PDSCH decoding.

On the other hand, when the indication PDCCH directly indicates the E-PDCCH (see FIG. 5A), since most blind decoding is performed in the control region and decoding of the E-PDCCH is necessary only once in the data region, E through higher layer signaling is required. Compared to the case of -PDCCH configuration, the time constraint problem is relatively small.

When the indication PDCCH or higher layer signaling indicates the E-PDCCH search space, a time constraint occurs and a time constraint that can be allocated to PDSCH decoding is brought. Therefore, the size (number of bits) of the transport block of the PDSCH may be limited in a way of reducing the PDSCH decoding amount so that PDSCH decoding is sufficiently possible. In other words, it means that the total size of the resource block or resource block group allocated to the PDSCH can be limited.

Meanwhile, in the recent wireless communication business, interest in machine type communication (MTC) is increasing. Machine type communication may be variously referred to as machine to machine communication (M2M), Internet of Things (IoT), smart device communication (SDC), and machine oriented communication (Machine Oriented Communication).

Mechanical communication refers to a variety of communications in which a person communicates with or without minimal intervention. Mechanical communications include Smart Metering, e-Health, Connected Consumer, City Automation, Automotive Applications, Smart Grid, etc. It can be used in various fields.

Most applications of mechanical communication have the feature of being based on low bit rate low speed data communication between a large number of terminals. The communication between the transmitting end and the terminal for most mechanical communication is rarely characterized by non-frequency. The mechanical communication terminal is a terminal which does not intervene or minimally intervenes, and the power of the mechanical communication terminal must be able to be maintained continuously without human intervention for a long time.

Recently, in the wireless communication business, there is a growing interest in mechanical communication and a standardization movement is taking place. In particular, in 3GPP LTE, standardization activities related to MTC are being conducted, and research on low cost MTC is being proposed. Most MTC applications have low-cost characteristics based on low-speed data communication between a number of machines, and do not match the LTE-based wireless access method that has been evolved for high-speed data communication. Accordingly, the wireless access method of the MTC is considered to be based on the existing GSM / GPRS (Global Systems for Mobile communications / General Packet Radio Service) rather than LTE. However, when cellular mobile communication evolves to a high speed data center based on LTE in the future, a cellular network structure in which a plurality of radio access technologies (RATs) and a plurality of bands exist is not preferable in terms of cost. Therefore, technical efforts to develop a low-cost MTC terminal based on LTE has been attracting attention.

In order to implement low-cost mechanical communication, LTE-based wireless communication systems may require the following requirements.

First, a wireless communication system must be able to accommodate a very large number of mechanical communication terminals. At the same time, a very large number of mechanical communication terminals should be able to communicate to prevent traffic concentration.

Second, a mechanical communication terminal suitable for a low data rate should be implemented. In addition, the power used for communication must be reduced.

Third, there should be no problem with other existing communication terminals.

Fourth, there should be little variation in the hardware implementation of the transmitter.

As a scheme for configuring the low-cost MTC terminal as described above, one of the main various methods is to limit the maximum size of resource allocation available to one terminal. This is desirable for low-cost MTC that requires a lower data rate than the existing LTE system, and at the same time, it can play a role of reducing the cost required for implementation by reducing the complexity incurred for decoding and encoding data. For example, if there is a restriction on downlink resource allocation, there is a limit on the maximum data size per subframe that can be allocated to the terminal. Accordingly, the configuration complexity of the turbo decoder, the configuration complexity of the channel estimator, the decoding complexity for MIMO related processing, etc. It is limited and can significantly reduce the complexity compared to the complexity required by the original LTE terminal receiver, thereby lowering the price of the final implementation chip. In addition, the battery duration can be extended by lowering the terminal battery demand.

For the configuration of the above-described compressed PDCCH, there is no choice but to limit the existing PDCCH format. For this, a method of limiting the maximum size of resource allocation may be considered.

The above-described resource allocation for E-PDCCH is different from the existing resource allocation for data allocation and requires only limited resource allocation, so that the basic characteristic is that the maximum size of the resource allocation is limited.

In the above-described E-PDCCH search space, E-PDCCH decoding has a limitation of time that can be allocated to PDSCH decoding, and thus resource allocation for PDSCH in E-PDCCH may be more limited resource allocation than conventional data allocation. .

In the case of the low-cost MTC terminal described above, it is preferable that the maximum transmission rate is lower than that of the existing LTE terminal, and the maximum resource allocation is limited in view of reducing the price by reducing the transmission / reception complexity.

That is, the resource allocation scheme in the compressed PDCCH, the indication PDCCH, the E-PDCCH, and the PDCCH for the MTC terminal may be a compressed resource allocation scheme as described below.

7 is a view for explaining a resource allocation method according to an embodiment of the present invention. 7 illustrates a case where resources are continuously allocated in downlink or uplink.

In FIG. 7, the total number of resource blocks (or resource block groups) is N, the length of resource allocation is L in a continuous single cluster to which resources are allocated, and has a limit of L ≦ L _max .

When the length of the resource allocation of the cluster is L, the offset (index of the first resource block (or resource block group) of the cluster) j of the cluster may have a value of 0 to N-L (0 ≦ j ≦ N-L).

As an example, a method of allocating a value of RIV, and assigning a value from the case where the offset j is small for a predetermined length L and offsetting the next length L + 1 when all the offsets have been allocated. Consider the case of assigning a value from the case where (j) is small. For example, when N = 10 and L _max = 4, when L = 1, a value of RIV = 0 to 9 is assigned to resource allocation by 10 offsets (j = 0 to 9), and L = 2 days The value of RIV = 10 ~ 18 is assigned to resource allocation by nine offsets (j = 0 ~ 8), and RIV = 19 by resource allocation by eight offsets (j = 0 ~ 7) when L = 3. A value of ˜26 and a value of RIV = 27 to 33 can be assigned to resource allocation by seven offsets (j = 0 to 6) when L = 4.

In this case, in general, the value of RIV for resource allocation may be expressed as in Equation 1 below.

[Equation 1]

In Equation 1, the maximum value of RIV (RIV _max ) is

And the amount of bits for resource allocation

Becomes When RIV is encoded as shown in Equation 1, the decoding process is as follows.

priority,

The value of L = 1,2,… A value is obtained for, L _max , and a length L that satisfies b (L) ≦ RIV <b (L + 1) is obtained. The offset j is obtained by the formula of j = RIV-b (L). For example, when N = 10 and L _max = 4, b (1) = 0, b (2) = 10, b (3) = 19 and b (4) = 27. When the value of RIV is 25, L (3) is obtained because b (3) ≦ RIV <b (4) for the length L, and j = RIV-b (3) = 6 for the offset j. Can be saved.

As another example, a method of allocating a value of RIV, in which a value is assigned when the offset j is small for a predetermined length L, but the offset j is 0 to N-1 for all lengths L. Consider the case where N is possible and assign values. For example, when N = 10 and L _max = 4, when L = 1, a value of RIV = 0 to 9 is assigned to resource allocation by 10 offsets (j = 0 to 9), and L = 2 days The value of RIV = 10 ~ 18 is assigned to resource allocation by nine offsets (j = 0 ~ 8), and RIV = 20 by resource allocation by eight offsets (j = 0 ~ 7) when L = 3. A value of ˜27 and a value of RIV = 30 to 36 can be assigned to resource allocation by seven offsets (j = 0 to 6) when L = 4. At this time, some RIV values (eg, 19, 28, 29, etc.) are not used.

In this case, in general, the value of RIV for resource allocation may be expressed as in Equation 2 below.

[Equation 2]

In Equation 2, the maximum value of RIV (RIV _max ) is

And the amount of bits for resource allocation

Becomes

When RIV is encoded as shown in Equation 2, the decoding process is as follows.

That is, the value of L can be obtained by dividing the received RIV value by N, and the value of j can be obtained by performing a modular operation (a calculation of the remainder of integer values) with N.

Otherwise, first of all,

The value of L = 1,2,… A value is obtained for, L _max , and a length L that satisfies b (L) ≦ RIV <b (L + 1) is obtained. The offset j is obtained by the formula of j = RIV-b (L). For example, when N = 10 and L _max = 4, b (1) = 0, b (2) = 10, b (3) = 20 and b (4) = 30. When the value of RIV is 25, L (3) is obtained because b (3) ≦ RIV <b (4) for the length L, and j = RIV-b (3) = 5 for the offset j. Can be saved.

The above-described resource allocation scheme for the case where resources are continuously allocated may be used in place of the existing downlink type 2 resource allocation scheme or the uplink type 0 resource allocation scheme.

8 is a diagram illustrating a resource allocation method according to another embodiment of the present invention. 8 illustrates a case where resources are discontinuously allocated in downlink or uplink.

In FIG. 8, the number of all resource blocks (or resource block groups) is N, the number of resource blocks (or resource block groups) to which resources are allocated is L, and L ≤ L _max .

Enumerative source coding can be used as a method of assigning numbers for all possible cases for a certain number (L). Enumerated source coding can be expressed as:

Set of indexes of a resource block (or group of resource blocks) allocated M resources sorted in ascending size

For Equation 3, a value of resource allocation information r can be calculated.

[Equation 3]

From here,

ego

Is

Means,

Has a range of.

The decoding method of the value r encoded by enumeration source encoding is as follows. Count index (k) from the number (M) of resource blocks (or resource block groups) allocated resources for the value (Nx) minus the variable (x) from the number (N) of total resource blocks (or resource block groups) The combined value of minus (Mk) (

The variable x is incremented by 1 until) is less than or equal to the resource allocation information r. The variable x when the combined value is less than or equal to the resource allocation information r is determined as the index s _k of the resource block (or resource block group) to which the resource is allocated. The value obtained by subtracting the combined value from the resource allocation information r is again stored as the resource allocation information r, and the above-described process is repeated for the next coefficient index k. In this manner, all the indexes s _k and 1 ≦ _k ≦ M are extracted from the resource allocation information r. The above-described decoding process can be represented as follows.

As an example, the resource allocation field may consist of two fields.

The first field is a field indicating the number L of resource blocks (or resource block groups) to which resources are allocated, and the number of bits of the first field is

Can be For example, when L _max = 4, the first field, which is a field indicating the number of resource blocks (or resource block groups), includes 2 bits, and when the value of the first field is 0 (00), one resource block (Or resource block group), 1 (01), 2 resource blocks (or resource block group), 2 (10), 3 resource blocks (or resource block group), 3 (11) It may indicate that resources are allocated to four resource blocks (or resource block groups).

Alternatively, the first field may be a field indicating the number L of resource blocks (or resource block groups) to which resources are allocated. For example, the value K of the first field and the number L of resource blocks (or resource block groups) may have a relationship of L = ^2K . If the first field consists of 2 bits, one resource block (or resource block group) if the value of the first field is 0 (00), or two resource blocks (or resource block group) if 1 (01) In the case of 2 (10), four resource blocks (or resource block groups) and 3 (11) may indicate that resources are allocated to eight resource blocks (or resource block groups).

The second field allocates bits to the required size at the maximum resource allocation (L _max ), and enumerates and encodes each resource allocation. For maximum resource allocation, the value of enumerated source encoding can range from 0 to

Since the value of, the bit amount of the second field is

Becomes And, referring to Equation 3, the value of RIV in the second field is

Becomes

For example, when N = 10 and L _max = 4 in the example of FIG. 8, the bit amount of the first field is 2 (=

) And the bit rate of the second field is 8 (=

), And the bit amount of the entire resource allocation field is 10 (= 2 + 8). If resources are allocated to all four resource blocks s ₀ = 2, s ₁ = 3, s ₂ = 6, and s ₃ = 8, the value of the first field is 3, and the value of the second field is as follows. Is calculated.

When decoding the value of the resource allocation field, the number L of resource blocks (or resource block groups) to which the resource is allocated is extracted from the value of the first field, and r (the value of the second field in the above-described decoding method) S _k can be extracted by applying NRI and M (= L).

As another example, a resource allocation field is assigned a value of RIV, and a method of allocating a value of RIV. The value order of enumerated source coding for all cases for a number L of a predetermined resource block (or resource block group). In case of allocating the values by, and assigning them in all cases, we can consider the case of assigning the values in the order of enumerated source coding for the next number (L + 1). For example, if N = 10 and L _max = 4, 10 when L = 1

) Values are given in the order of enumerated source coding in the order of RIV = 0 ~ 9, and 45 (= when L = 2).

In the case of) cases, RIV = 10 ~ 54 values are given in the order of enumerated source coding, and when L = 3, 120 (=

) Values in RIV = 55 ~ 174 in the order of enumeration source coding for 210 cases, and 210 (= when L = 4

), RIV = 175 ~ 384 can be assigned in order of enumerated source encoding for) cases.

In this case, in general, the value of RIV for resource allocation may be expressed as in Equation 4 below.

[Equation 4]

For Equation 4, the maximum value of RIV (RIV _max ) is

And the amount of bits for resource allocation

Becomes

For example, when N = 10 and L _max = 4 in the example of FIG. 8, the bit amount of the resource allocation field is calculated as follows.

When resources are allocated to all four resource blocks, s ₀ = 2, s ₁ = 3, s ₂ = 6, and s ₃ = 8, the value of RIV is calculated as follows.

When RIV is encoded as shown in Equation 4, the decoding process is as follows.

priority,

The value of L = 1,2,… The value L is obtained for L _max , and the number L satisfying b (L) ≦ RIV <b (L + 1) is obtained. For example, when N = 10 and L _max = 4, b (1) = 0, b (2) = 10, b (3) = 55 and b (4) = 175. If the value of RIV is 288, L = 4 since b (4) < = RIV.

Next, RIV '= RIV-b (L) is calculated. If the value of RIV is 288, then RIV '= RIV-b (4) = 288-175 = 113 is derived.

Then, r (= RIV ') and N and M (= L) are applied to the above-described decoding method of enumeration source encoding to extract the value of s _k .

When N = 10, M = 4 (= L), r = 113 (= RIV '), when x = 1, k = 0

Greater than r, when x = 2, k = 0

Since r is smaller than r, the value of s ₀ is determined to be 2 and the value of r is updated to 113-70 = 43. Next, when x = 3, k = 1

Since r is less than r, the value of s ₁ is determined to be 3 and the value of r is updated to 43-35 = 8. Next, when x = 4 and k = 2

Greater than r, when x = 5 and k = 2

Greater than r, when x = 6, k = 2

Since it is smaller than r, the value of s ₂ is determined to be 6 and the value of r is updated to 8-6 = 2. Next, when x = 7, k = 3

Greater than r, when x = 8 and k = 3

Since r is equal to r, the value of s ₃ is determined to be 8.

The above-described resource allocation scheme for the case where resources are allocated discontinuously may be used in place of the existing downlink type 0, type 1 resource allocation scheme, or uplink type 1 resource allocation scheme.

Referring to FIG. 9, the transmitting end sets the length L and the offset j of the cluster allocated to the data area (S901). 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 E-PDCCH shown in FIG. 5A is allocated, or a resource allocated to the E-PDCCH search space shown in FIG. 5B. .

The length L of the cluster may be limited to less than or equal to a predetermined maximum value L _max . For example, when the control information channel is a compact PDCCH having a shorter length than the existing PDCCH, when the control information channel is an indication PDCCH indicating an E-PDCCH or an E-PDCCH search space, the control information channel is E. In the case of -PDCCH or the control information channel is a PDCCH indicating a data area of a mechanical communication terminal, the length L of the cluster may be limited.

The maximum value L _max of the length of the cluster may be a preset value. For example, when the terminal communicating with the transmitting end is a mechanical communication terminal, the length L of the cluster may be restricted within a predetermined maximum value L _max . For another example, when the transmitted control information channel is a compressed PDCCH, an indication PDCCH, or an E-PDCCH, the length L of the cluster may be limited within a predetermined maximum value L _max .

Alternatively, the maximum value L _max of the length of the cluster may be transmitted through higher layer signaling such as RRC (Radio Resource Control).

Next, the transmitter calculates the value of RIV using the set length L and offset j of the cluster (S902). The value of RIV may be calculated using Equation 1 or Equation 2 described above. However, the present invention is not limited to Equation 1 or Equation 2 described above, and various functions may be used in which length L and offset j may be uniquely determined from RIV.

The calculated value of the RIV is configured and transmitted in the resource allocation field in the control information channel (S903).

In this case, the control information channel may be a compressed PDCCH having a shorter length than a conventional PDCCH as a PDCCH including resource allocation information of a PDSCH (or PUSCH). The compressed 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 a compressed PDCCH or a conventional PDCCH to the terminal before transmitting the PDCCH. Alternatively, the compressed PDCCH and the conventional PDCCH may have different lengths, and the UE may determine the type of the PDCCH from the length of the PDCCH and extract PDSCH (or PUSCH) allocation information.

Alternatively, the control information channel may be an indication PDCCH including resource allocation information of the E-PDCCH or the E-PDCCH search space. The indication PDCCH may provide resource allocation and related control information (MCS, MIMO scheme, etc.) of the E-PDCCH or E-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, 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.

Alternatively, the control information channel may be an E-PDCCH located in the E-PDCCH search space. Configuration information for the E-PDCCH search space may be delivered from the transmitting end to the terminal by indicating PDCCH or higher layer signaling. The E-PDCCH (see FIG. 5B) located in the E-PDCCH search space may have a shortened length compared to the E-PDCCH (see FIG. 5A) directly designated by the existing PDCCH and / or indication PDCCH. Alternatively, the transmitting end may transmit configuration information on whether to transmit an E-PDCCH having an abbreviated length or an E-PDCCH having an unabbreviated length to the terminal.

Alternatively, the control information channel may be a PDCCH including resource allocation information of the PDSCH (or PUSCH) for the MTC terminal. The PDCCH transmitted to the MTC terminal may have a shorter length than the PDCCH transmitted to other general terminals. The transmitting end knows that the terminal to receive the PDCCH is the MTC terminal, and may transmit the PDCCH of the reduced length. Alternatively, the transmitting end may transmit configuration information on whether to transmit a PDCCH having a reduced length or a conventional PDCCH to the MTC terminal before transmitting the PDCCH. Alternatively, the PDCCH having an abbreviated length and the conventional PDCCH have different lengths, and the MTC terminal may grasp the type of the PDCCH from the length of the PDCCH and extract the PDSCH allocation information.

The terminal receives the control information channel from the transmitter (S1001). The received control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal. The terminal extracts and decodes the value of RIV from the resource allocation information field in the PDCCH to extract the length L and offset j of the allocated resource (cluster) (S1002). It is also possible for the length L and the offset j to be extracted at the same time or for the length L to be extracted first and the offset j to be extracted. In this case, the allocated resource may be a resource allocated for a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space.

Referring to FIG. 11, the transmitting end may include an encoder 1101 and a transmitter 1102.

The encoder 1101 receives information of the total number N of resource blocks or resource block groups, the length L of the cluster and the offset j set in the data region, and is input to the resource allocation field based on these. Calculate the value (RIV). The cluster may be a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space. The value of RIV may be calculated using Equation 1 or Equation 2 described above.

Transmitter 1102 sends the calculated RIV. The value of the RIV may be included in the DCI and transmitted through the control information channel. The control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.

Referring to FIG. 12, the terminal may include a receiver 1201 and a decoder 1202.

The receiver 1201 receives a signal including a control information channel from a transmitting end, and extracts a value RIV input to a resource allocation field in the control information channel. In the example of FIG. 12, the control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal. The RIV may include information about a resource of a PDSCH, a PUSCH, an E-PDCCH, or an E-PDSCH search space.

The decoder 1202 decodes the RIV to extract the length L and the offset j of the consecutively allocated resources (clusters). Thus, information about the resources of the PDSCH, PUSCH, E-PDCCH, or E-PDSCH search space can be known.

Referring to FIG. 13, the transmitting end sets an index of a resource allocated to a data area (S1301). In this case, the allocated resource may be a resource to which a PDSCH (or PUSCH) is allocated as shown in FIG. 2, a resource to which an E-PDCCH is illustrated as shown in FIG. 5A, or a resource allocated to an E-PDCCH search space as illustrated in FIG. 5B. Can be.

The number of allocated resources (resource block or resource block group) may be limited to a predetermined maximum value L _max or less. For example, when the control information channel is a compact PDCCH having a shorter length than the existing PDCCH, when the control information channel is an indication PDCCH indicating an E-PDCCH or an E-PDCCH search space, the control information channel is E. The number L of resources may be limited when the E-PDCCH is located in the PDCCH search space or when the control information channel is a PDCCH indicating a data area of the mechanical communication terminal.

The maximum value L _max of the number of resources may be a preset value. For example, when the terminal communicating with the transmitting terminal is a mechanical communication terminal, the number of resources (L) can be limited within a predetermined maximum value (L _max ). As another example, when the transmitted control information channel is a compressed PDCCH or an indication PDCCH or an E-PDCCH, the number L of resources may be limited within a predetermined maximum value L _max .

Alternatively, the maximum value L _max of the number of resources may be transmitted through higher layer signaling such as Radio Resource Control (RRC).

Next, the transmitting end configures a resource allocation field by using the number of allocated resources L and the index of each allocated resource (S1302). In one example, the resource allocation field may include a first field composed of the number L of resources and a second field composed of RIV calculated by Equation 3 using an index of each allocated resource. In another example, the resource allocation field may be configured with an RIV calculated by applying the number L of resources allocated in Equation 4 and an index of each allocated resource.

Resource allocation information configured in the resource allocation field in the control information channel is transmitted (S1303).

The terminal receives the control information channel from the transmitter (S1401). The received control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal. The terminal first extracts the number of allocated resources L from the resource allocation information field in the control information channel (S1402), and then extracts an index of each allocated resource (S1403). In this case, the allocated resource may be a resource allocated for a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space.

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

Referring to FIG. 15, the transmitting end may include an encoder 1501 and a transmitter 1502.

The encoder 1501 may determine the total number N of resource blocks or resource block groups, the number L of allocated resource blocks or resource block groups, and the index s _{k of} each of the allocated resource blocks or resource block groups (0 ≦ 0). k≤L-1) and calculates a value to be input into the resource allocation field based on these. In one example, the resource allocation field includes a first field and a second field, the number L of resource blocks or resource block groups is input in the first field, and the RIV calculated by Equation 3 in the second field. Can be input. In another example, the value to be input in the resource allocation field may be an RIV calculated by Equation 4. The resource block or resource block group may be a resource block or resource block group to which a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space is allocated.

The transmitter 1502 may transmit a DCI having a resource allocation field through a control information channel. The control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.

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

Referring to FIG. 16, the terminal may include a receiver 1601 and a decoder 1602.

The receiver 1601 receives a signal including a control information channel from a transmitter, and extracts a value input in a resource allocation field in the control information channel. In the example of FIG. 12, the control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal. The RIV may include information about a resource of a PDSCH, a PUSCH, an E-PDCCH, or an E-PDSCH search space.

The decoder 1602 extracts the indexes of consecutively allocated resource blocks or resource block groups by decoding the value input in the resource allocation field. First, the decoder 1602 extracts the number L of resource blocks or resource block groups, and extracts the index s _k of the resource block or resource block group by using the same. Thus, information about the resources of the PDSCH, PUSCH, E-PDCCH, or E-PDSCH search space can be known.

The above description is merely illustrative of the technical idea of the present invention, and those skilled in the art to which the present invention pertains may make various modifications and changes without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are not intended to limit the technical idea of the present invention but to describe the present invention, and the scope of the technical idea of the present invention is not limited thereto. 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.

CROSS-REFERENCE TO RELATED APPLICATION

This patent application is related to the patent application No. 10-2011-0114499 filed in Korea on November 4, 2011 and the patent application No. 10-2012-0015040 filed in Korea on February 14, 2012. Priority is claimed under section (a) (35 USC § 119 (a)), all of which is incorporated by reference in this patent application. In addition, if this patent application claims priority for the same reason for countries other than the United States, all its contents are incorporated into this patent application by reference.

Claims

An encoder for generating resource allocation information (RIV) in which a resource block or a resource block group converts a length (L) of consecutive resource allocation regions and an offset (j) of the resource allocation region; And

And a transmitter for transmitting the resource allocation information to a terminal.

The resource allocation information is calculated by the following equation.

In the above equation, N is the total number of resource blocks or resource block groups, and L max is the maximum value of the length of the resource allocation region.
The method of claim 1,

And the resource allocation information is transmitted through RRC (Radio Resource Control).
An encoding step of generating, by a resource block or a resource block group, resource allocation information (RIV) obtained by converting a length (L) of consecutive resource allocation regions and an offset (j) of the resource allocation region; And

A transmission step of transmitting the resource allocation information to a terminal;

The resource allocation information is calculated by the following equation.

In the above equation, N is the total number of resource blocks or resource block groups, and L max is the maximum value of the length of the resource allocation region.
The method of claim 3, wherein

The resource allocation information is transmitted through a radio resource control (RRC).
A receiver for receiving resource allocation information (RIV) encoded with information about a resource allocation region in which a resource block or a resource block group is consecutive; And

A decoder which decodes the resource allocation information and extracts a length L and an offset j of the resource allocation region;

And the resource allocation information is calculated by the following equation.

In the above equation, N is the total number of resource blocks or resource block groups, and L max is the maximum value of the length of the resource allocation region.
The method of claim 5,

The resource allocation information is characterized in that the terminal is transmitted via RRC (Radio Resource Control).
A step of receiving, by a resource block or a resource block group, resource allocation information (RIV) encoded with information about a continuous resource allocation region; And

Decoding the resource allocation information to extract a length (L) and an offset (j) of the resource allocation region;

The resource allocation information is calculated by the following equation.

In the above equation, N is the total number of resource blocks or resource block groups, and L max is the maximum value of the length of the resource allocation region.
The method of claim 7, wherein

The resource allocation information is transmitted through RRC (Radio Resource Control).