WO2011083949A2 - Method for allocating and transmitting resources in a wireless communication system, transmitting apparatus for same, and receiving apparatus corresponding to same - Google Patents

Abstract

The present description discloses a method for allocating resources in a wireless communication system, and an apparatus and system for same.

Description

Resource allocation transmission method and its transmission apparatus in wireless communication system, receiving apparatus corresponding thereto

The present specification discloses a resource allocation method, a device and a system in a wireless communication system.

In a wireless communication system, one of the basic principles of a wireless connection may be shared channel transmission, that is, time-frequency resources are dynamically shared between user terminals. At this time, the base station can control allocation of uplink and downlink resources.

In particular, the base station provides the terminal with allocation information of uplink resources, and the terminal allocates resources accordingly and transmits data in uplink.

In order to achieve the above object, in one aspect of the present invention, in a wireless communication system, k clusters (k is a natural number of 2 or more) including one or more resource block groups for all resource block groups for a specific terminal. Allocating resources discontinuously; And transmitting a message indicating k discrete clusters by at least one offset, a length of at least one resource block group, or at least one other offset.

In another aspect of the present invention, in a wireless communication system, resources are continuously or discontinuously distributed to k clusters (k is a natural number of two or more) including one or more resource block groups for all resource block groups for a specific terminal. Assigning; And a continuous or discontinuous resource allocation information composed of one number system on a control channel.

1 is a block diagram illustrating a wireless communication system to which embodiments of the present invention are applied.

2 is a conceptual diagram of a resource allocation method according to an embodiment.

3 illustrates coefficients for representing discrete resource allocation with two clusters used in a discrete resource allocation method according to another embodiment.

FIG. 4 illustrates the concept of representing the two clusters of FIG. 3C with four coefficients.

5 illustrates coefficients for representing discontinuous resource allocation with three clusters used in the discontinuous resource allocation method according to another embodiment.

FIG. 6 illustrates the concept of representing the three clusters of FIG. 4 with six coefficients.

7 is an example of a discontinuous resource allocation method according to another embodiment.

8 illustrates the concept of representing k clusters with 2k coefficients.

9 is a flowchart showing the configuration of a PDCCH.

10 is a block diagram of a base station according to another embodiment for generating downlink control information.

11 is a flowchart illustrating PDCCH processing.

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

FIG. 13 illustrates a method for allocating discontinuous resources by allocating j resource regions in a total of n resource block groups by confining the range of j and combining k-1 cluster allocations in a range of j-2. It is shown.

FIG. 14 illustrates a process of determining an m value according to a specific bit requirement when allocating two discrete clusters.

FIG. 15 illustrates a process of determining an m value according to a specific bit requirement when allocating three discrete clusters in a form of combining two and three clusters.

Hereinafter, some embodiments of the present invention will be described in detail through 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 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.

개의 자원블럭들을 포함하는 하향링크 시스템대역에 대한 전체 자원블럭그룹의 개수는

로 주어질 수 있다. 이때 P는 1 또는 2 이상의 자연수일 수 있다. 따라서, P=1일 때 자원블럭그룹은 각각의 자원블럭을 의미하며 P ≥2일 때 자원블럭그룹은 P개의 자원블럭들의 세트를 의미한다. 후자의 경우 자원블럭들의 개수가 100이고 P=4인 경우 자원블럭그룹의 개수는 25일 수 있다.In this specification, a "resource block group" means a set of contiguous resource blocks. E.g

The total number of resource block groups for the downlink system band including 4 resource blocks is

Can be given as In this case, P may be 1 or 2 or more natural numbers. Therefore, when P = 1, the resource block group means each resource block, and when P ≥ 2, the resource block group means a set of P resource blocks. In the latter case, when the number of resource blocks is 100 and P = 4, the number of resource block groups may be 25.

1 is a block diagram illustrating a wireless communication system to which embodiments of the present invention are applied.

Wireless communication systems are widely deployed to provide various communication services such as voice and packet data.

Referring to FIG. 1, a wireless communication system includes a user equipment (UE) 10 and a base station 20 (BS). The terminal 10 and the base station 20 use various power allocation methods described below.

Terminal 10 in the present specification is a generic concept that means a user terminal in wireless communication, WCDMA, UE (User Equipment) in LTE, HSPA, etc., as well as MS (Mobile Station), UT (User Terminal) in GSM ), SS (Subscriber Station), wireless device (wireless device), etc. should be interpreted as including the concept.

A base station 20 or a cell generally refers to a fixed station communicating with the terminal 10 and includes a Node-B, an evolved Node-B, and a Base Transceiver. It may be called other terms such as System, Access Point.

That is, in the present specification, the base station 20 or the cell should be interpreted in a comprehensive sense indicating some areas covered by the base station controller (BSC) in the CDMA, the Node B of the WCDMA, and the like. It is meant to cover all of the various coverage areas such as, microcell, picocell, femtocell, etc.

In the present specification, the terminal 10 and the base station 20 are two transmitting and receiving entities used to implement the technology or the technical idea described in the present specification and are used in a comprehensive sense and are not limited by the terms or words specifically referred to.

There is no limitation on the multiple access scheme applied to the wireless communication system. Various multiple access techniques such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), OFDM-FDMA, OFDM-TDMA, OFDM-CDMA Can be used.

The uplink transmission and the downlink transmission may use a time division duplex (TDD) scheme that is transmitted using different times, or may use a frequency division duplex (FDD) scheme that is transmitted using different frequencies.

One embodiment of the present invention is a resource allocation such as asynchronous wireless communication evolving into Long Term Evolution (LTE) and LTE-advanced through GSM, WCDMA, HSPA, and synchronous wireless communication evolving into CDMA, CDMA-2000 and UMB. Can be applied. The present invention should not be construed as being limited or limited to a specific wireless communication field, but should be construed as including all technical fields to which the spirit of the present invention can be applied.

In the following, the resource allocation will be described in a comprehensive manner, among the coefficients of resource indicator values (RIVs) according to various embodiments, a method of expressing resource indicator values (RIVs) using the coefficients, and a message including the resource indicator values. The transmission method and processing method of the PDCCH and their devices will be described.

In a wireless communication system, one of the basic principles of wireless connection may be shared channel transmission, that is, time-frequency resources are dynamically shared between user terminals 10. The base station 20 may control allocation of uplink and downlink resources.

In the LTE system, which is one of the wireless communication systems, data transmitted from the terminal 10 to the base station 20 in an uplink is carried in a resource block group designated by the resource allocation determined by the base station 20. . The base station 20 may inform the terminal 10 in a DCI format of a physical downlink control channel (PDCCH) which is a downlink control channel. This is called an uplink scheduling grant or simply a PUSCH grant.

The constant field of the format informs the terminal 10 of a certain region in the uplink frame format in which the terminal 10 will carry data. This region is referred to as a resource allocation field. Resource allocation indicated in the resource allocation field is processed in units of resource block groups (RBGs). In the resource allocation field, the content of the resource allocation in various forms is expressed as a binary value within a certain range and informs the terminal 10.

The receiving terminal 10 may interpret the resource allocation field on the detected PDCCH DCI format. The terminal 10 may transmit the data to the base station 20 by interpreting the resource allocation field and allocating a resource of a data channel, that is, a PUSCH.

