Method and apparatus for pdcch repetition

Abstract

Embodiments of the present application relate to methods and apparatus for PDCCH repetition. A method according to embodiments of the present application includes receiving control channel element (CCE) aggregation level (AL) information in a search space set configuration; determining a scaling factor for each of a set of repetition levels for a maximum number of repetitions, wherein the maximum number of repetitions corresponds to a total number of monitoring occasions (MOs) within a group of MOs; calculating a number of PDCCH candidates to monitor for each of the set of repetition levels based on the CCE AL information and the scaling factor for each of the set of repetition levels; and receiving a control signal regarding the PDCCH candidates.

Description

TECHNICAL FIELD

[0001] This application relates generally to wireless communication, and more particularly to physical downlink control channel (PDCCH) repetition techniques. BACKGROUND

[0002] The next generation wireless communication system 5G is an example of an emerging telecommunication standard. New Radio (NR) is generally a set of enhancements to the Long Term Evolution (LTE) mobile standard promulgated by the Third Generation Partnership Project (3GPP). It is desirable to increase network throughput, coverage, and robustness and to reduce latency and operational and capital expenditures for 5G and / or NR networks.

[0003] As 5G and NR networks evolve, refinements to 5G / NR technology are needed. SUMMARY

[0004] Some embodiments of the application provide a method for wireless communication performed by a user equipment (UE). The method includes receiving control channel element (CCE) aggregation level (AL) information in a search space set configuration; determining a scaling factor for each of a set of repetition levels, wherein the set of repetition levels corresponds to a maximum number of repetitions; calculating a number of physical downlink control channel (PDCCH) candidates to monitor for each of the set of repetition levels based on the CCE AL information and the scaling factor for each of the set of repetition levels; and receiving a control signal regarding the PDCCH candidates.

[0005] Some embodiments of the application also provide an apparatus for wireless communication. The apparatus includes a non-transitory computer-readable medium having computer-executable instructions stored therein; receiving circuitry; transmitting circuitry; and a processor coupled to the non-transitory computer-readable medium, the receiving circuitry, and the transmitting circuitry, wherein the computer-executable instructions cause the processor to implement the above-mentioned method performed by a UE.

[0006] The details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims. BRIEF DESCRIPTION OF DRAWINGS

[0007] In order to describe the manner in which the advantages and features of the disclosure can be obtained, a description of a specific embodiment thereof is rendered by reference to the appended drawings. These drawings depict only exemplary embodiments of the disclosure and are therefore not to be considered limiting of its scope.

[0008] Figure 1 A schematic diagram illustrating a wireless communication system in accordance with some embodiments of the application is shown.

[0009] Figure 2A An exemplary configuration of a search space is illustrated in accordance with some embodiments of the present application.

[0010] Figure 2B Another exemplary configuration of a search space is illustrated in accordance with some embodiments of the present application.

[0011] Figure 3 An exemplary search space set is illustrated in accordance with some embodiments of the present application.

[0012] Figure 4A An exemplary specification of the number of PDCCH candidates per AL for the CSS set configured by searchspaceSIB1 is illustrated in accordance with some embodiments of the present application.

[0013] Figure 4B Another exemplary specification of the number of PDCCH candidates per AL for the CSS and USS is illustrated in accordance with some embodiments of the present application.

[0014] Figure 5 An exemplary configuration of the total number of PDCCH candidates is illustrated in accordance with some embodiments of the present application.

[0015] Figure 6 A flowchart of a method for wireless communication is illustrated in accordance with some embodiments of the present application.

[0016] Figure 7 An exemplary search space set configuration is illustrated in accordance with some embodiments of the present application.

[0017] Figure 8 An exemplary configuration of a starting position of a search space is illustrated in accordance with some embodiments of the present application.

[0018] Figures 9A to 9C An exemplary configuration of a starting position of a search space is illustrated in accordance with some embodiments of the present application.

[0019] Figure 10 Another example of a starting position of a search space is illustrated in accordance with some embodiments of the present application.

[0020] Figures 11A to 11D An example of a total number of each of the repetition levels is illustrated in accordance with some embodiments of the present application.

[0021] Figure 12 An exemplary configuration of the number of PDCCH candidates is illustrated in accordance with some embodiments of the present application.

[0022] Figure 13Another exemplary configuration of the total number of PDCCH candidates according to some embodiments of the present application is illustrated.

[0023] Figure 14 Another exemplary configuration of the number of PDCCH candidates according to some embodiments of the present application is illustrated.

[0024] Figure 15 Additional exemplary configurations of the total number of PDCCH candidates according to some embodiments of the present application are illustrated.

[0025] Figure 16 Additional exemplary configurations of the number of PDCCH candidates according to some embodiments of the present application are illustrated.

[0026] Figure 17 A block diagram illustrating an exemplary device according to some embodiments of the present application is illustrated. DETAILED DESCRIPTION

[0027] The detailed description of the drawings is intended as a description of the preferred embodiments of the present application and is not intended to represent the only forms in which the present application can be practiced. It is understood that the same or equivalent functions can be accomplished by different embodiments that are intended to be encompassed within the spirit and scope of the present application.

[0028] Reference will now be made in detail to some embodiments of the present application, examples of which are illustrated in the accompanying drawings. In order to facilitate understanding, embodiments are provided under a specific network architecture and new service scenarios, such as 3GPP 5G, 3GPP LTE Release 8, and so on. It is contemplated that all embodiments in the present application are also applicable to similar technical problems as network architecture and new service scenarios are developed; and furthermore, the terminology cited in the present application can be changed, which should not affect the principles of the present application.

[0029] Figure 1 A schematic diagram illustrating a wireless communication system according to some embodiments of the present application is illustrated.

[0030] As Figure 1 As illustrated and shown in the description, the wireless communication system 100 includes at least one user equipment (UE) 101 and at least one base station (BS) 102. In particular, for illustrative purposes, the wireless communication system 100 includes two UEs 101 (e.g., a first UE 101a and a second UE 101b) and one BS 102 (e.g., a BS 102a). Although a specific number of UEs 101 and BSs 102 are depicted in the Figure 1 Although a specific number of UEs 101 and BSs 102 are depicted in the

