Method and apparatus for indicating deactivation of semi-persistent scheduling

Note: Within nine months ofthe publication ofthe mention ofthe grant ofthe European patent in the European Patent Bulletin, any person may give notice to the European Patent Office of opposition to that patent, in accordance with the Implementing Regulations. Notice of opposition shall nőt be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention).

Printed by Jouve, 75001 PARIS (FR) (Cont. next page)

ΕΡ 2 248 383 Β1 • SAMSUNG: SPS resource release, 3GPP DRAFT; R2-084455 SPS RESOURCE RELEASE, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921

SOPHIA-ANTIPOLIS CEDEX ; FRANCÉ, no. Jeju; 20080812, 12 August 2008 (2008-08-12), XP050319508, [retrieved on 2008-08-12]

ΕΡ 2 248 383 Β1

Description [Technical Field] [0001] The present invention relates to a wireless communication system, and more particularly, to a method fór scheduling rádió resources fór semi-persistent uplink/downlink packet data transmission in a cellular wireless communication system, a structure of scheduling information, a scheme fór transmitting the scheduling information, and an apparátus using the above-mentioned method and scheme as well as the scheduling information structure.

[Background Art] [0002] A 3^rd Generation Partnership Project Long Term Evolution (3GPP LTE) communication system (hereinafter referred to as an LTE system fór convenience of description) will hereinafter be described as an example of a mobile communication system applicable to the present invention.

[0003] A frame structure fór use in the LTE system will hereinafter be described. The 3GPP LTE system supports a type 1 rádió frame structure applicable to frequency division duplex (FDD), and a type 2 rádió frame structure applicable to time division duplex (TDD).

[0004] FIG. 1 shows a structure of a type 1 rádió frame used in the LTE system. The type 1 rádió frame includes 10 subframes, each ofwhich consists oftwo slots. A time length of each constituent unit is shown in FIG. 1.

[0005] FIG. 2 shows a structure of a type 2 rádió frame used in the LTE system. The type 2 rádió frame includes two half-frames, each ofwhich is composed of five subframes, a downlink piloting time siót (DwPTS), a guard period (GP), and an uplink piloting time siót (UpPTS), in which one subframe consists oftwo slots. That is, one subframe is composed of two slots irrespective of the rádió frame type. A time length of each constituent unit is shown in FIG. 2.

[0006] A resource grid structure fór use in the LTE system will hereinafter be described in detail.

[0007] FIG. 3 shows an uplink (UL) time-frequency resource grid structure fór use in the 3GPP LTE system.

[0008] Referring to FIG. 3, an uplink signal transmitted from each siót can be described by a resource grid including λ/® subcarriers and λΛ²

-ÍV RB IN SC iy sytr,

Λ^repr* stituting one RB, and represents the numberofSC-FDMAsymbois in one uplinkslot. Λ/⁷* varies with an uplink

J- V symb ÍV RB transmission bandwidth constructed in a cell, and must satisfy J\T™^,UL < . Here, AT^^,UL '^s th^e

Single Carrier - Frequency Division Multiple Access (SC-FDMA) symbols. Here, represents the number of resource blocks (RBs) in an uplink, represents the number of subcarriers ι 'RB 'RB smaiiest uplink bandwidth supported bythe wireless communication system, and '^s the largest uplink bandwidth

RB supported by the wireless communication system. Although ^UL may be set to 6 ( min,UL max.UL

RB —υ / ivrb are nőt limited thereto. The number of SCFDMA symbols contained in one siót may be differently defined according to the length of a Cyclic Prefix (CP) and the spacing between subcarriers.

[0009] Each element contained in the resource grid is called a resource element (RE), and can be identified by an UL;

may be set to 110 ( /V^^X,UL =110 ) , the scopes of N^UL and max,UL index pair (A,/) contained in a siót, where kis an index in a frequency domain and issetto anyone of 0,,.— 1 , and / is an index in a time domain and is set to any one of 0,...,—1 [0010] A Physical Resource Block (PRB) is defined by a/^77, consecutive SC-FDMA symbols in a time domain and J- V symb

NTc consecutive subcarriers in a frequency domain. _b and ^may be predetermined values, respectively.

Therefore, one PRB in an uplink may be composed of Λ 7™ χ resource elements. In addition, one PRB may

J- V symb -i V SC correspond to one siót in a time domain and 180kHz in a frequency domain. A PRB numbern_PRB and a resource element index (k,l) in a siót can satisfy a predetermined relationship denoted by n_pRB

TV i/'sc [0011] FIG. 4 shows a downlink (DL) time-frequency resource grid structure fór use in the LTE system.

[0012] Referring to FIG. 4, a downlink signal transmitted from each siót can be described by a resource grid including NmN™ subcarriers and ~^^DÍ_b OFDM symbols. Here, Λ represents the number of resource blocks (RBs)

ΕΡ 2 248 383 Β1 in a downlink, ν represents the number of subcarriers constituting one RB, and _b represents the number of

OFDM symbols in one downlink siót. AT^DL varies with an uplink transmission bandwidth constructed in a cell, and must -tv rb satisfy jV^’^DL < . Here, TV^ⁿ’^DL '^s smallest uplink bandwidth supported by the wireless communication system, and is the largest uplink bandwidth supported by the wireless communication system.

'RB

Although ^DL may be set to 6 and jV^^x,DL rnay be set to 110 ( Á^r^^x’^DL =110) , the scopes of ^{DL ar|}d

7V)^^x’^{DL are} nőt limited thereto. The numberof OFDM symbols contained in one siót may be differently defined according RB to the length of a Cyclic Prefix (CP) and the subcarrier spacing. When transmitting data or information via multiple antennas, one resource grid fór each antenna port may be defined.

[0013] Each element contained in the resource grid is called a resource element (RE), and can be identified by an index pair (A,/) contained in a siót, where kis an index in a frequency domain and issetto any one of —1 , and / is an index in a time domain and is set to any one of 0,..., — 1 .

[0014] Resource blocks (RBs) shown in FIGS. 3 and 4 are used to describe a mapping relationship between certain physical channels and resource elements (REs). The RBs can be classified intő physical resource blocks (PRBs) and Virtual resource blocks (VRBs). Although the above mapping relationship between the VRBs and the PRBs has been disclosed on a downlink basis, the same mapping relationship may alsó be applied to an uplink.

[0015] One PRB is defined by j\f°^L_b consecutive OFDM symbols in a time domain and ^yT^ consecutive subcarriers in t-DL _rRB a frequency domain. AT and AT may be predetermined values, respectively. Therefore, one PRB may be -ϊ V symb IV SC composed of AT -t V .

DL symb symb _rRB

N7c resource elements. One PRB may correspond to one siót in a time domain and may alsó correspond to 180kHz in a frequency domain, bút it should be noted that the scope ofthe present invention is nőt limited thereto.

_rDL in the frequency domain. A PRB number n_PRB and a k

[0016] The PRBs are assigned numbers from 0 to resource element index (k,l) in a siót can satisfy a predetermined relationship denoted by n_PRS =

N,

RB [0017] The VRB may have the same size as that of the PRB. Two types of VRBs are defined, the first one being a localized VRB (LVRB) and the second one being a distributed type (DVRB). Fór each VRB type, a pair of VRBs in two slots of one subframe may assigned a single VRB number n_VRB.

