KR20130028996A - Method for transmitting signal in wireless communication system and transmitter thereof, receiver - Google Patents

Abstract

PURPOSE: A resource assignment transmission method, a transmission device, and a reception device are provided to maintain the size of a discontinuous PDCCH(Physical Downlink Control CHannel) as the size of a continuous PDCCH. CONSTITUTION: Resources are discontinuity assigned to k clusters including one or more resource block groups of the whole resource block groups. Continuous or discontinuous information related to frequency hopping is generated. The continuous or the discontinuous information is constructed with one number system. Resource assignment information is included in a resource assignment field of a specific DCI(Downlink Control Information) format including one or more other fields. [Reference numerals] (1610,1640,1650) Resource assignment field; (1620) Frequency hopping field; (1630) Continuous or discontinuous break field; (A,B,C) DCI format

Description

Resource allocation transmission method in a wireless communication system and its transmission apparatus, and a reception apparatus corresponding thereto {METHOD FOR TRANSMITTING SIGNAL IN WIRELESS COMMUNICATION SYSTEM AND TRANSMITTER THEREOF, RECEIVER}

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 one or more natural numbers) including one or more resource block groups among all resource block groups of a specific terminal. Allocating resources consecutively or discontinuously; And generating continuous or discontinuous resource allocation information in which frequency hopping or frequency hopping consisting of one number system is performed.

In another aspect of the present invention, in a wireless communication system, resources are allocated consecutively or discontinuously to k clusters (k is one or more natural numbers) including one or more resource block groups among all resource block groups of a specific terminal. Making; And generating control information including resource allocation fields for expressing continuous resource allocation information in a range used for continuous resource allocation and for expressing a portion of discontinuous resource allocation information in a range not used for continuous resource allocation. Provide resource allocation methods.

In another aspect, in a wireless communication system, resources are allocated consecutively or discontinuously to k clusters (k is one or more natural numbers) including one or more resource block groups of all resource block groups of a specific terminal from a base station. Receiving control information including frequency hopping or non-frequency hopping continuous or discontinuous resource allocation information configured in one number system; And analyzing the continuous or discontinuous resource allocation information which is frequency-hopping or not frequency-hopping in one numbering system from the received control information.

In another aspect, in a wireless communication system, consecutively or discontinuously allocates resources to k clusters (k is one or more natural numbers) including one or more resource block groups among all resource block groups of a specific terminal. Receiving control information including continuous resource allocation information in a range used for resource allocation and including a resource allocation field representing a portion of the discontinuous resource allocation information in a range not used for continuous resource allocation; And expressing continuous resource allocation information in a range used for continuous resource allocation from the received control information, and interpreting a portion of the discontinuous resource allocation information in a range not used for continuous resource allocation. Provide a method.

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.
Figure 16 illustrates the format of the information payload format of the control channel.
FIG. 17 shows the ranges of each resource allocation when the resource allocation instruction of each resource indicator of the resource allocation field in continuous and discontinuous resource allocation, including frequency hopping, is assigned to one number system.
FIG. 18 shows ranges of resource allocation field values for representing continuous and discontinuous resource allocation in Table 3. FIG.
FIG. 19 illustrates a format of an information payload format of a control channel expressing continuous and discontinuous resource allocation while maintaining compatibility with FIG. 16A.

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

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

로 주어질 수 있다. 이때 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

Lt; / RTI > 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 (BS) 20. 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 are no restrictions on multiple access schemes applied to wireless communication systems. 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.

A TDD (Time Division Duplex) scheme in which uplink and downlink transmissions are transmitted using different time periods, or an FDD (Frequency Division Duplex) scheme in which they are transmitted using different frequencies can be used.

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, the specific resource allocation method or configuration is not limited to the LTE system described above, it should be understood as the 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

Lt; / RTI >

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.

&Quot; (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 equation,

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.

&Quot; (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

.

을 만족하는

를 구한다.3)

To satisfy

.

을 만족하는

를 구한다.4)

To satisfy

.

를 구한다.5)