[0031] The UE(s) 101 can include computing devices, such as desktop computers, laptop computers, personal digital assistants (PDAs), tablet computers, smart televisions (e.g., televisions with one or more internet connections), set-top boxes, game consoles, security systems (including security cameras), vehicle mounted computers, network devices (e.g., routers, switches, and modems), Internet of Things (IoT) devices, or the like. According to some embodiments of the application, the UE(s) 101 can include portable wireless communication devices, smart phones, cellular phones, flip-phones, devices with subscriber identity modules, personal computers, selective call receivers, or any other devices capable of sending and receiving communication signals on a wireless network. In some embodiments of the application, the UE(s) 101 include wearable devices, such as smart watches, fitness bands, optical head-mounted displays, or the like. Further, the UE(s) 101 can be referred to as a subscriber unit, a mobile device, a mobile station, a user, a terminal, a mobile terminal, a wireless terminal, a fixed terminal, a subscriber station, a subscriber terminal, or a device, or by other terminology used in the art. The UE(s) 101 can communicate directly with the BS(s) 102 via uplink (UL) communication signals.

[0032] The BS(s) 102 can be distributed throughout a geographic region. In certain embodiments of the application, each of the BS(s) 102 can also be referred to as an access point, an access terminal, a base station, a base unit, a macrocell, a Node-B, an evolved Node B (eNB), a gNB, an NG-RAN (Next Generation Radio Access Network) node, a master Node-B, a relay Node, or a device, or by other terminology used in the art. The BS(s) 102 are generally part of a radio access network that can include one or more controllers to which the BS(s) 102 can be communicatively coupled. The BS(s) 102 can communicate directly with each other. For example, the BS(s) 102 can communicate directly with each other via an Xn interface or an X2 interface.

[0033] In some embodiments of the application, the wireless communication system 100 is compatible with 5G / NR based on the 3GPP protocol of orthogonal frequency division multiplexing (OFDM). Radio resources are divided into subframes, each of which can contain one or more slots. Each slot can include various numbers of OFDM symbols depending on the slot configuration. The wireless communication system can also be based on orthogonal frequency division multiple access (OFDMA) downlinks.

[0034] In a 5G / NR network, when there is a downlink packet to be transmitted from a BS to a UE, each UE obtains a downlink assignment, e.g., a set of radio resources in a physical downlink shared channel (PDSCH). When a UE needs to transmit a packet in the uplink to the BS, the UE obtains a grant from the BS assigning a physical uplink shared channel (PUSCH) consisting of a set of uplink radio resources. The UE obtains the downlink and / or uplink scheduling information from a PDCCH that targets that UE explicitly. In addition, broadcast control information is also transmitted in the PDCCH. The downlink and uplink scheduling information and broadcast control information carried by the PDCCH are collectively referred to as DCI.

[0035] As shown in FIG. 1, Figure 1 The PDCCH is used to enable the BS 102 to transmit DCI to the first UE 101a and the second UE 101b. The PDCCH can be transmitted in a control resource set (CORESET). A CORESET is a set of contiguous or distributed physical resource blocks (PRBs) configured for PDCCH transmission. Resource elements corresponding to the same OFDM symbol can be grouped into a resource element group (REG). A CORESET can contain one or more control channel elements (CCEs). Each CCE can contain multiple REGs in one or more symbols.

[0036] A PDCCH search space is a set of candidate control channels formed by CCEs at a given aggregation level that a device should attempt to decode. A PDCCH search space can also be referred to as a search space. A search space set is a set of search spaces, where each corresponds to an aggregation level. A DCI transmitted using an aggregation level k means that k CCEs are aggregated for transmission. A search space set is associated with a CORESET and is configured by radio resource control (RRC) signaling.

[0037] A UE can perform blind decoding in the entire PDCCH search space, trying to find PDCCH data (e.g., DCI). In a PDCCH region in a downlink (DL) radio frame, there can be many locations where a particular PDCCH is located, and the UE searches all possible locations of the PDCCH. All possible locations of the PDCCH can be referred to as a search space, and each possible location is referred to as a PDCCH candidate.

[0038] There are two types of search spaces: common search space (CSS) and UE-specific search space (USS). A UE is required to monitor both the common and UE-specific search spaces.

[0039] Currently, the 3GPP standards working group has approved support for NR devices with reduced capabilities. One objective of the 3GPP standards working group is to study functionalities that can mitigate or limit the performance degradation caused by the reduced complexity of NR devices. One possible solution is to compensate for the performance loss caused by a reduced number of UE transmit antennas, UE receive antennas, and reduced UE bandwidth. Among these, an effective mechanism to address the issue of PDCCH coverage loss is PDCCH repetition.

[0040] The maximum domain of the search space is determined by the maximum number of repetitions R. max Confirmed. Maximum number of repetitions R max This can be configured via RRC signaling. The UE only detects RRC signals during a single PDCCH cycle. max R i The total number through R max and R i Determine (except for the CSS used for paging), where R i This means a repeating level. A specific instance in... Figure 2A and 2B It is displayed in the middle.

[0041] Figure 2A This document describes exemplary configurations of the search space according to some embodiments of this application.

[0042] Figure 2A The embodiments pertain to a scenario using USS / CSS for Random Access Response (RAR). In Figure 2A In an embodiment, the repetition level R in a search space i These are R1, R2, R3, and R4, respectively. As can be seen, corresponding to R... max With the same value, the maximum total number of R1 is 8, the maximum total number of R2 is 4, the maximum total number of R3 is 2, and the maximum total number of R4 is 1. The first R... i Starting from the USS / CSS used for RAR. In the USS / CSS scenario used for RAR, the UE will monitor all numbers of R in the search space. i .

[0043] Figure 2B This application describes another exemplary configuration of the search space according to some embodiments of the present application.

[0044] Figure 2B The embodiments pertain to a scenario involving CSS for paging. In Figure 2B In an embodiment, the repetition level R in a search space i These are R1, R2, R3, R4, R5, R6, R7, and R8 (R4 to R7 are not shown). In scenarios using CSS for paging, the UE will only monitor R in the search space. i ,likeFigure 2B R i From the start of the CSS for the paging procedure.

[0045] The PDCCH search space can be determined by search space configuration and CORESET configuration. The search space configuration can contain the following parameters: periodicity, duration, and monitoring occasion (MO) start symbol within a slot, as specified in 3GPP standard document TS 38.213. The first (first few) symbols for PDCCH monitoring in a slot configured for PDCCH monitoring are in the parameter ‘monitoringSymbolsWithinSlot’. The CORESET configuration can contain the parameter of MO duration, which can be 1 symbol, 2 symbols, or 3 symbols.

[0046] One exemplary search space set configuration is listed in Table 1. The meaning of each parameter in Table 1 is shown below.

[0047]

[0048] Table 1 Parameter values for search space set configuration

