CN114503640A - Method and system for determining uplink and downlink transmission parameters in wireless communication network - Google Patents

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

Info

Publication number
CN114503640A
CN114503640A CN201980100942.8A CN201980100942A CN114503640A CN 114503640 A CN114503640 A CN 114503640A CN 201980100942 A CN201980100942 A CN 201980100942A CN 114503640 A CN114503640 A CN 114503640A
Authority
CN
China
Prior art keywords
search space
information
channels
monitoring
cell
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201980100942.8A
Other languages
Chinese (zh)
Inventor
张淑娟
鲁照华
蒋创新
郑国增
李儒岳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of CN114503640A publication Critical patent/CN114503640A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
    • H04W48/12—Access restriction or access information delivery, e.g. discovery data delivery using downlink control channel

Landscapes

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

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 state of a set of search spaces of a CORESET group from a set of control resources CORESET group; and monitoring the candidate PDCCHs in the search space set when the monitoring state is determined to be monitoring. In another embodiment, the system and method are configured to determine at least one condition satisfied by resources occupied by at least one of a channel or signal based on first information, wherein the first information includes information about a control resource set, CORESET, group and serving cell.

Description

Method and system for determining uplink and downlink transmission parameters in wireless communication network
Technical Field
The present invention relates to wireless communications, and more particularly, to a method and system for determining uplink and downlink transmission parameters in a wireless communication network.
Background
The wireless communication network may include a network communication device and a network communication node. In some cases, a network communication device may receive communication signals from more than one network communication node.
Disclosure of Invention
Exemplary embodiments of the present disclosure are directed to solving the problems associated with one or more of the problems set forth in the prior art and providing additional features that will be readily understood by reference to the following detailed description when taken in conjunction with the accompanying drawings. In accordance with various embodiments, exemplary systems, methods, devices, and computer program products are disclosed. It is to be understood, however, that these embodiments are given by way of illustration and not of limitation, and that various modifications to the disclosed embodiments may be apparent to those skilled in the art upon reading this disclosure while remaining within the scope of the invention.
In one embodiment, a method is provided that includes determining a monitoring state of a set of search spaces of a control resource set (CORESET) group from the CORESET group. The method also includes not monitoring the candidate PDCCHs in the search space set when the monitoring state is determined to be unmonitored.
In another embodiment, a method is provided, the method comprising: at least one condition satisfied by resources occupied by at least one of the channels or signals is determined from the first information. In some embodiments, the first information includes information about a control resource set (CORESET) group and a serving cell.
In another embodiment, a method is provided, the method comprising: determining that a plurality of bandwidths in a frequency domain are in a defined relationship, each of the plurality of bandwidths having at least one parameter set. In some embodiments, there is a relationship between respective sets of parameters.
In another embodiment, a method is provided, the method comprising: at least one condition satisfied by resources occupied by at least one of the channels or signals is determined from the first information. In some embodiments, the first information comprises information about the bandwidth part and the serving cell.
The above and other aspects and implementations of the invention are described in more detail in the accompanying drawings, description and claims of the invention.
Drawings
Various exemplary embodiments of the present solution are described in detail below with reference to the following figures and illustrations. The drawings are provided for illustrative purposes only and merely depict exemplary embodiments of the present solution to facilitate the reader's understanding of the present solution. Accordingly, the drawings should not be taken to limit the breadth, scope, or applicability of the present solution. It should be noted that for clarity and ease of illustration, the drawings are not necessarily drawn to scale.
FIG. 1 illustrates an example cellular communication network in which the presently disclosed techniques and other aspects may be implemented, according to an embodiment of the invention.
Fig. 2 illustrates a block diagram of an example base station and user equipment device, in accordance with some embodiments of the present invention.
Fig. 3 illustrates a wireless communication system including a UE in communication with two communication points, in accordance with some embodiments of the present invention.
FIG. 4 illustrates an example configuration of CORESET and search space according to some embodiments of the invention.
Fig. 5 shows a flow diagram of a method of PDCCH search space retention strategy according to some embodiments of the invention.
Fig. 6-8 illustrate the CORESET for various time slots according to some embodiments of the invention.
Fig. 9 shows a flow diagram of another method of PDCCH search space retention strategy according to some embodiments of the invention.
Detailed Description
Various exemplary embodiments of the present solution are described below with reference to the drawings to enable one of ordinary skill in the art to make and use the present solution. It will be apparent to those of ordinary skill in the art that, upon reading this disclosure, various changes or modifications may be made to the examples described herein without departing from the scope of the present solution. The present solution is therefore not limited to the exemplary embodiments and applications described and illustrated. In addition, the specific order and hierarchy of steps in the methods disclosed herein is merely exemplary. Based upon design preferences, the specific order or hierarchy of steps in the methods or processes disclosed may be rearranged while remaining within the scope of the present solution. Accordingly, one of ordinary skill in the art will understand that the methods and/or techniques disclosed herein present the various steps or actions in a sample order, and the present solution is not limited to the specific order or hierarchy presented unless specifically indicated otherwise.
Fig. 1 illustrates an example wireless communication network and/or system 100 in which the disclosed techniques may be implemented, according to an embodiment of the invention. In the discussion that follows, 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 referred to herein as the "network 100". Such an example network 100 includes a base station 102 (also referred to as a "communication point 102" or "BS 102" or "Transmit Receive Point (TRP)" or "communication node") and a user equipment device 104 (hereinafter "UE 104") that may communicate with each other via a communication link 110 (e.g., a wireless communication channel), as well as a cluster of cells 126, 130, 132, 134, 136, 138, and 140 covering a geographic area 101. In fig. 1, communication point 102 and UE 104 are contained within respective geographic boundaries of cell 126. Each of the other cells 130, 132, 134, 136, 138, and 140 may include at least one base station that operates at its allocated bandwidth to provide adequate wireless coverage to its intended users.
For example, the communication point 102 may operate on an allocated channel transmission bandwidth to provide adequate coverage to the UE 104. Communication point 102 and UE 104 may communicate via downlink radio frames 118 and uplink radio frames 124, respectively. Each radio frame 118/124 may be further divided into subframes 120/127, which may include data symbols 122/128. In the present invention, the communication point 102 and the UE 104 are described herein as non-limiting examples of "communication nodes" that may generally practice the methods disclosed herein. Such communication nodes may be capable of wireless and/or wired communication according to various embodiments of the present solution.
Fig. 2 illustrates a 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, in accordance with some embodiments of the present solution. System 200 may include components and units configured to support known or conventional operating features that need not be described in detail herein. In one illustrative embodiment, as described above, the system 200 can be employed to communicate (e.g., transmit and receive) data symbols in a wireless communication environment, such as the wireless communication environment 100 of fig. 1.
The system 200 generally includes a base station 202 (also referred to as a "communication point 202") and a user equipment device 204 (hereinafter "UE 204"). The 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 coupled and interconnected to each other as needed 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 coupled and interconnected with each other as needed via a data communication bus 240. The communication point 202 communicates with the UE 204 via a communication channel 250, which may be any wireless channel or other medium suitable for data transmission as described herein.
As understood by one of ordinary skill in the art, the system 200 may further include any number of modules other than those shown in fig. 2. Those of skill in the art will appreciate that the various illustrative blocks, modules, circuits, and processing logic described in connection with the embodiments disclosed herein may be implemented as 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 have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software depends upon the particular application and design constraints imposed on the overall system. Persons familiar with the concepts described herein may implement such functionality in an appropriate manner for each specific application, but such implementation decisions should not be interpreted as limiting the scope of the present invention.
According to some embodiments, UE transceiver 230 may be referred to herein as an "uplink" transceiver 230, which includes a Radio Frequency (RF) transmitter and an RF receiver, each including circuitry coupled to an 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, the communication point transceiver 210 may be referred to herein as a "downlink" transceiver 210, which includes an RF transmitter and an RF receiver, each including circuitry coupled to an antenna 212. The downlink duplex switch may alternatively couple the downlink transmitter or receiver to the downlink antenna 212 in a time-duplex manner. The operation of the two transceiver modules 210 and 230 may be coordinated in time such that while the downlink transmitter is coupled to the downlink antenna 212, the uplink receiver circuit is coupled to the uplink antenna 232 for receiving transmissions over the wireless transmission 250. In some embodiments, there is tight time synchronization with minimal guard time between changes in the duplex direction.
UE transceiver 230 and base station transceiver 210 are configured to communicate via a wireless data communication link 250 and cooperate with a suitably configured RF antenna arrangement 212/232 that may support a dedicated wireless communication protocol and modulation scheme. In some demonstrative embodiments, UE transceiver 210 and base station transceiver 210 are configured to support industry standards, such as Long Term Evolution (LTE) and emerging 5G standards. It should be understood, however, that the present invention is not necessarily limited in its application to proprietary standards and related protocols. Rather, UE transceiver 230 and base station transceiver 210 may be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.
According to various embodiments, for example, communication point 202 may be an evolved node b (eNB), a serving eNB, a target eNB, a femto station, or a pico station. In some embodiments, the UE 204 may be embodied in various types of user equipment, such as a mobile phone, a smartphone, a Personal Digital Assistant (PDA), a tablet, a laptop, a wearable computing device, and so forth. The processor modules 214 and 236 may be implemented or embodied 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, the processor may be implemented as a microprocessor, controller, microcontroller, 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.
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 the processor modules 214 and 236, respectively, or in any practical combination thereof. Memory modules 216 and 234 may be implemented 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, the memory modules 216 and 234 may be coupled to the processor modules 210 and 230, respectively, such that the processor modules 210 and 230 may read information from and write information to the 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 the processor modules 210 and 230, respectively. The 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.
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 the base station transceiver 210 and other network components and communication nodes configured to communicate with the base station 202. For example, the network communication module 218 may be configured to support internet or WiMAX services. In a typical deployment, but not limited to, the network communication module 218 provides an 802.3 ethernet interface so that the 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 connecting to a computer network (e.g., a Mobile Switching Center (MSC)). As used herein, the terms "configured to," "configured to," and their equivalents, refer to a particular operation or function, and refer to a device, component, circuit, structure, machine, signal, etc., as physically constructed, programmed, patterned, and/or arranged to perform the particular operation or function.
Having discussed aspects of network environments and devices that may be used to implement the systems, methods, and apparatus of the present invention, additional details are described below.
Fig. 3 illustrates a wireless communication system including a UE in communication with two communication points (e.g., one or more BSs, one or more RRUs in a 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. A first communication point may transmit DCI1 (downlink control information) and PDSCH1 (physical downlink shared channel) to a UE, where DCI1 includes scheduling information for PDSCH1, while a second communication point may transmit DCI2 and PDSCH2 to the same UE, where DCI2 includes scheduling information for PDSCH 2. The use of two communication points may on the one hand improve link robustness and may improve spectral efficiency, but on the other hand may create complications with respect to supporting two independently scheduled terminals within the same network.
Each communication point may transmit a PDCCH during a downlink symbol in a slot in the NR. The search space set is a set of search spaces, where a search space includes PDCCH candidates 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) candidate transmitted by one or more communication points. There may be multiple sets of search spaces associated with the same CORESET (control resource set). When the number of candidate PDCCHs configured in a slot or the number of non-overlapping CCEs for monitoring the candidate PDCCHs is greater than a predetermined value, some search space sets may have to be discarded based on a predetermined rule. Each set of search spaces is retained or discarded according to the order of priority. The UE needs to detect the PDCCH candidates in the reserved search space set and perform channel and/or signal transmission according to the detected PDCCH candidates. The UE does not desire to detect the PDCCH candidate in the discarded search space set. The predetermined rule needs to consider a balance of PDCCH candidates reserved between the plurality of first communication points.
Referring again to fig. 3, two communication points transmit downlink data channels to the UE. In particular, there is no ideal backhaul between the two communication points. The two communication points independently schedule downlink data channels, with DCI1 scheduling a channel or signal for a first communication point and DCI2 scheduling a channel or signal for a second communication point. Of course, this embodiment does not exclude the possibility of an ideal backhaul between 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 schedule data independently, or one of the communication points dynamically selects one or both communication points to transmit a channel or signal to the UE. The time-frequency resources occupied by PDSCH1 and PDSCH2 may be empty (non-overlapping), partially overlapping, or fully overlapping.
In NR-Rel 15, parameters for PDCCH are included in CORESET and search space sets, where one search space set may be associated with one CORESET, but one CORESET may be associated with multiple search space sets. A plurality of bandwidth parts (BWPs) may be configured in one downlink serving cell, and up to three CORESET may be configured in each BWP, and up to 10 search space sets may be configured in each BWP.
The following parameters may be configured in CORESET: the frequency domain resources that the candidate PDCCH can occupy, the quasi-co-location reference signal of the demodulation reference signal of the PDCCH in CORESET, and the time domain symbol number occupied by the candidate PDCCH in a PDCCH occasion. For example, different sets of quasi-co-located reference signals represent different transmit beams used by the base station to transmit PDCCH, while CORESET corresponds to a set of quasi-co-located reference signals, i.e., CORESET has only one transmit beam.
The following parameters are configured in each search space set: the PDCCH occasion is offset by the period and period of the time unit of the slot, the starting time domain symbol occupied by each PDCCH occasion in the slot, and the number of candidate PDCCHs included in each aggregation level.
Fig. 4 shows an example configuration of CORESET and search space. In particular, fig. 4 shows a time slot n400 that includes a set of sets 2402 associated with a set of search spaces 2404 and a set of search spaces 3406. Configuring the time domain symbol number of one PDCCH occasion in CORESET2 as 1, one PDCCH occasion of search space set 2408 (or search space set 3410) occupies the frequency domain resource and time domain symbol number 1 allocated/configured by CORESET 2. 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 fig. 4, for three PDCCH occasions, search space set2 in the slot has a starting time domain symbol of {0,4,10 }. And if the slot cycle of search space set2 is 2 slots, then there is search space set2 in every 2 slots that occupies a 0,4,10 time domain symbol. For four PDCCH occasions, search space set3 in the slot has a starting time domain symbol of 2,6,8, 9. If the search space set3 has a slot period of 4 slots, the search space set3 in one of every 4 slots occupies a time domain symbol of {2,6,8,9} in each PDCCH occasion having one time domain symbol. In fig. 4, search space set2 and search space set3 in one slot have zero overlapping time domain symbols. Different sets of search spaces associated with the same CORESET may also occupy non-zero/non-null overlapping time domain symbols.
As can be seen from the foregoing description, in CORESET, the configuration includes time-frequency resources corresponding to one PDCCH occasion. And configuring a time domain mode of a PDCCH occasion of each search space in each search space set, wherein the time domain mode comprises a PDCCH occasion mode in a time slot and a mode comprising the time slot of the PDCCH occasion. Each set of search spaces associated with the same CORESET shares parameters configured in the CORESET.
As can be seen from the above description, different search space sets may have different PDCCH occasion patterns, and thus the sets of search space sets contained in different slots may be different. For example, slot n includes a set of search spaces {1-8 }; slot n +1 includes only the set of search spaces {1,3,6 }; and slot n +2 includes only the search space set 7. Therefore, there are cases where some slots include too many search space sets or too many candidate PDCCHs of a search space set having a large candidate PDCCH, but the UE has limited capability of processing PDCCHs in one slot, and some candidate PDCCHs must be discarded according to a predetermined rule for this purpose. The complexity of processing the PDCCH includes detection of PDCCH candidates, the number of non-overlapping CCEs of the PDCCH candidates.
As shown in fig. 3, the predetermined rule may consider the case of multiple communication points to avoid the case where the terminal monitors only candidate PDCCHs corresponding to one communication point at times, and the number of candidate PDCCHs reserved in one communication point may be much greater than that reserved in another communication point at times. To this end, the retention policy/implementation for the set of search spaces should also take into account the multiple communication point scenario.
As shown in fig. 3, communication between the UE and two communication points can improve link robustness and improve spectrum efficiency on one hand. However, how to support independent scheduling of two communication points and UE, especially independent scheduling of two communication points in the same serving cell and UE in the cell, and simultaneously minimize the amount of communication/coordination between the two communication points, thereby effectively supporting a scenario where two communication points without ideal backhaul communicate with the same UE.
As discussed herein, the frequency domain bandwidth may be one of: serving cell, BWP in serving cell and contiguous PRB (physical resource block). One search space set includes one or more aggregation level (also referred to as aggregation level) search spaces, and each aggregation level search space corresponds to one aggregation level and PDCCH candidates included in the aggregation level search space. A set of search spaces may be referred to as/refer to a set of search spaces, i.e., a set of aggregated search spaces. In the following description, a serving cell may be (or correspond to) a CC (component carrier). In the present embodiment, the detected PDCCH candidates may be determined according to the CORESET group. For example, each CORESET group corresponds to a communication point. In particular, the following two CORESET groups may be considered as examples. Of course, this does not exclude the case where the number of CORESET groups included in one frequency domain bandwidth may be other positive integers greater than or equal to 1.
Figure BDA0003573418740000071
0≤i＜IcssRepresentation for CSS (common search space) set Scss(i) The number of counted PDCCH candidates, and
Figure BDA0003573418740000072
0≤j＜Jussrepresenting a set S for USS (UE-specific search space)uss(j) The number of counted PDCCH candidates monitored.
Figure BDA0003573418740000073
The number of PDCCH candidates and the number of non-overlapping CCEs included in the common search space set falling in the CORESET group i, i ═ 1,2, in that order.
For all search space sets within slot n, use ScssRepresenting a group of cardinality as IcssCSS set of (1), with SussRepresenting a set of cardinality JussThe USS set of (1). USS set s j 0≤j＜JussAt SussIs determined according to the ascending order of the search space set indices.
VCCE(Suss(j) Represent for searching space set Suss(j) Of non-overlapping CCEs, and
Figure BDA0003573418740000074
indicating that the PDCCH candidates for monitoring the allocation of the CSS set and for monitoring all search space sets S are considereduss(k)0 ≦ k ≦ j allocated candidate PDCCH to determine the set S for search spaceuss(j) Of non-overlapping CCEsCCE(Suss(j) ) cardinality.
The UE does not expect the number of monitored PDCCH candidates and non-overlapping CCEs configured per slot to exceed the corresponding maximum number of CSS sets per slot.
The monitored state of the search space may be determined according to at least one of the following methods: method 1-method 5. When the monitoring state is not monitoring, the UE does not monitor PDCH candidates in the search space set, i.e., discards the search space set. When the monitoring state is monitoring, the UE monitors PDCH candidates in the search space set, i.e., the reserved search space set, and the UE detects PDCH candidates in the search space set.
Method 1
Step 1:
firstly, a candidate PDCCH of a serving cell is determined by using a subcarrier spacing parameter mu in a time slot
Figure BDA0003573418740000075
Maximum number of (i.e., D1) and non-overlapping CCEs of the candidate PDCCH
Figure BDA0003573418740000076
I.e., E1. Largest candidate PDCCH in CORESET group 1
Figure BDA0003573418740000077
(i.e., D2 of CORESET group 1) and PDCCH candidate
Figure BDA0003573418740000078
Maximum value of non-overlapping CCES (i.e., E2 of CORESET group 1), PDCCH candidate in CORESET group 2
Figure BDA0003573418740000079
Maximum number of (i.e., D2 of CORESET group 2) and PDCCH candidates
Figure BDA00035734187400000710
(i.e., E2 of CORESET 1) of non-overlapping CCEs. Obtained from the following information
Figure BDA00035734187400000711
Figure BDA00035734187400000712
A subcarrier spacing parameter mu, a predetermined value, a capability value reported by a terminal (i.e., UE), and the number of serving cells for the subcarrier spacing parameter mu.
For
Figure BDA00035734187400000713
Their acquisition/association parameters also include the number of communication points of the serving cell, the number of communication points corresponding to a serving cell being acquired according to one of the following methods: a CORESET group included in a serving cell; scheduling a number of CORESET groups included in a serving cell of the serving cell; a number of same type parameter sets of a PDSCH configured in a 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, it is the number of CORESET groups in the predetermined BWP. The same type of parameters for PDSCH include one or more of: a channel scrambling sequence parameter, a set of process numbers, and a set of PUCCH resources. Other parameters are also possible.
Step 2
The set of reserved search spaces is determined using the following pseudo-code:
it is determined to detect a PDCCH candidate in a common search space set,
Figure BDA0003573418740000081
Figure BDA0003573418740000091
wherein the monitoring is to be performed
Figure BDA0003573418740000092
Candidate PDCCH assignment to USS set Suss(j) Representing a set of search spaces SUSS(j)The monitoring state of (2) is monitoring, and the UE detects the PDCCH candidates in the search space set.
Figure BDA0003573418740000093
The number of PDCCH candidates counted in the CSS set in the core set i of the scheduling cell in the slot,
Figure BDA0003573418740000094
the number i of non-overlapping CCEs of the PDCCH candidate monitored in the CSS set in the CORESET group i for the scheduling cell in the slot is 1, 2.
In summary, the reservation strategy of the PDCCH search space set in method 1 is shown in fig. 5, and the D _ Cell in fig. 5 includes the above-mentioned information
Figure BDA0003573418740000095
And
Figure BDA0003573418740000096
the D _ CORESET group (i) in FIG. 5 includes the above
Figure BDA0003573418740000097
Figure BDA0003573418740000098
D _ USS (j) includes
Figure BDA0003573418740000099
And C (V)CCE(Suss(j)))。
Specifically, as shown in fig. 6-8, the CORESET group 1 includes { CORESET1, CORESET2, CORESET3} corresponding to the first communication point 1 in fig. 3, and the CORESET group 2 includes { CORESET4, CORESET5} corresponding to the first communication point 2 in fig. 3. For simplicity, only candidate PDCCHs of the search space set are considered in FIGS. 6-8
Figure BDA00035734187400000910
The number of (2). Suppose that
Figure BDA00035734187400000911
And
Figure BDA00035734187400000912
each of which is 40, of the total weight of the material,
Figure BDA00035734187400000913
at 60, and fig. 6 to 8 show schematic diagrams of the search space sets contained in different time slots. After using the scheme for reserving the search space set discussed in method 1, the search space set reserved in slot n1 of fig. 6 is { USS1, USS3, USS4, USS5} (in this case, 40 PDCCH candidates are reserved in CORESET1 and 20 PDCCH candidates are reserved in CORESET 2), and the search space set reserved in slot n2 of fig. 7 is { USS1 }. It can be seen that USS2 is not reserved at this point, otherwise, CORESET1 would be exceeded although the serving cell did not. The set of search spaces reserved in the slot n3 in FIG. 8 is { USS1, USS3, USS8, USS9 }.
Method 2
Step 1:
step 1 in this method is substantially the same as method 1 above, except that the search space sets in one time slot are divided into two groups, and the search space sets associated with the CORESET in the same CORESET group form a group of search space sets, and the search space sets having CORESETs from different CORESET groups belong to different groups of search space sets. The search space sets in the search space set group are arranged in ascending order according to the search space set index, assuming that the CORESET group 1 corresponds to the search space set group 1 and the communication point 1 in fig. 3, and the CORESET group 2 corresponds to the search space set group 2 and the communication point 1 in fig. 3.
For all search space sets, S, within a time slot ncssRepresenting a set of cardinality as IcssCSS set and SUSS,CORESET group 1Representing a set of cardinality JUSS,CORESET group 1The USS set of CORESET group 1. USS set sj,CORESET group 1，0≤sj,CORESET group 1＜JUSS,CORESET group 1At SUSS,CORESET group 1Is indexed according to the search space set in ascending order. And SUSS,CORESET group 2Representing a set of cardinality JUSS,CORESET group 2The USS set of CORESET group 2. USS set sj,CORESET group 2，0≤sj,CORESET group 2＜JUSS,CORESET group 2At SUSS,CORESET group 2SUSS,CORESET group 1The positions in (a) are indexed according to the search space set in ascending order.
Using radix as I for all search space sets within time slot ncssCSS set of (S)cssThe sum base is JussRepresents the USS set of Suss. USS set sj，0≤j＜JussAt SussIs indexed according to the search space set in ascending order.
Step 2:
step 2 may be implemented using the following pseudo code:
Figure BDA0003573418740000101
Figure BDA0003573418740000111
in method 2, it is determined sequentially whether the monitored states of the search space set are determined in two CORESET groups, unlike scheme 1, in which the monitored states of the search space set are determined only according to the search space set index order. Method 2 employs fig. 6: in slot n, the set of reserved search spaces is { USS1, USS5, USS6, USS3} (at this time, 30 PDCCH candidates are reserved in CORESET1, and 30 PDCCH candidates are reserved in CORESET 2). FIG. 7 shows that the set of search spaces for { USS1} in slot n2 is reserved, and the USS2 is not reserved at this time, otherwise it would exceed
Figure BDA0003573418740000112
The set of search spaces reserved in the slot n3 in FIG. 8 is { USS1, USS8, USS3, USS9 }.
Method 3
In method 3, each CORESET group independently determines the reservation of the search space set, i.e. it is only required to ensure that the number of candidate PDCCHs and the number of non-overlapping CCEs in the reserved search space set in each CORESET group does not exceed the maximum threshold of these numbers for this CORESET group. In this process, we do not calculate/consider the maximum threshold of the cell when determining the monitored state of the search space.
With method 3, the set of search spaces reserved in slot n1 of fig. 6 is { USS1, USS3, USS4, USS5, USS6, USS7} (at this time, 40 PDCCH candidates remain in CORESET group 1, and CORESET group 2 reserves 40 PDCCH candidates). In FIG. 7, the set of search spaces reserved for slot n2 is { USS1 }. As can be seen, USS2 is also not reserved at this time, and otherwise would be exceeded
Figure BDA0003573418740000113
The set of search spaces reserved in the slot n3 in FIG. 8 is { USS1, USS3, USS9, USS8 }.
In the above solution, the problem of keeping the USS2 in the time slot n2 cannot be solved. When USS2 is reserved, the total number of cells for slot n2 does not exceed the cell level threshold, but would exceed the CORESET1 threshold. To this end, we may first determine the monitoring status of all USS sets of cells in a timeslot using method 2 or method 1, then determine the monitoring status of search space sets that have been discarded in the first cycle, and then check whether the total number of cells exceeds a cell level threshold. If not, the set of search spaces may be retained; here we do not care whether the restriction of the CORESET group is exceeded or not.
Method 4
As shown in fig. 9, after the operation of method 1 is completed, i.e., J ═ J is reached firstUSSThereafter, if the number of reserved search space sets is less than the maximum threshold for that Cell, we can continue to check if the number exceeds the threshold for the Cell (D _ Cell) and check whether to reserve or discard within the search space set of the USS _1 search space set. After the method 4 shown in fig. 9 is adopted, and referring to fig. 6, the reserved search space set in slot n1 in fig. 6 is { USS1, USS3, USS4, USS5} (at this time, 40 PDCCH candidates are reserved in CORESET1, and 20 PDCCH candidates are reserved in CORESET 2), and the reserved search space set in slot n2 in fig. 7 is { USS1, USS2}, and it can be seen that USS2 is reserved at this time. The set of search spaces reserved in the slot n3 in FIG. 8 is { USS1, USS3, USS8, USS9}。
Method 5
Similar to method 4, after the operation of method 2, if the number of candidate PDCCHs in the reserved search space set is less than the maximum threshold of the cell, we may continue to check the monitoring status of the USS group discarded in the above operation of method 2. According to method 5, and referring to fig. 6, the set of search spaces reserved in slot n1 of fig. 6 is { USS1, USS3, USS4, USS5, USS6, USS7} (at this time, 40 PDCCH candidates remain in CORESET1, 40 PDCCH candidates remain in CORESET 2), and the set of search spaces reserved by slot n2 in fig. 7 is { USS1, USS2 }. At this point USS2 is retained, otherwise it will be exceeded
Figure BDA0003573418740000121
The set of search spaces remaining in slot n3 in fig. 8 is { USS1, USS8, USS3, USS9 }.
Reserving the above PDCCH search space set
When the PDCCH and the PDCCH scheduled channel and/or signal are in different serving cells, i.e., when scheduling across serving cells (cross-CCs), each serving cell (where the scheduled channel and/or signal resides) is independently checked to determine whether its search space set is reserved. Or may determine whether to retain/discard only the set of search spaces for the SPcell (dedicated primary cell). When configuring the search space set for Scell, the terminal does not expect the number of candidate PDCCHs/non-overlapping CCEs of the search space set in the slot to exceed the maximum allowed for the cell, or exceed the maximum threshold of the corresponding CORESET group.
Or when the number of the communication points in the Spcell is higher than the predefined number, determining the reservation of the search space set in the serving cell. When performing the configuration, the terminal does not want the number of candidate PDCCHs/non-overlapping CCEs in the search space set in the slot to exceed the maximum value allowed by the cell and the maximum value allowed by the CORESET group.
Assume that one communication point corresponds to one CORESET group to handle the methods 1-5 discussed above. Assuming that one communication point corresponds to one BWP group/BWP, the methods 1-5 are similarly processed using the BWP group/BWP in the cell instead of the CORESET group. That is, the monitoring state of the search space is determined according to the BWP group/BWP in the cell. The CORESET includes CORESET for a cell. The number of CORESET groups includes CORESET of cells. Multiple BWPs are used for a cell. The monitoring state may be monitoring or not monitoring.
For serving cell n on active DL BWP not using CCE setsCISet of search spaces s in CORESET pjHas an index
Figure BDA0003573418740000122
Is counted to monitor for a search space set si＜sjWhether there is an index
Figure BDA0003573418740000123
Or whether there is a PDCCH candidate having an index
Figure BDA0003573418740000124
And
Figure BDA0003573418740000125
in a serving cell n using the same CCE setCIHas the same scrambling and the corresponding DCI formats for the PDCCH candidates have the same size; otherwise, the pair has an index
Figure BDA0003573418740000126
Is counted for monitoring
Two communication points of the same cell
As shown in fig. 3, 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 influence of interaction delay between the communication points on system performance, the following method may be used.
Method 1
The two communication points are represented by two CORESET groups in the BWP under the serving cell. The first or second predetermined condition must be met when the channels and/or signals are scheduled by the same communication point, i.e. when the channels and/or signals are scheduled by the same CORESET group in the serving cell. The first or second predetermined condition need not be met when the channels and/or signals are scheduled by different communication points, i.e. the channels and/or signals are scheduled via different sets of CORESET in the serving cell.
Method 2
The two communication points are represented by two BWPs or two BWP groups under one serving cell. When channels and/or signals are scheduled by the same communication point, i.e. the channels and/or signals are located in one BWP in the serving cell or in the same BWP group, the first or second predetermined condition must be satisfied. When channels and/or signals are scheduled by different communication points, i.e. the channels and/or signals are located in different BWPs in the serving cell or in different BWP groups in the serving cell, the first or second predetermined condition need not be met.
Wherein the first predetermined condition comprises one or more of the conditions:
there is no overlap between time domain resources occupied by two channels and/or signals, wherein the two channels and/or signals correspond to the same process or different processes;
in the case where the end position of the PDCCH scheduling the first channel and/or signal is later than the end position of the PDCCH 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 process or different processes;
for two channels corresponding to the same process number, the start position of one channel cannot be earlier than the end position of the last channel under the same process number.
Wherein the second predetermined condition comprises one or more of the following conditions:
under the condition that the end position of the PDCCH for scheduling the uplink channel and/or the signal falls in a preset time window before the start symbol of the transmission opportunity of the PUSCH with the authorization, the time domain resource occupied by the uplink channel and/or the signal is not overlapped with the time domain resource of the transmission opportunity of the PUSCH with the authorization;
if the transmission opportunities of the PDCCH for scheduling the uplink channel and the PUSCH for configuring the authorization have the same process number, the end position of the PDCCH cannot fall in a preset time window before the start symbol of the transmission opportunity for configuring the PUSCH for the authorization;
the PUSCH in which the grant is configured is (or may also be referred to as) an unlicensed PUSCH.
Two communication points from two serving cells
The parameters of the two communication points need to meet certain constraint conditions, so that the robustness or the frequency efficiency of the link can be improved, the complexity of the terminal is reduced, and the interference between the two links corresponding to the two communication points can be effectively reduced. The following method was used for this purpose.
Specifically, if two communication points are respectively represented by two CCs (i.e., serving cells), the two CCs may be one of the following: CC in one MCG and CC in one SCG; two CCs in two CC groups, respectively from an MCG (master cell group) (or an SCG secondary cell group), where each of the two CC groups in the MCG corresponds to one uplink serving CC comprising a PUCCH, or different CC groups correspond to different serving cells comprising a PUCCH.
For example, a first CC set in the MCG includes Pcell and a second CC set includes PUCCH-Scell, i.e., two CC sets in the MCG correspond to cells including PUCCH, respectively. The HARQ-ACK information for the PDSCH in each CC group is in feedback in the cell that includes the PUCCH corresponding to the CC group.
In particular, when the frequency domain resources between two serving cells representing two communication points actually overlap, the parameters in the two serving cells are correlated.
For example, the BWPs (in active state) of the two serving cells should be the same, or the CP of the active BWP should be the same, or the numerical parameters should be the same. The numerical parameters may include at least one of: CP, subcarrier spacing, number of time domain symbols included in one slot.
For example, the uplink BWPs in the two serving cells have a correspondence between the uplink BWPs. For example, 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 }. There is then a correspondence between BWPi-1 and BWPi-2, and a correlation or relationship between the parameters of these related BWPS. Similarly, there is a correspondence between downlink BWPs in the two serving cells. The above method uses index information of BWPs in a BWP group contained in a serving cell to determine a correspondence relationship between the BWPs. The present embodiment does not exclude whether two frequency domain resources respectively belonging to two CCs overlap to determine the relationship between BWPs. For example, when two BWPs are involved in overlap, it is determined that there is a correspondence between them. Or there may be no overlap but each BWP is active, then we can determine that there is a correspondence between them.
In the existing correspondence, the parameter configuration in one BWP may be related to the parameter configuration of another BWP. The correspondence may include that some parameter values of the two BWPs are the same, and/or some combined values of some parameters of the two BWPs cannot occur at the same time, a value range of parameters in one BWP may be determined according to the parameter values of the other BWP, or the two BWPs may share one parameter indication signaling.
For example, one of the two serving cells may configure the time domain location for uplink transmissions, while the other serving cell may not be configured for downlink transmissions. One serving cell may configure the time domain location for downlink transmissions, while another serving cell may not be configured for uplink transmissions. Or two serving cells may share a set of time domain structure configuration information, where the slot structure configuration information may include an uplink time domain symbol, a downlink time domain symbol, and flexible time domain symbol configuration information included in each slot. The slot structure configuration information may be transmitted through one or more of system messages, RRC signaling, MAC-CE signaling, and PDCCH signaling.
For example, when two serving cells include two pcells and one PUCCH-Scell, PUCCH transmitted in the two cells cannot occupy the same time domain resource, time division based transmission should be used, or when PUCCH time domain overlap in the two cells is not empty, information contained in PUCCH with time domain overlap in the two cells is combined into one PUCCH or one PUSCH and transmitted in one of Pcell or PUCCH-Scell after combination.
For example, if there are two CCs having a correspondence relationship, the parameters may be configured independently, but if one of the CC parameters is not configured, the configuration in the other CC may be shared with the first CC. In another embodiment, some parameters of the serving cell or BWP having the correspondence may be independently configured, and some parameters may share one configuration signal, and the parameter values may be the same.
In one aspect, a method comprises: determining a monitoring state of the search space set according to the first information; and when the monitoring state is determined to be non-monitoring, not monitoring the candidate PDCCHs in the search space set, wherein the first information includes one of: control resource set (CORESET) group or bandwidth part (BWP).
The method further comprises the following steps: determining a monitoring state of the search space set from the first information and second information, the second information comprising at least one of: searching an index of the space set; the maximum number of candidate PDCCHs monitored for frequency domain bandwidth in one slot of the search space set D1; a maximum number of non-overlapping Control Channel Elements (CCEs) of one frequency domain bandwidth monitored in one slot E1; a maximum number of monitored PDCCH candidates D2, wherein the PDCCH candidates correspond to one value of the first information of the one frequency-domain bandwidth in the one time slot; a maximum number of detected non-overlapping control channel elements E2 for the value of the first information of the one frequency-domain bandwidth in the one time slot; or the number of candidate PDCCHs included in the search space set.
The method may further comprise: the first set of search space sets and the search space sets correspond to a same value of the first information, each search space set of the first set of search space sets having a monitored state of being monitored prior to determining the monitored state of the search space set.
The method may further comprise: when a first condition is met, determining the monitoring state of the search space set as monitoring; and/or when the first condition is not met, determining the monitoring state of the search space set as non-monitoring; and wherein the first condition is determined in accordance with at least one of: d1, E1, and D2 and E2 corresponding to the first information of the search space set, a total number of PDCCH candidates in a first set of search space sets, a total number of non-overlapping control channel elements in the first set of search space sets, a total number of PDCCH candidates in a second set of search space sets, or a total number of non-overlapping control channel elements in the second set of search space sets, wherein all search space sets in the second set of search space sets are associated with the same cell and have a monitored status for monitoring before determining a monitored status of the search space sets. The method may further comprise: wherein the first set of search space sets and the search space sets correspond to a same value of the first information, each search space set of the first set of search space sets having a monitoring state determined to be monitoring prior to determining the monitoring state of the search space set; wherein 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 before determining the monitoring status of the search space sets.
The method may further comprise, wherein the first condition comprises: when the monitored state of the search space set is monitoring, for one cell in the one slot, determining that the maximum number of the total number of candidate PDCCHs included in one or more search space sets in the monitored state is less than or equal to D1; for one cell in the one time slot, determining that a maximum number of total number of non-overlapping control channel elements included in the one or more search space sets of monitored states is less than or equal to E1; for one slot and one value of the first information, determining that the maximum number of the total number of candidate PDCCHs included in the one or more search space sets for the monitored state is less than or equal to D2; and for one time slot and one value of the first information, the maximum number of the total number of non-overlapping control channel elements in the one or more search space sets determined as the monitored state is less than or equal to E2.
The method may further comprise determining an order of monitoring states of the plurality of UE-specific search space sets according to one of: determining an order of monitoring states of the plurality of UE-specific search space sets in one time slot according to an ascending order of indexes of the search space sets; determining an order of monitoring states of the plurality of UE-specific search space sets in the one time slot according to an ascending order of values of the first information associated with the search space sets and then according to an ascending order of indexes of the search space sets; and dividing the search space set into two groups respectively corresponding to two values of the first information, and sequentially determining the sequence of the monitoring states of the UE-specific search space sets in the time slot according to the two groups of the search space sets.
The method may further comprise: after determining the monitoring states of all search space sets for a cell in the one slot according to the first condition, if a total number of PDCCH candidates of the monitored search space sets is less than D1 and a total number of non-overlapping control channel elements in the monitored search space sets is less than E1, for a subset of the search space sets for which the monitoring state is determined not to be monitored using the first condition, determining a monitoring state 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 sets according to a second condition, wherein the monitoring state of the search space sets of the subset is determined to be monitoring when the second condition is satisfied; and/or determining the monitoring status of the search spaces of the subset as not monitored when the second condition is not met, wherein the parameter determining the second condition excludes the first information associated with the set of search spaces in the subset.
The method may further comprise, wherein the second condition comprises: 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 the monitoring state determined to monitor the cell 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 monitor the cell in a time slot is less than or equal to E1.
The method may further include determining a relationship between D1 and D2 and a relationship between E1 and E2 based on at least one of: the number of CORESET groups for scheduled BWPs; the number of BWPs simultaneously activated for one cell; or the number of values of the same type parameter of the PDSCH in one BWP. The method may further comprise: the same type of PDSCH parameters includes parameters of a scrambling sequence of the PDSCH.
The method may further comprise: determining, from the value of the first information, a monitoring state of the set of search spaces according to at least one of: for each value of the first information of one cell in one slot, a total number of candidate PDCCHs included in one or more search space sets determined as a monitored state does not exceed a maximum number of candidate control channels corresponding to one value of the first information;
for each value of the first information of the cell in the time slot, the number of non-overlapping control channel elements in a search space set determined as a monitored state does not exceed a maximum number of non-overlapping control channel elements corresponding to the value of the first information.
The method may further include monitoring the candidate PDCCHs in the search space set when it is determined that the monitoring status of the search space set is monitoring.
The method may further comprise wherein the monitoring state may or may not be monitoring. The method may further include, wherein the first information corresponds to a cell. The method may further include wherein the set of search spaces corresponds to one cell in one time slot.
In another aspect, a method may include determining that a plurality of bandwidths is associated with a first relationship, each of the plurality of bandwidths corresponding to a set of parameters, wherein a second relationship exists between the sets of parameters corresponding to the plurality of bandwidths.
The method may further comprise: 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 service cells of the plurality of service cells are non-overlapping; when time domain resources occupied by uplink channels or uplink signals in different service cells of a plurality of service cells are overlapped, combining information in the uplink channels or the uplink signals in the different service cells into one of the uplink channels or the uplink signals of one of the plurality of service cells; a plurality of parameter sets for a plurality of uplink BWPs in a cell; or multiple parameter sets for multiple downlink BWPs in a cell.
The method may also include wherein the uplink channel comprises an uplink control channel and the plurality of serving cells comprises a serving cell having the uplink control channel. The method may further comprise wherein the second relationship comprises at least one of: respective parameters having the same value; a set of parameters corresponding to a plurality of bandwidths having the same value for each parameter type; determining a set of parameters corresponding to a plurality of bandwidths using the same signaling; the corresponding parameter corresponds to a relationship of a parameter for signaling information shared across a plurality of bandwidths; the range of values of one parameter set for a bandwidth may be obtained from values of another parameter set for another bandwidth of the plurality of bandwidths; when the parameter set for the bandwidth is not configured, the parameter set is determined according to a configuration of another parameter set for another one of the plurality of bandwidths.
The method may further comprise wherein the parameter set is at least one of: a bandwidth part in an active state, a digital parameter, slot structure configuration information, or a parameter of a demodulation reference signal, wherein the digital parameter includes 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 includes information on an uplink time domain symbol, a downlink time domain symbol, and a flexible time domain symbol position in the slot.
The method may further include wherein a bandwidth of the plurality of bandwidths includes one of a serving cell, a bandwidth part, and consecutive physical resource blocks. The method may further include, wherein the plurality of bandwidths having the first relationship includes two bandwidths corresponding to at least one of: a plurality of bandwidths occupying overlapping regions of frequency domain resources; a plurality of bandwidths having the same bandwidth index; a plurality of bandwidths that are all active states; a plurality of bandwidths having a same transmission direction, wherein the transmission direction includes an uplink direction or a downlink direction; or different ones of the plurality of bandwidths belong to different bandwidth groups.
The method may further include wherein the plurality of bandwidths having the first relationship includes two bandwidths corresponding to one of: two component carriers belonging to a master cell group and a secondary cell group, respectively; two component carriers of two component carrier groups belonging to a master cell group, respectively; two component carriers of two component carrier groups belonging to the auxiliary cell group respectively; or two bandwidth parts belonging to two component carriers, respectively, wherein the two component carriers comprise one of: two component carriers belonging to a master cell group and a secondary cell group, respectively; two component carriers of two component carrier groups belonging to the master cell group, respectively; or two component carriers of two component carrier groups respectively belonging to the secondary cell group.
In some aspects, a method may include determining at least one condition satisfied by resources occupied by at least two channels from first information, wherein the first information includes information about a control resource set (CORESET) group and a serving cell.
The method may further comprise determining at least one condition satisfied by resources occupied by at least two channels based on first information, wherein the first information comprises information about the bandwidth part and the serving cell.
The method may further comprise wherein one condition comprises at least one of:
when first information corresponding to two channels is the same, a first condition is satisfied between resources occupied by the two channels; when first information corresponding to two channels is different, the first condition is not satisfied between resources occupied by the two channels; when the channel and/or the signal is uplink and the first information corresponding to the grant configured PUSCH is the same as the channel and/or the signal, a second condition is satisfied between the channel and/or the signal and a transmission opportunity of the grant configured PUSCH; or when the channel and/or signal is uplink and the first information corresponding to the grant configured PUSCH is different, the second condition is not satisfied between the channel and/or signal and the transmission opportunity of the grant configured PUSCH.
The method may further comprise wherein the second condition comprises at least one of: before a starting time domain symbol of a transmission opportunity of a configured granted PUSCH, when an end position of a control channel of a channel and/or signal is within a predetermined time window, time domain non-overlapping between the channel and/or signal and the transmission opportunity of the configured granted PUSCH; or when the transmission opportunities of the uplink channel scheduled by the control channel and the grant-configured PUSCH have the same process number, the end position of the control channel cannot occur within a predetermined time window before the start time domain symbol of the grant-configured PUSCH transmission opportunity.
The method may further comprise, wherein the first condition comprises at least one of:
the two channels are non-overlapping in time domain, wherein the two channels correspond to the 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, 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 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 having the same process number.
The method may further include wherein the first condition includes information about a CORESET group and a serving cell, and: the first information corresponding to the two channels is the same, including: making two channels correspond to the same CORESET group, and making two channels located in a service cell; or the first information corresponding to the two channels is different, including: the two channels are made to correspond to different CORESET groups and/or are located in different cells.
The method may further include wherein the first condition includes information on the bandwidth part and the serving cell, and: the first information corresponding to the two channels is the same and includes: making two channels correspond to the same BWP group and making the two channels located in one serving cell; or the first information corresponding to the two channels is different and includes: the two channels are made to correspond to different BWP groups and/or are located in different serving cells.
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 limitation. Likewise, the various figures may depict example architectures or configurations provided to enable one of ordinary skill in the art to understand the example features and functionality of the present solution. However, those skilled in the art will appreciate that the present solution is not limited to the example architectures or configurations shown, but may be implemented using a variety of alternative architectures and configurations. In addition, one or more features of one embodiment may be combined with one or more features of another embodiment described herein, as would be understood by one of ordinary skill in the art. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments.
It will also be understood that any reference to elements in the present invention using a name such as "first", "second", etc., does not generally limit the number or order of those elements. Rather, these names may be used as a convenient means of distinguishing between two or more elements or instances of an element in the present invention. Thus, reference to first and second elements does not mean that only two elements can be used, or that the first element must somehow precede the second element.
In addition, those of ordinary skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits and symbols that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of ordinary skill would further appreciate that any of the various illustrative logical blocks, modules, processors, devices, circuits, methods, and functions described in connection with the aspects disclosed herein may be implemented as electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two), firmware, various forms of program or design code containing instructions (which may be referred to herein, for convenience, as "software" or a "software module"), 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 in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software, or as a combination of such technologies, depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
Furthermore, those of ordinary skill in the art will appreciate that the various illustrative logical blocks, modules, devices, components, and circuits described in connection with the invention may be implemented or performed with Integrated Circuits (ICs), including 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 logic blocks, modules and circuits may further include antennas and/or transceivers to communicate with various components within the network or within the device. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller or state machine. A processor may 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.
If implemented in software, the functions may be stored as one or more instructions or code on a computer-readable medium. Thus, the steps of a method or algorithm disclosed herein may 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 cause a computer program or code to be transferred from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise 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.
As used herein, the term "module" refers to software, firmware, hardware and any combination of these elements for performing the associated functions described herein. In addition, for purposes of discussion, the various modules are described as discrete modules; however, it is obvious to a person skilled in the art that two or more modules may be combined to form a single module performing the relevant functions according to embodiments of the present solution.
Additionally, memory or other storage and communication components may be employed in embodiments of the present solution. It should be appreciated that for clarity 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 units or domains may be used without departing from the present solution. For example, functionality illustrated to be performed by separate processing logic units or controllers may be performed by the same processing logic unit or controller. Thus, references to specific functional units are only to references to suitable means for providing the described functionality rather than indicative of a strict logical or physical structure or organization.

