WO2019192018A1 - Procédé et système de sélection de canal de commande de liaison descendante physique candidat - Google Patents

Procédé et système de sélection de canal de commande de liaison descendante physique candidat Download PDF

Info

Publication number
WO2019192018A1
WO2019192018A1 PCT/CN2018/082094 CN2018082094W WO2019192018A1 WO 2019192018 A1 WO2019192018 A1 WO 2019192018A1 CN 2018082094 W CN2018082094 W CN 2018082094W WO 2019192018 A1 WO2019192018 A1 WO 2019192018A1
Authority
WO
WIPO (PCT)
Prior art keywords
search space
resources
space set
aggregation level
pdcch candidates
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/CN2018/082094
Other languages
English (en)
Inventor
Haigang HE
Peng Hao
Zhisong Zuo
Feng Bi
Chenchen Zhang
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.)
ZTE Corp
Original Assignee
ZTE 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
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to EP18913949.6A priority Critical patent/EP3777417A4/fr
Priority to PCT/CN2018/082094 priority patent/WO2019192018A1/fr
Priority to CN201880091487.5A priority patent/CN111869300B/zh
Publication of WO2019192018A1 publication Critical patent/WO2019192018A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0064—Rate requirement of the data, e.g. scalable bandwidth, data priority
    • 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
    • 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) or DMT
    • H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A) or DMT the frequencies being arranged in component carriers
    • 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
    • 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/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • 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/0032—Distributed allocation, i.e. involving a plurality of allocating devices, each making partial allocation
    • 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/0078—Timing of allocation
    • H04L5/0087—Timing of allocation when data requirements change
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signalling for the administration of the divided path, e.g. signalling of configuration information