[0049] • MonitoringSlotPeriodicity: the slot(s) for PDCCH monitoring, which is configured as periodicity;

[0050] • Offset: the slot(s) for PDCCH monitoring, which is configured as offset;

[0051] • Duration of search space set: the number of consecutive slots in which the search space lasts in each occasion; and

[0052] • monitoringSymbolsWithinSlot: the first (first few) symbols in a slot configured for PDCCH monitoring.

[0053] As specified in Section 10.1 of 3GPP standard document TS 38.213, for the same or different search space sets, the UE is not expected to have any two PDCCH MOs on the active DL bandwidth part (BWP) in the same CORESET separated by a non-zero number of symbols that is less than the CORESET duration. That is, when the MO duration is configured as 1 symbol, the corresponding consecutive bits are ‘1’. When the MO duration is configured as 2 symbols, the corresponding consecutive bits are ‘10’ and the consecutive bit ‘11’ is not used. When the MO duration is configured as 3 symbols, the corresponding consecutive bits are ‘100’ and the consecutive bits ‘111’ / ‘110’ / ‘101’ are not used. A specific example is given in Figure 3 .

[0054] Figure 3 An exemplary search space set according to some embodiments of the application is illustrated. The parameters values for embodiments of Figure 3 are given in Table 1.

[0055] In the embodiment of Figure 3 , the PDCCH monitoring periodicity is 8 slots, the PDCCH monitoring offset is 2 slots (i.e. slots 0 and 1), and the duration of the search space set is 3 slots (i.e. slots 2 to 4). Each slot in the duration of the search space set contains 14 symbols. From the'monitoringSymbolsWithinSlot' in Table 1, it can be seen that symbols 0 and 7 are the first symbols for PDCCH monitoring. If the CORESET duration is set to 2, then symbols 0 and 1 and symbols 7 and 8 are two PDCCH MOs separately in the slots shown in Figure 3

[0056] Figure 4A An exemplary specification of the number of PDCCH candidates per AL for CSS sets configured by searchspaceSIB1 according to some embodiments of the application is illustrated.

[0057] Figure 4A Table 10.1-1 of 3GPP standard document TS 38.213 is shown, which specifies the CCE aggregation level (AL) and the maximum number of PDCCH candidates per CCE AL for CSS sets configured by searchSpaceSIB1. As shown in Figure 4A , for CSS, there are three CCE ALs, i.e. 4, 8 and 16, and the corresponding maximum numbers of PDCCH candidates are 4, 2 and 1 respectively.

[0058] Figure 4B Another exemplary specification of the number of PDCCH candidates per AL for CSS and USS according to some embodiments of the application is illustrated.

[0059] Figure 4B The 'SearchSpace information element' defined in 3GPP standard document TS 38.331 is shown, which specifies the sequence of CCE ALs and the maximum number of PDCCH candidates per CCE AL for USS sets. As shown in Figure 4B , for USS, the CCE AL can be one of {1, 2, 4, 8, 16}, and can be configured by RRC signaling through the field nrofCandidates in the IE SearchSpace.

[0060] ​3GPP standard document TS 38.331 further specifies how IE SearchSpace defines / where to search for PDCCH candidates; for scheduled cell in case of cross-carrier scheduling, all optional fields are absent except nrofCandidates. 3GPP standard document TS 38.213 specifies that nrofCandidates represents the number of PDCCH candidates per AL.

[0061] As Figure 4B illustrated in Figure 5 , the sequence of the maximum number of PDCCH candidates per CCE AL contains one of {n0, n1, n2, n3, n4, n5, n6, n8}, which means that the UE needs to blindly detect up to 8 PDCCH candidates for a CCE AL. If PDCCH repetition is enabled, the UE also needs to blindly detect different repetition levels. Therefore, the blind detection complexity of the UE will be relatively high. Moreover, the number of candidates per PDCCH repetition level needs to be configured. A specific example is illustrated in

[0062] Figure 5 Exemplary configurations of the total number of PDCCH candidates according to some embodiments of the present application are illustrated. In Figure 5 embodiments, R i PDCCH search space is based on Figure 2A embodiments.

[0063] As Figure 5 illustrated in Figure 5 , the PDCCH search space contains four MOs in time and frequency domains, which are labeled as A, B, C, and D. Figure 5 Embodiments of max = 4, and thus, the values of R i are R1 = 1, R2 = 2, and R3 = 4, respectively. For ALs of {1, 2, 4, 8, and 16}, Figure 5 embodiments further assume that the configured PDCCH candidates are 0, 0, 5, 3, and 6, respectively.

[0064] In particular, for each single MO, the total number of PDCCH candidates is 5 + 3 + 6 = 14, as illustrated in Figure 5 . That is, in the scenario of PDCCH repetition being disabled, there are 14 PDCCH candidates in each signal MO. In this scenario, the sum of the number of signal MOs, i.e., MOs A, B, C, and D, is 4. Thus, the total number of PDCCH candidates at the end of MO D is 14 * 4 = 56. Therefore, according to Figure 5In the scenario of PDCCH repetition being disabled, the UE needs to blindly detect up to 56 PDCCH candidates in the PDCCH search space set.

[0065] In the scenario of PDCCH repetition being disabled, there are 14 PDCCH candidates per repetition level. In this scenario, the number of signal MO A, signal MO B, and the combined MO of A+B is 3, and 14*3=42. That is, the total number of PDCCH candidates is 42 at the end of MO B. Similarly, the number of signal MO A, B, C, and D is 4, and the number of combined MO of A+B, C+D, and A+B+C+D is 3. That is, the total number of PDCCH candidates is 14*(4+3)=98 at the end of MO D. Therefore, according to Figure 5 In the scenario of PDCCH repetition being enabled, the UE needs to blindly detect up to 98 PDCCH candidates in the PDCCH search space set.

[0066] As can be seen, the scenario of PDCCH repetition being enabled needs a larger number of PDCCH candidates compared to the scenario of PDCCH repetition being disabled. The larger number of PDCCH candidates will consume more power of the UE.

[0067] In addition, MOs can be used in a search space set for transmission of PDCCH repetition. The search space set is determined by the search space set duration and the parameter'monitoringSymbolsWithinSlot'. The total number of MO(s) in the search space set can be greater than the configured R max or not a power of 2. This case will cause some blind detection problems for the UE, for example, how to determine the starting position of the search space, how to determine the total number of search spaces in the search space set, how to handle the remaining MOs whose number is less than R max and thus cannot constitute a complete search space, and / or how to reduce the blind detection complexity of the UE. The number of PDCCH candidates is configured by high layer or RRC signaling which is not fixed in the table or standard. Therefore, it is better to define the rule for PDCCH candidates when PDCCH repetition is enabled. Embodiments of the present application focus on providing several alternatives to solve the above problems.

