WO2013065990A1 - Émetteur, procédé et terminal pour l'attribution de ressources, et procédé de réception d'informations d'attribution de ressources - Google Patents

Émetteur, procédé et terminal pour l'attribution de ressources, et procédé de réception d'informations d'attribution de ressources Download PDF

Info

Publication number
WO2013065990A1
WO2013065990A1 PCT/KR2012/008741 KR2012008741W WO2013065990A1 WO 2013065990 A1 WO2013065990 A1 WO 2013065990A1 KR 2012008741 W KR2012008741 W KR 2012008741W WO 2013065990 A1 WO2013065990 A1 WO 2013065990A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource allocation
pdcch
resource
riv
terminal
Prior art date
Application number
PCT/KR2012/008741
Other languages
English (en)
Korean (ko)
Inventor
홍성권
Original Assignee
주식회사 팬택
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR1020120015040A external-priority patent/KR20130049695A/ko
Application filed by 주식회사 팬택 filed Critical 주식회사 팬택
Priority to US14/356,143 priority Critical patent/US9246841B2/en
Publication of WO2013065990A1 publication Critical patent/WO2013065990A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signaling for the administration of the divided path
    • H04L5/0094—Indication of how sub-channels of the path are allocated
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal

Definitions

  • the present invention relates to resource allocation in a wireless communication system.
  • one of the basic principles of a wireless connection is that shared channel transmission, that is, time-frequency resources can be dynamically shared between user terminals.
  • the transmitting end may control allocation of uplink and downlink resources.
  • Information about such resource allocation may be transmitted from a transmitting end to a terminal through a control channel, and the control channel is located in a predetermined control region separated from the data region in downlink time-frequency space.
  • MIMO multiple-input multiple-output
  • CoMP coordinated multi-point transmission / reception
  • MTC machine type communication
  • An object of the present invention is to provide an apparatus and method for efficient resource allocation in a wireless communication system.
  • An embodiment of the present invention includes an encoder for generating resource allocation information (RIV) in which a resource block or a group of resource block groups has a length L of consecutive resource allocation regions and an offset j of the resource allocation region; And a transmitter for transmitting the resource allocation information to the terminal, wherein the resource allocation information is calculated by the following equation.
  • RAV resource allocation information
  • N is the total number of resource blocks or resource block groups
  • L max is the maximum value of the length of the resource allocation region.
  • RAV resource allocation information
  • N is the total number of resource blocks or resource block groups
  • L max is the maximum value of the length of the resource allocation region.
  • a resource block or a resource block group includes a receiver for receiving resource allocation information (RIV) encoded with information on a continuous resource allocation region; And a decoder which decodes the resource allocation information to extract the length L and the offset j of the resource allocation region, wherein the resource allocation information is calculated by the following equation. do.
  • ROV resource allocation information
  • N is the total number of resource blocks or resource block groups
  • L max is the maximum value of the length of the resource allocation region.
  • a resource block or a resource block group receives a resource allocation information (RIV) encoded with information about a continuous resource allocation region; And decoding the resource allocation information to extract a length L and an offset j of the resource allocation region, wherein the resource allocation information is calculated by the following equation.
  • RAV resource allocation information
  • N is the total number of resource blocks or resource block groups
  • L max is the maximum value of the length of the resource allocation region.
  • the present invention described above can provide an apparatus and method for efficient resource allocation in a wireless communication system.
  • FIG. 1 illustrates a communication system to which embodiments of the present invention are applied.
  • FIG. 3 (a) illustrates a resource allocation scheme of downlink type 0
  • FIG. 3 (b) illustrates a resource allocation scheme of downlink type 1
  • FIG. 3 (c) illustrates a resource allocation scheme of downlink type 2. To illustrate.
  • 5 shows examples of the case where part of the data area is used for control information.
  • FIG 6 shows an example in which an E-PDCCH search space is configured locally and an example in which distribution is configured.
  • FIG. 7 illustrates a case where resources are continuously allocated in downlink or uplink.
  • 8 illustrates a case where resources are discontinuously allocated in downlink or uplink.
  • FIG. 9 is a flowchart illustrating a method of transmitting resource allocation information by a transmitter according to an embodiment.
  • FIG. 10 is a flowchart illustrating a method for receiving resource allocation information of a terminal according to an embodiment.
  • FIG. 11 is a block diagram illustrating a configuration of a transmission terminal according to an embodiment.
  • FIG. 12 is a block diagram illustrating a configuration of a terminal according to an embodiment.
  • FIG. 13 is a flowchart illustrating a method of transmitting resource allocation information by a transmitting end according to another embodiment.
  • FIG. 14 is a flowchart illustrating a method for receiving resource allocation information of a terminal according to another embodiment.
  • 15 is a block diagram showing a configuration of a transmission stage according to another embodiment.
  • 16 is a block diagram illustrating a configuration of a terminal according to another embodiment.
  • FIG. 1 illustrates a communication system to which embodiments of the present invention are applied.
  • Communication systems are widely deployed to provide various communication services such as voice, packet data, and the like.
  • a communication system includes a user equipment (UE) 10 and a transmission point 20 that performs uplink and downlink communication with the terminal 10.
  • UE user equipment
  • transmission point 20 that performs uplink and downlink communication with the terminal 10.
  • the terminal 10 or a user equipment is a comprehensive concept that means a user terminal in wireless communication.
  • UE user equipment
  • WCDMA Wideband Code Division Multiple Access
  • LTE Long Term Evolution
  • HSPA mobile station
  • GSM UT
  • SS subscriber station
  • wireless device a wireless device that includes a user terminal, a subscriber station (SS), and a wireless device.
  • the transmitting end 20 or cell generally refers to a station communicating with the terminal 10, and includes a base station, a node-B, an evolved node-B, and a base transceiver. It may be called other terms such as a System, an Access Point, a Relay Node, and the like.
  • the transmission terminal 20 or a cell should be interpreted in a comprehensive sense indicating a part of a region covered by a base station controller (BSC) in a CDMA, a NodeB of a WCDMA, etc., and a radio remote connected to a base station.
  • BSC base station controller
  • Comprehensive means any type of device that can communicate with a single terminal, such as a head, relay node, a sector of a macro cell, a site, or a micro cell such as a femtocell or picocell. Used as a concept.
  • the terminal 10 and the transmitting terminal 20 are used as a transmitting and receiving entity used in implementing the technology or the technical idea described in this specification in a comprehensive sense and are not limited to the terms or words specifically referred to.
  • one terminal 10 and one transmission terminal 20 are shown in FIG. 1, the present invention is not limited thereto. It is possible for one transmission terminal 20 to communicate with the plurality of terminals 10, and one terminal 10 may communicate with the plurality of transmission terminals 20.
  • CDMA code division multiple access
  • TDMA time division multiple access
  • FDMA frequency division multiple access
  • OFDMA orthogonal frequency division multiple access
  • OFDM OFDM
  • the present invention is a combination of the TDD (Time Division Duplex) method is transmitted using a different time, uplink transmission and downlink transmission, FDD (Frequency Division Duplex) method is transmitted using a different frequency, combining the TDD and FDD Applicable to hybrid duplexing method.
  • TDD Time Division Duplex
  • FDD Frequency Division Duplex
  • embodiments of the present invention are applicable to asynchronous wireless communication that evolves into Long Term Evolution (LTE) and LTE-advanced through GSM, WCDMA, HSPA, and synchronous wireless communication that evolves into CDMA, CDMA-2000, and UMB.
  • LTE Long Term Evolution
  • WCDMA Long Term Evolution-advanced through GSM
  • WCDMA Wideband Code Division Multiple Access
  • HSPA High Speed Packet Access
  • CDMA Code Division Multiple Access
  • CDMA-2000 Code Division Multiple Access-2000
  • UMB Universal Mobile Broadband
  • the terminal 10 and the transmitter 20 may communicate wirelessly.
  • one radioframe or radio frame consists of 10 subframes, and one subframe consists of two slots.
  • the radio frame has a length of 10 ms and the subframe has a length of 1.0 ms.
  • the basic unit of data transmission is a subframe unit, and downlink or uplink scheduling is performed on a subframe basis.
  • One slot may have a plurality of OFDM symbols in the time domain and include at least one subcarrier in the frequency domain.
  • a slot may include seven OFDM symbols (in the case of the Normal Cyclic Prefix) or six OFDM symbols in the time domain and may include 12 subcarriers in the frequency domain.
  • the time-frequency domain defined as one slot may be referred to as a resource block (RB), but is not limited thereto.
  • the transmitting end 20 may perform downlink transmission to the terminal 10.
  • the transmitter 20 may transmit a physical downlink shared channel (PDSCH) as a downlink data channel for unicast transmission.
  • PDSCH physical downlink shared channel
  • the transmitter 20 may schedule downlink control information such as scheduling required for reception of the PDSCH and transmission for uplink data channel (for example, a physical uplink shared channel (PUSCH)).
  • PUSCH physical uplink shared channel
  • Indicator for distinguishing a physical downlink control channel (PDCCH) as a downlink control channel used for transmitting downlink control information (DCI) including grant information, a region of a PDSCH and a PDCCH Physical Control Format Indicator Channel (PCFICH) for transmitting the PHY, Physical HARQ Indicator Channel (PHICH) for transmitting the HARQ (Hybrid Automatic Repeat request) for uplink transmission
  • PDCCH Physical Control Format Indicator Channel
  • PHICH Physical HARQ Indicator Channel
  • HARQ Hybrid Automatic Repeat request
  • the horizontal axis represents time (symbol) and the vertical axis represents frequency.
  • the initial 1 to 3 symbols may be set to the control region 201 through which control information is transmitted.
  • the control region 201 may include a control channel such as PDCCH, PCFICH, PHICH, and the like.
  • the remaining area in the subframe may be set as the data area 202.
  • the data area 202 may include a data channel such as a PDSCH. Resource allocation information on frequency and time resources allocated to each terminal in the data region 202 may be transmitted through a PDCCH.
  • the PDCCH may be allocated in a control channel element (CCE) unit in the control region 201.
  • CCE control channel element
  • One CCE consists of nine Resource Element Groups (REGs), one REG is 8 bits, and one CCE consists of 72 bits.
  • the number of CCEs to which the PDCCH is allocated can be increased by an exponential function to 1, 2, 4, or 8 with different aggregation levels depending on the situation.
  • Downlink Control Information which is control information transmitted through the PDCCH, may include information of a resource region for resource allocation.
  • the resource region for resource allocation may be configured as a time frequency unit of a resource block (RB).
  • RB resource block
  • a bit request amount for indicating resource allocation information may increase, and thus, several resource blocks may be combined to allocate resources in units of a resource block group (RBG).
  • Resource allocation information represented by a resource block or a resource block group may be transmitted in the form of a resource indication value (RIV) in a resource allocation field in a PDCCH.
  • RIV resource indication value
  • the bandwidth considered in LTE is 1.4 / 3/5/10/15/20 MHz, and these may be represented as 6/15/25/50/75/100 as the number of resource blocks.
  • the size P of the resource block group represented by the number of resource blocks in each band is 1/2/2/3/4/4. Therefore, the number of resource block groups corresponding to each band is 6/8/13/17/19/25.
  • FIG. 3 (a) illustrates a resource allocation scheme of downlink type 0
  • FIG. 3 (b) illustrates a resource allocation scheme of downlink type 1
  • FIG. 3 (c) illustrates a resource allocation scheme of downlink type 2. To illustrate.
  • the downlink type 0 resource allocation scheme is a scheme of representing a resource allocation region in the form of a bitmap. For each resource block or resource block group, the resource block (or resource block group) to which the resource is allocated is represented by 1, and the resource block (or resource block group) that is not allocated to the resource is represented by 0. Resource allocation for a group).
  • the resource allocation is expressed by the downlink type 0
  • the amount of bits required is determined by the number of resource blocks.
  • the downlink type 1 resource allocation scheme is a scheme for indicating a resource allocation region in a periodic form.
  • the bits represent the size of the subset having this period P and one bit represents the offset, so the amount of bits required Becomes
  • the bit amount of the downlink type 1 may be designed to be equal to the bit amount of the type 0.
  • a differential bit for distinguishing type 0 and type 1 may be added.
  • the downlink type 2 resource allocation scheme is a scheme used when allocating a resource region having a contiguous constant length.
  • the RIV is expressed as an offset from the start of the continuous resource allocation area (hereinafter referred to as “cluster”) in the entire resource area and the length of the resource allocation area.
  • type 0 and type 1 represent non-contiguous resource allocations
  • type 2 represents only contiguous resource regions and requires only the amount of bits required for a large number of resource blocks in a system having a large bandwidth. Small compared to The bit requirement required in the downlink type 2 is to be.
  • the resource allocation scheme of uplink type 0 is the same as the resource allocation scheme of downlink type 2. That is, in the case of type 0, the RIV is expressed as an offset at the start of the continuous resource allocation area (cluster) and the length of the resource allocation area in the entire resource area.
  • the bit requirement amount required in the uplink type 0 is that the number of resource blocks when to be.
  • the uplink type 1 resource allocation scheme is a scheme in which resource allocation regions are represented by a plurality of non-contiguous clusters. If the number of clusters is larger than four, the signaling overhead for resource allocation is required, while the gain through resource allocation is minimal. Therefore, the resource allocation scheme of uplink type 1 is limited to a limited number of clusters (2 to 4 clusters). ) Can only be considered.
  • the uplink type 1 resource allocation scheme includes indexes ss 0 , ss 1 , ss 2 of resource blocks (or resource block groups) that are starting points of each cluster, and indexes of resource blocks (or resource block groups) that are endpoints (ee 0). , ee 1 , ee 2 ) can be used to calculate the RIV value for resource allocation. In the case of limiting the number of clusters to two, the amount of bits required in the uplink type 1 is to be.
  • MIMO multiple-input multiple-output
  • CoMP coordinated multi-point transmission / reception
  • the control region 201 In order to increase the maximum number of PDCCHs in the control region 201, it may be considered to increase the efficiency of the existing control region. It may be considered to simply define a newly defined PDCCH existing in the existing control region. That is, the smaller the payload length of the DCI format of the PDCCH may be considered to reduce the size of the payload in consideration of the characteristics that the code rate in terms of the encoder is lowered and the performance is increased. If the code rate is relatively large, the aggregation level is increased for a terminal having a poor channel situation, thereby increasing the number of CCEs occupying in the existing control region and reducing the maximum number of PDCCHs possible in the control region as a whole.
  • the compact PDCCH may serve to prevent the increase of the aggregation level as much as possible.
  • a part of the data area 202 may be used for control information.
  • an enhanced PDCCH or extended PDCCH (Enhanced-PDCCH or Extended-PDCCH, E-PDCCH) 502 including resource allocation information and control information of the PDSCH 501 is allocated.
  • E-PDCCH Extended-PDCCH
  • the control region 201 there is a PDCCH 503 including information on resources to which the E-PDCCH 502 is allocated.
  • the PDCCH 503 may include or minimally include resource allocation information and other control information of the PDSCH 501 (or PUSCH), and the allocation information and related control information of the E-PDCCH 502 (eg, MCS (Modulation).
  • the terminal finds the PDCCH 503 allocated to the user through blind decoding in the search space in the control region 201, and the information on the resource allocated to the E-PDCCH 502 by the PDCCH 503. In the case of a PDCCH including the E-PDCCH (502) is read using this.
  • the UE may grasp information on the resource to which the PDSCH 501 (or PUSCH) is allocated through the E-PDCCH 502.
  • an E-PDCCH search space 602 to which an E-PDCCH including resource allocation information and control information of the PDSCH 601 (or PUSCH) is allocated is set.
  • a plurality of control information may be located in the E-PDCCH search space 602.
  • PDCCHs 603 and 604 that contain information about resources to which the E-PDCCH search space 602 has been allocated.
  • the PDCCHs 603 and 604 may include or minimally include resource allocation information and other control information of the PDSCH 601, and may allocate allocation information and related control information (MCS, MIMO scheme, etc.) of the E-PDCCH search space 602.
  • the plurality of PDCCHs 603 and 604 may designate the same E-PDCCH search space 602.
  • the UE finds the PDCCHs 603 and 604 assigned to the user through blind decoding in the search space in the control region 201, and the PDCCHs 603 and 604 are assigned to the resources allocated to the E-PDCCH search space 602.
  • the location of the E-PDCCH search space 602 may be known using the information.
  • the UE may find the E-PDCCH allocated to the user through blind decoding in the E-PDCCH search space 602 and use the same to grasp information on a resource to which the PDSCH 601 (or PUSCH) is allocated.
  • the PDCCH including resource allocation information for the E-PDCCH or E-PDCCH search space needs to be distinguished from the existing PDCCH, and in this specification, the E-PDCCH or E-PDCCH search space
  • a PDCCH including resource allocation information for the PDCCH is called an indication PDCCH.
  • the indication PDCCH and the existing PDCCH may be distinguished by a newly defined transmission mode, or may be distinguished by classification information included in the PDCCH to distinguish the indication PDCCH and the existing PDCCH.
  • the indication PDCCH may be designed to have a relatively small information length compared to the existing PDCCH.
  • the configuration of the E-PDCCH may be configured through the indication PDCCH as described above, it may be configured without the indication PDCCH. That is, configuration information of the E-PDCCH may be transmitted through higher layer signaling (for example, RRC (Radio Resource Control) signaling).
  • RRC Radio Resource Control
  • the terminal does not grasp the search space dynamically, but semi-statically, it searches for the search space.
  • the UE may perform blind decoding in a given search space and extract an E-PDCCH corresponding to each UE through a cyclic redundancy check (CRC) check.
  • CRC cyclic redundancy check
  • the scheme for configuring the E-PDCCH may be a dynamic scheme using the indication PDCCH and a quasi-static scheme using higher layer signaling.
  • the search space for the E-PDCCH may be configured locally or may be distributed.
  • FIG. 6 shows an example in which an E-PDCCH search space is configured locally and an example in which distribution is configured.
  • the E-PDCCH search space may be locally set. In this case, the E-PDCCH search space may obtain frequency selective gain by using a specific frequency resource.
  • an E-PDCCH search space may be distributed. In this case, the E-PDCCH search space is distributed in the frequency domain.
  • the E-PDCCH may obtain frequency diversity gain.
  • a timing problem related to decoding delay may occur differently from the case of the conventional PDCCH.
  • the existing PDCCH belongs to the control region corresponding to the front part of the subframe, the signal can be relatively received and decoded first.
  • the E-PDCCH belongs to the data region, decoding is possible after receiving the complete subframe. Therefore, the E-PDCCH has a further restriction on the time required for decoding as compared to the existing PDCCH. This time constraint may result in a limitation on the final PDSCH decoding.
  • the size (number of bits) of the transport block of the PDSCH may be limited in a way of reducing the PDSCH decoding amount so that PDSCH decoding is sufficiently possible. In other words, it means that the total size of the resource block or resource block group allocated to the PDSCH can be limited.
  • Machine type communication may be variously referred to as machine to machine communication (M2M), Internet of Things (IoT), smart device communication (SDC), and machine oriented communication (Machine Oriented Communication).
  • M2M machine to machine communication
  • IoT Internet of Things
  • SDC smart device communication
  • Machine oriented communication Machine Oriented Communication
  • Mechanical communication refers to a variety of communications in which a person communicates with or without minimal intervention.
  • Mechanical communications include Smart Metering, e-Health, Connected Consumer, City Automation, Automotive Applications, Smart Grid, etc. It can be used in various fields.
  • the mechanical communication terminal is a terminal which does not intervene or minimally intervenes, and the power of the mechanical communication terminal must be able to be maintained continuously without human intervention for a long time.
  • the wireless access method of the MTC is considered to be based on the existing GSM / GPRS (Global Systems for Mobile communications / General Packet Radio Service) rather than LTE.
  • LTE-based wireless communication systems may require the following requirements.
  • a wireless communication system must be able to accommodate a very large number of mechanical communication terminals.
  • a very large number of mechanical communication terminals should be able to communicate to prevent traffic concentration.
  • a mechanical communication terminal suitable for a low data rate should be implemented.
  • the power used for communication must be reduced.
  • one of the main various methods is to limit the maximum size of resource allocation available to one terminal. This is desirable for low-cost MTC that requires a lower data rate than the existing LTE system, and at the same time, it can play a role of reducing the cost required for implementation by reducing the complexity incurred for decoding and encoding data. For example, if there is a restriction on downlink resource allocation, there is a limit on the maximum data size per subframe that can be allocated to the terminal. Accordingly, the configuration complexity of the turbo decoder, the configuration complexity of the channel estimator, the decoding complexity for MIMO related processing, etc. It is limited and can significantly reduce the complexity compared to the complexity required by the original LTE terminal receiver, thereby lowering the price of the final implementation chip. In addition, the battery duration can be extended by lowering the terminal battery demand.
  • the above-described resource allocation for E-PDCCH is different from the existing resource allocation for data allocation and requires only limited resource allocation, so that the basic characteristic is that the maximum size of the resource allocation is limited.
  • E-PDCCH decoding has a limitation of time that can be allocated to PDSCH decoding, and thus resource allocation for PDSCH in E-PDCCH may be more limited resource allocation than conventional data allocation. .
  • the maximum transmission rate is lower than that of the existing LTE terminal, and the maximum resource allocation is limited in view of reducing the price by reducing the transmission / reception complexity.
  • the resource allocation scheme in the compressed PDCCH, the indication PDCCH, the E-PDCCH, and the PDCCH for the MTC terminal may be a compressed resource allocation scheme as described below.
  • 7 is a view for explaining a resource allocation method according to an embodiment of the present invention. 7 illustrates a case where resources are continuously allocated in downlink or uplink.
  • the total number of resource blocks (or resource block groups) is N
  • the length of resource allocation is L in a continuous single cluster to which resources are allocated
  • the offset (index of the first resource block (or resource block group) of the cluster) j of the cluster may have a value of 0 to N-L (0 ⁇ j ⁇ N-L).
  • a method of allocating a value of RIV, and assigning a value from the case where the offset j is small for a predetermined length L and offsetting the next length L + 1 when all the offsets have been allocated
  • Equation 1 the value of RIV for resource allocation may be expressed as in Equation 1 below.
  • Equation 1 the maximum value of RIV (RIV max ) is And the amount of bits for resource allocation Becomes
  • RIV is encoded as shown in Equation 1, the decoding process is as follows.
  • L 1,2,... A value is obtained for, L max , and a length L that satisfies b (L) ⁇ RIV ⁇ b (L + 1) is obtained.
  • a method of allocating a value of RIV in which a value is assigned when the offset j is small for a predetermined length L, but the offset j is 0 to N-1 for all lengths L.
  • L 2 days
  • Equation 2 the value of RIV for resource allocation may be expressed as in Equation 2 below.
  • Equation 2 the maximum value of RIV (RIV max ) is And the amount of bits for resource allocation Becomes
  • the value of L can be obtained by dividing the received RIV value by N, and the value of j can be obtained by performing a modular operation (a calculation of the remainder of integer values) with N.
  • L 1,2,... A value is obtained for, L max , and a length L that satisfies b (L) ⁇ RIV ⁇ b (L + 1) is obtained.
  • the above-described resource allocation scheme for the case where resources are continuously allocated may be used in place of the existing downlink type 2 resource allocation scheme or the uplink type 0 resource allocation scheme.
  • 8 is a diagram illustrating a resource allocation method according to another embodiment of the present invention. 8 illustrates a case where resources are discontinuously allocated in downlink or uplink.
  • the number of all resource blocks (or resource block groups) is N
  • the number of resource blocks (or resource block groups) to which resources are allocated is L
  • L ⁇ L max is N
  • Enumerative source coding can be used as a method of assigning numbers for all possible cases for a certain number (L). Enumerated source coding can be expressed as:
  • a value of resource allocation information r can be calculated.
  • the decoding method of the value r encoded by enumeration source encoding is as follows. Count index (k) from the number (M) of resource blocks (or resource block groups) allocated resources for the value (Nx) minus the variable (x) from the number (N) of total resource blocks (or resource block groups) The combined value of minus (Mk) ( The variable x is incremented by 1 until) is less than or equal to the resource allocation information r. The variable x when the combined value is less than or equal to the resource allocation information r is determined as the index s k of the resource block (or resource block group) to which the resource is allocated.
  • the value obtained by subtracting the combined value from the resource allocation information r is again stored as the resource allocation information r, and the above-described process is repeated for the next coefficient index k. In this manner, all the indexes s k and 1 ⁇ k ⁇ M are extracted from the resource allocation information r.
  • the above-described decoding process can be represented as follows.
  • the resource allocation field may consist of two fields.
  • the first field may be a field indicating the number L of resource blocks (or resource block groups) to which resources are allocated.
  • the second field allocates bits to the required size at the maximum resource allocation (L max ), and enumerates and encodes each resource allocation.
  • L max maximum resource allocation
  • the value of enumerated source encoding can range from 0 to Since the value of, the bit amount of the second field is Becomes And, referring to Equation 3, the value of RIV in the second field is Becomes
  • a resource allocation field is assigned a value of RIV, and a method of allocating a value of RIV.
  • L + 1 the number of a predetermined resource block (or resource block group).
  • Equation 4 the value of RIV for resource allocation may be expressed as in Equation 4 below.
  • bit amount of the resource allocation field is calculated as follows.
  • L 1,2,...
  • L is obtained for L max , and the number L satisfying b (L) ⁇ RIV ⁇ b (L + 1) is obtained.
  • the above-described resource allocation scheme for the case where resources are allocated discontinuously may be used in place of the existing downlink type 0, type 1 resource allocation scheme, or uplink type 1 resource allocation scheme.
  • FIG. 9 is a flowchart illustrating a method of transmitting resource allocation information by a transmitter according to an embodiment.
  • the transmitting end sets the length L and the offset j of the cluster allocated to the data area (S901).
  • the cluster may be a resource to which the PDSCH (or PUSCH) shown in FIG. 2 is allocated, a resource to which the E-PDCCH shown in FIG. 5A is allocated, or a resource allocated to the E-PDCCH search space shown in FIG. 5B. .
  • the length L of the cluster may be limited to less than or equal to a predetermined maximum value L max .
  • L max a predetermined maximum value
  • the control information channel is a compact PDCCH having a shorter length than the existing PDCCH
  • the control information channel is an indication PDCCH indicating an E-PDCCH or an E-PDCCH search space
  • the control information channel is E.
  • the length L of the cluster may be limited.
  • the maximum value L max of the length of the cluster may be a preset value.
  • the length L of the cluster may be restricted within a predetermined maximum value L max .
  • the transmitted control information channel is a compressed PDCCH, an indication PDCCH, or an E-PDCCH
  • the length L of the cluster may be limited within a predetermined maximum value L max .
  • the maximum value L max of the length of the cluster may be transmitted through higher layer signaling such as RRC (Radio Resource Control).
  • RRC Radio Resource Control
  • the transmitter calculates the value of RIV using the set length L and offset j of the cluster (S902).
  • the value of RIV may be calculated using Equation 1 or Equation 2 described above.
  • the present invention is not limited to Equation 1 or Equation 2 described above, and various functions may be used in which length L and offset j may be uniquely determined from RIV.
  • the calculated value of the RIV is configured and transmitted in the resource allocation field in the control information channel (S903).
  • the control information channel may be a compressed PDCCH having a shorter length than a conventional PDCCH as a PDCCH including resource allocation information of a PDSCH (or PUSCH).
  • the compressed PDCCH and the conventional PDCCH may be executed under a newly defined transmission mode.
  • the transmitting end may transmit setting information on whether to transmit a compressed PDCCH or a conventional PDCCH to the terminal before transmitting the PDCCH.
  • the compressed PDCCH and the conventional PDCCH may have different lengths, and the UE may determine the type of the PDCCH from the length of the PDCCH and extract PDSCH (or PUSCH) allocation information.
  • the control information channel may be an indication PDCCH including resource allocation information of the E-PDCCH or the E-PDCCH search space.
  • the indication PDCCH may provide resource allocation and related control information (MCS, MIMO scheme, etc.) of the E-PDCCH or E-PDCCH search space.
  • the indication PDCCH and the conventional PDCCH may be executed under a newly defined transmission mode.
  • the transmitting end may transmit setting information on whether to transmit an indication PDCCH or a conventional PDCCH to the terminal before transmitting the PDCCH.
  • the indicated PDCCH and the conventional PDCCH may have different lengths, and the terminal may grasp the type of the PDCCH from the length of the PDCCH and extract the PDSCH allocation information.
  • the control information channel may be an E-PDCCH located in the E-PDCCH search space.
  • Configuration information for the E-PDCCH search space may be delivered from the transmitting end to the terminal by indicating PDCCH or higher layer signaling.
  • the E-PDCCH (see FIG. 5B) located in the E-PDCCH search space may have a shortened length compared to the E-PDCCH (see FIG. 5A) directly designated by the existing PDCCH and / or indication PDCCH.
  • the transmitting end may transmit configuration information on whether to transmit an E-PDCCH having an abbreviated length or an E-PDCCH having an unabbreviated length to the terminal.
  • the control information channel may be a PDCCH including resource allocation information of the PDSCH (or PUSCH) for the MTC terminal.
  • the PDCCH transmitted to the MTC terminal may have a shorter length than the PDCCH transmitted to other general terminals.
  • the transmitting end knows that the terminal to receive the PDCCH is the MTC terminal, and may transmit the PDCCH of the reduced length.
  • the transmitting end may transmit configuration information on whether to transmit a PDCCH having a reduced length or a conventional PDCCH to the MTC terminal before transmitting the PDCCH.
  • the PDCCH having an abbreviated length and the conventional PDCCH have different lengths, and the MTC terminal may grasp the type of the PDCCH from the length of the PDCCH and extract the PDSCH allocation information.
  • FIG. 10 is a flowchart illustrating a method for receiving resource allocation information of a terminal according to an embodiment.
  • the terminal receives the control information channel from the transmitter (S1001).
  • the received control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.
  • the terminal extracts and decodes the value of RIV from the resource allocation information field in the PDCCH to extract the length L and offset j of the allocated resource (cluster) (S1002). It is also possible for the length L and the offset j to be extracted at the same time or for the length L to be extracted first and the offset j to be extracted.
  • the allocated resource may be a resource allocated for a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space.
  • FIG. 11 is a block diagram illustrating a configuration of a transmission terminal according to an embodiment.
  • the transmitting end may include an encoder 1101 and a transmitter 1102.
  • the encoder 1101 receives information of the total number N of resource blocks or resource block groups, the length L of the cluster and the offset j set in the data region, and is input to the resource allocation field based on these. Calculate the value (RIV).
  • the cluster may be a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space.
  • the value of RIV may be calculated using Equation 1 or Equation 2 described above.
  • Transmitter 1102 sends the calculated RIV.
  • the value of the RIV may be included in the DCI and transmitted through the control information channel.
  • the control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.
  • FIG. 12 is a block diagram illustrating a configuration of a terminal according to an embodiment.
  • the terminal may include a receiver 1201 and a decoder 1202.
  • the receiver 1201 receives a signal including a control information channel from a transmitting end, and extracts a value RIV input to a resource allocation field in the control information channel.
  • the control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.
  • the RIV may include information about a resource of a PDSCH, a PUSCH, an E-PDCCH, or an E-PDSCH search space.
  • the decoder 1202 decodes the RIV to extract the length L and the offset j of the consecutively allocated resources (clusters).
  • information about the resources of the PDSCH, PUSCH, E-PDCCH, or E-PDSCH search space can be known.
  • FIG. 13 is a flowchart illustrating a method of transmitting resource allocation information by a transmitting end according to another embodiment.
  • the transmitting end sets an index of a resource allocated to a data area (S1301).
  • the allocated resource may be a resource to which a PDSCH (or PUSCH) is allocated as shown in FIG. 2, a resource to which an E-PDCCH is illustrated as shown in FIG. 5A, or a resource allocated to an E-PDCCH search space as illustrated in FIG. 5B. Can be.
  • the number of allocated resources may be limited to a predetermined maximum value L max or less.
  • L max a predetermined maximum value
  • the control information channel is a compact PDCCH having a shorter length than the existing PDCCH
  • the control information channel is an indication PDCCH indicating an E-PDCCH or an E-PDCCH search space
  • the control information channel is E.
  • the number L of resources may be limited when the E-PDCCH is located in the PDCCH search space or when the control information channel is a PDCCH indicating a data area of the mechanical communication terminal.
  • the maximum value L max of the number of resources may be a preset value.
  • the number of resources (L) can be limited within a predetermined maximum value (L max ).
  • the transmitted control information channel is a compressed PDCCH or an indication PDCCH or an E-PDCCH
  • the number L of resources may be limited within a predetermined maximum value L max .
  • the maximum value L max of the number of resources may be transmitted through higher layer signaling such as Radio Resource Control (RRC).
  • RRC Radio Resource Control
  • the transmitting end configures a resource allocation field by using the number of allocated resources L and the index of each allocated resource (S1302).
  • the resource allocation field may include a first field composed of the number L of resources and a second field composed of RIV calculated by Equation 3 using an index of each allocated resource.
  • the resource allocation field may be configured with an RIV calculated by applying the number L of resources allocated in Equation 4 and an index of each allocated resource.
  • Resource allocation information configured in the resource allocation field in the control information channel is transmitted (S1303).
  • the control information channel may be a compressed PDCCH having a shorter length than a conventional PDCCH as a PDCCH including resource allocation information of a PDSCH (or PUSCH).
  • the compressed PDCCH and the conventional PDCCH may be executed under a newly defined transmission mode.
  • the transmitting end may transmit setting information on whether to transmit a compressed PDCCH or a conventional PDCCH to the terminal before transmitting the PDCCH.
  • the compressed PDCCH and the conventional PDCCH may have different lengths, and the UE may determine the type of the PDCCH from the length of the PDCCH and extract PDSCH (or PUSCH) allocation information.
  • the control information channel may be an indication PDCCH including resource allocation information of the E-PDCCH or the e-PDCCH search space.
  • the indication PDCCH may provide resource allocation and related control information (MCS, MIMO scheme, etc.) of the E-PDCCH or E-PDCCH search space.
  • the indication PDCCH and the conventional PDCCH may be executed under a newly defined transmission mode.
  • the transmitting end may transmit setting information on whether to transmit an indication PDCCH or a conventional PDCCH to the terminal before transmitting the PDCCH.
  • the indicated PDCCH and the conventional PDCCH may have different lengths, and the terminal may grasp the type of the PDCCH from the length of the PDCCH and extract the PDSCH allocation information.
  • the control information channel may be an E-PDCCH located in the E-PDCCH search space.
  • Configuration information for the E-PDCCH search space may be delivered from the transmitting end to the terminal by indicating PDCCH or higher layer signaling.
  • the E-PDCCH (see FIG. 5B) located in the E-PDCCH search space may have a shortened length compared to the E-PDCCH (see FIG. 5A) directly designated by the existing PDCCH and / or indication PDCCH.
  • the transmitting end may transmit configuration information on whether to transmit an E-PDCCH having an abbreviated length or an E-PDCCH having an unabbreviated length to the terminal.
  • the control information channel may be a PDCCH including resource allocation information of the PDSCH (or PUSCH) for the MTC terminal.
  • the PDCCH transmitted to the MTC terminal may have a shorter length than the PDCCH transmitted to other general terminals.
  • the transmitting end knows that the terminal to receive the PDCCH is the MTC terminal, and may transmit the PDCCH of the reduced length.
  • the transmitting end may transmit configuration information on whether to transmit a PDCCH having a reduced length or a conventional PDCCH to the MTC terminal before transmitting the PDCCH.
  • the PDCCH having an abbreviated length and the conventional PDCCH have different lengths, and the MTC terminal may grasp the type of the PDCCH from the length of the PDCCH and extract the PDSCH allocation information.
  • FIG. 14 is a flowchart illustrating a method for receiving resource allocation information of a terminal according to another embodiment.
  • the terminal receives the control information channel from the transmitter (S1401).
  • the received control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.
  • the terminal first extracts the number of allocated resources L from the resource allocation information field in the control information channel (S1402), and then extracts an index of each allocated resource (S1403).
  • the allocated resource may be a resource allocated for a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space.
  • 15 is a block diagram illustrating a configuration of a transmission terminal according to an embodiment.
  • the transmitting end may include an encoder 1501 and a transmitter 1502.
  • the encoder 1501 may determine the total number N of resource blocks or resource block groups, the number L of allocated resource blocks or resource block groups, and the index s k of each of the allocated resource blocks or resource block groups (0 ⁇ 0). k ⁇ L-1) and calculates a value to be input into the resource allocation field based on these.
  • the resource allocation field includes a first field and a second field, the number L of resource blocks or resource block groups is input in the first field, and the RIV calculated by Equation 3 in the second field. Can be input.
  • the value to be input in the resource allocation field may be an RIV calculated by Equation 4.
  • the resource block or resource block group may be a resource block or resource block group to which a PDSCH, a PUSCH, an E-PDCCH, or an E-PDCCH search space is allocated.
  • the transmitter 1502 may transmit a DCI having a resource allocation field through a control information channel.
  • the control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.
  • 16 is a block diagram illustrating a configuration of a terminal according to an embodiment.
  • the terminal may include a receiver 1601 and a decoder 1602.
  • the receiver 1601 receives a signal including a control information channel from a transmitter, and extracts a value input in a resource allocation field in the control information channel.
  • the control information channel may be a compressed PDCCH, an indication PDCCH, an E-PDCCH, or a PDCCH for an MTC terminal.
  • the RIV may include information about a resource of a PDSCH, a PUSCH, an E-PDCCH, or an E-PDSCH search space.
  • the decoder 1602 extracts the indexes of consecutively allocated resource blocks or resource block groups by decoding the value input in the resource allocation field. First, the decoder 1602 extracts the number L of resource blocks or resource block groups, and extracts the index s k of the resource block or resource block group by using the same. Thus, information about the resources of the PDSCH, PUSCH, E-PDCCH, or E-PDSCH search space can be known.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention se rapporte à l'attribution de ressources dans un système de communication sans fil. En particulier, le procédé comprend : une étape de codage dans lequel un bloc de ressources ou un groupe de blocs de ressources génère une valeur d'indication de ressources (RIV) qui est une transformée de la longueur (L) et du décalage (j) d'une région d'attribution de ressources contiguë ; et une étape de transmission dans laquelle les informations d'attribution de ressources sont transmises à un terminal, les informations d'attribution de ressources étant calculées au moyen d'une équation mathématique indiquée.
