[go: up one dir, main page]

WO2013030793A2 - Perfectionnements relatifs à des espaces de recherche de canal de commande améliorés - Google Patents

Perfectionnements relatifs à des espaces de recherche de canal de commande améliorés Download PDF

Info

Publication number
WO2013030793A2
WO2013030793A2 PCT/IB2012/054487 IB2012054487W WO2013030793A2 WO 2013030793 A2 WO2013030793 A2 WO 2013030793A2 IB 2012054487 W IB2012054487 W IB 2012054487W WO 2013030793 A2 WO2013030793 A2 WO 2013030793A2
Authority
WO
WIPO (PCT)
Prior art keywords
search space
space locations
locations
subset
control channel
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/IB2012/054487
Other languages
English (en)
Other versions
WO2013030793A3 (fr
Inventor
Tommi Koivisto
Timo Roman
Mihai Enescu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Renesas Electronics Corp
Original Assignee
Renesas Mobile Corp
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 US13/224,825 external-priority patent/US20130058285A1/en
Priority claimed from GB1115197.4A external-priority patent/GB2494394B/en
Application filed by Renesas Mobile Corp filed Critical Renesas Mobile Corp
Publication of WO2013030793A2 publication Critical patent/WO2013030793A2/fr
Publication of WO2013030793A3 publication Critical patent/WO2013030793A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
    • H04L1/0038—Blind format detection
    • 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
    • H04L1/0046—Code rate detection or code type detection
    • 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 signalling, i.e. of overhead other than pilot signals

Definitions

  • the present application relates generally to an apparatus and method and a computer program product for spatial hashing for enhanced control channel search spaces.
  • LTE Long Term Evolution
  • One ongoing Study Item relates to downlink MIMO enhancements, one topic of which is downlink control signaling enhancements.
  • Current downlink control signaling is based on common reference signals which are not precoded and are broadcast all over the cell.
  • transmit diversity is applied, for example, space-frequency block coding (SFBC) in case of 2 Tx and space-frequency block coding frequency- switched transmit diversity (SFBC-FSTD) in case of 4 Tx.
  • SFBC space-frequency block coding
  • SFBC-FSTD space-frequency block coding frequency- switched transmit diversity
  • the mapping of the control channels to resource elements (REs) is fixed and based on cell ID.
  • the current Study Item aims at enhancing downlink control channels, like the physical downlink control channel (PDCCH) or the physical hybrid- ARQ indicator channel (PHICH) in terms of capacity (spectral efficiency) by means of more advanced multi-antenna techniques, e.g. closed-loop single-user multiple input multiple output (SU-MIMO) or multi-user (MU-) MIMO or even Coordinated multi-point (CoMP) transmission.
  • PDCCH physical downlink control channel
  • PHICH physical hybrid- ARQ indicator channel
  • SU-MIMO single-user multiple input multiple output
  • MU- multi-user
  • CoMP Coordinated multi-point
  • the enhanced PDCCH (ePDCCH) is assumed in the description hereafter to be based on UE-specific (UE-RS) reference signals (RS), which can be seen as ePDCCH specific RS in case each ePDCCH is transmitted using rank 1 transmission.
  • UE-RS UE-specific reference signals
  • UE-specific RS can be in the form of currently existing Demodulation-RS (DM-RS), which have been specified during Release 9 and Release 10 or one may also envision a new type of UE-specific RS dedicated to ePDCCH demodulation with its own orthogonal port multiplexing scheme, RE mapping, sequence generation, etc.
  • DM-RS Demodulation-RS
  • Release 9/10 DM-RS have an overhead of 12 REs for ranks 1 and 2 and 24 REs for ranks 3-8.
  • Separate precoded UE-specific reference signals are transmitted on each spatial layer, and UE demodulation is based on these reference signals as they allow the UE to estimate the precoded transmission channel.
  • the UE has no prior knowledge of the resource mapping before starting to decode ePDCCH.
  • the ePDCCH may be link-adapted so the UE does not know the coding rate either.
  • the used modulation is QPSK; however, the modulation could become one additional unknown variable for ePDCCH as higher-order modulations may be considered in order to improve the spectral efficiency.
  • the used downlink control information (DCI) format is obviously unknown to the UE prior to decoding - in particular the length of the DCI format that is needed for channel decoding.
  • the UE will not know which spatial layer is assigned to, i.e. which UE-specific RS port is/are associated to, its ePDCCH transmission. So, again one more unknown variable is brought into the decoding process.
  • the concept of blind decoding is utilized to overcome the above- mentioned issues. It means that the UE performs several blind attempts to decode PDCCH with different assumptions about the coding rate, resource mapping and length of the DCI format. When the cyclic redundancy check (CRC) is successful, the UE can assume that it has successfully decoded PDCCH and that the corresponding hypotheses on the coding rate (i.e. number of CCEs), resource mapping and length of the DCI format (i.e. DCI format payload size) are then valid.
  • CRC cyclic redundancy check
  • CCEs control channel elements
  • PDCCH REs are first de-mapped at the UE in the form of a list of consecutive CCEs.
  • the UE attempts to decode a number of DCI formats of pre-defined sizes from either 1, 2, 4 or 8 aggregated CCEs. In other words when attempting to decode, the UE assumes that each DCI format of pre-defined size is mapped to ⁇ 1,2,4, 8 ⁇ x36 resource elements, essentially implying the used coding rate.
  • This number of CCEs ⁇ 1,2,4,8 ⁇ is called aggregation level.
  • aggregation level there are multiple locations from which the UE searches for the DCI format within the list of received CCEs.
  • the set of all locations that the UE will need to search through is called the PDCCH search space.
  • the search space is divided into a common search space (typically used for system information scheduling) and a UE-specific search space (typically used for scheduling PDSCH or for UL grants).
  • Figure 1 shows an illustration of the Release 8 PDCCH CCE aggregation tree and the hashing function changing the search space from subframe to subframe.
  • Rel-8 PDCCH The structure of Rel-8 PDCCH is illustrated in the example of Figure 1 where the full PDCCH resource space consists of altogether 16 CCEs. With 16 CCEs, at aggregation levels ⁇ 1,2,4,8 ⁇ there are ⁇ 16,8,4,2 ⁇ possible search space locations altogether respectively, organized in a tree structure as illustrated in the figure.
  • the search space of a single UE cannot span the full CCE space as this would mean a prohibitively high number of blind decoding attempts for the UE.
  • the PDCCH search space for a given UE consists only of certain predefined starting locations at each aggregation level - in this example there are ⁇ 3,3,1,1 ⁇ locations on aggregation levels ⁇ 1,2,4,8 ⁇ respectively, i.e. the full search space size is then 8 locations from which the UE needs to search for the PDCCH.
  • the search space concept means that the eNB can only schedule PDCCH for the UE in these search space locations.
  • the PDCCH scheduling is restricted.
  • Such an event is called blocking, and there is a desire to minimize the probability of blocking events.
  • UEs scheduled on high aggregation levels present particular problems when it comes to blocking.
  • the set of PDCCH candidates to monitor are defined in terms of search spaces, where a search space k at aggregation level e is defined by a set of PDCCH candidates.
  • the UE shall monitor one common search space at each of the aggregation levels 4 and 8 and one UE-specific search space at each of the aggregation levels 1, 2, 4, 8.
  • the common and UE-specific search spaces may overlap.
  • variable * is defined by
  • Y k (A - Y k - l )modD
  • F -i n «TM ⁇ 0
  • A 39827 ?
  • D 65537
  • the RNTI value used for RNTI is defined in the aforementioned document 3 GPP, TS 36.213 V9.3.0 (September 2010); 3 rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer procedures (Release 9).
  • the spatial domain with multiple spatial layers and associated UE-specific RS bring yet another dimension into the blind decoding process.
  • the UE should not be required to estimate channels from an excessive number of different UE-specific RS ports, but also on the other hand the scheduling should not be restricted too much by fixing the UE-specific RS port for PDCCH demodulation as such restrictions are well-known to degrade MU- MIMO performance by restricting multi-user diversity because of restrictions in UE pairing, and furthermore the same blocking problem would arise again.
  • the problem addressed by the present invention is that of alleviating blocking and giving the eNB more scheduling freedom in scheduling PDCCHs when multiple spatial layers are utilized.
  • the present invention refers to control signaling enhancements for LTE.
  • Embodiments of the invention provide an apparatus and method and a computer program product for spatial hashing for enhanced control channel search spaces.
  • a method of searching for channel candidates comprising:
  • search space locations within the control channel search space grouping the search space locations into a plurality of subsets of search space locations
  • a method of searching for channel candidates comprising:
  • search space locations within the control channel search space grouping the search space locations into N subsets of search space locations, wherein N is the number of antenna ports,
  • an apparatus for use in searching for channel candidates comprising a processing system, which may be embodied as at least one processor and at least one memory including computer program code, wherein the processing system is arranged to cause the apparatus to:
  • control channel search space for searching for control channel candidates
  • search space locations within the control channel search space, group the search space locations into a plurality of subsets of search space locations,
  • an apparatus for use in searching for channel candidates comprising a processing system, which may be embodied as at least one processor and at least one memory including computer program code, wherein the processing system is arranged to cause the apparatus to: define a control channel search space for searching for control channel candidates,
  • search space locations within the control channel search space group the search space locations into N subsets of search space locations, wherein N is the number of antenna ports,
  • search space locations are grouped into subsets
  • each subset of search space locations is associated with an antenna port, and for each of a plurality of subframes, the search space locations are changed from a first subset of search space locations to a second subset of search space locations.
  • the search space locations are grouped into N subsets of search space locations, wherein N is the number of antenna ports, each of the N subsets of search space locations is associated with one of the N antenna ports,
  • the search space locations are changed from a first subset of search space locations to a second subset of search space locations at every N subframe.
  • an apparatus comprising a processing system, which may be embodied as at least one processor and at least one memory including computer program code, wherein the processing system is arranged to cause the apparatus to:
  • control channel search space for scheduling control channel candidates, define search space locations within the control channel search space, schedule one or a plurality of control channels in the defined search space locations, wherein
  • the search space locations are grouped into a plurality subsets
  • each subset of search space locations is associated with an antenna port, and for each of a plurality of subframes, the search space locations are changedfrom a first subset of search space locations to a second subset of search space locations.
  • an apparatus comprising a processing system, which may be embodied as at least one processor and at least one memory including computer program code, wherein the processing system is arranged to cause the apparatus to:
  • control channel search space for scheduling control channel candidates, define search space locations within the control channel search space, schedule one or a plurality of control channels in the defined search space locations, wherein
  • search space locations are grouped into N subsetsof search space locations, wherein N is the number of antenna ports,
  • each of the N subsets of search space locations is associated with one of the N antenna ports
  • the association between each of the N subsets and said antenna port for each of the N subframes is alternated, and the search space locations are changed from a first subset of search space locations to a second subset of search space locations at every N subframe.
  • Fig. 1 shows an illustration of the Release 8 -type of PDCCH CCE aggregation tree and the hashing function changing the search space from subframe to subframe.
  • Fig. 2 shows an example of a tree-structure based spatial hashing according to a first embodiment of the present invention.
  • Fig. 3 shows an illustration of space-time hashing according to a second embodiment of the present invention.
  • Fig. 4 shows an example of independent hashing for each RS port according to a third embodiment of the present invention.
  • Fig. 5 shows an example of independent hashing for each RS port with reduced search space according to a fourth embodiment of the present invention.
  • Fig. 6 shows a configuration of an example for an apparatus according to certain embodiments of the present invention.
  • Fig. 7 shows a flowchart of an example for a method according to certain embodiments of the present invention.
  • Fig. 8 shows a flowchart of another example for a method according to certain embodiments of the present invention.
  • Fig. 9 shows a configuration of an example for another apparatus according to certain embodiments of the present invention.
  • Fig. 10 shows a flowchart of an example for another method according to certain embodiments of the present invention.
  • Fig. 11 shows a flowchart of another example for another method according to certain embodiments of the present invention. Detailed Description
  • a spatial component is added to the PDCCH hashing function. This provides randomization of the PDCCH search space in the spatial domain, and hence reduces blocking since it becomes unlikely that UEs that are spatially compatible (such that they can be paired in multiuser MIMO sense) would be allocated the same UE-specific RS port (and scrambling ID) in consecutive subframes. Hence the PDCCH scheduling with MU-MIMO will not be blocked in all subframes due to RS allocation. In other words, the spatial domain offers another dimension for ePDCCH multiplexing which allows increasing its capacity and reducing blocking.
  • the dedicated RS port that UE will be searching through in the PDCCH blind decoding process will depend on the CCE and subframe numbers.
  • the blind decoding process amounts to decoding control channel candidates under certain hypotheses on the coding rate, resource mapping, length of the DCI format, and, according to the present invention, the UE-specific antenna port.
  • the UE can assume that it has successfully decoded PDCCH and that the corresponding hypotheses are valid.
  • Fig. 1 illustrates the principle of the usual single RS port hashing function, as described above.
  • the spatial hashing is configured such that for each CCE the UE only needs to estimate channels from one DM-RS port. This is achieved such that the search space locations corresponding to each DM-RS port are fully non- overlapping.
  • the CCEs in the second half are decoded based on antenna port 7 and CCEs in the first half of the overall CCE space are decoded based on antenna port 8.
  • the benefit of the method is reduced channel estimation complexity while both ports 7 and 8 are enabled at least in some part of the search space allowing flexibility for scheduling ePDCCH in MU-MIMO over orthogonal DM-RS ports.
  • the overall search space locations are changed only every N subframes in case N DM-RS ports are in use. Then, within the N subframes, the search space locations are alternated between the N DM-RS ports.
  • the overall search space is split into N subsets, and in each of the N subframes each DM-RS port is associated with a different subset of the search space locations. It is noted that the subsets are fully non-overlapping (or disjoint), as described above. However, alternatively, it is also possible that the subsets are partially overlapping (or not disjoint).
  • the full search space is divided into two subsets.
  • antenna port 7 is associated with the first subset and antenna port 8 with the second subset, and in subframe n+1 the association is vice versa.
  • a simplification of the method as described in the third embodiment is provided, which reduces the search space size associated with each DM- RS port. This can be done such that the overall search space size still remains the same compared to the baseline case of Fig. 1, e.g. in the embodiment shown in Fig. 5 the overall search space sizes on aggregation levels ⁇ 1 ,2,4,8 ⁇ are still ⁇ 3,3,1,1 ⁇ , respectively.
  • the amount of blind decodings at the UE is kept under control.
  • the hashing function is configured such that both the eNB and the UE have in each subframe a common understanding about the search space associated with each DM-RS port.
  • the eNB selects a suitable search space location where to schedule the ePDCCH for the UE. This involves at least:
  • the UE when receiving ePDCCH, the UE attempts to decode ePDCCH from each search space location. It is to be noted that:
  • the specified hashing function gives the information about which search space locations the UE will need to try with each DM-RS port for channel estimation for ePDCCH demodulation in a given subframe.
  • DM-RS port allocation is made dynamic. At the same time blocking probability is kept low.
  • Fig. 6 shows a principle configuration of an example for an apparatus according to certain embodiments of the present invention.
  • One option for implementing this example for an apparatus according to certain embodiments of the present invention would be a component in a handset such as user equipment UE according to LTE.
  • the example for an apparatus 10 comprises at least one processor 11, and at least one memory 12 including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform defining a control channel search space for searching for control channel candidates, defining search space locations within the search space, grouping the search space locations into a plurality of subsets of search space locations, associating each subset of search space locations with an antenna port, for each of a plurality of subframes, changing the search space locations from a first subset of search space locations to a second subset of search space locations.
  • the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to perform defining a control channel search space for searching for control channel candidates, defining search space locations within the search space, grouping the search space locations into N subsets of search space locations, wherein N is the number of antenna ports, associating each of the N subsets of search space locations with one of the N antenna ports, alternating the association between each of the N subsets and said antenna port for each of the N subframes, changing the search space locations from a first subset of search space locations to a second subset of search space locations at every N subframe.
  • Fig. 7 shows a principle flowchart of an example for a method according to certain embodiments of the present invention. That is, as shown in Fig. 7, this method comprises defining, at step S21 , a control channel search space for searching for control channel candidates, defining, at step S22, search space locations within the search space, grouping, at step S23, the search space locations into a plurality of subsets of search space locations, associating, at step S24, each subset of search space locations with an antenna port, and for each of a plurality of subframes, changing, at step S25, the search space locations from a first subset of search space locations to a second subset of search space locations.
  • Fig. 7 shows a principle flowchart of an example for a method according to certain embodiments of the present invention. That is, as shown in Fig. 7, this method comprises defining, at step S21 , a control channel search space for searching for control channel candidates, defining, at step S22, search space locations within the search space, grouping
  • this method comprises defining, at step S31 , a control channel search space for searching for control channel candidates, defining, at step S32, search space locations within the search space, grouping, at step S33, the search space locations into N subsets of search space locations, wherein N is the number of antenna ports, associating, at step S34, each of the N subsets of search space locations with one of the N antenna ports, alternating, at step S35, the association between each of the N subsets and said antenna port for each of the N subframes, and changing, at step S36, the search space location from a first subset of search space locations to a second subset of search space locations at every N subframes.
  • One option for performing the example of a method according to certain embodiments of the present invention would be to use the apparatus as described above or a modification thereof which becomes apparent from the embodiments as described above.
  • Fig. 9 shows another principle configuration of an example for an apparatus according to certain embodiments of the present invention.
  • One option for implementing this example for an apparatus according to certain embodiments of the present invention would be a component in a base station such as an eNB according to LTE.
  • the example for an apparatus 40 comprises at least one processor 41, and at least one memory 42 including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform defining a control channel search space for scheduling control channels, defining search space locations within the search space, scheduling one or a plurality of control channels in the defined search space locations, wherein the search space locations are grouped into a plurality subsets, each subset of search space locations is associated with an antenna port, and for each of a plurality of subframes, the search space locations are changed from a first subset of search space locations to a second subset of search space locations.
  • the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to defining a control channel search space for scheduling control channels, defining search space locations within the search space, scheduling one or a plurality of control channels in the defined search space locations, wherein the search space locations are grouped into N subsets of search space locations, wherein N is the number of antenna ports, each of the N subsets of search space locations is associated with one of the N antenna ports, the association between each of the N subsets and said antenna port for each of the N subframes is alternated, the search space locations are changed from a first subset of search space locations to a second subset of search space locations at every N sub frame.
  • Fig. 10 shows a principle flowchart of an example for a method according to certain embodiments of the present invention. That is, as shown in Fig. 10, this method comprises defining, at step S51, a control channel search space for scheduling control channels, defining, at step S52, search space locations within the search space, and scheduling, at step S53, one or a plurality of control channels in the defined search space locations, wherein the search space is grouped into subsets, each subset of search space locations is associated with an antenna port, and for each of a plurality of subframes, the search space locations are changed from a first subset of search space locations to a second subset of search space locations.
  • Fig. 11 shows a principle flowchart of another example for a method according to certain embodiments of the present invention. That is, as shown in Fig. 11, this method comprises defining, at step S61, a control channel search space for scheduling control channels, defining, at step S62, search space locations within the search space, and scheduling, at step S63, one or a plurality of control channels in the defined search space locations, wherein the search space locations are grouped into N subsets of search space locations, wherein N is the number of antenna ports, each of the N subsets of search space locations is associated with one of the N antenna ports, the association between each of the N subsets of search space locations and said antenna port for each of the N subframes is alternated, and the search space locations are changed from a first subset of search space locations to a second subset of search space locations.
  • One option for performing the example of a method according to certain embodiments of the present invention would be to use the apparatus as described above or a modification thereof which becomes apparent from the embodiments as described above.
  • the search space locations corresponding to each antenna port are partially overlapping or fully non- overlapping.
  • any method step is suitable to be implemented as software or by hardware without changing the idea of the embodiments and its modification in terms of the functionality implemented;
  • - method steps and/or devices, units or means likely to be implemented as hardware components at the above-defined apparatuses, or any module(s) thereof, are hardware independent and can be implemented using any known or future developed hardware technology or any hybrids of these, such as MOS (Metal Oxide Semiconductor), CMOS (Complementary MOS), BiMOS (Bipolar MOS), BiCMOS (Bipolar CMOS), ECL (Emitter Coupled Logic), TTL (Transistor-Transistor Logic), etc., using for example ASIC (Application Specific IC (Integrated Circuit)) components, FPGA (Field-programmable Gate Arrays) components, CPLD (Complex Programmable Logic Device) components or DSP (Digital Signal Processor) components; - devices, units or means (e.g.
  • MOS Metal Oxide Semiconductor
  • CMOS Complementary MOS
  • BiMOS Bipolar MOS
  • BiCMOS BiCMOS
  • ECL emitter Coupled Logic
  • TTL Trans
  • the above-defined apparatuses and user equipments, or any one of their respective units/means can be implemented as individual devices, units or means, but this does not exclude that they are implemented in a distributed fashion throughout the system, as long as the functionality of the device, unit or means is preserved;
  • an apparatus may be represented by a semiconductor chip, a chipset, or a (hardware) module comprising such chip or chipset; this, however, does not exclude the possibility that a functionality of an apparatus or module, instead of being hardware implemented, be implemented as software in a (software) module such as a computer program or a computer program product comprising executable software code portions for execution/being run on a processor;
  • a device may be regarded as an apparatus or as an assembly of more than one apparatus, whether functionally in cooperation with each other or functionally independently of each other but in a same device housing, for example.
  • respective functional blocks or elements according to above-described aspects can be implemented by any known means, either in hardware and/or software, respectively, if it is only adapted to perform the described functions of the respective parts.
  • the mentioned method steps can be realized in individual functional blocks or by individual devices, or one or more of the method steps can be realized in a single functional block or by a single device.
  • any method step is suitable to be implemented as software or by hardware without changing the idea of the present invention.
  • Devices and means can be implemented as individual devices, but this does not exclude that they are implemented in a distributed fashion throughout the system, as long as the functionality of the device is preserved. Such and similar principles are to be considered as known to a skilled person.
  • Software in the sense of the present description comprises software code as such comprising code means or portions or a computer program or a computer program product for performing the respective functions, as well as software (or a computer program or a computer program product) embodied on a tangible medium such as a computer-readable (storage) medium having stored thereon a respective data structure or code means/portions or embodied in a signal or in a chip, potentially during processing thereof.

Landscapes

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

Abstract

La présente invention concerne un procédé, un appareil et un produit programme d'ordinateur pour un hachage spatial pour des espaces de recherche de canal de commande améliorés. La présente invention consiste à définir un espace de recherche de canal de commande pour rechercher des canaux de commande candidats, à définir des emplacements d'espace de recherche à l'intérieur de l'espace de recherche, à grouper les emplacements d'espace de recherche en une pluralité de sous-ensembles d'emplacements d'espace de recherche, à associer chaque sous-ensemble d'emplacements d'espace de recherche à un port d'antenne, pour chacune d'une pluralité de sous-trames, à changer les emplacements d'espace de recherche d'un premier sous-ensemble d'emplacements d'espace de recherche à un second sous-ensemble d'emplacements d'espace de recherche.
PCT/IB2012/054487 2011-09-02 2012-08-31 Perfectionnements relatifs à des espaces de recherche de canal de commande améliorés Ceased WO2013030793A2 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US13/224,825 US20130058285A1 (en) 2011-09-02 2011-09-02 Spatial hashing for enhanced control channel search spaces
GB1115197.4 2011-09-02
US13/224,825 2011-09-02
GB1115197.4A GB2494394B (en) 2011-09-02 2011-09-02 Improvements relating to enhanced control channel search spaces

Publications (2)

Publication Number Publication Date
WO2013030793A2 true WO2013030793A2 (fr) 2013-03-07
WO2013030793A3 WO2013030793A3 (fr) 2013-06-27

Family

ID=47137986

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2012/054487 Ceased WO2013030793A2 (fr) 2011-09-02 2012-08-31 Perfectionnements relatifs à des espaces de recherche de canal de commande améliorés

Country Status (1)

Country Link
WO (1) WO2013030793A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013116128A1 (fr) * 2012-01-30 2013-08-08 Alcatel Lucent Procédés d'émission et de réception d'informations de commande

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110038994A (ko) * 2009-10-09 2011-04-15 삼성전자주식회사 다중 안테나를 이용하는 무선 통신 시스템에서 다중 사용자 제어 채널 송수신 방법 및 장치

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013116128A1 (fr) * 2012-01-30 2013-08-08 Alcatel Lucent Procédés d'émission et de réception d'informations de commande
US9571241B2 (en) 2012-01-30 2017-02-14 Alcatel Lucent Methods for transmitting and receiving control information using time-frequency resources of decoding candidates

Also Published As

Publication number Publication date
WO2013030793A3 (fr) 2013-06-27

Similar Documents

Publication Publication Date Title
US20130058285A1 (en) Spatial hashing for enhanced control channel search spaces
KR101709024B1 (ko) 기지국 장치, 이동국 장치, 통신 방법 및 집적 회로
US9345013B2 (en) Method and apparatus for enhanced control channel-based operation in wireless communication system
US9510338B2 (en) Data transmission method and data transmission device
EP2827668B1 (fr) Station de base, terminaux, système de communication, procédé de communication et circuit intégré
JP5884152B2 (ja) 基地局、端末、通信システムおよび通信方法
JP6143153B2 (ja) 基地局、端末、通信方法および集積回路
US9510337B2 (en) Base station apparatus, terminal apparatus, communication method, integrated circuit, and communication system
WO2014148318A1 (fr) Station de base, terminal, système de communication, procédé de communication, et circuit intégré
WO2014142122A1 (fr) Station de base, terminal, système de communication, procédé de communication et circuit intégré
US10660078B2 (en) Control information sending method and receiving method, sender and receiver
WO2014141920A1 (fr) Station de base, terminal, système de communication, procédé de communication et circuit intégré
JP5810399B2 (ja) 基地局、端末および無線通信方法
CN105792373B (zh) 一种干扰信息指示方法、干扰抑制方法及装置
JP2012231373A (ja) 基地局、端末、通信システムおよび通信方法
JP2014033327A (ja) 基地局、端末、通信システム、通信方法および集積回路
WO2013030793A2 (fr) Perfectionnements relatifs à des espaces de recherche de canal de commande améliorés
WO2016188177A1 (fr) Procédé et appareil pour envoyer un canal de commande de liaison descendante physique amélioré
GB2494394A (en) Spatial hashing for enhanced control channel search spaces
JP2014023018A (ja) 基地局、端末、通信システム、通信方法および集積回路

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

Country of ref document: EP

Kind code of ref document: A2

122 Ep: pct application non-entry in european phase

Ref document number: 12781161

Country of ref document: EP

Kind code of ref document: A2