Method and system for determining uplink and downlink transmission parameters in a wireless communication network

Abstract

Embodiments of the present invention provide a system and method for communicating between a wireless communication device and a wireless communication node. In one embodiment, the system and method are configured to determine a monitoring status of a search space set of a control resource set (CORESET) group according to the CORESET group; and monitor a candidate PDCCH in the search space set when the monitoring status is determined to be monitoring. In another embodiment, the system and method are configured to determine at least one condition satisfied by a resource occupied by at least one of a channel or a signal according to first information, wherein the first information comprises information about a control resource set (CORESET) group and a serving cell.

Description

Technical Field

[0001] This invention relates to wireless communication, and more specifically, to a method and system for determining uplink and downlink transmission parameters in a wireless communication network. Background Technology

[0002] Wireless communication networks can include network communication devices and network communication nodes. In some cases, network communication devices can receive communication signals from more than one network communication node. Summary of the Invention

[0003] The exemplary embodiments disclosed herein are intended to address problems relating to one or more issues raised in the prior art, and additional features will be readily understood when taken into account with reference to the following detailed description. Exemplary systems, methods, apparatuses, and computer program products are disclosed according to various embodiments. However, it should be understood that these embodiments are given by way of example and not limitation, and it will be apparent to those skilled in the art who have read this content that various modifications can be made to the disclosed embodiments while still remaining within the scope of the invention.

[0004] In one embodiment, a method is provided that includes determining a monitoring status of a search space set of a control resource set (CORESET) group. The method further includes, when the monitoring status is determined to be non-monitoring, not monitoring candidate PDCCHs in the search space set.

[0005] In another embodiment, a method is provided, the method comprising: determining, based on first information, at least one condition satisfied by a resource occupied by at least one of a channel or a signal. In some embodiments, the first information includes information about a control resource set (CORESET) group and a serving cell.

[0006] In another embodiment, a method is provided that includes determining that a plurality of bandwidths in the frequency domain are in a defined relationship, each of the plurality of bandwidths having at least one set of parameters. In some embodiments, a relationship exists between the respective sets of parameters.

[0007] In another embodiment, a method is provided, the method comprising: determining, based on first information, at least one condition satisfied by a resource occupied by at least one of a channel or a signal. In some embodiments, the first information includes information about a bandwidth portion and a serving cell.

[0008] The above and other aspects and their implementations are described in more detail in the accompanying drawings, description and claims of this invention. Attached Figure Description

[0009] Various exemplary embodiments of the present solution are described in detail below with reference to the accompanying drawings and illustrations. The drawings are provided for illustrative purposes only and depict only exemplary embodiments of the present solution to facilitate the reader's understanding of it. Therefore, the drawings should not be considered as limitations on the breadth, scope, or applicability of the present solution. It should be noted that these drawings are not necessarily drawn to scale for clarity and ease of illustration.

[0010] Figure 1 An example cellular communication network according to an embodiment of the present invention is shown, in which the techniques and other aspects disclosed in the present invention can be implemented.

[0011] Figure 2 A block diagram of an example base station and user equipment apparatus according to some embodiments of the present invention is shown.

[0012] Figure 3 A wireless communication system comprising a UE communicating with two communication points is shown according to some embodiments of the present invention.

[0013] Figure 4 Example configurations of CORESET and search space according to some embodiments of the present invention are shown.

[0014] Figure 5 A flowchart is shown as one method of a PDCCH search space preservation strategy according to some embodiments of the present invention.

[0015] Figure 6-8 CORESET groups for various time slots are shown according to some embodiments of the present invention.

[0016] Figure 9 A flowchart is shown for another method of maintaining the PDCCH search space according to some embodiments of the present invention. Detailed Implementation

[0017] Various exemplary embodiments of this solution are described below with reference to the accompanying drawings to enable those skilled in the art to implement and use this solution. It will be apparent to those skilled in the art that various changes or modifications can be made to the examples described herein without departing from the scope of this solution after reading this invention. Therefore, this solution is not limited to the exemplary embodiments and applications described and illustrated in this invention. Furthermore, the specific order and hierarchy of steps in the methods disclosed in this invention are merely exemplary methods. Based on design preferences, the specific order or hierarchy of steps in the disclosed methods or processes can be rearranged while remaining within the scope of this solution. Therefore, those skilled in the art will understand that the methods and / or techniques disclosed in this invention present various steps or actions in an exemplary order, and this solution is not limited to the presented specific order or hierarchy unless explicitly stated otherwise.

[0018] Figure 1 An example wireless communication network and / or system 100 according to an embodiment of the present invention is illustrated, in which the techniques disclosed herein can be implemented. In the following discussion, the wireless communication network 100 can be any wireless network, such as a cellular network or a narrowband Internet of Things (NB-IoT) network, and is referred to herein as "network 100". Such an example network 100 includes a base station 102 (also referred to as "communication point 102" or "BS 102" or "transmitter-receiver point (TRP)" or "communication node") and user equipment devices 104 (hereinafter referred to as "UE 104"), which 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 covering a geographic area 101. Figure 1 In this context, communication point 102 and UE 104 are contained within their respective geographical boundaries in cell 126. Each of the other cells 130, 132, 134, 136, 138, and 140 may include at least one base station that operates with its allocated bandwidth to provide sufficient wireless coverage to its intended users.

[0019] For example, communication point 102 can operate on the allocated channel transmission bandwidth to provide sufficient coverage to UE 104. Communication point 102 and UE 104 can communicate via downlink radio frame 118 and uplink radio frame 124, respectively. Each radio frame 118 / 124 can be further divided into subframes 120 / 127 that may include data symbols 122 / 128. In this invention, communication point 102 and UE 104 are described herein as non-limiting examples of "communication nodes" that can generally practice the methods disclosed herein. According to various embodiments of this solution, such communication nodes can be capable of wireless and / or wired communication.

[0020] Figure 2A block diagram of an example wireless communication system 200 for transmitting and receiving wireless communication signals, such as Orthogonal Frequency Division Multiplexing (OFDM) / Orthogonal Frequency Division Multiple Access (OFDMA) signals, according to some embodiments of this solution is shown. System 200 may include components and units configured to support known or conventional operating characteristics that do not need to be described in detail herein. In one illustrative embodiment, as described above, system 200 can be used in applications such as... Figure 1 The wireless communication environment 100 is a wireless communication environment in which communication (e.g., sending and receiving) data symbols are performed.

[0021] System 200 typically includes a base station 202 (also referred to as "communication point 202") and a user equipment device 204 (hereinafter referred to as "UE 204"). Communication point 202 includes a 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 as needed via a data communication bus 220. 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 as needed via a data communication bus 240. Communication point 202 communicates with UE 204 via a communication channel 250 (which may be any wireless channel or other medium suitable for data transmission as described in this invention).

[0022] As will be understood by those skilled in the art, system 200 may further include, in addition to Figure 2 Any number of modules other than those shown. Those skilled in the art will understand that the various illustrative blocks, modules, circuits, and processing logic described in conjunction with the embodiments disclosed herein can 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, the various illustrative components, blocks, modules, circuits, and steps are generally described according to their functionality. Whether this functionality is implemented as hardware, firmware, or software depends on the specific application and design constraints imposed on the system as a whole. Those skilled in the art can implement this functionality in a suitable manner for each specific application, but such implementation should not be construed as limiting the scope of the invention.