PCT/KR2012/008741 2011-11-04 2012-10-24 Émetteur, procédé et terminal pour l'attribution de ressources, et procédé de réception d'informations d'attribution de ressources WO2013065990A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US14/356,143 US9246841B2 (en) 2011-11-04 2012-10-24 Transmitter, method and terminal for allocating resources, and method of receiving resource allocation information

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20110114499 2011-11-04
KR10-2011-0114499 2011-11-04
KR10-2012-0015040 2012-02-14
KR1020120015040A KR20130049695A (ko) 2011-11-04 2012-02-14 전송단, 자원 할당 방법, 단말, 및 자원 할당 정보 수신 방법

Publications (1)

Publication Number Publication Date
WO2013065990A1 true WO2013065990A1 (fr) 2013-05-10

Family

ID=48192295

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2012/008741 WO2013065990A1 (fr) 2011-11-04 2012-10-24 Émetteur, procédé et terminal pour l'attribution de ressources, et procédé de réception d'informations d'attribution de ressources

Country Status (1)

Country Link
WO (1) WO2013065990A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110226305A (zh) * 2017-01-27 2019-09-10 高通股份有限公司 针对使用扩展带宽的窄带通信的资源分配
WO2020085813A1 (fr) * 2018-10-26 2020-04-30 엘지전자 주식회사 Procédé de transmission et de réception de canal de données de liaison descendante et dispositif associé
CN111972020A (zh) * 2018-04-04 2020-11-20 华为技术有限公司 资源分配的方法和装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100921467B1 (ko) * 2008-06-19 2009-10-13 엘지전자 주식회사 셀룰라 다중반송파 시스템에서 조밀도를 조절하는 자원할당시그널링 방식
KR20100019336A (ko) * 2008-08-08 2010-02-18 엘지전자 주식회사 다중 주파수 대역 시스템에서의 자원 할당하는 방법 및 장치
KR20110050674A (ko) * 2008-08-12 2011-05-16 콸콤 인코포레이티드 랜덤 액세스 응답에서 업링크 승인의 취급
US20110122830A1 (en) * 2007-09-29 2011-05-26 Zte Corporation Methods and apparatuses for generating and parsing continuous resource allocation signaling
KR20110081017A (ko) * 2010-01-05 2011-07-13 주식회사 팬택 무선통신 시스템에서 자원할당전송방법 및 그 송신장치, 이에 대응하는 수신장치

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110122830A1 (en) * 2007-09-29 2011-05-26 Zte Corporation Methods and apparatuses for generating and parsing continuous resource allocation signaling
KR100921467B1 (ko) * 2008-06-19 2009-10-13 엘지전자 주식회사 셀룰라 다중반송파 시스템에서 조밀도를 조절하는 자원할당시그널링 방식
KR20100019336A (ko) * 2008-08-08 2010-02-18 엘지전자 주식회사 다중 주파수 대역 시스템에서의 자원 할당하는 방법 및 장치
KR20110050674A (ko) * 2008-08-12 2011-05-16 콸콤 인코포레이티드 랜덤 액세스 응답에서 업링크 승인의 취급
KR20110081017A (ko) * 2010-01-05 2011-07-13 주식회사 팬택 무선통신 시스템에서 자원할당전송방법 및 그 송신장치, 이에 대응하는 수신장치

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110226305A (zh) * 2017-01-27 2019-09-10 高通股份有限公司 针对使用扩展带宽的窄带通信的资源分配
CN111972020A (zh) * 2018-04-04 2020-11-20 华为技术有限公司 资源分配的方法和装置
CN111972020B (zh) * 2018-04-04 2024-05-31 华为技术有限公司 资源分配的方法和装置
WO2020085813A1 (fr) * 2018-10-26 2020-04-30 엘지전자 주식회사 Procédé de transmission et de réception de canal de données de liaison descendante et dispositif associé
US11350398B2 (en) 2018-10-26 2022-05-31 Lg Electronics Inc. Method and apparatus for transmitting and receiving downlink data channel

