WO2013002471A1 - Procédé et appareil pour transmettre et recevoir des informations de commande de liaison descendante dans un système de communication sans fil - Google Patents

Procédé et appareil pour transmettre et recevoir des informations de commande de liaison descendante dans un système de communication sans fil Download PDF

Info

Publication number
WO2013002471A1
WO2013002471A1 PCT/KR2012/001253 KR2012001253W WO2013002471A1 WO 2013002471 A1 WO2013002471 A1 WO 2013002471A1 KR 2012001253 W KR2012001253 W KR 2012001253W WO 2013002471 A1 WO2013002471 A1 WO 2013002471A1
Authority
WO
WIPO (PCT)
Prior art keywords
search space
pdcch
pdcch candidates
predetermined offset
determined
Prior art date
Application number
PCT/KR2012/001253
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
Application filed by 엘지전자 주식회사 filed Critical 엘지전자 주식회사
Publication of WO2013002471A1 publication Critical patent/WO2013002471A1/fr

Links

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/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • 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/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
    • 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 following description relates to a wireless communication system, and more particularly, to a method and apparatus for transmitting and receiving downlink control information in a wireless communication system supporting one or more serving cells.
  • Wireless communication systems are widely deployed to provide various kinds of communication services such as voice and data.
  • a wireless communication system is a multiple access system capable of supporting communication with multiple users by sharing available system resources (bandwidth, transmission power).
  • multiple access systems include code division multiple access (CDMA) systems, frequency division multiple access (FDMA) systems, time division multiple access (TDMA) systems, orthogonal frequency division multiple access (0FDMA) systems, and SC-FDMAC single carrier frequency.
  • CDMA code division multiple access
  • FDMA frequency division multiple access
  • TDMA time division multiple access
  • OFDMA orthogonal frequency division multiple access
  • SC-FDMAC single carrier frequency SC-FDMAC single carrier frequency.
  • division multiple access (MCD) system and MC ⁇ FDMA Gult i carrier frequency division multiple access (MCD) system.
  • the present invention is to reduce the number of times the terminal performs the blind decoding It is a task.
  • a first technical aspect of the present invention is a method of receiving control information from a terminal in a wireless communication system, the method comprising: determining a search space consisting of physical downlink control channel (PDCCH) candidates on a subframe from a base station; And attempting to decode each of the PDCCH candidates in the search space, wherein the search space in which the decoding is attempted corresponds to the number of control channel elements (CCEs) included in each of the PDCCH candidates.
  • CCEs control channel elements included in each of the PDCCH candidates.
  • a control information receiving method which is determined by factors including a set level, a number of PDCCH candidates and a predetermined offset according to the set level.
  • a method of transmitting control information by a base station in a wireless communication system comprising: determining a search space consisting of physical downlink control channel (PDCCH) candidates on a downlink subframe; And transmitting the control information through one PDCCH among the PDCCH candidates in the search space, wherein the search space includes a control channel element (CCE) included in each of the PDCCH candidates.
  • Collection level based on the number, the collection It is to provide a control information transmission method, which is determined by factors including a number of PDCCH candidates and a predetermined offset according to a bell.
  • Technical aspect of the present invention provides an apparatus for receiving control information in a wireless communication system, comprising: receiving modules; And a processor, wherein the processor determines a search space consisting of physical downlink control channel (PDCCH) candidates, attempts to decode each of the PDCCH candidates on the search space, and the search space in which the decoding is attempted is performed. And a device level determined by factors including a number of control channel elements (CCEs) included in each of the PDCCH candidates, a number of PDCCH candidates according to the set level, and a predetermined predetermined offset.
  • CCEs control channel elements
  • a fourth technical aspect of the present invention is an apparatus for transmitting control information in a wireless communication system, comprising: transmission modules; And a processor, wherein the processor determines a search space consisting of physical downlink control channel (PDCCH) candidates on a downlink subframe, and wherein the control information is transmitted through a PDCCH of any one of the PDCCH candidates on the search space.
  • the search space is controlled to be transmitted, and the search space includes a set level corresponding to the number of control channel elements (CCEs) included in each of the PDCCH candidates, a number of PDCCH candidates according to the set level, and a predetermined predetermined offset.
  • CCEs control channel elements
  • the search space is the predetermined offset from the CCE number determined by the subframe number and the identifier of the terminal.
  • One or more PDCCH candidates corresponding to the moved CCE number may be determined.
  • the search space may be determined by one or more PDCCH candidates corresponding to the CCE number shifted by the predetermined offset from the CCE number determined by the subframe number and the identifier of the UE.
  • the search space may be determined by one or more PDCCH candidates including a CCE corresponding to an integer multiple of the predetermined offset from the CCE number determined by the subframe number and the identifier of the UE.
  • the predetermined offset may be reset in consideration of the aggregation level.
  • the predetermined offset may be reset to a smaller value of a value obtained by multiplying the predetermined offset by the set level and the number of CCEs corresponding to the search space when the predetermined offset is not applied at the set level.
  • the predetermined offset may be reset to be proportional to the number of CCEs corresponding to the search space when the predetermined offset is not applied.
  • the predetermined offset may include a quotient obtained by dividing the number of CCEs corresponding to the search space when the predetermined offset is not applied by the predetermined offset and the number of CCEs corresponding to the search space when the predetermined offset is not applied. It may be reset to a small value.
  • the predetermined offset is, of the subframe received before the subframe It may be determined from any one of the control information and higher trade-off signaling.
  • the number of blind decoding can be reduced, thereby reducing the processing burden of the terminal.
  • 1 is a diagram illustrating a structure of a radio frame used in a 3GPP LTE system.
  • 2 is a diagram illustrating a resource grid in a downlink slot.
  • 3 is a diagram illustrating a structure of an uplink subframe.
  • FIG. 4 is a diagram illustrating a structure of a downlink subframe.
  • FIG. 5 is a diagram illustrating a terminal specific search space at each aggregation level.
  • 6 is a diagram for explaining carrier aggregation.
  • FIG. 7 is a diagram for describing cross carrier scheduling.
  • 8 and 9 are diagrams for describing a method that can be used when exchanging scheduling information between respective base stations.
  • 10 is a diagram illustrating time-frequency resources allocated for ePDCCH.
  • FIG. 11 is a diagram for explaining that a search space is limited by using a relative offset.
  • FIG. 13 is a diagram illustrating that search space is limited to corresponding PDCCH candidates while skipping by an offset.
  • FIG. 14 is a diagram illustrating a bitmap configuration for reducing the number of blind decoding.
  • 15 is a diagram illustrating another configuration of a bitmap for reducing the number of blind decoding.
  • FIG. 16 is a diagram illustrating another configuration of a bitmap for reducing the number of blind decoding.
  • 17 is a flowchart illustrating an exemplary PDCCH transmission / reception method of the present invention.
  • 18 is a diagram showing the configuration of a preferred embodiment of a base station apparatus or a terminal apparatus according to the present invention.
  • each component or feature may be considered optional unless stated otherwise.
  • Each component or feature may be combined with other components or features It may be carried out in a form that is not.
  • some components and / or features may be combined to form an embodiment of the present invention.
  • the order of the operations described in the embodiments of the present invention may be changed. Some configurations or features of one embodiment may be included in another embodiment, or may be replaced with other configurations or features of another embodiment.
  • the base station has a meaning as a terminal node of a network that directly communicates with the terminal. Certain operations described in this document as being performed by a base station may be performed by an upper node of a base station in some cases.
  • a 'base station (BS)' may be replaced by terms such as a fixed station, a Node B, an eNode B (e B), an access point (AP), and the like.
  • e B eNode B
  • AP access point
  • base station may be used as a concept including a cell or a sector.
  • the repeater may be replaced by terms such as Relay Node (RN), Relay Station (RS).
  • terminal' may be replaced with terms such as UE user equipment (MS), mobile station (MS), mobile subscriber station (MSS), and subscriber station (SS).
  • MS UE user equipment
  • MS mobile station
  • MSS mobile subscriber station
  • SS subscriber station
  • Embodiments of the present invention may be supported by standard documents disclosed in at least one of IEEE 802 systems, 3GPP systems, 3GPP LTE and LTE-Advanced (LTE-A) systems, and 3GPP2 systems, which are wireless access systems. That is, steps or parts which are not described to clearly reveal the technical spirit of the present invention among the embodiments of the present invention may be supported by the above documents. In addition, all terms disclosed in this document may be described by the above standard document.
  • FDMA Code Division Multiple Access
  • FDMA Frequency
  • TDMA Time Division Multiple Access
  • TDMA Time Division Multiple Access
  • OFDMA Orthogonal Frequency Division Multiple Access
  • SC_FDMA Single Frequency Division Multiple Access
  • CDMA Carrier Frequency Division Multiple Access
  • UTRA Jni versa 1 Terrestrial Radio Access UTRA Jni versa 1 Terrestrial Radio Access
  • TDMA Time Division Multiple Access
  • 0FDMA may be implemented in a wireless technology such as IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802-20, Evolved UTRA (E-UTRA), or the like.
  • UTRA is part of the UMTSCUniversal Mobile TelecxMiimunications System.
  • 3GPP 3rd Generation Partnership Project
  • LTE term term evolution (3GPP) is a part of Evolved UMTS (E-UMTS) that uses E-UTRA, and employs 0FDMA in downlink and SC-FDMA in uplink.
  • LTE-M Advanced is the evolution of 3GPP LTE.
  • WiMAX can be described by the IEEE 802.16e standard OVirelessMAN—OFDMA Reference System) and the advanced IEEE 802.16m standard (WirelessMAN-OFDMA Advanced system).
  • IEEE 802.16e OVirelessMAN—OFDMA Reference System
  • WiMA-OFDMA Advanced system the advanced IEEE 802.16m standard
  • 1 (a) is a diagram showing the structure of a radio frame used in the 3GPP LTE system.
  • One radio frame includes 10 subframes, and one subframe includes two slots in the time domain.
  • the time for transmitting one subframe is defined as a Transmission Time Interval ( ⁇ ).
  • ⁇ Transmission Time Interval
  • one subframe may have a length of lms, and one slot may have a length of 0.5 ms.
  • One slot may include a plurality of 0FDM symbols in the time domain. Since the 3GPP LTE system uses the 0FDMA scheme in the downlink, the 0FDM symbol represents one symbol length (period).
  • One symbol in the uplink It may be referred to as an SC-FDMA symbol or a symbol length.
  • a resource block (RB) is a resource allocation unit and includes a plurality of consecutive subcarriers in one slot.
  • the structure of such a radio frame is merely exemplary. Accordingly, the number of subframes included in one radio frame, the number of slots included in one subframe, or the number of OFDM symbols included in one slot may be changed in various ways.
  • Kb illustrates the structure of a type 2 radio frame.
  • Type 2 radio frames consist of two half frames. Each half frame consists of five subframes, a down link pilot time slot (DwPTS), a guard period (GP), and an upPTSCUplink pilot time slot (1), of which one subframe consists of two slots. do.
  • the DwPTS is used for initial cell search, synchronization or channel estimation at the terminal.
  • UpPTS is used for channel estimation at the base station and synchronization of uplink transmission of the terminal.
  • the guard period is a period for removing interference caused in the uplink due to the multipath delay of the downlink signal between the uplink and the downlink.
  • the structure of the radio frame is merely an example, and the number of subframes included in the radio frame or the number of slots included in the subframe and the number of symbols included in the slot may be variously changed. Slot structure
  • One downlink slot includes seven OFDM symbols in the time domain and one resource block (RB) is illustrated as including 12 subcarriers in the frequency domain, but the present invention is not limited thereto.
  • one slot includes 7 OFDM symbols, but in the case of an extended CP, one slot may include 6 OFDM symbols.
  • Each element on the resource grid is called a resource element (RE).
  • One resource block includes 12 X 7 resource elements.
  • the number of NDLs of resource blocks included in the downlink slot depends on the downlink transmission bandwidth.
  • the structure of the uplink slot may be the same as the structure of the downlink slot.
  • the uplink subframe may be divided into a control region and a data region in the frequency domain.
  • a physical uplink control channel (PUCCH) including uplink control information is allocated to the control region.
  • a physical uplink shared channel (PUSCH) including user data is allocated.
  • PUCCH physical uplink control channel
  • PUSCH physical uplink shared channel
  • one UE does not simultaneously transmit a PUCCH and a PUSCH.
  • PUCCH for one UE is allocated to an RB pair in a subframe. Resource blocks belonging to a resource block pair occupy different subcarriers for two slots. The RB pair allocated to the PUCCH is allocated to the slot boundary. It is said to be frequency-hopped.
  • the downlink control channels used in the 3GPP LTE system include, for example, a physical control format indicator channel (PCFICH), a physical downlink control channel (PDCCH), and a physical HARQ offset channel. (Physical Hybrid automatic repeat request Indicator Channel, PHICH).
  • the PCFICH is transmitted in the first OFDM symbol of a subframe and includes information on the number of OFDM symbols used for control channel transmission in the subframe.
  • the PHICH includes a HARQ ACK / NACK signal as a response of uplink transmission.
  • the PDCCH includes uplink or downlink scheduling information and power control information.
  • the PDCCH is a resource allocation and transmission format of the downlink shared channel (DL-SCH), resource allocation information of the uplink shared channel (UL-SCH), paging information of the paging channel (PCH), system information on the DL-SCH, PDSCH Resource allocation of upper layer control messages, such as random access responses transmitted over a network, a set of transmit power control commands for individual terminals in a group of terminals, and transmission power control information of Voice over IP (VoIP) Activation and the like.
  • DL-SCH downlink shared channel
  • UL-SCH resource allocation information of the uplink shared channel
  • PCH paging information of the paging channel
  • system information on the DL-SCH PDSCH Resource allocation of upper layer control messages, such as random access responses transmitted over a network, a set of transmit power control commands for individual terminals in a group of terminals, and transmission power control information of Voice over IP (VoIP) Activation and the like.
  • VoIP Voice over IP
  • DCI formats 0, 1, 1A, IB, 1C, ID, 2, 2A, 2B, 2C, 3, 3A, and 4 are defined.
  • DCI formats 0, 1A, 3, and 3A are defined to have the same message size in order to reduce the number of blind decoding times to be described later.
  • These DCI formats are based on the purpose of the control information to be transmitted: i) DCI formats 0, 4, and ii) DCI formats 1, 1A, IB, 1C, ID, 2, 2A, 2B, 2C, and iii) DCI formats 3 and 3A for power control commands.
  • DCI format 0 used for uplink scheduling grant a carrier indicator necessary for carrier aggregation to be described later, an offset used to distinguish DCI formats 0 and 1A (flag for format 0 / format 1A differentiation), A frequency hopping flag indicating whether frequency hopping is used in uplink PUSCH transmissions, and the resource block allocation to be used by the UE for PUSCH transmission.
  • DMRS Demodulation reference signal
  • CSI request channel quality information
  • DCI format 0 since DCI format 0 uses synchronous HARQ, it does not include a redundancy version like DCI formats related to downlink scheduling allocation. In the case of carrier offset, if cross carrier scheduling is not used, it is not included in the DCI format.
  • DCI format 4 is new in LTE-A Release 10 and is intended to support spatial multiplexing for uplink transmission in LTE-A.
  • DCI format 4 since it further includes information for spatial multiplexing as compared with DCI format 0, it has a larger message size, and further includes additional control information in control information included in DCI format 0. That is, the DCI format 4 further includes a modulation and coding scheme for the second transmission block, precoding information for multi-antenna transmission, and sounding reference signal request (SRS request) information.
  • SRS request sounding reference signal request
  • DCI formats 1, 1A, IB, 1C, 1D, 2, 2A, 2B, and 2C related to downlink scheduling assignment do not significantly support spatial multiplexing with 1, 1A, IB, 1C, 1D and spatial multiplication.
  • Supporting 2 ⁇ can be divided into 2A, 2B, 2C.
  • DCI format 1C supports only frequency continuous allocation as a compact downlink allocation and does not include a carrier offset and a redundant version as compared to other formats.
  • DCI format 1A is a format for downlink scheduling and random access procedures. This includes an indicator indicating whether carrier offset, downlink distributed transmission is used, PDSCH resource allocation information, modulation and coding scheme, redundancy version, HARQ processor number to inform processor used for soft combining,
  • the HARQ process may include a new data offset used for emptying the buffer for initial transmission, a transmit power control command for PUCCH, and an uplink index required for TDD operation.
  • DCI format 1 In the case of DCI format 1, most of the control information is similar to DCI format 1A. However, DCI format 1 supports non-contiguous resource allocation, compared to DCI format 1A related to continuous resource allocation. Therefore, since DCI format 1 further includes a resource allocation header, the control signaling overhead is somewhat increased as a trade-off of increasing flexibility of resource allocation.
  • the DCI format IB and ID are common in that they contain precoding information as compared with DCI format 1.
  • DCI format 1B includes PMI verification and DCI format 1D includes downlink power offset information.
  • the control information included in the DCI format IB and ID is mostly identical to that of the DCI format 1A.
  • DCI formats 2, 2A, 2B, and 2C basically control information included in DCI format 1A. Including most of them, it contains more information for spatial multiplexing. This includes the modulation and coding scheme, the new data offset, and the redundancy version for the second transport block.
  • DCI format 2 supports closed-loop spatial multiplexing, and 2A supports open-loop spatial multiplexing. Both contain precoding information.
  • DCI format 2B supports dual layer spatial multiplexing combined with beamforming and further includes cyclic shift information for DMRS.
  • DCI format 2C can be understood as an extension of DCI format 2B and supports public multiplexing up to eight layers.
  • DCI formats 3 and 3A can be used to supplement transmission power control information included in DCI formats for uplink scheduling grant and downlink scheduling assignment, that is, to support semi-persistent scheduling. have.
  • DCI format 3 1 bit per terminal and 2 bit instructions for 3A are used.
  • Any one of the above-described DCI formats may be transmitted through one PDCCH, and a plurality of PDCCHs may be transmitted in a control region.
  • a Cyclic Redundancy Check (CRC) is attached to the DCI, and in this process, a radio network temporary identifier (RNTI) is masked.
  • the RNTI may use different RNTIs according to the purpose of transmitting the DCI.
  • network initiation (network initiated) P-RNTI may be used for a paging message related to connection establishment
  • RA-RNTI for a random access
  • SI-RNTI may be used for a system information block (SIB).
  • SIB system information block
  • C-RNTI which is a unique terminal identifier, may be used.
  • DCI with CRC is coded with a predetermined code and then adjusted to the amount of resources used for transmission through rate-matching.
  • a control channel element which is a continuous logical allocation unit, is used to map the PDCCH to the REs for efficient processing.
  • the CCE consists of 36 REs, which corresponds to 9 units in a resource element group (REG).
  • the number of CCEs required for a specific PDCCH depends on the DCI payload, cell bandwidth, channel coding rate, and the like, which are control information sizes. In more detail, the number of CCEs for a specific PDCCH may be defined according to the PDCCH format as shown in Table 1 below.
  • the transmitter may use the PDCCH format by changing the PDCCH format to 2 when the channel state worsens while using the PDCCH format 0.
  • Blind decoding
  • any one of four formats may be used for the PDCCH, which is not known to the UE. Therefore, the UE needs to decode without knowing the PDCCH format, which is called blind decoding. However, since it is a heavy burden for the UE to decode all possible CCEs used for downlink for each PDCCH format, a search space is defined in consideration of the scheduler limitation and the number of decoding attempts.
  • the search space is a set of candidate PDCCHs consisting of CCEs that the UE should attempt to decode on an aggregation level.
  • the aggregation level and the number of PDCCH candidates may be defined as shown in Table 2 below.
  • the terminal since four aggregation levels exist, the terminal has a plurality of search spaces according to each aggregation level.
  • the search space may be divided into a terminal specific search space and a common search space.
  • the UE-specific discovery space is for specific UEs, and each UE monitors the UE-specific discovery space (attempting to decode a PDCCH candidate set according to a possible DCI format) to identify RNTI and CRC masked on the PDCCH. If valid, control information can be obtained.
  • the common search space is for a case where a plurality of terminals or all terminals need to receive the PDCCH, such as dynamic scheduling or paging message for system information.
  • the common search space may be used for a specific terminal for resource operation. It may be.
  • the common search space may overlap with the terminal specific search space.
  • the search space may be specifically determined by Equation 1 below.
  • ⁇ is determined by RNTI and subframe number k
  • m is the number of PDCCH candidates
  • K is always determined to be zero.
  • 5 shows a UE-specific search space (shaded part) at each aggregation level that can be defined according to Equation (1).
  • Carrier merge is not used here.
  • N CCE, k is illustrated as 32 for convenience of explanation.
  • FIG. 5 illustrates the case of aggregation levels 1, 2, 4, and 8, respectively, and the numbers represent CCE numbers.
  • the start CCE of the search space at each aggregation level is determined by the RNTI and the subframe number k as described above, and may be determined differently for each aggregation level due to the modulo function in the same subframe for one UE.
  • L is always determined as a multiple of the aggregation level.
  • k is assumed to be CCE number 18 by way of example.
  • the terminal Decoding is sequentially performed in units of CCEs determined according to the corresponding aggregation level. For example, in (b) of FIG. 5, the UE attempts to decode two CCE units according to the aggregation level from CCE No. 4, which is a starting CCE.
  • the UE attempts to decode the search space, and the number of decoding attempts is determined by a transmission mode determined through DCI format and RRC signaling.
  • the UE should consider two DCI sizes (DCI format 0 / 1A / 3 / 3A and DCI format 1C) for each of 6 PDCCH candidates for a common search space. Decryption attempt is necessary.
  • a cell may be understood as a combination of downlink resources and uplink resources.
  • the uplink resource is not an essential element, and therefore, the cell is a downlink resource alone or May be composed of a downlink resource and an uplink resource.
  • the downlink resource may be referred to as a downlink component carrier (DL CC) and the uplink resource may be referred to as an uplink component carrier (UL CC).
  • DL CC and UL CC may be expressed as a carrier frequency (carrier frequency), the carrier frequency means a center frequency (center frequency) in the cell.
  • a cell may be classified into a primary cell (PCell) operating at a primary frequency and a secondary cell (SCell) operating at a secondary frequency.
  • PCell and SCell may be collectively referred to as a serving cell.
  • the terminal may perform an initial connection establishment (initial connection establishment) process, or the cell indicated in the connection reset process or handover process may be a PCell. That is, the PCell may be understood as a cell that is the center of control in a carrier aggregation environment to be described later.
  • the UE may receive and transmit a PUCCH in its PCell.
  • the SCell is configurable after the RRC connection is established and can be used to provide additional radio resources.
  • the remaining serving cells except the PCell may be viewed as SCells.
  • SCells In the carrier aggregation environment, the remaining serving cells except the PCell may be viewed as SCells.
  • the network may configure one or more SCells in addition to a PCell initially configured in a connection establishment process after an initial security activation process is initiated.
  • Carrier aggregation is a technology introduced in LTE-A that allows the use of wider frequency bands to meet the increasing demand for higher data rates.
  • Carrier aggregation may be defined as an aggregation of two or more component carriers (CCs) having different carrier frequencies.
  • FIG. 6 (a) shows a subframe when one CC is used in the existing LTE system
  • FIG. 6 (b) shows a subframe when carrier aggregation is used.
  • FIG. 6B three CCs of 20 MHz are used to support a total bandwidth of 60 MHz.
  • each CC may be continuous or may be non-continuous.
  • the UE may simultaneously receive and monitor downlink data through a plurality of DL CCs.
  • the linkage between each DL CC and UL CC may be indicated by system information.
  • DL CC / UL CC links can be fixed in the system or configured semi-statically.
  • the frequency band that can be monitored / received by a specific terminal may be limited to M ( ⁇ N) CCs.
  • Various parameters for carrier merging may be set in a cell specific (ceU-specific), UE group-specific (UE group-specific) or UE-specific (UE-specific) manner.
  • Cross carrier scheduling may be set in a cell specific (ceU-specific), UE group-specific (UE group-specific) or UE-specific (UE-specific) manner.
  • Cross-carrier scheduling means, for example, including all downlink scheduling allocation information of another DL CC in a control region of one DL CC among a plurality of serving cells, or a DL CC of any one of a plurality of serving cells. This means that the uplink scheduling grant information for the plurality of UL CCs linked with the DL CC is included in the control region of the UE.
  • 7 is a diagram illustrating a case where cross carrier scheduling is applied. As a premise of description, a carrier indicator field (CIF) will be described first, and FIG. 7 will be described.
  • CIF carrier indicator field
  • the CIF may be included or not included in the DCI format transmitted through the PDCCH, and when included, it indicates that the cross carrier scheduling is applied. If cross carrier scheduling is not applied, downlink scheduling allocation information is valid on a DL CC through which current downlink scheduling allocation information is transmitted. In addition, the uplink scheduling grant is valid for one UL CC linked with the DL CC through which the downlink scheduling allocation information is transmitted.
  • the CIF indicates a CC related to downlink scheduling allocation information transmitted through a PDCCH in one DL CC.
  • downlink allocation information about DL CC B and DL CC C that is, information about PDSCH resources, is transmitted through a PDCCH in a control region on DL CC A.
  • the UE monitors the DL CC A to know the CC corresponding to the resource region of the PDSCH through the CIF.
  • Control information included in the above-described DCI formats are defined in LTE / LTE-A.
  • ePDCCH enhanced PDCCH
  • Cellular network-based wireless communication systems have the same type of homogeneous network or different types of heterogeneous network interference.
  • the influence of such interference may affect not only the data channel but also the control channel.
  • a cell causing interference may select an Almost blank subframe (ABS) (a basic downlink signal (eg, Sal-specific reference signal, etc.)). Except for 0 or very weak power subframes), the interference to neighboring cells is reduced or allocated to the UE at the cell edge using inter-base station scheduling information.
  • the frequency domain of each cell may be set to be orthogonal.
  • the control channel (PDCCH, PCFICH, PHICH) may need to be transmitted in all subframes, the entire downlink bandwidth There is a problem that it is difficult to avoid interference because it is allocated and transmitted.
  • FIG. 8 is a technique that can be used when exchanging scheduling information between base stations, and shows a technique of allocating PDSCH in a frequency region orthogonal to terminals at a cell edge to mitigate interference.
  • the PDCCH has a problem in that interference cannot be mitigated due to a reason for transmitting the entire downlink bandwidth. For example, since the time-frequency region in which the PDCCH from eNBl to UE1 is transmitted and the time-frequency region in which the PDCCH from eNB2 to UE2 are transmitted overlap, the PDCCH transmission for each of UEl and UE2 is mutually different. Interfere with and receive.
  • the PUCCH or the PUSCH transmitted by the UE1 may act as an interference to the PDCCH or the PDSCH that the adjacent UE2 should receive.
  • the interference on the PDSCH can be avoided by allocating the terminals to the orthogonal frequency domain, but the PDCCH is affected by the interference by the PUCCH or the PUSCH transmitted by the UE1.
  • the introduction of an ePDCCH different from the current PDCCH is discussed.
  • the ePDCCH has a purpose to effectively support CoMP (Coordinated Multipoint Transmission) and MU-MIMO (Multiuser-Multi Input Multi Output) as well as interference.
  • CoMP Coordinatd Multipoint Transmission
  • MU-MIMO Multiuser-Multi Input Multi Output
  • the time-frequency resource for the ePDCCH is the time-frequency resource region for the PDCCH in the existing LTE / LTE-A system as shown in FIG. 10 (a) (eg, the first in the subframe).
  • a slot may be allocated in a time division multiplexing (TDM) scheme in a time-frequency resource region excluding up to four OFDM symbols from the beginning). That is, PDCCH and ePDCCH may be distinguished on the time axis.
  • the ePDCCH may be allocated to a predetermined number of OFDM symbols other than the OFDM symbol to which the PDCCH is allocated in the first slot of the subframe.
  • time-frequency resources for the ePDCCH may be allocated by frequency division multiplexing (FDM). That is, different ePDCCHs can be distinguished on the frequency axis.
  • FDM frequency division multiplexing
  • the ePDCCH may be allocated to a predetermined number of subcarriers for the entire 0FDM symbol except for the resource region for the PDCCH in the subframe.
  • an area to which an ePDCCH is allocated may be set to an area that is divided from an existing PDCCH and / or another ePDCCH and one or more time resources or frequency resources.
  • MTC machine type communication
  • M2D device to device
  • M2M machine to machine
  • MU-MIM0 multi user-multiple input multiple output
  • CoMP Coordinatd Multipoint Tx / Rx
  • MTC MTC
  • data transmission can occur widely within one cell boundary, many terminals can be located, and due to the characteristics of each terminal (eg refrigerator, washing machine, mobile phone, TV, laptop, etc.) It may be configured in other forms.
  • the characteristics of these terminals may be designed by dividing them into categories as shown in Table 3 below in terms of implementation of the terminal.
  • UE category 1 is composed of terminals for low data rates, which do not support MIM0 and may have a small buffer size or memory size in the terminal, or use a simple reception algorithm. It is possible to design at low cost.
  • UE category 8 it requires a high data rate, so it supports MIM0 and requires a large buffer or memory, which requires expensive components for the design.
  • the blind decoding described above can be very burdensome for the terminal. Therefore, it is necessary to reduce the number of blind decoding of the terminal.
  • the method for reducing the number of blind decoding of the terminal described below is not limited to the MTC device only, it is noted that it can be applied to the terminals in the existing LTE / LTE-A system. How to reduce the number of blind decoding-limit the search space
  • the offset may be preset. Or, the offset is of the subframe received by the current terminal The UE may be informed from the DCI of the previous subframe or may be notified to the UE through higher layer signaling.
  • the offset may be a relative value with respect to the CCEs included in the search space or may be an absolute value that is a CCE number.
  • FIG. 11 is a diagram for explaining that a search space is limited by using an offset, which is a relative value.
  • FIG. 11 exemplarily shows that the aggregation level is set at the second and kth subframes.
  • search space, k is Equation 1, which defines the search space in the existing LTE / LTE-A system
  • the search space limited by the offset CCE number may be promised as one of the following.
  • the restricted search space is area a.
  • the restricted search space is area b.
  • the restricted search space is the area c. iv) if the area is larger than the CCE number offset from the largest CCE number in the search space, the restricted search space is the area d.
  • n ⁇ 'K 33, k is 18, and cross carrier C (2)
  • the search space, k is shown when scheduling is not taken into account.
  • the limited search space may be promised as one of the following.
  • the limited search space in each case may be represented by Equations 2 and 3, respectively.
  • the search space may be limited to corresponding PDCCH candidates while skipping by the offset in the search space.
  • FIG. 13 illustrates that the search space is limited to corresponding PDCCH candidates while skipping by an offset.
  • 13 (a) shows the smallest CCE number in the search space. The offset is applied as a reference, and FIG. 13 (b) shows that the offset is applied based on the largest CCE number in the search space.
  • the aggregation level is the entire control area in the 2nd and kth subframes.
  • the number of CCEs, is 33, k is 18, and the offset is assumed to be 4.
  • the search space It can be seen that PDCCH candidate pel corresponding to 4, which is the smallest CCE number in P2, PDCCH candidate pc2 skipped by offset 4, and PDCCH candidate pc3 skipped by offset 4 again are determined to be limited search spaces. In this case, the UE should perform blind decoding at aggregation level 2.
  • the number of PDCCH candidates is reduced from six to three.
  • the above description is the existing search hole m
  • the search space is limited by skipping by the offset toward the CCE number. Therefore, the limited search space is determined by three PDCCH candidates of pel, pc2, and pc3. In this case, one of the factors in Equation 1 that defines the existing search space m ⁇ ⁇ , -.-, ⁇ - ⁇
  • the offset value may be set in the following methods.
  • the offset value can be set regardless of the aggregation level.
  • the UE has a search space for each of four aggregation levels, 1, 2, 4, and 8. Further, an offset value limiting the search space may be set to the same value at all aggregation levels. Can be. In this case, there is an advantage that the signal overhead can be reduced compared to setting the offset value to a different value at each set level.
  • the offset value may be set in consideration of the aggregation level. That is, the offset value may be set to be proportional to the set level, or set to be proportional to the total number of CCEs included in the search space at each set level, or the offset value may be set to a different value at each set level.
  • the offset value may be set the same for the common search space and the terminal specific search space or different for the common search space and the terminal specific search space. Can be set.
  • the offset value When the offset value is set to be proportional to the aggregation level, as described in FIGS. 11 and 12, the offset value may be described in two cases, the relative offset and the absolute offset.
  • the offset value may be set as in Equation 4.
  • offset L ⁇ offset, L where is the set level, 0 ff set may be a value determined irrespective of the set level, or may be the offset mentioned in the description of FIGS. 11 and 12, in which case offset is represented by u and It can be understood that the offset mentioned in the description of FIG. 12 is reset.
  • Table 4 below shows an example of offset values in the case of off set and two 2.
  • the search space when the offset value is larger than the size of the search space or the offset value equal to the size of the search space, the search space is not limited by the offset, that is, the same as the existing search space. It can be understood that. Alternatively, the search space may be applied by increasing the offset value.
  • Equation 4 the offset value is the number of CCEs included in each set level.
  • Equation 4 may be rewritten as Equation 5.
  • offsetL min (offsefxL, # size of CCEs in aggregation level L) where is the aggregation level, # size of CCEs in aggregation level is the number of CCEs included in the search space at the aggregation level and can also be expressed as ⁇ ⁇ ( ⁇ °).
  • Table 6 below is an example of applying Equation 5 in the case of ° ff Set ⁇ ⁇ as in the case of Table 5.
  • Equation 6 it may be set as in Equation 6 to be proportional to the set level.
  • the offset value determined to be proportional to the aggregation level may be limited to the total number of CCEs included in the subframe as shown in Equation 7.
  • the offset value may be set as Equation 8 below or as shown in Equation 9 in which the offset value is limited to the number of CCEs included in each set level.
  • It may be a value determined irrespective of the aggregation level, or may be an offset mentioned in the description of FIGS. 11 and 12,
  • # size of CCEs in aggregation level L may be represented as ⁇ xM () as the number of CCEs included in the search space at aggregation level L.
  • Table 9 below shows an example of offset values in the case of off set ⁇ ⁇ ⁇ .
  • Equation 11 It can be set as shown in Equation 11 to limit the preset value to the total number of CCEs included in the subframe.
  • Equation 11 In Equations 8 to 11, 0 ff Set may be a nonzero rational number.
  • Table 10 below is an example of offset values in the case of ffset ⁇ ⁇ .
  • bitmap may inform the terminal through higher layer signaling.
  • 14 is a diagram illustrating a bit blind configuration for reducing the number of blind decoding.
  • a bitmap includes 22 bits, and each bit represents a PDCCH candidate to be monitored by the UE.
  • a bit of 1 means that a DCI exists in a corresponding PDCCH candidate.
  • the UE monitors a total of 16 PDCCH candidates for all aggregation levels (1, 2, 4, and 8) in the UE-specific search space.
  • the UE has a total of six PDCCH candidates at all aggregation levels (4, 8) in the common search space.
  • a total of 22 PDCCH candidates to be monitored by the UE at each aggregation level are arranged, which are arranged in the order of the aggregation level for the UE-specific discovery space as shown in FIG.
  • Bitmaps can be constructed by arranging them in the order of size.
  • the terminal knows the bitmap configured as described above through higher layer signaling and the like, and monitors only PDCCH candidates of a set level corresponding to a bit indicated by 1 in the bitmap, compared to conventional monitoring of 22 PDCCH candidates. Since the number of decoding operations can be performed, the number of decoding can be greatly reduced.
  • a bit indicated by 1 in FIG. 14 is a third PDCCH candidate of aggregation level 1 in the UE-specific search space and a second PDCCH candidate of aggregation level 4 in the common discovery space. Accordingly, the UE may acquire DCI transmitted to itself by monitoring only these two locations.
  • the bitmap is composed of 22 bits, whereas in FIG. 15, the bitmap can be configured with 16 bits.
  • the bit blind may be configured with an aggregation level indication bit and location bits indicating the number of PDCCH candidates among the PDCCH candidates.
  • the number of four sets of 1,2, 4, and 8 aggregation levels is present, and this can be represented using 2 bits. Since there are a maximum of six PDCCH candidates in the aggregation level, three bits may be used to inform that a DCI is allocated. Here, a total of 10 bits may be used as 5 bits for aggregation levels 1 and 2 and 5 bits for aggregation levels 4 and 8. In the case of the common search space, since there are two sets of 4 and 8 aggregation levels, it can be represented by 1 bit, and since the maximum number of PDCCH candidates is 4, it can inform that DCI is allocated using 2 bits.
  • a total of 6 bits may be used as 3 bits for the aggregation level 4 and 3 bits for the aggregation level 8.
  • DCI is allocated to a third PDCCH candidate position when the aggregate level is 1 in a UE-specific search space and a second PDCCH candidate position when the aggregate level is 4 in the common discovery space.
  • Set to 1 to inform the UE of the location of DCI allocation in a bitmap.
  • bit blind may be composed of 8 bits as shown in FIG.
  • a total of 5 bits may be used as 3 bits to indicate positions of 2 bits and PDCCH candidates (maximum of 6) to indicate aggregation levels 1, 2, 4, and 8.
  • PDCCH candidates maximum of 6
  • Common navigation In the case of space, a total of 3 bits may be used as 2 bits to indicate 1 bit and PDCCH candidates (maximum 4) to indicate aggregation levels 4 and 8.
  • the aggregation level is represented by i) bit values 00, 01, 10, and 11 in the terminal specific search space, respectively, meaning aggregation levels 1, 2, 4, and 8, and ii) bit values in the common search space. 0 and 1 may be set to mean aggregation levels 4 and 8.
  • 17 is a flowchart illustrating an exemplary PDCCH transmission / reception method of the present invention.
  • the UE may determine a search space consisting of PDCCH candidates on a subframe.
  • the search space is determined by the CCE number determined by the aggregation level, the subframe number and the identifier of the UE, the number of PDCCH candidates in the aggregation level, and the like.
  • the offset may be applied.
  • step S1720 the UE may attempt to decode PDCCH candidates in the search space in step S1710.
  • the UE may perform CRC demasking using its identifier (RNTI).
  • step S1730 the UE may receive downlink control information in the case of the PDCCH in which both the CRC and its identifier are confirmed.
  • FIG. 18 is a diagram illustrating the configuration of a base station apparatus and a terminal apparatus according to the present invention.
  • the base station apparatus 1810 may include a receiving module 1811, transmission modules 1812, a processor 1813, a memory 1814, and a plurality of antennas 1815.
  • the plurality of antennas 1815 means a base station apparatus supporting MIM0 transmission and reception.
  • the reception modules 1811 may receive various signals, data, and information on uplink from the terminal.
  • the transmission modules 1812 may transmit various signals, data, and information on downlink to the terminal.
  • the processor 1813 may control operations of the base station apparatus 1810 in general.
  • the base station apparatus 1810 may be configured to transmit control information for uplink multi-antenna transmission.
  • the processor 1813 of the base station apparatus may be configured to transmit the DCI on the PDCCH, via the transmission modules 1812.
  • the processor 1813, the physical downlink control channel for a specific terminal Determine a set level corresponding to the number of CCEs required for the (PDCCH), and map the control information to any one PDCCH candidate in a search space consisting of PDCCH candidates each including the determined number of CCEs;
  • the space may be determined by the aggregation level, the number of PDCCH candidates according to the aggregation level, and a predetermined offset.
  • the search space limitation may be applied to the above-described methods related to the limitation of the search space, and the offset which is a predetermined offset may also be determined by the above-described offset setting method.
  • the processor 1813 of the base station apparatus 1810 performs a function of processing the information received by the base station apparatus 1810, information to be transmitted to the outside, and the like. Can be stored and replaced with components such as buffers (not shown).
  • the terminal device 1820 may include reception modules 1821, transmission modules 1822, a processor 1827, a memory 1824, and a plurality of antennas 1825. have.
  • the plurality of antennas 1825 means a terminal device supporting MIM0 transmission and reception.
  • Receive modules 1821 may receive various signals, data, and information on downlink from the base station.
  • the transmission modules 1822 may transmit various signals, data, and information on the uplink to the base station.
  • the processor 1827 may control operations of the entire terminal device 1820.
  • the terminal device 1820 may be configured to perform uplink multiple antenna transmission.
  • the processor 1823 of the terminal device receives the receiving modules. It may be configured to receive the PDCCH via 1821.
  • the processor 1813 may be configured to attempt decoding on a search space consisting of PDCCH candidates for control information.
  • the search space in which the decoding is attempted may be determined by an aggregation level corresponding to the number of CCEs included in each of the PDCCH candidates, the number of PDCCH candidates according to the aggregation level, and a predetermined offset.
  • the limitations of the search space may be applied to the above-described methods related to the limitation of the search space, and the offset which is a predetermined offset may also be determined by the above-described offset setting method.
  • the processor 1831 of the terminal device 1820 performs a function of processing information received by the terminal device 1820, information to be transmitted to the outside, and the memory 1824 performs a predetermined time for calculating the processed information and the like. Can be stored and replaced with components such as buffers (not shown).
  • the description of the base station apparatus 1810 may be equally applicable to a relay apparatus as a downlink transmitting entity or an uplink receiving entity, and the description of the terminal device 1820 may be a downlink. The same may be applied to the relay apparatus as a receiving subject or an uplink transmitting subject.
  • Embodiments of the present invention described above may be implemented through various means. For example, embodiments of the present invention may be implemented by hardware, firmware, software, or a combination thereof.
  • the method according to embodiments of the present invention may include one or more ASICs (Applicat Specific Specific Circuits), DSPs CDigital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), PLDs (Pr ogr ammab 1 e Logic Devices), FPGAs (Field Programmable Gate Arrays), processors, controllers, microcontrollers, microprocessors, and the like.
  • ASICs Applicat Specific Specific Circuits
  • DSPs CDigital Signal Processors
  • DSPDs Digital Signal Processing Devices
  • PLDs Pr ogr ammab 1 e Logic Devices
  • FPGAs Field Programmable Gate Arrays
  • processors controllers, microcontrollers, microprocessors, and the like.
  • the method according to the embodiments of the present invention may be implemented in the form of modules, procedures, or functions for performing the functions or operations described above.
  • the software code may be stored in a memory unit and driven by a processor.
  • the memory unit may be located inside or outside the processor, and may exchange data with the processor by various known means.
  • Embodiments of the present invention as described above may be applied to various mobile communication systems.

