Processing

Please wait...

Settings

Settings

Goto Application

1. WO2021062703 - SYSTEMS AND METHODS FOR DETERMINING PARAMETERS FOR UPLINK AND DOWNLINK TRANSMISSIONS IN WIRELESS COMMUNICATION NETWORKS

Document

Description

Title of Invention 0001   0002   0003   0004   0005   0006   0007   0008   0009   0010   0011   0012   0013   0014   0015   0016   0017   0018   0019   0020   0021   0022   0023   0024   0025   0026   0027   0028   0029   0030   0031   0032   0033   0034   0035   0036   0037   0038   0039   0040   0041   0042   0043   0044   0045   0046   0047   0048   0049   0050   0051   0052   0053   0054   0055   0056   0057   0058   0059   0060   0061   0062   0063   0064   0065   0066   0067   0068   0069   0070   0071   0072   0073   0074   0075   0076   0077   0078   0079   0080   0081   0082   0083   0084   0085   0086   0087   0088   0089   0090   0091   0092   0093   0094   0095   0096   0097   0098   0099   0100   0101   0102   0103   0104   0105   0106   0107   0108   0109   0110   0111   0112   0113   0114   0115   0116   0117   0118   0119   0120   0121   0122   0123   0124   0125   0126   0127   0128   0129   0130   0131   0132   0133   0134   0135   0136   0137   0138   0139   0140   0141   0142   0143   0144   0145   0146   0147   0148   0149   0150   0151   0152   0153   0154   0155   0156   0157   0158   0159   0160   0161   0162   0163   0164   0165   0166   0167   0168   0169   0170   0171   0172   0173   0174   0175   0176   0177   0178   0179   0180   0181   0182   0183   0184   0185   0186   0187   0188   0189   0190   0191  

Claims

1   2   3   4   5   6   7   8   9   10   11   12   13   14   15   16   17   18   19   20   21   22   23   24   25   26   27   28   29   30   31  

Drawings

1   2   3   4   5   6   7   8   9  

Description

Title of Invention : SYSTEMS AND METHODS FOR DETERMINING PARAMETERS FOR UPLINK AND DOWNLINK TRANSMISSIONS IN WIRELESS COMMUNICATION NETWORKS

TECHNICAL FIELD

[0001]
The disclosure relates generally to wireless communications and, more particularly, to systems and methods for determining parameters for uplink and downlink transmissions in wireless communication networks.

BACKGROUND