[0023] According to some embodiments, UE transceiver 230 may be referred to herein as "uplink" transceiver 230, which includes a radio frequency (RF) transmitter and an RF receiver, each including circuitry coupled to antenna 232. A duplex switch (not shown) may alternatively couple the uplink transmitter or receiver to the uplink antenna in a time-duplex manner. Similarly, according to some embodiments, communication point transceiver 210 may be referred to herein as "downlink" transceiver 210, which includes an RF transmitter and an RF receiver, each including circuitry coupled to antenna 212. A downlink duplex switch may alternatively couple the downlink transmitter or receiver to downlink antenna 212 in a time-duplex manner. The operation of the two transceiver modules 210 and 230 can be coordinated in a timely manner such that while the downlink transmitter is coupled to downlink antenna 212, the uplink receiver circuitry is coupled to uplink antenna 232 for receiving transmissions on radio transmission 250. In some embodiments, there is tight time synchronization with a minimum guard time between changes in duplex direction.

[0024] UE transceiver 230 and base transceiver 210 are configured to communicate via wireless data communication link 250 and cooperate with RF antenna arrangements 212 / 232 appropriately configured to support proprietary wireless communication protocols and modulation schemes. In some illustrative embodiments, UE transceiver 210 and base transceiver 210 are configured to support industry standards such as Long Term Evolution (LTE) and emerging 5G standards. However, it should be understood that the invention is not necessarily limited when applied to proprietary standards and related protocols. Instead, UE transceiver 230 and base transceiver 210 can be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.

[0025] According to various embodiments, for example, communication point 202 may be an evolved Node B (eNB), a serving eNB, a target eNB, a femtocell, or a picocell. In some embodiments, UE 204 may be embodied in various types of user equipment, such as mobile phones, smartphones, personal digital assistants (PDAs), tablets, laptops, wearable computing devices, etc. Processor modules 214 and 236 may be implemented or implemented using a general-purpose processor, content-addressable memory, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), 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 way, the processor may be implemented as a microprocessor, a controller, a microcontroller, a state machine, etc. The processor may also be implemented as a combination of computing devices, such as a combination of a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors combined with a digital signal processor core, or any other such configuration.

[0026] Furthermore, the steps of the methods or algorithms described in conjunction with the embodiments disclosed in this invention can be directly embodied in hardware, firmware, software modules executed by processor modules 214 and 236 respectively, or any actual combination thereof. Memory modules 216 and 234 can be implemented as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art. In this regard, memory modules 216 and 234 can be coupled to processor modules 210 and 230 respectively, such that processor modules 210 and 230 can read information from and write information to memory modules 216 and 234 respectively. Memory modules 216 and 234 can also be integrated into their respective processor modules 210 and 230. In some embodiments, memory modules 216 and 234 may each include a cache memory for storing temporary variables or other intermediate information during the execution of instructions to be executed by processor modules 210 and 230 respectively. Memory modules 216 and 234 may each include non-volatile memory for storing instructions to be executed by processor modules 210 and 230, respectively.

[0027] Network communication module 218 typically represents the hardware, software, firmware, processing logic, and / or other components of base station 202 that enable bidirectional communication between base station transceiver 210 and other network components and communication nodes configured to communicate with base station 202. For example, network communication module 218 may be configured to support Internet or WiMAX services. In a typical deployment, but not limited to, network communication module 218 provides an 802.3 Ethernet interface, enabling base station transceiver 210 to communicate with traditional Ethernet-based computer networks. In this way, network communication module 218 may include a physical interface for connecting to a computer network (e.g., a mobile switching center (MSC)). The terms “configured for,” “configured to,” and their equivalents used herein for specific operations or functions refer to a specific operation or function, and references to devices, components, circuits, structures, machines, signals, etc., refer to the physical construction, programming, patterning, and / or arrangement to perform a specific operation or function.

[0028] The aspects of the network environment and devices that can be used to implement the systems, methods and apparatuses described in this invention have been discussed, and further details will now be described.

[0029] Figure 3A wireless communication system is illustrated, comprising a UE communicating with two communication points (e.g., one or more BSs, or one or more RRUs within a BS). Specifically, UE 306 communicates with a first communication point 302 and a second communication point 304 within the same cell. There may be no backhaul communication link between the first and second communication points. The first communication point may send DCI1 (Downlink Control Information) and PDSCH1 (Physical Downlink Shared Channel) to the UE, where DCI1 includes scheduling information for PDSCH1, while the second communication point may send DCI2 and PDSCH2 to the same UE, where DCI2 includes scheduling information for PDSCH2. Using two communication points can improve link robustness and spectral efficiency, but it can also create complexities regarding supporting two independently scheduled terminals within the same network.

[0030] Each communication point can transmit PDCCHs during downlink symbols in a time slot within the NR. A search space set is a set of candidate PDCCHs that occupy some CCEs (Control Channel Elements) at a given aggregation level, which the UE should attempt to blindly decode. Blind detection is the process by which the UE attempts to detect any PDCCH (Physical Downlink Control Channel) candidates transmitted by one or more communication points. Multiple search space sets can be associated with the same CORESET (Control Resource Set). When the number of candidate PDCCHs configured in a time slot or the number of non-overlapping CCEs used to monitor candidate PDCCHs exceeds a predetermined value, some search space sets may have to be discarded based on predetermined rules. Each search space set is retained or discarded according to priority. The UE needs to detect candidate PDCCHs in the retained search space sets and perform channel and / or signal transmissions based on the detected candidate PDCCHs. The UE does not expect to detect candidate PDCCHs in the discarded search space sets. The predetermined rules need to consider the balance of candidate PDCCHs retained among multiple first communication points.

[0031] Refer again Figure 3 Two communication points transmit downlink data channels to the UE. Specifically, there is no ideal backhaul between the two communication points. These two communication points independently schedule the downlink data channels, with DCI1 scheduling the channel or signal of the first communication point and DCI2 scheduling the channel or signal of the second communication point. Of course, this embodiment does not exclude the possibility of an ideal backhaul between the two communication points, but the channel characteristics of the two channels between the 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 channels or signals to the UE. The time-frequency resources occupied by PDSCH1 and PDSCH2 can be empty (non-overlapping), partially overlapping, or completely overlapping.

[0032] In NR-Rel 15, the parameters used for PDCCH include CORESET and search space sets. One search space set can be associated with one CORESET, but one CORESET can be associated with multiple search space sets. Multiple bandwidth portions (BWPs) can be configured in a downlink serving cell, and up to three CORESETs can be configured in each BWP, with up to 10 search space sets configured in each BWP.

[0033] The following parameters can be configured in CORESET: the frequency domain resources that candidate PDCCHs can occupy, the quasi-co-location reference signals of the PDCCH demodulation reference signals in CORESET, and the number of time domain symbols occupied by candidate PDCCHs in a PDCCH scenario. For example, different sets of quasi-co-location reference signals represent different transmit beams used by the base station to transmit PDCCHs, while CORESET corresponds to a set of quasi-co-location reference signals, that is, CORESET has only one transmit beam.

[0034] Configure the following parameters in each search space set: the period and period offset of the PDCCH occasion in the time unit of the time slot, the starting time domain symbol occupied by each PDCCH occasion in the time slot, and the number of candidate PDCCHs included in each set.