[0068] Figure 6 A flowchart of a method for wireless communication according to some embodiments of the present application is illustrated. Figure 6 The exemplary method 600 shown in FIG. 6 is performed by a UE to receive PDCCH repetition from a BS.

[0069] In the exemplary method 600, in operation 601, the UE (e.g., Figure 1The first UE 101a) illustrated and shown in the middle receives CCE AL information in search space set configuration. In operation 602, the UE determines a scaling factor for each of the repetition levels for a maximum number of repetitions corresponding to a total number of MOs within a group of MOs. The maximum number of repetitions can be named R max A group of MOs is related to a search space in a search space set.

[0070] According to some embodiments of the present application, the maximum number of repetitions, i.e., R max may be configured by RRC signaling. R max may be defined to contain one or more MOs, and the MOs are inferred from the parameter'monitoringSymbolsWithinSlot'.

[0071] In operation 603, the UE calculates the number of PDCCH candidates for each repetition level to be monitored based on the CCE AL information and the scaling factor for each repetition level. In operation 604, the UE receives a control signal on the number of PDCCH candidates.

[0072] The details described in all other embodiments of the present application can be applicable to the embodiments of Figure 6 . Furthermore, the details described in the embodiments of Figure 6 may be applicable to all embodiments of Figures 7 to 16 . The details can be, for example, details on how to determine the starting position of a search space, how to determine the total number of search spaces in a search space set, how to handle the remaining MOs that cannot form a complete search space, and / or how to reduce the blind detection complexity of a UE.

[0073] Figure 7 An exemplary search space set configuration according to some embodiments of the present application is illustrated.

[0074] Figure 7 The embodiments of illustrate a search space set based on a search space set configuration. The search space set duration of the search space set is 3 slots (i.e., Figure 7 slots 1, 2, and 3 illustrated in ). For each slot, the parameter'monitoringSymbolsWithinSlot' is '10101010101010'. The duration of each MO is 2 symbols, and there are a total of 21 MOs in the search space set (i.e., Figure 7 MOs 0 to 20 illustrated in ).

[0075] Figure 8 An exemplary configuration of the starting position of a search space according to some embodiments of the present application is illustrated. Figure 8 The search space set configuration of the embodiments of is the same as the search space set configuration described above Figure 7The search space set configuration of embodiments of the present disclosure is consistent.

[0076] Figure 8 Embodiments of the present disclosure assume a maximum repetition number, i.e., R max is configured to be 8. As shown in Figure 8 , the total of 21 MOs in the search space set contain two search spaces corresponding to R max and the remaining 5 MOs. Since the number of these remaining MOs (i.e., 5) is less than the value of R max (i.e., 8), they cannot form a complete search space. Each of the two search spaces contains 8 MOs. The starting position of the first search space is the MO with index 0. The starting position of the second search space is the MO with index 7, which is derived from the MO with index 0 and the value of R max .

[0077] If the UE only blindly detects the two search spaces, as shown in Figure 8 , while the BS needs to transmit PDCCH in one of the remaining MOs (e.g., the MO with index 16), the UE will miss the PDCCH in the remaining MO(s) in this search space set. Some embodiments of the present disclosure can solve this problem.

[0078] When the DCI is set to be repeated, the CORESET can only be set to 2 symbols or 3 symbols. According to some embodiments of the present disclosure, the starting position of the search space can be derived from the bitmap (rather than ‘10’ or ‘100’ for 2 or 3 CORESET symbols), and the bitmap can implicitly indicate the maximum repetition number, i.e., R max .

[0079] According to some embodiments of the present disclosure, the CORESET is set to 2 symbols, and the bitmap is as follows.

[0080] • The 2-symbol bitmap ‘10’ indicates the position of the MOs of the search space set; and

[0081] • The 2-symbol bitmap ‘11’ indicates the starting position of the search space and indicates that the maximum repetition number is 2.

[0082] According to some embodiments of the present disclosure, the CORESET is set to 3 symbols, and the bitmap is as follows. A specific example is shown in Figures 9A to 9C .

[0083] • The 3-symbol bitmap ‘100’ indicates the position of the MOs of the search space set;

[0084] • The 3-symbol bitmap ‘101’ indicates the starting position of the search space and indicates that the maximum repetition number is 2;

[0085] • A 3-bit bitmap '110' indicates the starting position of the search space and indicates that the maximum repetition number is 4; and

[0086] • A 3-bit bitmap '111' indicates the starting position of the search space and indicates that the maximum repetition number is 8.

[0087] Figures 9A to 9C An example configuration of the starting position of a search space according to some embodiments of the present application is illustrated.

[0088] Figure 9A Examples involving different starting positions and repetition number determination of a search space. Figure 9A The search space set configuration of embodiments of Figure 7 and 8 The search space set configuration of embodiments of Figure 9A The two bold consecutive bits "11" in the parameter'monitoringSymbolsWithinSlot' in max = 2, and the starting position of each search space in each slot (i.e., one of slots 1, 2, and 3 shown implicitly in Figure 9A ) corresponds to a configured R max = 2.

[0089] Figure 9B Examples involving different starting positions and repetition number determination of a search space. Figure 9B The search space set configuration of embodiments of Figure 9B is that the search space set duration of a search space is 3 slots, and the duration of each MO is 3 symbols. There are a total of 12 MOs in the search space set, from index 0 to 11. Figure 9B The three bold consecutive bits "110" in the parameter'monitoringSymbolsWithinSlot' in max = 4, and the starting position of each search space in each slot (i.e., one of slots 1, 2, and 3 shown implicitly in ) corresponds to a configured R max = 4.

[0090] Figure 9C Figure 9B The search space set configuration of embodiments of Figure 9C is similar to the search space set configuration of embodiments of max except that the R max of a search space is configured to be 8. Figure 9CThe three bold consecutive bits "111" in the parameter'monitoringSymbolsWithinSlot' in the second slot in the above example overlap with the previous repetition, thus it does not indicate the maximum repetition number or starting position of the search space, but only the position of the MO. From the value of R Figure 9C , the number of MOs starting at the MO indicated by the three consecutive bits '111' in the third slot in the above example is less than R max . It does not indicate the maximum repetition number or starting position of the search space, but only the position of the MO.