Landscapes

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

Abstract

La présente invention concerne un système de communication sans fil, et plus particulièrement, un procédé de réception d'informations de commande par un terminal dans un système de communication sans fil. Ledit procédé consiste à : déterminer un espace de recherche formé de canaux PDCCH (canaux de contrôle physique de liaison descendante) candidats dans une sous-trame d'une station de base ; et tenter de décoder chacun des canaux PDCCH candidats dans l'espace de recherche. L'espace de recherche dans lequel la tentative de décodage est effectuée est déterminé par des facteurs comprenant un niveau défini correspondant à un certain nombre d'éléments de canaux de contrôle (CCE) compris dans chacun des canaux PDCCH candidats et un certain nombre des canaux PDCCH candidats selon le niveau défini et un décalage prédéterminé.
PCT/KR2012/001253 2011-06-29 2012-02-20 Procédé et appareil pour transmettre et recevoir des informations de commande de liaison descendante dans un système de communication sans fil WO2013002471A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201161502342P 2011-06-29 2011-06-29
US61/502,342 2011-06-29

Publications (1)

Publication Number Publication Date
WO2013002471A1 true WO2013002471A1 (fr) 2013-01-03

Family

ID=47424339

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2012/001253 WO2013002471A1 (fr) 2011-06-29 2012-02-20 Procédé et appareil pour transmettre et recevoir des informations de commande de liaison descendante dans un système de communication sans fil