[0035] Figure 4 Example configurations for CORESET and search space are shown. Specifically, Figure 4 Time slot n400 is shown, which includes CORSET 2 402 associated with search space set 2 404 and search space set 3 406. If the number of time-domain symbols for a PDCCH occasion in CORESET2 is configured to 1, then a PDCCH occasion in search space set 2 408 (or search space set 3 410) occupies 1 frequency-domain resource and 1 time-domain symbol, allocated / configured by CORESET2. In each PDCCH occasion within each search space set, the number of PDCCH candidates is equal to the number of candidate PDCCHs included / configured in the search space set. For example, in Figure 4 In the context of three PDCCH scenarios, search space set 2 in the time slots has initial time-domain symbols {0, 4, 10}. Furthermore, if the time slot period of search space set 2 is two time slots, then search space set 2 occupies time-domain symbols {0, 4, 10} in every two time slots. For four PDCCH scenarios, search space set 3 in the time slots has initial time-domain symbols {2, 6, 8, 9}. If search space set 3 has a time slot period of four time slots, then search space set 3 in one of the four time slots occupies time-domain symbols {2, 6, 8, 9} in each PDCCH scenario with one time-domain symbol. Figure 4In this context, search space set 2 and search space set 3 within a time slot have zero overlapping time-domain symbols. Different search space sets associated with the same CORESET can also occupy non-zero / non-empty overlapping time-domain symbols.

[0036] As described above, in a CORESET, the configuration includes time-frequency resources corresponding to a PDCCH event. Within each search space set, the time-domain mode for the PDCCH events in each search space is configured, including the PDCCH event mode within a time slot and the mode for the time slot containing the PDCCH event. Each search space set associated with the same CORESET shares the parameters configured in the CORESET.

[0037] As can be seen from the above description, different search space sets can have different PDCCH scenario patterns, therefore the sets of search space sets included in different time slots can be different. For example, time slot n includes search space sets {1-8}; time slot n+1 only includes search space sets {1,3,6}; and time slot n+2 only includes search space set {7}. Therefore, there are cases where some time slots include too many search space sets or too many candidate PDCCHs with large candidate PDCCHs. However, the UE's ability to process PDCCHs in a single time slot is limited, and for this purpose, some candidate PDCCHs must be discarded according to predetermined rules. The complexity of processing PDCCHs includes the detection of candidate PDCCHs and the number of non-overlapping CCEs of candidate PDCCHs.

[0038] like Figure 3 As shown, the predefined rules can consider the case of multiple communication points to avoid situations where the terminal sometimes only monitors candidate PDCCHs corresponding to only one communication point, and where the number of candidate PDCCHs retained in one communication point can be much greater than that retained in another. Therefore, the retention strategy / implementation for the search space set should also consider the multi-communication point scenario.

[0039] like Figure 3 As shown, communication between the UE and two communication points can improve link robustness and spectrum efficiency. However, how to support independent scheduling between the two communication points and the UE, especially between two communication points within the same serving cell and the UE within the same cell, while minimizing the communication / coordination volume between the two communication points, is a challenge, thus effectively supporting scenarios where two communication points without ideal backhaul communicate with the same UE.

[0040] As discussed in this invention, the frequency domain bandwidth can be one of the following: serving cell, BWP within the serving cell, and contiguous PRB (physical resource blocks). A search space set includes one or more aggregation degree (also called aggregation level) search spaces, and each aggregation degree search space corresponds to an aggregation degree and the candidate PDCCHs included in the aggregation degree search space. The search space set can be referred to as / refers to the set of search spaces, i.e., the set of aggregation degree search spaces. In the following description, the serving cell can be (or correspond to) CC (component carrier). In this embodiment, the detected candidate PDCCH can be determined based on CORESET groups. For example, each CORESET group corresponds to a communication point. Specifically, the following two CORESET groups can be considered as examples. Of course, this does not preclude the possibility that the number of CORESET groups included in a frequency domain bandwidth can be other positive integers greater than or equal to 1.

[0041] 0≤i<I css Indicates the use of CSS (Public Search Space) set S css (i) The number of candidate PDCCHs that have been monitored and counted, and 0≤j<J uss Indicates the use of USS (UE-specific search space) set S uss (j) The number of candidate PDCCHs that have been monitored and counted. The numbers are, in order, the number of candidate PDCCHs and the number of non-overlapping CCEs included in the common search space set falling in CORESET group i, i = 1, 2.

[0042] For all search space sets within time slot n, use S css Represents a set of bases I css CSS set, using S uss Represents a set of bases J uss USS set. USS set j 0≤j<J uss In S uss The position in the search space set index is determined by the ascending order of the search space set index.