Claims (31)

1. A method, comprising the steps of,
determining a monitoring state of the search space set according to the first information; and
when the monitoring state is determined to be non-monitoring, not monitoring the candidate PDCCH in the search space set;
wherein the first information comprises at least one of: a control resource set CORESET group, or bandwidth part BWP.
2. The method of claim 1, comprising:
determining a monitoring state of the search space set according to the first information and second information, the second information including at least one of:
an index of the set of search spaces;
a maximum number of candidate PDCCHs D1 monitored for one frequency domain bandwidth in one time slot of the search space set;
a maximum number of non-overlapping control channel elements, CCEs, monitored for the one frequency domain bandwidth in the one time slot E1;
a maximum number of monitored PDCCH candidates D2, wherein the PDCCH candidates correspond to one value of the first information in the one time slot;
a maximum number of non-overlapping control channel elements, E2, monitored, wherein non-overlapping control channel elements correspond to a value of the first information in the one time slot; or
The search space set includes the number of PDCCH candidates.
3. The method of claim 2, comprising:
when a first condition is met, determining the monitoring state of the search space set as monitoring; and/or
When the first condition is not met, determining that the monitoring state of the search space set is not monitoring;
wherein the first condition is determined according to at least one of:
D1；
E1；
d2 and E2 corresponding to the first information of the set of search spaces;
the total number of PDCCH candidates in the first set of search space sets,
a total number of non-overlapping control channel elements in the first set of search space sets,
total number of candidate PDCCHs in the second set of search space sets, or
A total number of non-overlapping control channel elements in the second set of search space sets.
4. The method of claim 3, comprising:
wherein the first set of search space sets and the search space sets correspond to a same value of the first information, each search space set of the first set of search space sets having 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 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 before determining the monitoring status of the search space sets.
5. The method of claim 3, wherein the first condition comprises:
when the monitored state of the set of search spaces is monitoring,
for one cell in the one time slot, determining that the maximum number of the total number of candidate PDCCHs included in the one or more search space sets of the monitored state is less than or equal to D1;
for one cell in the one time slot, determining that a maximum number of total numbers of non-overlapping control channel elements included in the one or more search space sets of monitored states is less than or equal to E1;
for one slot and one value of the first information, determining that the maximum number of the total number of candidate PDCCHs included in the one or more search space sets for the monitored state is less than or equal to D2; and
for one slot and one value of the first information, the maximum number of the total number of non-overlapping control channel elements in the one or more search space sets determined as the monitored state is less than or equal to E2.
6. The method of claim 3, comprising:
determining an order of monitoring states of the plurality of UE-specific search space sets according to one of:
determining an order of monitoring states of the plurality of UE-specific search space sets in one time slot according to an ascending order of indexes of the search space sets;
determining an order of monitoring states of the plurality of UE-specific search space sets in the one time slot according to an ascending order of values of the first information associated with the search space sets and then according to an ascending order of indexes of the search space sets; or
And dividing the search space set into two groups respectively corresponding to two values of the first information, and sequentially determining the sequence of the monitoring states of the UE-specific search space sets in the time slot according to the two groups of the search space sets.
7. The method of claim 3, comprising:
after determining the monitoring states of all search space sets for a cell in the one slot according to the first condition, if a total number of PDCCH candidates of the monitored search space sets is less than D1 and a total number of non-overlapping control channel elements in the monitored search space sets is less than E1, for a subset of the search space sets for which the monitoring state is determined not to be monitored using the first condition, determining a monitoring state of search spaces in the subset of the search space sets according to an ascending order of values of indexes of the search space sets according to a second condition, wherein
Determining that a monitoring status of the set of search spaces of the subset is monitoring when the second condition is satisfied; and/or
Determining the monitoring status of the search space of the subset as not monitoring when the second condition is not satisfied,
wherein the parameter determining the second condition excludes the first information associated with the set of search spaces in the subset.
8. The method of claim 7, wherein the second condition comprises:
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 the monitoring state determined to monitor the cell 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 monitor the cell in a time slot is less than or equal to E1.
9. The method of any one of claims 2 to 8, the relationship between D1 and D2 and the relationship between E1 and E2 being determined according to at least one of:
the number of CORESET groups for scheduled BWPs;
the number of BWPs simultaneously activated for one cell; or
Number of values of the same type PDSCH parameter in one BWP.
10. The method of claim 9, the same type of PDSCH parameters comprising parameters of a scrambling sequence of a PDSCH.
11. The method of claim 2, determining a monitoring state of the set of search spaces from the value of the first information, comprising at least one of:
for each value of the first information of one cell in one slot, a total number of candidate PDCCHs included in one or more search space sets determined as a monitored state does not exceed a maximum number of candidate control channels corresponding to one value of the first information;
for each value of the first information of the cell in the time slot, the number of non-overlapping control channel elements in a search space set determined as a monitored state does not exceed a maximum number of non-overlapping control channel elements corresponding to the value of the first information.
12. The method of any of claims 1 to 8, comprising:
monitoring the candidate PDCCH in the search space set when the monitoring state of the search space set is determined to be monitoring.
13. The method of any one of claims 1 to 8, wherein the monitoring state may be monitoring or non-monitoring.
14. The method of any of claims 1-7, wherein the first information corresponds to a cell.
15. The method of any of claims 1-7, wherein the set of search spaces corresponds to one cell in one time slot.
16. A method, comprising:
determining that a plurality of bandwidths is associated with a first relationship, each of the plurality of bandwidths corresponding to a set of parameters,
wherein a second relationship exists between the sets of parameters corresponding to the plurality of bandwidths.
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 service cells of the plurality of service 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 overlap, combining information in the uplink channels or uplink signals in the different serving cells into one of the uplink channels or uplink signals of one of the plurality of serving cells;
the plurality of parameter sets are for a plurality of uplink BWPs in a cell; or
The plurality of parameter sets are for a plurality of downlink BWPs in a cell.
18. The method of claim 17, wherein the uplink channel comprises an uplink control channel and the plurality of serving cells comprises a serving cell with an uplink control channel.
19. The method of claim 16, wherein the second relationship comprises one of:
respective parameters having the same value;
a set of parameters corresponding to the plurality of bandwidths having the same value for each parameter type;
determining a set of parameters corresponding to the plurality of bandwidths using the same signaling;
the corresponding parameter corresponds to a relationship of parameters for signaling information shared across the plurality of bandwidths;
the range of values for one set of parameters for a bandwidth may be obtained from values of another set of parameters for another bandwidth of the plurality of bandwidths;
when a parameter set for a bandwidth is not configured, the parameter set is determined according to a configuration for another parameter set of the further plurality of bandwidths.
20. The method of claim 19, wherein the set of parameters is at least one of: a bandwidth part in an active state, a digital parameter, slot structure configuration information or a parameter of the demodulation reference signal,
wherein the digital parameters include at least one of: cyclic prefix, subcarrier spacing, time domain symbol number in a slot or slot structure configuration information,
wherein the slot structure configuration information includes information on an uplink time domain symbol, a downlink time domain symbol, and a flexible time domain symbol position in a slot.
21. The method of any of claims 16-20, wherein a bandwidth of the plurality of bandwidths comprises one of: serving cell, bandwidth part and contiguous physical resource blocks.
22. The method of any of claims 16-21, wherein the plurality of bandwidths having the first relationship includes two bandwidths corresponding to at least one of:
the plurality of bandwidths occupying overlapping regions of frequency domain resources;
the plurality of bandwidths having the same bandwidth index;
the plurality of bandwidths being all valid states;
the plurality of bandwidths having a same transmission direction, wherein the transmission direction includes an uplink direction or a downlink direction; or
Different ones of the plurality of bandwidths belong to different bandwidth groups.
23. The method of any of claims 16-21, wherein the plurality of bandwidths having the first relationship includes two bandwidths corresponding to one of:
two component carriers belonging to a master cell group and a secondary cell group, respectively;
two component carriers of two component carrier groups belonging to a master cell group, respectively;
two component carriers of two component carrier groups belonging to the auxiliary cell group respectively; or
Two bandwidth portions belonging to two component carriers, respectively, wherein the two component carriers comprise one of: two component carriers belonging to a master cell group and a secondary cell group, respectively; two component carriers of two component carrier groups belonging to a master cell group, respectively; or two component carriers of two component carrier groups respectively belonging to the secondary cell group.
24. A method, comprising:
determining from the first information at least one condition that is fulfilled by resources occupied by the at least two channels,
wherein the first information comprises information on a control resource set (CORESET) group and a serving cell.
25. A method, comprising:
determining from the first information at least one condition that is fulfilled by resources occupied by the at least two channels,
wherein the first information includes information on a bandwidth part and a serving cell.
26. The method of claim 24 or 25, wherein the one condition comprises at least one of:
when first information corresponding to two channels is the same, the resources occupied by the two channels meet a first condition;
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 two channels comprise an uplink channel and a configuration authorized PUSCH and the configuration authorized PUSCH is the same as the first information of the uplink channel, a second condition is met between the transmission opportunities configured by the uplink channel and the configuration authorized PUSCH; or
When the two channels comprise 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 transmission opportunities of the uplink channel and the configuration-granted PUSCH.
27. The method of claim 26, wherein the second condition comprises at least one of:
before a starting time domain symbol of a transmission opportunity of the configuration-granted PUSCH, when an end position of a control channel scheduling the uplink channel is within a predetermined time window, time domain non-overlapping between the uplink channel and the transmission opportunity of the configuration-granted PUSCH; or
When the transmission opportunities of the uplink channel scheduled by a control channel and a configuration-granted PUSCH have the same process number, the end position of the control channel cannot occur within a predetermined time window before the start time domain symbol of the transmission opportunity of the configuration-granted PUSCH.
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 the 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, 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 having the same process number.
29. The method of claim 26, wherein the first condition includes information about a CORESET and a serving cell, and:
the first information corresponding to the two channels is the same, and includes: the two channels correspond to the same CORESET group, and the two channels are positioned in a service cell; or
The first information corresponding to the two channels is different, and includes: the two channels correspond to different sets of CORESET and/or the two channels are located in different cells.
30. The method of claim 26, wherein the first condition includes information about a bandwidth portion and a serving cell, and:
the first information corresponding to the two channels is the same, and includes: the two channels correspond to the same BWP group, and the two channels are located within one serving cell; or
The first information corresponding to the two channels is different, and includes: the two channels correspond to different BWP groups and/or the two channels are located in different serving cells.
31. 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 recited by claims 1-30.
CN201980100942.8A 2019-09-30 2019-09-30 Method and system for determining uplink and downlink transmission parameters in wireless communication network Pending CN114503640A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/109598 WO2021062703A1 (en) 2019-09-30 2019-09-30 Systems and methods for determining parameters for uplink and downlink transmissions in wireless communication networks