.

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 indicator of the resource allocation field in the discontinuous resource allocation shown in FIG. 3 (b) may be 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 the discontinuous resource allocation is divided into two clusters 310 and 320 and the resource block group 360 of the entire region 330 of the resource block groups to which no resource is allocated. Corresponding to the start point (w) and the end point (z) of the region 330 where no resource is allocated between the two clusters 310, 320, and the offset y of the entire 360. It may consist of a Resource Directive (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 > 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, if 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.

&Quot; (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 can be expressed 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 a total number of resource block groups is n, a discontinuous resource having k clusters is obtained 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.

&Quot; (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

.

한다. 3)

do.

4) i = i + 1

5) If i> k, the process ends. If not, the process of 2) is returned.

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

&Quot; (9) "

,

의 의미를 갖는다.

또는

의 의미를 갖고

또는

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

,

Has the meaning.

or

Has 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 assignment of 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 original 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.

Figure 16 illustrates the format of the information payload format of the control channel.

Physical downlink control channel (PDCCH), which is one of control channels for transmitting control information, is divided into various DCI formats (Downlink Control Indication format, DCI format) and provides UE specific control information (UE specific). . When transmitting UE-specific control information, the UE provides information for decoding a Physical Downlink Shared Channel (PDSCH) or a Physical Uplink Shared Channel (PUSCH) from the terminal's point of view and communicates with the UE at the same time. It also provides the necessary control information.

Referring to FIG. 16A, DCI format x (x is a number of current or future DCI formats), for example, DCI format 0 indicates resource allocation field 1610 and frequency hopping field 1620 and continuous / discontinuous distinction. Field 1630 may include. In this case, DCI format 0 is described as DCI format x by way of example, but the same method may be applied to any DCI formats present or future.

The resource allocation field 1610 includes resource allocation information used for transmission of uplink or downlink data. In this case, the method of expressing resource allocation information in the resource allocation field 1610 may be the above-described resource allocation method, the resource allocation method described later, or any resource allocation method in the present or future.

The frequency hopping field 1620 indicates whether frequency hopping is performed as shown in Table 1 using a specific number of bits, for example, a frequency hopping bit of 1 bit.

Frequency hopping bits Information One Frequency hopping 0 No frequency hopping

The continuous / discontinuous division field 1630 can distinguish whether downlink or uplink resource allocation is continuous or discontinuous as shown in Table 2 by using a specific number of bits, for example, a continuous / discontinuous division bit of 1 bit.

Continuous / Discontinuous Separation Bits Information One Non-contiguous resource allocation 0 Contiguous resource allocation

Frequency hopping helps improve performance for contiguous resource allocation, but frequency hopping may not help improve performance for non-contiguous resource allocation. That is, for continuous resource allocation, it is necessary to classify resource allocation by reflecting the matters on frequency hopping, but it may not be necessary to consider frequency hopping for discontinuous resource allocation.

Accordingly, as shown in FIG. 16B, in the DCI format x, the continuous / discontinuous partition bit 1630 is maintained and a frequency hopping bit may be used as the resource allocation field 1640 when discontinuous resource allocation.

Limit the number of clusters k of discontinuous resource allocation to 2, for example, and allocate discontinuous resources in the form of a resource block group (RBG) that combines several resource blocks (RBs) and contiguous resources in DCI format x. The number of bits of the resource allocation field in DCI format x is formed by adding a frequency hopping bit (1 bit) to the allocation field (1610 in FIG. 16A) to form a discontinuous resource allocation field (1614 in FIG. 16B). Discrete resource allocation can be expressed without expansion of.

On the other hand, when DCI format x is DCI format 0, the continuous / discontinuous division field 1630 requires a bit more than 1 bit more than DCI format 0, so that a surplus bit always remains at least 1 bit in DCI format 0 Can be used. That is, in the blind decoding process, DCI format 0 and DCI format 1A are treated as the same decoding process, and are blindly decoded assuming a certain size for each band. After the predetermined size is confirmed, a DCI format 0 or DCI format 1A is distinguished through a division bit inside the PDCCH (a division bit for distinguishing DCI format 1A from DCI format 1A). As described above, DCI format 0 and DCI format 1A are designed to have the same size, and DCI format 1A requires more than one bit more than DCI format 0 considering the use of internal fields of DCI format 0 and DCI format 1A, respectively. Therefore, in DCI format 0, there are always more than one bit of surplus bits left. In other words, when DCI format x is DCI format 0, the surplus bits may be used as the continuous / discontinuous division field 1630.