[0002]
Wireless communication networks can include network communication devices and network communication nodes. In some instances, the network communication devices can receive communication signals from more than one network communication nodes.
[0003]
SUMMARY
[0004]
The example embodiments disclosed herein are directed to solving the issues relating to one or more of the problems presented in the prior art, as well as providing additional features that will become readily apparent by reference to the following detailed description when taken in conjunction with the accompany drawings. In accordance with various embodiments, example systems, methods, devices and computer program products are disclosed herein. It is understood, however, that these embodiments are presented by way of example and are not limiting, and it will be apparent to those of ordinary skill in the art who read the present disclosure that various modifications to the disclosed embodiments can be made while remaining within the scope of this disclosure.
[0005]
In one embodiment, a method includes determining, according to a control resource set (CORESET) group, a monitoring state of a search space set of the CORESET group. The method further includes not monitoring the PDCCH candidates in the search space set, when the monitoring state is determined to be not monitoring.
[0006]
In another embodiment, a method includes determining, according to a first information, at least one condition that is to be satisfied by resources occupied by at least one of a channel or a signal. In some embodiments, the first information comprises information about control resource set (CORESET) group and serving cell.
[0007]
In another embodiment, a method includes determining that a plurality of bandwidths in a frequency domain are in a defined relationship, each of the plurality of bandwidths having a corresponding set of at least one parameter. In some embodiments, a relationship exists between the corresponding sets of parameters.
[0008]
In another embodiment, a method includes determining, according to a first information, at least one condition that is to be satisfied by resources occupied by at least one of a channel or a signal. In some embodiments, the first information comprises information about bandwidth part and serving cell.
[0009]
The above and other aspects and their implementations are described in greater detail in the drawings, the descriptions, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0010]
Various example embodiments of the present solution are described in detail below with reference to the following figures or drawings. The drawings are provided for purposes of illustration only and merely depict example embodiments of the present solution to facilitate the reader's understanding of the present solution. Therefore, the drawings should not be considered limiting of the breadth, scope, or applicability of the present solution. It should be noted that for clarity and ease of illustration, these drawings are not necessarily drawn to scale.
[0011]
Figure 1 illustrates an example cellular communication network in which techniques and other aspects disclosed herein may be implemented, in accordance with an embodiment of the present disclosure.
[0012]
Figure 2 illustrates block diagrams of an example base station and a user equipment device, in accordance with some embodiments of the present disclosure.
[0013]
Figure 3 shows a wireless communication system including a UE communicating with two communication points, in accordance with some embodiments of the present disclosure.
[0014]
Figure 4 shows an example configuration of a CORESET and search spaces, in accordance with some embodiments of the present disclosure.
[0015]
Figure 5 shows a flow diagram of a one approach to retention policy of the PDCCH search space, in accordance with some embodiments of the present disclosure.
[0016]
Figures 6-8 show CORESET groups for various slots, in accordance with some embodiments of the present disclosure.
[0017]
Figure 9 shows a flow diagram of another approach to retention policy of the PDCCH search space, in accordance with some embodiments of the present disclosure.
[0018]
DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS
[0019]
Various example embodiments of the present solution are described below with reference to the accompanying figures to enable a person of ordinary skill in the art to make and use the present solution. As would be apparent to those of ordinary skill in the art, after reading the present disclosure, various changes or modifications to the examples described herein can be made without departing from the scope of the present solution. Thus, the present solution is not limited to the example embodiments and applications described and illustrated herein. Additionally, the specific order or hierarchy of steps in the methods disclosed herein are merely example approaches. Based upon design preferences, the specific order or hierarchy of steps of the disclosed methods or processes can be re-arranged while remaining within the scope of the present solution. Thus, those of ordinary skill in the art will understand that the methods and techniques disclosed herein present various steps or acts in a sample order, and the present solution is not limited to the specific order or hierarchy presented unless expressly stated otherwise.
[0020]
Figure 1 illustrates an example wireless communication network, and/or system, 100 in which techniques disclosed herein may be implemented, in accordance with an embodiment of the present disclosure. In the following discussion, the wireless communication network 100 may be any wireless network, such as a cellular network or a narrowband Internet of things (NB-IoT) network, and is herein referred to as “network 100. ” Such an example network 100 includes a base station 102 (also referred to as “communication point 102” or “BS 102” or “transmitting receiving point (TRP) ” , or “communication node” ) and a user equipment device 104 (hereinafter “UE 104” ) that can communicate with each other via a communication link 110 (e.g., a wireless communication channel) , and a cluster of cells 126, 130, 132, 134, 136, 138 and 140 overlaying a geographical area 101. In Figure 1, the communication point 102 and UE 104 are contained within a respective geographic boundary of cell 126. Each of the other cells 130, 132, 134, 136, 138 and 140 may include at least one base station operating at its allocated bandwidth to provide adequate radio coverage to its intended users.
[0021]
For example, the communication point 102 may operate at an allocated channel transmission bandwidth to provide adequate coverage to the UE 104. The communication point 102 and the UE 104 may communicate via a downlink radio frame 118, and an uplink radio frame 124 respectively. Each radio frame 118/124 may be further divided into sub-frames 120/127 which may include data symbols 122/128. In the present disclosure, the communication point 102 and UE 104 are described herein as non-limiting examples of “communication nodes, ” generally, which can practice the methods disclosed herein. Such communication nodes may be capable of wireless and/or wired communications, in accordance with various embodiments of the present solution.
[0022]
Figure 2 illustrates a block diagram of an example wireless communication system 200 for transmitting and receiving wireless communication signals, e.g., orthogonal frequency-division multiplexing (OFDM) /orthogonal frequency-division multiple access (OFDMA) signals, in accordance with some embodiments of the present solution. The system 200 may include components and elements configured to support known or conventional operating features that need not be described in detail herein. In one illustrative embodiment, system 200 can be used to communicate (e.g., transmit and receive) data symbols in a wireless communication environment such as the wireless communication environment 100 of Figure 1, as described above.
[0023]
System 200 generally includes a base station 202 (also referred to as “communication point 202” ) and a user equipment device 204 (hereinafter “UE 204” ) . The communication point 202 includes a the communication point (base station) transceiver module 210, a communication point antenna 212, a communication point processor module 214, a communication point memory module 216, and a network communication module 218, each module being coupled and interconnected with one another as necessary via a data communication bus 220. The UE 204 includes a UE (user equipment) transceiver module 230, a UE antenna 232, a UE memory module 234, and a UE processor module 236, each module being coupled and interconnected with one another as necessary via a data communication bus 240. The communication point 202 communicates with the UE 204 via a communication channel 250, which can be any wireless channel or other medium suitable for transmission of data as described herein.
[0024]
As would be understood by persons of ordinary skill in the art, system 200 may further include any number of modules other than the modules shown in Figure 2. Those skilled in the art will understand that the various illustrative blocks, modules, circuits, and processing logic described in connection with the embodiments disclosed herein may be implemented in hardware, computer-readable software, firmware, or any practical combination thereof. To clearly illustrate this interchangeability and compatibility of hardware, firmware, and software, various illustrative components, blocks, modules, circuits, and steps are described generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software can depend upon the particular application and design constraints imposed on the overall system. Those familiar with the concepts described herein may implement such functionality in a suitable manner for each particular application, but such implementation decisions should not be interpreted as limiting the scope of the present disclosure.
[0025]
In accordance with some embodiments, the UE transceiver 230 may be referred to herein as an "uplink" transceiver 230 that includes a radio frequency (RF) transmitter and a RF receiver each comprising circuitry that is coupled to the antenna 232. A duplex switch (not shown) may alternatively couple the uplink transmitter or receiver to the uplink antenna in time duplex fashion. Similarly, in accordance with some embodiments, the communication point transceiver 210 may be referred to herein as a "downlink" transceiver 210 that includes a RF transmitter and a RF receiver each comprising circuity that is coupled to the antenna 212. A downlink duplex switch may alternatively couple the downlink transmitter or receiver to the downlink antenna 212 in time duplex fashion. The operations of the two transceiver modules 210 and 230 can be coordinated in time such that the uplink receiver circuitry is coupled to the uplink antenna 232 for reception of transmissions over the wireless transmission link 250 at the same time that the downlink transmitter is coupled to the downlink antenna 212. In some embodiments, there is close time synchronization with a minimal guard time between changes in duplex direction.
[0026]
The UE transceiver 230 and the base station transceiver 210 are configured to communicate via the wireless data communication link 250, and cooperate with a suitably configured RF antenna arrangement 212/232 that can support a particular wireless communication protocol and modulation scheme. In some illustrative embodiments, the UE transceiver 210 and the base station transceiver 210 are configured to support industry standards such as the Long Term Evolution (LTE) and emerging 5G standards, and the like. It is understood, however, that the present disclosure is not necessarily limited in application to a particular standard and associated protocols. Rather, the UE transceiver 230 and the base station transceiver 210 may be configured to support alternate, or additional, wireless data communication protocols, including future standards or variations thereof.
[0027]
In accordance with various embodiments, the communication point 202 may be an evolved node B (eNB) , a serving eNB, a target eNB, a femto station, or a pico station, for example. In some embodiments, the UE 204 may be embodied in various types of user devices such as a mobile phone, a smart phone, a personal digital assistant (PDA) , tablet, laptop computer, wearable computing device, etc. The processor modules 214 and 236 may be implemented, or realized, with a general purpose processor, a content addressable memory, a digital signal processor, an application specific integrated circuit, a field programmable gate array, any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, designed to perform the functions described herein. In this manner, a processor may be realized as a microprocessor, a controller, a microcontroller, a state machine, or the like. A processor may also be implemented as a combination of computing devices, e.g., a combination of a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other such configuration.
[0028]
Furthermore, the steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in firmware, in a software module executed by processor modules 214 and 236, respectively, or in any practical combination thereof. The memory modules 216 and 234 may be realized as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. In this regard, memory modules 216 and 234 may be coupled to the processor modules 210 and 230, respectively, such that the processors modules 210 and 230 can read information from, and write information to, memory modules 216 and 234, respectively. The memory modules 216 and 234 may also be integrated into their respective processor modules 210 and 230. In some embodiments, the memory modules 216 and 234 may each include a cache memory for storing temporary variables or other intermediate information during execution of instructions to be executed by processor modules 210 and 230, respectively. Memory modules 216 and 234 may also each include non-volatile memory for storing instructions to be executed by the processor modules 210 and 230, respectively.
[0029]
The network communication module 218 generally represents the hardware, software, firmware, processing logic, and/or other components of the base station 202 that enable bi-directional communication between base station transceiver 210 and other network components and communication nodes configured to communication with the base station 202. For example, network communication module 218 may be configured to support internet or WiMAX traffic. In a typical deployment, without limitation, network communication module 218 provides an 802.3 Ethernet interface such that base station transceiver 210 can communicate with a conventional Ethernet based computer network. In this manner, the network communication module 218 may include a physical interface for connection to the computer network (e.g., Mobile Switching Center (MSC) ) . The terms “configured for, ” “configured to” and conjugations thereof, as used herein with respect to a specified operation or function, refer to a device, component, circuit, structure, machine, signal, etc., that is physically constructed, programmed, formatted and/or arranged to perform the specified operation or function.
[0030]
Having discussed aspects of a networking environment as well as devices that can be used to implement the systems, methods and apparatuses described herein, additional details shall follow.
[0031]
Figure 3 shows a wireless communication system including a UE communicating with two communication points (for example, one or more BSs, one or more RRU of one BS) . In particular, the UE 306 communicates with a first communication point 302 and a second communication point 304 in the same cell. There may not be a backhaul communication link between the first communication point and the second communication point. The first communication point can transmit the DCI1 (downlink control information) and the PDSCH1 (physical downlink shared channel) to the UE where the DCI1 includes scheduling information for the PDSCH1, while the second communication point can transmit the DCI2 and the PDSCH2 to the same UE where the DCI2 includes scheduling information for the PDSCH2. Using two communication points can improve link robustness and can improve spectrum efficiency on the one hand, but on the other hand can create complications with regard to supporting two independently scheduling terminals within the same network.
[0032]
Each the communication points can transmit PDCCH during downlink symbols in a slot in NR. A search space set is a set of search space wherein a search space includes candidate PDCCHs occupying some CCEs (control channel elements) at a given aggregation level, which the UE is supposed to attempt to blind decode. Blind detection is a process where a UE attempts to detect any PDCCH (physical downlink control channels) candidates transmitted by one or more the communication points. There can be multiple search space sets associated with the same CORESET (control resource set) . When the number of PDCCH candidates configured in a slot, or the number of non-overlapping CCEs for the monitoring PDCCH candidates is greater than a predetermined value, some search space sets may have to be discarded based on a predetermined rule. Each search space set is retained or discarded according to an order of priority. The UE needs to detect the PDCCH candidate (s) in a search space set that is retained, and perform channel and/or signal transmission according to the PDCCH candidate (s) detected. The UE doesn’t expect to detect the PDCCH candidate (s) in a search space set that is discarded. The predetermined rule needs to be considering balance of PDCCH candidates retained between the multiple first communicate points.
[0033]
Referring again to Figure 3, the two communication points send downlink data channels to the UE. In particular, there is no ideal backhaul between two communication points. The two communication points independently schedule downlink data channels, where DCI1 schedules the channel or signal of the first communication point, and DCI2 schedules the channel or signal for the second communication point. Of course, this embodiment does not exclude the possibility of having an ideal Backhaul between the two communication points, but the channel characteristics of two channels between two communication points and the UE are independent, and the two communication points independently schedule data, or one of the communication points dynamically selects one or two communication points to transmit channel or signal to the UE. The time-frequency resources occupied by PDSCH1 and PDSCH2 may be either empty (non-overlapping) , partially overlapping, or completely overlapping.
[0034]
In NR-Rel 15, the parameters for the PDCCH are included in the CORESET and search space set, where one search space set can be associated with one CORESET, but one CORESET can be associated with multiple search space sets. A number of bandwidth parts (BWPs) can be configured in one downlink serving cell, and up to three CORESETs can be configured in each BWP, and up to 10 search space sets can be configured in each BWP.
[0035]
The following parameters can be configured in the CORESET: the frequency domain resource that the PDCCH candidate can occupy, the quasi-co-located reference signal of the demodulation reference signal of the PDCCH in the CORESET, and the number of time domain symbols occupied by the PDCCH candidate in one PDCCH occasion. For example, different quasi-co-located reference signal set represent a different transmit beam used by the base station to transmit the PDCCH, and a CORESET corresponds to a set of quasi-co-located reference signals, i.e., a CORESET has only one transmit beam.
[0036]
The following parameters are configured in each search space set: a period and a period offset of the PDCCH occasion with a time unit of a slot, a starting time domain symbol occupied by each PDCCH occasion in a slot, and the number of PDCCH candidates included in each aggregation level.
[0037]
Figure 4 shows an example configuration of a CORESET and search spaces. In particular, Figure 4 shows a slot-n 400 which includes CORSET 2 402 associated with search space set 2 404 and search space set 3 406. The number of time domain symbols of one PDCCH occasion in CORESET2 is configured to be one, then one PDCCH occasion of search space set 2 408 (or of search space set 3 410) occupy frequency domain resource and time domain symbol number 1 allocated/configured by CORESET2. In each PDDCH occasion of each search space set, the number of PDDCH candidates is equal to the number of PDCCH candidates included/configured in the search space set. For example, in Figure 4, search space set 2 in a slot has a start time domain symbol of {0, 4, 10} for three PDCCH occasion. And if the slot period of the search space set 2 is 2 slots, then one of every 2 slots has in it a search space set 2 that occupies time domain symbol of {0, 4, 10} . The search space set 3 in a slot has a start time domain symbol of {2, 6, 8, 9} for four PDCCH occasions. If search space set 3 has a slot period of 4 slots, then the search space set 3 in one of every 4 slots occupies time domain symbol of {2, 6, 8, 9} with each PDCCH occasion with one time domain symbol. In Figure 4, the search space set 2 and the search space set 3 in one slot has zero overlapping time domain symbols. Different search space sets associated with the same CORESET can also occupy overlapping time domain symbol (s) that is non-zero/non-empty.
[0038]
It can be seen from the foregoing description that in the CORESET configuration includes the time-frequency resource corresponding to one PDCCH occasion. The time domain pattern of the PDCCH occasion of each search space is configured in each search space set, including the PDCCH occasion pattern within the slot and the pattern of slot including PDCCH occasion. Each search space set associated with the same CORESET shares the parameters configured in the CORESET.
[0039]
From the above description, it can be seen that different search space sets can have different PDCCH occasion patterns, so the set of search space sets included in different slots can be different. For example, slot-n includes the search space set {1-8} ; slot-n+1 only includes the search space set {1, 3, 6} ; and slot-n+2 only includes the search space set {7} . Therefore, there are cases where some slots include too many search space sets or too many PDCCH candidate with a search space set with large PDCCH candidate, but the ability of the UE to process the PDCCH in one slot is limited, and some PDCCH candidates would have to be discarded for this purpose according to the predetermined rule. The complexity of handling PDCCH includes the detection of the PDCCH candidate, the number of non-overlapping CCEs for PDCCH candidates.
[0040]
The predetermined rule can consider the case of multiple communication points as shown in Figure 3 to avoid scenario where sometimes the terminal only monitoring PDCCH candidate corresponding to only one communication point, and sometimes the number of PDCCH candidates retained in one communication point can also be far more than the PDCCH candidates retained in another communication point. To this end, the retention strategy/implementation for search space sets should also consider the Multi-communication point scenario.
[0041]
As shown in Figure 3, communication between a UE and two communication points can improve link robustness and improve spectrum efficiency on the one hand. But how can we support two communication points independent scheduling with the UE, especially two communication points in the same serving cell independently scheduling with the UE in the cell, while minimizing the amount of communication/coordination between two communication points, so as to effectively support the scenario where two communication points without an ideal Backhaul can communicate with the same UE.
[0042]
The frequency domain bandwidth may be one of the following: a serving cell, a BWP in a serving cell, and a continuous PRB (physical resource block) as discussed herein. One search space set includes one or more aggregation degree (also referred to as “aggregation level” ) search space, and each aggregation degree search space corresponds to one aggregation degree and the PDCCH candidate included in the aggregation degree search space. A search space set can be called/referred as a collection of search spaces, that is, a collection of aggregation degree search spaces. In the following description, a serving cell can be (or correspond to) a CC (component carrier) . In this embodiment, one can determine the detected PDCCH candidate according to the CORESET group. For example, each CORESET group corresponds to one communication point. Specifically, the following two CORESET groups can be considered as an example. Of course, this does not exclude the case where the number of CORESET groups included in one frequency domain bandwidth can be other positive integers greater than or equal to 1.
[0043]
0≤i<I css denotes the number of counted PDCCH candidates for monitoring for CSS (Common search space) set S css (i) and 0≤j<J uss denotes the number of counted PDCCH candidates for monitoring for USS (UE specific search space) set S uss (j) . in turn are the number of PDCCH candidates and number of non-overlapping CCEs included in the common search space set falling in the CORESET group i, i=1, 2.
[0044]
For all search space sets within a slot n, denote by S css a set of CSS sets with cardinality of I css and by S uss a set of USS sets with cardinality of J uss. The location of USS sets s j, 0≤j<J uss, in S uss is according to an ascending order of the search space set index.
[0045]
V CCE (S uss (j) ) denotes the set of non-overlapping CCEs for search space set S uss (j) and C (V CCE (S uss (j) ) ) denotes the cardinality of V CCE (S uss (j) ) where the non-overlapping CCEs for search space set S uss (j) are determined considering the allocated PDCCH candidates for monitoring for the CSS sets and the allocated PDCCH candidates for monitoring for all search space sets S uss (k) , 0≤k≤j.
[0046]
A UE does not expect to be configured for CSS sets for which the numbers of monitored PDCCH candidates and non-overlapped CCEs per slot exceed the corresponding maximum numbers per slot.
[0047]
The monitoring state of a search space can be determined according to at least one of following approaches: Approach 1-Approach 5. When the monitoring state is not monitoring, the UE does not monitor the PDCH candidates in the search space set, i.e., the search space set is discarded. When the monitoring state is monitoring, the UE monitors the PDCH candidates in the search space set, i.e., the search space set is retained and the UE detect the PDCH candidates in the search space set.
[0048]
Approach 1
[0049]
Step 1
[0050]
First, determine the maximum number of PDCCH candidates (i.e., D1) and the maximum of non-overlapped CCEs (i.e. E1) for PDCCH candidates for a serving cell with a subcarrier spacing parameter μ in a slot. The largest PDCCH candidate (i.e. D2 of CORESET group 1) in CORESET group 1 and the maximum of non-overlapped CCEs for PDCCH candidates (i.e. E2 of CORESET group 1) , the maximum number of PDCCH candidates (i.e. D2 of CORESET group 2) in the CORESET group 2 and the maximum of non-overlapped CCEs for PDCCH candidates (i.e. E2 of CORESET group 1) . Among them are obtained according to the following information: subcarrier spacing parameter μ, the predetermined value, the capability value reported by the terminal (i.e. UE) , and the number of serving cells of the subcarrier spacing parameter μ.
[0051]
For their obtaining/associated parameters further includes the number of communication points for the serving cell, and the number of communication points corresponding to one serving cell is obtained according to one of the following methods: the CORESET group included in the serving cell; the number of CORESET groups included in the serving cell that schedules the serving cell; the number of sets of the same type of parameters of the PDSCH configured in the serving cell. The number of CORESET groups included in one serving cell is the number of CORESETs included in the active BWP in the serving cell. If the serving cell is an inactive serving cell, then it is the number of CORESET groups in the predetermined BWP. The same type of parameters for the PDSCH include one or more of the following: a channel scrambling sequence parameter, a process number set, and a PUCCH resource set. There can also be other parameters.
[0052]
Step 2
[0053]
Use the following pseudo code to determine the set of reserved search spaces: Determining to detect PDCCH candidates in the common search space set,
[0054]
Set
[0055]
Set
[0056]
Set
[0057]
Set
[0058]
Set
[0059]
Set
[0060]
Set j=0
[0061]
while AND
[0062]
If the CORESET of the USS set S uss (j) belongs to the CORESET group 1
[0063]
If AND
[0064]
allocate PDCCH candidates for monitoring to USS set S uss (j) ( )
[0065]
[0066]
[0067]
[0068]
[0069]
end
[0070]
elseif the CORESET of the USS set S uss (j) belongs to the CORESET group 2
[0071]
If AND
[0072]
allocate PDCCH candidates for monitoring to USS set S uss (j)
[0073]
[0074]
[0075]
[0076]
[0077]
end
[0078]
end
[0079]
j=j+1;
[0080]
end while
[0081]
Wherein allocate PDCCH candidates for monitoring to USS set S uss (j) means that the monitoring state of the search space set S USS (j) is monitoring, and the UE detects the PDCCH candidate in the search space set. is the number of PDCCH candidate counted in the CSS set in the CORESET group i for the scheduled cell in the slot , is the number of non-overlapping CCE for the monitoring PDCCH candidate in the CSS set in the CORESET group i for the scheduled cell in the slot, i=1, 2.
[0082]
In summary, the retention policy of the PDCCH search space set in the Approach 1 is shown in Figure 5, and the D_Cell in Figure 5 includes the above and the D_CORESET group (i) in Figure 5 includes the above D_USS (j) includes and C (V CCE (S uss(j) ) ) .
[0083]
Specifically, as shown in Figures 6-8, CORESET group 1 includes {CORESET1, CORESET2, CORESET3} corresponding to the first communicate point 1 in Figure3, and CORESET group 2 includes {CORESET4, CORESET5} corresponding to the first communicate point 2 in Figure3. For the sake of simplicity, only the number of PDCCH candidate of the search space set is considered in Figures 6-8. Supposing and are each 40, is 60, and Figures 6-8 shows a schematic diagram of the search space set included in different slots. After the retention scheme of the search space set as discussed above in Approach 1 is used, the search space set reserved in slotn1 of Figure 6 is {USS1, USS3, USS4, USS5} (At this time, 40 PDCCH candidates are reserved in CORESET group 1, and 20 PDCCH candidates are reserved in CORESET group 2) , and the search space set reserved in slotn2 in Figure 7 is {USS1} . It can be seen that USS2 is not retained at this time, otherwise it will be exceeded for the CORESET group 1 though it isn’t exceeded for the serving cell. The search space set retained in slotn3 in Figure 8 is {USS1, USS3, USS8, USS9} .
[0084]
Approach 2
[0085]
Step 1
[0086]
Step 1 in this approach is basically the same as that discussed above in Approach 1, except that the search space set in one slot is divided into two groups, and the search space set associated with CORESETs in the same CORESET group forms a search space set group, and the search space sets with CORESETs from different CORESET groups belongs to different search space set groups. The search space set in a search space set group is according to an ascending order of the search space set index , assuming that CORESET group 1 corresponds to search space set group 1 and communicate point 1 in Figure 3, CORESET group 2 corresponds to search space set group 2 communicate point 1 in Figure 3.
[0087]
For all search space sets within a slot n, S css denotes a set of CSS sets with cardinality of I css and S USS, CORESET group1 denotes a set of USS sets of CORESET group1 with cardinality of J USS, CORESET group1. The location of USS sets s j, CORESET group1, 0≤s j, CORESET group1<J USS, CORESET group1, in S USS, CORESET group1 is according to an ascending order of the search space set index. And by S USS, CORESET group2 a set of USS sets of CORESET group2 with cardinality of J USS, CORESET group2. The location of USS sets s j, CORESET group2, 0≤s j, CORESET group2<J USS, CORESET group2, in S USS, CORESET group2 S USS, CORESET group1 is according to an ascending order of the search space set index.
[0088]
For all search space sets within a slot n, denote by S css a set of CSS sets with cardinality of I css and by S uss a set of USS sets with cardinality of J uss. The location of USS sets s j, 0≤j<J uss, in S uss is according to an ascending order of the search space set index.
[0089]
Step 2
[0090]
Step 2 can be implemented using the following pseudo code:
[0091]
Set
[0092]
Set
[0093]
Set
[0094]
Set
[0095]
Set
[0096]
Set
[0097]
Set
[0098]
Set j CORESET group1=0;
[0099]
Set j CORESET group2=0;
[0100]
Set g=1: %CORESET group’s index
[0101]
while AND
[0102]
If AND
[0103]
[0104]
allocate PDCCH candidates for monitoring to USS set S uss (j)
[0105]
[0106]
[0107]
[0108]
[0109]
end
[0110]
j CORESET groupg=j CORESET groupg+1
[0111]
If g==1
[0112]
g=g+1
[0113]
elseif g==2
[0114]
g=1
[0115]
end
[0116]
end while
[0117]
In Approach 2, it is determined whether the monitoring state of the search space set is determined in two CORESET groups by turn, unlike in scheme 1, where the monitoring state of the search space set is sequentially determined according to only the search space set index. Approach 2 is adopted Figure 6: In slotn, the reserved search space set are {USS1, USS5, USS6, USS3} (at this time, 30 PDCCH candidates are retained in CORESET group 1, and 30 PDCCH candidates are retained in CORESET group 2) . Figure 7 shows that in slotn2 search space set of {USS1} is retained and that USS2 is also not retained at this time, otherwise it will exceed The search space set retained in slotn3 in Figure 8 is {USS1, USS8, USS3, USS9} .
[0118]
Approach 3
[0119]
In Approach 3, each CORESET group independently determines the retention of the search space set, that is, it is only required to ensure that the number of PDCCH candidates and the number of non-overlapped CCEs in the search space set retained in each CORESET group does not exceed this CORESET group’s corresponding maximum threshold for these numbers. In this process, we do not calculate/consider the maximum thresholds for the cell when determining the monitoring state of the search space.
[0120]
With Approach 3, the search space set retained in slotn1 of Figure 6 is {USS1, USS3, USS4, USS5, USS6, USS7} (at this time, 40 PDCCH candidates are reserved in CORESET group 1, and CORESET group 2 retained 40 PDCCH candidates) . In Figure 7, the search space set retained for slotn2 is {USS1} . It can be seen that USS2 is also not retained at this time, otherwise it will exceed The search space set retained in slotn3 in Figure 8 is {USS1, USS3, USS9, USS8} .
[0121]
In the above solution, the issue of retaining USS2 in slotn2 cannot be solved. When USS2 is retained, the total number in the cell of slotn2 does not exceed the cell-level threshold, but it will exceed the threshold of CORESET group 1. For this, we can first determine the monitoring state of all the USS set for the cell in the slot applying Approach 2 or Approach 1, then determine the monitoring state of search space sets that have been discarded in the first loop, and then check if the total number in the cell exceeds the cell-level threshold. If it does not exceed, then the search space sets can be retained; here we do not care if the limit of the CORESET group is exceeded.
[0122]
Approach 4
[0123]
As shown in Figure 9, after completion of the operation of Approach 1, that is, after arriving at j=J USS first, if the number of retained search space sets is smaller than the maximum threshold of the cell, we can continue to check whether the number exceeds the threshold (D_Cell) of the cell , and check within the search space set of USS_1 search space set on whether to retain or discard. After adopting the Approach 4 shown in Figure 9, and referring to Figure 6, the search space sets retained in slotn1 of Figure 6 are {USS1, USS3, USS4, USS5} (at this time, 40 PDCCH candidates are retained in CORESET group 1, and retained in CORESET group 2 are 20 PDCCH candidates) , the search space sets retained by slotn2 in Figure 7 are {USS1, USS2} , and it can be seen that USS2 is retained at this time. The search space set retained in slotn3 in Figure 8 is {USS1, USS3, USS8, USS9} .
[0124]
Approach 5
[0125]
Similar to the Approach 4, after the operation of Approach 2, if the number of PDCCH candidate in the retained search space sets is smaller than the maximum threshold of the cell, we can continue to check the monitoring state of the USS set which has been discarded in the above operation of Approach 2. According to Approach 5, and referring to Figure 6, the search space set retained in slotn1 of Figure 6 is {USS1, USS3, USS4, USS5, USS6 , USS7} (At this time, 40 PDCCH candidates are retained in CORESET group 1, 40 PDCCH candidates are retained in CORESET group 2) , and the search space set retained by slotn2 in Figure 7 is {USS1, USS2} . At this timeUSS2 is retained, otherwise it will exceed The search space set retained in slotn3 in Figure 8 is {USS1, USS8, USS3, USS9} .
[0126]
Retention of the above PDCCH search space set
[0127]
When the channels and/or signals scheduled by PDCCH and the PDCCH are in different serving cells, that is, when cross-cc is scheduled, each serving cell (in which the scheduled channels and/or signals reside) are independently checked to determine if its search space sets are retained or not. Or can determine whether to retain/discard the search space sets only for the SPcell (Specific primary cell) . When configuring the search space set for a Scell, the terminal does not expect the number of PDCCH candidates /non-overlapped CCEs of the search space set for the Scell in a slot’s to exceed the maximum allowed by the cell, or exceed the maximum threshold of a corresponding CORESET group.
[0128]
Or when only the numbers in a Spcell that corresponds to communication point is higher than a predefined number, determining retention in a serving cell the above search space sets. When performing configuration, the terminal does not want the number of PDCCH candidate /non-overlapped CCEs in search space sets in a slot to exceed the maximum allowed by the cell and the maximum allowed for the CORESET group.
[0129]
The Approaches 1-5 discussed above are processed assuming that one communication point corresponds to one CORESET group. Approaches 1-5 are similarly processed using BWP group/BWP in a cell instead of CORESET group assuming that one communication point corresponds to one BWP group/BWP. i.e., determining the monitoring state of a search space according to BWP group/BWP in a cell. A CORESET group includes CORESET for a cell. Multiple CORESET groups include CORESET for a cell. Multiple BWPs are for a cell. a monitoring state can be monitoring or not monitoring.
[0130]
A PDCCH candidate with index for a search space set s j using a set of CCEs in a CORESET p on the active DL BWP for serving cell n CI is not counted for monitoring if there is a PDCCH candidate with index for a search space set s i<s j, or if there is a PDCCH candidate with index and in the CORESET p on the active DL BWP for serving cell n CI using a same set of CCEs, the PDCCH candidates have identical scrambling, and the corresponding DCI formats for the PDCCH candidates have a same size; otherwise, the PDCCH candidate with index is counted for monitoring
[0131]
Two communication points in the Same Cell
[0132]
In order to effectively support the communication by two communication points with a terminal as shown in Figure 3, reduce the amount of coordination needed between the two communication points, and reduce the impact from interaction latency between the communication points on the system performance, the following approaches can be used.
[0133]
Approach 1
[0134]
Two communication points are represented by two CORESET groups in a BWP under a serving cell. When the channel and/or signal is scheduled by the same communication point, that is, the channel and/or signal is scheduled by the same CORESET group in a serving cell, either a first predetermined condition, or a second predetermined condition, has to be met. When the channel and/or signal is scheduled by different communication points, that is, the channel and/or signal is scheduled via different CORESET groups in a serving cell, it is not necessary to satisfy the first predetermined condition, or the second predetermined condition.
[0135]
Approach 2
[0136]
Two communication points are represented by two BWPs or two BWP groups under one serving cell. When the channel and/or signal is scheduled by the same communication point, that is, the channel and/or signal is located in one BWP in a serving cell, or in the same BWP group, then the first predetermined condition or the second predetermined condition would have to be met. When the channel and/or signal is scheduled by different communication points, that is, the channel and/or signal is located in different BWPs in a serving cell, or in different BWP groups in a serving cell, it is not necessary to satisfy the first predetermined condition, or the second predetermined condition.
[0137]
Wherein the first predetermined condition includes one or more of the conditions:
[0138]
There is no overlap between the time domain resources occupied by the two channels and/or signals, wherein the two channels and/or signals correspond to the same process or different processes;
[0139]
In a case where an end position of a PDCCH scheduling a first channel and/or signal to be later than an end position of a PDCCH scheduling the second channel and/or the signal, the start position of the first channel cannot be earlier than the end position of the second channel and/or signal, wherein the two channels and/or signals correspond to a same process or different processes;
[0140]
For two channels corresponding to the same process number, one of the channel’s starting position cannot be earlier than an end position of a last channel under the same process number.
[0141]
Wherein the second predetermined condition includes one or more of the following conditions:
[0142]
In the case where an end position of a PDCCH scheduling an uplink channel and/or signal falls within a predetermined time window before the starting symbol of a transmission occasion of a PUSCH configured grant, there is no overlap between time domain resources occupied by the uplink channel and/or signal, and that of the transmission occasion of the PUSCH configured grant;
[0143]
If the PDCCH scheduling an uplink channel and the a transmission occasion of a PUSCH configured grant have a same process number, an end position of the PDCCH cannot fall within a predetermined time window that falls before a starting symbol of the transmission occasion of the PUSCH configured grant;
[0144]
Wherein a PUSCH configured grant is (or can also be referred to as) a PUSCH of a Grant free.
[0145]
Two communication points from Two Serving Cells
[0146]
The parameters of two communication points should meet certain constraints, which can improve the link robustness or frequency efficiency, reduce the complexity of the terminal, and can effectively reduce interference between two links corresponding to the two communication points. The following approach is adopted for this purpose.
[0147]
Specifically, if two communication points are respectively represented by two CCs (i.e., serving cells) , the two CCs may be one of the following: a CC in one MCG and a CC in one SCG; respectively from two CCs in two CC groups from the MCG (Master cell group) (or the SCG secondary cell group) , wherein each of the two CC groups in the MCG corresponds to one uplink serving CC that includes the PUCCH, or different CC groups correspond to different serving cells that include PUCCH.
[0148]
For example, a first CC group in a MCG includes a Pcell, and a second CC group includes a PUCCH-Scell, that is, the two CC groups in the MCG respectively correspond to a Cell that includes the PUCCH. The HARQ-ACK information of the PDSCH in each CC group is in the feedback in the Cell that includes the PUCCH, corresponding to the CC group.
[0149]
In particular, when frequency domain resources between two serving cells representing two communication points actually overlap, parameters in the two serving cells are related.
[0150]
For example, the BWPs (in active state) of two serving cells should be the same, or CPs of the active BWP (s) should be the same, or the numerology parameters should be the same. The numerology parameters can include at least one of the following: CP, subcarrier spacing, number of time domain symbols included in one slot.
[0151]
For example, uplink BWPs in two serving cells have a corresponding relationship between the uplink BWPs. For example, serving cell 1 may correspond to the first communication point, and serving cell 2 may correspond to the second communication point. The serving cell 1 can include {BWP1-1, BWP1-2, BWP1-3} , and the serving cell 2 can include {BWP2-1, BWP2-2, BWP2-3} . Then there is a correspondence relationship between BWPi-1 and BWPi-2, and there is a correlation or relationship between the parameters of these related BWPs. Similarly, there is a correspondence between downlink BWPs in two serving cells. The above uses index information of the BWPs in a BWP group included in the serving cell, to determine correspondence relationship between the BWPs. This embodiment does not exclude whether the two frequency domain resources separately belonging to the two CCs may overlap or not, to determine the relationship between BWPs. For example, where two BWPs involving an overlap, it is then determined that there is a correspondence between them. Or there may be no overlap, but the BWPs are each in an active state, then we can determine that there is a correspondence relationship between them.
[0152]
In an existing correspondence relationship, configuration of a parameter in one BWP may be related to that of another BWP. A correspondence relationship may include that some parameter values of the two BWPs are the same, and/or that some combination values of some parameters of the two BWPs cannot simultaneously appear, that a value range of a parameter in another BWP can be determined according to a parameter value of one BWP, or that two BWPs can share one parameter indication signaling.
[0153]
For example, one of two serving cells may configure a time domain location of an uplink transmission, and the other serving cell may not be configured for downlink transmission. One serving cell may configure a time domain location of a downlink transmission, and the other serving cell may not be able to configure for uplink transmission. Or two serving cells may share a set of time domain structure configuration information, wherein the slot structure configuration information can include an uplink time domain symbol, a downlink time domain symbol, and a flexible time domain symbol configuration information, included in each slot. The slot structure configuration information may conveyed via one or more of a system message, RRC signaling, MAC-CE signaling, and PDCCH signaling.
[0154]
For example, when two serving cells include two Pcells and a PUCCH-Scell, the PUCCHs transmitted in the two cells cannot occupy the same time domain resource, should use time-division based transmission, or when PUCCH time domain overlap in the two cells is not empty, the information included in the PUCCH in which in two cells has an overlap in time domain is combined into one PUCCH or one PUSCH, and is sent in one of the Pcell or the PUCCH-Scell after combining.
[0155]
For example, if there are two CCs in a correspondence relationship, the parameters can be configured independently, but if one of the CC’s parameters is not configured, the configuration in the other CC can be shared with the first CC. In another embodiment, some parameters of a serving cell or BWP that have a correspondence relationship may be independently configured, and some of the parameters can share one configuration signal, and the parameter values can be the same.
[0156]
In one aspect, a method includes determining, according to a first information , a monitoring state of a search space set; and not monitoring the PDCCH candidates in the search space set, when the monitoring state is determined to be not monitoring, wherein the first information includes one of the following: control resource set (CORESET) group, or bandwidth part (BWP) .
[0157]
The method also includes determining, according to the first information and a second information, the monitoring state of the search space set, the second information comprising at least one of: an index of the search space set; a maximum number of PDCCH candidates monitored for a frequency bandwidth in a slot of the search space set, D1, a maximum number of non-overlapping control channel elements (CCE) for the frequency bandwidth in the slot, E1; a maximum number of PDCCH candidates monitored for a value of the first information for the frequency bandwidth in the slot, D2; a maximum number of non-overlapping control channel elements for a value of the first information for the frequency bandwidth in the slot, E2; or a number of PDCCH candidates of a search space set.
[0158]
The method can further include, a first group of search space set and the search space set corresponds to the same value of the first information, each search space set in the first group of search space sets, has a monitoring state that is monitoring, prior to determining the monitoring state of the search space set .
[0159]
The method can further include when a first condition is met, determining that the monitoring state of the search space set is monitoring; and/or when the first condition is unmet, determining that the monitoring state of the search space set is not monitoring; and wherein the first condition is determined according to at least one of: D1, E1, D2 and E2 corresponding to the value of the first information for the search space set, a total number of PDCCH candidates in a first group of search space set, a total number of non-overlapping control channel elements in the first group of search space set, a total number of PDCCH candidates in a second group of search space sets, or a number of non-overlapping control channel elements in the second group of search space sets, wherein all search space set in the second group of search space sets is associated with the same cell, and has a monitoring state that is monitoring, prior to determining the monitoring state of the search space set. The method can further include, wherein the first group of search space set and the search space set correspond to the same value of the first information, each search space set in the first group of search space sets has a monitoring state that has been determined to be monitoring, prior to determining the monitoring state of the search space set; wherein all search space set in the second group of search space sets is associated with the same cell, and has a monitoring state that has been determined to be monitoring, prior to determining the monitoring state of the search space set.
[0160]
The method can further include wherein the first condition includes: when the monitoring state of the search space set is monitoring, a maximum number of PDCCH candidates monitored in search space sets having monitoring states that are monitoring for a cell in a slot, is less than or equal to D1; a maximum number of non-overlapping control channel elements in the search space sets having monitoring states that are monitoring for a cell in a slot , is less than or equal to E1; a maximum number of PDCCH candidates monitored in search space sets having monitoring states that are monitoring for the value of the first information in a slot, is less than or equal to D2; and a maximum number of non-overlapping control channel elements in the search space sets having monitoring states that are monitoring for the value of the first information in a slot, is less than or equal to E2,
[0161]
The method can further include determining an order for determining monitoring states of multiple UE-specific search space sets, according to one of following: the order for determining monitoring state of multiple UE-specific search space sets in a slot is according to an ascending order of indexes of the search space sets; the order for determining monitoring state of multiple UE-specific search space sets in a slot according to an ascending order of the value of the first information associated with the search space sets first, then an according to an ascending order of indexes of the search space sets; and dividing the search space sets into two groups corresponding to two value of the first information, and the order determining monitoring state of multiple UE-specific search space set in a slot is according to the two search space set by turn.
[0162]
The method can further include after determining the monitoring states of all search space sets in the slot for a cell according to the first condition, if a total number of PDCCH candidates of the search space sets monitored is less than D1, and a total number of non- overlapping control channel elements in the search space sets monitored is less than E1, for a subset of the search space sets with monitoring state determined to be not monitoring using the first condition, determining according to a second condition, monitoring states of a search space in the subset of the search space sets according to an ascending order of values of indexes of the search space set, wherein when the second condition is met, determining that a monitoring state of a search space set of the subset is monitoring; and/or when the second condition is unmet, determining that the monitoring state of the search space of the subset is not monitoring, wherein parameters for determining the second condition exclude the first information associated with search space set in the subset.
[0163]
The method can further include wherein the second condition includes: when a monitoring state of a search space is determined to be monitoring, satisfying the following: a maximum number of PDCCH candidates monitored in search space sets having monitoring states determined to be monitoring for a cell in slot, is less than or equal to D1; and a maximum number of non-overlapping control channel elements in the search space sets having monitoring states determined to be monitoring for the cell in a slot, is less than or equal to E1.
[0164]
The method can further include determining a relationship between D1 and D2 and a relationship between E1 and E2 according to at least one of: anumber of CORESET group for a BWP for a scheduled; a number of activated BWP for a cell simultaneously; or a number of value of a same type parameter of PDSCH in one BWP. The method can further include a same type parameter of PDSCH comprising the parameter of scrambling sequence of PDSCH.
[0165]
The method can further include determining, according to the value of the first information, the monitoring state of the search space set according to at least one of: for each value of the first information of a cell in a slot, determining that a number of PDCCH candidates included in search space sets with monitoring states determined to be monitoring, does not exceed a maximum number of control channel candidates corresponding to the value of the first information; for each value of the first information of the cell in the slot, determining that a number of non-overlapping control channel elements in search space sets with monitoring states determined to be monitoring, does not exceed a maximum number of non-overlapping control channel elements corresponding to the value of the first information.
[0166]
The method can further include when the monitoring state of the search space set is determined to be monitoring, monitoring the PDCCH candidates in the search space set.
[0167]
The method can further include, wherein a monitoring state can be monitoring or not monitoring. The method can further include, wherein the first information is for a cell. The method can further include, wherein a search space set is for a cell in a slot.
[0168]
In another aspect, a method can include determining that a plurality of bandwidths are associated with a first relationship, each of the plurality of bandwidths corresponding to a parameter set, wherein a second relationship exists between the parameter sets corresponding to the plurality of bandwidths.
[0169]
The method can further include wherein the plurality of bandwidths comprises a plurality of serving cells, and the second relationship comprises at least one of: time domain resources occupied by uplink channels or uplink signals in different serving cells of the plurality of serving cells are non-overlapping; when the time domain resources occupied by uplink channels or uplink signals in different serving cells of the plurality of serving cells are overlapping, information in the uplink channels or uplink signals in the different serving cells are combined into one of uplink channel or uplink signal in one of the plurality of serving cells; the multiple parameter sets is for multiple uplink BWP in a cell; or the multiple parameter sets is for multiple downlink BWP in a cell.
[0170]
The method can further include wherein the uplink channel comprises a uplink control channel , and the multiple serving cells comprise serving cells that has a uplink control channel. The method can further include, wherein the second relationship comprises at least one of:the corresponding parameters have a same value; the parameter sets corresponding to the plurality of bandwidths have a same value for every parameter type; the parameter sets corresponding to the plurality of bandwidths is determined using a same signaling; a relationship in which the corresponding parameters correspond to a parameter for signaling information, that is shared across the plurality of bandwidths; a range of values of a one parameter set for a bandwidths is obtainable according to a value of another parameter set for another bandwidth of the plurality of bandwidths; when a parameter set for a bandwidths is not configured, the parameter set is determined according to a configuration of another parameter set for another of plurality bandwidths.
[0171]
The method can further include, wherein the parameter set at least one of: a bandwidth part in active state, a numerology parameter, slot structure configuration information, or parameter of the demodulation reference signal, wherein the numerology parameter comprises at least one of: a cyclic prefix , a subcarrier spacing, a number of time domain symbols in a slot, or slot structure configuration information, wherein the slot structure configuration information comprises information about location of uplink time domain symbols , downlink time domain symbols, and flexible time domain symbols in a slot.
[0172]
The method can further include, wherein a bandwidth of the plurality of bandwidths includes one of: a serving cell, a bandwidth part, and a continuous physical resource block. The method can further include, wherein the plurality of bandwidths with the first relationship includes two bandwidths corresponding to at least one of following: the plurality of bandwidths occupy an overlapping region of frequency domain resources; the plurality of bandwidths have a same bandwidth index; the plurality of bandwidths are all with active state; the plurality of bandwidths have a same transmission direction, wherein the transmission direction comprises an uplink direction or a downlink direction; or different bandwidths of the plurality of bandwidths belongs to a different bandwidth group.
[0173]
The method can further include, wherein the plurality of bandwidths with the first relationship includes two bandwidths corresponding to one of following: two component carriers separately belonging to a master cell group and a secondary cell group; two component carriers separately belonging to two component carrier groups of a master cell group; two component carriers separately belonging to two component carrier groups of a secondary cell group; or two bandwidth parts separately belonging to two component carriers, wherein the two component carriers comprises one of following: two component carriers separately belonging to a master cell group and a secondary cell group; two component carriers separately belonging to two component carrier groups of a master cell group; or two component carriers separately belonging to two component carrier groups of a secondary cell group.
[0174]
In some aspects, a method can include determining, according to a first information, at least one condition that is to be satisfied by resources occupied by at least two of channels, wherein the first information comprises information about control resource set (CORESET) group and serving cell.
[0175]
The method can further include, determining, according to a first information, at least one condition that is to be satisfied by resources occupied by at least two of channels , wherein the first information comprises information about bandwidth part and serving cell.
[0176]
The method can further include, wherein the one condition comprising at least one of:
[0177]
when a first information corresponding to two channels is same, a first condition is satisfied between resources occupied by the two channels; when the first information corresponding to the two channels is different, the first condition is not satisfied between the resources occupied by the two channels; when the channel and/or signal is uplink, and the first information corresponding to a PUSCH configured grant and the channel and/or signal is same, a second condition is satisfied between the channel and/or signal and a transmission occasion of the PUSCH configured grant; or when the channel and/or the signal is uplink, and the first information corresponding to the PUSCH configured grant is different, the second condition is not satisfied between the channel and/or signal and a transmission occasion of the PUSCH configured grant.
[0178]
The method can further include, wherein the second condition comprises at least one of:when an end position of a control channel of the channel and/or signal is within a predetermined time window before a starting time domain symbol of a transmission occasion of the PUSCH configured grant, the time domain between the channel and/or signal and the transmission occasion of the PUSCH configured grant are non-overlapping; or when the uplink channel scheduled by a control channel, and a transmission occasion of a PUSCH configured grant, have a same process number, an end position of the control channel cannot occur within a predetermined time window prior to a starting time domain symbol of the transmission occasion of the PUSCH configured grant.
[0179]
The method can further include, wherein the first condition comprises at least one of:
[0180]
the two channels are non-overlapping in time domain, wherein the two channels correspond to a same process or different processes; or when an end position of a control channel of a first of the two channels occurs after an end position of a second of the two channels , a starting position of the first of the two channels cannot be earlier than the end position of the second of the two channels , wherein the two channels correspond to a same process or different processes; or when the two channels correspond to a same process number, a starting position of one of the two channels cannot be earlier than an end position of a last channel having the same process number.
[0181]
The method can further include, wherein the first condition comprises information about CORESET group and serving cell, and: the first information corresponding to the two channels is the same, includes having the two channels corresponding to a same CORESET group, and having the two channels in one serving cell; or the first information corresponding to the two channels is different, includes having the two channels corresponding to a different CORESET groups, and/or having the two channels in different serving cells.
[0182]
The method can further include, wherein the first condition comprises information about bandwidth part and serving cell, and: the first information corresponding to the two channels is the same, and includes having the two channels corresponding to a same BWP group, and having the two channels in one serving cell; or the first information corresponding to the two channels is different, and includes having the two channels corresponding to a different BWP groups, and/or having the two channels in different serving cells.
[0183]
While various embodiments of the present solution have been described above, it should be understood that they have been presented by way of example only, and not by way of limitation. Likewise, the various diagrams may depict an example architectural or configuration, which are provided to enable persons of ordinary skill in the art to understand example features and functions of the present solution. Such persons would understand, however, that the solution is not restricted to the illustrated example architectures or configurations, but can be implemented using a variety of alternative architectures and configurations. Additionally, as would be understood by persons of ordinary skill in the art, one or more features of one embodiment can be combined with one or more features of another embodiment described herein. Thus, the breadth and scope of the present disclosure should not be limited by any of the above-described illustrative embodiments.
[0184]
It is also understood that any reference to an element herein using a designation such as "first, " "second, " and so forth does not generally limit the quantity or order of those elements. Rather, these designations can be used herein as a convenient means of distinguishing between two or more elements or instances of an element. Thus, a reference to first and second elements does not mean that only two elements can be employed, or that the first element must precede the second element in some manner.
[0185]
Additionally, a person having ordinary skill in the art would understand that information and signals can be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits and symbols, for example, which may be referenced in the above description can be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
[0186]
A person of ordinary skill in the art would further appreciate that any of the various illustrative logical blocks, modules, processors, means, circuits, methods and functions described in connection with the aspects disclosed herein can be implemented by electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two) , firmware, various forms of program or design code incorporating instructions (which can be referred to herein, for convenience, as "software" or a "software module) , or any combination of these techniques. To clearly illustrate this interchangeability of hardware, firmware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware or software, or a combination of these techniques, depends upon the particular application and design constraints imposed on the overall system. Skilled artisans can implement the described functionality in various ways for each particular application, but such implementation decisions do not cause a departure from the scope of the present disclosure.
[0187]
Furthermore, a person of ordinary skill in the art would understand that various illustrative logical blocks, modules, devices, components and circuits described herein can be implemented within or performed by an integrated circuit (IC) that can include a general purpose processor, a digital signal processor (DSP) , an application specific integrated circuit (ASIC) , a field programmable gate array (FPGA) or other programmable logic device, or any combination thereof. The logical blocks, modules, and circuits can further include antennas and/or transceivers to communicate with various components within the network or within the device. A general purpose processor can be a microprocessor, but in the alternative, the processor can be any conventional processor, controller, or state machine. A processor can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other suitable configuration to perform the functions described herein.
[0188]
If implemented in software, the functions can be stored as one or more instructions or code on a computer-readable medium. Thus, the steps of a method or algorithm disclosed herein can be implemented as software stored on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that can be enabled to transfer a computer program or code from one place to another. A storage media can be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer.
[0189]
In this document, the term "module" as used herein, refers to software, firmware, hardware, and any combination of these elements for performing the associated functions described herein. Additionally, for purpose of discussion, the various modules are described as discrete modules; however, as would be apparent to one of ordinary skill in the art, two or more modules may be combined to form a single module that performs the associated functions according embodiments of the present solution.
[0190]
Additionally, memory or other storage, as well as communication components, may be employed in embodiments of the present solution. It will be appreciated that, for clarity purposes, the above description has described embodiments of the present solution with reference to different functional units and processors. However, it will be apparent that any suitable distribution of functionality between different functional units, processing logic elements or domains may be used without detracting from the present solution. For example, functionality illustrated to be performed by separate processing logic elements, or controllers, may be performed by the same processing logic element, or controller. Hence, references to specific functional units are only references to a suitable means for providing the described functionality, rather than indicative of a strict logical or physical structure or organization.
[0191]
Various modifications to the implementations described in this disclosure will be readily apparent to those skilled in the art, and the general principles defined herein can be applied to other implementations without departing from the scope of this disclosure. Thus, the disclosure is not intended to be limited to the implementations shown herein, but is to be accorded the widest scope consistent with the novel features and principles disclosed herein, as recited in the claims below.

Claims

[Claim 1]
A method comprising, determining, according to a first information , a monitoring state of a search space set; and not monitoring the PDCCH candidates in the search space set, when the monitoring state is determined to be not monitoring, wherein the first information includes one of the following: control resource set (CORESET) group, or bandwidth part (BWP) .
[Claim 2]
The method according to claim 1, comprising: determining, according to the first information and a second information, the monitoring state of the search space set, the second information comprising at least one of: an index of the search space set; a maximum number of PDCCH candidates monitored for a frequency bandwidth in a slot of the search space set, D1; a maximum number of non-overlapping control channel elements (CCE) for the frequency bandwidth in the slot, E1; a maximum number of PDCCH candidates monitored for a value of the first information for the frequency bandwidth in the slot, D2; a maximum number of non-overlapping control channel elements for a value of the first information for the frequency bandwidth in the slot, E2; or a number of PDCCH candidates of a search space set.
[Claim 3]
The method of claim 2, comprising: when a first condition is met, determining that the monitoring state of the search space set is monitoring; and/or when the first condition is unmet, determining that the monitoring state of the search space set is not monitoring; and wherein the first condition is determined according to at least one of: D1, E1, D2 and E2 corresponding to the value of the first information for the search space set, a total number of PDCCH candidates in a first group of search space set , a total number of non-overlapping control channel elements in the first group of search space set, a total number of PDCCH candidates in a second group of search space sets, or a number of non-overlapping control channel elements in the second group of search space sets.
[Claim 4]
The method of claim 3, comprising: Wherein the first group of search space set and the search space set correspond to the same value of the first information, each search space set in the first group of search space sets has a monitoring state that has been determined to be monitoring, prior to determining the monitoring state of the search space set; wherein all search space set in the second group of search space sets is associated with the same cell, and has a monitoring state that has been determined to be monitoring, prior to determining the monitoring state of the search space set.
[Claim 5]
The method of claim 3, wherein the first condition includes: when the monitoring state of the search space set is monitoring, a maximum number of PDCCH candidates monitored in search space sets having monitoring states that are monitoring for a cell in a slot, is less than or equal to D1; a maximum number of non-overlapping control channel elements in the search space sets having monitoring states that are monitoring for a cell in a slot , is less than or equal to E1; a maximum number of PDCCH candidates monitored in search space sets having monitoring states that are monitoring for the value of the first information in a slot, is less than or equal to D2; and a maximum number of non-overlapping control channel elements in the search space sets having monitoring states that are monitoring for the value of the first information in a slot, is less than or equal to E2.
[Claim 6]
The method of claim 3, comprising: determining an order for determining monitoring states of multiple UE-specific search space sets, according to one of following: the order for determining monitoring state of multiple UE-specific search space sets in a slot is according to an ascending order of indexes of the search space sets; the order for determining monitoring state of multiple UE-specific search space sets in a slot according to an ascending order of the value of the first information associated with the search space sets first, then an according to an ascending order of indexes of the search space sets; and dividing the search space sets into two groups corresponding to two value of the first information, and the order determining monitoring state of multiple UE-specific search space set in a slot is according to the two search space set by turn.
[Claim 7]
The method of claim 3, comprising: after determining the monitoring states of all search space sets in the slot for a cell according to the first condition, if a total number of PDCCH candidates of the search space sets monitored is less than D1, and a total number of non-overlapping control channel elements in the search space sets monitored is less than E1, for a subset of the search space sets with monitoring state determined to be not monitoring using the first condition, determining according to a second condition, monitoring states of a search space in the subset of the search space sets according to an ascending order of values of indexes of the search space set, wherein when the second condition is met, determining that a monitoring state of a search space set of the subset is monitoring; and/or when the second condition is unmet, determining that the monitoring state of the search spaceof the subset is not monitoring, wherein parameters for determining the second condition exclude the first information associated with search space set in the subset.
[Claim 8]
The method of claim 7, wherein the second condition includes: when a monitoring state of a search space is determined to be monitoring, satisfying the following: a maximum number of PDCCH candidates monitored in search space sets having monitoring states determined to be monitoring for a cell in slot, is less than or equal to D1; and a maximum number of non-overlapping control channel elements in the search space sets having monitoring states determined to be monitoring for the cell in a slot, is less than or equal to E1.
[Claim 9]
The method according to any of claims 2 to 8, comprising determining a relationship between D1 and D2 and a relationship between E1 and E2 according to at least one of: a number of CORESET group for a BWP for a scheduled; a number of activated BWP for a cell simultaneously; or a number of value of a same type parameter of PDSCH in one BWP.
[Claim 10]
The method of claim 9, a same type parameter of PDSCH comprising the parameter of scrambling sequence of PDSCH.
[Claim 11]
The method of claim 2, comprising determining, according to the value of the first information, the monitoring state of the search space set according to at least one of: for each value of the first information of a cell in a slot, determining that a number of PDCCH candidates included in search space sets with monitoring states determined to be monitoring, does not exceed a maximum number of control channel candidates corresponding to the value of the first information; for each value of the first information of the cell in the slot, determining that a number of non-overlapping control channel elements in search space sets with monitoring states determined to be monitoring, does not exceed a maximum number of non-overlapping control channel elements corresponding to the value of the first information.
[Claim 12]
The method of any of claims 1 to 8, comprising: when the monitoring state of the search space set is determined to be monitoring, monitoring the PDCCH candidates in the search space set.
[Claim 13]
The method of any of claims 1 to 8, wherein a monitoring state can be monitoring or not monitoring.
[Claim 14]
The method of any of claims 1 to 7, wherein the first information is for a cell.
[Claim 15]
The method of any of claims 1 to 7, wherein a search space set is for a cell in a slot.
[Claim 16]
A method, comprising: determining that a plurality of bandwidths are associated with a first relationship, each of the plurality of bandwidths corresponding to a parameter set, wherein a second relationship exists between the parameter sets corresponding to the plurality of bandwidths.
[Claim 17]
The method of claim 16, wherein the plurality of bandwidths comprises a plurality of serving cells, and the second relationship comprises at least one of: time domain resources occupied by uplink channels or uplink signals in different serving cells of the plurality of serving cells are non-overlapping; when the time domain resources occupied by uplink channels or uplink signals in different serving cells of the plurality of serving cells are overlapping, information in the uplink channels or uplink signals in the different serving cells are combined into one of uplink channel or uplink signal in one of the plurality of serving cells; the multiple parameter sets is for multiple uplink BWP in a cell; or the multiple parameter sets is for multiple downlink BWP in a cell.
[Claim 18]
The method of claim 17, wherein the uplink channel comprises a uplink control channel, and the multiple serving cells comprise serving cells that has a uplink control channel.
[Claim 19]
The method of claim 16, wherein the second relationship comprises at least one of: the corresponding parameters have a same value; the parameter sets corresponding to the plurality of bandwidths have a same value for every parameter type; the parameter sets corresponding to the plurality of bandwidths is determined using a same signaling; a relationship in which the corresponding parameters correspond to a parameter for signaling information, that is shared across the plurality of bandwidths; a range of values of a one parameter set for a bandwidths is obtainable according to a value of another parameter set for another bandwidth of the plurality of bandwidths; when a parameter set for a bandwidths is not configured, the parameter set is determined according to a configuration of another parameter set for another of plurality bandwidths.
[Claim 20]
The method of claim 19, wherein the parameter set at least one of: a bandwidth part in active state, a numerology parameter, slot structure configuration information, or parameter of the demodulation reference signal, wherein the numerology parameter comprises at least one of: a cyclic prefix, a subcarrier spacing, a number of time domain symbols in a slot, or slot structure configuration information, wherein the slot structure configuration information comprises information about location of uplink time domain symbols , downlink time domain symbols, and flexible time domain symbols in a slot.
[Claim 21]
The method of any of claims 16 to 20, wherein a bandwidth of the plurality of bandwidths includes one of: a serving cell, a bandwidth part, and a continuous physical resource block.
[Claim 22]
The method of any of claims 16 to 21, wherein the plurality of bandwidths with the first relationship includes two bandwidths corresponding to at least one of following: the plurality of bandwidths occupy an overlapping region of frequency domain resources; the plurality of bandwidths have a same bandwidth index; the plurality of bandwidths are all with active state; the plurality of bandwidths have a same transmission direction, wherein the transmission direction comprises an uplink direction or a downlink direction; or different bandwidths of the plurality of bandwidths belongs to a different bandwidth group.
[Claim 23]
The method of any of claims 16 to 21, wherein the plurality of bandwidths with the first relationship includes two bandwidths corresponding to one of following: two component carriers separately belonging to a master cell group and a secondary cell group; two component carriers separately belonging to two component carrier groups of a master cell group; two component carriers separately belonging to two component carrier groups of a secondary cell group; or two bandwidth parts separately belonging to two component carriers, wherein the two component carriers comprises one of following: two component carriers separately belonging to a master cell group and a secondary cell group; two component carriers separately belonging to two component carrier groups of a master cell group; or two component carriers separately belonging to two component carrier groups of a secondary cell group.
[Claim 24]
A method, comprising: determining, according to a first information, at least one condition that is to be satisfied by resources occupied by at least two of channels , wherein the first information comprises information about control resource set (CORESET) group and serving cell.
[Claim 25]
A method, comprising: determining, according to a first information, at least one condition that is to be satisfied by resources occupied by at least two of channels , wherein the first information comprises information about bandwidth part and serving cell.
[Claim 26]
The method of claim 24 or 25, wherein the one condition comprising at least one of: when a first information corresponding to two channels is same, a first condition is satisfied between resources occupied by the two channels ; when the first information corresponding to the two channels is different, the first condition is not satisfied between the resources occupied by the two channels ; when the channel and/or signal is uplink, and the first information corresponding to a PUSCH configured grant and the channel and/or signal is same, a second condition is satisfied between the channel and/or signal and a transmission occasion of the PUSCH configured grant; or when the channel and/or the signal is uplink, and the first information corresponding to the PUSCH configured grant is different, the second condition is not satisfied between the channel and/or signal and a transmission occasion of the PUSCH configured grant.
[Claim 27]
The method of claim 26, wherein the second condition comprises at least one of: when an end position of a control channel of the channel and/or signal is within a predetermined time window before a starting time domain symbol of a transmission occasion of the PUSCH configured grant, the time domain between the channel and/or signal and the transmission occasion of the PUSCH configured grant are non-overlapping; or when the uplink channel scheduled by a control channel, and a transmission occasion of a PUSCH configured grant, have a same process number, an end position of the control channel cannot occur within a predetermined time window prior to a starting time domain symbol of the transmission occasion of the PUSCH configured grant.
[Claim 28]
The method of claim 26, wherein the first condition comprises at least one of: the two channels are non-overlapping in time domain, wherein the two channels correspond to a same process or different processes; or when an end position of a control channel of a first of the two channels occurs after an end position of a second of the two channels , a starting position of the first of the two channels cannot be earlier than the end position of the second of the two channels , wherein the two channels correspond to a same process or different processes; or when the two channels correspond to a same process number, a starting position of one of the two channels cannot be earlier than an end position of a last channel having the same process number.
[Claim 29]
The method of claim 26, wherein the first condition comprises information about CORESET group and serving cell, and: the first information corresponding to the two channels is the same, includes having the two channels corresponding to a same CORESET group, and having the two channels in one serving cell; or the first information corresponding to the two channels is different, includes having the two channels corresponding to a different CORESET groups, and/or having the two channels in different serving cells.
[Claim 30]
The method of claim 26, wherein the first condition comprises information about bandwidth part and serving cell, and: the first information corresponding to the two channels is the same, and includes having the two channels corresponding to a same BWP group, and having the two channels in one serving cell; or the first information corresponding to the two channels is different, and includes having the two channels corresponding to a different BWP groups, and/or having the two channels in different serving cells.
[Claim 31]
A computer readable storage medium storing instructions, which when executed by one or more processors can cause the one or more processors to perform the method of claims 1-30.

Drawings

[ Fig. 1]  
[ Fig. 2]  
[ Fig. 3]  
[ Fig. 4]  
[ Fig. 5]  
[ Fig. 6]  
[ Fig. 7]  
[ Fig. 8]  
[ Fig. 9]