Although a resource allocation method has been described using the LTE system, which is one of the wireless communication systems, for example, the present invention is not limited thereto. Therefore, a specific resource allocation method or configuration is not limited to the LTE system described above, but should be understood as a resource allocation method or configuration described throughout the present specification.

2 is a conceptual diagram of a resource allocation method according to an embodiment.

According to an embodiment of the present invention, when allocating resources for uplink, when all resources are configured with n resource block groups (n = 25 in FIG. 2) as shown in the upper part of FIG. It may be allocated to (10), or discontinuous resource block groups as shown in the bottom of Figure 2 may be allocated to the terminal (10). The former is called Contiguous Resource Allocation, and the latter is called Non-contiguous Resource Allocation. The former can reduce the payload of control information for uplink resource allocation, and the latter has an advantage in terms of efficient resource allocation.

As shown in the lower part of FIG. 2, each of consecutive resource allocation areas is called a cluster when discontinuous resource allocation.

The base station 20 may perform discontinuous resource allocation or continuous resource allocation to each of the connected user terminals 10. Meanwhile, the base station 20 may perform discontinuous resource allocation to a specific terminal 10 and perform continuous resource allocation or vice versa.

On the other hand, the discontinuous resource allocation can be obtained most of the performance gain by the discontinuous resource allocation in the case of two or three clusters, the present invention is not limited to this in the aspect of efficiency of resource allocation for continuous resource allocation of four or more You can use clusters. Hereinafter, the discrete resource allocation will be described using two or three clusters, for example. However, the present invention can be generalized to the case where the cluster is k (k is a natural number of 2 or more). In this case, the clusters each include one or more resource block groups.

The above-mentioned resource allocation is described in a comprehensive manner, and the following is a description of resource indicator values for continuous resource allocation.

The uplink scheduling grant or the PUSCH grant may use DCI format 0 among PDCCH DCI formats, which are control channels, but the present invention is not limited thereto. For example, in order to support a resource allocation method according to an embodiment, a channel other than a control channel, for example, a data channel, may be used for an uplink scheduling grant or a PUSCH grant. Other control channels may be used or even a PDCCH may use a format other than DCI format 0 or a newly defined format. That is, it can also be used for downlink scheduling for PDSCH grant. It is also possible to use a combination of the methods described above.

A control field indicating information on resource allocation informed by the base station 20 to the terminal 10, for example, a resource allocation field, may represent a possible case of resource allocation with an integer value within a predetermined range. . A resource indication value (RIV: Resouce Indication Value) may be referred to as a case of expressing a possible case of resource allocation with an integer value within a predetermined range as described above. Hereinafter, the base station 20 refers to the information field for informing information about the resource allocation to the terminal 10 as a resource allocation field (Resource Allocation Field), and refers to an integer value within a certain range as a resource indication value, but the present specification It is not limited to the term.

)와 연속적인 가상자원블럭들의 길이(length in terms of virtually contiguously allocated resource blocks,

)에 대응하는 자원지시값(

)로 구성되어 있을 수 있다. 이때

는 다음과 같이 표현될 수 있다.The resource allocation field of the continuous resource allocation at the top of FIG. 2 is a starting point of a resource block group (Starting Resource Block,

) And the length of terms of virtually contiguously allocated resource blocks,

Resource instruction value corresponding to

It can be composed of). At this time

Can be expressed as follows.

[Equation 1]

는 내림 연산을 의미하는 것으로서,

내의 숫자보다 같거나 작은 정수 중 가장 큰 수를 나타낸다.

는 가상의 연결된 자원블록그룹의 최대길이를 나타낸다.

는 전체자원블록그룹의 개수를 나타내는 값으로 n에 해당한다. “DL”의 의미는 하향링크를 의미하지만 하향링크만으로 한정되는 것은 아니다. 즉, “UL”로 표기하여 윗 식에서

또는

를

또는

로 대체할 수 있다. 또한, “RB”는 “RBG”로 대체될 수 있다.here

Means a rounding operation,

Represents the largest of integers less than or equal to the number in.

Denotes the maximum length of a virtual connected resource block group.

Is a value representing the total number of resource block groups and corresponds to n. "DL" means downlink, but is not limited to downlink. That is, it is written as "UL" in the above expression.

or

To

or

Can be replaced with In addition, “RB” may be replaced with “RBG”.

일 때 전술한 자원블럭그룹의 시작점(Starting Resource Block,

)와 연속적인 가상자원블럭들의 길이(length in terms of virtually contiguously allocated resource blocks,

)에 대응하는 자원지시값(

)는 0에서

까지의 값을 갖는다.

=n=25일 경우

는 0에서 324까지의 값을 갖는다.At this time, the total number of resource block groups

Is the starting point of the aforementioned resource block group (Starting Resource Block,

) And the length of terms of virtually contiguously allocated resource blocks,

Resource instruction value corresponding to

) At 0

Has a value up to.

if = n = 25

Has a value from 0 to 324.

=3,

=8인 도 2의 상단의 연속 자원할당을 예를 들면,

=178이다.If the total number of resource block groups is 25

= 3,

For example, the continuous resource allocation at the top of FIG.

= 178.

The method of decoding the resource indicator by analyzing the resource allocation field in the detected PDCCH DCI format 0 by the receiving terminal 10 is as follows.

(=25)로 나누어 몫(7)에 1을 더한 값으로부터 LCRBs(=8)를 구하고

(=3)는 그 나머지(=3)로부터 구한다. 이상 연속 자원할당시 자원지시값에 대해 기재하였고 다음은 2개의 불연속 클러스터들의 자원할당방법의 자원지시자에 대해 기재한다. 이때 도 3의 (a) 내지 (e)를 참조하여 2개의 불연속 클러스터들의 자원할당방법의 자원지시자들의 계수들을 설명하고, 도4를 참조하여 도 3의 (c)의 두 개의 클러스터들을 4개의 계수들로 표현하는 개념을 설명한다.The receiving terminal 10 detects the RIV value (= 178) from the resource allocation field of the detected PDCCH DCI format 0. RIV

Divide by (= 25) to get LCRBs (= 8) from quotient (7) plus 1

(= 3) is obtained from the rest (= 3). The above describes resource indicators for continuous resource allocation and the following describes resource indicators for resource allocation method for two discrete clusters. At this time, the coefficients of the resource indicators of the resource allocation method of the two discontinuous clusters with reference to (a) to (e) of FIG. 3, four coefficients of the two clusters of (c) of FIG. Describe the concepts represented by

 When discontinuous resource allocation, the resource allocation field may consist of resource indicators expressed using various coefficients to represent two or more clusters.

 3 illustrates coefficients for representing discrete resource allocation with two clusters used in a discrete resource allocation method according to another embodiment. FIG. 3 shows regions 310 and 320 of resource block groups allocated as resources for all resource block groups and regions of resource block groups not allocated as resources without separately showing resource block groups as shown in FIG. 330, 340, and 350). Regions 310 and 320 of resource block groups allocated as resources refer to clusters as described above.

Referring to (a) of FIG. 3, the resource allocation field at the time of discontinuous resource allocation includes a starting resource block of the first cluster and an ending resource block of the first cluster of the first cluster 310. A resource indicator (RIV) corresponding to a starting point of the resource block group of the second cluster 320 and an ending resource block of the second cluster may be configured.