Definitions

  • This document generally relates to wireless communications.
  • Wireless communication technologies are moving the world toward an increasingly connected and networked society.
  • the rapid growth of wireless communications and advances in technology has led to greater demand for capacity and connectivity.
  • Other aspects, such as energy consumption, device cost, spectral efficiency, and latency are also important to meeting the needs of various communication scenarios.
  • next generation systems and wireless communication techniques need to provide the reliable communication of control information to support enhanced services and applications.
  • This document relates to methods, systems, and devices forphysical downlink control channel (PDCCH) candidate selection.
  • PDCCH physical downlink control channel
  • embodiments are able to perform PDCCH candidate selection by reducing the number of blind detection attempts that have to be performed in current implementations of Long Term Evolution (LTE) and New Radio (NR) devices.
  • LTE Long Term Evolution
  • NR New Radio
  • a wireless communication method includes performing a communication operation in one or more of a first set of resources, where the resources of the first set of resources are selected in a selection order from a second set of resources that is larger than the first set of resources, and where the selection order for the first set of resources is based on at least one of a period of a search space set, a downlink control information (DCI) format of the search space set, a starting symbol of the search space set, a component carrier type, a component carrier index or an occasion index.
  • DCI downlink control information
  • a wireless communication method includes performing a communication operation in one or more of a first set of resources, where a second set of resources includes the first set of resources and a third set of resources, and the resources of the first set of resources are non-overlapping with the resources of the third set of resources, where the resources of the third set of resources are selected in a selection order from the second set of resources, and where the selection order for the third set of resources is based on at least one of a period of a search space set, a downlink control information (DCI) format of the search space set, a starting symbol of the search space set, a component carrier type, a component carrier index or an occasion index.
  • DCI downlink control information
  • the above-described methods are embodied in the form of processor-executable code and stored in a computer-readable program medium.
  • a device that is configured or operable to perform the above-described methods is disclosed.
  • FIG. 1 shows an example of a base station (BS) and user equipment (UE) in wireless communication, in accordance with some embodiments of the presently disclosed technology.
  • BS base station
  • UE user equipment
  • FIG. 2 shows an example of an overloaded search space set.
  • FIGS. 3A and 3B show an example of the organization of PDCCH candidates in search space sets, aggregation levels, occasions and slots.
  • FIG. 4 shows an example calculation of values for priority levels for PDCCH candidate selectionin a single search space set and at a single aggregation level.
  • FIG. 5 shows an example of computed priority levels for PDCCH candidates for multiple search space sets in a single aggregation level.
  • FIG. 6 shows an example procedure for PDCCH candidate selection at a base station.
  • FIG. 7 shows an example procedure for PDCCH candidate selection at a terminal.
  • FIGS. 8A and 8B show an example of PDCCH candidate selection.
  • FIGS. 9A and 9B show another example of PDCCH candidate selection.
  • FIGS. 10A and 10B show yet another example of PDCCH candidate selection.
  • FIG. 11 shows an example of PDCCH candidates with interleaved indexes in a single search space set and at a single aggregation level in one occasion.
  • FIGS. 12A and 12B show an example of computed priority levels for PDCCH candidates for multiple search space sets and multiple aggregation levels.
  • FIGS. 13A and 13B show an example of PDCCH candidate selection based on priority levels.
  • FIG. 14 an example calculation of interleaved values for priority levels for PDCCH candidate selectionin a single search space set and at a single aggregation level.
  • FIGS. 15A and 15B an example of interleaved priority levels for PDCCH candidates for multiple search space sets in multiple aggregation levels.
  • FIGS. 16A and 16B show another example of PDCCH candidate selection based on priority levels.
  • FIG. 17 shows another example of priority levels for PDCCH candidate selection in a single search space set and at a single aggregation level.
  • FIG. 18 shows another example of PDCCH candidate selection based on priority levels.
  • FIG. 19 shows an example of a wireless communication method for PDCCH candidate selection.
  • FIG. 20 is a block diagram representation of a portion of an apparatusthat may implement a method or technique described in this patent document.
  • downlink control information is carried by a Physical Downlink Control Channel (PDCCH) , and in general, the base station selects one PDCCH candidate among multiple PDCCH candidates as the final PDCCH channel.
  • the terminal does not know which among the multiple PDCCH candidates is selected by the base station, e.g. which PDCCH candidate is finally selected to transmit the downlink control information.
  • the terminal needs to try PDCCH demodulation and decoding, one by one, over the multiple PDCCH candidates.
  • FIG. 1 shows an example of a wireless communication system that includes a BS 120 and one or more user equipment (UE) 111, 112 and 113.
  • the BS may transmit DCI over the PDCCH (141, 142, 143) to the UEs, which blindly detect the various PDCCH candidates in order to receive the DCI.
  • the UEs may then transmit information (131, 132, 133) to the BS.
  • the UE may be, for example, a smartphone, a tablet, a mobile computer, a machine to machine (M2M) device, an Internet of Things (IoT) device, and so on.
  • M2M machine to machine
  • IoT Internet of Things
  • the multiple PDCCH candidates are usually distributed at multiple aggregation levels, and each aggregation level usually includes multiple PDCCH candidates.
  • Aggregation level refers to the number of control channel elements (CCEs) that a PDCCH candidate contains. For example, if the aggregation level is 4, then each PDCCH candidate on this aggregation level consists of 4 CCEs.
  • CCE control channel elements
  • a CCE consists of 6 Resource Element Groups (REGs)
  • each REG consists of 12 Resource Elements (REs) .
  • CORESET Control Resource Set
  • search space collection is mainly used to determine the frequency domain range in which the base station transmits the PDCCH and the terminal detects the PDCCH, and the number of symbols occupied by the PDCCH channel.
  • CORESET can also include the following parameters:
  • the search space set is mainly used to determine which aggregation levels the PDCCH channel can use, and the number of PDCCH candidates at a specific aggregation level, as well as information such as PDCCH period and time domain location.
  • Search space collection can contain the following parameters:
  • one base station can transmit control and/or data information to one user equipment in different carriers at the same time, wherein each of these carriers is called a component carrier.
  • one component carrier may include multiple bandwidth parts (BWPs) .
  • BWPs bandwidth parts
  • the base station usually sends control information and/or data information to the user equipment only on one of the these bandwidth part of one component carrier.
  • the BWP that is actually used to send control information and/or data information is called an active BWP.
  • BWPs used for initial access and for future communications may be referred to as initial access and target bandwidth parts, respectively.
  • the maximum number of CORESETs in a BWP may be 3, the maximum number of search space sets in a BWP may be 10, and that there is a searchspace set that corresponds to a CORESET.
  • the PDCCH periods in different search space sets may be different.
  • the total number of PDCCH candidates on the slot will be significantly increased, as will the number of PDCCH blind detections.
  • FIG. 2 shows certain slots that are overloaded since the same slot is being searched by the terminal in search space 1 and search space 2. This results in a significant increase in the number of channel estimation CCEs.
  • the number of PDCCH candidates in each search space and/or the number of CCEs required for channel estimation may exceed the capabilities of the user equipment (UE) support.
  • UE user equipment
  • Embodiments of the disclosed technology provide implementations of a selection order for selecting PDCCH candidates to ensure that the number of PDCCH candidates and/or the number of CCEs that the terminal needs to perform channel estimation do not exceed the capabilities of the UE.
  • Section headings are used in the present document to improve readability of the description and do not in any way limit the discussion or the embodiments to the respective sections only.
  • the number of PDCCH candidates configured by the base station may exceed the UE capability (e.g., 44 PDCCH blind detections) , or the number of CCEs corresponding to the number of PDCCH candidates configured by the base station may exceed the capability of the UE (e.g., the channel estimation of the UE supporting 48 CCEs at most) .
  • the UE capability e.g., 44 PDCCH blind detections
  • the number of CCEs corresponding to the number of PDCCH candidates configured by the base station may exceed the capability of the UE (e.g., the channel estimation of the UE supporting 48 CCEs at most) .
  • the base station and the terminal both discard some PDCCH candidates according to one rule, so that the number of PDCCH candidates that are retained does not exceed the first threshold value, and the number of CCEs corresponding to the retained PDCCH candidates does not exceed the second threshold value.
  • the base station may select one or more PDCCH candidates among the remaining PDCCH candidates for transmitting the PDCCH.
  • the base station and the terminal may re-determine the position of the CCE of the PDCCH candidate in the CCE set corresponding to the reserved PDCCH candidate according to a certain rule. Then, one or more PDCCH candidates are selected from among the excluded PDCCH candidates (PDCCH candidates that were not reserved) for transmitting the downlink control information.
  • the selection order for PDCCH candidates is defined as:
  • the PDCCH candidates are selected in ascending order of the search space set identifiers (or IDs) .
  • PDCCH candidates are selected, as described above, until the first threshold value is exceeded, which may correspond to the maximum capabilities of the terminal or UE.
  • the search space may correspond to two search space sets, as shown in FIGS. 3A and 3B, both in slot n.
  • the configuration of the search space is as follows:
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the order in which PDCCH candidates are selected (or equivalent, “added” ) in a search space set type may be determined.
  • the candidates that are selected from the original set of PDCCH candidates by the base station in a slot are called reserved candidates.
  • the remaining PDCCH candidates, which are not selected, are referred to as excluded PDCCH candidates.
  • the base station may select some or all of the excluded PDCCH candidates, upon determining that some of the excluded PDCCH candidates correspond to CCEs that are in the new Control Channel Element (CCE) set.
  • CCE Control Channel Element
  • the base station selects some or all of the reserved PDCCH candidates, and sends downlink control information to the terminal on one or more physical downlink control channels using the selected reserved PDCCH candidates, or
  • the base station selects some or all of the reserved PDCCH candidates, and selects some or all of the previously excluded PDCCH candidates that correspond to CCEs in the new CCE set, and sends downlink control information to the terminal on one or more physical downlink control channels using the selected reserved PDCCH candidates and the selected previously excluded PDCCH candidates.
  • the order of the PDCCH candidates added (or equivalently, the selection order of the PDCCH candidates) at the aggregation level L of the search space set s may further be based on:
  • the order of the PDCCH candidates added to a certain occasion in the slot n at aggregation level L of the search space set s may further be based on:
  • the selection order of the PDCCH candidates may be based on priority value.
  • the priority for a PDCCH candidate is defined as where is the number of candidates configured for aggregation level L in search space set s, and O s is the number of occasions in the slot for the search space set s. According to this definition, the priority values for PDCCH candidates in a single aggregation level and in two different search space sets is shown in FIG. 5. In an example, the PDCCH candidates may be selected in ascending order of the priority values.
  • PDCCH candidates may be added to multiple occasions on the aggregation level L in the same search space set s. However, this may result in the addition of the PDCCH candidates no longer being continuous with respect to their indexes, since they may be added according to the reordering discussed above.
  • the remaining PDCCH candidates are called excluded PDCCH candidates.
  • the excluded PDCCH candidates may include CCEs that are part of the reserved PDCCH candidates (for example, 48 CCEs) , and thus the CCEs may be re-determined.
  • the CCEs of the excluded PDCCH candidates are reselected using one of the following criteria:
  • the CCE set composed of the reserved PDCCH candidates is divided into a plurality of resources, each including L CCEs, and the UE selects a resource with the least degree of overlap with the CCEs of the excluded PDCCH candidates.
  • the CCE set composed of the reserved PDCCH candidates is divided into a plurality of resources, each including L CCEs, and the UE selects resources with the lowest level of overlap with the CCEs of the excluded PDCCH candidates with other aggregation levels L.
  • the CCE set composed of the reserved PDCCH candidates is divided into a plurality of resources, each including L CCEs, and the UE selects the resource with the greatest PDCCH candidate distance from the aggregation levels L of the excluded PDCCH candidates.
  • the base station selects some or all PDCCH candidates among the reserved PDCCH candidates, selects one or more physical downlink control channel candidates from these PDCCH candidates, and sends downlink control information to the terminal on the one or more selected physical downlink control channels.
  • the base station selects part or all of the reserved PDCCH candidates and the excluded PDCCH candidates, selects one or more physical downlink control channel candidates from these PDCCH candidates, and sends downlink control information to the terminal on the one or more selected physical downlink control channels.
  • Base station side An example method of the process on the base station side in shown in FIG. 6. As shown therein, the base station determines the PDCCH candidate set of slot n according to the configuration of the high layer parameters of the base station (block 610) . For example, the base station may configure a plurality of search space sets, and the configuration parameters of each search space set have the following parameters:
  • the base station determines a physical downlink control channel (PDCCH) candidate set corresponding to the search space sets that the terminal needs to detect on the slot n.
  • PDCCH physical downlink control channel
  • the base station selects reserved PDCCH candidates from the PDCCH candidate set according to a predefined sequence. These number of reserved PDCCH candidates are restricted from exceeding the first threshold value (block 620) .
  • the base station selects reserved PDCCH candidates according to the following predefined sequence:
  • the base station selects some or all of the excluded PDCCH candidates, and re-selects the CCEs for the excluded PDCCH candidates (block 630) .
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and the excluded PDCCH candidates for re-determining the CCEs (block 640) , and sends the downlink control information to the terminal (block 660) .
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates (block 650) and sends downlink control information to the terminal (block 660) .
  • Terminal side An example method of the process on the terminal side in shown in FIG. 7.
  • the terminal determines the PDCCH candidate set of slot n according to the configuration of the high layer parameters of the base station (block 710) .
  • the base station may configure a plurality of search space sets, and the configuration parameters of each search space set may include the following:
  • the terminal determines a physical downlink control channel (PDCCH) candidate set corresponding to the search space sets that the terminal needs to detect on the slot n.
  • PDCCH physical downlink control channel
  • the terminal determines reserved PDCCH candidates from the PDCCH candidate set in a predefined order. These number of reserved PDCCH candidates are restricted from exceeding the first threshold value (block 720) .
  • the terminal selects reserved PDCCH candidates according to the following predefined sequence:
  • the terminal selects some or all of the excluded PDCCH candidates, and re-selects the CCEs for the excluded PDCCH candidates (block 730) .
  • the terminal detects downlink control information carried on one or more PDCCH candidates from among the reserved PDCCH candidates and the excluded PDCCH candidates for re-determining the CCEs (block 740) .
  • the terminal detects DCI among the reserved PDCCH candidates (block 750) .
  • Example Embodiment 1 Multi-occasion; one occasion adds one PDCCH at a time
  • the base station determines the reserved PDCCH candidate set as follows:
  • the base station determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the terminal may have multiple search space sets that require monitoring, and the base station determines a PDCCH candidate set corresponding to these same search space sets.
  • the selection of the reserved PDCCH candidates by the base station according to condition (A) (as specified as part of Method 1 previously in this document) in this embodiment is specifically conducted according to a predefined sequence of the aggregation level L in the search space s, where the number of reserved PDCCH candidates that have been selected does not exceed the threshold value
  • ⁇ is the ratio of the number of channel estimations that can be performed by the terminal to the number of CCEs that are present in the current time slot, indicates an upward rounding
  • O s is the number of occasions in the time slot for the search space set s.
  • O s is the number of PDCCH candidate monitoring times (occasions) in the time slot n of the search space set s, wherein one PDCCH candidate monitoring time includes one or more time domain symbols, and there may be overlapping time domain symbols between different PDCCH candidate monitoring times.
  • the search space set type may be divided into a common search space (CSS) type and a UE-specific search space (USS) type.
  • the search space collection type can be divided into multiple CSS types and one USS type. If one base station can send one DCI to multiple UE through one PDCCH candidate in one search space set, the search space set is called as a common search space (CSS) set. Otherwise, the search space set is called as one UE (user equipment) specific search space (USS) set.
  • one base station can send DCI for the scheduling system information, paging information, information of slot frame format indication, and/or information of TPC (transmitter power control) commands.
  • the base station selects reserved PDCCH candidates according to the search space set type.
  • the reserved PDCCH candidates may be selected in the order of CSS and then USS.
  • the reserved PDCCH candidates may be selected in the order of CSS0, CSS of Configuration 2-0, other CSS, USS.
  • the base station selects all reserved PDCCH candidates of the previous search space set type, it selects a PDCCH candidate to be reserved for the next search space set type.
  • the base station selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS. In an example, assuming that all reserved PDCCH candidates are selected for the CSS, the number of CCEs corresponding to selecting all the reserved PDCCH candidates may be 20.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the selection order, or order of adding PDCCH candidates, in the USS search space type is shown in FIGS. 8A and 8B, wherein the numbers in shaded PDCCH candidates in FIGS. 8A and 8B indicate successive reserved PDCCH candidates added in the USS search space type in the following order:
  • the first round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the first reserved PDCCH candidate is added to search space set 3, and the second is added to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the third reserved PDCCH candidate is added to search space set 3, and the fourth to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the fifth reserved PDCCH candidate is added to search space set 3.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the sixth reserved PDCCH candidate is added to search space set 3.
  • the number of reserved PDCCH candidates added reaches the threshold value of 6.
  • the threshold value is the sum of the number of occurrences of each search space set in slot n in the set of search spaces in the USS type.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the seventh PDCCH candidate is added to search space set 3, and the eighth to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the ninth reserved PDCCH candidate is added to search space set 3, and the tenth to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the eleventh reserved PDCCH candidate is added to search space set 3.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the 12th reserved PDCCH candidate is added to search space set 3.
  • the number of reserved PDCCH candidates added reaches the threshold value of 6.
  • the threshold value is the sum of the number of occurrences of each search space set in slot n in the set of search spaces in the USS type.
  • the second round selects the reserved PDCCH candidates in descending order of aggregation level as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the thirteenth reserved PDCCH candidate is added to search space set 3, and the fourteenth is added to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the fifteenth reserved PDCCH candidate is added to search space set 3, and the sixteenth is added to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the seventeenth reserved PDCCH candidate is added to search space set 3, exhausting the USS search space set type.
  • the Physical Downlink Control Channel (PDCCH) candidates selected from an original set of PDCCH candidates by a base station according to high-layer configuration parameters in a time slot n are referred to as reserved PDCCH candidates.
  • the remaining PDCCH candidates, which are not selected by the base station, are referred to as excluded PDCCH candidates.
  • the base station selects some or all of the excluded PDCCH candidates and re-selects the CCEs for the excluded PDCCH candidates.
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and the excluded PDCCH candidates for re-determining the CCEs, and sends the downlink control information to the terminal.
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and sends downlink control information to the terminal.
  • the terminal determines the reserved PDCCH candidate set as follows:
  • the terminal determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the terminal may have multiple search space sets that require monitoring, and the base station determines a PDCCH candidate set corresponding to these same search space sets.
  • the selection of the reserved PDCCH candidates by the terminal according to condition (A) (as specified as part of Method 1 previously in this document) in this embodiment is specifically conducted according to a predefined sequence of the aggregation level L in the search space s, where the number of reserved PDCCH candidates that have been selected does not exceed the threshold value
  • ⁇ is the ratio of the number of channel estimations that can be performed by the terminal to the number of CCEs that are present in the current time slot, indicates an upward rounding
  • O s is the number of occasions in the time slot for the search space set s.
  • O s is the number of PDCCH candidate monitoring times in the time slot n of the search space set s, wherein one PDCCH candidate monitoring time includes one or more time domain symbols, and there may be overlapping time domain symbols between different PDCCH candidate monitoring times.
  • the search space set type may be divided into a common search space (CSS) type and a UE-specific search space (USS) type.
  • the search space collection type can be divided into multiple CSS types and one USS type.
  • the terminal selects reserved PDCCH candidates according to the search space set type. For example, the reserved PDCCH candidates may be selected in the order of CSS and then USS. Alternatively, the reserved PDCCH candidates may be selected in the order of CSS0, CSS of Configuration 2-0, other CSS, USS. After the base station selects all reserved PDCCH candidates of the previous search space set type, it selects a PDCCH candidate to be reserved for the next search space set type.
  • the terminal selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS. In an example, assuming that all reserved PDCCH candidates are selected for the CSS, the number of CCEs corresponding to selecting all the reserved PDCCH candidates may be 20.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the selection order, or order of adding PDCCH candidates, in the USS search space type is shown in FIGS. 8A and 8B, wherein the numbers in shaded PDCCH candidates in FIGS. 8A and 8B indicate successive reserved PDCCH candidates added in the USS search space type in the following order:
  • the first round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the first reserved PDCCH candidate is added to search space set 3, and the second is added to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order ofsearch space set number.
  • the third reserved PDCCH candidate is added to search space set 3, and the fourth to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the fifth reserved PDCCH candidate is added to search space set 3.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the sixth reserved PDCCH candidate is added to search space set 3.
  • the number of reserved PDCCH candidates added reaches the threshold value of 6.
  • the threshold value is the sum of the number of occurrences of each search space set in slot n in the set of search spaces in the USS type.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the seventh PDCCH candidate is added to search space set 3, and the eighth to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the ninth reserved PDCCH candidate is added to search space set 3, and the tenth to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the eleventh reserved PDCCH candidate is added to search space set 3.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the 12th reserved PDCCH candidate is added to search space set 3.
  • the number of reserved PDCCH candidates added reaches the threshold value of 6.
  • the threshold value is the sum of the number of occurrences of each search space set in slot n in the set of search spaces in the USS type.
  • the second round selects the reserved PDCCH candidates in descending order of aggregation level as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the thirteenth reserved PDCCH candidate is added to search space set 3, and the fourteenth is added to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the fifteenth reserved PDCCH candidate is added to search space set 3, and the sixteenth is added to search space set 5.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space set satisfying this condition is search space set 3.
  • One reserved PDCCH candidate is added to each selected search space set in ascending order of search space set number.
  • the seventeenth reserved PDCCH candidate is added to search space set 3, exhausting the USS search space set type.
  • the terminal in the physical downlink control channel (PDCCH) candidates selected from an original set of PDCCH candidatesby the terminal according to high-layer configuration parameters in the slot n are referred to as reserved PDCCH candidates.
  • the terminal selects partially or completely excluded PDCCH candidates and reselects the CCEs for the excluded PDCCH candidates.
  • the terminal may detect the DCI carried on the physical downlink control message of the reserved PDCCH candidate and the excluded PDCCH candidates.
  • Example Embodiment 2 Multi-occasion; one occasion adds all PDCCH at one time
  • the base station determines the reserved PDCCH candidate set as follows:
  • the PDCCH candidates are selected in ascending order of the search space set identifier.
  • one space search set is selecting (or adding) candidates, multiple PDCCH candidates may be selected at that time.
  • the base station determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the terminal may have multiple search space sets that require monitoring, and the base station determines a PDCCH candidate set corresponding to these same search space sets.
  • the selection of the reserved PDCCH candidates by the base station according to condition (A) (as specified as part of Method 1 previously in this document) in this embodiment is specifically conducted according to a predefined sequence of the aggregation level L in the search space s, where the number of reserved PDCCH candidates that have been selected does not exceed the threshold value
  • ⁇ is the ratio of the number of channel estimations that can be performed by the terminal to the number of CCEs that are present in the current time slot, indicates an upward rounding
  • O s is the number of occasions in the time slot for the search space set s.
  • the search space set type may be divided into a common search space (CSS) type and a UE-specific search space (USS) type.
  • the search space collection type can be divided into multiple CSS types and one USS type.
  • the base station selects reserved PDCCH candidates according to the search space set type. For example, the reserved PDCCH candidates may be selected in the order of CSS and then USS. Alternatively, the reserved PDCCH candidates may be selected in the order of CSS0, CSS of Configuration 2-0, other CSS, USS. After the base station selects all reserved PDCCH candidates of the previous search space set type, it selects a PDCCH candidate to be reserved for the next search space set type.
  • the search space set type may be divided into a common search space (CSS) type and a UE-specific search space (USS) type.
  • the search space collection type can be divided into multiple CSS types and one USS type.
  • the base station selects reserved PDCCH candidates according to the search space set type. For example, the reserved PDCCH candidates may be selected in the order of CSS and then USS. Alternatively, the reserved PDCCH candidates may be selected in the order of CSS0, CSS of Configuration 2-0, other CSS, USS. After the base station selects all reserved PDCCH candidates of the previous search space set type, it selects a PDCCH candidate to be reserved for the next search space set type.
  • the base station selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS. In an example, assuming that all reserved PDCCH candidates are selected for the CSS, the number of CCEs corresponding to selecting all the reserved PDCCH candidates may be 20.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the selection order, or order of adding PDCCH candidates, in the USS search space type is shown in FIGS. 9A and 9B, wherein the numbers in shaded PDCCH candidates in FIGS. 9A and 9B indicate successive reserved PDCCH candidates added in the USS search space type in the following order:
  • the first round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • Add X 4 PDCCH candidates for search space set 3; thus, add the first to the fourth PDCCH candidates.
  • Add X 2 PDCCH candidates for search space set 5; thus, add the fifth and sixth PDCCH candidates.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • Add X 4 PDCCH candidates for search space set 3; thus, add the seventh to the tenth PDCCH candidates.
  • Add X 2 PDCCH candidates for search space set 5; thus, add the eleventh and twelfth PDCCH candidates.
  • the second round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • Add X 4 PDCCH candidates for search space set 3; thus, add the thirteenth to the sixteenth PDCCH candidates.
  • Add X 1 PDCCH candidate for search space set 5; thus, add the seventeenth PDCCH candidate.
  • the Physical Downlink Control Channel (PDCCH) candidates selected from an original set of PDCCH candidates by a base station according to high-layer configuration parameters in a time slot n are referred to as reserved PDCCH candidates.
  • the remaining PDCCH candidates, which are not selected by the base station, are referred to as excluded PDCCH candidates.
  • the base station selects some or all of the excluded PDCCH candidates and re-selects the CCEs for the excluded PDCCH candidates.
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and the excluded PDCCH candidates for re-determining the CCEs, and sends the downlink control information to the terminal.
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and sends downlink control information to the terminal.
  • the terminal determines the reserved PDCCH candidate set as follows:
  • the PDCCH candidates are selected in ascending order of the search space set identifier.
  • one space search set is selecting (or adding) candidates, multiple PDCCH candidates may be selected at that time.
  • the terminal determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the terminal may have multiple search space sets that require monitoring, and the base station determines a PDCCH candidate set corresponding to these same search space sets.
  • the selection of the reserved PDCCH candidates by the terminal according to condition (A) (as specified as part of Method 1 previously in this document) in this embodiment is specifically conducted according to a predefined sequence of the aggregation level L in the search space s, where the number of reserved PDCCH candidates that have been selected does not exceed the threshold value
  • ⁇ is the ratio of the number of channel estimations that can be performed by the terminal to the number of CCEs that are present in the current time slot, indicates an upward rounding
  • O s is the number of occasions in the time slot for the search space set s.
  • the search space set type may be divided into a common search space (CSS) type and a UE-specific search space (USS) type.
  • the search space collection type can be divided into multiple CSS types and one USS type.
  • the terminal selects reserved PDCCH candidates according to the search space set type. For example, the reserved PDCCH candidates may be selected in the order of CSS and then USS. Alternatively, the reserved PDCCH candidates may be selected in the order of CSS0, CSS of Configuration 2-0, other CSS, USS. After the terminal selects all reserved PDCCH candidates of the previous search space set type, it selects a PDCCH candidate to be reserved for the next search space set type.
  • the search space set type may be divided into a common search space (CSS) type and a UE-specific search space (USS) type.
  • the search space collection type can be divided into multiple CSS types and one USS type.
  • the base station selects reserved PDCCH candidates according to the search space set type. For example, the reserved PDCCH candidates may be selected in the order of CSS and then USS. Alternatively, the reserved PDCCH candidates may be selected in the order of CSS0, CSS of Configuration 2-0, other CSS, USS. After the base station selects all reserved PDCCH candidates of the previous search space set type, it selects a PDCCH candidate to be reserved for the next search space set type.
  • the terminal selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS. In an example, assuming that all reserved PDCCH candidates are selected for the CSS, the number of CCEs corresponding to selecting all the reserved PDCCH candidates may be 20.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the selection order, or order of adding PDCCH candidates, in the USS search space type is shown in FIGS. 9A and 9B, wherein the numbers in shaded PDCCH candidates in FIGS. 9A and 9B indicate successive reserved PDCCH candidates added in the USS search space type in the following order:
  • the first round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • Add X 4 PDCCH candidates for search space set 3; thus, add the first to the fourth PDCCH candidates.
  • Add X 2 PDCCH candidates for search space set 5; thus, add the fifth and sixth PDCCH candidates.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • Add X 4 PDCCH candidates for search space set 3; thus, add the seventh to the tenth PDCCH candidates.
  • Add X 2 PDCCH candidates for search space set 5; thus, add the eleventh and twelfth PDCCH candidates.
  • the second round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • Add X 4 PDCCH candidates for search space set 3; thus, add the thirteenth to the sixteenth PDCCH candidates.
  • Add X 1 PDCCH candidate for search space set 5; thus, add the seventeenth PDCCH candidate.
  • the terminal in the physical downlink control channel (PDCCH) candidates selected from an original set of PDCCH candidatesby the terminal according to high-layer configuration parameters in the slot n are referred to as reserved PDCCH candidates.
  • the terminal selects partially or completely excluded PDCCH candidates and reselects the CCEs for the excluded PDCCH candidates.
  • the terminal may detect the DCI carried on the physical downlink control message of the reserved PDCCH candidate and the excluded PDCCH candidates.
  • Example Embodiment 3 Occasions add PDCCH according to an interleaving matrix
  • the occasion (PDCCH candidate monitoring times) indexes in the slots may be reordered using an interleaving matrix, and PDCCH candidates may be selected at each time in one occasion according to the interleaved occasion index order (and until all PDCCH candidates at an aggregation level L of a search space set s have been selected) .
  • the base station determines the reserved PDCCH candidate set as follows:
  • the PDCCH candidates are selected in descending order of the search space set identifier.
  • one space search set is selecting (or adding) candidates, multiple PDCCH candidates may be selected at that time.
  • the base station determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the base station selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS. In an example, assuming that all reserved PDCCH candidates are selected for the CSS, the number of CCEs corresponding to selecting all the reserved PDCCH candidates may be 20.
  • the base station selects PDCCH candidates in descending order of aggregation level (AL) for N ⁇ 1 rounds.
  • A aggregation level
  • the PDCCH candidates are selected in descending order of the search space set identifier.
  • multiple PDCCH candidates may be selected at that time.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the occasion indexes 1-4 are read into an interleaver matrix row by row, to derive the following:
  • the output of the interleaver matrix is ⁇ 1, 3, 2, 4 ⁇ .
  • the output of the interleaver matrix is ⁇ 1, 2 ⁇ .
  • FIGS. 10A and 10B the selection order, or order of adding PDCCH candidates, in the USS search space type is shown in FIGS. 10A and 10B, wherein the numbers in shaded PDCCH candidates in FIGS. 10A and 10B indicate successive reserved PDCCH candidates added in the USS search space type in the following order:
  • the first round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • search space set 3 one PDCCH candidate is added to each occasion in the order ⁇ 1, 3, 2, 4 ⁇ based on the output of the interleaver matrix, and thus, the first to the fourth PDCCH candidates are added.
  • search space set 5 and based on the order ⁇ 1, 2 ⁇ the fifth and sixth PDCCH candidates are added.
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • search space set 3 one PDCCH candidate is added to each occasion in the order ⁇ 1, 3, 2, 4 ⁇ based on the output of the interleaver matrix, and thus, the seventh to the tenth PDCCH candidates.
  • search space set 5 and based on the order ⁇ 1, 2 ⁇ the eleventh and twelfth PDCCH candidates are added.
  • the second round of selecting the reserved PDCCH candidates in descending order of aggregation level is as follows:
  • the search space sets where the number of reserved PDCCH candidates added in this round is less than the threshold O s are selected.
  • the search space sets satisfying this condition are search space set 3 and search space set 5.
  • search space set 3 one PDCCH candidate is added to each occasion in the order ⁇ 1, 3, 2, 4 ⁇ based on the output of the interleaver matrix, and thus, the thirteenth to the sixteenth PDCCH candidates.
  • search space set 5 and based on the order ⁇ 1, 2 ⁇ the seventeenth PDCCH candidate is added.
  • the Physical Downlink Control Channel (PDCCH) candidates selected from an original set of PDCCH candidates by a base station according to high-layer configuration parameters in a time slot n are referred to as reserved PDCCH candidates.
  • the remaining PDCCH candidates, which are not selected by the base station, are referred to as excluded PDCCH candidates.
  • the base station selects some or all of the excluded PDCCH candidates and re-selects the CCEs for the excluded PDCCH candidates.
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and the excluded PDCCH candidates for re-determining the CCEs, and sends the downlink control information to the terminal.
  • the base station selects one or more PDCCH candidates from among the reserved PDCCH candidates and sends downlink control information to the terminal.
  • Example Embodiment 4 Occasions add PDCCH according to an interleaving matrix within one intra-occasion
  • the occasion (PDCCH candidate monitoring times) indexes in the slots may be reordered using an interleaving matrix, and PDCCH candidates may be selected at each time in one occasion according to the interleaved occasion index order (and until all PDCCH candidates at an aggregation level L of a search space set s have been selected) .
  • the PDCCH candidate indexes (denoted m) in the search space s and aggregation level L in slot n are shown in FIG. 11.
  • the PDDCH candidate index are read into an interleaver matrix row by row, to derive the following:
  • the output of the interleaver matrix is read column by column, where the ordering of the columns is Thus, the ordering of the PDCCH candidate indexes after the interleaving matrix is ⁇ 0, 4, 2, 6, 1, 5, 3, 7 ⁇ .
  • the intra-slot index of the search space set s in the slot n is used for cyclically shifting the PDCCH candidate index output after the interleaving matrix has been used to reorder the indexes.
  • the PDCCH candidate index output of the interleaving matrix may be cyclically shifted to the left, by a shift of Os mod where O s is the index of the search space set s in slot n.
  • the base station may add PDCCH candidates to the occasion on the time slot n according to the cyclically-shifted PDCCH candidate index order.
  • Example Embodiment 5 Occasions add PDCCH based on priority values
  • the base station may define a priority value for the PDCCH candidates based on their indexes (m) , the occasion index (O) and The priority values may be used to determine the order of selecting the PDCCH candidates.
  • the base station determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the base station selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the priority is defined as: where is the number of PDCCH candidates configured for the base station for the aggregation level L in the search space set s.
  • FIG. 4 shows the value I for a search space set s and aggregation level L.
  • the base station may select PDCCH candidates in descending order of priority values. For the same priority values, the reserved PDCCH candidates are selected in descending order of aggregation levels. For the same priority values and the same aggregation level, the PDCCH candidates are selected in descending order of the search space set identifier. Based on these rules, and with the base station selecting 17 PDCCH candidates, the selected PDCCH candidates are shown in FIGS. 13A and 13B.
  • the total number of selected PDCCH candidates and/or the number of CCEs corresponding to the selected PDCCH candidates reaches their respective threshold values, and the selection of reserved PDCCH candidates is terminated.
  • Example Embodiment 6 Occasions add PDCCH based on interleaved priority values
  • the base station may select PDCCH candidates using an ordering that is based on the PDCCH candidate index (m) , the occasion index (O) , and
  • the priority values may be used to determine the order of selecting the PDCCH candidates, but after they have been interleaved.
  • O’ is the occasion index for the interleaved set of occasion indexes.
  • the priority is defined as: where is the number of PDCCH candidates configured for the base station for the aggregation level L in the search space set s.
  • the base station determines the PDCCH candidate set for slot n according to the configuration of the high layer parameters of the base station.
  • the base station selects a reserved PDCCH candidate for an i-th UE in the order of CSS and USS according to the search space type. After selecting all reserved PDCCH candidates for CSS, it selects the reserved PDCCH candidate for USS.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the occasion indexes 1-4 are read into an interleaver matrix row by row, to derive the following:
  • the output of the interleaver matrix is read column by column, where the ordering of the columns is 1, 1+O s /2, 2, 2+O s /2, Vietnamese, O s /2, O s .
  • the output of the interleaver matrix is ⁇ 0, 2, 1, 3 ⁇ .
  • FIG. 14 shows the value I computed for the PDCCH candidates in search space set s and aggregation level L in slot n, and according to the priority and interleaving examples described above.
  • the base station may select PDCCH candidates in descending order of priority values. For the same priority values, the reserved PDCCH candidates are selected in descending order of aggregation levels. For the same priority values and the same aggregation level, the PDCCH candidates are selected in descending order of the search space set identifier. Based on these rules, and with the base station selecting 17 PDCCH candidates, the selected PDCCH candidates are shown in FIGS. 16A and 16B.
  • the total number of selected PDCCH candidates and/or the number of CCEs corresponding to the selected PDCCH candidates reaches their respective threshold values, and the selection of reserved PDCCH candidates is terminated.
  • Example Embodiment 7 Occasions add PDCCH based on priority values and ⁇ s, L ⁇
  • the base station may select PDCCH candidates using an ordering that is based on the PDCCH candidate index (m) , the occasion index (O) , and
  • the priority value of ⁇ s, L ⁇ may be defined as the minimum value of the priority values corresponding to all the PDCCH candidates in the aggregation level L in the search space s, and is the priority of ⁇ s, L ⁇ .
  • the base station selects ⁇ s, L ⁇ in descending order of the priority values of ⁇ s, L ⁇ , and selects PDCCH candidates of aggregation level L in the search space set s. After ⁇ s, L ⁇ is selected as a reserved PDCCH candidate, the minimum priority value is deleted from ⁇ s, L, and the minimum priority value corresponding to the PDCCH candidate with all non-deleted priority values in ⁇ s, L ⁇ is selected as the new (or updated) priority value for ⁇ s, L ⁇ . The base station continues to select ⁇ s, L ⁇ in descending order of priority values of ⁇ s, L ⁇ , and selects PDCCH candidates with aggregation level L in the search space set s.
  • the reserved PDCCH candidates are selected in descending order of the aggregation level L.
  • the PDCCH candidates are selected in descending order of the search space set identifier.
  • the search space set may include two search space sets: search space set 3 and search space set 5, as shown in FIGS. 3A and 3B, both in slot n.
  • search space set 3 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • search space set 5 search space set 5
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 4 occasions on slot n, as shown in the left-hand portions of FIGS. 3A and 3B.
  • the number of PDCCH candidates configured at aggregation level ⁇ 1, 2, 4, 8, 16 ⁇ is ⁇ 6, 6, 0, 0, 0 ⁇ , respectively, and which corresponds to 2 occasions on slot n, as shown in the right-hand portions of FIGS. 3A and 3B.
  • the priority is defined as: where is the number of PDCCH candidates configured for the base station for the aggregation level L in the search space set s.
  • FIG. 4 shows the value I for a search space set s and aggregation level L.
  • the priority value of ⁇ s, L ⁇ is the minimum value of the priority values corresponding to all the PDCCH candidates in the aggregation level L in the search space s, and is the priority of ⁇ s, L ⁇ .
  • the priority values in the search space set s and aggregation level L are:
  • the reserved PDCCH candidates are selected in ascending order of aggregation level L.
  • the PDCCH candidates are selected in ascending order of the search space set identifier s.
  • the order in which to add the PDCCH candidates, with respect to the occasion index is ⁇ 0, 2, 1, 3 ⁇ .
  • the order of occasion indexes in which to add the PDCCH candidates is ⁇ 0, 1 ⁇ .
  • FIG. 19 shows an example of a wireless communication method 1900 for PDCCH candidate selection.
  • the method 1900 includes, at step 910, performing a communication operation in one or more of a first set of resources.
  • a second set of resources may comprise the first set of resources and a third set of resources such that resources of the first set of resources are non-overlapping with resources of the third set of resources.
  • resources of the sets of resources may include sub-resources.
  • the resources may correspond to PDCCH candidates and the sub-resources may corresponds to CCEs.
  • the second set of resources may correspond to PDCCH candidates, the first set of resources may correspond to reserved PDCCH candidates, and the third set of resources may correspond to excluded PDCCH candidates, as described in Example Embodiments 1-7.
  • the resources of the first set of resources are selected in a selection order from a second set of resources. In other embodiments, the resources of the third set of resources are selected in a selection order from the second set of resources.
  • the selection order is based on at least one of a period of a search space set, a DCI format of the search space set, a starting symbol of the search space set, a component carrier type, a component carrier index or an occasion index. In other embodiments, the selection order is further based on at least one of an aggregation level, a number of resources in the second set of resources, a search space set identifier, a control resource set identifier, a number of blind decoding operations, a number of sub-resources, a search space set type and an index of resources in the second set of resources.
  • the second set of resources may correspond to resources in a bandwidth part (BWP) of a component carrier in one slot.
  • BWP bandwidth part
  • the bandwidth part may be an active bandwidth part, a target bandwidth part or an initial access bandwidth part.
  • a number of the first, second and third resources may be less than respective thresholds.
  • the thresholds may be known a priori to the terminal and the base station. In another example, the thresholds may be predetermined or may be indicated to the terminal via signaling from the base station.
  • the third threshold may be based on at least and O s , wherein is a number of resources in the single search space set and the single aggregation level in one occasion, and wherein O s is in a number of occasions of the single search space set.
  • the selection order may be based on the rules specified in Example Embodiments 1-7. In an example, the selection order may be based on an ascending or a descending order of one or more parameters. In another example, the selection order may be based on an interleaved order of the one of more parameters. In the context of Example Embodiments 1-7, the selection order for multiple parameters may be nested, e.g. the selection of PDCCH candidates may be based on a first parameter, and for identical values of the first parameter, the selection may be based on a second parameter.
  • the selection of PDCCH candidates may be made in multiple selection steps. For example, a first selection step may be based on a type of the search space set (CSS or USS) , a second selection step, subsequent to the first selection step and within the type of the search space set, may be based on a type of cell in which the wireless node is operating (aprimary cell or one or more secondary cells) , a third selection step, subsequent to the second selection step and within the cell type, may be based on an ascending order of the component carrier index (associated with the BWP) , a fourth selection step, subsequent to the third selection step and for a given value of the component carrier index, may be based on a search space set period and a number of occasions of the search space set in one slot, and a fifth selection step, subsequent to the fourth selection step and for given values of the search space set period and the number of occasions of the search space set, may be based on a descending order of an aggregation level.
  • a first selection step may be based
  • the selection order may be based on an interleaving step that precedes or follows the selection based on a parameter. Examples of selecting PDCCH candidates based on interleaving, which may be implemented using an interleaving matrix, are described above in Example Embodiments 3, 4 and 6.
  • the interleaved output may be cyclically shifted by a value that is based on other parameters.
  • the sub-resources (e.g. CCEs) in excluded resources may be compared to the sub-resources of reserved resources, and those excluded resources reincorporated into the set of resources that may subsequently be used to communication DCI information.
  • the selection of PDCCH candidates may be sequential with respect to certain parameters, and may specifically be an ascending order, a descending order, or an interleaved order, as described in the various examples in this document.
  • the selection order may be based on priority values that are computed for PDCCH candidates as a function of the search space set, aggregation level and occasion index that the PDCCH candidate is located in, as described in Example Embodiments 5-7 in the present document.
  • the priority values may be optionally interleaved prior to the selection of resources based on the priority values.
  • FIG. 20 is a block diagram representation of a portion of an apparatus, in accordance with some embodiments of the presently disclosed technology.
  • Anapparatus2005 such as a base station or a wireless device (or UE)
  • can include processor electronics 2010 such as a microprocessor that implements one or more of the techniques presented in this document.
  • the apparatus2005 can include transceiver electronics 2015 to send and/or receive wireless signals over one or more communication interfaces such as antenna (s) 2020.
  • the apparatus2005 can include other communication interfaces for transmitting and receiving data.
  • Apparatus2005 can include one or more memories (not explicitly shown) configured to store information such as data and/or instructions.
  • the processor electronics 2010 can include at least a portion of the transceiver electronics 2015.
  • at least some of the disclosed techniques, modules or functions, including method 1900, are implemented using the apparatus2005.
  • a computer-readable medium may include removable and non-removable storage devices including, but not limited to, Read Only Memory (ROM) , Random Access Memory (RAM) , compact discs (CDs) , digital versatile discs (DVD) , etc. Therefore, the computer-readable media can include a non-transitory storage media.
  • program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
  • Computer-or processor-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.
  • a hardware circuit implementation can include discrete analog and/or digital components that are, for example, integrated as part of a printed circuit board.
  • the disclosed components or modules can be implemented as an Application Specific Integrated Circuit (ASIC) and/or as a Field Programmable Gate Array (FPGA) device.
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • DSP digital signal processor
  • the various components or sub-components within each module may be implemented in software, hardware or firmware.
  • the connectivity between the modules and/or components within the modules may be provided using any one of the connectivity methods and media that is known in the art, including, but not limited to, communications over the Internet, wired, or wireless networks using the appropriate protocols.

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 des procédés, des systèmes et des dispositifs de sélection de canal de commande de liaison descendante physique (PDCCH) candidat. Un procédé à titre d'exemple consiste à effectuer une opération de communication dans une ou plusieurs ressources d'un premier ensemble de ressources, les ressources du premier ensemble de ressources étant sélectionnées dans un ordre de sélection à partir d'un second ensemble de ressources qui est plus grand que le premier ensemble de ressources, et l'ordre de sélection pour le premier ensemble de ressources étant basé sur au moins l'un parmi une période d'un ensemble d'espaces de recherche, un format d'informations de commande de liaison descendante (DCI) de l'ensemble d'espaces de recherche, un symbole de départ de l'ensemble d'espaces de recherche, un type de porteuse composante, un indice de porteuse composante ou un indice d'occasion.
PCT/CN2018/082094 2018-04-06 2018-04-06 Procédé et système de sélection de canal de commande de liaison descendante physique candidat Ceased WO2019192018A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP18913949.6A EP3777417A4 (fr) 2018-04-06 2018-04-06 Procédé et système de sélection de canal de commande de liaison descendante physique candidat
PCT/CN2018/082094 WO2019192018A1 (fr) 2018-04-06 2018-04-06 Procédé et système de sélection de canal de commande de liaison descendante physique candidat
CN201880091487.5A CN111869300B (zh) 2018-04-06 2018-04-06 物理下行链路控制信道候选选择方法和系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2018/082094 WO2019192018A1 (fr) 2018-04-06 2018-04-06 Procédé et système de sélection de canal de commande de liaison descendante physique candidat