An example of frequency hopping is described below by considering a case in which a bit request amount of the discontinuous resource allocation field 1640 is one bit larger than the length of the continuous resource allocation field 1610 by using a resource block group (RBG) and limiting the number of clusters. In addition, when assigning consecutive and discontinuous resources, the resource allocation instruction of each resource indicator in the resource allocation field may be assigned in one number system.

In the above-described embodiment, frequency hopping was not considered when assigning resource allocation instructions of resource indicators of resource allocation fields to a single numbering system in continuous and discontinuous resource allocation. Can be considered That is, one number system of the aforementioned resource allocation field may be extended as shown in Equation 10.

FIG. 17 shows the ranges of each resource allocation when the resource allocation instruction of each resource indicator of the resource allocation field in continuous and discontinuous resource allocation, including frequency hopping, is assigned to one number system.

에 할당하고 주파수 호핑하는 연속 자원할당의 범위를

에 할당하고 불연속 자원할당의 범위를

에 할당할 수 있다.

인 경우 한계가

로 한정된다.Referring to Equations 10 and 17, the range of continuous resource allocation without frequency hopping is determined.

Assigns a range of consecutive resource allocations

To the scope of the discontinuous resource allocation

Can be assigned to

If the limit is

It is limited to.

은 연속자원할당의 최대범위를 의미한다.

은 두 개의 클러스터들을 가지는 불연속자원할당의 최대범위를 의미한다. 여기서

이고 P는 자원블록그룹(RGB)의 크기를 의미한다. 또한

를 의미하고

는 a보다 크면서 가장 가까운 정수를 의미한다. 위에서

는 주파수 호핑 비트(1비트)와 자원할당필드(

비트), 연속/불연속 구분비트(1비트)의 길이를 합한 것을 의미한다.N is the number of uplink or downlink resource blocks.

Means the maximum range of continuous resource allocation.

Means the maximum range of discontinuous resource allocation with two clusters. here

P denotes the size of the resource block group (RGB). Also

Means

Is the closest integer greater than a. Above

Is a frequency hopping bit (1 bit) and a resource allocation field (

Bits) and the sum of the lengths of the continuous / discontinuous separator bits (1 bit).

For example, the number n of resource blocks may be one of natural numbers greater than zero, and the size P of the resource block group RBG may be one of natural numbers smaller than n greater than 1, but is not limited thereto.

으로 알려져 있다. 이때 k가 1인 경우는 연속 자원할당을 의미하며 k가 2인 경우는 2개의 클러스터들에 불연속적으로 자원할당을 의미한다. Meanwhile, when k clusters are allocated to a given resource block of n , all possible combinations

Known as If k is 1, it means continuous resource allocation, and if k is 2, it means discontinuous resource allocation to two clusters.

이 되고 연속 자원할당필드의 비트수는 5비트가 될 수 있다. 도 16의 (B)에 도시한 바와 같이 자원할당필드(164)의 비트수는 주파수 호핑 비트(1비트)를 더하면 6비트가 된다. 이 경우 자원블록그룹(RBG)의 크기는 P=1이 되고 불연속 자원할당의 범위는

이 되어 7비트가 된다. 따라서, 연속자원할당필드에 주파수 호핑 비트를 추가하더라도 0~69의 범위중에서 64~69의 범위에 해당하는 불연속 자원할당정보를 나타낼 수 없다.For example, if n = 7, the maximum range of continuous resource allocation is

The number of bits of the continuous resource allocation field may be 5 bits. As shown in FIG. 16B, the number of bits of the resource allocation field 164 is 6 bits when frequency hopping bits (1 bit) are added. In this case, the size of the resource block group (RBG) is P = 1 and the range of discontinuous resource allocation is

This becomes 7 bits. Therefore, even if the frequency hopping bit is added to the continuous resource allocation field, discontinuous resource allocation information corresponding to 64 to 69 in the range of 0 to 69 cannot be represented.

Therefore, in the DCI format x shown in FIG. 16B, the resource allocation field 1640 shows both continuous and discontinuous resource allocation in 7 bits, and the continuous and discontinuous fields are expressed in 1 bit in the continuous / discontinuous division field 1630. A total of 8 bits may be required for this purpose.

As shown in (C) of FIG. 16, uplink or downlink resource allocation is performed using one numbering system of continuous resource allocation, frequency hopping, non-frequency hopping, and continuous resource allocation in DCI format x. It may be expressed in the resource allocation field 1650.