[0091] According to some embodiments of the present application, the starting position of a search space is derived from the starting position of the search space duration, R max , the offset, and the MO starting position. The offset can be configured by RRC signaling.

[0092] Figure 10 Another example of the starting position of a search space according to some embodiments of the present application is illustrated. In the above example, each MO contains two symbols, and the offset is configured as 4 MOs, R max = 8. Thus, it can be derived that the starting position of the first search space is the MO with index 4. The starting position of the second search space is the MO with index 12, which is derived from the value of R max , the value of'monitoringSymbolsWithinSlot', and the offset. Figure 10

[0093] According to some embodiments of the present application, the total number of search spaces in a search space set is determined by the search space duration, the bitmap of'monitoringSymbolsWithinSlot', the offset, and the value of R max . Embodiments of the present application assume that N is the total number of MOs indicated by the parameter'monitoringSymbolsWithinSlot'.

[0094] In embodiments of the present application, when the offset is configured as 0 or not configured, the total number of search spaces in a search space set is determined by equation (1):

[0095] floor(duration * N / R max ) (1)

[0096] where duration represents the duration of the search space set, and N represents the total number of MOs indicated by the parameter'monitoringSymbolsWithinSlot'.

[0097] In yet another embodiment of the present application, the total number of search spaces in a search space set is fixed as 1. In additional embodiments of the present application, the total number of search spaces in a search space set is configured by higher layer or RRC signaling.​

[0098] Some embodiments of the present application relate to computing the total number of R i .

[0099] In particular:

[0100] • When R max = 1, the R max value of the configured R i may be determined as: R1 = 1;

[0101] • When R max = 2, the R max value of the configured R i may be determined as: R2 = 2 and R1 = 1;

[0102] • When R max = 4, the R max value of the configured R i may be determined as: R3 = 4, R2 = 2 and R1 = 1; and

[0103] • When R max ≥ 8, the R max value of the configured R i may be determined as: R4 = R max , R3 = R max / 2, R2 = R max / 4 and

[0104] According to some embodiments of the present application, the total number of R i in a search space set is determined by the value of R max , the total number of search spaces in the search space set, and R i . For example, the PDCCH candidates of R i may be determined by equation (2):

[0105] M * R max / R i (2)

[0106] where M represents the total number of search spaces in the search space set.

[0107] According to some embodiments of the present application, when the offset is configured as 0 or not configured, the total number of PDCCH candidates of R i is determined by equation (3):

[0108] floor(duration * N / R i ) (3)

[0109] where "duration" denotes the duration of the search space set, and N denotes the total number of MOs indicated by the parameter'monitoringSymbolsWithinSlot'.

[0110] Figures 11A to 11D Additional examples of the total number of each of the repetition levels according to some embodiments of the application.

[0111] In Figures 11A to 11D embodiments, the duration * N = 21, R max = 16, and the offset is 0. It can be calculated according to equation (3) that R4= 16, as shown in Figure 11A , R3= 8, as shown in Figure 11B , R2= 4, as shown in Figure 11C , and R1= 2, as shown in Figure 11D . The PDCCH candidates of R4are 1, as shown in Figure 11A . The PDCCH candidates of R3are 2, as shown in Figure 11B . The PDCCH candidates of R2are 5, as shown in Figure 11C . The PDCCH candidates of R1are 10, as shown in Figure 11D .

[0112] When R max = 1, the detection complexity of monitoring PDCCH candidates by the UE can be the same as the legacy solution in the art. However, the embodiments of the application can effectively reduce the blind detection complexity of the UE, especially when R max > 1.

[0113] In particular, when R max > 1, if the number of PDCCH candidates of CCE AL is configured to be 0, the number of PDCCH candidates of CCE AL at R1is 0, the number of PDCCH candidates of CCE AL at R2is 0, the number of PDCCH candidates of this CCE AL at R3is 0, and the number of PDCCH candidates of CCE AL at R4is 0.

[0114] According to some embodiments of the application, the total number of PDCCH candidates of R i at CCE AL can be determined by:

[0115] • the number of PDCCH candidates at CCE AL configured by higher layer or RRC signaling; and

[0116] • a scaling factor a.

[0117] In an embodiment, the scaling factor is predefined. In another embodiment, the scaling factor is not predefined, but is configured by higher layer or RRC signaling.

[0118] In one embodiment, the scaling factor can be predefined as R i The total number of PDCCH candidates at R i The method of determining the total number of PDCCH candidates at R

[0119] floor(a*X + 0.5) (4)

[0120] where a represents a scaling factor that is one of four predefined values, and X represents the number of PDCCH candidates at a CCE AL configured by higher layer.

[0121] In another embodiment, the scaling factor can be predefined as R i The total number of PDCCH candidates at R i The method of determining the total number of PDCCH candidates at R

[0122] floor(a*X) + 1, if i <= (X%4) (5)

[0123] floor(a*X), if i > (X%4) (6)

[0124] where i represents the index of R i ;

[0125] a represents a scaling factor that is one of four predefined values; and

[0126] X represents the number of candidates at a CCE AL configured by higher layer or RRC signaling.

[0127] According to some embodiments of the present application, the total number of PDCCH candidates at R i is determined by:

[0128] • the sum of the number of PDCCH candidates of each CCE AL configured by higher layer or RRC signaling; and

[0129] • a scaling factor a.

[0130] More specifically, for the CCE AL(s) corresponding to non-zero number of PDCCH candidates, the scaling factor a can be determined by:

[0131] • the total number of the CCE AL(s) corresponding to non-zero number of PDCCH candidates; and

[0132] • The maximum total number of repeating levels.

[0133] For (a number of) CCE Al corresponding to zero PDCCH candidates, the scaling factor α is 0.

[0134] There are multiple cases corresponding to (several) different CCE ALs whose configured PDCCH candidate number is non-zero and is at (several) different repetition levels. These cases are arranged in order of AL followed by R. i The order or by R i The order of the subsequent ALs starts from 0. The number of each case can be named S. The number of PDCCH candidates can be determined by equation (7) or equation (8) as follows.

[0135] floor(α*Y)+1, if S<=(YW*Z) (7)

[0136] floor(α*Y), if S>(YW*Z) (8)

[0137] Where S represents the sequence number corresponding to the case where the configured PDCCH candidate number is non-zero and is a repeating level CCE AL;

[0138] α represents the scaling factor;

[0139] Y represents the sum of the number of PDCCH candidates for each CCE AL configured by higher-level or RRC signaling;

[0140] W represents the maximum total number of repeating levels; and

[0141] Z represents the total number of ALs corresponding to non-zero candidate numbers.