Publications (1)

Publication Number Publication Date
WO2019192018A1 true WO2019192018A1 (fr) 2019-10-10

Family

ID=68100070

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/082094 Ceased WO2019192018A1 (fr) 2018-04-06 2018-04-06 Procédé et système de sélection de canal de commande de liaison descendante physique candidat

Country Status (3)

Country Link
EP (1) EP3777417A4 (fr)
CN (1) CN111869300B (fr)
WO (1) WO2019192018A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114286427A (zh) * 2020-09-28 2022-04-05 中国移动通信有限公司研究院 一种控制信道处理方法、装置、设备及可读存储介质
WO2022077278A1 (fr) * 2020-10-14 2022-04-21 Apple Inc. Transmission de canal physique de commande de liaison descendante (pdcch) dans des communications sans fil
WO2022150979A1 (fr) * 2021-01-12 2022-07-21 捷开通讯(深圳)有限公司 Procédé d'amélioration de transmission et dispositif de communication
CN115053488A (zh) * 2020-02-12 2022-09-13 高通股份有限公司 用于新无线电的控制资源集
EP4072213A4 (fr) * 2019-12-30 2022-12-07 Huawei Technologies Co., Ltd. Procédé et appareil de communication
EP4113874A4 (fr) * 2020-02-24 2023-08-23 Vivo Mobile Communication Co., Ltd. Procédé de détection d'informations, procédé de transmission d'informations, terminal et dispositif de réseau

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11985659B2 (en) 2021-04-05 2024-05-14 Apple Inc. Control channel and reference signal transmission in wireless networks
WO2024031637A1 (fr) * 2022-08-12 2024-02-15 Apple Inc. Terminal, système et procédé d'indexation de ressources dans des procédures de communication de liaison latérale

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103098398A (zh) * 2010-07-22 2013-05-08 Lg电子株式会社 在多载波系统中发送上行链路控制信息的设备和方法
CN103179673A (zh) * 2011-12-26 2013-06-26 中兴通讯股份有限公司 资源的调度方法和装置
WO2014166045A1 (fr) * 2013-04-08 2014-10-16 华为技术有限公司 Procédé d'émission et procédé de réception pour canal de commande, équipement d'utilisateur et station de base

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9166718B2 (en) * 2012-05-11 2015-10-20 Intel Corporation Downlink control indication for a stand-alone new carrier type (NCT)
EP2768174B1 (fr) * 2012-10-31 2018-12-05 LG Electronics Inc. -1- Procédé d'émission/réception d'informations de commande et appareil associé
CN110383729B (zh) * 2017-12-08 2022-02-25 Lg电子株式会社 用于在无线通信系统中发送或接收信号的方法及其装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103098398A (zh) * 2010-07-22 2013-05-08 Lg电子株式会社 在多载波系统中发送上行链路控制信息的设备和方法
CN103179673A (zh) * 2011-12-26 2013-06-26 中兴通讯股份有限公司 资源的调度方法和装置
WO2014166045A1 (fr) * 2013-04-08 2014-10-16 华为技术有限公司 Procédé d'émission et procédé de réception pour canal de commande, équipement d'utilisateur et station de base

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
CATT: "Remaining issues on PDCCH search space", 3GPP DRAFT RL-1801728
OPPO: "Discussion of search space design", 3GPP DRAFT RL-1718043
See also references of EP3777417A4
ZTE ET AL.: "Consideration on Search Space Design for NR-PDCCH", 3GPP TSG RAN WGI MEETING #88, RL-1701586, 17 February 2017 (2017-02-17), XP051208753 *
ZTE ET AL.: "Resource sharing between PDCCH and PDSCH", 3GPP DRAFT RL-1715557
ZTE ET AL.: "Search space design and related issues", 3GPP DRAFT RL-1801622

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4072213A4 (fr) * 2019-12-30 2022-12-07 Huawei Technologies Co., Ltd. Procédé et appareil de communication
US12356400B2 (en) 2019-12-30 2025-07-08 Huawei Technologies Co., Ltd. Communication method and communication apparatus
CN115053488A (zh) * 2020-02-12 2022-09-13 高通股份有限公司 用于新无线电的控制资源集
US12501463B2 (en) 2020-02-12 2025-12-16 Qualcomm Incorporated Control resource set for new radio
EP4113874A4 (fr) * 2020-02-24 2023-08-23 Vivo Mobile Communication Co., Ltd. Procédé de détection d'informations, procédé de transmission d'informations, terminal et dispositif de réseau
CN114286427A (zh) * 2020-09-28 2022-04-05 中国移动通信有限公司研究院 一种控制信道处理方法、装置、设备及可读存储介质
WO2022077278A1 (fr) * 2020-10-14 2022-04-21 Apple Inc. Transmission de canal physique de commande de liaison descendante (pdcch) dans des communications sans fil
US12063532B2 (en) 2020-10-14 2024-08-13 Apple Inc. PDCCH transmission in wireless communications
WO2022150979A1 (fr) * 2021-01-12 2022-07-21 捷开通讯(深圳)有限公司 Procédé d'amélioration de transmission et dispositif de communication