Similar Documents

Publication Publication Date Title
WO2014157921A1 (fr) Signaux de référence pour démodulation en liaison montante dans des systèmes avancés de communications sans fil
WO2012165875A2 (fr) Appareil et procédé permettant de définir des moments de transmission/réception de canal physique et une attribution de ressources dans un système de communication tdd supportant un regroupement de porteuses
WO2010131929A2 (fr) Procédé et appareil pour surveiller un canal de commande dans un système multiporteuses
WO2010131926A2 (fr) Procédé et dispositif pour surveiller le canal de commande dans un système multiporteuses
WO2014042452A1 (fr) Réception et configuration de canal de commande en liaison descendante
WO2013129868A1 (fr) Système de communication mobile et son procédé d'émission/réception de canal
WO2010123331A2 (fr) Procédé et appareil pour transmettre et recevoir un signal de commande pour fusionner des porteuses lors d'une transmission
WO2011078581A2 (fr) Procédé et appareil de définition des instants d'émission/réception d'un canal physique dans un système de communication duplex par répartition dans le temps assistant un ordonnancement entre porteuses
WO2012169800A2 (fr) Procédé de transmission et de réception d'informations de commande d'un système de communication mobile
WO2011145823A2 (fr) Procédé et dispositif de configuration d'un champ d'indication de porteuse dans un système multiporteuses
WO2019050165A1 (fr) Procédé d'émission et de réception d'informations de système dans un système de communication
WO2014025140A1 (fr) Transmission d'informations de commande et mappage de ressource de canal de commande de liaison montante
WO2012096488A2 (fr) Procédé de transmission pour données de commande dans système de communication et station de base pour celui-ci, et procédé de traitement pour données de commande et terminal pour celui-ci
WO2011136505A2 (fr) Procédé pour transmettre et recevoir un canal de commande dans un système de communication sans fil
WO2011105845A2 (fr) Procédé de transmission d'informations de commande dans un système de communication sans fil à porteuses multiples
WO2014171754A1 (fr) Procédé et appareil permettant la transmission et la réception d'informations de commande en liaison descendante
WO2011129632A2 (fr) Procédé de commande d'émission apériodique d'un signal de commande, et procédé et appareil d'émission-réception de signal de commande utilisant le procédé
WO2011013971A2 (fr) Procédé et appareil de transmission en liaison montante dans un système de communication sans fil
WO2016148362A1 (fr) Procédé d'attribution de ressources pour la prise en charge d'une pluralité de modes de communication sans fil dans un système de communication sans fil, et son dispositif
WO2019083278A1 (fr) Dispositif et procédé de réalisation d'une procédure d'accès aléatoire dans un système de communication sans fil
WO2013022267A2 (fr) Dispositif et procédé de transmission d'un canal de commande correspondant à de mutiples canaux de données
WO2013024985A2 (fr) Point de transmission, procédé pour la configuration d'un signal de référence pour celui-ci, terminal et procédé pour l'émission du signal de référence pour celui-ci
WO2020145662A1 (fr) Procédé et appareil de configuration de dmrs dans un système de communication sans fil
WO2011096744A2 (fr) Procédé et appareil pour effectuer des mesures dans une porteuse d'extension
WO2011096742A2 (fr) Procédé et appareil pour la transmission/réception de données dans un système de communications sans fil sur lequel fonctionne une pluralité de porteuses composantes

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12845157

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 14356143

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12845157

Country of ref document: EP

Kind code of ref document: A1