[0018] The VRB may have the same size as that of the PRB. Two types of VRBs are defined, the first one being a localized VRB (LVRB) and the second one being a distributed VRB (DVRB). Fór each VRB type, a pairof PRBs may have a single VRB index (which may hereinafter be referred to as a ’VRB numberj and are allocated over two slots of one subframe. In other words,

VRBs belonging to a first one of two slots constituting one subframe are each assigned any one index of 0 to AT^öi -1 and A T^DL VRBs belonging to a second one of the two slots are likewise TV KB ’ -í V RB each assigned any one index of 0 to -1.

[0019] In the LTE system based on an Orthogonal Frequency Division Multiple Access (OFDMA) scheme, a resource area in which each UE is able to transmit or récéivé data to and from a base station (BS) is allocated from the BS to the UE. In this case, nőt only a time resource bút alsó a frequency resource must be simultaneously allocated to the UE so as to complete resource allocation.

[0020] The so-called non-persistent scheduling method can simultaneously indicate time-frequency resource domains allocated to the UE. Therefore, if there is a need fór the UE to use resources fór a long period oftime, it must repeatedly perform signaling fór resource allocation, so that signaling overhead may be considerably generated.

[0021] In contrast, the so-called semi-persistent scheduling method first allocates a time resource to a UE. In this case, the semi-persistent scheduling method may allow the time resource allocated to a specific UE to have periodicity. Then, the semi-persistent scheduling method allocates a frequency resource to the UE when necessary to complete time-frequency resource allocation. The above-mentioned frequency resource allocation may be referred to as ’activation’. When using the semi-persistent scheduling method, resource allocation can be maintained fór a predetermined period by only one signaling process, so that resources need nőt be repeatedly allocated, resulting in reduction in signaling overhead. Thereafter, if the necessity of performing resource allocation fór a UE disappears, a base station

ΕΡ 2 248 383 Β1 can transmit a signaling message fór releasing the frequency resource allocation to the UE. In this way, the abovementioned release ofthe frequency resource domain may be referred to as ’deactivation’. In this case, it is preferable that the signaling overhead needed fór the deactivation be reduced.

[0022] The document PANASONIC: SPS activation and release, 3GPP DRAFT; R1-084233, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCÉ, no.Prague, Czech Republic; 20081104, 4 November 2008 (2008-11-04), XP050317519, describes setting the MCS (modulation and coding scheme) field to be entirely fiiled with a ’T.

[Disclosure] [Technical Problem] [0023] An object of the present invention devised to solve the problem lies in a method and apparátus fór informing a UE of SPS deactivation without adding a new bit field or a new control channel formát in a communication system fór allocating resources using a compact scheme.

[Technical Solution] [0024] The object ofthe present invention can be achieved by providing a method fór releasing resource allocation in a wireless mobile communication system according to claim 1.

[0025] In another aspect of the present invention, there is provided a user equipment (UE) fór a wireless mobile communication system according to claim 6.

[0026] The downlink control channel may be a physical downlink control channel (PDCCH).

[0027] A downlink control information (DCI) formát ofthe downlink control channel may be a 'formát 0’ óra 'formát 1 A’. [0028] The wireless mobile communication system may use a scheduling based on a compact scheme, and the binary field may be composed of a field indicating a resource indication value (RIV).

[0029] The wireless mobile communication system may use a scheduling based on a compact scheme, and the binary field may be composed of a field indicating a resource indication value (RIV) and a field indicating ’Gap’ information used fór distributed allocation of resources.

[0030] The wireless mobile communication system may use a scheduling based on a compact scheme, and the binary field may be composed of a field indicating a resource indication value (RIV) and a field indicating hopping information. [0031] The resource allocation information may be composed of resource block allocation information, or may be composed of resource block allocation information and hopping resource allocation information.

[0032] The resource block allocation information may be represented by the RIV. The RIV may indicate a pair of a start index (S) and a length (L) of consecutive VRBs capable of being combined with each other.

[Advantageous Effects] [0033] The present invention uses a Resource Indication Value (RIV) nőt mapped fór RB allocation in a Physical Downlink Control Channel (PDCCH) so as to indicate an SPS deactivation status, so that it can inform a UE of SPS deactivation without adding a bit field or a new formát.

[Description of Drawings] [0034] The accompanying drawings, which are included to provide a further understanding ofthe invention, illustrate embodiments ofthe invention and together with the description serve to explain the principle ofthe invention.

[0035] In the drawings:

FIG. 1 shows a structure of a frequency division duplex (FDD) type rádió frame used in an LTE system.

FIG. 2 shows a structure of a time division duplex (TDD) type rádió frame used in an LTE system.

FIG. 3 shows an uplink (UL) resource grid structure fór use in an LTE system.

FIG. 4 shows a downlink (DL) resource grid structure fór use in an LTE system.

FIG. 5 is a block diagram illustrating an Evolved Universal Mobile Telecommunications System (E-UMTS) network structure as an example ofa mobile communication system.

FIGS. 6 and 7 illustrate rádió interface protocol structures between a UE and a UMTS Terrestrial Rádió Access Network (UTRAN) that are based on a 3GPP LTE rádió aeeess network standard.

FIG. 8 shows physical channels used fór an LTE system and a generál signal transmission method capable of using the physical channels.

ΕΡ 2 248 383 Β1

FIG. 9 is a conceptual diagram illustrating signal Processing fór enabling a UE to transmit an uplink signal.

FIG. 10 is a conceptual diagram illustrating signal Processing fór enabling a base station (BS) to transmit a downlink signal.

FIG. 11 is a conceptual diagram illustrating an SC-FDMA scheme fór transmitting an uplink signal and an OFDMA scheme fór transmitting a downlink signal in a mobile communication system.

FIG. 12 is a view illustrating an example of a method fór mapping distributed Virtual resource blocks (DVRBs) and localized Virtual resource blocks (LVRBs) to physical resource blocks (PRBs).

FIG. 13 is a view illustrating an example of a method fór allocating resource blocks (RBs) by a compact scheme. FIG. 14 is a view illustrating an example of a method fór mapping two DVRBs having consecutive indexes to a plurality of contiguous PRBs.

FIG. 15 is a view illustrating an example of a method fór mapping two DVRBs having consecutive indexes to a plurality of spaced PRBs.

FIG. 16 is a view illustrating an exampleof RIVs when the numberof available RBs is 20 according toone embodiment ofthe present invention.

FIG. 17 shows an exemplary structure of a PDCCH field fór signaling SPS deactivation according to the present invention.

FIG. 18 shows individual fields acquired when DVRB allocation is carried out in a PDCCH having a ’DCI formát 1A’ according to the present invention.

FIG. 19 shows individual fields of a PDCCH having a ’DCI formát 0’ according to the present invention.

FIG. 20 is a block diagram illustrating constituent elements of a device applicable to the present invention.

FIG. 21 is a flowchart illustrating a method fór deactivating a semi-persistent scheduling (SPS) according to the present invention.

[Mode fór Invention] [0036] Reference will now be made in detail to the preferred embodiments ofthe present invention with reference to the accompanying drawings. The detailed description, which will be given below with reference to the accompanying drawings, is intended to explain exemplary embodiments ofthe present invention, rather than to show the oniy embodiments that can be implemented according to the invention.

[0037] The following detailed description includes specific detaiis in order to provide a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without such specific detaiis. Fór example, the following description will be given centering upon a mobile communication system serving as an LTE system, bút the present invention is nőt limited thereto and the remaining parts ofthe present invention other than unique characteristics of the LTE system are applicable to other mobile communication systems. [0038] In somé cases, in order to prevent ambiguity ofthe concepts ofthe present invention, conventional devices or apparatuses well known to those skilled in the art will be omitted and be denoted in the form of a block diagram on the basis ofthe important functions ofthe present invention. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

[0039] In the following description, a terminál may include mobile or fixed user equipments (UEs), fór example, a user equipment (UE), a mobile station (MS) and the like, and may alsó be referred to in any of these ways as necessary. Alsó, the base station (BS) may be any of nodes included in a network communicating with the UE, fór example, a Node B (Node-B) and an eNode B (eNode-B), and may alsó be referred to in any of these ways.

[0040] In a mobile communication system, a UE can récéivé information from a base station (BS) via a downlink, and the UE can alsó transmit information via an uplink. Information transferred from- or received by- the UE may be data, other controi information, and the like, and there are a variety of physical channels according to types and usages of this information transferred or received from or in the UE.

[0041] FIG. 5 shows an Evolved Universal Mobile Telecommunications System (E-UMTS) network structure serving as an example of a mobile communication system.

[0042] The E-UMTS system is an evolved version ofthe conventional Universal Mobile Telecommunications System (UMTS) system and basic standardization thereof is in progress under the 3rd Generation Partnership Project (3GPP). Generally, the E-UMTS is alsó referred to as a Long Term Evolution (LTE) system.

[0043] The E-UMTS network may be classified intő an Evolved - UMTS Terrestrial Rádió Access Network (E-UTRAN) 501 and a Core Network (CN) 502. The E-UTRAN includes a UE 503, a BS (eNB or eNode B) 504, and an Access Gateway (AG) 505 which is located at an end of a network and is connected to an external network. The AG 505 can be divided intő a part that handles Processing of user traffic and a part that handles controi traffic. Here, the AG part 505 fór Processing new user traffic and the AG part fór Processing controi traffic can communicate with each other using a new interface.

[0044] One or more cells may exist fór one eNB. An interface fór transmitting user traffic or controi traffic can be used

ΕΡ 2 248 383 Β1 between eNBs. A Core Network (CN) 502 may include the AG 505 and a node or the like fór user registration ofthe UE 503. An interface fór discriminating between the E-UTRAN 501 and the CN 502 may be used.

[0045] Rádió interface protocol layers between the UE and the network can be classified intő an L1 layer (first layer), an L2 layer (second layer) and an L3 layer (third layer) on the basis of the lower three layers of the Open System Interconnection (OSI) reference model widely known in communication systems. A physical layer belonging to the L1 layer provides an information transfer service utilizing a physical channel. A Rádió Resource Control (RRC) layer located at the L3 layer Controls rádió resources between the UE and the network. Fór this operation, RRC messages are exchanged between the UE and the network via the RRC layers. The RRC layers may be distributed among base stations (BSs) 504 and network nodes, or may be located only at a base station (BSs) 504 or the AG 505.

[0046] FIGS. 6 and 7 illustrate rádió interface protocol structures between a UE and a UTRAN that are based on a 3GPP LTE rádió access network standard.

[0047] The rádió interface protocol of FIG. 6 or FIG. 7 is divided horizontally intő a physical layer, a data link layer and a network layer, and vertically intő a user pláne fór transmitting data information and a control pláne fór transmitting a control signal such as a signaling message. In more detail, FIG. 6 shows individual layers of a rádió protocol control pláne and FIG. 7 shows individual layers ofa rádió protocol user pláne. Protocol layers of FIGS. 6 and 7 can be classified intő an L1 layer (first layer), an L2 layer (second layer) and an L3 layer (third layer) on the basis ofthe lower three layers ofthe OSI reference model widely known in communication systems.

[0048] The following is a detailed description of respective layers ofthe rádió protocol control pláne of FIG. 6 and the rádió protocol user pláne of FIG. 7.

[0049] The physical layer, which is the first layer, provides an information transfer service to an upper layer using a physical channel. The physical layer (PHY) is connected to a Médium Access Control (MAC) layer, located above the physical layer, through a transport channel. Data is transferred between the MAC layer and the physical layer through the transport channel. In this case, the transport channel is classified intő a dedicated transport channel and a common transport channel according to whether or nőt a channel is shared. Data transfer between different physical layers, specifically between the respective physical layers of a transmitter and a receiver, is performed through the physical channel.

[0050] A variety of layers exist in the second layer (L2 layer). The MAC layer maps various logical channels to various transport channels, and performs logical-channel multiplexing fór mapping various logical channels to one transport channel. The MAC layer is connected to the RLC layer serving as an upper layer through a logical channel. The logical channel can be classified intő a control channel fór transmitting information of a control pláne and a traffic channel fór transmitting information ofa user pláne according to categories of transmission information.

[0051] The RLC layer ofthe second layer performs segmentation and concatenation on data received from an upper layer, and adjusts the size of data to be suitable fór a lower layer transmitting data to a rádió interval. In order to guarantee various Qualities of Service (QoSs) requested by respective rádió bearers (RBs), three operation modes, i.e., a Transparent Mode (TM), an Unacknowledged Mode (UM), and an Acknowledged Mode (AM), are provided. Specifically, an AM RLC performs a retransmission function using an Automatic Repeat and Request (ARQ) function so as to implement reliabie data transmission.

[0052] A Packet Data Convergence Protocol (PDCP) layer of the second layer (L2) performs a header compression function to reduce the size ofan IP packet header having relatively large and unnecessary control information in order to efficiently transmit IP packets such as IPv4 or IPv6 packets in a rádió interval with a narrow bandwidth. As a result, only information required fór a header part of data can be transmitted, so that transmission efficiency ofthe rádió interval can be increased. In addition, in the LTE system, the PDCP layer performs a security function, this security function is composed of a ciphering function fór preventing a third party from eavesdropping on data and an integrity protection function fór preventing a third party from handling data.

[0053] A Rádió Resource Control (RRC) layer located at the top ofthe third layer (L3) is defined only in the control pláne and is responsible fór control of logical, transport, and physical channels in association with configuration, reconfiguration and release of Rádió Bearers (RBs). The RB is a logical path that the first and second layers (L1 and L2) provide fór data communication between the UE and the UTRAN. Generally, Rádió Bearer (RB) configuration means that a rádió protocol layer needed fór providing a specific service, and channel characteristics are defined and their detailed parameters and operation methods are configured. The Rádió Bearer (RB) is classified intő a Signaling RB (SRB) and a Data RB (DRB). The SRB is used as a transmission passage of RRC messages in the C-plane, and the DRB is used as a transmission passage of user data in the U-plane.

[0054] A down link transport channel fór transmitting data from the network to the UE may be classified intő a Broadcast Channel (BCH) fór transmitting system information and a downlink Shared Channel (SCH) fór transmitting user traffic or control messages. Traffic or control messages ofa downlink multicastor broadcast service may be transmitted through a downlink SCH and may alsó be transmitted through a downlink multicast channel (MCH). Uplink transport channels fór transmission of data from the UE to the network include a Random Access Channel (RACH) fór transmission of initial control messages and an uplink SCH fór transmission of user traffic or control messages.

ΕΡ 2 248 383 Β1 [0055] Downlink physical channels fór transmitting information transferred to a downlink transport channel to a rádió interval between the UE and the network are classified intő a Physical Broadcast Channel (PBCH) fór transmitting BCH information, a Physical Multicast Channel (PMCH) fór transmitting MCH information, a Physical Downlink Shared Channel (PDSCH) fór transmitting downlink SCH information, and a Physical Downlink Control Channel (PDCCH) (alsó called a DL L1/L2 control channel) fór transmitting control information, such as DL/UL Scheduling Grant information, received from first and second layers (L1 and L2). In the meantime, uplink physical channels fór transmitting information transferred to an uplink transport channel to a rádió interval between the UE and the network are classified intő a Physical Uplink Shared Channel (PUSCH) fór transmitting uplink SCH information, a Physical Random Access Channel fór transmitting RACH information, and a Physical Uplink Control Channel (PUCCH) fór transmitting control information, such as HARQ ACK or NACK Scheduling Request (SR) and Channel Quality Indicator (CQI) report information, received from first and second layers (L1 and L2).

[0056] FIG. 8 shows physical channels usedfor a 3GPP LTE system serving as an example of a mobile communication system and a generál signal transmission method capable of using the physical channels.

[0057] If a UE is re-powered on after being powered off or newly enters a cell region, the UE performs an initial cell search process, such as synchronization with a base station (BS), at step S801. Fór the initial cell search process, the UE receives information of a Primary Synchronization Channel (P-SCH) and information of a Secondary Synchronization Channel (S-SCH) from the base station (BS), is synchronized with the BS, and is able to acquire information such as a cell ID or the like from the BS. After that, the UE receives information of a physical broadcast channel from the BS, such that it can acquire inter-cell broadcast information from the BS. In the meantime, the UE receives a downlink reference signal (DL RS) at the initial cell searching step, so that it can recognize a downlink channel status.

[0058] After performing the initial cell search process, the UE receives information of a Physical Downlink Control Channel (PDCCH) and information of a Physical Downlink Shared Control Channel (PDSCH) based on the PDCCH information, so that it can acquire more detailed system information at step S802.

[0059] In the meantime, if a UE initially accesses the BS or has no resources fór uplink transmission, the UE can perform a Random Access Procedure (RAP), such as steps S803 to S806, forthe BS. Fór this operation, the UE transmits a specific sequence as a preamble through a Physical Random Access Channel (PRACH) at step S803, and receives a response message to the random access through a PDCCH and a PDSCH at step S804. In case of a competitivebased random access except fór a handover case, a contention resolution procedure such as step S805 or S806 can then be carried out. Atstep S805, information is transmitted through an additional PRACH. At step S806, PDCCH/PDSCH information is received.

[0060] After performing the above-mentioned steps, as a procedure fór transmitting UL/DL signals, the UE receives information of a PDCCH and a PDSCH atstep S807, and transmits information through a Physical Uplink Shared Channel (PUSCH) and a Physical Uplink Control Channel (PUCCH) at step S808.

[0061] In the LTE system, a signaling process fór transmitting UL/DL signals is as follows.

[0062] FIG. 9 is a conceptual diagram illustrating signal Processing fór enabling a UE to transmit an uplink (UL) signal. [0063] In orderto transmit a UL signal, a scrambling modulé 901 ofthe UE can scramble a transmission signal using a specific scrambling signal ofthe UE. The scrambled signal is input to a modulation mapper 902, and is converted intő a complex Symbol using a BPSK (Binary Phase Shift Keying) -, QPSK (Quadrature Phase Shift Keying) -, or 16 QAM (Quadrature Amplitude Modulation) - scheme according to categories ofthe transmission signal and/or a channel status. After that, the modulated complex Symbol is processed by a transform precoder 903, and is then input to the resource element mapper 904. The resource element mapper 904 is able to map a complex Symbol to a time-frequency element to be used fór actual transmission. The processed signal may be transmitted to the base station (BS) via the SC-FDMA signal generátor 905.

[0064] FIG. 10 is a conceptual diagram illustrating signal Processing fór enabling the base station (BS) to transmit a downlink signal.

[0065] In the LTE system, the BS is able to transmit one or more codewords via a downlink. Therefore, one or more codewords may be processed as complex symbols by the scrambling modulé 1001 and the modulation mapper 1002 in the same manner as in the uplink case of FIG. 10. Thereafter, the complex symbols are mapped to a plurality of layers by the layer mapper 1003, and each layer may be multiplied by a predetermined precoding mátrix selected depending on a channel status and may then be allocated to each transmission antenna by the precoding modulé 1004. The processed transmission signal fór each antenna is mapped to a time-frequency resource element to be used fór transmission by the resource element mapper 1005. After that, the mapped result can be transmitted via each antenna after passing through the Orthogonal Frequency Division Multiple Access (OFDMA) signal generátor 1006.

[0066] In the case where a UEfor use in a mobile communication system transmits an uplink signal, a Peak to Average Power Ratio (PAPR) may become more serious than in the case where the BS transmits a downlink signal. Thus, as described in FIGS. 9 and 10, the SC-FDMA scheme is used fór uplink signal transmission in a different way from the OFDMA scheme used fór downlink signal transmission.

[0067] In the LTE system, the SC-FDMA scheme fór uplink signal transmission and the OFDMA scheme fór downlink

ΕΡ 2 248 383 Β1 signal transmission wiil hereinafter be described in detail.

[0068] FIG. 11 is a conceptual diagram illustrating the SC-FDMA scheme fór uplink signal transmission and the OFDMA scheme fór downlink signal transmission in a mobile communication system.

[0069] Referring to FIG. 11, nőt only a UE fór transmitting an uplink signal bút alsó a basestation (BS) fór transmitting a downlink signal includes a Serial-to-Parallel converter 1101, a subcarrier mapper 1103, an M-point IDFT modulé 1104, a Parallel-to-Serial converter 1105, and the like. However, a UE fór transmitting a signal using the SC-FDMA scheme further includes an N-pointDFT modulé 1102, and compensatesfora predetermined part ofthe IDFT Processing Ínfiuence of the M-point IDFT modulé 1104 so that a transmission signal can have single carrier characteristics.

[0070] In a celiular orthogonal frequency division multiplex (OFDM) wireless packet communication system, uplink/downlink (UL/DL) data packet transmission is made on a subframe basis and one subframe is defined by a certain time interval including a plurality of OFDM symbols. Hereinafter, terms used in the detailed description ofthis application are defined as follows.

[0071] A ’resource element (RE)’ represents a smallest frequency-time unit in which data or a modulated Symbol of a control channel is mapped. Provided that a signal is transmitted in one OFDM Symbol over M subcarriers and N OFDM symbols are transmitted in one subframe, MxN REs are present in one subframe.

[0072] A 'physical resource block (PRB)’ represents a unit frequency-time resource fór data transmission. In generál, one PRB includes a plurality of consecutive REs in a frequency-time domain, and a plurality of PRBs is defined in one subframe.

[0073] A 'Virtual resource block (VRB)’ represents a Virtual unit resource fór data transmission. In generál, the number of REs included in one VRB is equal to the length of REs included in one PRB, and, when data is transmitted, one VRB can be mapped to one PRB or somé areas of a plurality of PRBs.

[0074] A ’localized Virtual resource block (LVRB)’ is one type ofthe VRB. One LVRB is mapped to one PRB. LVRBs having different logical indexes are mapped to PRBs having different physical indexes. An LVRB may be interpreted in the same as a PRB.

[0075] A 'distributed Virtual resource block (DVRB)’ is another type of VRB. One DVRB is mapped to somé REs in a plurality of PRBs, and REs to which different DVRBs are mapped are nőt duplicated.

[0076] ’N_d’ = ’N_d’ represents the number of PRBs to which one DVRB is mapped. FIG. 12 illustrates an example of a method tor mapping DVRBs and LVRBs to PRBs. In FIG. 12, N_D = 3. As can be seen from FIG. 12, an arbitrary DVRB can be divided intő three parts and the divided parts can be mapped to different PRBs, respectively. At this time, the remaining part of each PRB, nőt mapped by the arbitrary DVRB, is mapped to a divided part of another DVRB. The LTE system has a system structure denoted by ’N_D· = ’N_d’ = 2.

[0077] Semi-Persistent Scheduling (SPS) is a scheduling scheme fór allocating resources to a specific UE such that the allocated resources can be persistently maintained during a specific time interval. In the case where a predetermined amount of data is transmitted during a specific time in the same manner as in a Voice over Internet Protocol (VolP), control information need nőt be transmitted to each data transmission interval fór resource allocation, such that an amount ofwasted control information can be reduced by the SPS scheme.

[0078] ’N_PRB’ represents the number of PRBs in a system.

[0079] ’N_lvrb’ represents the number of LVRBs available in the system.

[0080] ’N_dvrb’ represents the number of DVRBs available in the system.

[0081] ’N_{lvrb ue}’ represents the maximum number of LVRBs allocable to one user equipment (UE).

[0082] ’N_{dvrb ue}’ represents the maximum number of DVRBs allocable to one UE.

[0083] ’N_subset’ represents the number of subsets.

[0084] ’N_E__B|_Ock’ represents the number of frequency bands used in a system capable of using a plurality of frequency bands.

[0085] Here, the number of RBs means the number of RBs classified on a frequency axis. That is, even in the case where RBs can be classified by slots constituting a subframe, the number of RBs means the number of RBs classified on the frequency axis of the same siót.

[0086] FIG. 12 shows an example of definitions of LVRBs and DVRBs.

[0087] As can be seen from FIG. 12, each RE ofone LVRB is mapped one-to-one to each RE ofone PRB. Fór example, one LVRB is mapped to a PRB0 (1201). In contrast, one DVRB is divided intő three parts and the divided parts are mapped to different PRBs, respectively. Fór example, a DVRB0 is divided intő three parts and the divided parts are mapped to a PRB1, PRB4 and PRB6, respectively. Likewise, a DVRB1 and a DVRB2 are each divided intő three parts and the divided parts are mapped to the remaining resources ofthe PRB1, PRB4 and PRB6. Although each DVRB is divided intő three parts in this example, the present invention is nőt limited thereto. Fór example, each DVRB may be divided intő two parts.

[0088] Downlink data transmission from a base station (BS) to a specific terminál (i.e., a specific UE) or uplink data transmission from the specific UE to the base station (BS) is performed through one or more VRBs in one subframe. In other words, the above-mentioned data transmission may be achieved through PRBs corresponding to one or more

EP 2 248 383 Β1

VRBs. When the base station (BS) transmits data to the specific UE, it has to notify the terminál of which VRB will be used fór data transmission. Alsó, in order to enable the specific UE to transmit data, the base station (BS) has to notify the terminál of which VRB will be used fór data transmission. Specific information indicating how to map VRBs to PRBs can be predetermined, so thatthe UE can automatically recognize which PRB will besearched when acquiring information of VRBs allocated to the UE itself.

[0089] Data transmission schemes can be broadly classified intő a frequency diversity scheduling (FDS) scheme and a frequency selective scheduling (FSS) scheme. The FDS scheme is a scheme that obtains a reception performance gain through frequency diversity, and the FSS scheme is a scheme that obtains a reception performance gain through frequency selective scheduling.

[0090] In the FDS scheme, a transmission stage transmits one data packet over subcarriers widely distributed in a system frequency domain so that symbols in the data packet can experience various rádió channel fadings. Therefore, an improvement in reception performance is obtained by preventing the entire data packet from being subject to unfavorable fading. In contrast, in the FSS scheme, an improvement in reception performance is obtained by transmitting the data packet over one or more consecutive frequency areas in the system frequency domain which are in a favorable fading state. In a cellular OFDM wireless packet communication system, a píuraíity of terminals is present in one cell. At this time, because the rádió channel conditions ofthe respective terminals have different characteristics, it is necessary to perform data transmission using the FDS scheme with respect to a certain UE and data transmission using the FSS scheme with respect to a different UE even within one subframe. As a result, a detailed FDS transmission scheme and a detailed FSS transmission scheme must be designed such that the two schemes can be efficiently multiplexed within one subframe. On the other hand, in the FSS scheme, a gain can be obtained by selectively using a bánd favorable to a UE among all available bands. In contrast, in the FDS scheme, a comparison is nőt made as to whether a specific bánd is good or bad, and, as long as a frequency interval capable of adequately obtaining diversity is maintained, there is no need to select and transmit a specific frequency bánd. Accordingly, it is advantageous in terms of improvement in overall system performance to perform the frequency selective scheduling of the FSS scheme preferentially when scheduling.

[0091] In the FSS scheme, because data is transmitted using subcarriers consecutively contiguous in the frequency domain, it is preferable that the data be transmitted using LVRBs. At this time, provided that N_PRB PRBs are present in one subframe and a maximum of N_LVRB LVRBs are available within the system, the base station can transmit bitmap information of N_LVRB bits to each terminál to notify the terminál through which one of the LVRBs downlink data will be transmitted or through which one ofthe LVRBs uplink data can be transmitted. That is, each bit ofthe N_LVRB-bit bitmap information, which is transmitted to each terminál as scheduling information, indicates whether data will or can be transmitted through an LVRB corresponding to this bit, among the N_LVRB LVRBs. This scheme is disadvantageous in that, when the number N_LVRB becomes larger, the number of bits to be transmitted to each terminál becomes larger in proportion thereto.

[0092] In the meantime, physical downlink control channel (PDCCH) downlink control information (DCI) transferred to a UE may have a píuraíity of formats. A resource allocation field transferred over the PDCCH may have different structures according to Downlink Control Information (DCI) formats. Thus, the user equipment (UE) may interpret the resource allocation field according to a formát ofthe received DCI.

[0093] The resource allocation field may have two parts, i.e., resource block allocation information and a resource allocation header field. A píuraíity of resource allocation types may be defined. Fór example, according to a first resource allocation type, the resource block allocation information may have a bitmap indicating one set of consecutive physical resource blocks (PRBs). In this case, one bit may be allocated to one resource block group (RBG). According to a second resource allocation type, resource block allocation information may have a bitmap indicating subsets or RBs allocated tothe UE. According to a third resource allocation type, resource block allocation information may have a bitmap indicating consecutively allocated VRBs. At this time, the resource allocation field may include a resource indication value (RIV) indicating a start resource block and the length of consecutively-allocated resource blocks (RBs). Examples ofthe abovementioned resource allocation types have been disclosed in the 3GPP TS 36.213 document.

[0094] Fór example, a DCI formát 1A prescribed in 3GPP TS 36.213 may be used fór compact scheduling of one physical downlink shared channel (PDSCH) codeword. This compact scheduling is a scheduling scheme fór allocating one set of consecutive VRBs to a UE, and corresponds to the above third resource allocation type. Hereinafter, the above-mentioned compact scheduling in the present invention may be referred to as a compact scheme.

[0095] As described above, provided that a terminál (i.e., the UE) may be assigned only one set of contiguous RBs, information ofthe assigned RBs may be represented by the compact scheme denoted by both a start point of RBs and the number ofthe RBs.

[0096] FIG. 13 is a view illustrating an example of a method fór allocating resource blocks by a compact scheme. If the number of available RBs is denoted by N_RB = N_VRB, the length of available RBs varies depending on respective start points as shown in FIG. 13, such that the number of combinations fór RB allocation is N_LVRB(N_LVRB+1)/2. Accordingly, the number of bits required fór the combinations is ’ceiling(log2(N_LVRB(N_LVRB+1)/2))’. Here, ceiling(x) means rounding

ΕΡ 2 248 383 Β1 χ up to the nearest integer. This method is advantageous over the bitmap scheme in that the number of bits does nőt significantly increase with the increase in the number N_LVRB.

[0097] On the other hand, fór a method fór notifying a UE of DVRB allocation, it is necessary to reserve the positions of respective divided parts of DVRBs distributively transmitted fór a diversity gain. Alternatively, additional information may be required to directly notify the positions. Preferably, provided that the number of bits fór signaling fór the DVRBs is set to be equal to the number of bits in LVRB transmission of the above-stated compact scheme, it is possibie to simplify a signaling bit formát in a downlink. As a result, there are advantages that the same channel coding can be used, etc.

[0098] Here, in the case where one UE is allocated a plurality of DVRBs, this UE is notified of a DVRB index ofa start point ofthe DVRBs, a length (= the number ofthe allocated DVRBs), and a relatíve position difference between divided parts of each DVRB (e.g., a gap between the divided parts). The LTE system is able to select either of’GapI’ and ’Gap2’, each of which has a predetermined value according to the number of system resource blocks. Accordingly, a value of 1 bit may be separately allocated to indicate the selection of ’GapI ’ or ’Gap2’.

[0099] The following table 1 shows a structure ofthe ’Gap’ which can be used in the LTE system according to a system bandwidth. In the case where the number of available system resource blocks (system RBs) is less than 50, only the ’GapI’ (= 1^st Gap) is used, so that there is no need to allocate one bit fór ’Gap’ indication. In contrast, in the case where the number of available system RBs is equal to or greater than 50, either one of ’GapI’ (= 1^st Gap) and ’Gap2’ (= 2^ndGap) must be used, so that signaling of 1 bit is needed to indicate which one of’GapI’(= 1^st Gap) and ’Gap2’(= 2^nd Gap) is used.

[Table 1]

<td rowspan="2"> System BW (&lt;^L)</td><td colspan="2"> Gap (/Vg_ap)</td>

<td> 1^st Gap (/V_gap j)</td><td> 2^nd Gap (/\/_{gap 2})</td>

<td> 6-10</td><td></td><td> N/A</td>

<td> 11</td><td> 4</td><td> N/A</td>

<td> 12-19</td><td> 8</td><td> N/A</td>

<td> 20-26</td><td> 12</td><td> N/A</td>

<td> 27-44</td><td> 18</td><td> N/A</td>

<td> 45-49</td><td> 27</td><td> N/A</td>

<td> 50-63</td><td> 27</td><td> 9</td>

<td> 64-79</td><td> 32</td><td> 16</td>

<td> 80-110</td><td> 48</td><td> 16</td>

[0100] FIG. 14 illustrates an example of a method fór mapping two DVRBs having consecutive indexes to a plurality of contiguous PRBs.

[0101] As shown in FIG. 14, in the case where a plurality of DVRBs having consecutive indexes are mapped to a plurality of contiguous PRBs, first divided parts 1401 and 1402 and second divided parts 1403 and 1404 are spaced apart from each other by a gap 1405, while divided parts belongíng to each ofthe upper divided parts and lower divided parts are contiguous to each other, so that the diversity order becomes 2. In this case, frequency diversity can be obtained only by a gap. In FIG. 14, N_D = N_d = 2.

[0102] FIG. 15 illustrates an example ofa method fór mapping two DVRBs having consecutive indexes to a plurality of spaced PRBs.

[0103] In the method of FIG. 15, DVRB indexes are constructed as shown in FIG. 15. When mapping DVRBs to PRBs, consecutive DVRB indexes may be distributed without being mapped to contiguous PRBs. Fór example, a DVRB index Ό’ and a DVRB index ’T are nőt arranged contiguous to each other. In other words, in FIG. 15, DVRB indexes are arranged in the order ofO, 8,16, 4,12, 20.....and this arrangement can be obtained by inputting the consecutive indexes to a block interleaver. In this case, it is possibie to obtain distribution within each ofthe divided parts 1501 and 1502, as well as distribution by a gap 1503. Therefore, when a UE is allocated two DVRBs as shown in FIG. 15, the diversity order increases to 4, resulting in an advantage that an additional diversity gain can be obtained. In FIG. 15, N_D = N_d = 2. [0104] At this time, the value ofthe gap indicative ofthe relatíve position difference between the divided parts can be

ΕΡ 2 248 383 Β1 expressed in two ways. Firstly, the gap value can be expressed by a difference between DVRB indexes. Secondly, the gap value can be expressed by a difference between indexes of PRBs to which a DVRB is mapped. In the case of FIG. 15, Gap = 1 in the first way, while Gap = 3 in the second way. FIG. 15 shows the latter case 1503. Meanwhile, ifthe totál number of RBs of the system is changed, the DVRB index arrangement may be changed accordingly. In this case, the use ofthe second way has the advantage of recognizing a physical distance between the divided parts.

[0105] In order to perform signaling of DVRB allocation, the above-mentioned LVRB compact scheme may be used. That is, ifthe compact scheme is applied to DVRBs signaled for one UE, PRBs mapped to the DVRBs may be distributed in a physical frequency domain, bút these DVRBs have consecutive logical indexes in a Virtual region (i.e., a logical region). In this case, a start point of consecutively-allocated RBs and length information ofthe RBs correspond to a start point of VRB indexes instead of PRB indexes and length information thereof, respectively.

[0106] As described above, in the compact scheme, LVRB signaling includes a start point of RBs and length information ofthe RBs. In orderto perform the DVRB signaling, gap information may be additionally required in somé cases. In order to constantly maintain the number of bits required for the entire signaling, there is a need to limit the length information such that an amount of information must be reduced. For example, when using 50 RBs or more, one bit of the RIV field must be assigned for ’Gap’ indication, such that there is a need to reduce the number of bits required for transferring the RIV with the limitation in the length information.

[0107] On the other hand, in case of using RBs to perform the common signaling for several users, control signaling for notifying allocated RBs must allow all users present in a cell to read information ofthe allocated RBs. Thus, for this control signaling, a code rate may be reduced or a transmission power may be increased, such that the resultant control signaling information having a low code rate and a high transmission power may be transferred to several users. In order to reduce the code rate ofthe control signaling to which limited resources are allocated, an amount of control data must be reduced. In orderto reduce the amount of control data, the numberof bits required for RB allocation information must be reduced.

[0108] Likewise, control message data transferred to allocated RBs must allow all users present in the cell to read corresponding information, such thatthe control message data is transferred at a low code rate. Assuming that the code rate is 1/20, if an amount of data increases by 16 bits, an amount of codeword made after channel coding increases by 320 bits. In the Long Term Evolution (LTE), assuming that one TX antenna transmission (i.e., 1 Tx antenna transmission) is carried out and one OFDM Symbol is used for a control signal, the number of symbols capable of transferring payload data within one RB (i.e., 1 RB) is 148. Thus, assuming that a quadrature phase shift keying (QPSK) modulation is used, the number of transferable bits is 296. As a result, data increases by 16 bits, and data increases by 320 bits, such that two RBs are additionally needed.

[0109] That is, in order to maintain a low code rate, although the size of data increases slightly, the number of RBs required for transferring this data greatly increases, such that RBs need to be allocated with a granularity of one RB unit (i.e., a 1RB-based granularity).

[0110] Hereinafter, a resource allocation signaling structure for establishing a step for limiting a start position with a granularity of one-RB allocation (i.e., 1 RB allocation) will be described in detail.

[0111] The following equation 1 shows an exemplary signaling method based on the compact scheme which notifies of a start point (S) of RBs and the number (= Length, L) of allocated RBs.

ΕΡ 2 248 383 Β1 [Equation 1] if L — 1 &lt; /2J then

R1V = N_rb{L-\) + S else

RlV = N_m(N_m-L + \) + &lt;N_m-i.-S)