Also Published As

Publication number Publication date
EP3777417A1 (fr) 2021-02-17
CN111869300A (zh) 2020-10-30
CN111869300B (zh) 2023-04-07
EP3777417A4 (fr) 2022-03-16

Similar Documents

Publication Publication Date Title
WO2019192018A1 (fr) Procédé et système de sélection de canal de commande de liaison descendante physique candidat
US11323201B2 (en) Apparatus and method for encoding and decoding channel in communication or broadcasting system
EP3487110B1 (fr) Gestion de recherche aveugle de canal de commande entre des espaces de recherche radio dans une nouvelle radio
CN109673056B (zh) 5g系统中基于功率测量的pdcch自适应盲检测方法
US12095706B2 (en) Information determination method and device, information adjustment method, threshold usage method, terminal, and storage medium
CN109495234B (zh) 一种物理下行控制信道的检测方法及装置
KR101886397B1 (ko) Pdcch 블라인드 검출 방법 및 시스템
US20240147476A1 (en) Method and device apparatus for transmitting paging message and monitoring paging message
CN110351010B (zh) 一种信道盲检方法、信号传输方法和相关设备
US11765755B2 (en) Method and apparatus for transmitting and receiving control channel in wireless communication system
US20190215098A1 (en) Apparatuses and methods for managing blind searches
CN110166203B (zh) 物理下行控制信道的确定、检测方法及装置、基站和终端
EP2485553A1 (fr) Système et procédé permettant de signaler une configuration de signaux de référence sonore
US11985616B2 (en) Method and device for indicating synchronization signal block in wireless communication system
CN111901083B (zh) 一种准共址信息获取方法、通信节点及存储介质
CN107046722A (zh) 调度定时间隔的确定方法及装置
CN104811263A (zh) 控制信息的传输方法及装置
KR20230159845A (ko) FeMIMO를 위한 PUSCH의 기본 빔 동작을 위한 방법 및 장치
CN104969502A (zh) 包括区分PRB对的集合的处理ePDCCH信息
CN111034289A (zh) 用于控制资源映射的方法和装置
US11743776B2 (en) Resource allocation for configurable bandwidths
CN113016220B (zh) 数字无线通信的方法、系统和设备
WO2017125090A1 (fr) Procédé de transmission de signal de référence, et équipement de réseau
CN109041243B (zh) 一种物理下行控制信道的发送方法、接收方法及相关设备
US10178659B2 (en) Device and method of handling shortened enhanced physical downlink control channel transmission

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018913949

Country of ref document: EP

Effective date: 20201106

WWW Wipo information: withdrawn in national office

Ref document number: 2018913949

Country of ref document: EP