[0043] V CCE (S uss (j) represents the search space set S. uss The set of non-overlapping CCEs of (j), and This indicates that candidate PDCCHs are considered for monitoring the allocation of the CSS set and the set S is considered for monitoring all search space sets. uss (k) The candidate PDCCH of the assignment 0≤k≤j is used to determine the search space set S. uss (j) V of non-overlapping CCE CCE (Suss (j)) cardinality.

[0044] The UE does not expect to be configured with more than the maximum number of monitored candidate PDCCHs and non-overlapping CCEs per slot than the corresponding maximum number of CSS sets per slot.

[0045] The monitoring status of the search space can be determined according to at least one of the following methods: Method 1-Method 5. When the monitoring status is "not monitoring", the UE does not monitor the PDCH candidates in the search space set, i.e., discards the search space set. When the monitoring status is "monitoring", the UE monitors the PDCH candidates in the search space set, i.e., retains the search space set, and the UE detects the PDCH candidates in the search space set.

[0046] Method 1

[0047] Step 1:

[0048] First, the candidate PDCCH of the serving cell is determined using the subcarrier spacing parameter μ in the time slot. The maximum number (i.e., D1) and the non-overlapping CCEs of candidate PDCCHs The maximum value (i.e., E1). The largest candidate PDCCH in CORESET group 1. (i.e., D2 of CORESET group 1) and candidate PDCCH The maximum value of non-overlapping CCES (i.e., E2 of CORESET group 1) and candidate PDCCH in CORESET group 2. The maximum number of (i.e., D2 of CORESET group 2) and candidate PDCCH The maximum value of the non-overlapping CCE (i.e., E2 of CORESET group 1). They are obtained based on the following information. The subcarrier spacing parameter μ, the predetermined value, the capability value reported by the terminal (i.e., UE), and the number of serving cells for the subcarrier spacing parameter μ.

[0049] for Their acquisition / association parameters also include the number of communication points in the serving cell, which is obtained according to one of the following methods: the number of CORESET groups included in the serving cell; the number of CORESET groups included in the serving cell that schedules the serving cell; or the number of sets of parameters of the same type configured in the serving cell for PDSCH. The number of CORESET groups included in a serving cell is the number of CORESETs included in the active BWP in that serving cell. If the serving cell is an inactive serving cell, it is the number of CORESET groups in the scheduled BWP. Parameters of the same type used for PDSCH include one or more of the following: channel scrambling sequence parameters, process number set, and PUCCH resource set. Other parameters may also be included.

[0050] Step 2

[0051] Use the following pseudocode to determine the set of search spaces to be reserved:

[0052] The goal is to focus on detecting candidate PDCCHs within the public search space.

[0053]

[0054]

[0055] Among them, those used for monitoring Candidate PDCCHs are assigned to the USS set S uss (j) represents the search space set S USS(j) The monitoring status is "monitoring", and the UE detects candidate PDCCHs in the search space set. The number of candidate PDCCHs counted in the CSS set of the scheduled cell in the time slot. Let i = 1, 2 be the number of non-overlapping CCEs of candidate PDCCHs monitored in the CORESET group i of the scheduled cell in the time slot.

[0056] In summary, the preservation strategy for the PDCCH search space set in Method 1 is as follows: Figure 5 As shown, Figure 5 The D_Cell in the above includes the above and Figure 5 The D_CORESET group (i) includes the above. D_USS(j) includes and C(V) CCE (S uss (j)).

[0057] Specifically, such as Figure 6-8As shown, CORESET group 1 includes... Figure 3 The first communication point 1 in the network corresponds to {CORESET1, CORESET2, CORESET3}, and CORESET group 2 includes the network with the network. Figure 3 The first communication point 2 corresponds to {CORESET4, CORESET5}. For simplicity, in Figure 6-8 The candidate PDCCH is considered only in the search space set. The number. Assume and 40 each, It is 60, and Figures 6 to 8 A schematic diagram of the search space sets contained in different time slots is shown. After using the search space set preservation scheme discussed in Method 1 above, in Figure 6 The search space set retained in slot n1 is {USS1, USS3, USS4, USS5} (at this time, 40 candidate PDCCHs are retained in CORESET group 1, and 20 candidate PDCCHs are retained in CORESET group 2). Figure 7 The search space set reserved in slot n2 is {USS1}. It can be seen that USS2 is not reserved at this time; otherwise, although the serving cell has not exceeded the limit, CORESET group 1 would have exceeded it. Figure 8 The search space set retained in time slot n3 is {USS1, USS3, USS8, USS9}.

[0058] Method 2

[0059] Step 1:

[0060] Step 1 in this method is basically the same as Method 1 described above, except that the search space set in a time slot is divided into two groups, and the search space sets associated with CORESETs in the same CORESET group form search space set groups, and search space sets with CORESETs from different CORESET groups belong to different search space set groups. The search space sets in the search space set groups are arranged in ascending order according to the search space set index. Assuming CORESET group 1 corresponds to... Figure 3 The search space set group 1 and communication point 1, and CORESET group 2 correspond to Figure 3 The search space set 2 is the communication point 1.

[0061] For all search space sets within time slot n, S css Represents a set of bases I css CSS set and S USS,CORESET group 1 Represents a set of bases J USS,CORESET group 1 The USS set of CORESET group 1. USS set sj,CORESET group 1 , 0≤s j,CORESET group 1 <J USS,CORESET group 1 In S USS,CORESET group 1 The position is determined by the ascending order of the search space set index. And S USS,CORESET group 2 Represents a set of bases J USS,CORESET group 2 The USS set of CORESET group 2. USS set s j,CORESET group 2 , 0≤s j,CORESET group 2 <J USS,CORESET group 2 In S USS,CORESET group 2S USS,CORESET group 1 The positions within are determined by the ascending order of the search space set index.

[0062] For all search space sets within time slot n, use a cardinality of I. css CSS set represents S css and the base is J uss The USS set represents S uss USS collections j , 0≤j<J uss In S uss The position is determined by the ascending order of the search space set index.

[0063] Step 2:

[0064] Step 2 can be achieved using the following pseudocode:

[0065]

[0066]

[0067] In Method 2, the monitoring status of the search space set is determined sequentially within both CORESET groups. Unlike Scheme 1, Method 2 determines the monitoring status of the search space set solely based on its index order. Method 2 employs... Figure 6 In time slot n, the reserved search space set is {USS1, USS5, USS6, USS3} (at this time, 30 candidate PDCCHs are reserved in CORESET group 1 and 30 candidate PDCCHs are reserved in CORESET group 2). Figure 7 This shows that the search space set of {USS1} is preserved in time slot n2, and USS2 is not preserved at this time either, otherwise it would exceed the limit. Figure 8 The search space set retained in time slot n3 is {USS1, USS8, USS3, USS9}.

[0068] Method 3

[0069] In Method 3, each CORESET group independently determines the retention of the search space set. This means ensuring that the number of candidate PDCCHs and non-overlapping CCEs in the retained search space set of each CORESET group does not exceed the maximum threshold for these numbers corresponding to that CORESET group. During this process, when determining the monitoring status of the search space, we do not calculate / consider the maximum threshold for the cell.

[0070] Using method 3, Figure 6 The search space set retained in slot n1 is {USS1, USS3, USS4, USS5, USS6, USS7} (at this time, 40 candidate PDCCHs are retained in CORESET group 1, and CORESET group 2 retains 40 candidate PDCCHs). Figure 7 In this context, the search space set reserved for time slot n2 is {USS1}. It is evident that USS2 is also not reserved at this point; otherwise, it would exceed [the limit]. Figure 8 The search space set retained in time slot n3 is {USS1, USS3, USS9, USS8}.

[0071] The solution above does not address the issue of retaining USS2 in time slot n2. When USS2 is retained, the total number in the cells of time slot n2 does not exceed the cell-level threshold, but it exceeds the threshold of CORESET group 1. Therefore, we can first use method 2 or method 1 to determine the monitoring status of all USS sets in the cells of the time slot, then determine the monitoring status of the search space sets that were discarded in the first loop, and then check whether the total number in the cells exceeds the cell-level threshold. If it does not exceed the threshold, the search space set can be retained; here, we do not care whether the limit of CORESET group is exceeded.

[0072] Method 4

[0073] like Figure 9 As shown, after the operation of method 1 is completed, i.e., j = J is reached first. USS Subsequently, if the number of retained search space sets is less than the maximum threshold for that cell, we can continue to check whether that number exceeds the cell's threshold (D_Cell), and check within the search space set of USS_1 whether to retain or discard. Figure 9 After method 4 is shown, and referring to Figure 6 , Figure 6 The search space set retained in slot n1 is {USS1, USS3, USS4, USS5} (at this time, CORESET group 1 retains 40 candidate PDCCHs, and CORESET group 2 retains 20 candidate PDCCHs). Figure 7The search space set reserved in time slot n2 is {USS1, USS2}, and it can be seen that USS2 is reserved at this time. Figure 8 The search space set retained in time slot n3 is {USS1, USS3, USS8, USS9}.

[0074] Method 5

[0075] Similar to Method 4, after the operations in Method 2, if the number of candidate PDCCHs in the retained search space set is less than the maximum threshold of the cell, we can continue to check the monitoring status of the USS groups discarded in the above operations of Method 2. According to Method 5, and referring to... Figure 6 , Figure 6 The search space set retained in slot n1 is {USS1, USS3, USS4, USS5, USS6, USS7} (at this time, 40 candidate PDCCHs are retained in CORESET group 1, and 40 candidate PDCCHs are retained in CORESET group 2), and Figure 7 The search space set reserved by time slot n2 is {USS1, USS2}. USS2 is reserved at this point; otherwise, it would exceed the limit. Figure 8 The search space set retained in time slot n3 is {USS1, USS8, USS3, USS9}.

[0076] Retain the above PDCCH search space set

[0077] When the PDCCH and the channels and / or signals scheduled by the PDCCH are in different serving cells, i.e., when cross-CC scheduling occurs, each serving cell (where the scheduled channels and / or signals are camped) is checked independently to determine whether its search space set is retained. Alternatively, it can be determined whether to retain / discard only the search space set for the SP cell (Dedicated Primary Cell). When configuring the search space set for the Scell, the terminal does not expect the number of candidate PDCCHs / non-overlapping CCEs in the search space set within a time slot to exceed the maximum allowed value for that cell, or to exceed the maximum threshold of the corresponding CORESET group.

[0078] Alternatively, if the number of communication points in the Spcell exceeds a predefined number, the aforementioned search space set is reserved in the serving cell. When performing configuration, the terminal does not want the number of candidate PDCCHs / non-overlapping CCEs in the search space set within a time slot to exceed the maximum allowed by the cell and the maximum allowed by the CORESET group.

[0079] Assume a communication point corresponds to a CORESET group to handle methods 1-5 discussed above. Alternatively, assume a communication point corresponds to a BWP group / BWP, and use the BWP group / BWP within the cell instead of the CORESET group to similarly handle methods 1-5. That is, determine the monitoring status of the search space based on the BWP group / BWP within the cell. A CORESET group includes the CORESETs used for the cell. The number of CORESET groups includes the CORESETs used for the cell. Multiple BWPs are used for the cell. The monitoring status can be monitored or not monitored.

[0080] The active DL BWP on the CCE set is not used for serving cell n CI The search space set s in CORESET p j indexed The candidate PDCCHs are counted to monitor the search space set s i <s j Does it exist with an index? Candidate PDCCH, or does it exist with an index? and The candidate PDCCH, serving cell n using the same CCE set CI In the CORESET p of the active DL BWP, the candidate PDCCHs have the same scrambling, and the corresponding DCI formats used for the candidate PDCCHs have the same size; otherwise, for those with indexes... Candidate PDCCHs are counted for monitoring.

[0081] Two communication points in the same community

[0082] like Figure 3 As shown, in order to effectively support communication between two communication points and one terminal, reduce the amount of coordination required between the two communication points, and reduce the impact of interaction latency between communication points on system performance, the following methods can be used.

[0083] Method 1

[0084] Two communication points are represented by two CORESET groups in the BWP of the serving cell. When the channel and / or signal is scheduled by the same communication point, i.e., when the channel and / or signal is scheduled by the same CORESET group in the serving cell, either a first predetermined condition or a second predetermined condition must be met. When the channel and / or signal is scheduled by different communication points, i.e., when the channel and / or signal is scheduled via different CORESET groups in the serving cell, neither the first predetermined condition nor the second predetermined condition needs to be met.

[0085] Method 2

[0086] Two communication points are represented by two BWPs or two BWP groups under a serving cell. When the channel and / or signal is scheduled by the same communication point, i.e., the channel and / or signal is located in one BWP or the same BWP group within the serving cell, then either the first predetermined condition or the second predetermined condition must be met. When the channel and / or signal is scheduled by different communication points, i.e., the channel and / or signal is located in different BWPs or different BWP groups within the serving cell, neither the first nor the second predetermined condition needs to be met.

[0087] The first predetermined condition includes one or more of the following conditions:

[0088] 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;

[0089] If the end position of the PDCCH for scheduling the first channel and / or signal is later than the end position of the PDCCH for scheduling the second channel and / or signal, the start position of the first channel cannot be earlier than the end position of the second channel and / or signal, where the two channels and / or signals correspond to the same processing or different processing.

[0090] For two channels corresponding to the same process ID, the start position of one channel cannot be earlier than the end position of the last channel under the same process ID.

[0091] The second predetermined condition includes one or more of the following conditions:

[0092] If the end position of the PDCCH scheduling uplink channel and / or signal falls within a predetermined time window before the start symbol of the transmission opportunity of the configured authorized PUSCH, there is no overlap between the time domain resources occupied by the uplink channel and / or signal and the time domain resources of the transmission opportunity of the configured authorized PUSCH.

[0093] If the PDCCH scheduling uplink channel and the PUSCH configuration grant have the same process number, the end position of the PDCCH cannot fall within the predetermined time window before the start symbol of the PUSCH configuration grant.

[0094] The PUSCH configured with authorization is (or may also be called) an unlicensed PUSCH.

[0095] Two communication points from two service cells

[0096] The parameters of the two communication points must meet certain constraints to improve the robustness or frequency efficiency of the link, reduce the complexity of the terminal, and effectively reduce interference between the two links corresponding to the two communication points. The following method was adopted for this purpose.

[0097] Specifically, if two communication points are represented by two CCs (i.e., serving cells), the two CCs can be one of the following: a CC in an MCG and a CC in an SCG; two CCs from two CC groups from an MCG (primary cell group) (or an SCG secondary cell group), where each of the two CC groups in the MCG corresponds to an uplink serving CC including a PUCCH; or different CC groups correspond to different serving cells including a PUCCH.

[0098] For example, the first CC group in the MCG includes Pcells, and the second CC group includes PUCCH-Scells; that is, the two CC groups in the MCG each correspond to a cell that includes a PUCCH. The HARQ-ACK information of the PDSCH in each CC group is fed back into the cell that includes the PUCCH corresponding to the CC group.

[0099] In particular, when the frequency domain resources of two serving cells representing two communication points actually overlap, the parameters in the two serving cells are correlated.

[0100] For example, the BWPs (in an active state) of two serving cells should be identical, or the CP of the active BWPs should be identical, or the digital parameters should be identical. Digital parameters may include at least one of the following: CP, subcarrier spacing, and the number of time-domain symbols included in a timeslot.

[0101] For example, uplink BWPs in two serving cells have a correspondence. For instance, serving cell 1 may correspond to a first communication point, and serving cell 2 may correspond to a second communication point. Serving cell 1 may include {BWP1-1, BWP1-2, BWP1-3}, and serving cell 2 may include {BWP2-1, BWP2-2, BWP2-3}. Then, there is a correspondence 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 method utilizes the index information of BWPs in the BWP group contained in the serving cell to determine the correspondence between BWPs. This embodiment does not exclude whether two frequency domain resources belonging to two different CCs overlap to determine the relationship between BWPs. For example, when two BWPs overlap, a correspondence is determined to exist between them. Or, there may be no overlap, but each BWP is active, and then a correspondence can be determined between them.

[0102] In the existing correspondence, the parameter configuration in one BWP can be related to the parameter configuration of another BWP. The correspondence may include some parameter values ​​being the same in the two BWPs, and / or some combined values ​​of some parameters in the two BWPs not being able to appear simultaneously. The value range of parameters in another BWP can be determined based on the parameter values ​​of one BWP, or the two BWPs can share a parameter indication signaling.

[0103] For example, one of two serving cells may be configured for uplink time-domain transmission, while the other serving cell may not be configured for downlink transmission. Conversely, one serving cell may be configured for downlink time-domain transmission, while the other may not be configured for uplink transmission. Alternatively, the two serving cells may share a set of time-domain structure configuration information, where the time slot structure configuration information may include uplink time-domain symbols, downlink time-domain symbols, and flexible time-domain symbol configuration information for each time slot. The time slot structure configuration information can be transmitted via one or more of system messages, RRC signaling, MAC-CE signaling, and PDCCH signaling.

[0104] For example, when two serving cells include two Pcells and one PUCCH-Scell, and the PUCCHs transmitted in the two cells cannot occupy the same time domain resources, time-division based transmission should be used. Alternatively, when the time domain overlap of the PUCCHs in the two cells is not empty, the information contained in the PUCCHs with time domain overlap in the two cells should be merged into one PUCCH or one PUSCH, and then sent in one of the Pcells or PUCCH-Scells.

[0105] For example, if two corresponding CCs exist, their parameters can be configured independently. However, if one of the CC parameters is not configured, the configuration in the other CC can be shared with the first CC. In another embodiment, some parameters of the corresponding serving cell or BWP can be configured independently, while some parameters can share a configuration signal, and the parameter values ​​can be the same.

[0106] In one aspect, a method includes: determining a monitoring status of a search space set based on first information; and when the monitoring status is determined to be non-monitoring, not monitoring candidate PDCCHs in the search space set, wherein the first information includes one of: a control resource set (CORESET) group or a bandwidth portion (BWP).

[0107] The method further includes: determining the monitoring status of the search space set based on first information and second information, wherein the second information includes at least one of the following: an index of the search space set; a maximum number D1 of candidate PDCCHs monitored for a frequency domain bandwidth in a time slot of the search space set; a maximum number E1 of non-overlapping control channel elements (CCEs) monitored for a frequency domain bandwidth in a time slot; a maximum number D2 of candidate PDCCHs monitored, wherein the candidate PDCCHs correspond to a value of the first information for the frequency domain bandwidth in the time slot; a maximum number E2 of non-overlapping control channel elements detected for the value of the first information for the frequency domain bandwidth in the time slot; or the number of candidate PDCCHs included in the search space set.

[0108] The method may further include: a first set of search space sets and search space sets corresponding to the same value of the first information, wherein each search space set in the first set of search space sets has a monitoring status before the monitoring status of the search space sets is determined.

[0109] The method may further include: determining the monitoring status of the search space set as monitored when a first condition is met; and / or determining the monitoring status of the search space set as unmonitored when the first condition is not met; and wherein the first condition is determined based on at least one of the following: D1, E1, and D2 and E2 corresponding to the first information of the search space set, the total number of candidate PDCCHs in the first set of search space sets, the total number of non-overlapping control channel elements in the first set of search space sets, the total number of candidate PDCCHs in the second set of search space sets, or the total number of non-overlapping control channel elements in the second set of search space sets, wherein, before determining the monitoring status of the search space set, all search space sets in the second set of search space sets are associated with the same cell and have a monitoring status of being monitored. The method may further include: wherein the first set of search space sets and the search space sets correspond to the same value of the first information, and each search space set in the first set of search space sets has a monitoring status that has been determined to be monitored before the monitoring status of the search space sets is determined; wherein, before the monitoring status of the search space sets is determined, all search space sets in the second set of search space sets are associated with the same cell and have a monitoring status that has been determined to be monitored.

[0110] The method may further include, wherein the first condition includes: when the monitoring state of the search space set is monitoring, for a cell in one time slot, the maximum number of candidate PDCCHs included in one or more search space sets in the monitoring state is less than or equal to D1; for a cell in one time slot, the maximum number of non-overlapping control channel elements included in one or more search space sets in the monitoring state is less than or equal to E1; for a time slot and a value of the first information, the maximum number of candidate PDCCHs included in one or more search space sets in the monitoring state is less than or equal to D2; and for a time slot and a value of the first information, the maximum number of non-overlapping control channel elements included in one or more search space sets in the monitoring state is less than or equal to E2.

[0111] The method may further include determining an order based on one of the following, the order being the determination order of monitoring status of multiple UE-dedicated search space sets: the determination order of monitoring status of the multiple UE-dedicated search space sets in a time slot is determined according to the ascending order of the index of the search space set; the determination order of monitoring status of the multiple UE-dedicated search space sets in a time slot is first determined according to the ascending order of the value of the first information associated with the search space set, and then according to the ascending order of the index of the search space set; dividing the search space set into two groups corresponding to two values ​​of the first information respectively, and determining the order of monitoring status of the multiple UE-dedicated search space sets in the time slot according to the groups of the two search space sets.

[0112] The method may further include: after determining the monitoring status of all search space sets for the cell in a time slot according to the first condition, if the total number of candidate PDCCHs in the monitored search space sets is less than D1, and the total number of non-overlapping control channel elements in the monitored search space sets is less than E1, then for a subset of the search space sets whose monitoring status is determined to be non-monitored using the first condition, the monitoring status of the search space in the subset of the search space sets is determined according to the second condition, based on the ascending order of the index values ​​of the search space sets, wherein when the second condition is satisfied, the monitoring status of the search space set of the subset is determined to be monitored; and / or, when the second condition is not satisfied, the monitoring status of the search space in the subset is determined to be non-monitored, wherein the parameter for determining the second condition excludes the first information associated with the search space set in the subset.

[0113] The method may further include, wherein the second condition includes: when the monitoring state of the search space is determined to be monitoring, the following conditions are met: the maximum number of candidate PDCCHs monitored in the search space set having a monitoring state determined to be monitoring cells in the time slot is less than or equal to D1; and the maximum number of non-overlapping control channel elements in the search space set having a monitoring state determined to be monitoring cells in the time slot is less than or equal to E1.

[0114] The method may further include determining the relationship between D1 and D2 and the relationship between E1 and E2 based on at least one of the following: the number of CORESET groups of the scheduled BWP; the number of simultaneously active BWPs in a cell; or the number of values ​​of the same type of PDSCH parameter in a BWP. The method may further include: the same type of PDSCH parameter including parameters of the PDSCH scrambling sequence.

[0115] The method may further include: determining a monitoring state based on the value of the first information according to at least one of the following search space sets: for each value of the first information of a cell in a time slot, the total number of candidate PDCCHs included in one or more search space sets that are determined to be the monitoring state does not exceed the maximum number of candidate control channels corresponding to a value of the first information;

[0116] For each value of the first information of the cell in the time slot, the number of non-overlapping control channel elements in the search space set that are determined to be the state of the monitoring does not exceed the maximum number of non-overlapping control channel elements corresponding to the value of the first information.

[0117] The method may also include monitoring candidate PDCCHs in the search space set when the monitoring status of the search space set is determined to be monitored.

[0118] The method may further include, where the monitoring status can be monitored or not monitored. The method may further include, where the first piece of information corresponds to a cell. The method may further include, where the search space set corresponds to a cell in a time slot.

[0119] On the other hand, the method may include determining that a plurality of bandwidths are associated with a first relationship, each of the plurality of bandwidths corresponding to a set of parameters, wherein a second relationship exists among the sets of parameters corresponding to the plurality of bandwidths.

[0120] The method may further include: wherein the multiple bandwidths include multiple serving cells, and the second relationship includes at least one of the following: the time-domain resources occupied by uplink channels or uplink signals in different serving cells of the multiple serving cells do not overlap; when the time-domain resources occupied by uplink channels or uplink signals in different serving cells of the multiple serving cells overlap, the information in the uplink channels or uplink signals in the different serving cells is merged into one of the uplink channels or uplink signals of one of the multiple serving cells; multiple parameter sets are used for multiple uplink BWPs in the cell; or multiple parameter sets are used for multiple downlink BWPs in the cell.

[0121] The method may further include, wherein the uplink channel includes an uplink control channel, and the plurality of serving cells include serving cells having uplink control channels. The method may further include, wherein the second relationship includes at least one of: corresponding parameters having the same value; parameter sets corresponding to multiple bandwidths having the same value for each parameter type; determining the parameter sets corresponding to multiple bandwidths using the same signaling; a relationship where the corresponding parameters correspond to parameters for signaling information shared across multiple bandwidths; a range of values ​​for a parameter set for a bandwidth that can be obtained based on the values ​​of another parameter set for another bandwidth among the multiple bandwidths; and, when the parameter set for a bandwidth is not configured, determining the parameter set based on the configuration of another parameter set for another of the multiple bandwidths.

[0122] The method may further include, wherein the parameter set is at least one of the following: a bandwidth portion in an active state, digital parameters, time slot structure configuration information, or parameters of a demodulation reference signal, wherein the digital parameters include at least one of the following: a cyclic prefix, a subcarrier spacing, the number of time-domain symbols in a time slot, or time slot structure configuration information, wherein the time slot structure configuration information includes information about the positions of uplink time-domain symbols, downlink time-domain symbols, and flexible time-domain symbols in a time slot.

[0123] The method may further include, wherein the bandwidths among the multiple bandwidths include one of a serving cell, a bandwidth portion, and a contiguous physical resource block. The method may further include, wherein the multiple bandwidths having a first relationship include two bandwidths corresponding to at least one of: multiple bandwidths occupying an overlapping region of frequency domain resources; multiple bandwidths having the same bandwidth index; multiple bandwidths both in a valid state; multiple bandwidths having the same transmission direction, wherein the transmission direction includes an uplink or downlink direction; or different bandwidths among the multiple bandwidths belonging to different bandwidth groups.

[0124] The method may further include, wherein the plurality of bandwidths having a first relationship comprises two bandwidths corresponding to one of the following: two component carriers belonging to a primary cell group and a secondary cell group respectively; two component carriers belonging to two component carrier groups belonging to a primary cell group respectively; two component carriers belonging to two component carrier groups belonging to a secondary cell group respectively; or two bandwidth portions belonging to two component carriers respectively, wherein the two component carriers comprise one of the following: two component carriers belonging to a primary cell group and a secondary cell group respectively; two component carriers belonging to two component carrier groups belonging to a primary cell group respectively; or two component carriers belonging to two component carrier groups belonging to a secondary cell group respectively.

[0125] In some aspects, a method may include determining, based on first information, at least one condition satisfied by resources occupied by at least two channels, wherein the first information includes information about a control resource set (CORESET) group and a serving cell.

[0126] The method may further include determining, based on first information, at least one condition satisfied by the resources occupied by at least two channels, wherein the first information includes information about the bandwidth portion and the serving cell.

[0127] The method may also include, wherein a condition includes at least one of the following:

[0128] When the first information corresponding to two channels is the same, the resources occupied by the two channels satisfy the first condition; when the first information corresponding to two channels is different, the resources occupied by the two channels do not satisfy the first condition; when the channel and / or signal is uplink, and the first information corresponding to the configured authorized PUSCH is the same as the channel and / or signal, the transmission opportunities of the channel and / or signal and the configured authorized PUSCH satisfy the second condition; or when the channel and / or signal is uplink, and the first information corresponding to the configured authorized PUSCH is different, the transmission opportunities of the channel and / or signal and the configured authorized PUSCH do not satisfy the second condition.

[0129] The method may further include, wherein the second condition includes at least one of the following: before the start time-domain symbol of the transmission opportunity of the configured authorized PUSCH, when the end position of the control channel of the channel and / or signal is within a predetermined time window, the time domain of the channel and / or signal does not overlap with that of the transmission opportunity of the configured authorized PUSCH; or when the uplink channel scheduled by the control channel and the transmission opportunity of the configured authorized PUSCH have the same process number, the end position of the control channel cannot appear within a predetermined time window before the start time-domain symbol of the transmission opportunity of the configured authorized PUSCH.

[0130] The method may also include, wherein the first condition includes at least one of the following:

[0131] Two channels are non-overlapping in the time domain, where the two channels correspond to the same process or different processes; or when the end position of the control channel of the first of the two channels appears after the end position of the second of the two channels, the start position of the first of the two channels cannot be earlier than the end position of the second of the two channels, where the two channels correspond to the same process or different processes; or when the two channels correspond to the same process number, the start position of one of the two channels cannot be earlier than the end position of the last channel with the same process number.

[0132] The method may further include, wherein the first condition includes information about the CORESET group and the serving cell, and: the first information corresponding to the two channels is the same, including: making the two channels correspond to the same CORESET group and making the two channels located in one serving cell; or the first information corresponding to the two channels is different, including: making the two channels correspond to different CORESET groups and / or making the two channels located in different serving cells.

[0133] The method may further include, wherein the first condition includes information about the bandwidth portion and the serving cell, and: the first information corresponding to the two channels is the same, and includes: assigning the two channels to the same BWP group and assigning the two channels to a serving cell; or the first information corresponding to the two channels is different, and includes: assigning the two channels to different BWP groups and / or assigning the two channels to different serving cells.

[0134] While various embodiments of the present solution have been described above, it should be understood that they are given by way of example only and not by way of limitation. Similarly, various figures may depict example architectures or configurations, provided to enable those skilled in the art to understand the exemplary features and functionality of the present solution. However, those skilled in the art will understand that the present solution is not limited to the example architectures or configurations shown, but can be implemented using various alternative architectures and configurations. Furthermore, as those skilled in the art will understand, one or more features of one embodiment may be combined with one or more features of another embodiment described in the present invention. Therefore, the breadth and scope of the present invention should not be limited by any of the exemplary embodiments described above.

[0135] It should also be understood that any reference to units using names such as "first," "second," etc., in this invention does not generally limit the number or order of those units. Rather, these names are used in this invention as a convenient means of distinguishing between two or more units or instances of a single unit. Therefore, references to first and second units do not imply that only two units can be used, or that the first unit must somehow precede the second unit.

[0136] Furthermore, those skilled in the art will understand that information and signals can be represented using any of a variety of different technologies. For example, data, instructions, commands, information, signals, bits, and symbols referenced in the above description can be represented by voltage, current, electromagnetic waves, magnetic fields or particles, light fields or particles, or any combination thereof.

[0137] Those skilled in the art will further understand that any of the various illustrative logic blocks, modules, processors, devices, circuits, methods, and functions described in conjunction with aspects of this invention can be implemented by electronic hardware (e.g., digital implementation, analog implementation, or a combination of both), firmware, various forms of program or design code containing instructions (which may be referred to as "software" or "software module" in this invention for convenience), or any combination of these technologies. To clearly illustrate this interchangeability of hardware, firmware, and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally according to their functionality. Whether this functionality is implemented as hardware, firmware, or software, or a combination of these technologies, depends on the specific application and the design constraints imposed on the system as a whole. Those skilled in the art can implement the described functions in various ways for each specific application, but such implementation decisions will not depart from the scope of this invention.

[0138] Furthermore, those skilled in the art will understand that the various illustrative logic blocks, modules, devices, components, and circuits described in this invention may be implemented or executed by integrated circuits (ICs), digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, or any combination thereof, including general-purpose processors. Logic blocks, modules, and circuits may further include antennas and / or transceivers for communication with various components within a network or device. A general-purpose processor may be a microprocessor, but alternatively, the processor may be any conventional processor, controller, or state machine. The processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors combined with a DSP core, or any other suitable configuration to perform the functions described in this invention.

[0139] If implemented as software, the functionality can be stored as one or more instructions or code on a computer-readable medium. Therefore, the steps of the methods or algorithms disclosed in this invention can be implemented as software stored on a computer-readable medium. Computer-readable media include computer storage media and communication media, with communication media including any medium capable of transferring a computer program or code from one place to another. Storage media can be any available medium accessible to a computer. By way of example and not limitation, such computer-readable media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, any other medium that can be used to store desired program code in the form of instructions or data structures and is accessible to a computer.

[0140] In this invention, the term "module" as used herein refers to software, firmware, hardware, and any combination of these elements to perform the relevant functions described herein. Furthermore, for the purposes of discussion, various modules are described as discrete modules; however, it will be apparent to those skilled in the art that two or more modules can be combined to form a single module that performs the relevant functions according to embodiments of this solution.

[0141] Additionally, memory or other storage and communication components may be employed in embodiments of this solution. It should be understood that, for clarity, embodiments of this solution have been described above with reference to different functional units and processors. However, it will be apparent that any suitable functional distribution can be used across different functional units, processing logic units, or domains without departing from this solution. For example, functions illustrated as being performed by a separate processing logic unit or controller may be performed by the same processing logic unit or controller. Therefore, references to dedicated functional units are merely references to suitable devices for providing the described functions and do not indicate a strict logical or physical structure or organization.

Claims

1. A method for determining transmission parameters, comprising: The monitoring status of the search space set is determined based on the first and second information. When the monitoring status is determined to be no monitoring, the candidate PDCCH in the search space set is not monitored; When the monitoring status is determined to be monitoring, candidate PDCCHs in the search space set are monitored; The first information includes: control resource set CORESET group; one of the bandwidth portions BWP includes more than one CORESET group; The second information includes: an index of the search space set; a maximum number D1 of candidate PDCCHs monitored for a frequency bandwidth in a time slot; a maximum number E1 of non-overlapping control channel elements (CCEs) monitored for a frequency bandwidth in the time slot; a maximum number D2 of monitored candidate PDCCHs, wherein the candidate PDCCHs in the time slot correspond to one of more than one CORESET groups in the BWP; a maximum number E2 of monitored non-overlapping control channel elements, wherein the non-overlapping control channel elements in the time slot correspond to one of more than one CORESET groups in the BWP; the search space set includes the number of candidate PDCCHs; wherein a frequency bandwidth is a bandwidth portion BWP; The quantitative relationship between D1 and D2, and the quantitative relationship between E1 and E2, are determined based on the number of more than one CORESET group included in a BWP. When the first condition is met, the monitoring status of the search space set is determined to be monitored; when the first condition is not met, the monitoring status of the search space set is determined to be unmonitored; wherein, the first condition is determined according to the following: D1; E1; D2 and E2 corresponding to the first information of the search space set; The first condition includes: For a cell in the aforementioned time slot, the sum of the number of candidate PDCCHs in the current search space set and the number of candidate PDCCHs in the previously determined search space set under monitoring status is less than or equal to D1. For a cell in the aforementioned time slot, the sum of the number of non-overlapping control channel elements in the current search space set and the number of non-overlapping control channel elements in the previously determined search space set under monitoring status is less than or equal to E1. For a time slot and each of the more than one CORESET groups in the BWP, the sum of the number of candidate PDCCHs in the current search space set and the number of candidate PDCCHs in the previously determined search space sets for monitoring status is less than or equal to D2; and For a time slot and each of the more than one CORESET groups in the BWP, the sum of the number of non-overlapping control channel elements in the current search space set and the number of non-overlapping control channel elements in the previously determined search space set for monitoring is less than or equal to E2.

2. The method according to claim 1, wherein the more than one CORESET group includes two control resource set CORESET groups, and the method further includes: The search space set is divided into two groups of search spaces corresponding to the two control resource sets CORESET, and the monitoring status of multiple UE-dedicated search space sets in the time slot is determined sequentially according to the groups of the two search space sets.

3. The method according to claim 1, wherein determining the monitoring status of the search space set based on the value of the first information includes: For a control resource set CORESET group in more than one CORESET group in a cell in a time slot, the sum of the number of candidate PDCCHs in the current search space set and the number of candidate PDCCHs in the previously determined search space set in the monitoring state does not exceed the maximum number of candidate control channels corresponding to the one control resource set CORESET group. For one of the more than one CORESET groups in the cell of the time slot, the sum of the number of non-overlapping control channel elements in the current search space set and the number of non-overlapping control channel elements in the previously determined search space set in the monitoring state does not exceed the maximum number of non-overlapping control channel elements corresponding to the one control resource set CORESET group.

4. The method according to claim 1, wherein, The monitoring status can be either monitored or not monitored.

5. The method according to any one of claims 1 to 2, wherein, The first piece of information corresponds to a cell.

6. The method according to any one of claims 1 to 2, wherein, The search space set corresponds to a cell in a time slot.

7. The method according to claim 1, further comprising: Based on the first information, a condition is determined that is satisfied by the resources occupied by the two channels, wherein the two channels are channels between the two communication points and the UE; The first information also includes the serving cell; One of the conditions includes at least one of the following: When the first information corresponding to two channels is the same, the resources occupied by the two channels satisfy the third condition; When the first information corresponding to the two channels is different, the resources occupied by the two channels do not satisfy the third condition; The third condition includes information about the CORESET group and serving cell, and: The first information corresponding to the two channels is the same, including: the two channels correspond to the same CORESET group, and the two channels are located in the same serving cell; or The first information corresponding to the two channels is different, including: the two channels correspond to different CORESET groups, and / or the two channels are located in different serving cells.

8. The method according to claim 7, wherein, The condition also includes at least one of the following: When the two channels include an uplink channel and a configuration-granted PUSCH, and the configuration-granted PUSCH and the uplink channel have the same first information, the transmission opportunities configured between the uplink channel and the configuration-granted PUSCH satisfy the second condition. or When the two channels include an uplink channel and a configuration-granted PUSCH, and the first information of the configuration-granted PUSCH is different, the second condition is not satisfied between the transmission opportunities of the uplink channel and the configuration-granted PUSCH. The second condition includes at least one of the following: before the start time-domain symbol of the transmission opportunity of the configured authorized PUSCH, when the end position of the control channel scheduling the uplink channel is within a predetermined time window, the time domain of the uplink channel and the transmission opportunity of the configured authorized PUSCH do not overlap; or, when the uplink channel scheduled by the control channel and the transmission opportunity of the configured authorized PUSCH have the same process number, the end position of the control channel cannot appear within a predetermined time window before the start time-domain symbol of the transmission opportunity of the configured authorized PUSCH.

9. The method according to claim 7, wherein, The third condition includes at least one of the following: The two channels are non-overlapping in the time domain, wherein the two channels correspond to the same process or different processes; or When the end position of the control channel of the first of the two channels appears after the end position of the second of the two channels, the start 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 the same process or different processes; or When the two channels correspond to the same process number, the start position of one of the two channels cannot be earlier than the end position of the last channel with the same process number.

10. A computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform the method of any one of claims 1-9.

Images