Referring to (a) of FIG. 3, the coefficients of the start point and the end point of two discrete clusters 310 and 320 for representing a resource allocation field when discontinuous resource allocation may be represented by x, y, z, and w. . At this time, the range is such that the coefficient z of the end point of the preconfigured cluster 310 differs from the start point w of the post-configured cluster 320 by at least two or more (so that the length of the intermediate discontinuous portion is 1 or more). The start point (x, w) and the end point (z, y) of each cluster (310, 320) may be a corresponding value.

Referring to (b) of FIG. 3, the resource allocation field in the discontinuous resource allocation may correspond to resource indicators corresponding to four offset values for two non-contiguous clusters of the two discontinuous clusters 310 and 320. RIV). In this case, the start of the first cluster 310 may be indicated by the first offset and the end of the first cluster 310 by the second offset from the start of all resource block groups. In the same way, the start and end of the second cluster 320 can be represented by the third and fourth offsets, respectively.

Each offset is given relative to the end of the previous offset and the range of offsets starts from 0, but the third value should have a value of 1 or more. In this configuration, k clusters can be represented by adding two offset coefficients to each cluster.

 Referring to (c) of FIG. 3, the resource allocation field in discontinuous resource allocation is an area 330 of resource block groups in which resources are not allocated between the two clusters 310 and 320 and the two clusters 310 and 320. Area 330 of resource block groups for which no resource is allocated between the two clusters 310 and 320, the offset y of the resource block groups of the entire 360, and the length x of the entire 360 thereof. It can be composed of a resource indicator (RIV) corresponding to the other offset (w) and its length (z) of.

FIG. 4 illustrates the concept of representing the two clusters of FIG. 3C with four coefficients. In this case, the reference numerals used in FIG. 3 for clarity of the drawings are not shown in FIG. 4.

Referring to FIG. 4, when the total number of resource block groups is n, two cluster indications are allocated in contiguous resource block groups of length j-2 for consecutive resource block groups of length j. It can be expressed as containing one. This means that an unallocated area between two clusters can be allocated in contiguous resource block groups of length j-2 included in contiguous resource block groups of length j.

Referring mainly to FIG. 4 but referring to (c) of FIG. 3, consecutive resource block groups (number 360 in FIG. 3) having a length of j are allocated to resource allocation of the continuous resource allocation described with reference to FIG. 2. As shown in (c) of FIG. 3, the offset y and the contiguous resource block groups 360 of the contiguous resource block groups 360 having a length j as shown in the resource indication value RIV of the field. Is expressed as the length of x. On the other hand, the region 330 not allocated between the clusters 310 and 320 included in the contiguous resource block groups 360 having a length j is between the offset w of another resource block group and the cluster. Is expressed as the length z of the region of the resource block group to which no resource is allocated. At this time, in order to represent the minimum (length 1) of the region 330 of the unallocated resource block groups, the offset value (w) is 1 (x + 1) which is 1 greater than the first offset value (y). A value of 0 is considered as the starting point.

In other words, the coefficient y is the offset of the first resource block group in the contiguous resource block groups 360, and x is the number of contiguous resource block groups, two clusters and resources to which no intermediate resource is allocated. The number of block groups, w is computed as the starting point of resource block groups that are not allocated resources between two clusters when indexing a resource block group of x + 1 to 0, and z is intermediate between two clusters. The number of resource block groups to which no resource is allocated.

For example, discontinuous resource allocation at the bottom of FIG. 2, where the total number of resource block groups is 25, y = 3, x = 11, w = 3, and z = 3.

3 (c) and 4, the resource indicator (RIV) of the resource allocation field when discontinuous resource allocation has a resource allocation of x (x = 3,…, n), y (y = 0,…, Assuming that values are allocated in the order of nx), z (z = 1, ..., x-2) and w (w = 0, ..., xz-2), the following may be expressed as follows, but is not limited thereto.

[Equation 2]

In RIV (2), “2” indicates the number of discrete clusters, and RIV (2) denotes a resource indicator (RIV) of a resource allocation field when discontinuous resource allocation to two discrete clusters. Hereinafter, “x” in RIV (x) means the number of discrete clusters.

는 x와 n의 함수로 x-1까지의 자원할당 개수이며,

는 x와 y의 함수로 y값의 변화에 의한 자원할당 개수이며,

는 x와 z의 함수 z-1까지의 자원할당 개수이며,

는 w의 함수로 w값의 변화에 의한 자원할당 개수이다. In the above formula,

Is a function of x and n, which is the number of resource allocations up to x-1,

Is the function of x and y and resource allocation number by the change of y value,

Is the number of resource allocations up to function z-1 of x and z,

Is a function of w and the number of resource allocations due to the change of w.

와

,

,

를 위에서 설명한 전체 자원블럭그룹들의 개수인 n과 4개의 계수들, x, y, w, z로 표현하면 다음과 같다.

Wow

,

,

Is expressed as n and four coefficients, x, y, w, and z, which are the total number of resource block groups described above.

[Equation 3]

=0,

=11,

=1,

=3이므로, RIV(2)=15이다.For example, when the total number of resource block groups is 25, the discontinuous resource allocation at the bottom of FIG. 2 where y = 3, x = 11, w = 3, and z = 3, for example,

= 0,

= 11,

= 1,

Since = 3, RIV (2) = 15.

Although the resource indicator is described when the number of discrete clusters is two, the following describes decoding of the resource indicator in the terminal on the receiving side.

The receiving terminal 10 interprets the resource allocation field in the detected PDCCH DCI format 0 and decodes the resource indicator as follows.

의 값을 저장한다.1) n resource block groups

Store the value of.

으로

에서

를 만족시키는

을 구한다.2) received

to

in

Satisfying

Obtain

을 만족하는

를 구한다.3)

To satisfy

Obtain

을 만족하는

를 구한다.4)

To satisfy

Obtain

를 구한다.5)

Obtain

The coefficients x, y, z, w of the start and end points of the two discrete clusters 310 and 320 representing the resource indicators of the resource allocation field in the discontinuous resource allocation shown in FIG. The four offset values representing resource indicators of the resource allocation field at the time of discontinuous resource allocation shown in b) are transformed into coefficients representing the resource indicators of the resource allocation fields at the time of discontinuous resource allocation shown in FIG. Can be expressed.

For example, each of the coefficients of the start point and the end point of two discontinuous clusters representing resource indicators of the resource allocation field in the discontinuous resource allocation shown in FIG. 3 (a) is x (START ₁ ) = y, y (END ₁ ). = y + w, w (START ₂ ) = y + w + z + 1, z (END ₂ ) = x + y-1 can be established. On the contrary, the relationship between the _two can also be expressed as x = END ₂ -START ₁ + 1, y = START ₁ , z = START ₂ -END ₁ -1, w = END ₂ -START ₁ . Here, each variable has a range of 0 to n-1.

For example, each of the four offsets representing the resource indicators of the resource allocation field in the discontinuous resource allocation shown in FIG. 3 (b) is x (offset1) = y, y (offset2) = w, w (offset3) = The relationship z, z (offset4) = xwz can be established.