Publications (1)

Publication Number Publication Date
CN114503640A true CN114503640A (en) 2022-05-13

Family

ID=75337651

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201980100942.8A Pending CN114503640A (en) 2019-09-30 2019-09-30 Method and system for determining uplink and downlink transmission parameters in wireless communication network

Country Status (2)

Country Link
CN (1) CN114503640A (en)
WO (1) WO2021062703A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20240004933A (en) * 2021-05-07 2024-01-11 베이징 시아오미 모바일 소프트웨어 컴퍼니 리미티드 Physical downlink control channel monitoring method, device and storage medium

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014117358A1 (en) * 2013-01-31 2014-08-07 Telefonaktiebolaget L M Ericsson (Publ) Tdm-based resource partition between two radio base stations
CN104869578A (en) * 2014-02-26 2015-08-26 中国电信股份有限公司 Physical downlink control channel blind detection method, device and user equipment
US10951300B2 (en) * 2017-08-11 2021-03-16 National Instruments Corporation Radio frequency beam management and recovery
CN110061816B (en) * 2018-08-31 2020-07-14 中国信息通信研究院 Mobile communication system, network equipment, terminal equipment and data scheduling method

Also Published As

Publication number Publication date
WO2021062703A1 (en) 2021-04-08

Similar Documents