Country Status (1)

Country Link
WO (1) WO2013002471A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107409381A (zh) * 2014-11-07 2017-11-28 上海诺基亚贝尔股份有限公司 通过指示数据传输的终止点来辅助第一载波上的数据传输的方法
CN110225591A (zh) * 2013-03-28 2019-09-10 三星电子株式会社 Tdd通信中用于上行链路-下行链路配置的下行链路信令
CN110972269A (zh) * 2018-09-28 2020-04-07 普天信息技术有限公司 一种用户专用搜索空间的偏移配置方法及装置
CN111434068A (zh) * 2017-11-17 2020-07-17 高通股份有限公司 信道估计能力下的搜索空间集散列
US20220224468A1 (en) * 2018-05-11 2022-07-14 Qualcomm Incorporated Search space design with overbooking in carrier aggregation

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20090089770A (ko) * 2008-02-19 2009-08-24 엘지전자 주식회사 Ｐｄｃｃｈ를 통한 제어 정보 송수신 방법
KR20100084683A (ko) * 2007-10-30 2010-07-27 콸콤 인코포레이티드 이동 통신에서 ｐｄｃｃｈ 블라인드 디코딩을 위한 방법들 및 시스템들

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100084683A (ko) * 2007-10-30 2010-07-27 콸콤 인코포레이티드 이동 통신에서 ｐｄｃｃｈ 블라인드 디코딩을 위한 방법들 및 시스템들
KR20090089770A (ko) * 2008-02-19 2009-08-24 엘지전자 주식회사 Ｐｄｃｃｈ를 통한 제어 정보 송수신 방법

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer procedures (Release 10).", 3GPP TS 36.213 V10.2.0, 22 June 2011 (2011-06-22), Retrieved from the Internet <URL:http://www.3gpp.org/ftp/Specs/html-info/36213.htm> [retrieved on 20120906] *
CHO, B.-Y. ET AL.: "3G Evolution: LTE for Mobile Broadband.", ELSEVIER KOREA L.L.C., TRANSLATED EDITION, 10 April 2010 (2010-04-10), KOREA L.L.C. *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110225591A (zh) * 2013-03-28 2019-09-10 三星电子株式会社 Tdd通信中用于上行链路-下行链路配置的下行链路信令
CN107409381A (zh) * 2014-11-07 2017-11-28 上海诺基亚贝尔股份有限公司 通过指示数据传输的终止点来辅助第一载波上的数据传输的方法
CN111434068A (zh) * 2017-11-17 2020-07-17 高通股份有限公司 信道估计能力下的搜索空间集散列
CN111434068B (zh) * 2017-11-17 2023-05-09 高通股份有限公司 信道估计能力下的搜索空间集散列
US20220224468A1 (en) * 2018-05-11 2022-07-14 Qualcomm Incorporated Search space design with overbooking in carrier aggregation
US11677520B2 (en) * 2018-05-11 2023-06-13 Qualcomm Incorporated Search space design with overbooking in carrier aggregation
CN110972269A (zh) * 2018-09-28 2020-04-07 普天信息技术有限公司 一种用户专用搜索空间的偏移配置方法及装置