[0142] Calculate R based on equation (7) or equation (8). i The method for determining the total number of PDCCH candidates can be named Method 3. In Method 3, for AL corresponding to the non-zero number of PDCCH candidates, the scaling factor α in equations (7) and (8) is Furthermore, for the AL corresponding to zero PDCCH candidate number, the scaling factor is 0.

[0143] In an additional embodiment, CCE AL is R i The number of PDCCH candidates is determined by Figure 16 OK. This method can be named Method 4.

[0144] Figure 12 This application describes an exemplary configuration of the number of PDCCH candidates according to some embodiments of the present application. Figure 12 Example of using method 1.

[0145] Figure 12 Embodiments of the present disclosure assume that the PDCCH candidates of CCE AL {1, 2, 4, 8, 16} are configured according to Figure 4B 0, 0, 5, 3, 6. That is, the PDCCH candidates of CCE AL 1 are configured as n0, the PDCCH candidates of CCE AL 2 are configured as n0, the PDCCH candidates of CCE AL 4 are configured as n5, the PDCCH candidates of CCE AL 8 are configured as n3, and the PDCCH candidates of CCE AL 16 are configured as n6.

[0146] Figure 12 Embodiments of the present disclosure assume that the repetition levels R i comprise R1, R2, R3, and R4, as Figure 12 shown in the first solid box of FIG. 4. Figure 12 Embodiments of the present disclosure assume that the predefined scaling factors

[0147] Specifically, since the number of PDCCH candidates of CCE AL 1 is configured as 0, i.e., n0, the parameter X for CCE AL 1 in equation (4) is equal to 0. The PDCCH candidates of CCE AL 2 are also configured as 0, i.e., n0, and the parameter X for CCE AL 2 in equation (4) is equal to 0. Thus, according to equation (4), the total number of PDCCH candidates for each of R1, R2, R3, and R4 is 0 for both CCE AL 1 and 2, as Figure 12 shown in the first dashed box of FIG. 4.

[0148] Similarly, since the number of PDCCH candidates of CCE AL 4 is configured as 5, i.e., n5, the parameter X for CCE AL 4 in equation (4) is equal to 5. R1, R2, R3, and R4 correspond to the predefined scaling factors Thus, according to equation (4), the total number of PDCCH candidates for R1 and the predefined scaling factor of CCE AL 4 is According to equation (4), the total number of PDCCH candidates for R2 and the predefined scaling factor of CCE AL 4 is R3 and the predefined scaling factor of CCE AL 4 is and R4 and the predefined scaling factor of CCE AL 4 is These results are shown in the second dashed box of FIG. 4, and their sum is 5, which is equal to n5 configured for CCE AL 4. Figure 12 These results are shown in the second dashed box of FIG. 4, and their sum is 5, which is equal to n5 configured for CCE AL 4.

[0149] Similarly, according to equation (4), for CCE AL 8, the total number of PDCCH candidates for R1, R2, R3, and R4, and the predefined scaling factor is 2, 1, 0, and 0, respectively. The sum of these is 3, as shown in the second dashed box of Figure 12 , which is equal to n3configured for CCE AL 8.

[0150] According to equation (4), for CCE AL 16, the total number of PDCCH candidates for R1, R2, R3, and R4, and the predefined scaling factor is 3, 2, 1, and 0, respectively. The sum of these is 6, as shown in the third dashed box of Figure 12 , which is equal to n6configured for CCE AL 16.

[0151] Figure 13 Another exemplary configuration of the total number of PDCCH candidates according to some embodiments of the present application is illustrated. Figure 13 Embodiments of Figure 12 illustrate a particular application of the total number of PDCCH candidates calculated by embodiments of

[0152] Figure 13 The search space set configuration of embodiments of Figure 5 is similar to that of embodiments of max For example, the PDCCH search space contains four MOs in the time and frequency domains, i.e., A, B, C, and D; R i = 4; and the values of R

[0153] Figure 13 Embodiments of Figure 12 assume that PDCCH repetition is enabled. According to the results calculated for R1, as in the second column of the table in Figure 13 , the sum of the total number of PDCCH candidates for R1 for all CCE ALs is 0 + 0 + 3 + 2 + 3 = 8. That is, there are a total of 8 PDCCH candidates for each signal MO, e.g., R1 = 1 for A, R1 = 1 for B, and R1 = 1 for C or D, as shown in

[0154] According to the results calculated for R2, as in the third column of the table in Figure 12 , the sum of the total number of PDCCH candidates for R2 for all CCE ALs is 0 + 0 + 1 + 1 + 2 = 4. Thus, there are a total of 4 PDCCH candidates for two MOs, e.g., R2 = 2 for A + B, and R2 = 2 for C + D, as shown inFigure 13 It is displayed in the middle.

[0155] Based on the results calculated for R3, such as in Figure 12 In the fourth column of the table, the sum of the total number of PDCCH candidates for R3 for all CCE AL is 0+0+1+0+1 = 2. Therefore, there are a total of 2 PDCCH candidates for the four MOs. For example, for A+B+C+D, R3 = 4, as shown below. Figure 13 It is displayed in the middle.

[0156] In scenarios where PDCCH repetition is enabled, the total number of PDCCH candidates for signals MO A, MO B, MO C, MO D, A+B, C+D, and the combination MO of A+B+C+D is 42 at the end of MO D. Therefore, according to Figure 13 In the search space set configuration, in scenarios where PDCCH repetition is enabled, the UE needs to blindly detect up to 42 PDCCH candidates in the search space. Clearly, compared to... Figure 5 Compared to the previous embodiment, Figure 13 The implementation reduces the complexity of blind detection for the UE.

[0157] Figure 14 This application describes another exemplary configuration of the number of PDCCH candidates according to some embodiments of the present application. Figure 14 The embodiment uses method 3. Figure 14 The implementation example uses R first i The order of the ALs is used to number the various cases, each case corresponding to (several) different levels and (several) different CCE ALs, and each CCE AL corresponds to a non-zero number of PDCCH candidates.

[0158] Figure 14 The row and column configuration of the embodiment is similar to Figure 12 The row and column configuration of an embodiment. For example, Figure 14 The embodiment assumes that the number of PDCCH candidates for CCE AL{1,2,4,8,16} is configured as 0, 0, 5, 3, 6. Figure 14 The example assumes a repetition level R i It includes R1, R2, R3 and R4.