Frequency hopping when uplink or downlink resource allocation is represented in the resource allocation field 1650 by using a single numbering scheme for continuous resource allocation for frequency hopping, continuous resource allocation for non-frequency hopping, and discontinuous resource allocation in DCI format x. The ranges of the continuous resource allocation, the continuous resource allocation without frequency hopping, and the discrete resource allocation can be expressed by Equation 11 below.

On the other hand, in the DCI format x may be configured to extend the method of applying the continuous / discontinuous classification bits by applying one number system for representing continuous and discontinuous resource allocation. This method has an advantage of maintaining compatibility with the method using the continuous / discontinuous partition bits shown in FIG. 16A.

In the DCI format x, a scheme of applying continuous / discontinuous division bits by applying one number system for representing continuous and discontinuous resource allocation can be described in Table 3 as follows.

Continuous / Discontinuous Allocation Frequency hopping Resource Allocation Field Value Range used Unused range Continuous resource allocation
(Division bit = 0) No frequency hopping (frequency hopping bit = 0)

Frequency hopping
(Frequency hopping bit = 1)

none Discrete Resource Allocation
(Division bit = 1)

이다. 따라서 주파수 호핑하지 않은 연속 자원할당시

의 범위는 사용되지 않고 남는다. 주파수 호핑하지 않은 연속 자원할당시 사용되지 않아 남는

의 범위를 불연속 자원할당에 사용할 수 있다.At this time, the range not used for continuous resource allocation without frequency hopping is

to be. Therefore, continuous resource allocation without frequency hopping

The range of is left unused. Remaining unused during continuous resource allocation without frequency hopping

The scope of can be used for discontinuous resource allocation.

18A to 18C show ranges of resource allocation field values for representing continuous and discontinuous resource allocation in Table 3. 19A to 19C illustrate a format of an information payload format of a control channel expressing continuous and discontinuous resource allocation while maintaining compatibility with FIG. 16A.

이다.Referring to FIGS. 18A and 19A, the field value of the frequency hopping field 1920 is “0” and the field value of the continuous / discontinuous division field 1930 is “0”. Range used as the field value of the continuous resource allocation field 1910

to be.

Similarly, referring to FIGS. 18B and 19B, when the field value of the frequency hopping field 1920 is "1" and the field value of the continuous / discontinuous division field 1930 is "0", the frequency hopping is performed. In case of continuous resource allocation, continuous resource allocation information for frequency hopping in the continuous resource allocation field 1910 is represented.

이다. 이때

로 불연속 자원할당필드(1940)의 필드값으로 0~

까지만 사용할 수 있고

의 범위를 지원할수 없다.Referring to (C) of FIG. 18 and (C) of FIG. 19, the field value of the continuous / discontinuous division field (1930) is “1”, and the discontinuous resource in which the frequency hopping field and the continuous resource allocation field are integrated when discontinuous resource allocation is performed. The field value of the assignment field 1940 is

to be. At this time

0 to 0 as the field value of the discontinuous resource allocation field (1940).

Can only be used

It cannot support the range of.

로 불연속 자원할당필드(1940)의 필드값으로 불연속 자원할당정보를 모두 표현할 수 없는 경우 도 18의 (A)에 도시한 바와 같이 주파수 호핑하지 않은 연속 자원할당시 사용되지 않는 범위

를 불연속 자원할당에 사용할 수 있다. 다시 말해 도 18의 (A)에 도시한 바와 같이 연속/불연속 구분필드(1930)의 필드값이 “0”이며 자원할당필드(1910)의 필드값이

인 것은 불연속 자원할당정보를 표현한 것으로 이해될 수 있다.

When the discontinuous resource allocation information cannot be represented by the field values of the discontinuous resource allocation field 1940, the range not used when continuous resource allocation without frequency hopping as shown in FIG.

Can be used for discontinuous resource allocation. In other words, as shown in FIG. 18A, the field value of the continuous / discontinuous division field 1930 is "0" and the field value of the resource allocation field 1910 is

Can be understood as a representation of discrete resource allocation information.

로 불연속 자원할당필드(1940)의 필드값으로 불연속 자원할당정보를 모두 표현할 수 없는 경우 도 18의 (A)에 도시한 바와 같이 주파수 호핑하지 않은 경우 연속 자원할당시 사용되지 않는 범위