Publication Publication Date Title
EP3927077A1 (en) Signal transmission and reception method for unlicensed band communication, and apparatus therefor
US8830936B2 (en) Allocating control channel elements to downlink control channels
EP2445289B1 (en) Method for mapping control channel, method for detecting control channel and device thereof
CN111344975B (en) Codebook feedback for data retransmission
JP7301196B2 (en) Terminal, wireless communication method and system
US20220201691A1 (en) Threshold value, resource determination method, apparatus, network device, and storage medium
EP4231750A2 (en) User terminal and radio communications method
CN102065485B (en) Method and device for allocating control channel element resource
JP2020500475A (en) Wireless communication method and device
US11539489B2 (en) Control information transmission method, receiving method, device, base station and terminal
US20200045733A1 (en) Uplink Scheduling For NR-U
US11412538B2 (en) User device, network node and methods thereof
JPWO2019193737A1 (en) User terminal and wireless base station
JPWO2019159238A1 (en) User terminal and wireless communication method
US20230371043A1 (en) System and method for blind detection
EP3518592B1 (en) User terminal, radio communication method, radio base station and radio communication system
US20230047144A1 (en) Physical downlink control channel monitoring method and apparatus
CN114503640A (en) Method and system for determining uplink and downlink transmission parameters in wireless communication network
US20230026357A1 (en) Method and apparatus for resource mapping in unlicensed spectrum
EP3570609A1 (en) User terminal and radio communication method
WO2023123513A1 (en) Pdcch detection method, terminal device, network device, and storage medium
US20230337028A1 (en) Monitoring a channel with punctured resource elements in telecommunications systems
WO2023168564A1 (en) Transmissions across multiple time-domain resources in wireless communication networks
CN113678533A (en) System and method for scheduling channels
KR20200100001A (en) Measurement method and apparatus for supporting mobility in communication system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination