专利摘要:
computer program systems, methods, apparatus, and products are provided for managing or monitoring the control channel on a new radio (blind). One method may include configuring multiple search spaces, search space sets, and / or control feature sets, for a network node, for a user's device, resulting in monitoring occasions where more decoding is required. blind than permitted by the user's equipment capacity. The method may further include identifying the monitoring occasions for which an allowable number of blind decodes is exceeded, determining a reduced set of blind and / or candidate decodes determined by predefined search space rules or priorities, and transmitting the control channel. physical downlink (or physical downlink control channels) to the user equipment that received the reduced set.
公开号:BR102018073485A2
申请号:R102018073485-7
申请日:2018-11-14
公开日:2019-06-04
发明作者:Esa Tiirola;Volker Braun;Karol Schober
申请人:Nokia Technologies Oy;
IPC主号:
专利说明:

BLIND CONTROL CHANNEL MANAGEMENT BETWEEN SEARCH SPACES IN NOVA RADIO
BACKGROUND:
Field:
[0001] The modalities of the invention generally refer to cellular or wireless communications networks, such as, but without limitation, the Universal Mobile Telecommunications System (UMTS) - Terrestrial Radio Access Network (UTRAN), Evolution of Long Term (LTE) - Evolved UTRAN (E-UTRAN), Advanced UTRAN (LTE-A), LTE-A Pro and / or 5G radio access technology or new radio access technology (NR). Some modalities may refer, in general, for example, to the monitoring of the NR control channel, which can be performed through blind searches.
Description of Related Art:
[0002] Universal Mobile Telecommunications System (UMTS) - Terrestrial Radio Access Network (UTRAN) refers to a communications network, including base stations, or Nodes B, and, for example, radio network controllers (RNC ). The UTRAN allows connectivity between the user's equipment (UE) and the main network. The RNC provides control functionality for one or more B Nodes. The RNC and its corresponding B Nodes are called Radio Network Subsystem (RNS). In the case of E-UTRAN (Evolved UTRAN), the air interface design, protocol architecture and multiple access principles are now compared to those of the UTRAN, and there is no RNC and radio access functionality is provided by a Node E evolved B (eNodeB or eNB) or many eNBs. Multiple eNBs are involved in a
Petition 870180151482, of 11/14/2018, p. 25/84
2/46 single EU connection, for example, in the case of
Streaming
Coordinated Multipoint (CoMP) and dual connectivity (DC).
[0003]
The Evolution of
Long Term (LTE) or E-UTRAN has improved efficiency and services, offers lower costs and provides new spectrum opportunities compared to previous generations. In particular, LTE is a standard
3GPP that provides peak uplink rates of at least, for example, megabits per second (Mbps) per carrier and peak downlink rates of at least, for example, 300
Mbps per carrier. LTE supports scalable bandwidths from 20 MHz to 1.4 MHz and supports both Frequency Division (FDD) and Duplexing per carrier
Duplexing
Division of
Time (TDD). Carrier aggregation or so-called dual connectivity allows additionally to operate multiple component carriers at the same time, thereby multiplying performance as data rates per user.
[0004] As mentioned above, LTE can also improve spectral efficiency in networks, allowing carriers to provide more data and voice services over a given bandwidth. Therefore, LTE is designed to meet the needs of high speed data and media transport, in addition to high capacity voice support. Advantages of LTE include, for example, high throughput, low latency, FDD and TDD support on the same platform, an improved end user experience and a simple architecture, resulting in low operating costs.
[0005] Certain additional versions of 3GPP LTE (for example, LTE Rel-10, LTE Rel-11) are targeted for
Petition 870180151482, of 11/14/2018, p. 26/84
3/46 international advanced mobile telecommunications systems (IMT-A), referred to in this document, for convenience purposes, simply UTRAN Advanced (LTE-A).
[0006] LTE-A is aimed at extending and optimizing 3GPP LTE radio access technologies. An objective of LTE-A is to provide significantly improved services through higher data rates and lower latency at reduced cost. LTE-A is a more optimized radio system that meets the requirements of the International Telecommunications Radio Union (ITU-R) for Advanced IMT, while maintaining backward compatibility. One of the key features of LTE-A, introduced in LTE Rel-10, is carrier aggregation, which makes it possible to increase data rates by aggregating two or more LTE carriers. The next versions of 3GPP LTE (for example, LTE Rel-12, LTE Rel-13, LTE Rel-14, LTE Rel15) are aimed at further improvements in specialized services, lower latency and meeting 5G requirements.
[0007] Systems without fifth generation wire (5G) or new radio (NR) refer to the next generation (NG) of radio and network architecture systems. 5G is also known to appear as the IMT-2020 system. It is estimated that 5G will provide bit rates on the order of 10-20 Gbit / s or higher. The 5G will support at least advanced mobile broadband (eMBB) and ultra-reliable low latency communication (URLLC). 5G is also expected to increase network expandability to hundreds of thousands of connections. 5G signal technology is anticipated for greater coverage as well as efficiency
Petition 870180151482, of 11/14/2018, p. 27/84
4/46 spectral and signaling. 5G is expected to provide extreme broadband and ultra-rugged, low-latency connectivity and massive network to support the Internet of Things (IoT). With greater IoT diffusion and machine-to-machine (M2M) communication, there will be an increasing need for networks that satisfy the needs of less power, lower data rate and long battery life. In 5G or NR, Node B or eNB can be named as a next generation or Node B 5G (gNB).
SUMMARY:
[0008] A modality is directed to a method that includes configuring, by a network node, multiple search spaces, sets of search spaces and / or sets of control resources, for a user's equipment, which results in occasions monitoring systems in which blind decodings are required than allowed by the capacity of the user's equipment. The method may also include identifying monitoring occasions for which an allowable number of blind decodings is exceeded, determining a reduced set of blind and / or candidate decodings, and transmitting the physical downlink control channel (or control channels). physical downlink) for the user's equipment in the reduced set of blind or candidate decodings. The reduced set of blind and / or candidate decodings is determined by predefined search space rules or priorities.
[0009] Another modality is directed to a device, including at least one processor and at least one memory that comprises computer program code. THE
Petition 870180151482, of 11/14/2018, p. 28/84
5/46 at least one memory and the computer program code are configured, with at least one processor, to make the device at least configure multiple search spaces, sets of search spaces and / or sets of search features control, for user equipment, which results in monitoring occasions when more blind decoding is needed than allowed by the user's equipment capacity. At least one memory and the computer program code can be additionally configured, with at least one processor, to make the device at least identify the monitoring occasions for which a permitted number of blind decodings is exceeded, determine a reduced set of blind and / or candidate decodings and transmit physical downlink control channel (or physical downlink control channels) to the user's equipment in a reduced set of reduced set of blind or candidate decodings. Blind and / or candidate decoding is determined by predefined search space priorities or rules.
[0010] Another modality is directed to a method that includes receiving, through user equipment, configuration of blind or candidate decodings in multiple search spaces, sets of search spaces and / or sets of control resources, which results on monitoring occasions when several required blind decodings exceed a user's equipment capacity. The method may also include identifying the monitoring occasions for which the capacity to monitor
Petition 870180151482, of 11/14/2018, p. 29/84
6/46 blind decoding of user equipment is exceeded and reducing the set of blind or candidate decodings based on predefined search space priorities or rules and receiving, through the user equipment, PDCCH (s) that received the reduced set of blind or candidate decodings.
[0011] Another modality is directed to a device, including at least one processor and at least one memory that comprises computer program code. At least one memory and the computer program code are configured, with at least one processor, to make the device at least receive the configuration of blind or candidate decodings in multiple search spaces, sets of search spaces or control feature sets, resulting in monitoring occasions when several required blind decodings exceed a user's equipment capacity. At least one memory and computer program code can be additionally configured, with at least one processor, to make the device at least identify the monitoring occasions for which the blind decoding capability of the user's equipment is exceeded and reduce the set of blind or candidate decodings based on predefined search space priorities or rules, and to receive PDCCH (s) that received the reduced set of blind or candidate decodings.
BRIEF DESCRIPTION OF THE DRAWINGS:
[0012] For a proper understanding of the invention, reference should be made to the accompanying drawings, in which:
Petition 870180151482, of 11/14/2018, p. 30/84
Ί / Μ [0013] Fig. 1 illustrates an exemplary control channel mapping (PDCCH);
[0014] Fig. 2 illustrates one diagram in block exemplary for the way in to determine the order in discard blind decoding (BDs), from wake up with certain modalities;[0015] Fig. 3a illustrates a diagram of block in one apparatus, according to a modality; [0016] Fig. 3b illustrates a diagram of block in one
apparatus, according to another modality;
[0017] Fig. 4a illustrates an exemplary flow chart of a method, according to a modality;
[0018] Fig. 4b illustrates an exemplary flow chart of a method, according to another modality; and [0019] Fig. 4c illustrates an exemplary flow chart of a method, according to a modality.
DETAILED DESCRIPTION:
[0020] It will be readily understood that the components of the invention, as described and illustrated generally in the figures in this document, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the modalities of systems, methods, devices and computer program products to manage or monitor the control channel in a new radio (NR) through blind searches, as represented in the attached figures described below, does not it is intended to limit the scope of the invention, but it is representative of selected modalities of the invention.
[0021] The resources, structures or characteristics of the
Petition 870180151482, of 11/14/2018, p. 31/84
8/46 invention described throughout this specification can be combined in any suitable manner in one or more embodiments. For example, the use of the terms "certain modalities", "some modalities" or other similar terminology throughout this specification refers to the fact that a particular feature, structure or characteristic described in conjunction with the modality can be included in at least least one embodiment of the present invention. Therefore, occurrences of the expressions "in certain modalities", "in some modalities", "in other modalities" or other similar terminology, throughout this specification do not all necessarily refer to the same group of modalities, and the resources, structures or characteristics described can be combined in any suitable way in one or more modalities.
[0022]
Additionally, if desired, the different functions or steps discussed below can be performed in a different order and / or simultaneously with each other.
In addition, if desired, one or more of the functions or steps described can be optional or can be combined.
As such, the following description should be considered as merely illustrative of the principles, teachings and modalities of this invention, and not limiting it.
[0023] NR physical downlink control channel (PDCCH) can be used to transmit downlink control (DCI) information. You can use OFDM waveform and polar coding. The NR PDCCH can use each fourth resource element for demodulation reference signaling (DMRS). DCI can be used to
Petition 870180151482, of 11/14/2018, p. 32/84
9/46 downlink (DL) and uplink (UL) resource allocation signaling. It can also be used for other purposes, such as (de) activation of part of carrier aggregation and bandwidth (BWP), indication of frame structure (Common group PDCCH) and power control updates.
[0024] Certain modalities are directed to the monitoring of the NR control channel that can be performed through blind searches. An objective may include reducing or containing the processing effort to perform blind searches. Blind search or blind decoding can refer to the process by which an EU finds its PDCCH monitoring a set of PDCCH candidates at each monitoring occasion. A monitoring occasion can be a view per slot, a view through multiple slots or multiple times in a slot. In one embodiment, the blind search of the physical downlink control channel (PDCCH) can be arranged by means of parallel search spaces or sets of search spaces mapped to one or multiple sets of control resources (CORESETs). During a blind PDCCH search, a UE may be monitoring predefined control channel elements (CCEs), aggregated CCEs and / or downlink control information (DCI) sizes at predefined time periods, corresponding to configured monitoring occasions .
[0025] CCEs can be arranged in a predefined CORESET configured by means of upper layer signaling. Each CCE can include 6 REGs (for example, 12 subcarriers in 1 OFDM symbol), and 1, 2 or 3 REG groupings. REG groupings can be
Petition 870180151482, of 11/14/2018, p. 33/84
10/46 mapped in CORESET using interleaved or non-interleaved mapping. The UE can assume that the REG grouping defines the pre-encoder granularity in frequency and time used by gNB when transmitting PDCCH. CORESET resources can be configured in units of 6 resource blocks on the frequency. Fiq. 1 illustrates an exemplary PDCCH mapping assuming 1 CORESET symbol, merged REG-to-CCE mapping and REG grouping size 2. Table 1 below lists the options for REG grouping sizes in terms of REGs, supported by new radio ( NR).
CORESET length (number of symbols) Non-merged mapping (REG grouping: frequency x time) Interleaved mapping (REG grouping: frequency x time) 1 6 (6x1) 2 (2x1), 6 (6x1) 2 6 (3x2) 2 (1x2), 6 (3x2) 3 6 (2x3) 3 (1x3), 6 (2x3)
TABLE 1 [0026] Certain working hypotheses and agreements were made in meetings of the 3GPP RAN1 working group in relation to the blind search for a control channel. For example, in the case where only CORESET (s) for slot-based scheduling is configured for a UE, the maximum number of blind PDCCH decodings per slot per carrier is X, where the value of X does not exceed 44. It remains for additional consideration as to the exact value of X, for multiple active BWP, for multiple TRP, for multiple
Petition 870180151482, of 11/14/2018, p. 34/84
11/46 carriers, for multiple bundles, for scheduling based on non-slot and regarding specific numerology X.
[0027] Some additional work arrangements or hypotheses have been made in 3GPP in relation to BD capabilities. Some of these agreements may include: PDCCH candidates who have different DCI load sizes count as separate blind decodings, PDCCH candidates comprised by different sets of CCE (s) count as separate blind decodings, PDCCH candidates in different CORESETs count as decodings separate blind, PDCCH candidates that have the same DCI payload size and are comprised of the same set of CCE (s) in the same CORESET count as a blind decoding.
[0028] It was also agreed that, for non-CA and PDCCH monitoring periodicity of 14 or more symbols, the maximum number of blind PDCCH decodings per slot can be: 44 for SCS = 15 kHz, and less than 44 at least for SCS = 60 kHz and 120 kHz. For a given SCS, all UEs
can bear the number maximum in blind decodings in PDCCH per slot.[0029] For CA com up to N CCs , the maximum number in decodings blind from PDCCH per slot for an UE can
depend on the number of CCs configured. All UEs that support CAs with the same set of CCs can support the same maximum number of PDCCH blind decodings. For CAs with more than N CCs, the maximum number of PDCCH blind decodings for a UE depends on the explicit UE capacity.
[0030] In a given CORESET, two types of search spaces (for example, common EU search space and search space
Petition 870180151482, of 11/14/2018, p. 35/84
12/46 specific search for UE) or even search spaces of the same type may have different periodicity of monitoring occasions for a UE. The details of the corresponding search spaces have yet to be determined. However, in NR, a search space can be called a set of search spaces. A set of the following parameters can determine a set of search spaces: a set of aggregation levels, the number of PDCCH candidates for each aggregation level, and / or the PDCCH monitoring occasion for the set of search spaces . At least for different cases of initial access, to identify a set of search spaces, the following parameters can be configured by EU-specific RRC signaling: the number of PDCCH candidates for each aggregation level of {1, 2, 4, 8, [16]} - a value of {0, 1, 2, 3, 4, 5, 6, 8} candidates, occasion of monitoring PDCCH for the set of search spaces - a value of {1- slot, 2-slot, [5-slot], [10-slot], [20-slot]} (at least 5 values) and / or one or more values of I the symbol, 2 the symbol, ..., 14th symbol in a monitored slot, and each set of search spaces associated with a CORESET configuration by RRC signaling. Although the periodicity is defined by a set of search spaces in NR, the periodicity could be defined by search space corresponding to candidates from a single LA.
[0031] As can be seen from the discussion above, in NR, the UE can be configured to monitor a set of search spaces in a downlink DL CORESET with a certain periodicity, and the UE can be configured to monitor a or multiple sets of
Petition 870180151482, of 11/14/2018, p. 36/84
13/46 search spaces in one or multiple such CORESETs, where each CORESET is possibly configured with different periodicities and / or each set of sets of search spaces is possibly configured with different periodicities for monitoring occasions. For example, a UE can be configured to monitor a first CORESET with 0.5 ms interval (for example, 1 slot with 30 kHz SCS) for eMBB service and a second CORESET with 5 ms interval (for example, 10 slots with 30 kHz SCS) for MTC service. In a similar situation, the same CORESET can be configured with multiple search spaces, search spaces that have different periodicities for monitoring occasions, such as a set of user-specific search spaces with 0.5 ms intervals (for example , 1 slot with 30 kHz SCS) and a set of common user search spaces with a 5 ms periodicity (for example, 10 slots with 30 kHz SCS). There may also be sets of search spaces that are monitored multiple times during a slot, for example, two or seven times per slot. These monitoring occasions can be defined for non-slot based scheduling (mini-slots). An exemplary service using non-slot based scheduling is Ultraconfiably Low Latency Communications (URLLC).
[0032] A problem that arises in monitoring multiple sets of search spaces is that the processing load required for blind searches varies over time. In particular, this processing load may exhibit spikes that may be desired to contain or minimize. In the examples above, such processing spikes can occur at
Petition 870180151482, of 11/14/2018, p. 37/84
14/46 every 5 ms when both CORESETs (or sets of search spaces) need to be monitored simultaneously. In general, it may be desirable to allow excessive reservation of blind decodings (BDs) for periods, since, for most periods, the BDs would be below the maximum allowed. This would allow the dimensioning of BDs in different search spaces and / or sets of search spaces according to the typical number of BDs, instead of the maximum number of BDs.
[0033] Therefore, a modality is configured to manage PDCCH BDs between multiple sets of search spaces or CORESETs. In one embodiment, when it is determined that a UE runs outside a predefined maximum number of BDs (such as 44 BDs / slot), the number of BDs can be reduced to an allowable level. Certain modalities can scale to different situations, such as a different number of search space sets, different number of BD capacity, different combinations of slot-based and non-slot-based scheduling, and / or different combinations of carrier aggregation parts and bandwidth. Additionally, modalities usually involve minimal signage.
[0034] It is observed that, in a single control monitoring occasion, a UE can be configured to monitor through blind searches: one or multiple sets of control resources, one or multiple search spaces in a set of control resources control, one or multiple levels of aggregation (that is, repetition encoding levels or code rates more generally) in a search space, one or multiple
Petition 870180151482, of 11/14/2018, p. 38/84
15/46 decryption candidates (ie, possible resource allocations) per aggregation layer, or one or multiple DCI format sizes (ie DCI load size and message content) per candidate for decoding with one or multiple RNTIs. A blind search can also involve flexible combination (in the case of aggregation levels> 1), demodulation, decoding and user-specific CRC checking.
[0035] In LTE, the set of search spaces is simply called a search space and there is a single CORESET in LTE. The number of candidates per LTE search space is predefined in the 3GPP specifications (for example, in section 9 of 3GPP TS36.213). With user-specific search space (USS), the number of blind searches is (6, 6, 2, 2) with aggregation levels (1, 2, 4, 8). With common search space (CSS), the number of blind searches is (4, 2) with aggregation levels (4, 8). The number of blind searches can scale with the number of DCI format sizes that a UE follows. Typically, 2 USS format sizes and 1 CSS format size. This can typically result in 2x16 + 2x6 = 44 blind decodings.
[0036] However, when configuring multiple CORESETs (or sets of search spaces) with different monitoring intervals, the LTE approach of using a predefined number of blind searches per aggregation level by CORESET (or search space) would result in peak processing loads at times when monitoring occasions occur simultaneously (for example, during the same slot or mini-slot). Therefore, it may be desirable to design methods to contain or reduce
Petition 870180151482, of 11/14/2018, p. 39/84
16/46 blind search processing spikes when monitoring occasions for different CORESETs (or sets of search spaces) coincide. [0037] LTE supports reduction of the reduction is configured from the server cell, by means of PDCCH candidates at level considers the situation to occur in a way to restrict a NR gNB blind decoding (for all periods. However, strict, since the peaks rarely a candidate consequence to PDCCH, however, semi-static way by direct scaling of different aggregation and not that excessive reserve One solution would be at most X
X = 44BDs) throughout the solution can be very BD would only occur would be that the one of de
NR in dynamics.
To set up an example, this UE's BD capacity would be underutilized most of the time. This would create additional PDCCH blocking and reduce the quality of the experience (data rate, latency).
[0038] Certain modalities are directed to the management and / or control of PDCCH blind decodings (BDs) between multiple search spaces or sets of search spaces, or CORESETs. In one embodiment, BD management can include, when a UE reaches the maximum predefined number of BDs / reference time unit (such as 44 BDs / slot), predefined rules are provided for how to reduce the number of BDs to a allowed level. The reference time unit can vary according to multiple slots, OFDM symbols.
with the situation. It can be a slot, or or an OFDM symbol, or multiple
Another option is to determine it in terms of absolute time (such as 0.5 ms). The default rule
Petition 870180151482, of 11/14/2018, p. 40/84
17/46 (or predefined rules) allows the UE (and / or network) to prioritize BDs in different types of search space (such as USS or CSS) and / or sets of search spaces dynamically, in a configurable and well defined.
[0039] In an exemplary modality, each BD candidate (or at least those BD candidates who can be discarded in certain circumstances) can receive a priority number. So, when there is a need to reduce the number of BDs, BDs can be reduced according to the priority number of BD and according to the predefined priorities / rules of type of (set of) search space and / or space of search.
[0040] Some modalities may provide at least two approaches to the reduction of BD. In one approach, DB reduction / disposal can be done together on BDs in multiple search spaces (or set of search spaces, or CORESET). According to another approach, DB reduction / disposal can be performed sequentially in different search spaces (or set of search spaces, or CORESET). According to this approach, BDs can be reduced first from the search space with the lowest priority of (set of) search space, and, if not enough, BDs can also be reduced from the search space with the second priority of (set of) lower search space (and so on). In a
modality, one number maximum reduction of BD (number or %) by space in search (or set of spaces search, or CORESET) can be set to keep The capacity in scheduling in all the spaces of search. This can be one
configuration parameter or can be set by default.
Petition 870180151482, of 11/14/2018, p. 41/84
18/46
For both approaches discussed above, disposal can be based on a defined DB priority number, p P a.
[0041]
So, according to certain modalities, disposal / reduction of BD can be based on the priority number of BD. In one modality, the priority number of BD, pbd, in an aggregation level of the search space (or set of search spaces or CORESET), may depend on the total number of BDs per aggregation level in the search space. According to this approach, a DB priority number can be defined according to the following equation:
Pbd (SS, AL) BC index (SS.AL]
Number of EC-ξ. (55. AL) [0042] where the DB index (SS, AL) is the BD index in a search space or set of search spaces (SS) and at the aggregation level (AL). In one embodiment, the DB index can vary between [1, 2, Number of BDs (SS, AL)], which means that priority numbers vary between 0 and 1 (0 <pbd (SS, AL)> 1) . In addition, it was observed that (SS, AL) represents a priority scheduler, which can be additionally configured.
[0043] In one mode, the order of discarding BD candidates can be defined according to the BD priority number, p P d (SS, AL). For example, the disposal of DB candidates can follow one of the two approaches discussed above in which the disposal can be done jointly by BDs in multiple search spaces (or sets of search spaces) or can be done sequentially in different search spaces (or sets of search spaces). In another modality, the required number of BDs can be
Petition 870180151482, of 11/14/2018, p. 42/84
19/46 discarded according to those with the lowest BD priority number (or numbers). The number needed may depend on the actual number of BDs - the total number of BDs (defined for a given time interval). If multiple BDs have the same BD priority number, then the BD with the lowest (set of) search space priority can be discarded.
[0044] According to some modalities, the priority of (set of) search space can be defined according to different criteria, for example, including: priority order according to aggregation level, priority order between search spaces (or sets of search spaces, or CORESETs), priority order according to the type of BD search space, that is, slot-based operation or non-slot-based operation, priority order according to size of DCI and / or order of priority according to the temporary radio network identifier (RNTI) associated with the set of search spaces.
[0045] Certain modalities can define an order of priority according to the carrier of component and / or part of bandwidth. For example, these criteria can be considered in the following predefined order: (1) AL considered first, (2) scheduling type priority (slot vs. non-slot) considered second, (3) priority set of search spaces considered in third place and (4) priority of carrier of component considered in fourth place.
[0046] Based on what was said above, it can be observed
Petition 870180151482, of 11/14/2018, p. 43/84
20/46 that certain modalities can facilitate an overbooking solution in which the number of BDs / candidates can be reduced to a certain predefined level (allowed) based on a priority number of BD, as well as priorities / rules of (set) de) search space that are followed by both UE (s) and gNB (s). Note that the relationship between PDCCH candidate and BD is given by the number of DCI format size assumptions that a UE is configured to monitor in a single candidate. One modality is aimed at defining two sets of BDs / candidates, one set allowed and one set not allowed. The disallowed set of BDs / candidates can be defined based on the lowest BD / candidate priorities, and in some embodiments, the size of the disallowed set may also be zero. Consequently, in a modality, DB priorities can be defined according to the priorities of (set of) search space and the predefined rules.
[0047] According to certain modalities, the maximum number of BDs may vary according to the situation. For example, in some modalities, the maximum number of BDs can be set separately for different situations, including slot-based scheduling, non-slot-based scheduling (ie, mini-slot scheduling) and slot-based scheduling plus scheduling based on not slot. For slot-based scheduling, the number of BDs can be defined, for example, as X BDs / slot / carrier (or part of bandwidth) for a numerology. For non-slot based scheduling, the number of BDs can be defined, for example, as Y BDs / mini-slot (or symbol)
Petition 870180151482, of 11/14/2018, p. 44/84
21/46 for numerology. For slot-based scheduling plus non-slot-based scheduling, the number of
BDs can be defined, for example, as Z BD / slot for numerology.
In certain modalities, the parameters
X, Y,
Z may depend on the EU category.
[0048]
Fig. 2 illustrates an example block diagram for how to determine the order of disposal of BDs / candidates, according to certain modalities. In this example, it is assumed, for the sake of simplicity, that there is a single DB per candidate. As illustrated in the example in Fig. 2, as shown in 200, BD candidates from an AL receive a BD number (SS, AL) according to the CCE index: 1, 2, ..., BD number ( SS,
AL). In this example, the total number of BD candidates in the set of search spaces is the Number of BDs (SS, AL) = 16 BDs, where there are: (a) 6 BD candidates with AL1, (b) 5 candidates for BD with AL2, (c) 3 candidates for BD with AL4 and (d) 2 candidates for BD with AL8. As shown in 210, the candidate for BD pbd priority number (SS, AL) is computed. The order of disposal can be determined, as shown in 220, based on the priority number, from lowest to highest value. In this example, as shown in 230, 5 BD candidates can be discarded. In one modality, it is assumed that the priority of (set of) search space increases with the level of aggregation. According to this example, discarded candidates 250 are not monitored in any way in the current search space.
[0049] According to one modality, the priorities of (set of) search space can be configured by
RRC. This approach can be used, for example, between
Petition 870180151482, of 11/14/2018, p. 45/84
22/46 different search spaces configured by RRC. Another modality is to define priorities for (set of) search space according to predefined rules. In one embodiment, the predefined rules can be applied only if the priority number for multiple BDs is the same in multiple (sets of) search spaces. For example, the common search space may have a higher priority compared to a specific user search space. An additional or complementary approach may include deriving priorities between different search spaces according to the periodicity of monitoring. For example, a search space with a higher frequency may have a higher priority compared to a search space with a lower priority. In one embodiment, a higher level of aggregation may have a higher priority compared to a lower level of aggregation. In another modality, search spaces involved in non-slot based scheduling may have higher priority compared to slot-based scheduling.
[0050]
In some modalities, the priorities of (set of) search space related to different component carriers can be derived implicitly, for example, based on cell ID.
Similar search space (set of) priorities can also be derived for search spaces related to different parts of bandwidth or
CORESETS. All or some available IDs, such as
CORESET, search space (set of) ID and so on, can be used for prioritization purposes.
[0051] According to other modalities, in addition to
Petition 870180151482, of 11/14/2018, p. 46/84
23/46 search space priorities, it is possible to define or configure that certain BDs are never discarded. For example, in some modalities, it can be defined that CSS is never discarded, and / or it can be defined that certain ALs (such as the highest AL) are never discarded. [0052] In the example in Fig. 2, the priority metric with which the disposal decision is made is given directly by the priority number, a (AL, SS) = 1. Following this principle, predefined rules can be applied in cases where the priority number for multiple BDs is equal in multiple (sets of) search spaces. However, a more generic priority metric may involve weighting factors / vectors to implement the priority of (set of) search space, for example, when applied to ALs, a weighting vector a (ALs, SS) = (1 , 1, 1, 1) would result in equal (set of) search space priorities for ALs (1, 2, 4, 8) while (AL, SS) = (0.8 0.8 1.2 1, 2) it would produce a higher priority of (set of) search space (less chance of discarding) for ALs 4 and 8. In other modalities, instead of discarding, the BDs that have the lowest priority metric and also the BDs with the higher priority metrics can be discarded. This is similar to reducing the number of BDs per AL and can result in a simpler implementation.
[0053] Fig. 3a illustrates an example of an apparatus 10 according to an embodiment. In one embodiment, device 10 can be a node, host or server in a communications network or functioning as a network. For example, handset 10 can be a base station, Node B, a Node B
Petition 870180151482, of 11/14/2018, p. 47/84
Evolved 24/46 (eNB), Node B 5G or access point, next generation Node B (NG-NB or gNB), WLAN access point, mobility management entity (MME), or subscription server associated with a radio access network, such as a GSM network, LTE network, 5G or NR.
[0054] It should be understood that the device 10 can be composed of an edge-cloud server as a distributed computing system in which the server and the radio node can be autonomous devices that communicate with each other through a via radio or through a wired connection, or can be located in the same entity that communicates through a wired connection. It should be noted that a person of ordinary skill in the art would understand that the apparatus 10 may include components or features not shown in Fig. 3a.
[0055] As illustrated in Fig. 3a, the apparatus 10 can include a processor 12 for processing information and executing instructions or operations. Processor 12 can be any type of general purpose or specific processor. In fact, processor 12 can include one or more among general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs), field programmable port arrangements (FPGAs), application specific integrated circuits (ASICs) , and processors based on a multicore processor architecture (multicore), as examples. Although a single processor 12 is shown in Fig. 3a, multiple processors can be used according to other modalities. For example, it should be understood that, in certain embodiments, apparatus 10 may include two or more
Petition 870180151482, of 11/14/2018, p. 48/84
25/46 processors that can form a multiprocessor system (i.e., in this case, processor 12 represents a multiprocessor) that can support multiprocessing. In certain embodiments, the multiprocessor system can be tightly coupled or loosely coupled (for example, to form a cluster of computers).
[0056] Processor 12 can perform functions associated with the operation of the device 10 which may include, for example, pre-coding of antenna gain / phase parameters, coding and decoding of individual bits that form a communication message, formatting information and general control of the device 10, including processes related to the management of communication resources.
[0057] The device 10 can additionally include or be coupled to a memory 14 (internal or external), which can be coupled to the processor 12, to store information and instructions that can be executed by the processor 12. Memory 14 can be one or more memories and of any type suitable for the local application environment, and can be implemented using any suitable volatile or non-volatile data storage technology, such as a semiconductor-based memory device, a magnetic memory system and device , a system and optical memory device, fixed memory and removable memory. For example, memory 14 can be made up of any combination of random access memory (RAM), read-only memory (ROM), static storage, such as a magnetic or optical disk, hard disk drive (HDD), or any other type of non-transitory machine or
Petition 870180151482, of 11/14/2018, p. 49/84
26/46 computer-readable media. Instructions stored in memory 14 may include program instructions or computer program code that, when executed by processor 12, enable apparatus 10 to perform tasks as described herein.
[0058] In one embodiment, device 10 may additionally include or be coupled (internally or externally) to a unit or port that is configured to accept and read an external computer-readable storage medium, such as an optical disc, drive USB, flash drive, or any other storage medium. For example, the external computer-readable storage medium may store a computer program or software for execution by processor 12 and / or apparatus 10.
[0059] In some embodiments, apparatus 10 may also include or be coupled to one or more antennas 15 to transmit and receive signals and / or data to and from apparatus 10. Apparatus 10 may additionally include or be coupled to a transceiver 18 configured to transmit and receive information. Transceiver 18 can include, for example, a plurality of radio interfaces that can be coupled to the antenna (or antennas) 15. Radio interfaces can correspond to a plurality of radio access technologies, including one or more within GSM, NBIoT, LTE, 5G, WLAN, Bluetooth, BT-LE, NFC, radio frequency identifier (RFID), ultra-wideband (UWB), MulteFire, and the like. The radio interface can include components such as filters, converters (for example, digital-to-analog converters and the like), mappers, a Fast Fourier Transform module
Petition 870180151482, of 11/14/2018, p. 50/84
27/46 (FFT), and the like, to generate symbols for a transmission via one or more downlink links and to receive symbols (for example, via an uplink link). As such, transceiver 18 can be configured to modulate information in a carrier waveform for transmission by the antenna (or antennas) 15 and demodulate information received by the antenna (or antennas) 15 for further processing by other elements of the
device 10. In other modalities, transceiver 18 can be capable in transmit and receive signs or Dice directly. [0060] In an mode, memory 14 can store modules in software that provide functionality When
performed by processor 12. The modules can include, for example, an operating system that provides operating system functionality for the device 10. The memory can also store one or more functional modules, such as an application or program, to provide additional functionality for the device 10. Device components 10 can be implemented in hardware, or as any suitable combination of hardware and software.
[0061] In certain modalities, the device 10 can be a network node or RAN node, such as a base station, access point, Node B, eNB, gNB, WLAN access point, or the like. According to certain modalities, the apparatus 10 can be controlled by the memory 14 and the processor 12 to perform the functions associated with any of the modalities described in the present document.
[0062] In one embodiment, device 10 can be controlled by memory 14 and processor 12 to
Petition 870180151482, of 11/14/2018, p. 51/84
28/46 control or manage attempts to blindly decode NR control channel (eg PDCCH) between multiple search spaces or sets of search space (s) or CORESETs based on priorities and / or rules (set of ) predefined search space. According to one embodiment, the device 10 can be controlled by memory 14 and processor 12 to configure multiple search spaces, sets of search spaces, and / or CORESETs, for a UE, which results in monitoring occasions when more BDs are required than the maximum allowed by the user's equipment capacity. It is observed that the maximum number of BDs allowed may vary according to the situation, such as the possibility of the situation being slot based scheduling, non slot based scheduling, or slot based scheduling plus non slot based scheduling.
[0063] In one embodiment, device 10 can also be controlled by memory 14 and processor 12 to identify monitoring occasions for which a permitted number of blind decodings is exceeded, and to determine a reduced set of blind decodings and / or candidates. According to certain modalities, the apparatus 10 can also be controlled by memory 14 and processor 12 to transmit physical downlink control channel (or physical downlink control channels) to the UE that received the reduced set of blind decodings and / or candidates. The reduced set of blind and / or candidate decodings can be determined by the pre-defined search space priorities and / or rules. The priorities
Petition 870180151482, of 11/14/2018, p. 52/84
29/46 and / or predefined (set of) search space rules may include rules configured to dynamically prioritize blind decoding attempts in different multiple search spaces or sets of search spaces or CORESETs.
[0064] For example, in a modality, when the maximum number of blind decoding attempts allowed is reached, the BDs can be reduced according to a priority number assigned to each BD and according to the priorities and / or rules of (set of) predefined search space. In this modality, the priorities and / or rules of (set of) predefined search space may include assigning a priority number to each of the blind decodings and / or candidates that are subjected to the reduction of potential blind decoding, and reducing the number of blind decoding attempts according to the priority number. For example, in a modality, the priorities and / or rules of (set of) predefined search space can be configured to discard the BD (or BDs) with the lowest priority number (or priority numbers) until the allowed level or desired is achieved, that is, until the number of BDs is below the predefined maximum limit of allowed DB attempts. In other modalities, however, predefined search space set priorities and / or rules may include discarding BD (s) with the highest priority number (or priority numbers) until the permitted or desired level is Reached. If multiple BDs have the same priority number, then the BD with the lowest priority of (set of) search space (among BDs with the same priority)
Petition 870180151482, of 11/14/2018, p. 53/84
Priority number) can be discarded.
[0065] In certain embodiments, a priority number in an aggregation level (AL) of the search space (SS) may depend on a total number of blind decoding and / or candidates per aggregation level (AL) in the search space (SS). According to a modality, the priorities and / or rules of (set of) predefined search space may include calculating the priority number according to the following equation:
Pbd (SS, AL) ir -. Irribede BC rSS.AL) to (55, AL Ί ---------——
BC-ξ number (S5.ALJ!
where pbd represents the priority number, the DB index (SS, AL) is the blind decoding index in the search space (SS) and in the aggregation level (AL),
Number of BDs (SS, AL) is number of blind decodings in the search space (SS) at the aggregation level (AL), and (SS, AL) is a priority scheduler.
In an exemplary modality, the DB index can vary between [1, 2,
Number of BDs (SS, AL)], which means that priority numbers would vary between 0 and 1 (0 <pbd (SS, AL)> 1).
[0066]
In certain embodiments, the predefined search space priorities and / or rules may include defining the search space priority order according to one or more of the following criteria: aggregation level, search spaces or sets search spaces or
CORESETs, type of BD search space (based on non-slot), DCI size, and / or RNTI in slot, associated with the search space. According to some modalities, the priorities and / or rules of (set of) predefined search space may include disposal of BDs in the UE based on
Petition 870180151482, of 11/14/2018, p. 54/84
31/46 in an order of priority according to the component carrier and / or part bandwidth, for example, in the following order: (1) aggregation level, (2) schedule type, (3) set search spaces and (4) component carrier.
[0067] Fig. 3b illustrates an example of an apparatus 20 according to another embodiment. In one embodiment, the apparatus 20 may be a node or element in a communications network or associated with such a network, such as a UE, mobile equipment (ME), mobile station, mobile device, stationary device, IoT device, or other device. As described in this document, the UE may alternatively be called, for example, a mobile station, mobile equipment, mobile unit, mobile device, user device, subscriber station, wireless terminal, tablet, smartphone, IoT device or IoT device of NB, or similar. As an example, apparatus 20 can be implemented, for example, in a portable wireless device, a wireless plug-in accessory, or the like.
[0068] In some exemplary embodiments, apparatus 20 may include one or more processors, one or more computer-readable storage media (for example, memory, storage, and the like), one or more radio access components (for example , a modem, a transceiver and the like), and / or a user interface. In some modalities, the device 20 can be configured to operate using one or more radio access technologies, such as GSM, LTE, LTE-A, NR, 5G, WLAN, WiFi, NB-IoT, Bluetooth, NFC, MulteFire, and any other radio access technologies. It should be noted that a person of
Petition 870180151482, of 11/14/2018, p. 55/84
32/46 common skill in the art would understand that the apparatus 20 may include components or features not shown in Fig. 3b.
[0069] As illustrated in Fig. 3b, the apparatus 20 may include or be coupled to a processor 22 to process information and execute instructions or operations. Processor 22 can be any type of general purpose or specific processor. In fact, processor 22 may include one or more among general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs), field programmable port arrangements (FPGAs), application specific integrated circuits (ASICs) , and processors based on a multicore processor architecture (multicore), as examples. Although a single processor 22 is shown in Fig. 3b, multiple processors can be used according to other modalities. For example, it should be understood that, in certain embodiments, apparatus 20 may include two or more processors that can form a multiprocessor system (i.e., in this case, processor 22 represents a multiprocessor) that can support multiprocessing. In certain embodiments, the multiprocessor system can be tightly coupled or loosely coupled (for example, to form a cluster of computers).
[0070] Processor 22 can perform functions associated with the operation of apparatus 20, including, without limitation, pre-coding of antenna gain / phase parameters, coding and decoding of individual bits that form a communication message, information formatting and
Petition 870180151482, of 11/14/2018, p. 56/84
33/46 general control of the device 20, including processes related to the management of communication resources. [0071] The device 20 can additionally include or be coupled to a memory 24 (internal or external), which can be coupled to processor 22, to store information and instructions that can be executed by processor 22. Memory 2 4 can be a or more memories and of any type suitable for the local application environment, and can be implemented using any suitable volatile or non-volatile data storage technology, such as a semiconductor-based memory device, system and memory device magnetic, an optical memory system and device, fixed memory and removable memory. For example, memory 24 may consist of any combination of random access memory (RAM), read-only memory (ROM), static storage, such as a magnetic or optical disk, or any other type of non-transitory machine or readable means per computer. Instructions stored in memory 24 may include program instructions or computer program code that, when executed by processor 22, enable apparatus 20 to perform tasks as described herein.
[0072] In one embodiment, device 20 may additionally include or be coupled (internally or externally) to a drive or port that is configured to accept and read an external computer-readable storage medium, such as an optical disc, drive USB, flash drive, or any other storage medium. For example, the external computer-readable storage medium can
Petition 870180151482, of 11/14/2018, p. 57/84
34/46
store one program in computer or software for execution fur processor 22 and / or device 20.[0073] In some modalities, appliance 20 too can include or be coupled The an or more antennas 25 for
receiving a downlink signal and for transmitting via an uplink of the apparatus 20. The apparatus 20 may additionally include a transceiver 28 configured to transmit and receive information. Transceiver 28 may also include a radio interface (for example, a modem) coupled to antenna 25. The radio interface can correspond to a plurality of radio access technologies, including one or more among GSM, LTE,
LTE-A, 5G, NR, WLAN, NB-IoT,
Bluetooth, BT-LE, NFC, RFID,
UWB, and the like. The radio interface can include other components, such as filters, converters (for example, similar digital-to-analog converters), symbol mappers, signal shaping components, a
Inverse Fourier (IFFT), and OFDMA, similar, to process symbols, such as symbols transmitted by a downlink or an uplink.
[0074] For example, transceiver 28 can be configured to modulate information in a carrier waveform for transmission by the antenna (or antennas) 25 and demodulate information received by the antenna (or antennas) 25 for further processing by other elements of the device 20. In other embodiments, transceiver 28 may be able to transmit and receive signals or data directly. The apparatus 20 may additionally include a user interface, such as a graphical user interface
Petition 870180151482, of 11/14/2018, p. 58/84
35/46 or touch screen.
[0075] In one embodiment, memory 24 stores software modules that provide functionality when executed by processor 22. The modules may include, for example, an operating system that provides operating system functionality for the device 20. The memory can also store one or more functional modules, such as an application or program, to provide additional functionality for the device 20. The device components 20 can be implemented in hardware, or as any suitable combination of hardware and software. According to one embodiment, the device 20 can be configured to communicate with the device 10 via a wired or wireless communications link 70 according to any radio access technology, such as NR.
[0076] According to an embodiment, the device 20 can be a UE, mobile device, mobile station, ME, IoT device and / or NB IoT device, for example. According to certain modalities, the apparatus 20 can be controlled by the memory 24 and the processor 22 to perform the functions associated with modalities described in the present document. For example, in some embodiments, the apparatus 20 can be configured to perform one or more of the processes shown in any of the flowcharts or signaling diagrams described in this document. According to one embodiment, the apparatus 20 can be controlled by memory 24 and processor 22 to make attempts to blindly decode NR control channels (e.g., PDCCH) between multiple search spaces or sets of search space (s ) or CORESETs with
Petition 870180151482, of 11/14/2018, p. 59/84
36/46 based on predefined (set of) search space priorities and / or rules.
In one embodiment, as will be discussed in more detail below, when a predefined maximum number of blind decoding attempts has been reached, the device 20 can be controlled by memory and the processor to reduce the number of decodings to a permitted level of BDs according to blind to pre-defined search space priorities and / or rules.
[0077]
For example, in one modality, the device can be controlled by memory 24 and the processor to receive configuration of BDs and / or candidates in multiple search spaces, sets of search spaces and / or CORESETs, in which several results in Monitoring occasions for necessary blind decoding exceed a device's capacity. According to one embodiment, the device 20 can then be controlled by memory 24 and the processor to identify monitoring occasions for which the device's blind decoding capacity is exceeded and to reduce the set of blind or candidate decodings in cm. based on predefined (set of) search space priorities and / or rules.
In one embodiment, the apparatus is additionally via memory 24 and can be controlled by processor 22 to receive PDCCH (s) that received the reduced set of blind or candidate decodings.
[0078]
In one embodiment, when it is determined that the number of required blind decodings exceeds the maximum BD capacity of the device 20, the device 20 can be controlled by memory 24 and processor 22 for
Petition 870180151482, of 11/14/2018, p. 60/84
37/46 reduce the number of blind decoding attempts according to a priority number assigned to each DB and according to the predefined search space set (and priorities) rules. In this modality, the priorities and / or rules of (set of) predefined search space may include assigning each blind decoding candidate a priority number, and the device 20 can be controlled by memory 24 and processor 22 to reduce the number of BDs according to the priority number assigned. For example, in one embodiment, apparatus 20 can be controlled by memory 24 and processor 22 to discard BD (s) with the lowest priority number (or priority numbers) until the permitted or desired level is reached, that is, , until the number of BDs is below the maximum allowed DB attempts according to the capacity of the device 20. According to this modality, the device 20 can be controlled by memory 24 and processor 22 to discard blind decoding attempts with the lowest priority numbers until the permitted level of blind decoding is achieved. In other embodiments, however, apparatus 20 can be controlled by memory 24 and processor 22 to discard BD (s) with the highest priority number (or priority numbers) until the permitted or desired level is reached. If multiple BDs have the same priority number, then the predefined (set of) search space priorities and / or rules may include discarding the BD with the lowest priority of (set of) search space (among the BDs with the priority number).
Petition 870180151482, of 11/14/2018, p. 61/84
38/46 [0079] In certain embodiments, a priority number in an AL of the SS may depend on a total number of blind decodings per AL in the SS. According to a modality, the priorities and / or rules of (set of) predefined search space may include calculating the priority number according to the following equation:
pbd (SS, AL)
Indisede BC tSS.AL)
BC-ξ number. tSS.AL) where pbd represents the priority number, the BD index (SS, AL) is the blind decoding index in SS and AL, Number of BDs (SS, AL) is the number of blind decodings in SS and in AL, and (SS, AL) is a priority scheduler. In an exemplary modality, the index of
BD can vary between [1, 2, Number of BDs (SS, AL)], which means that priority numbers would vary between 0 and 1 (0 <pbd (SS, AL)> 1).
[0080] According to some modalities, the device 20 can be controlled by memory 24 and processor 22 to reduce the number of BDs jointly by the BDs in the multiple search spaces or sets of search spaces or CORESETs. In other embodiments, the apparatus 20 can be controlled by memory 24 and processor 22 to
reduce O number in BDs sequentially in many different spaces in search or sets of search or CORESETs in wake up with an space priority search.
According to this sequential approach, BDs can be reduced first from the search space with the lowest priority of (set of) search space, and, if not enough, BDs can also be reduced from the search space with the second priority of (set
Petition 870180151482, of 11/14/2018, p. 62/84
39/46 de) lower search space, and so on. In one modality, a maximum number or percentage of BDs that can be discarded by search space or set of search spaces or CORESET can be defined to maintain the scheduling capacity in all search spaces. In both, the configuration in which the reduction is made
jointly or the configuration sequentially, the discard or based in the number in discussed above.
[0081] In certain modalities, from (set of) search space the order of space priority or more of the following criteria:
in which the reduction and reduction of BDs can be a priority of BD, as the priorities and / or predefined rules can define search according to an aggregation level, search spaces or sets of search space (or search spaces) or CORESETs, type of BD search space (slot based, non-slot based), DCI size, and / or RNTI associated with the search space. According to some modalities, the priorities and / or rules of (set of) predefined search space may include and define the order of priority according to the component carrier and / or part of bandwidth, for example, in order next: (1) level of aggregation, (2) type of scheduling, (3) set of search spaces and (4) carrier of component. Then, in this embodiment, the apparatus 20 can be controlled by memory 24 and processor 22 to discard BDs based on the predefined order of priority. [0082] Fig. 4a illustrates an exemplary flowchart of a method for controlling or managing attempts to blindly decode NR control channels (for example,
Petition 870180151482, of 11/14/2018, p. 63/84
40/46
PDCCH) between multiple search spaces or sets of search spaces or CORESETs based on priorities and / or rules of (set of) predefined search space, according to an exemplary modality. In one embodiment, the method can be performed by a network node, such as a base station, eNB, gNB, relay node or access node, for example. In one embodiment, the method in Fig. 4a may include, in 400, configuring multiple search spaces, sets of search space (s), and / or CORESETs, for a UE, which results in monitoring occasions when more BDs are required than allowed by an UE capacity. The method can then include, in 405, identifying the monitoring occasions for which a permitted number of BDs is exceeded, and, in 408, determining a reduced set of blind and / or candidate decodings. The method may then, in 410, transmit PDCCH (s) to the UE in the reduced set of blind and / or candidate decodings. The reduced set of blind and / or candidate decodings can be determined by the search space priorities and / or predefined rules, as discussed in detail above.
[0083] Fig. 4b illustrates an exemplary flowchart of a method for performing blind NR control channel decodings (eg, PDCCH) between multiple search spaces, search space sets (s), or CORESETs based on priorities and / or rules for (set of) predefined search space, according to a modality. In one embodiment, the method of Fig. 4b can be performed by a UE or mobile station, for example. The method of Fig. 4b can include, in 420, receiving configuration of BDs or candidates
Petition 870180151482, of 11/14/2018, p. 64/84
41/46
in multiples spaces in search, sets of spaces in search or CORESETs, O what results in occasions in monitoring on what one number of BDs needed exceeds
an EU capacity. The method may then include, in 425, identifying the monitoring occasions for which the UE's DB capacity is exceeded and reducing the set of blind / candidate decodings based on search space priorities and / or predefined rules. The method may also include, at 430, receiving PDCCH (s) that received the reduced set of blind / candidate decodings.
[0084] Fig. 4c illustrates an exemplary flowchart of a method for reducing blind NR control channel decodings (eg, PDCCH) between multiple search spaces, search space sets (s), or CORESETs according to priorities and / or rules for (set of) predefined search space, according to an exemplary modality. The method of Fig. 4c can be started at 440 and, at 450, it can include assigning a priority number to each BD and / or candidate. In 455, the method may include determining whether the configuration of multiple search spaces, sets of search space (s) or CORESETs will result in monitoring occasions when more BDs are needed than allowed by a UE capability. If positive, the method may include, in 4 60, reducing the number of DB attempts to a permitted level of BDs that is within the capacity of the UE according to the priorities and / or rules of (set of) predefined search space . The predefined search space priorities and / or rules may include rules configured to dynamically prioritize the database (s) in
Petition 870180151482, of 11/14/2018, p. 65/84
42/46 different multiple search spaces or sets of search spaces or CORESETs. If it is determined, in 455, that the BD capacity of the UE is not exceeded, then the method can go back to the beginning 440.
[0085] For example, in one embodiment, when it is determined that the UE's DB capacity is exceeded, step 4 60 of reducing the number of DB attempts may include discarding BDs based on the priority number assigned to each DB and according to the predefined search space set priorities and / or rules. For example, in one mode, disposal may include disposal of BD (s) with the lowest priority number (or priority numbers) until the permitted or desired level is reached, that is, until the number of BDs is below the predefined maximum limit of allowed DB attempts. In other modalities, disposal may include disposal of BD (s) with the highest priority number (or priority numbers) until the permitted or desired level is reached. It should be noted that assignment step 450 can be optional and, in certain modalities, can be performed before or after determination step 455.
[0086] Therefore, the modalities of the invention provide several improvements, improvements and / or technical advantages. For example, as a result of certain modalities, the processing load can be reduced. The modalities can facilitate an excessive reservation solution applicable to the NR situation, can scale to any NR situation, involve a minimum amount of RRC signaling and can even be done without
Petition 870180151482, of 11/14/2018, p. 66/84
43/46 any RRC signaling. In addition, according to certain modalities, the computational complexity is small. The blind decoding (or blind decoding) to be discarded can be defined beforehand or can be determined in a semi-static manner; and discarding blind decoding (or blind decoding) can be done in such a way that all levels of aggregation are available for scheduling. As such, the embodiments of the invention can improve the performance and throughput of network nodes, including, for example, base stations / eNBs / gNBs and UEs. Consequently, the use of modalities of the invention results in improved functioning of communications networks and their nodes.
[0087] In some embodiments, the functionality of any of the methods, processes, signaling diagrams, or flowcharts described in this document can be implemented by software and / or computer program code or portions of code stored in memory or other means tangible or computer readable, and
performed by a processor. [0088] In some modalities, one device can be included or associated with at least an application of
software, module, unit or entity configured as arithmetic operation (or arithmetic operations), or as a program or portions thereof (including an added or updated software routine), performed by at least one operation processor. Programs, also called program products or computer programs, including software routines, applets and macros, can be stored on any data storage medium
Petition 870180151482, of 11/14/2018, p. 67/84
44/46 readable by device and include program instructions to perform particular tasks.
[0089] A computer program product may comprise one or more executable components per computer which, when the program is executed, are configured to carry out the modalities. The one or more computer executable components can be at least one software code or portions of it. Modifications and configurations necessary to implement the functionality of a modality can be performed as a routine (or routines), which can be implemented as an added or updated software routine (or routines). The software routine (or routines) can be downloaded to the device.
[0090] The software or a computer program code or portions thereof may be in a form of source code, form of object code or in some intermediate form, and may be stored in some type of carrier, means of distribution or computer-readable medium, which can be any entity or device capable of downloading the program. Such carriers include a recording medium, computer memory, read-only memory, photoelectric and / or electrical carrier signal, telecommunications signal and software distribution package, for example. Depending on the processing power required, the computer program can be run on a single electronic digital computer or can be distributed among several computers. The computer-readable medium or computer-readable storage medium may be a non-computer
Petition 870180151482, of 11/14/2018, p. 68/84
45/46 transient.
[0091] In other modalities, the functionality can be performed by hardware or set of circuits included in a device (for example, device 10 or device 20), for example, through the use of an application specific integrated circuit (ASIC), a programmable port arrangement (PGA), a field programmable port arrangement (FPGA) or any other combination of hardware and software. In yet another modality, the functionality can be implemented as a signal, a non-tangible medium that can be transferred by an electromagnetic signal downloaded from the Internet or another network.
[0092] According to a modality, a device, such as a node, device or a corresponding component, can be configured as a circuitry, a computer or a microprocessor, as a single chip computer element, or as a chipset, including at least one memory to provide storage capacity used for arithmetic operation and an operation processor to perform arithmetic operation.
[0093] A person of ordinary skill in the art will readily understand that the invention as discussed above can be practiced with steps in a different order, and / or with elements other than those of hardware in configurations that are being revealed. Therefore, although the invention has been described on the basis of these preferred embodiments, it would be apparent to those skilled in the art that certain modifications, variations, alternative constructions would be apparent, while remaining in the spirit and scope of the invention.
In order to determine the
Petition 870180151482, of 11/14/2018, p. 69/84
46/46 limitations of the invention, therefore, reference should be made to the appended claims.
权利要求:
Claims (8)
[1]
1. Method characterized by understanding:
configure, through a network node, multiple search spaces, sets of search spaces and / or sets of control resources, for a user's equipment, which results in monitoring occasions when blinder decoding is needed than the allowed by the capacity of the user's equipment;
identify the monitoring occasions for which a permitted number of blind decodings is exceeded;
determine a reduced set of blind and / or candidate decodings, where the reduced set of blind and / or candidate decodings are determined by predefined priorities or search space rules;
transmitting the downlink control channel (or downlink control channels) to the user equipment that received the reduced set.
[2]
2/8 blind than allowed by the capacity of the user's equipment;
identify the monitoring occasions for which a permitted number of blind decodings is exceeded;
determine a reduced set of blind and / or candidate decodings, where the reduced set of blind and / or candidate decodings are determined by predefined priorities or search space rules;
transmit the physical downlink control channel (or physical downlink control channels) to the user equipment that received the reduced set.
2. Apparatus characterized by comprising:
at least one processor; and at least one memory comprising computer program code, at least one memory and computer program code are configured, with at least one processor, to induce the device to at least configure multiple search spaces, sets of search spaces and / or control feature sets for user equipment, resulting in monitoring occasions when more decodings are needed
Petition 870180151482, of 11/14/2018, p. 71/84
[3]
3/8 priority until the permitted level of blind decoding is reached.
3. Apparatus, according to claim 2, characterized by the fact that the predefined search space priorities or rules comprise rules configured to prioritize blind decoding attempts in different said multiple search spaces or sets of search spaces.
[4]
4/8 according to type of set of blind decoding search spaces, priority order according to downlink control information (DCI) size, or priority order according to temporary radio network identifier (RNTI) associated with the search space; and in which the predefined search space priorities or rules additionally comprise the disposal of blind decodings on the user's equipment based on an order of priority according to the component carrier and / or part of bandwidth in the following predefined order: (1) levels of aggregation, (2) types of
scheduling, (3) sets in spaces search and (4) carriers of component. 10. Apparatus, according with the claim 2, featured by the fact in that capacity in
Blind decoding of user equipment is determined by time interval and identification of monitoring occasions is done by time interval.
11. Method characterized by understanding:
receive, through user equipment, configuration of blind and / or candidate decodings in multiple search spaces, sets of search spaces and / or sets of control resources, which results in monitoring occasions when several blind decodings are necessary exceed a capacity of the user's equipment;
identify the monitoring occasions for which the user's equipment's blind decoding capacity is exceeded and reduce the decoding set
Petition 870180151482, of 11/14/2018, p. 74/84
4. Apparatus, according to claim 2, characterized by the fact that the predefined search space priorities or rules comprise:
assign a priority number to each of the blind decoding and / or candidates that are subjected to the reduction of potential blind decoding; and reduce the number of blind decodings according to the priority number.
[5]
5/8 blind and / or candidates based on predefined search space priorities or rules; and
to receive, fur equipment the user, the channel in control in link downward physical (or channels in control in link downward physical) that has received O
reduced set of blind or candidate decodings.
12. Apparatus characterized by comprising: at least one processor; and
at least one memory what comprises code in computer program, at least one memory it's the code of program in computer are configured, with the hair any less one processor, to induce the device at least The receive the configuration of decodings blind and / or
candidates in multiple search spaces, sets of search spaces and / or sets of control resources, which results in monitoring occasions when several necessary blind decodings exceed a device's capacity;
identify the monitoring occasions for which the device's blind decoding capacity is exceeded and reduce the set of blind and / or candidate decodings based on predefined search space rules or priorities; and receiving the physical downlink control channel (or physical downlink control channels) that received the reduced set of blind and / or candidate decodings.
13. Apparatus, according to claim 12, characterized by the fact that the priorities or rules of
Petition 870180151482, of 11/14/2018, p. 75/84
5. Apparatus, according to claim 4, characterized by the fact that the predefined search space priorities or rules additionally include the disposal of blind decodings with the lowest numbers of
Petition 870180151482, of 11/14/2018, p. 72/84
[6]
6/8 predefined search spaces comprise rules configured to prioritize blind decodings in different said multiple search spaces or sets of search spaces.
14. Apparatus, according to claim 12, characterized by the fact that the predefined search space priorities or requirements include:
assign a priority number to each of the specific decodings and / or candidates that are subjected to the reduction of potential blind decoding; and reduce the number of blind decodings according to the priority number.
15. Apparatus, according to claim 14, characterized by the fact that the predefined search space priorities or rules additionally comprise the disposal of blind decodings with the lowest priority numbers until the permitted level of blind decodings is reached.
16. Apparatus according to claim 13, characterized by the fact that the apparatus is configured to reduce the number of blind decodings together through blind decodings in said multiple search spaces, sets of search spaces and / or sets of resources control, or where the device is configured to reduce the number of blind decodings sequentially in different search spaces, sets of search spaces, and / or sets of control features according to the search space priority.
17. Apparatus according to claim 14,
Petition 870180151482, of 11/14/2018, p. 76/84 characterized by the fact that the priority number in an aggregation level (AL) of a search space (SS) depends on a total number of blind decodings per aggregation level (AL) in the search space (SS) .
Apparatus according to claim 14, characterized in that it further comprises calculating the priority number according to the following equation:
Pbd (S S, AL)
Index of BDÇSS.AL]
BC-b number fSS.AL] where pbd represents the priority number, the BD index (SS, AL) is the blind decoding index in the search space (SS) and at the aggregation level (AL), Number BDs (SS, AL) is the number of blind decodings in the search space (SS) and at the aggregation level (AL), and (SS, AL) is a priority scheduler.
19. Apparatus according to claim 14, characterized by the fact that, when multiple blind decodings have the same priority number, the predefined search space priorities or rules additionally include discarding attempts to decode blind the space priority lower search.
20. Apparatus according to claim 13, characterized by the fact that an order of priority of the search space is defined according to at least one of the following criteria: order of priority according to aggregation level, order of priority between said sets of search spaces, priority order according to type of set of blind decoding search spaces, priority order according to
Petition 870180151482, of 11/14/2018, p. 77/84
6. Apparatus, according to claim 4, characterized by the fact that the priority number in an aggregation level (AL) of the search space (SS) depends on a total number of blind decodings per aggregation level (AL) in the search space (SS).
[7]
7. Apparatus, according to claim 4, characterized by the fact that the priority number is calculated according to the following equation:
Pbd (SS, AL)
Indisede BDtSS.AL) Number of BC-b (55.AL) where pbd represents the priority number, the BD index (SS, AL) is the blind decoding index in a search space (SS) and in aggregation level (AL), Number of BDs (SS, AL) is the number of blind decodings in the search space (SS) and aggregation level (AL), and (SS, AL) is a priority scheduler .
8. Apparatus according to claim 4, characterized by the fact that, when multiple blind decodings have the same priority number, the predefined search space priorities or rules additionally comprise discarding the blind decoding the search space priority lower.
9. Apparatus according to claim 2, characterized by the fact that an order of search space priority is defined according to at least one of the following criteria: priority order according to aggregation level, priority order between said sets of search spaces, order of priority of search
Petition 870180151482, of 11/14/2018, p. 73/84
[8]
8/8 size of downlink control information (DCI), or priority order according to temporary radio network identifier (RNTI) associated with the search space; or where the predefined search space priorities or rules further comprise the disposal of blind decodings on the user's equipment based on an order of priority according to the component carrier and / or part of bandwidth in the following predefined order: (1) aggregation levels, (2) types of scheduling, (3) sets of search spaces and (4) component carriers.
类似技术:
公开号 | 公开日 | 专利标题
BR102018073485A2|2019-06-04|MANAGEMENT OF BLIND SEARCHS OF CONTROL CHANNELS BETWEEN SEARCH SPACES IN NEW RADIO
US20190215098A1|2019-07-11|Apparatuses and methods for managing blind searches
US10404432B2|2019-09-03|Methods and apparatuses for physical resource block bundling size configuration
JPWO2019021488A1|2020-07-16|User terminal, base station apparatus, and wireless communication method
EP3661282A1|2020-06-03|User terminal and radio communication method
US11070334B2|2021-07-20|User terminal and radio communication method
US20200022119A1|2020-01-16|Channel Transmission Method And Network Device
BR112019015853A2|2020-04-14|user terminal and radiocommunication method
US10880909B2|2020-12-29|Data transmission method and apparatus
BR112019019000A2|2020-04-14|method of setting transmission direction, device, and system
BR112020007821A2|2020-10-20|downlink control information transmission method, method for obtaining amount of blind detection times, terminal device, network device, device and chip
US10498503B2|2019-12-03|Multi-cast resource allocation by aggregation level
BR112019026709A2|2020-06-30|terminal and radio communication method for a terminal
US20210084637A1|2021-03-18|Channel monitoring with complexity constraints
JPWO2020053942A1|2021-08-30|Terminals, wireless communication methods, base stations and systems
US11252721B2|2022-02-15|Slot format indication to a UE group in a cell of a base station
BR112020006377A2|2020-09-24|methods of configuring monitoring occasions for use on a network node of a wireless communication network and monitoring signals for use on a wireless device, a network node capable of configuring monitoring occasions on a wireless communication network wireless, and, wireless device capable of monitoring signals on a wireless communication network.
BR112019019196A2|2020-04-22|base station, terminal and radio communication method
RU2746019C1|2021-04-06|User terminal and radio communication method
US20210058908A1|2021-02-25|Wireless communication block interleaving
JPWO2020053943A1|2021-09-02|Terminals, wireless communication methods and systems
WO2019064537A1|2019-04-04|User terminal and radio communication method
同族专利:
公开号 | 公开日
RU2690695C1|2019-06-05|
US20190150073A1|2019-05-16|
EP3487110A1|2019-05-22|
CN109802758B|2021-12-28|
CN109802758A|2019-05-24|
US11191011B2|2021-11-30|
引用文献:
公开号 | 申请日 | 公开日 | 申请人 | 专利标题