End_

Required bits *_bu_ required = riog₂CR/K„„ + 10 Without limitation =^-(^+1)/2-1

With limitation L^L,mU

RIV_mSií = min{ N,,-(^+1)/2-1, · (L^Limit -1) + - L^Limit} [0112] In the following description, mod(x,y) means x mód y, and mód means a modulo operation. Alsó, LJ means a descending operation, and represents a largest one of integers equal to or smaller than a numerái indicated in LJ. On the other hand, T-J means an ascending operation, and represents a smallest one of integers equal to or larger than a numerái indicated in LJ. Alsó, round(·) represents an integer nearest to a numerái indicated in (). min(x,y) represents a smaller value selected between x and y, whereas max(x,y) represents a larger value selected between x and y.

[0113] Assuming that the totál number of available RBs is denoted by N_RB and the beginning number of indexes to be assigned to the RBs is set to 0, indexes from 0 to N_RB-1 are sequentially assigned to the RBs. In this case, N_RB may be the totál number of all RBs contained in a system bánd, the number of all RBs used as VRBs, or the number of RBs contained in any limited area.

[0114] Thus, the rangé of S may be 0 &lt; S &lt; N_RB-1, and the rangé of allocable ’L’ values is changed according to this S value. In another view, the L value is in the rangé of 1 &lt; L &lt; N_RB, and the rangé of available S values is changed according to the L value. Namely, a certain S value is unable to be combined with a specific L value.