[0159] according to Figure 14 In this embodiment, the number of ALs with non-zero configured candidate counts is 3, i.e., Z = 3; and the maximum total number of repetition levels is 4, i.e., W = 4. Therefore, for ALs with non-zero configured PDCCH candidate counts, the scaling factor is... The total number of PDCCH candidates for each CCE AL configuration is 14, and thus Y = 14. Based on Method 3, according to equations (7) and (8), the total number of PDCCH candidates for each of R1, R2, R3, and R4 is 0 for both CCE AL 1 and 2, as shown in Table 1 of i . Figure 14

[0160] In particular, according to equations (7) and (8), the total number of PDCCH candidates for each of R1, R2, R3, and R4 is 0 for both CCE AL 1 and 2, as shown in Table 1 of Figure 14 . According to equations (7) and (8), the total number of PDCCH candidates for R1, R2, R3, and R4 is 2, 2, 1, and 1, respectively, for CCE AL 4; 1, 1, 1, and 1, respectively, for CCE AL 8; and 1, 1, 1, and 1, respectively, for CCE AL 16. These results are shown in the dashed boxes of Table 2 of Figure 14 , and their sum is 14, which is equal to the sum of n5+n3+n6=14 configured for CCE AL.

[0161] Figure 15 Embodiments of Figure 15 show particular applications of the total number of PDCCH candidates calculated by embodiments of Figure 14 .

[0162] Figure 15 Embodiments of Figure 5 and 13 assume a search space set configuration similar to that of and

[0163] . For example, the PDCCH search space contains four MOs, i.e., A, B, C, and D, in the time and frequency domains; R max = 4; and the values of R i are R1=1, R2=2, and R3=4, respectively. Figure 15 Figure 14 According to the results calculated for R1, as in the second column of the table in Figure 15 , the total sum of the total number of PDCCH candidates for R1 is 0+0+2+1+1=4 for all CCE ALs. That is, there are a total of 4 PDCCH candidates for each signal MO, e.g., R1=1 for A, R1=1 for B, and R1=1 for C or D, as shown in Table 1 of

[0164] According to the results calculated for R2, as in the third column of the table in Figure 14The total sum of the total number of PDCCH candidates for R2 over all CCE ALs is 0+0+2+1+1=4 in the third column of the table in Figure 15 .

[0165] According to the result calculated for R3, as shown in the fourth column of the table in Figure 12 , the total sum of the total number of PDCCH candidates for R3 over all CCE ALs is 0+0+1+1+1=3. Therefore, the four MOs have a total of 3 PDCCH candidates, e.g., R3=4 for A+B+C+D as shown in Figure 15 .

[0166] In the scenario with PDCCH repetition enabled, the total sum of the number of PDCCH candidates for the signal MO A, the signal MO B, the signal MO C, the signal MO D, the combined MO of A+B, the combined MO of C+D, and the combined MO of A+B+C+D is 25 at the end of MO D. Therefore, according to the search space set configuration in Figure 15 , in the scenario with PDCCH repetition enabled, the UE needs to blindly detect up to 25 PDCCH candidates in the search space. Obviously, compared to the embodiment of Figure 5 , the embodiment of Figure 15 reduces the blind detection complexity of the UE.

[0167] Figure 16 A block diagram illustrating an exemplary device according to some embodiments of the present application is described. Reference is made to Figure 16 . Figure 16 The row and column configuration of the embodiment of Figure 12 and 14 are similar.

[0168] According to method 4, the number of PDCCH candidates for R i at CCE AL is determined by Figure 16 . As shown in Figure 16 , the total number of PDCCH candidates for R1, R2, R3, and R4 is 1, 0, 0, and 0, respectively, for both CCE AL 4; the total number of PDCCH candidates for R1, R2, R3, and R4 is 1, 1, 0, and 0, respectively, for CCE AL 8; and the total number of PDCCH candidates for R1, R2, R3, and R4 is 1, 1, 1, and 1, respectively, for CCE AL 16.

[0169] Figure 17 A block diagram illustrating an exemplary device according to some embodiments of the present application is described. Reference is made to Figure 17The device 1700 includes receive circuitry 1702, transmit circuitry 1704, a processor 1706, and a non-transitory computer-readable medium 1708. The processor 1706 is coupled to the non-transitory computer-readable medium 1708, the receive circuitry 1702, and the transmit circuitry 1704.

[0170] It is contemplated that, for simplicity, some components are omitted from Figure 17 in some embodiments, the receive circuitry 1702 and the transmit circuitry 1704 can be integrated into a single component, such as a transceiver.

[0171] In some embodiments, the non-transitory computer-readable medium 1708 can have stored thereon computer-executable instructions that, when executed by the processor, cause the processor to implement the operations described above with respect to the UE(s). For example, upon execution of the computer-executable instructions stored in the non-transitory computer-readable medium 1708, the processor 1706 and the receive circuitry 1702 perform the method of Figure 6 , which includes the receive circuitry 1702 receiving CCE AL information in a search space set configuration, the processor 1706 determining a scaling factor for each of a maximum number of repetitions of a repetition level, where the maximum number of repetitions corresponds to a total number of MOs within a set of MOs, the processor 1706 calculating a number of PDCCH candidates to monitor for each of the repetition levels based on the CCE AL information and the scaling factor for each of the repetition levels, and the receive circuitry 1702 receiving a control signal with respect to the PDCCH candidates.

[0172] The methods of the present application can be implemented on a programmed processor. However, the controller, flow charts, and modules can also be implemented on a general purpose or specific computer, a programmed microprocessor or microcontroller and peripheral integrated circuit elements, an integrated circuit, a hardware electronic or logic circuit such as a discrete element circuit, a programmable logic device, or the like. In general, a machine that can be programmed to operate in accordance with the methods of the present application is also considered a processor. It is therefore, contemplated that any processor capable of implementing the flow charts shown in the figures can be used to implement the processor functions of the present application.

[0173] Those of ordinary skill in the art will appreciate that the steps of the methods described herein in connection with the aspects disclosed herein can be embodied in hardware, in software modules executed by a processor, or in a combination of the two. The software modules can reside in Random Access Memory (RAM), flash memory, Read Only Memory (ROM), Erasable Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. Additionally, in some aspects, the steps of the methods can reside as one or any combination or set of codes and / or instructions in non-transitory computer-readable media which can be incorporated into a computer program product.