CN101119277A|2006-08-03|2008-02-06|北京三星通信技术研究有限公司|Device and method for transmitting control signalling|
CN101389106B|2007-09-11|2012-11-14|中兴通讯股份有限公司|Control channel resource allocation and blind detection method|
CN101841892B|2009-03-18|2012-10-03|中国移动通信集团公司|Method, equipment and system for indicating and detecting PDCCH in a carrier aggregation system|
WO2010145532A1|2009-06-16|2010-12-23|华为技术有限公司|Method for mapping control channel, method for detecting control channel and device thereof|
CN102801503B|2009-08-13|2015-08-19|华为技术有限公司|The method and apparatus that the method that control channel maps, control channel detect|
CN101699901B|2009-09-28|2012-08-08|上海华为技术有限公司|Method and device for optimizing search space of user equipment|
CN102783064B|2010-03-11|2016-07-06|Lg电子株式会社|Control method for channel allocation and device|
EP2512051B1|2010-03-30|2020-01-01|LG Electronics Inc.|Method and apparatus for monitoring control channel in a wireless communication system|
TW201208436A|2010-05-26|2012-02-16|Ind Tech Res Inst|Control channel allocation method, control channel searching method and communication apparatus using the same|
JP5726189B2|2010-07-21|2015-05-27|パナソニック インテレクチュアル プロパティ コーポレーション オブアメリカPanasonic Intellectual Property Corporation of America|Terminal device, receiving method, and integrated circuit|
SG194059A1|2011-04-01|2013-11-29|Interdigital Patent Holdings|Method and apparatus for controlling connectivity to a network|
CN102904669B|2011-07-29|2016-05-18|上海贝尔股份有限公司|Precoding Physical Downlink Control Channel reference signal and blind interpretation method and device|
US9253770B2|2011-08-18|2016-02-02|Lg Electronics Inc.|Method for allocating a control channel and apparatus therefor|
US9445409B2|2012-03-21|2016-09-13|Mediatek, Inc.|Method for search space configuration of enhanced physical downlink control channel|
US20140013342A1|2012-07-05|2014-01-09|Comcast Cable Communications, Llc|Media Content Redirection|
EP2693677A1|2012-08-02|2014-02-05|Fujitsu Limited|E-PDCCH for LTE Advanced wireless communication|
US10306610B2|2012-10-23|2019-05-28|Lg Electronics Inc.|Method for receiving control information in wireless communication system and apparatus therefor|
US9270440B2|2012-11-02|2016-02-23|Qualcomm Incorporated|Processing overlapping EPDCCH resource sets|
US9681256B2|2014-03-15|2017-06-13|Sierra Wireless, Inc.|Abbreviated blind detection in wireless communication systems including LTE|
CN107295685B|2016-04-01|2020-11-10|上海诺基亚贝尔股份有限公司|Method and apparatus for transmitting short enhanced physical downlink control channel|US10897753B2|2017-05-04|2021-01-19|Sharp Kabushiki Kaisha|Systems and methods for supporting multiple allocations in UL/DL grant for a 5G NR UE and gNB|
US10687324B2|2017-10-02|2020-06-16|Telefonaktiebolaget Lm Ericsson |PDCCH monitoring periodicity|
CN109802732B|2017-11-17|2021-02-12|华为技术有限公司|Monitoring method and related device for downlink control channel|
US10660020B2|2017-12-20|2020-05-19|Qualcomm Incorporated|Search space set combining and dropping|
EP3706356A4|2018-01-18|2021-02-24|LG Electronics Inc.|Method for transmitting and receiving downlink signals between terminal and base station in wireless communication system supporting unlicensed band, and device supporting same|
CN110166191B|2018-02-11|2021-01-08|维沃移动通信有限公司|Method and device for determining monitoring information of search space|
US11233688B2|2018-02-23|2022-01-25|Qualcomm Incorporated|Physical downlink control channelaggregation leveldesign for new radioultra-reliable low latency communication |
US10993216B2|2018-04-06|2021-04-27|Intel Corporation|Flexible slot format indicationmonitoring for new radio unlicensed communications|
US11212736B2|2018-04-06|2021-12-28|Qualcomm Incorporated|Search space design with overbooking|
US11265128B2|2018-04-30|2022-03-01|Qualcomm Incorporated|Search space set occasion level mapping for PDCCH overbooking|
US11252748B2|2018-05-07|2022-02-15|Qualcomm Incorporated|System information for access and backhaul|
US11032824B2|2018-11-02|2021-06-08|Qualcomm Incorporated|Downlink control channel monitoring capabilities|
US10887839B2|2019-03-29|2021-01-05|Qualcomm Incorporated|Search space set for wakeup signal|
CN112311498A|2019-08-02|2021-02-02|大唐移动通信设备有限公司|Terminal capability processing method and device, network side equipment and terminal|
CN112399584A|2019-08-16|2021-02-23|华为技术有限公司|Communication method, device and storage medium|
CN111314035A|2020-01-20|2020-06-19|北京紫光展锐通信技术有限公司|PDCCH monitoring method, device, user equipment and storage medium|
WO2022016521A1|2020-07-24|2022-01-27|Qualcomm Incorporated|Search space configuration for new radio multicast|
CN111935823B|2020-08-04|2021-08-10|苏州智铸通信科技股份有限公司|Adaptive adjustment method, device, base station and storage medium for downlink control channel resources|
法律状态:
2019-06-04| B03A| Publication of a patent application or of a certificate of addition of invention [chapter 3.1 patent gazette]|
优先权:
申请号 | 申请日 | 专利标题
US15/815,106|US11191011B2|2017-11-16|2017-11-16|Managing control channel blind searches between search spaces in new radio|
US15/815,106|2017-11-16|
[返回顶部]