[0115] A maximum value of each ofthe S and L values may be represented by a binary number irrespective of such impossible combinations. A bit field fór this binary number may be constructed fór each of the S and L values. In case of transmitting each ofthe bit fields, if N_RB is 20 (i.e., N_RB = 20), 20 is less than 2⁵ (i.e., 20 &lt; 2⁵), so that 5 bits fór the S value and 5 bits fór the L values, namely, a totál of 10 bits, are needed. However, these 10 bits include information of useless combinations incapable of being actually generated, such that overhead of unnecessary transmission bits is generated. Thus, the number of transmission bits can be reduced if each combination ofgenerable S and L values is represented by ’RIV’, this RIV is converted intő a binary number according to binary representation, and the resultant RIV ofthe binary number is then transferred.

[0116] FIG. 16 is a view illustrating an example of RIVs when N_RB = 20.

[0117] As can be seen from FIG. 16, ’RIV’ is decided according to S and L values. In case of calculating ’RIV’ related to 0 &lt; S &lt; N_RB-1 in each of all L values using Equation 1, RIVs of FIG. 16 are formed. The value of each element shown in FIG. 16 is ’RIV’ indicating a combination of S and L values corresponding to the above element. Values contained in a left upper part covering almost half of FIG. 16 correspond to combinations of generable S and L values if N_RB = 20, and values contained in a right lower part colored in gray, covering the other half of FIG. 16, correspond to combinations of S and L values incapable of being generated.