[0174] Although the present disclosure has been described with reference to specific embodiments thereof, it is evident that many alternative, modifications and variations will become apparent to those skilled in the art. For instance, various components of the embodiments can be interchanged, added, or removed in other embodiments. Also, not all of the elements of each figure are necessary for operation of the disclosed embodiments. For example, one of ordinary skill in the art of the disclosed embodiments will be able to construct and use the teachings of the present disclosure by simply applying the elements of the independent claims. Accordingly, the embodiments of the present disclosure set forth herein are intended to be illustrative, not limiting. Various changes can be made without departing from the spirit and scope of the disclosure.

[0175] In this document, the terms“comprise” or“comprising” or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but can include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element preceded by“a” or“an” or similar refers to inlusive of at least one of that element. Also, the term“another” is defined as at least a second or more. As used herein, the terms“include,”“have,” and the like are defined as“comprising.”

Claims

1. A user equipment (UE) comprising: at least one memory; and at least one processor coupled with the at least one memory and configured to cause the UE to: receive control channel element (CCE) aggregation level (AL) information in a search space set configuration; determine a scaling factor for each repetition level of a plurality of repetition levels, wherein each repetition level is associated with a maximum number of repetitions, and wherein the maximum number of repetitions corresponds to a total number of monitoring occasions (MOs) within a set of MOs; calculate a number of physical downlink control channel (PDCCH) candidates to monitor for each repetition level from the received CCE AL information, or a sum of the scaling factor determined for each repetition level and a number of PDCCH candidates determined from the received CCE AL information; and receive a control signal regarding the PDCCH candidates.

2. The UE of claim 1, wherein the received CCE AL information includes a number of candidates of PDCCH for a plurality of CCE ALs.

3. The UE of claim 1, wherein the determined scaling factor is configured by radio resource control (RRC) signaling.

4. The UE of claim 1, wherein the at least one processor is configured to cause the UE to determine the scaling factor by: a total number of CCE ALs corresponding to a non-zero number of candidates in the search space set configuration; and a maximum total number of the repetition levels.

5. The UE of claim 1, wherein the at least one processor is configured to cause the UE to calculate the number of PDCCH candidates to monitor for each of the repetition levels based on: a sum of a number of PDCCH candidates for a plurality of CCE ALs; or a number of PDCCH candidates for each of a CCE AL and the determined scaling factor.

6. The UE of claim 1, wherein the at least one processor is configured to cause the UE to calculate the number of PDCCH candidates to monitor for each of the repetition levels by one of: floor(a*X); and floor(a*X)+1, where a is the determined scaling factor for each of the repetition levels, and X is a sum of a number of PDCCH candidates for all CCE ALs.

7. The UE of claim 1, wherein the at least one processor is configured to cause the UE to determine the maximum number of repetitions based on a parameter "monitoringSymbolsWithinSlot" associated with the search space set configuration.

8. The UE of claim 1, wherein the at least one processor is configured to cause the UE to determine a starting position of the set of MOs within a slot based on a parameter "monitoringSymbolsWithinSlot" associated with the search space set configuration.

9. The UE of claim 7 or claim 8, wherein the at least one processor is configured to cause the UE to configure bits in the parameter “monitoringSymbolsWithinSlot” according to a duration configuration in a control resource set (CORESET).

10. The UE of claim 1, wherein the at least one processor is configured to cause the UE to determine a starting position of the set of MOs within a slot based at least on: a starting position of a first MO in a search space set associated with the search space set configuration; the total number of MOs within the set of MOs; and an offset.

11. The UE of claim 10, wherein the offset is configured by RRC signaling.

12. The UE of claim 10, wherein the search space set includes one or more sets of MOs, the one or more sets of MOs including the set of MOs, and each of the one or more sets of MOs includes a same number of MOs.

13. The UE of claim 12, wherein a total number of sets of the one or more sets of MOs in the search space set is configured by RRC signaling.

14. The UE of claim 12, wherein a total number of sets of the one or more sets of MOs in the search space set is determined by: a total number of slots in the search space set; a parameter “monitoringSymbolsWithinSlot”; the offset; and a maximum total number of MOs within each set of MOs.

15. The UE of claim 1, wherein the at least one processor is configured to cause the UE to determine a total number of each of the repetition levels by: a total number of one or more sets of MOs in a search space set associated with the search space set configuration; a maximum total number of MOs within the set of MOs; and a total number of MOs in each of the repetition levels.

16. The UE of claim 1, wherein the at least one processor is configured to cause the UE to determine a total number of each of the repetition levels by: a total number of slots in a search space set associated with the search space set configuration; monitoringSymbolsWithinSlot; an offset; and a total number of MOs in each of the repetition levels.

17. A method for wireless communication performed by a user equipment (UE), comprising: receiving control channel element (CCE) aggregation level (AL) information in a search space set configuration; determining a scaling factor for each repetition level of a plurality of repetition levels, wherein each repetition level is associated with a maximum number of repetitions, and wherein the maximum number of repetitions corresponds to a total number of monitoring occasions (MOs) within a set of MOs; and monitoring the set of MOs for a PDCCH transmission based on the scaling factor. ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ calculating a number of physical downlink control channel PDCCH candidates to monitor for each repetition level from the received CCE AL information, or based on the determined scaling factor for each repetition level and a sum of a number of physical downlink control channel PDCCH candidates determined from the received CCE AL information; and receiving a control signal regarding the PDCCH candidates.

18. A network apparatus comprising: at least one memory; and at least one processor coupled with the at least one memory and configured to cause the network apparatus to: transmit control channel element (CCE) aggregation level (AL) information in a search space set configuration; determine a scaling factor for each repetition level of a plurality of repetition levels, wherein each repetition level is associated with a maximum number of repetitions, and wherein the maximum number of repetitions corresponds to a total number of monitoring occasions (MOs) within a set of MOs; calculate a number of physical downlink control channel (PDCCH) candidates to monitor for each repetition level from the received CCE AL information, or based on the determined scaling factor for each repetition level and a sum of a number of physical downlink control channel (PDCCH) candidates determined from the received CCE AL information; and transmit a control signal regarding the PDCCH candidates.

19. A method for wireless communication performed by a network apparatus, comprising: transmitting control channel element (CCE) aggregation level (AL) information in a search space set configuration; determining a scaling factor for each repetition level of a plurality of repetition levels, wherein each repetition level is associated with a maximum number of repetitions, and wherein the maximum number of repetitions corresponds to a total number of monitoring occasions (MOs) within a set of MOs; calculating a number of physical downlink control channel (PDCCH) candidates to monitor for each repetition level from the received CCE AL information, or based on the determined scaling factor for each repetition level and a sum of a number of physical downlink control channel (PDCCH) candidates determined from the received CCE AL information; and transmitting a control signal regarding the PDCCH candidates.

Images