를 불연속 자원할당에 사용하는 사항을 다시 정리하면 표 4와 같다.

As the field value of the discontinuous resource allocation field 1940 cannot represent all of the discontinuous resource allocation information, the range not used when continuous resource allocation is not performed when frequency hopping as shown in FIG.

Table 4 summarizes the requirements for using discontinuous resource allocation.

Continuous / Discontinuous Allocation Frequency hopping Resource Allocation Field Value Range used Unused range Continuous resource allocation
(Division bit = 0) No frequency hopping (frequency hopping bit = 0)

→ not supported by discrete resource allocation

Assign part of Frequency hopping
(Frequency hopping bit = 1)

none Discrete Resource Allocation
(Division bit = 1)

(0 ~

Only available)

까지만 사용할 수 있으며

의 범위는 지원이 되지 않는다. 도 18의 (A)에 도시한 바와 같이 주파수 호핑하지 않은 연속 자원할당시 사용되지 않는 범위

를 불연속 자원할당에서 지원되지 않는

의 부분으로 사용할 수 있다. Referring to Table 4, field values of the discontinuous resource allocation field (1940) are 0 to 0.

Only available until

The range of is not supported. As shown in FIG. 18A, a range not used during continuous resource allocation without frequency hopping

Unsupported in discrete resource allocation

Can be used as part of

For example, n = 7 and the case of discontinuous resource allocation to two clusters is applied and is shown in Table 5.

Continuous / Discontinuous Allocation Frequency hopping Resource Allocation Field Value Range used Unused range Continuous resource allocation
(Division bit = 0) No frequency hopping (frequency hopping bit = 0) 0-27 28-31 → Allocate 64-70 parts that are not supported by discontinuous resources (ie 28 → 64, 29 → 65, 30 → 66, 31 → 67). Frequency hopping
(Frequency hopping bit = 1) 0-31 none Discrete Resource Allocation
(Division bit = 1) 0 ~ 69 (available only from 0 ~ 63, need to specify 64 ~ 67 and use the remaining range of continuous resource allocation above)

Referring to Table 5, only 0 to 63 can be used as a field value of the discontinuous resource allocation field 1940, and a range of 64 to 69 is not supported. The unused range 28-31 for non-frequency-hopping contiguous resource allocations may be used as 64-67, part of the range 64-69 not supported for discontinuous resource allocations. In other words, the range 28 to 31, which is not used for frequency resource-hopping contiguous resource allocation, can be used as 64 to 67, which is part of the range not supported for discontinuous resource allocation. That is, it can be used as 28 → 64, 29 → 65, 30 → 66, 31 → 67.

In the above-described embodiment, the case in which the discontinuous resource allocation falls within the range of 68 to 69 which is not supported by the discontinuous resource allocation may not be represented, and thus the gain may be relatively small. However, considering the case of n = 101, the method of separately expressing continuous or discontinuous resource allocation information, as shown in FIG. 16A, cannot represent all of the discontinuous resource allocations. Has the advantage of being able to represent all within a given resource allocation field.

In the above examples, the manners (or algorithms) for expressing continuous or discontinuous resource allocation information in the resource allocation field may be any manner of expressing current or future resource allocation information without being limited to the methods described above or below. .

The above describes resource indicators of common continuous and discontinuous resource allocation methods, and the following describes some substitutions 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.

In addition, resource allocation information may be represented in the resource allocation field by using one number system described with reference to FIGS. 16 to 19 or Equations 10 and 11 and Tables 3 to 5, or by applying one numbering system. Resource allocation information can be expressed by applying.

의 범위에 할당하고 주파수 호핑하는 연속자원할당의 범위를

의 범위를 할당하고 불연속 자원할당의 범위를

에 할당할 수 있다.For example, referring to Equation 10 and FIG. 17, the range of continuous resource allocation without frequency hopping is defined.

The range of continuous resource allocation to assign to the range of

Assign the scope of

Can be assigned to

로 불연속 자원할당필드(1940)의 필드값으로 불연속 자원할당정보를 모두 표현할 수 없는 경우 도 18의 (A)에 도시한 바와 같이 주파수 호핑하지 않은 경우 연속 자원할당시 사용되지 않는 범위

를 불연속 자원할당에 사용할 수 있다. For another specific example, referring to Table 4 and FIGS. 18A to 18C,