[0118] In this scheme, RIVs present in the gray-colored part under the condition of L-1&lt;\ N_RB/2\, are mapped to RIVs under the other condition of L-1 &gt;\ N_RB/2\, such that no RIVs are wasted. Fór example, if N_RB is set to 20 (i.e., N_RB = 20), RIVs present in a specific part corresponding to L&lt;l A/_Re/2 1+1=1 20/2 1+1=11 among the right lower part of FIG. 12 are reused in another part corresponding to L&gt;L/V_Rg/2J+1=L20/2J+1=11 among the left upper part of FIG. 20. In this case, a maximum value (i.e., a maximum RIV) among RIVs present in the left upper end is 209.

[0119] In this scheme, the maximum RIV may influence the number of transmission bits, RIVs below the maximum RIV may nőt be mapped to values incapable of being obtained by combinations of actual S and L values. That is, all values below the maximum RIV correspond to combinations of generable S and L values.

[0120] In case of separately transmitting the S value, a maximum S value is 19, such that 5 bits are needed to indicate

ΕΡ 2 248 383 Β1 this S value Ί9’ (where 0 &lt; 19 &lt; 2⁵). In case of separately transmitting the L value, a maximum L value is 20, such that 5 bits are needed to indicate this L value ’20’ (where 0 &lt; 20 &lt; 2⁵). Therefore, in case of transmitting the S and L values independent of each other, 10 bits are needed in the end. However, the RIVs are in the rangé of 0 &lt; RIV &lt; 209 &lt; 2⁸, such that 8 bits are needed to indicate these RIVs, as denoted by N_{bit requ}j_rec| = 8. As a result, it can be recognized that 2 bits are saved as compared to the above case of transmitting the S and L values independent of each other. In this case, a valid RIV is 209 and a maximum value capable of being indicated by 8 bits is 255, so that a totál of 46 values of 210 ~ 255 are nőt actually used.