Referring to (d) of FIG. 3, the resource allocation field in discontinuous resource allocation includes two clusters 310 and 320 and the resource block group of the entire area 330 of the resource block groups 360 to which no resource is allocated. The resource corresponding to the start point w and the end point z of the region 330 where the offset y and the length x of this whole 360, the resources between the two clusters 310, 320 are not allocated. It may consist of an indicator (RIV). At this time, the start point (w) and the end point (z) of the region in which resources between the two clusters are not allocated may be based on the start point 370 of all resource block groups.

 Referring to (e) of FIG. 3, the resource allocation field in discontinuous resource allocation includes two clusters 310 and 320 and a resource block group of the entire 360 of the region 330 of resource block groups to which no resource is allocated. The resource indicator corresponding to the start point (w) and the end point (z) of the region 330 where no resource is allocated between the two offsets (y) and the length (x) of the two clusters (310, 320). RIV). In this case, the start point w and the end point z of the region 330 in which resources between the two clusters 310 and 320 are not allocated may be based on the start point 380 of the resource block groups of the first cluster.

As described above, the coefficients for expressing the resource indicators of the resource allocation field in the discontinuous resource allocation described with reference to FIGS. 3A to 3E have a substitution relationship.

The resource indicator of the resource allocation method of two discrete clusters has been described above, and the resource indicator of the resource allocation method of three discrete clusters is described below.

5 illustrates coefficients for representing discontinuous resource allocation with three clusters used in the discontinuous resource allocation method according to another embodiment. FIG. 5 shows regions 510, 520, and 525 of resource block groups allocated as resources for all resource block groups without separately showing resource block groups as shown in FIG. 2, and regions 530 of resource block groups that are not. , 540, 550, 555). The regions 510, 520, and 525 of resource block groups allocated as resources refer to clusters as described above. Referring to FIG. 5, the resource allocation field in discontinuous resource allocation includes an area 560 including three clusters 510, 520, and 525 and areas 530 and 550 of resource block groups to which resources are not allocated. The offset b of the resource block group of < RTI ID = 0.0 > and < / RTI > the length (a) of this entire area 560, the offset and length indicating the areas 530 and 550 where no resources are allocated in the whole area 560, Resource indicators (RIVs) can be constructed from z and w.

FIG. 6 illustrates the concept of representing the three clusters of FIG. 5 with six coefficients. At this time, the reference numerals used in FIG. 5 for clarity of the drawings are not shown in FIG. 6. Referring to FIG. 6, two clusters included therein represent a resource block group not allocated between three clusters.

In this case, the contiguous resource block groups of length j are the offsets (b) of the resource block group and the contiguous resource blocks in the same manner as the resource indication value (RIV) of the resource allocation field of the continuous resource allocation described with reference to the upper part of FIG. It is expressed by the length a. In order to express three clusters, there are two cluster types in which resource allocation is not allocated internally, and this can be expressed as an RIV value representing two clusters. At this time, y representing the total offset of the region where no internal resource allocation has been made is indexed by indexing the resource block of b + 1 to 0.

7 is an example of a discontinuous resource allocation method according to another embodiment of the present invention.

Referring to FIG. 7, when the total number of resource block groups is 25, b = 3, a = 13, y = 3, x = 7, w = 2, and z = 2. The base station 20 may allocate four resource block groups among the entire resource block groups to the specific terminal 10 in the same way as the bottom of FIG. 2, but may allocate resources to three discontinuous clusters. As a result, the number of resource block groups allocated (eight out of 25) is the same but can be advantageous in terms of resource allocation.

In the resource allocation field (RIV) of the resource allocation field in the case of discontinuous resource allocation in the manner shown in FIG. 7, the resource allocation has a (a = 5,…, n), b (b = 0,…, na), x (x = 3,…, a-2), y (y = 0,…, a-2-x), z (z = 1,…, x-2), w (w = 0,…, xz-2) Assuming values are assigned in order, they can be expressed as That is, when the total number of resource block groups is n, the length (a) of the entire area of the resource block groups where no resources are allocated between the three clusters and the offset (b) of the total area, When a value is allocated in the order of an offset and a length (x, y, z, w) indicating an area where a resource is not allocated, the resource indicator (RIV) may be expressed as follows.

[Equation 4]

는 a와 n의 함수로 a-1까지의 자원할당 개수이며,

는 a와 b의 함수로 b값의 변화에 의한 자원할당 개수이며,

는 x와 a-2의 함수로 x-1까지의 자원할당 개수이며,

는 x와 y의 함수로 y값의 변화에 의한 자원할당 개수이며,

는 x와 z의 함수로 z-1까지의 자원할당 개수이며,

는 w의 함수로 w값의 변화에 의한 자원할당 개수이다.From the stomach

Is a function of a and n, the number of resource allocations up to a-1.

Is a function of a and b, which is the number of resource allocation by changing the value of b,

Is a function of x and a-2, which is the number of resource allocations up to x-1,

Is the function of x and y and resource allocation number by the change of y value,

Is a function of x and z, which is the number of resource allocations up to z-1.

Is a function of w and the number of resource allocations due to the change of w.

와

,

,

,

,

를 위에서 설명한 전체 자원블럭그룹들의 개수인 n과 4개의 계수들 a,b, x, y, w, z로 표현하면 다음과 같다.

Wow

,

,

,

,

Is expressed as n and the four coefficients a, b, x, y, w, and z, which are the total number of resource block groups described above, as follows.

[Equation 5]

 The resource indicators of the resource allocation method of two and three discrete clusters are described above, and the following describes resource indicators of the resource allocation method of k discrete clusters.

8 illustrates the concept of representing k clusters with 2k coefficients. The allocation of resource block groups for k clusters in general may be represented as shown in FIG. 8. That is, the configuration of RIV values representing k discrete clusters may be represented by two coefficients (offset and length) representing the entire region and k-1 discrete regions that do not receive resource allocation in the entire region. In other words, when the total number of resource block groups is n, it is discontinuous with k clusters by using one contiguous resource block group allocation having a length j and a discontinuous resource block group allocation having k-1 clusters having a total length j-2. Resource allocation group assignment can be expressed. Of course, the range of j is up to the number n of all resource block groups.

(k개의 계수로 표현됨)로부터 자원할당이 표현될 때 본 명세서에서 일반적인 자원할당필드의 자원지시자(

)를 나타내는 방법은 다음과 같다.A discontinuous region not receiving k-1 resource allocations may be represented by an RIV value representing k-1 clusters, and the RIV values for k clusters may be recursively configured. In such a recursive configuration, an RIV value is designated within an area that has not received k-1 resource allocations within a range smaller than 2 representing a whole area, and thus a starting point and a range of length of each offset are determined. As described above, in addition to the discontinuous resource configuration and the scheme shown in FIG. 3, various various RIV configurations of discontinuous resource allocation are possible. In this general manner different from the one described above, the resource composition is represented, that is,

When resource allocation is expressed from (expressed as k coefficients), the resource indicator (

) Is as follows.

[Equation 6]

로 값이 고정될 때 x₂,…,x_k의 계수들이 각 계수들의 가능한 범위 내에서 모든 조합의 수(

이라는 조건하에서)이며, RIV ₂ (x₁,x₂,n)는 x₁과 x₂,n의 함수로

,

로 값이 고정될 때 x₃,…,x_k의 계수들이 각 계수들의 가능한 범위 내에서 모든 조합의 수(

,

이라는 조건하에서)이다. 이것을 일반적으로 표현하면 RIV(x₁,x₂,…,x_k,n)는 x₁과 x₂,…,x_k,n의 함수로

,

,…,

로 값이 고정될 때

의 계수들이 각 계수들의 가능한 범위 내에서 모든 조합의 수(

,

,…,

이라는 조건하에서)를 의미한다. 여기서, RIV(x₁,x₂,…,x_k,n)의 값이 0부터 시작하는 형태가 되도록 하기 위해서

의 형태가 아닌

의 형태가 될 수 있다.Where x ₁ and x ₂ ,... , x _k denotes at least one of an offset, a length of resource block groups, a start point or an end point of a specific cluster, and n denotes the total number of resource block groups. RIV ₁ (x ₁ , n) is also a function of x ₁ and n

When the value is fixed as x ₂ ,… , the coefficients of x _k are the number of all combinations within the possible range of

RIV ₂ (x ₁ , x ₂ , n) is a function of x ₁ and x ₂ , n

,

When the value is fixed as x ₃ ,… , the coefficients of x _k are the number of all combinations within the possible range of

,

Under the condition If this generally expressed _{RIV (x 1, x 2,} ..., x k, n) is x ₁ and x _2, ... as a function of, x _k , n

,

,… ,

When the value is fixed to

The coefficients of are the number of all combinations within the possible range of

,

,… ,

Under the condition Here, to make the value of RIV ( x ₁ , x ₂ ,…, x _k , n) start from 0

Not in the form of

Can be in the form of.

In this way, when representing the resource indicator ( RIV ( x ₁ , x ₂ ,…, x _k , n)) of a resource allocation field, the transmission of a message containing an information field, for example a resource allocation field, for example PDCCH DCI. The resource allocation field in the format 0 is transmitted to the terminal and the terminal 10 receives and decodes this message as follows.

1) Assign i = 1. (The indexing of i may start with 0. That is, it may start with i = 0.)

값에 대하여

인 조건을 만족하며

가

에 가장 가깝도록 하는

을 구한다.2) received

About the value

Satisfies the condition

end

Closest to

Obtain

한다. 3)

do.

4) i = i + 1

5) If i> k, the process ends. If not, the process returns to 2).

For example, although the resource indicator is represented by four offsets for two discrete clusters in FIG. 3B, the resource indicator may be represented by offsets of 2k for k discrete clusters. In this case, two pairs of 2k offsets may represent a start point and an end point of a specific cluster, respectively.

Other schemes of FIG. 3 may also represent a resource indicator using Equation 6 for k discrete clusters in the same manner.

The resource indicators of the resource allocation method of k discrete clusters are described above, and the following describes resource indicators of the common continuous and discontinuous resource allocation method.

The method of configuring the resource indicator of the resource allocation field when continuous resource allocation is described above with reference to the top of FIG. 2 and the method of configuring the resource indicator of the resource allocation field when discontinuous resource allocation is described with reference to the bottom to FIG. . At this time, the resource allocation instruction of each resource indicator in the resource allocation field may be assigned as a separate numbering system in the case of continuous and discontinuous resource allocation.

For example, when numbering 1 to k cluster resource allocations together, the numbering of resource indicators in the resource allocation field is as follows.

를 k개의 클러스터를 갖는 자원할당필드의 자원지시자(RIV)라고 정의한다. 이때

의 형식은 0부터 시작된다고 가정한다.

Is defined as a resource indicator (RIV) of a resource allocation field having k clusters. At this time

It is assumed that the format of starts at zero.

[Equation 7]

는 i개의 클러스터를 갖는 자원할당 RIV값의 최대값을 나타낸다.here,

Denotes the maximum value of the resource allocation RIV value having i clusters.

The numbering of resource indicators in the resource allocation field above indicates a method of increasing the numbering value by sequentially placing RIVs having a low number of clusters from 0.

의 형식이 1부터 시작된다고 가정하면 다음과 같다.

Assuming that the form of starts from 1,

[Equation 8]

The following is an example of assigning a number to one number system of resource indicators in the resource allocation field when allocating resources into consecutive resource allocations and two discrete clusters.

As described above, the resource indicator of the resource allocation field may be represented by Equation 1 during continuous continuous resource allocation, and the resource indicator of the resource allocation field may be represented by equations 2 and 3 when allocating resources into two discrete clusters.

At this time, when the resource indicators of the resource allocation field in the continuous and discontinuous resource allocation to Equation 8 can be expressed as one number system as follows.

[Equation 9]

,

의 의미를 갖는다.

또는

의 의미를 갖고

또는

의 의미를 갖는데 즉, 자원블록 또는 자원블록그룹의 단위가 될수 있음을 의미한다. 즉 두번째 식에서는 연속할당에 대해서는 자원블록의 단위로 할당되고 불연속자원할당에 대해서는 자원블록그룹의 할당으로 구성될 수 있음을 의미한다. 또한 다른 계수들은 수학식 1 내지 3에 설명한 바와 같다.here,

,

Has the meaning.

or

With the meaning of

or

That is, it means that it can be a unit of a resource block or a resource block group. That is, in the second equation, it can be configured as a unit of resource block for continuous allocation and resource block group allocation for discontinuous resource allocation. In addition, other coefficients are as described in equations (1) to (3).

In the above equation, resource indicator RIV _LTE (z, w, n) of resource allocation field in continuous resource allocation is 0 to (n (n + 1) / 2-1), so resource indicator RIV (2 in resource allocation field in discontinuous resource allocation. ) Is given from n (n + 1) / 2, so that both can be given one number system.

This number structure has the advantage of maintaining backward compatibility with the resource indicator of the resource allocation field during continuous resource allocation and at the same time, no other bit allocation is required for cluster classification.

The method of assigning a separate number to each resource indicator in the resource allocation field for continuous and discontinuous resource allocation requires one or more additional bit allocations for cluster classification. As described above, the resource allocation field for continuous and discontinuous resource allocation is described. The way of assigning resource indicators in a single numbering scheme may not require this additional bit allocation.

는 같은 번호부여체계 안에서만 구해지는 것이 아닌 다른 번호부여체계(본 발명의 제안된 누적체계에서 얻어지는 번호체계가 아닌 일반적으로 다른 체계에 의해 구성될 수 있는)에서 얻어질수 있으며 k의 값이 중복되거나 원래의 k보다 작은 값이 다른 번호체계에서 삽입되어 합의 공식이 구해질 수 있으며 i의 값이 1에서 시작하지 않고 1이상의 값에서 시작할 수도 있다.In equation (8)

Can be obtained from a different numbering system (generally composed by a different system than the one obtained from the proposed cumulative system of the present invention), which is not obtained only within the same numbering system, and the value of k is either duplicated or A value of less than k can be inserted from another numbering system to yield a consensus formula, and the value of i may not start at 1, but at a value of 1 or more.

The above describes resource indicators of common continuous and discontinuous resource allocation methods, and the following describes some replacements of resource indicators in the resource allocation field.

As described above with respect to the resource indicator (RIV) of the resource allocation method of the two discrete clusters and the resource indicator (RIV) of the resource allocation method of the three discrete clusters described above, the configuration of the discrete resource indicator when there are two or more clusters. By using the existing 3GPP LTE contiguous allocation resource indicator in the configuration of part of the resource indicator in the present invention, the complexity of decoding at the receiving end can be obtained. As described above with respect to the resource indicator (RIV) of the resource allocation method of the two discrete clusters and the resource indicator (RIV) of the resource allocation method of the three discrete clusters, the resource indicator is also based on continuous resource allocation. As a result, a number system is used to represent the resource allocation of discrete clusters, but the actual numbering may be different from the existing LTE 3GPP contiguous allocation resource indicator.

)와 연속적인 가상자원블럭들의 길이(length in terms of virtually contiguously allocated resource blocks,

)에 대응하는 연속자원 할당시 자원지시값(RIV)으로 치환하여 적용될 수 있다. In other words, in Equation 6 representing a resource indicator, one or more of RIV ₁ to RIV _K , and some of these calculation values are used as starting points of the resource block group.

) And the length of terms of virtually contiguously allocated resource blocks,

) Can be applied by substituting RIV for continuous resource allocation.

For example, in the case of two and three discrete clusters, respectively, a part of RIV (2) and part of RIV (3) is applied to the resource indicator of the continuous resource allocation field as follows.

이다. 여기서 z=1,...,x-2, w=O,...,x-z-2이다 In RIV (2), z = 1, ..., x-2, w = 0, ... xz-2,

to be. Where z = 1, ..., x-2, w = O, ..., xz-2

이다. 여기서 z=1,...,x-2, w=0,...,x-z-2이다. On RIV (3)

to be. Where z = 1, ..., x-2, w = 0, ..., xz-2.

In this way, it is possible to increase backward compatibility and to have an advantage in decoding complexity.

As described above, the uplink scheduling grant or the PUSCH grant may use DCI format 0 (DCI format 0) among the PDCCH DCI formats, which are control channels, but to support the resource allocation method, the uplink scheduling grant or the PUSCH grant is controlled for the uplink scheduling grant or the PUSCH grant. A channel other than the channel may be used, for example, a data channel, a control channel may be used, but a control channel other than PDCCH may be used, and a PDCCH may be used, but a format other than DCI format 0 or a newly defined format or downlink The DCI format for may be used.

Hereinafter, the granting of an uplink scheduling grant or a PUSCH grant using the PDCCH DCI format 0 will be described.

9 is a flowchart illustrating a configuration of a PDCCH according to another embodiment, FIG. 10 is a flowchart illustrating PDCCH processing according to another embodiment, and FIG. 11 is a block diagram of a transmitter of a base station and a receiver of a terminal.

1 and 9, the base station 20 configures the PDCCH payload according to an information payload format to be sent to the terminal. The length of the PDCCH payload may vary depending on the information payload format. The information payload format may be a DCI format.

As described above, a resource indicator (RIV) is expressed in the resource allocation field of DCI format 0 to configure DCI format 0. In this case, the resource allocation field may represent a resource indicator (RIV) in the manners described with reference to FIGS. 2 to 8, but a detailed description thereof will be omitted to avoid repetition. For example, the resource indicator may have RIV (x ₁ , x ₂ , ..., x _k , n) = RIV ₁ (x ₁ , n) + RIV ₂ (x ₁ , x ₂ , n) + ... + RIV _k (x ₁ , x ₂ , ..., x _k , n) (where x ₁ and x ₂ ,…, x _k are offset, length of resource block groups, starting point of a specific cluster, respectively) Or at least one of the endpoints, and n denotes the total number of resource block groups.

Of course, other information payload formats may also be present in DCI formats.

In step S110, a cyclic redundancy check (CRC) for error detection is added to each PDCCH payload. In the CRC, an identifier (referred to as a Radio Network Temporary Identifier (RNTI)) is masked according to an owner or a purpose of the PDCCH.

In step S120, the coded control information is generated by performing channel coding on the control information added with the CRC.

In step S130, rate matching according to the CCE aggregation level allocated to the PDCCH format is performed.

In step S140, the coded data is modulated to generate modulation symbols.

In step S150, modulation symbols are mapped to physical resource elements (CCE to RE mapping).

Generalizing the control information transmission method described with reference to FIG. 9 is as follows. The base station determines RIV (x ₁ , x ₂ , ..., x _k , n) = RIV ₁ (x ₁ , n) + RIV ₂ (x ₁ , x ₂ , n) + .. Adding a cyclic redundancy check (CRC) for error detection to control information including resource allocation information represented by. + RIV _k (x ₁ , x ₂ , ..., x _k , n) Generating coded data by performing channel coding on control information added with CRC, generating modulation symbols by modulating the coded data, and mapping modulation symbols to physical resource elements. It may be performed and transmitted to the terminal.

  10 is a block diagram of a base station according to another embodiment for generating downlink control information.

1 and 10, a codeword generator 1005, a scrambling unit 1010, ..., 1019, a modulation mapper 1020, in the signal generator 1090. , 1029), layer mapper 1030, precoding 1040, resource element mapper 1050, ..., 1059, OFDM signal generator 1060, ... 1069 may exist as separate modules, and two or more may be combined to operate as one module.

RIV (x ₁ , x ₂ , ..., x _k , n) = RIV ₁ (x ₁ , n) + RIV ₂ (x ₁ , x ₂ , n) + ... + RIV in Equation 6 Control information obtained by adding a cyclic redundancy check (CRC) to control information including resource allocation information represented by _k (x ₁ , x ₂ , ..., x _k , n) is input to the signal generation unit 1090. .

The control information added with the CRC includes a codeword generator 1005, a scrambling unit 1010, ..., 1019, a modulation mapper 1020, ..., 1029, and a layer mapper. Generated as an OFDM signal by a mapper 1030, a precoding unit 1040, a resource element mapper 1050, ..., 1059, and an OFDM signal generator 1060, ..., 1069 And is transmitted to the terminal through the antenna.

In the OFDM signal generation process of FIG. 10, precoding is omitted in the process of generating the PDCCH, which is the embodiment described with reference to FIG. 9, and thus the input and output of the precoding may be the same. In addition, the codeword may not be generated after multiple paths. Tailbiting convolutional coding (TCC) may be used to generate the PDCCH control channel, and an operation related to rate matching (RM) may be applied.

 11 is a flowchart illustrating PDCCH processing.

1 and 11, in step S210, the terminal 10 demaps a physical resource element to CCE.

In step S220, since the UE 10 does not know at which CCE aggregation level it should receive the PDCCH, demodulation of the CCE aggregation level that the payload corresponding to the reference DCI format according to its transmission mode may have. do.

In step S230, the terminal 10 performs de-ratematching of the demodulated data according to the payload and the CCE aggregation level.

In step S240, channel decoding is performed on the coded data according to the code rate, and the CRC is checked to detect whether an error occurs. If no error occurs, the terminal 10 detects its own PDCCH. If an error occurs, the terminal 10 continuously performs blind decoding on another CCE aggregation level or another DCI format.

In step S250, the terminal 10 having detected its own PDCCH removes the CRC from the decoded data to obtain control information necessary for the terminal 10.

In particular, the DCI format 0 is detected and the uplink scheduling grant included in the DCI format 0 is interpreted. In this case, when the DCI format 0 is detected and the uplink scheduling grant included in the DCI format 0 expresses the resource indicator (RIV (x ₁ , x ₂ , ..., x _k , n)) of the resource allocation field as described above, The RIV is calculated through the process of complexization, and then the coefficients of the resource indicators corresponding to the RIV are calculated.

Other DCI formats are detected and the downlink scheduling assignments included in this control information, uplink scheduling grant, and power control commands are used to identify the corresponding CCs identified by the CC. It performs downlink scheduling assignment, uplink scheduling grant, and power control.

Generalizing the control information processing method described with reference to FIG. 11 is as follows.

The terminal demaps a physical resource element receiving control information from a base station to symbols, demodulates demapped symbols to generate data, and performs channel decoding on the demodulated data. Checking the CRC to detect whether an error has occurred, removing the CRC from the decoded data to obtain necessary control information, and RIV (x ₁ , x ₂ , ..., x _k , n from the obtained control information. The control information may be processed by interpreting the resource allocation information expressed by "

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

1 and 12, a terminal receives a signal from a base station through an antenna.

The demodulation unit 1220 provides a function of demodulating the received signal. When the base station transmits an OFDM signal, demodulation is performed by the OFDM scheme. In addition, the base station may demodulate according to the corresponding scheme according to whether the signal generated by the base station is the FDD scheme or the TDD scheme.

The demodulated signal is descrambled by the descrambling unit 1230 to generate a codeword of a predetermined length, and the codeword decoding unit 1240 restores the codeword back to predetermined control information. This function may be performed at the signal decoder 1290 at once, or may operate independently or sequentially in two or more modules.

Finally, the resource allocation information expressed as RIV (x ₁ , x ₂ , ..., x _k , n) is analyzed from the restored control information in the upper layer than the physical layer in which the signal is restored.

 Although a method and apparatus for granting an uplink scheduling grant or a PUSCH grant using PDCCH DCI format 0 when discontinuous resource allocation is described and a method and apparatus for restoring resource allocation information, the following control is identical to transmitting continuous resource allocation information. Describes the transmission of discontinuous resource allocation information in information format and size.

As described above, although not limited, uplink resource allocation may control information transmitted by an uplink grant, which may correspond to DCI format 0. In this case, when the number of clusters increases during discontinuous resource allocation, the resource allocation information for expressing the larger clusters, that is, the range of RIV, also increases, thereby increasing the required bit amount and increasing overhead. In this case, the number of clusters when discontinuous resource allocation may be two to four. As such, the increase in the number of clusters increases overhead, but the increase in discontinuous clusters can lead to improved throughput.

A resource allocation method of two discrete clusters is described with reference to FIGS. 2 and 3, and a resource indicator is represented by Equations 2 and 3, and a resource allocation method of three discrete clusters is described with reference to FIGS. 6 and 7. The resource indicators are described in Equations 4 and 5 below.

Referring to FIG. 8, a discontinuous resource allocation method for allocating j resource regions from all n resource block groups and combining k-1 cluster allocations in the entire range of j-2 to express k clusters is described. It was generalized to Equation 6.

FIG. 13 is substantially the same as FIG. 8 except for limiting the range of j. Hereinafter, a method of discontinuous resource allocation that does not exceed the size of an uplink grant while taking advantage of yield improvement according to discontinuous resource allocation will be described with reference to FIG. 13.

Referring to FIG. 13, j may have all values of 2k-1 to n, and may have a range of 2k-1 to m. That is, the range of m has a range of 2k-1 = m <n. As a result, the range of j in FIG. 13 is 2k-1 = j = m (2k-1 = m <n). Thus, the clusters of FIG. 13 are each not equal in size and can be non-uniform within the range determined by m, and the maximum range region that the start of the first cluster and the end of the last cluster can have is m, and this maximum range region is It can exist anywhere between the entire areas 1 to n with the maximum range m.

In the case of a resource allocation method of two discrete clusters described with reference to FIGS. 2 and 3 (when the number of clusters is 2), the value of j corresponds to x, so that 3 = x = m (3 = m <n) range It can have In the resource allocation method of three discrete clusters (when the number of clusters is three) with reference to FIGS. 6 and 7, the value of j corresponds to a, and thus has a range of 5 = a = m (5 = m <n). It means to be. In this case, the resource allocation method of the two discrete clusters described with reference to FIGS. 2 and 3 or the resource allocation method of the three discrete clusters with reference to FIGS. 6 and 7 is the same as described above except for the ranges of x and a. Description is omitted.

As described above, the transmission of the discontinuous resource allocation information in the same control information format and size as the transmission of the continuous resource allocation information has been described. Hereinafter, the process of determining the m value in accordance with a specific bit requirement for discontinuous resource allocation and the resulting m value It describes.

 FIG. 14 illustrates a process of determining an m value according to a specific bit requirement when allocating two discrete clusters.

Referring to FIG. 14, first, the m value is set to n (S1410).

과 같이 위첨자 2를 수학식에 표시하였다. 결과적으로 m의 값의 의한 비트요구량 감소는 다음의 수학식과 같이 계산하여 얻어질 수 있다. cr는 각 x=m+1에 의해 주어지는 비트요구량을 나타낸다.Next, a binary bit amount of the number of all cases in the range (the range indicated by the end point of the last cluster from the start point of the first cluster) of all clusters is calculated (S1420). In Equation 2 or Equation 3, since RIV ₁ (x ₁ , n) represents the number of all cases up to x-1, when x = m + 1, RIV ₁ (m + 1, n) is Branches represent all cases of the range (the range from the start of the first cluster to the end of the last cluster, whose value is m). Where RIV ₁ (x ₁ , n) is for two clusters

Superscript 2 is expressed in the equation as follows. As a result, the bit requirement reduction due to the value of m can be obtained by calculating the following equation. cr represents the bit demand amount given by each x = m + 1.

[Equation 10]

Next, it is determined whether cr is equal to or smaller than dr by comparing the target bit demand cr with cr, which is given by each x = m + 1 (S1430). If cr is not equal to or less than dr, that is, if cr is greater than dr, steps S1420 and S1430 are repeated for the value of m minus one.

On the other hand, if cr is equal to or less than dr, m is the range of all clusters satisfying the target bit requirements.

 FIG. 15 illustrates a process of determining an m value according to a specific bit requirement when allocating three discrete clusters in a form of combining two and three clusters.

Referring to FIG. 15, first, the m value is set to n (S1510).

Next, the binary bit amount of the number in all cases of the range (the range indicated by the end point of the last cluster from the start point of the first cluster) of all clusters is calculated (S1520).

는 전술한 바와 같이 두개의 클러스터에 대한 모든 클러스터가 가지는 범위의 모든 경우를 나타내고

는 세개의 클러스터에 대한 모든 클러스터가 가지는 범위의 모든 경우를 나타낸다(위첨자 3은 세개의 클러스터를 의미함). 따라서,

와

의 합은 두개와 세개의 클러스터들에 대한 모든 클러스터가 가지는 범위의 모든 경우를 나타낸다. 결과적으로 m의 값의 의한 비트요구량 감소는 다음의 수학식 11과 같이 계산하므로서 얻어질 수 있다. cr는 각 x=m+1에 의해 주어지는 비트요구량을 나타낸다.

Denotes all cases of the range that all clusters for two clusters have as described above.

Denotes all cases of the range that all clusters have for three clusters (superscript 3 means three clusters). therefore,

Wow

Sum represents all cases of the range that all clusters for two and three clusters have. As a result, the bit requirement reduction due to the value of m can be obtained by calculating the following Equation (11). cr represents the bit demand amount given by each x = m + 1.

[Equation 11]

에서 ratio는 두 개의 클러스터가 가지는 전체 범위와 세 개의 클러스터가 가지는 전체 범위의 상대적인 비율을 나타낸다. At this time

The ratio in is the relative ratio of the full range of two clusters and the full range of three clusters.

Next, it is determined whether cr is equal to or smaller than dr by comparing the target bit demand cr with cr, which is given by each x = m + 1 (S1530). If cr is not equal to or less than dr, that is, if cr is greater than dr, steps S1520 and S1530 are repeated for the value of m minus one.

On the other hand, if cr is equal to or less than dr, m is the range of all clusters satisfying the target bit requirements.

When the value of m when dr is set to be 1 bit smaller than the resource allocation bit amount of the uplink grant is obtained, the ratio is as shown in Table 1.

TABLE 1

In Table 1, RA means a bit amount of a resource allocation field of uplink DCI format 0. For example, when the bandwidth BW is 20 MHz, the number of resource blocks is 100, and the number of resource block groups is 25, the bit amount RA of the resource allocation field of the uplink grant DCI format 0 is 13 bits. If cr is equal to or less than dr, m is 10. M is 12 if one bit can be used more than RA. If one more bit is available than the RA, the FH bit is used as a resource allocation field in a situation of discontinuous resource allocation.

14 and 15 exemplarily described a case where the number of discrete clusters is two or three, but m may be determined in the same manner even when the number of discrete clusters is four or more. That is, if the number of consecutive clusters is k, all cases of the range of all clusters for two to k clusters are calculated, and the calculated value is the binary value of the resource allocation field of the uplink grant DCI format 0. The value of m is equal to or less than (RA) or bit amount + 1 (RA + 1) of resource allocation.

As a result, in FIG. 13, the range of j is smaller than the total number of resource block groups. Therefore, the format of the PDCCH having discontinuous resource allocation remains the same as the size of the PDCCH having continuous resource allocation. There is an effect that the yield can be improved by allocation.

In addition, since the maximum range area that the start of the first cluster and the end of the last cluster can have in the case of discontinuous resource allocation has a maximum range m, it can have a positive effect on the interference problem of RF standard caused by the transmission of the discontinuous cluster. have. In other words, as the distance between clusters increases, the interference problem in RF standard tends to increase. As described above, when discontinuous resource allocation, the maximum range region that the start of the first cluster and the end of the last cluster can have is greater than the total number of resource block groups. Since the distance between the clusters is shortened, the interference problem in the RF standard is solved.

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

CROSS-REFERENCE TO RELATED APPLICATION

This patent application is filed with the Patent Application No. 10-2010-0000648 filed in Korea on January 5, 2010 and the Patent Application No. 10-2010-0043233 filed in Korea on May 7, 2010. (a) Claims priority under section 35 USC § 119 (a), all of which are hereby incorporated by reference in this patent application. In addition, if this patent application claims priority for the same reason as above for a country other than the United States, all the contents thereof are incorporated into this patent application by reference.

Claims (18)

In a wireless communication system, discontinuously allocating resources to k clusters (k is a natural number of two or more) including one or more resource block groups among all resource block groups of a specific terminal; And and generating a message indicating k discrete clusters at least one offset and at least one resource block group length or at least one other offset. The method of claim 1, And the message is included in a control channel and transmitted. The method of claim 2, The control channel includes a resource allocation field, wherein the resource allocation field comprises a resource indicator for indicating two or more discrete clusters. The method of claim 3, The resource indicator corresponds to 2k offsets, wherein two pairs of the 2k offsets each represent a start point and an end point of a specific cluster. The method of claim 3, And the resource indicator corresponds to k offsets and lengths of k resource block groups. The method of claim 1, And the message includes a resource indicator indicating discontinuous clusters represented by the following equation.

Where x ₁ and x ₂ ,... , x _k denotes at least one of an offset, a length of resource block groups, a start point or an end point of a specific cluster, n means a total number of resource block groups, and RIV ₁ (x ₁ , n) denotes x ₁ and function of n, RIV ₂ (x ₁ , x ₂ , n) is a function of x ₁ and x ₂ , n, and RIV ( x ₁ , x ₂ ,…, x _k , n) is x ₁ and x ₂ , … , x _k Means a function of n. The method of claim 6, In the expression representing the resource indicator, one or more of RIV ₁ to RIV _K , and some of the operation values thereof are starting points of the resource block group (Starting Resource Block,

) And the length of terms of virtually contiguously allocated resource blocks,

The resource allocation method of the base station, characterized in that for replacing the continuous resource corresponding to the resource indication value (RIV). The method of claim 3, K is 2, and the resource indicator indicates that two clusters and an offset y of the entire resource block group of resource block groups to which no resource is allocated and the total length x of the resource block groups are not allocated. And a base offset corresponding to the other offset w and length z of the region. The method of claim 8, The resource indicator is a resource allocation method of the base station characterized in that the following equation.

In the above formula, RIV (2) means resource indicator (RIV) of resource allocation field when discontinuous resource allocation to two discrete clusters.

Is a function of x and n, the total number of resource block groups,

Is a function of x and y,

Is a function of x and z,

Is a function of w. The method of claim 3, K is 3, and the resource indicator indicates an offset of the entire resource block group of three clusters and resource block groups to which no resource is allocated, the length of the entire resource block, and an offset y indicating an area where no resource allocation is made. and w, length x, z corresponding to the base station resource allocation method. The method of claim 10, wherein the resource indicator is expressed by the following equation.

Is a function of a and n, the total number of resource block groups,

Is a function of a and b,

Is a function of x and a-2,

Is a function of x and y,

Is a function of x and z,

Is a function of w. The method of claim 6, When the number of discrete clusters is k, the range of the start point of the first cluster and the end point of the last cluster ranges from 2k-1 to m (2k-1 = m <n). The method of claim 12, The m value is a binary value of the calculated value in all cases of the range of all clusters for two to k clusters, and the "bit amount (RA) of resource allocation field" or "bit amount of resource allocation field + 1 (RA). Resource allocation method of the base station, characterized in that m value equal to or less than "+1)". In a wireless communication system, allocating resources consecutively or discontinuously to k clusters (k is a natural number of two or more) including one or more resource block groups among all resource block groups of a specific terminal; And And generating continuous or discontinuous resource allocation information composed of one number system. The method of claim 14, The resource allocation information is a resource allocation method of a base station, characterized in that the following equation.