As the field value of the discontinuous resource allocation field 1940 cannot represent all of the discontinuous resource allocation information, the range not used when continuous resource allocation is not performed when frequency hopping as shown in FIG.

Can be used for discontinuous resource allocation.

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 decoding process and then the coefficients of the resource indicators corresponding thereto 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.

In addition, the resource allocation information expressed in the resource allocation field is interpreted as one number system described with reference to FIGS. 16 to 19 or Equations 10 and 11 and Tables 3 to 5, or continuous / discontinuous classification by applying one number system. It can be interpreted as a bit applied.

인 것으로 해석된 경우 주파수 호핑하지 않는 연속 자원할당으로 해석하고

인 것으로 해석되는 경우 주파수 호핑하는 연속자원할당으로 해석하고

인 경우 불연속 자원할당으로 해석할 수 있다. For example, with reference to Equations 10 and 17, the field value of the resource allocation field is

If interpreted to be interpreted as continuous resource allocation without frequency hopping

If interpreted as, it is interpreted as frequency allocation hopping

Can be interpreted as discrete resource allocation.

로 불연속 자원할당필드(1940)의 필드값은 불연속 자원할당정보로 해석하고 도 18의 (A)에 도시한 바와 같이 주파수 호핑 필드(1920)의 필드값이 0이며 자원할당필드(1910)의 필드값이 주파수 호핑하지 않은 연속 자원할당으로 사용되지 않는 범위

이라면 불연속 자원할당의 나머지 자원할당정보로 해석할 수 있다. For another specific example, referring to Table 4 and FIGS. 18A to 18C,

The field value of the discontinuous resource allocation field 1940 is interpreted as discontinuous resource allocation information. As shown in FIG. 18A, the field value of the frequency hopping field 1920 is 0, and the field of the resource allocation field 1910. Range where values are not used for contiguous resource allocation without frequency hopping

If so, it can be interpreted as the remaining resource allocation information of the discontinuous resource allocation.

In the present invention, the configuration of some fields of the DCI format may be used for other purposes. That is, some of the values of the resource allocation field or a combination of other fields related to the resource allocation proposed in the present invention may be dedicated for other purposes. For example, both the resource allocation field and the frequency hopping field may have a value of “1” and may be used for activation and release of semi-persistent scheduling (SPS). SPS refers to a method of statically scheduling control information until release through one activation without transmitting an additional physical downlink control channel. When used in other applications as described above, a field numbering system or a combination field numbering system is configured except for a corresponding field value and a combination field value. For example, when n = 7, if the frequency hopping field, resource allocation field, and division field are used as SPS in the form of “111111110”, the number is in the form of “111111110” not present after “111111101” and going to “111111111”. Construct the system.

Although a method and apparatus for granting an uplink scheduling grant or a PUSCH grant using PDCCH DCI format 0 when discontinuous resource allocation has been described and a method and apparatus for restoring resource allocation information have been described, hereinafter, the same control as for transmitting continuous resource allocation information is described. 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.

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.

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

If 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 6 below.

In Table 6, 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. Thus, the number of discontinuous resources is not increased. 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. That is, 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 number of total 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 intended to illustrate rather than limit the scope of the present invention, and the scope of the technical idea of the present invention is not limited by these embodiments. The scope of protection of the present invention should be construed according to the following claims, and all technical ideas falling within the scope of the same shall be construed as falling within the scope of the present invention.

Claims (16)

In a wireless communication system, allocating resources consecutively or discontinuously to k clusters (k being one or more natural numbers) 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 with frequency hopping or frequency hopping consisting of one number system. The method of claim 1,
The resource allocation information indicates a range of continuous resource allocation without frequency hopping.

(n means the number of resource blocks) and the range of continuous resource allocation to frequency hopping

(

Means

As it is greater than a means allocated to the nearest whole number) and a range of discrete resource allocation