[0121] When using the conventional RIV table shown in FIG. 16, RIVs undefined in this RIV table become invalid for an LTE terminál. For example, RIVs from 210 to 255 in FIG. 16 become invalid for a conventional LTE terminál. Therefore, RIVs defined in the conventional RIV table are referred to as valid RIVs, and other RIVs undefined in this RIV table are referred to as invalid RIVs. For example, in FIG. 16, RIVs from 0 to 209 are valid RIVs, and RIVs from 210 to 255 are invalid RIVs.

[0122] Valid RIVs are able to indicate only allocation status information of RBs defined in the table of FIG. 16, and invalid RIVs are able to indicate allocation status information of other RBs undefined in the table of FIG. 16. In order to use invalid RIVs as described above, the assumption ofthe presence of invalid RIVs is needed. Ifthe following equation 2 is satisfied, this means that RIVs that are nőt used as actual values while being capable of being transferred are always present.

[Equation 2]

Ν /M , where, N = flog₂ (TV^ +1) / 2)] ^ = 108,(^(^+1)/2) [0123]

In Equation 2,

W+l) is a totál number of valid RIVs when the number of resource blocks is N_RB. In

Equation, N is a minimum length of a binary number for indicating all the valid RIVs. However, if is nőt a multiple of 2, it is impossible for M to be an integer, so that M may be set to any non-integer value. In this case, in orderto accomplish Equation 2, the following equation 3 must be achieved.

[Equation 3]

2ⁿ ^^rb^rb +1) [0124] Equation 3 can be represented by the following equation 4.

[Equation 4]

2^^(2^+1) [0125] In conclusion, if Equation 4 is accomplished, it can be seen that the aforementioned invalid RIVs exist.

[0126] Assuming that 2ⁿ⁺'^í=Nrb(Nrb+1) is achieved, (NRB=2^a) and (NRB+1=2^b) must be established. That is, 2^a+1=2^ömust be satisfied. In this case, in order to satisfy 2^a+1=2^ö, ’a’ must be set to 0 (a = 0) and ’b’ must be set to 1 (b = 1). Therefore, 2ⁿ⁺^=Nrb(Nrb +1) is achieved only in the case of NRB =1. However, because 6&lt;/VRB&lt;110 is given in the LTE, 2ⁿ⁺^Nrb(N_rb +1) is achieved. Thus, in the LTE, 2ⁿ⁺¹=N_rb(N_rb +1) is nőt achieved. Therefore,

N = |log₂(^_B^L(^B^L +1)/2) \*M =log2(AC(AG +1)/2) ^is demonstrated, and the LTE always includes RIVs that are nőt used as actual values while being capable of being transmitted. Therefore, the above-mentioned proposed method can be used forthe LTE at all times.

In the meantime, in the above-mentioned RIV construction method, if a maximum value (= L^llmlt) of allocable RBs is

ΕΡ 2 248 383 Β1 limited, i.e., if the L value is limited to L^llmlt or less, the number of required bits may be reduced. In FIG. 16, if L^llmlt is set to 6 (i.e., L^llmlt = 6), the rangé of generable L values is given as 1 &lt; L &lt; 6, combinations having other L values having the rangé of 7 &lt; L &lt; 20 are nőt in use. At this time, it can be recognized that a maximum RIV among RIVs is 114. That is, the rangé of generable RIVs is given as 0 &lt; RIV &lt; 114 &lt; 2⁷, so that the number of required bits is 7 as denoted by tolbit required iim ⁼ 7- In this case, a valid maximum RIV is 114 and a maximum value capable of being denoted by 7 bits is 127, such that a totál of 13 values from 115 to 127 are nőt actually used.

[0127] The SPS method among various scheduling methods used in the LTE system will hereinafter be described in detail.

[0128] Presently, in order to perform uplink SPS and/or downlink SPS, the LTE system firstly informs a UE of rádió resource control (RRC) signaling information, such that the UE can recognize which subframe(s) will be used fór SPS transmission/reception on the basis ofthe received RRC signaling information. In other words, time resources from among time-frequency resources allocated fór SPS is firstly designated through RRC signaling. In order to indicate available subframes, fór example, a period and offset of each subframe can be notified. However, because a UE is still assigned only the time resource domain through the RRC signaling, the UE cannot nőt transmit/receive data using the SPS. Therefore, the UE receives a PDCCH fór indicating activation, and then allocates frequency resources according to RB allocation information included in the received PDCCH, and applies the modulation and the code rate depending on modulation and coding scheme (MCS) information, such that the UE starts transmitting/receiving data according to period and offset information of subframes allocated through the RRC signaling. Then, upon receiving a PDCCH fór indicating deactivation from a base station (BS), the UE stops transmitting/receiving data. In the case where the UE receives a PDCCH indicating either the activation orthe deactivation after stopping transmitting/receiving data, the UE restarts data transmission/reception using the period- and offset-information of each subframe allocated through the RRC signaling using the RB allocation and MCS information designated in the received PDCCH. In this case, the PDCCH including the activation-, deactivation-, and/or reactivation indication(s) may be a PDCCH from which an SPS cell rádió network temporary identity (C-RNTI) is detected. In other words, while allocation of time resources is carried out through the RRC signaling, transmission/reception of actual signals can be carried out after a PDCCH indicating activation and reactivation ofthe SPS has been received. Interruption of signal transmission/reception occurs after the UE receives a PDCCH indicating SPS deactivation.

[0129] Presently, a variety of formats have been defined as PDCCH formats in the LTE system, fór example, a formát 0 fór uplink, and formats 1, 1 A, 1B, 1C, 1D, 2, 2A, 3, and 3A fór downlink have been defined as PDCCH formats in the LTE system. Necessary control information may be selected from among a variety of control information according to usages of the above PDCCH formats, and a combination of the selected control information is formed, such that the necessary control information can be transmitted in the form of such a combination. Fór example, necessary control information may be selected from among hopping flag, RB allocation, MCS, Redundancy Version (RV), New Data Indicator (NDI), Transmission Power Control (TPC), a Cyclic Shift, Demodulation Reference Signal (DM RS), UL index, a Channel Quality Indicator (CQI) request, a DL allocation index, a Hybrid Automatic Repeat Request (HARQ) process number, a Transmitted Precoding Mátrix Indicator (TPMI), and PMI confirmation.

SPS activation and reactivation [0130] Basic information such as NDI, RB allocation, MCS information, and the like is needed fór SPS activation or SPS reactivation. Each PDCCH formát includes unnecessary information in addition to the basic information. In case of SPS deactivation, NDI, RB allocation, MCS information and the like are no longer required, and only the deactivation status information is required fór the SPS deactivation.

[0131] SPS allocation and non-persistent allocation can be distinguished from each other according to whether a rádió network temporary identity (RNTI) masked on a cyclic redundancy check (CRC) part of a PDCCH is an SPS C-RNTI or a C-RNTI. However, according to the present invention, when an SPS-based operation is performed, each of unnecessary bits among PDCCH formats is fixed to zero Ό’, such that this bit composed of Ό’ may be used to reconfirm SPS allocation information.

[0132] Detailed bit field structures of individual PDCCH formats during the SPS operation according to the present invention can be given as the following tables 2 to 5.

[Table 2]

<td> Formát 0/1A indicator</td><td> 1 bits -&gt; Ό’</td><td> Formát 0</td>

<td> Hopping Flag</td><td> 1 bit</td><td></td>

<td> Resource Block Allocation</td><td> N bit</td><td></td>

ΕΡ 2 248 383 Β1 (continued)

<td> MCS</td><td> 5 bits -&gt; ’Oxxxx’</td><td> First MSB Ό’: SPS Validation</td>

<td> NDI</td><td> 1 bit</td><td></td>

<td> DM-RS</td><td> 3 bits -&gt; Ό00’</td><td> Ό00’ -&gt; SPS Validation</td>

<td> TPC (PUSCH)</td><td> 2 bits -&gt; Ό0’</td><td> Ό0’ -&gt; SPS Validation</td>

<td> CQI trigger</td><td> 1 bit</td><td></td>

<td> UL index (TDD)</td><td> (2 bits)</td><td></td>