Similar Documents

Publication Publication Date Title
JP6456471B2 (ja) 非兔許帯域を支援する無線接続システムにおいて伝送機会区間を設定する方法及び装置
JP6781152B2 (ja) 無線通信システムにおけるデータ送受信方法及びそのための装置
US9730240B2 (en) Communication method considering carrier type and apparatus for same
EP2824848B1 (fr) Procédé et appareil de transmission/réception d&#39;informations de commande pour une communication de dispositif à dispositif (d2d) dans un système de communication sans fil
JP6039652B2 (ja) キャリアアグリゲーションを支援する無線接続システムにおいて伝送タイミングを調整する方法及び装置
KR102031094B1 (ko) 무선 통신 시스템에서 무선 자원의 동적 할당 방법 및 이를 위한 장치
JP7309625B2 (ja) 無線通信システムにおいて無線信号の送受信方法及び装置
WO2016006859A1 (fr) Procédé et dispositif pour émettre et recevoir un signal de dispositif à dispositif (d2d) par un terminal de relais dans un système d&#39;accès sans fil prenant en charge une communication de dispositif à dispositif
WO2014112841A1 (fr) Procédé et appareil pour effectuer une quasi-colocalisation dans un système d&#39;accès sans fil
JP6321851B2 (ja) 無線通信システムにおいて制御情報受信方法及び装置
KR20140109896A (ko) 무선통신시스템에서 제어정보 전송/획득 방법 및 장치
WO2015199490A1 (fr) Procédé et dispositif de transmission à relais efficace dans un système d&#39;accès sans fil prenant en charge une communication de dispositif à dispositif
KR101812174B1 (ko) 다중 반송파를 사용하는 무선 통신 시스템에서 제어 정보 전송 방법
WO2013015629A2 (fr) Procédé et appareil permettant de transmettre des informations de commande dans un système de communication sans fil
WO2014003328A1 (fr) Procédé et appareil d&#39;émission et de réception de signaux pour communication de dispositif à dispositif dans des systèmes de communication sans fil
WO2013012284A2 (fr) Procédé et appareil d&#39;émission-réception de signaux dans un système de communication sans fil
WO2013100645A1 (fr) Procédé et dispositif de réception de données dans un système de communication sans fil
KR20150046029A (ko) 무선 통신 시스템에서 하향링크 신호 수신 방법 및 장치
WO2013122434A1 (fr) Procédé et appareil permettant d&#39;émettre des accusés de réception dans des systèmes de communication sans fil
WO2013069955A1 (fr) Procédé et appareil d&#39;acquisition d&#39;informations de commande dans système de communication sans fil
WO2013055092A2 (fr) Procédé et appareil pour émettre/recevoir des informations de commande dans un système de communication sans fil
WO2015163707A1 (fr) Procédé et dispositif d&#39;émission et de réception de données dans un système d&#39;accès sans fil prenant en charge une bande sans licence
WO2013048108A2 (fr) Procédé et dispositif d&#39;acquisition d&#39;informations de contrôle dans un système de communication sans fil
WO2013176501A1 (fr) Procédé pour recevoir un canal de commande de liaison descendante au moyen d&#39;un terminal dans un système de communication sans fil et appareil associé
KR20160085752A (ko) 무선 통신 시스템에서 하향링크 신호 송수신 방법 및 이를 위한 장치

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: 12804317

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12804317

Country of ref document: EP

Kind code of ref document: A1