(

And P denotes a size of a resource block group (RGB). The method of claim 1,
Including the resource allocation information in a resource allocation field of a specific DCI format (Downlink Control Information format) to which at least one other field is added, the resource allocation field is transmitted to the specific terminal through a physical downlink control channel (PDCCH) The resource allocation method of the base station further comprising the step. The method of claim 3,
And the other field is a frequency hopping field and a continuous / discontinuous division field. In a wireless communication system, allocating resources consecutively or discontinuously to k clusters (k being one or more natural numbers) including one or more resource block groups among all resource block groups of a specific terminal; And
Generating control information including resource allocation fields expressing continuous resource allocation information in a range used for continuous resource allocation and expressing a portion of discontinuous resource allocation information in a range not used for continuous resource allocation. Resource allocation method. The method of claim 5,
The control information further includes a continuous / discontinuous classification field for distinguishing whether continuous / discontinuous resource allocation,
When the continuous / discontinuous division field expresses continuous resource allocation, the resource allocation field expresses continuous resource allocation information in a range used for continuous resource allocation and expresses a portion of discontinuous resource allocation information in a range not used for continuous resource allocation. ,
And the resource allocation field represents another part of the discontinuous resource allocation information when the continuous / discontinuous division field expresses discontinuous resource allocation. The method according to claim 6,
The control information further includes a frequency hopping field representing whether or not frequency hopping,
When the frequency hopping field indicates that frequency hopping is not performed, the resource allocation field expresses continuous resource allocation information in a range used for continuous resource allocation and expresses a portion of discontinuous resource allocation information in a range not used for continuous resource allocation. Resource allocation method of the base station, characterized in that. The method of claim 7, wherein
When the frequency hopping field indicates that frequency hopping is not performed, the range used for continuous resource allocation is

(n means the number of resource blocks) and the range not used for continuous resource allocation is

(

Means

( A means greater than a means the nearest integer). In a wireless communication system, resources are allocated consecutively or discontinuously to k clusters (k is a natural number of 1 or more) including one or more resource block groups among all resource block groups of a specific terminal from a base station, and one number system. Receiving control information including frequency hopping or continuous or discontinuous resource allocation information not configured to frequency hopping; And
And analyzing the continuous or discontinuous resource allocation information in which frequency hopping or no frequency hopping is performed from the received control information in a single number system. 10. The method of claim 9,
The resource allocation information indicates a range of continuous resource allocation without frequency hopping.

(n means the number of resource blocks) and the range of continuous resource allocation to frequency hopping

(

Means

As it is greater than a means allocated to the nearest whole number) and a range of discrete resource allocation

(

And P denotes a size of a resource block group (RGB). 10. The method of claim 9,
Including the resource allocation information in a resource allocation field of a specific DCI format (Downlink Control Information format) to which at least one other field is added, the resource allocation field is transmitted to the specific terminal through a physical downlink control channel (PDCCH) Resource allocation information processing method of the terminal further comprising a step. The method of claim 11,
And the other field is a frequency hopping field and a continuous / discontinuous partitioning field. In a wireless communication system, resources are allocated consecutively or discontinuously to k clusters (k is one or more natural numbers) including one or more resource block groups among all resource block groups of a specific terminal and used for continuous resource allocation. Receiving control information including resource allocation fields expressing continuous resource allocation information in a range and expressing a portion of the discontinuous resource allocation information in a range not used for continuous resource allocation; And
Expressing continuous resource allocation information from the received control information to a range used for continuous resource allocation and interpreting a portion of the discontinuous resource allocation information in a range not used for continuous resource allocation. . The method of claim 13,
The control information further includes a continuous / discontinuous classification field for distinguishing whether continuous / discontinuous resource allocation,
When the continuous / discontinuous division field expresses continuous resource allocation, the resource allocation field expresses continuous resource allocation information in a range used for continuous resource allocation and expresses a portion of discontinuous resource allocation information in a range not used for continuous resource allocation. ,
And the resource allocation field represents another part of the discontinuous resource allocation information when the continuous / discontinuous division field expresses discontinuous resource allocation. 15. The method of claim 14,
The control information further includes a frequency hopping field representing whether or not frequency hopping,
When the frequency hopping field indicates that frequency hopping is not performed, the resource allocation field expresses continuous resource allocation information in a range used for continuous resource allocation and expresses a portion of discontinuous resource allocation information in a range not used for continuous resource allocation. Resource allocation information processing method of a terminal. 16. The method of claim 15,
When the frequency hopping field indicates that frequency hopping is not performed, the range used for continuous resource allocation is

(n means the number of resource blocks) and the range not used for continuous resource allocation is

(

Means

As is greater than a most meaning the nearest whole number), resource allocation information processing method of the terminal, characterized in that.

Images