[0133] Table 2 shows the 'formát 0’ fór uplink, if it is assumed that all or somé ofthe MCS, DM-RS, and TPC bit fields are set to zero Ό’ as shown in Table 2, the UE is able to confirm that the SPS C-RNTI is masked on the CRC part of a PDCCH, i.e., the UE is able to confirm SPS validation.

[Table 3]

<td> Formát 0/1A indicator</td><td> 1 bit —&gt; ’T</td><td> Formát 1A</td>

<td> LVRB/DVRB Flag</td><td> 1 bit</td><td></td>

<td> Resource Block Allocation</td><td> N bit</td><td></td>

<td> MCS</td><td> 5 bits—&gt; ’Oxxxx’</td><td> First MSB Ό’: SPS Validation</td>

<td> NDI</td><td> 1 bit</td><td></td>

<td> HARQ index</td><td> 3 bits -&gt; ’OOO’</td><td> 000’ -&gt; SPS Validation</td>

<td> TPC (PUCCH)</td><td> 2 bits</td><td></td>

<td> RV</td><td> 2 bits -&gt; Ό0’</td><td> Ό0’ -&gt; SPS Validation</td>

<td> DL index (TDD)</td><td> (2 bits)</td><td></td>

[0134] Table 3 shows the formát 1A fór a Single Input Multi Output (SIMO) downlink compact scheme. As shown in Table 3, if it is assumed that all or somé ofthe MCS, HARQ index, and RV bit fields are set to zero ’0’ as shown in Table 3, the UE is able to confirm that the SPS C-RNTI is masked on the CRC part of a PDCCH.

[Table 4]

<td> Allocation type Flag</td><td> 1 bit</td><td></td>

<td> Resource Block Allocation</td><td> P bit</td><td></td>

<td> MCS</td><td> 5 bits —&gt; ’Oxxxx’</td><td> First MSB Ό’ : SPS Validation</td>

<td> HARQ index</td><td> 3 bits (4-bitTDD)—&gt; ’OOO (0)’</td><td> ’000(0)’-&gt; SPS Validation</td>

<td> NDI</td><td> 1 bit</td><td></td>

<td> RV</td><td> 2 bits -&gt; Ό0’</td><td> Ό0’ -&gt; SPS Validation</td>

<td> TPC (PUCCH)</td><td> 2 bits</td><td></td>

<td> DL index (TDD)</td><td> 2 bits</td><td></td>

[0135] Table 4 shows the formát 1 fór a Single Input Multi Output (SIMO) downlink scheme. As shown in Table 4, if it is assumed that all or somé of the MCS, HARQ index, and RV bit fields are set to zero Ό’ as shown in Table 4, the UE is able to confirm that the SPS C-RNTI is masked on the CRC part of a PDCCH.

[Table 5]

<td> Allocation type Flag</td><td> 1 bit</td><td></td>

<td> Resource Block Allocation</td><td> P bits</td><td></td>

ΕΡ 2 248 383 Β1 (continued)

<td> TPC (PUCCH)</td><td> 2 bits</td><td></td>

<td> DL index (TDD)</td><td> 2 bits</td><td></td>

<td> HARQ index</td><td> 3 bits (4-bitTDD) —&gt; ’OOO(O)’</td><td> ’000(0)’ -&gt; SPS Validation</td>

<td> HARQ swap flag</td><td> 1 bit</td><td></td>

<td> MCS 1</td><td> 5 bits —&gt; ’Oxxxx’</td><td> First MSB Ό’: SPS Validation</td>

<td> NDI 1</td><td> 1 bit</td><td></td>

<td> RV 1</td><td> 2 bits -&gt; ’00’</td><td> Ό0’ -&gt; SPS Validation</td>

<td> MCS 2</td><td> 5 bits —&gt; ’Oxxxx’</td><td> First MSB Ό’: SPS Validation</td>

<td> NDI 2</td><td> 1 bit</td><td></td>

<td> RV2</td><td> 2 bits -&gt; Ό0’</td><td> Ό0’ -&gt; SPS Validation</td>

<td> Precoding</td><td> 3 or 6 bits</td><td></td>

[0136] Table 5 shows the 'formát 2/2A’ for a closed-loop / open-loop Spatial Multiplexing (SM). As shown in Table 5, if it is assumed that all or somé ofthe MCS, HARQ index, and RV bit fields are set to zero Ό’ as shown in Table 5, the UE is able to confirm that the SPS C-RNTI is masked on the CRC part of a PDCCH.

SPS deactivation [0137] The SPS deactivation method according to the present invention will hereinafter be described in detail.

[0138] The compact resource allocation method is used in the formats 0, 1A, 1B, 1C, and 1D among the abovementioned PDCCH formats. In this case, when somé of RIVs are valid RIVs and the other RIVs are invalid RIVs, the invalid RIVs may be used for an event requesting no RB allocation.

[0139] In the present invention, when a downlink control signal formát based on the compact-type RB allocation scheme is used for signaling SPS activation and/or SPS deactivation, an RIV contained in the PDCCH from which the SPS CRNTI is detected may be used as signaling information for SPS deactivation indication. In this case, the RIV contained in the PDCCH from which the SPS C-RNTI is detected may have any one of values capable of being used as the abovementioned invalid RIVs.

[0140] For example, according to the RIV construction method shown in Table 1, a valid RIV indicating a generable RB allocation combination may be any one of RIVs from 0 to 209 (where this RIV ’209’ is a maximum valid RIV). In this case, an invalid RIV may be any one of RIVs from 210 to 255. Ifthe RIV detected from the PDCCH from which the SPS C-RNTI is detected belongs to the invalid RIV, the UE recognizes that signaling information indicating SPS deactivation is transmitted. A maximum vaiue capable of being indicated by a binary field indicating each RIV is certainly included in values capable of belonging to the invalid RIV. That is, the above-mentioned invalid RIV certainly includes a specific vaiue acquired when the entíre binary field indicating each RIV is fiiled with ’T. Specifically, in the case where the RIV detected in the PDCCH from which the SPS C-RNTI was detected is determined to be the above specific vaiue acquired when the entirety of the binary field is fiiled with ’T, it can be recognized that signaling information indicating SPS deactivation is transmitted on the basis ofthe above specific vaiue.

[0141] FIG. 17 shows an exemplary structure ofa PDCCH field for signaling SPS deactivation according to the present invention. As shown in FIG. 17, if the RIV binary field is composed of 8 bits, a binary number RIV (= 11111111₂) is acquired. Ifthe RIV (= 11111111₂) is detected, this RIV (= 11111111₂) may indicate that signaling information indicating SPS deactivation was transmitted.

[0142] A method for indicating SPS deactivation when DVRB allocation is carried out in a PDCCH having a DCI formát 1A will hereinafter be described in detail.

[0143] FIG. 18 shows individual fields acquired when DVRB allocation is carried out in a PDCCH having a DCI formát 1A according to the present invention. FIG. 18(a) shows an exemplary case in which an LVRB is used. FIGS. 18(b) and 18(c) illustrate exemplary cases, each ofwhich shows the use ofa DVRB. In more detail, FIG. 18(b) shows the use of ’GapT and FIG. 18(c) shows the use of ’Gap2’.

[0144] When using a DVRB as shown in FIGS. 18(b) and 18(c), one bit 1802 from among the entíre bits 1801 used as an RIV field indicating LVRB allocation information as shown in FIG. 18(a) is used for indicating ’Gap17’Gap2’. Only the remaining bit field 1803 is allocated as an RIV field. In this case, as shown in FIG. 18, the maximum allocable number of RBs is limited to 16 so that the RIV does nőt exceed the maximum vaiue which can be represented by the RIV field

ΕΡ 2 248 383 Β1 which is reduced by the one bit 1802.

[0145] At least one invalid RIV unused for allocating valid resources exists, and this invalid RIV may be used as signaling information indicating SPS deactivation. Specifically, if the invalid RIV exists, the maximum value capable of being indicated by the binary field indicating an RIV is included in the existing invalid RIV, so that this maximum value can be used for deactivation. In other words, the value acquired when the entirety ofthe RIV binary field is fiiled with ’T may be used for deactivation. As can be seen from FIG. 18, there may arise two cases according to indication 1802 of the ’Gap’. The SPS deactivation construction having ’Gap2’ shown in FIG. 18 (c) has the same bit pattern as that of FIG.

(a) in which the RIV field for LVRB is configured to indicate the SPS deactivation.

[0146] In addition, in case ofthe SPS deactivation, a distinction between ’GapT and ’Gap2’ and a distinction between LVRBs and DVRBs are meaningless. Therefore, even for a SPS UE which is using ’GapT shown in FIG. 18(b), the entire RIV field for LVRB can be fiiled out with ’T in orderto represent SPS deactivation. In other words, although ’GapT is currently used as shown in FIG. 18(b), the ’Gap’ indication field 1802 may be fiiled with ’T instead of ’0’ under the SPS deactivation.

[0147] Hereinafter, a method for indicating SPS deactivation when hopping is used for the PDCCH having the ’DCI formát 0’ according to the present invention will hereinafter be described.

[0148] FIG. 19 shows individual fields of a PDCCH having a ’DCI formát 0’ according to the present invention. FIG.

(a) shows an exemplary case in which the hopping is nőt used. FIGS. 19(b) and 19(c) show other cases in which the hopping is used when a system bánd is in the rangé from 50 RBs to 110 RBs.

[0149] In the case where the system bánd is in the rangé from 50 RBs to 110 RBs as shown in FIGS. 19(b) and 19(c) and hopping is carried out, 2 bits 1902 from among all bits 1901 used as an RIV field indicating VRB allocation information are used to indicate hopping information. Only the remaining bits 1903 are allocated as an RIV field. If it is assumed that the hopping is carried out in the formát 0 and the system bandwidth is in the rangé from 6 RBs to 49 RBs, one bit (1 bit) from among all bits used as the VRB RIV field is used to indicate the hopping information.