here,

Is resource allocation information with k clusters,

Denotes a maximum value of resource allocation information having i clusters. The method of claim 15, K = 2, and the resource allocation information is expressed by the following equation.

Here, RIV _LTE (z, w, n) is resource allocation information when continuous resource allocation, RIV (2) is resource allocation information when discontinuous resource allocation, To,

To,

To,

Means.

(Where x ₁ and x ₂ ,…, x _k respectively represent at least one of an offset, a length of resource block groups, a start point or an end point of a specific cluster, and n means a total number of resource block groups). Adding a cyclic redundancy check (CRC) for error detection to control information including resource allocation information; Generating coded data by performing channel coding on the control information added with the CRC; Modulating the encoded data to generate modulation symbols; And Method for transmitting control information of a base station for transmitting the modulation symbols to the physical resource element to the terminal. Demapping the received physical resource elements into symbols;  Demodulating the demapped symbols to generate data; Performing channel decoding on the demodulated data and checking a CRC to detect whether an error occurs; Removing the CRC from the decoded data to obtain necessary control information; And From the acquired control information

(Where x ₁ and x ₂ , ..., x _k respectively represent at least one of an offset, a length of resource block groups, a starting point or an end point of a specific cluster, and n means a total number of resource block groups). Method of processing the control information of the terminal comprising the step of interpreting the resource allocation information.

Images