[0150] For example, as shown in FIGS. 19(b) and 19(c), the length of RBs capable of being maximally allocated is limited, such that an RIV does nőt exceed a maximum value capable of being indicated by the RIV field 1903. Even in the case, there exists at least one invalid RIV to be unused, and this invalid RIV may be used for SPS deactivation. The invalid RIV includes the maximum value capable of being indicated by a binary field through which the RIV will be transferred, such that this maximum value can be used for deactivation. There may arise two cases according to the hopping information as shown in FIG. 19. The SPS deactivation construction formed when each bit indicating the hopping information is set to ’T as shown in FIG. 19 (c) has the same bit pattern as that of FIG. 19 (a) in which the RIV field for VRB is configured to indicate the SPS deactivation.

[0151] In addition, as described above, the distinction based on hopping information is meaningless for the SPS deactivation. Therefore, even when a hopping is performed as like in FIG. 19(b) or 19(c), the entire RIV field 1901 can be fiiled with ’T to indicate SPS deactivation.

[0152] As described above, because it is enough to inform only the deactivation status without other control information to indicate a SPS deactivation, it is preferable that only one formát be used for each of uplink and downlink. In other words, the formát 0 may be used in uplink and the shortest formát 1A may be used in downlink.

[0153] Tables 6 and 7 show examples of detailed field structures used when uplink SPS deactivation and downlink SPS deactivation are signaled by ’DCI formát 0’ and ’DCI formát 1A’, respectively.

[Table 6]

<td> Formát 0/1A indicator</td><td> 1 bit -&gt; Ό’</td><td> Formát 0</td>

<td> Hopping Flag</td><td> 1 bit -&gt; ’x’</td><td></td>

<td> Resource Block Allocation</td><td> N bit —&gt; ’11 ...11’</td><td> SPS deactivation</td>

<td> MCS</td><td> 5 bits -&gt; ’Oxxxx’</td><td> First MSB Ό’: SPS Validation</td>

<td> NDI</td><td> 1 bit -&gt; ’x’</td><td></td>

<td> DM-RS</td><td> 3 bits -&gt; Ό00’</td><td> Ό00’ -&gt; SPS Validation</td>

<td> TPC (PUSCH)</td><td> 2 bits -&gt; Ό0’</td><td> 00’ -&gt; SPS Validation</td>

<td> CQI trigger</td><td> 1 bit -&gt; ’x’</td><td></td>

<td> UL index (TDD)</td><td> (2 bits) -&gt; ’xx’</td><td></td>

[0154] Table 6 shows a PDCCH having a ’DCI formát 0’ for uplink. When a UE confirms that the SPS C-RNTI is masked on a CRC part of the PDCCH and that all or somé of the MCS, DM-RS, and TPC bit fields are set to zero ’0’ as

ΕΡ 2 248 383 Β1 shown in Table 6, the UE is able to recognize that SPS is activated. In addition, a SPS deactivation can be signaled by setting the whole RIV field to ’T as described above. Because the bits in table 6, each of which is denoted by ’x’, are irrelevant to SPS validation and SPS deactivation, an arbitrary value may be assigned to each of the bits. However, if all ofthe bits is fixed to ’0’ or ’T, the UE may additionaily confirm that the SPS is deactivated.

[Table 7]

<td> Formát 0/1A indicator</td><td> 1 bit —&gt; ’T</td><td> Formát 1A</td>

<td> LVRB/DVRB Flag</td><td> 1 bit -&gt; ’x’</td><td></td>

<td> Resource Block Allocation</td><td> N bit —&gt; Ί1...11’</td><td> SPS deactivation</td>

<td> MCS</td><td> 5 bits -&gt; ’Oxxxx’</td><td> First MSB ’0’ : SPS Validation</td>

<td> NDI</td><td> 1 bit -&gt; ’x’</td><td></td>

<td> HARQ index</td><td> 3 bits -&gt; Ό00’</td><td> ’OOO’ -&gt; SPS Validation</td>

<td> TPC (PUCCH)</td><td> 2 bits -&gt; ’x’</td><td></td>

<td> RV</td><td> 2 bits -&gt; ’00’</td><td> ’00’ -&gt; SPS Validation</td>

<td> DL index (TDD)</td><td> (2 bits) -&gt; ’xx’</td><td></td>

[0155] Table 7 shows a PDCCH having a ’DCI formát 1 A’ fór downlink. When a UE confirms that the SPS C-RNTI is masked on a CRC part of the PDCCH and that all or somé of the MCS, HARQ index, and RV bit fields are set to zero Ό’ as shown in Table 7, the UE is able to recognize that SPS is activated. In addition, the SPS deactivation can be signaled by setting the entire RIV field to ’T as described above. Because the bits in table 7, each of which is denoted by ’x’, are irrelevant to either SPS validation or SPS deactivation, an arbitrary value may be assigned to each ofthe bits. However, if all of the bits is fixed to Ό’ or ’T, the UE may additionaily confirm that the SPS is deactivated.

[0156] FIG. 20 is a block diagram illustrating constituent elements of a device 50 applicable to the present invention. [0157] In FIG. 20, the device 50 may be a UE or a base station (BS). In addition, the above-mentioned methods can be implemented by this device 50. The device 50 includes a processor 51, a memory 52, a Rádió Frequency (RF) unit 53, a display unit 54, and a user interface unit 55. Layers ofthe rádió interface protocol are realized in the processor 51. The processor 51 provides a control pláne and a user pláne. Functions of individual layers can be implemented in the processor 51. The processor 51 may include a contention resolution timer. The memory 52 is connected to the processor 51 and Stores an operating system, applications, and generál files. Ifthe device 50 is a UE, the display unit 54 displays various information, and may use well-known elements such as a Liquid Crystal Display (LCD), an Organic Light Emitting Diódé (ÖLED), and the like. The user interface unit 55 may be constructed of a combination of well-known user interfaces such as a keypad, a touch screen, and the like. The RF unit 53 is connected to the processor 51 so that it can transmit and récéivé RF signals to and from the processor 51.

Embodiment 1 [0158] A method and apparátus fór allowing the UE 50 shown in FIG. 20 to perform SPS deactivation according to a first embodiment ofthe present invention will hereinafter be described in detail.

[0159] The first embodiment ofthe present invention relates to a method and apparátus fór deactivating semi-persistent scheduling (SPS) by the UE 50 of FIG. 20. The processor 51 contained in the UE 50 receives a downlink control channel from a base station (BS) through the RF unit 53. Ifthe binary field indicating resource allocation information contained in the downlink control channel is entirely fiiled with ’T, the processor 51 deactivates the SPS.

Embodiment 2 [0160] A method and apparátus fór allowing the base station (BS) 50 shown in FIG. 20 to transmit a signal fór SPS deactivation according to a second embodiment ofthe present invention will hereinafter be described in detail.

[0161] The second embodiment ofthe present invention relates to a method and apparátus fór transmitting a signal fór SPS deactivation bythe base station (BS) 50 shown in FIG. 20. When performing the SPS deactivation, the processor 51 ofthe base station (BS) 50 fills the entire binary field indicating resource allocation information contained in a downlink control channel with the value of ’T. Thereafter, the processor 51 transmits the downlink control channel through the RF unit 53. In this case, the binary field fiiled with the value of ’T indicates SPS deactivation.

[0162] It is apparent to those skilled in the art that the first embodiment (Embodiment 1) and the second embodiment

ΕΡ 2 248 383 Β1 (Embodiment 2) can be reconstructed as a method invention embodied by a combination of steps executed in the RF unit and the processor.

Embodiment 3 [0163] FIG. 21 is a flowchart illustrating a method for deactivating a semi-persistent scheduling (SPS) according to the present invention.

[0164] In orderto perform SPS deactivation, a base station (BS) fills the entire binary field indicating resource allocation information contained in a downlink control channel with the value of Ί’ at step S2101. The base station (BS) transmits the downlink control channel to the UE at step S2102. The UE receives the downlink control channel from the base station (BS) at step S2103. When the entire binary field indicating resource allocation information contained in the downlink control channel is fiiled with ’T, the UE performs the SPS deactivation.

[0165] The first to third embodiments (Embodiment 1 ~ Embodiment 3) can be restricted as follows. The downlink control channel may be a PDCCH, and a Downlink Control Information (DCI) formát ofthe downlink control channel may be a 'Formát 0’ or a 'Formát 1 A’. The wireless mobile communication system uses a scheduling method based on the compact scheme, and the binary field may be composed ofa field indicating an RIV. Otherwise, the above-mentioned binary field may be composed of a field indicating an RIV and a field indicating ’Gap’ information used for distributed allocation of resources. For another example, the above-mentioned binary field may be composed of a field indicating an RIV and a field indicating hopping information.

[0166] Although the present invention has been disclosed by referring to the above-mentioned embodiments, it should be noted that the aforementioned embodiments have been disclosed only for illustrative purposes, and those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope ofthe invention as disclosed in the accompanying claims. Thus, it is intended that the present invention covers the modifications and variations ofthis invention provided they come within the scope ofthe appended claims. Therefore, the present invention is nőt limited to the above-mentioned embodiments, bút can be applied to other examples which can satisfy the above principles and new characteristics ofthe present invention.

[Industrial Applicability] [0167] As apparent from the above description, the present invention is applicable to a transmitter and a receiver for use in a communication system.

[0168] lt will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from scope of the invention. Thus, it is intended that the present invention cover the modifications and variations ofthis invention provided they come within the scope ofthe appended claims.