Mobile communication method for monitoring and scheduling

Abstract

A system and method for monitoring and scheduling. In some embodiments, the method includes receiving, by a user equipment (UE), a downlink control information (DCI) that specifies scheduling of a first physical downlink shared channel (PDSCH) and a second PDSCH.

Description

[0001] Cross-references to related applications

[0002] This application claims the following priorities and interests: (i) U.S. Provisional Application No. 63 / 062,051, filed August 6, 2020, entitled “METHODS OF FLEXIBLE PDCCH MONITORING CAPABILITY FOR HIGHER SCS”; (ii) U.S. Provisional Application No. 63 / 138,585, filed January 18, 2021, entitled “METHODS OF FLEXIBLE PDCCH MONITORING CAPABILITY FOR HIGHER SCS”; (iii) U.S. Provisional Application No. 63 / 165,398, filed March 24, 2021, entitled “METHODS OF FLEXIBLE PDCCH MONITORING CAPABILITY FOR HIGHER SCS”; and (iv) U.S. Provisional Application No. 6, filed August 6, 2020, entitled “Methods of dynamicscheduling multiple PDSCH by a single DCI”. U.S. Provisional Application No. 63 / 062,234, (v) entitled “METHODS OF DYNAMIC SCHEDULING MULTIPLE PDSCH BY A SINGLE DCI”, filed August 6, 2020, and (vi) entitled “METHODS OF DYNAMIC SCHEDULING MULTIPLE PDSCH BY A SINGLE DCI”, filed August 7, 2020; the disclosure of all documents identified in this paragraph is incorporated herein by reference in its entirety. Technical Field

[0003] One or more aspects of embodiments of this disclosure relate to mobile communications, and more specifically, to systems and methods for adapting high subcarrier spacing in OFDM-based mobile communications. Background Technology

[0004] In mobile communication (e.g., 5G) systems, the use of high subcarrier spacing (e.g., 480 kHz or above) can present various challenges. For example, limitations on monitoring the Physical Downlink Control Channel (PDCCH) per time slot and the number of non-overlapping Control Channel Elements (CCEs) per time slot may be difficult to meet, and achieving high throughput may also be challenging if each Downlink Control Information (DCI) schedules only one Physical Downlink Shared Channel (PDSCH).

[0005] Therefore, there is a need for systems and methods to adapt to high subcarrier spacing in mobile communications. Summary of the Invention

[0006] According to embodiments of this disclosure, a method is provided, comprising: receiving downlink control information (DCI) by a user equipment (UE), wherein the DCI specifies the scheduling of a first physical downlink shared channel (PDSCH) and a second PDSCH.

[0007] In some embodiments, DCI identifies the first row of the Time Domain Resource Allocation (TDRA) table; the first row of the TDRA table specifies the scheduling of a first number of PDSCHs; and the second row of the TDRA table specifies the scheduling of a second number of PDSCHs that is different from the first number.

[0008] In some embodiments, the DCI does not include a code block group (CBG) field.

[0009] In some embodiments, the method further includes: receiving an indication from the UE that a third PDSCH will not be transmitted; receiving a first PDSCH; receiving a second PDSCH; and not receiving a third PDSCH.

[0010] In some embodiments, DCI includes a timing skew, and the method further includes sending an ACK or NACK in a Physical Uplink Control Channel (PUCCH) slot that follows the latest scheduled PDSCH after the timing skew.

[0011] In some embodiments, the DCI includes a downlink allocation index (DAI) having a value greater than 1 than the DAI in the most recently received DCI, wherein the difference between the DAI and the DAI in the most recently received DCI is equal to the number of start and length indicators (SLIVs) in a row of a time-domain resource allocation (TDRA) table identified by the DCI.

[0012] In some embodiments, the method further includes: the UE transmitting a number of bits in the PUCCH, the number being the maximum of the following products configured for the UE on each active serving cell: the maximum number of code block groups (CBGs) per PDSCH on the serving cell, and the maximum number of start and length indicators (SLIVs) in any row of the serving cell's Time Domain Resource Allocation (TDRA) table, wherein the DCI includes a downlink allocation index (DAI) having a value 1 greater than the DAI in the previous DCI.

[0013] In some embodiments, the DCI includes a first downlink allocation index (DAI) corresponding to a first PDSCH and a second DAI corresponding to a second PDSCH.

[0014] In some embodiments, the method further includes: the UE reporting the ability to perform uplink processing of non-overlapping control channel elements (CCEs) within a first limit and physical downlink control channels (PDCCHs) within a second limit in a number of consecutive time slots, the first limit being P non-overlapping CCEs, the second limit being Q PDCCHs, and the number of consecutive time slots being N, P, and Q, where N is a positive integer; the UE processing P CCEs received in M ​​time slots, where M is less than or equal to N; and the UE processing Q PDCCHs received in M ​​time slots, where P is greater than the per-slot limit specified in the corresponding standard, P is less than or equal to the product of N and the per-slot limit specified in the corresponding standard, Q is greater than the per-slot limit specified in the corresponding standard, and Q is less than or equal to the product of N and the per-slot limit specified in the corresponding standard.

[0015] In some embodiments, the method further includes: a value of P reported by the UE as a capability, and a value of Q reported by the UE as a capability.

[0016] In some embodiments, the method further includes: having the UE report a value of N as a capability.

[0017] In some embodiments, the method further includes receiving P CCEs in a resource element having a subcarrier spacing of 480 kHz or higher.

[0018] In some embodiments, the processing of P CCEs by the UE includes: not processing CCEs received in slots N-N0, where N0 is a positive integer.

[0019] In some embodiments, the method further includes: the UE sending an ACK after a processing time following the last symbol of the corresponding Physical Downlink Shared Channel (PDSCH), the processing time being greater than the processing time specified in the corresponding standard for non-aggregated BD / CCE limiting.

[0020] In some embodiments, the method further includes: the UE sending a PUSCH after the last symbol of the corresponding PDCCH with a preparation time, the preparation time being greater than the preparation time specified in the corresponding standard for non-aggregated BD / CCE restrictions.

[0021] In some embodiments, PDSCH is scheduled among Q PDCCHs. The method further includes: receiving the PDSCH by the UE, the PDSCH starting d symbols after the PDCCH, where d is a positive integer and is a standard-specified value or a value reported by the UE as a capability.

[0022] According to embodiments of the present disclosure, a system is provided, including: a user equipment (UE), the UE including: a radio; and processing circuitry configured to receive downlink control information (DCI), wherein the DCI specifies the scheduling of a first physical downlink shared channel (PDSCH) and a second PDSCH.

[0023] In some embodiments, DCI identifies the first row of the Time Domain Resource Allocation (TDRA) table; the first row of the TDRA table specifies the scheduling of a first number of PDSCHs; and the second row of the TDRA table specifies the scheduling of a second number of PDSCHs that is different from the first number.

[0024] In some embodiments, the DCI does not include a code block group (CBG) field.

[0025] According to embodiments of the present disclosure, a system is provided, including: a user equipment (UE) including: a radio; and means for processing, the means for processing being configured to receive downlink control information (DCI), wherein the DCI specifies the scheduling of a first physical downlink shared channel (PDSCH) and a second PDSCH. Attached Figure Description

[0026] These and other features and advantages of this disclosure can be understood by referring to the specification, claims and drawings, wherein:

[0027] Figure 1A It is a table of the maximum monitored PDCCH candidates per time slot;

[0028] Figure 1B It is a table showing the maximum number of non-overlapping control channel elements (CCEs) per time slot;

[0029] Figure 2A Examples of PDCCH monitoring locations in eight time slots are shown according to some embodiments of this disclosure;

[0030] Figure 2BIt is a table showing the maximum number of PDCCH candidates monitored within a span;

[0031] Figure 2C It is a table of the maximum number of non-overlapping CCEs within a span;

[0032] Figure 3A This is an illustration of the concept of repetition definition in monitoring based on the 15th generation (Rel-15) span, according to some embodiments of this disclosure;

[0033] Figure 3B This is an illustration of staggered user equipment (USS) specific search space (USS) scheduling according to some embodiments of this disclosure;

[0034] Figure 4A This is a table that processes time requirements;

[0035] Figure 4B This is a table that processes time requirements;

[0036] Figure 4C This is a table showing the preparation time requirements;

[0037] Figure 4D This is a table showing the preparation time requirements;

[0038] Figure 4E It is N pdsch The table;

[0039] Figure 5A According to some embodiments of this disclosure The table;

[0040] Figure 5B This is an illustration of DCI scheduling of multiple PDSCHs according to some embodiments of the present disclosure;

[0041] Figure 6A This is a sequence diagram of PDSCH scheduling according to some embodiments of this disclosure;

[0042] Figure 6B This is a sequence diagram of PDSCH scheduling according to some embodiments of this disclosure;

[0043] Figure 6C This is a sequence diagram of PDSCH scheduling according to some embodiments of this disclosure;

[0044] Figure 7 A flowchart of a method according to an embodiment of this disclosure; and

[0045] Figure 8 This is a block diagram of a mobile communication system according to an embodiment of the present disclosure. Detailed Implementation

[0046] The detailed description set forth below with reference to the accompanying drawings is intended as a description of exemplary embodiments of systems and methods for adapting high subcarrier spacing in mobile communications provided by this disclosure, and is not intended to represent the only form in which this disclosure may be constructed or utilized. This description illustrates features of the disclosure in conjunction with the illustrated embodiments. However, it should be understood that the same or equivalent functions and structures may be implemented by different embodiments included within the scope of this disclosure. As noted elsewhere herein, the same element numbers are intended to indicate the same elements or features.

[0047] In the 17th Revision (Rel-17) New Radio (NR) 52GHz to 71GHz research project, to achieve higher bandwidth and combat phase noise in higher frequency bands while maintaining the same Fast Fourier Transform (FFT) size of 4096, a new subcarrier spacing (SCS) needs to be adapted in this new frequency band. Adopting a higher SCS may present two fundamental problems. First, under the same channel conditions, coverage decreases by 3 dB when the SCS is doubled. This is because the achievable Tx power does not increase when the subcarrier spacing is increased; therefore, for the same number of subcarriers, the power spectral density decreases with increasing subcarrier spacing. Second, the physical downlink control channel (PDCCH) monitoring capability decreases with increasing SCS. Current NR monitoring capability is defined as the maximum number of PDCCH candidates monitored per time slot and the maximum number of non-overlapping control channel elements (CCEs) per time slot, as shown in Table 10.1-2. Figure 1A ) and Table 10.1-3 ( Figure 1B As shown in Section 10.1 of TS 38.213. The table shows that both of these quantities decrease as the SCS increases. Based on this trend, a further decrease is expected for higher SCS. In particular, when the SCS is equal to 960 kHz, the maximum non-overlapping CCE is expected to be less than 16, which is insufficient for AL16 candidates in this environment.

[0048] Therefore, in some embodiments, the maximum BD / CCE limit is defined over a duration of more than one time slot. This allows network nodes (gNBs) the flexibility to configure PDCCH monitoring timing over periods exceeding one time slot. This may offer the following advantages:

[0049] (i) By concentrating these allocatable, non-overlapping CCEs in a single time slot, gNB can allow multiple AL16 PDCCH candidates in a single time slot, which can improve PDCCH coverage.

[0050] (ii) The UE does not need to monitor the PDCCH in every time slot. This can lead to UE power savings when traffic is low.

[0051] The phrase “user equipment” is used as a countable noun in this article, even though the noun it contains (“equipment”) may be uncountable in ordinary English. Similarly, the phrase “downlink control information (DCI)” is also used as a countable noun.

[0052] Figure 2A An example of PDCCH monitoring locations across eight time slots is shown. As mentioned above, one method to address the exponential decrease in maximum non-overlapping CCE over a single time slot is based on determining the limit using the periods of multiple time slots. However, depending on the UE receiver processing flow for non-overlapping CCEs, CCE limits may not necessarily aggregate in a convenient manner. For example, Figure 2A Two different allocations of PDCCH monitoring timings across eight time slots are shown. It is assumed that each symbol has the same non-overlapping CCE and BD allocations. Figure 2A The two examples shown have the exact same number of BD / non-overlapping CCEs across eight time slots. However, from the UE's perspective, they are not identical. The fact that a UE can process Y non-overlapping CCEs in each of eight consecutive time slots does not mean that a UE can process them in a single time slot. There are non-overlapping CCEs. Therefore, in some embodiments, even if the UE only needs to process the CCE of one of the N time slots, there may still be an upper limit to the CCEs in a single time slot.

[0053] On the other hand, if the UE can handle non-overlapping CCE aggregations within eight time slots, then it should be able to handle any non-overlapping CCE aggregations within fewer than eight time slots. This can be reported through the UE capability report. Several embodiments are described below, some of which are numbered so that they can be referenced by number, and some of which include numbered alternatives or options.

[0054] Example 1: The UE capability that aggregates the maximum BD / CCE across multiple time slots is a UE capability (e.g., an optional capability or a capability specified for certain frequency bands, such as above 52.6 GHz). Additional capability values ​​can be notified via signaling (i.e., by the UE signaling to the gNB), as described below:

[0055] Alternative Option 1: For numerical values and the maximum non-overlapping CCE UE can report capabilities , so that:

[0056] (i) The UE only needs any given... Processing maximum within consecutive time slots Under the condition of non-overlapping CCEs, the UE can process a maximum of [number] times within a time slot. Non-overlapping CCEs.

[0057] (ii) when At that time, the network can be based on Each time slot is configured with the maximum non-overlapping aggregated CCE.

[0058] Alternative Option 2: Values ​​for each time slot and the maximum non-overlapping CCE UE can report capabilities ,in Then, in any The total number of non-overlapping CCEs configured within a time slot period is equal to or less than In certain cases, the network is permitted to allocate up to [number] slots in some time slots. Non-overlapping CCEs. These are constants to be determined (i.e., standard-specified constants). As used in this document, "standard-specified" refers to those specified by the 3rd Generation Partnership Project (3GPP), such as in the 38 Series 5G specifications or in specifications that may supersede or supplement these specifications in the future.

[0059] Alternatively, for higher SCS, you can The maximum number of BD / CCEs is defined directly on each (some number needs to be specified) time slot. For example, if The maximum non-overlapping CCE in each time slot is This means that the UE can Processing within a time slot Non-overlapping CCEs, regardless of where these CCEs are located. Where are the time slots configured?

[0060] Example 2: In this example, for higher SCS (such as 480kHz, 960kHz, or 1920kHz), the maximum BD / CCE is defined based on multiple time slots. Alternatively, when based on multiple time slots (e.g., When defining the maximum BD / CCE (in time slots), BD / CCE can be limited to each time slot. In a set of time slots Within a continuous time slot.

[0061] Example 2a: In this example, the definition of maximum BD / CCE based on multiple time slots in Example 2 is limited to... In each time slot Within a consecutive time slot (i.e.) (BD / CCE may not exist in each time slot), where:

[0062] Alternative Option 1: The value is determined by the UE capability, or

[0063] Alternative Option 2: The value is a predetermined (e.g., standard-specified) quantity.

[0064] The position of each consecutive time slot is The duration of a time slot can be arbitrary, or additional constraints can be applied to that location. For example, it might be necessary to repeat... These within a time slot set The positions of consecutive time slots form a fixed pattern.

[0065] Example 2b: In this example, the PDCCH capability of the maximum BD / CCE based on multiple time slots is defined as all BD / CCEs being limited to In each time slot Within a consecutive time slot. The location of a consecutive time slot can be:

[0066] Alternative Option 1: In There is no limit within each time slot, or

[0067] Alternative Option 2: In Arbitrary within each time slot, but each The pattern for each time slot is fixed; for example, the pattern in each time slot... Repeated within a time slot set.

[0068] In URLLC version 16 (Rel-16), a new per-span (instead of per-timeslot) PDCCH monitoring capability is defined. For each serving cell, the gNB can configure per-timeslot or per-span monitoring capability if the UE has the capability.

[0069] UE can be based on and The UE is configured with one or more combinations of (X,Y)=(2, 2), (4, 3), and (7, 3) per SCS to indicate its ability to monitor the PDCCH. The span is the number of consecutive symbols in a time slot within which the UE is configured to monitor the PDCCH. Each PDCCH monitoring opportunity occurs within a span. If the UE is configured to monitor the PDCCH based on the combination... If the PDCCH on the monitoring cell is used, then the UE supports having [something] between the first symbols of two consecutive spans (including spanning time slots). The PDCCH monitoring opportunity is defined as the time slot containing the minimum time interval of a given symbol within any symbol. The span begins with the first symbol of the PDCCH monitoring opportunity and ends with the last symbol of the PDCCH monitoring opportunity. The number of symbols in the span can be up to [number missing]. indivual.

[0070] If UE is based on multiple The combination indicates the ability to monitor PDCCH, and the configuration of the UE's search space set for PDCCH monitoring on the cell results in equal to or greater than multiple combinations. One or more of them The value is determined by the interval between every two consecutive PDCCH monitoring spans, then the UE determines the value based on one or more combinations. combination Monitor the PDCCH on the cell, this combination is consistent with Table 10.1-2A ( Figure 2B ) and Table 10.1-3A ( Figure 2C The maximum number defined in ) and Related. The UE expects the same combination in each slot on the cell's active downlink (DL) bandwidth portion (BWP). To monitor PDCCH.

[0071] By changing the span unit definition to a time slot (instead of a symbol), a similar concept can be used to define the UE PDCCH monitoring capability in a higher SCS. For multiple time slot spans... It is possible to define associated values ​​for different SCSs. and If the UE report supports certain The network can be based on the maximum number of time slots per X. Each CCE is used to configure the monitoring timing, and the CCEs allocated in each X time slots are concentrated in Y consecutive time slots or Y consecutive symbols in the corresponding SCS.

[0072] Example 3: In this example, based on multiple time slot spans Define the maximum BD / CCE, where X is defined in time slots, and Y can be defined in the corresponding values. The time slot or symbol is used for definition. This embodiment can have several options:

[0073] Option 1: Multiple reservations can be made. Multiple time slot spans defined , The value, and the UE indicates one or more To support each SCS.

[0074] Alternative Option 2: UE report for each pre-defined span , Multiple capabilities.

[0075] Alternative Option 3: UE Report for Multiple UE Definitions span , Multiple capabilities.

[0076] The various ways of defining UE PDCCH capabilities as described in Examples 1, 2, and 3 can be considered different ways of defining similar concepts. They all involve one or more methods to aggregate Rel-15 UE monitoring capabilities per time slot within a short period, allowing the UE to rest for a period afterward. The following sections discuss the search space and PDCCH monitoring signaling based on multiple time slots, examining the impact of this behavior from different perspectives.

[0077] In NR, a search space (SS) set can be configured for the UE to monitor the PDCCH. Up to 10 SS sets can be configured for each DL BWP in the serving cell. The time-domain mode of the SS set is configured by the following RRC parameters:

[0078] (i) The PDCCH monitoring cycle for each time slot and The PDCCH monitoring offset of each time slot is... monitoringSlot PeriodicityAndOffset Configuration.

[0079] (ii) PDCCH monitoring mode within a time slot, indicating the first symbol of CORESET within the time slot used for PDCCH monitoring, by... monitoring SymbolsWithinSlot Configuration, and

[0080] (iii) The duration of each time slot indicates the number of time slots in which the search space set s exists, determined by... duration Configuration.

[0081] Once an approach of defining capabilities across multiple time slots is chosen, the details of determining the search space configuration that satisfies a given capability can be addressed. These details may affect UE behavior, such as overbooking rules.

[0082] For example, in PDCCH monitoring capabilities based on the Rel-15 span, there is a method to determine the actual span of a given search space. The process (from TS38.822) introduces a 14-bit bitmap, where each bit corresponds to a symbol in a time slot. If any SS configuration overrides the symbol, the bit is set to 1. The final requirement for (X, Y) is based on the bitmap definition. The above process assumes constraints on the span pattern that repeats within a time slot.

[0083] For example Figure 3A As shown: In the first example ( Figure 3A The upper part of the bitmap is 11101100001100, and satisfies (X=4, Y=3); while in the second example ( Figure 3AThe lower part of the bitmap is 11111100001100 and does not satisfy (X=4, Y=3). Without the repeating constraint, both examples satisfy (X=4, Y=3). This span repeating constraint introduces further constraints on the SS configuration.

[0084] This repetitive constraint can facilitate UE implementation, for example, by providing uniform operation in each time slot. Furthermore, it provides a method for quickly determining such (X, Y) for the search space set. Without the constraint requirement, the UE or gNB might need to determine such (X, Y) time slots slot by slot, which could be inefficient.

[0085] Due to the short duration of time slots, PDCCH monitoring capabilities based on multiple time slots can reduce the complexity of UE implementation. This may help the UE to have the same active and inactive operations across multiple time slot periods. In some embodiments, PDCCH monitoring capabilities based on multiple time slots are used only in higher SCSs. The repetition constraint on multiple time slots in a higher SCS may be similar to the time slot-based repetition constraint in a lower SCS.

[0086] Example 4: In this example, the PDCCH monitoring capability is based on multiple time slot spans. It also supports repetition constraints across multiple time slots. The following alternatives are possible:

[0087] Alternative Option 1: Repeat the "cycle" This can be a predefined fixed number of time slots. For example, for a 480kHz SCS, And for 960kHz SCS, .

[0088] Alternative Option 2: Repeat the "cycle" This can be based on UE capabilities. For example, the UE can report support from multiple values. The values ​​of a predefined set, and gNB can be configured based on the reported values.

[0089] For based on Multi-slot PDCCH monitoring in several time slots (Examples 1 and 2), regarding the " The "time slot" window is located in the time domain and has two options. The term "time slot" used in this article... (or "time slot") The term "time slot window" (in quotes) refers to a continuous set of N time slots.

[0090] Option 1: The "time slot" window can be aligned with some known time boundaries; for example, it can be aligned with the frame boundary corresponding to system frame number SFN=0.

[0091] Option 2: "Time slot" can be interpreted as a sliding window. For example, if it is " The "time slot" window defines the capability, so in each sliding "time slot" window... Within the "time slot" window, the PDCCH monitoring configuration can meet the capability constraints.

[0092] As can be seen from TS38.213, for those with The monitoring cycle of each time slot and The search space set s for the PDCCH monitoring offset of each time slot, the UE determines if ( . + - ) The PDCCH monitoring opportunity exists when the number is The frame number is Within the time slot. Therefore, the search space is defined in a manner aligned with the frame boundary of SFN=0. In some embodiments, the "" used to define the PDCCH monitoring capability The "slot-by-slot" window is also aligned with this point so that both the UE and gNB can easily determine capabilities for a given set of search spaces.

[0093] Example 5: In this example, when based on " When defining PDCCH monitoring capabilities using "time slots" (all alternatives in Examples 1 and 2), these "time slots" The location of "time slot" can be:

[0094] Alternative Option 1: " One of the "time slot" windows is aligned with the frame boundary in the frame with SFN=0.

[0095] Alternative Option 2: " One of the "time slot" windows and time Alignment, where It is after the frame boundary of the frame with SFN=0. ,and It is the smallest offset within the search space of the search space set. .

[0096] Some embodiments relate to methods for managing the CSS and USS among multiple UEs. RAN1 104e contains issues related to methods such as Embodiments 2a and 3, namely that they all create forbidden gaps in which the gNB cannot allocate PDCCH resources. The gNB may be unable to configure multiple UEs to share the same common search space (CSS) with interleaved UE-specific search spaces (USS) (see...). Figure 3B (This section includes common use cases.)

[0097] Therefore, Example 2a can be modified to use separate UE capabilities for CSS and USS, and to link them with the concept of " The method of Alternative 2 in Embodiment 5 is combined with the position of the "time slot" window. This allows the gNB to flexibly... Figure 3B In multiple UE scheduling scenarios, the interleaved USS is configured as a common CSS.

[0098] Example 6: In this example, the PDCCH monitoring capability is defined using Example 2a, and the gNB and UE can support the option of indicating separate PDCCH monitoring capabilities for the CSS and USS.

[0099] If based on multiple time slot spans By defining PDCCH monitoring capabilities (Example 3), it can be achieved by checking CSS and USS separately. Conditions allow for the use of a similar approach. This can be accomplished with or without separate UE capabilities for USS and CSS.

[0100] Example 7: In this example, based on multiple time slot spans Define PDCCH monitoring capabilities (Example 3), and support CSS and USS. Options for the conditions. This can be accomplished in the following ways:

[0101] Alternative Option 1: Based on Multi-Time Slot Span The same PDCCH monitoring capabilities are applied, but span and gap conditions are checked separately for CSS and USS.

[0102] Alternative Option 2: Based on multi-slot spans for CSS and USS Apply standalone PDCCH monitoring capabilities.

[0103] In some embodiments, the UE PDSCH processing time requirements and PUSCH preparation time requirements can be adjusted under flexible PDCCH monitoring capabilities (e.g., when the UE is operating under aggregated BD / CCE and PDCCH constraints, the processing time requirements can be relaxed; compared to if the UE is operating under non-aggregated BD / CCE and PDCCH constraints, the UE needs to meet the PDSCH processing time requirements and PUSCH preparation time requirements). The aggregation of PDCCH monitoring can be configured by the network. This aggregated PDCCH monitoring will affect the Physical Downlink Shared Channel (PDSCH) processing time. Physical Uplink Shared Channel (PUSCH) preparation time This has an impact because PDSCH processing and PUSCH preparation are affected by PDCCH decoding latency when they are dynamically scheduled by PDCCH, and PDCCH decoding latency may increase due to aggregated PDCCH monitoring.

[0104] PDSCH processing time is defined as the amount of time after the last symbol of PDSCH ends, and is calculated as follows: ,in:

[0105] based on Figure 4A and Figure 4B The table, and Corresponding to ( µ PDCCH , µ PDSCH , µ UL One of the largest ,

[0106] Depending on the mapping type and time-domain assignment of the PDSCH, and its overlap pattern with the PDCCH, as described in section 5.3 of TS38.214.

[0107] ,and

[0108] d 1,1 As given below:

[0109] For PDSCH of mapping type A, as given in Section 7.4.1.1 of TS38.211: if the last symbol of the PDSCH is in the slot of the... i On the symbols, among which i < 7, then d 1,1 = 7 - i ,otherwise d 1,1 = 0 .

[0110] For UE processing capability 1: If PDSCH is mapping type B, as given in section 7.4.1.1 of [4, TS 38.211], and

[0111] If the number of PDSCH symbols allocated is L ≥ 7, then d 1,1 = 0,

[0112] If the number of PDSCH symbols allocated is L ≥ 4 and L ≤ 6, thend 1,1 = 7- L ,

[0113] If the number of PDSCH symbols allocated is L = 3, then d 1,1 = 3 + min ( d ,1), where, d It is the number of overlapping symbols between the scheduling PDCCH and the scheduled PDSCH.

[0114] If the number of PDSCH symbols allocated is 2, then d 1,1 = 3+d, where, d The number of overlapping symbols between the scheduling PDCCH and the scheduled PDSCH.

[0115] For UE processing capability 2: If PDSCH is mapping type B, as given in section 7.4.1.1 of [4, TS 38.211],

[0116] If the number of PDSCH symbols allocated is L ≥ 7, then d 1,1 = 0,

[0117] If the number of PDSCH symbols allocated is L ≥ 3 and L ≤ 6, then d 1,1 It is the number of overlapping symbols between the scheduling PDCCH and the scheduled PDSCH.

[0118] If the number of PDSCH symbols allocated is 2, then

[0119] (i) If the scheduled PDCCH is in a 3-symbol CORESET, and the CORESET and PDSCH have the same start symbol, then d 1,1 = 3,

[0120] (ii) Otherwise, d 1,1 It is the number of overlapping symbols between the scheduling PDCCH and the scheduled PDSCH.

[0121] PUSCH preparation time is defined as the time elapsed since the last symbol of the PDCCH carrying the downlink control information (DCI) for scheduling the PUSCH was received, and is calculated as follows:

[0122] ,in:

[0123] based on Figure 4C and Figure 4D The table, and Corresponding to ( µ DL , µ UL One of the largest ,

[0124] Defined according to the DMRS configuration described in section 6.4 of TS 38.214, and

[0125]

[0126] The above processing time and Based on the maximum number of BD / CCE per time slot defined in Tables 10.1-2 and 10.1-3 of TS38.213, when a UE is configured to monitor aggregated PDCCH across multiple time slots into a single time slot, the UE may need to allocate additional processing resources for PDCCH monitoring during these specific time slots, or it may need to use more time for PDCCH decoding. In calculation... and This factor can be considered at that time.

[0127] Example 8: In this example, the PDSCH processing time ( ) and PUSCH preparation time ( The additional complexity to the UE when configuring aggregated PDCCH monitoring capabilities within the time slot where the DCI is scheduled can be considered. For example, when configuring aggregated PDCCH monitoring, the relaxation of PDSCH processing time and PUSCH preparation time can be regarded as an additional delay.

[0128] It is reasonable to assume that the greater the degree to which PDCCH monitoring is "aggregated" within a time slot, the greater the impact on the PDSCH processing and PUSCH preparation timelines (in terms of increased latency). One way to define this quantification is based on values... ,in, Y is the actual number of non-overlapping CCEs configured in the time slot where the DCI is scheduled, and Y is the maximum number of non-overlapping CCEs defined per time slot. Therefore, It can be viewed as a “aggregation multiple” representing non-overlapping CCEs in a single time slot.

[0129] Example 9: In this example, the additional processing time caused by aggregating multi-slot non-overlapping CCEs into a single slot depends on the additional complexity to the UE compared to normal per-slot PDCCH monitoring.

[0130] Example 10: In this example, the additional processing time caused by aggregating multi-slot non-overlapping CCEs into a single slot may depend on the value ,in, Y is the actual number of non-overlapping CCEs configured in the time slot where the DCI is scheduled, and Y is the maximum number of non-overlapping CCEs defined per time slot.

[0131] In some embodiments, the additional processing time is proportional to the amount of additional non-overlapping CCEs aggregated in the time slot, compared to the maximum non-overlapping CCE per time slot; that is, it is proportional to the normalized amount. The middle part is linear, as shown in the following examples.

[0132] Example 11: In this example, if the time slot of the DCI scheduling PUSCH is configured as an aggregation multiple. The PUSCH preparation time is defined in Section 6.4 of TS38.214. Add additional time . It is a constant (per SCS) or a capability notified by UE signaling.

[0133] Example 12: In this example, if the time slot of the DCI scheduling PDSCH is configured as an aggregation multiple. The PDSCH processing time is defined in Section 5.3 of TS38.214. Add additional time to the calculation . It is a constant (per SCS) or a capability notified by UE signaling.

[0134] Generally, PDSCH processing time is less affected by PDCCH monitoring, unless PDSCH is scheduled in the same time slot as PDCCH, because that timeline is defined relative to the end symbol of PDSCH and is mainly determined by the decoding time of the data channel.

[0135] Example 13: In this example, in order to calculate the PDSCH processing time, it can be assumed that only the same time slot scheduling of PDSCH is affected by the multi-time slot aggregation of PDCCH monitoring.

[0136] If PDCCH monitoring capability is based on each multi-slot span The concept of “aggregation” of per-slot capacity, as defined, for example in Example 3, still exists in a more implicit way, and PDCCH monitoring may still affect latency. This additional latency can be quantified based on capacity across multiple time slot spans. This can be achieved in different ways, for example, as in the following examples.

[0137] Example 14: In this example, the PDSCH processing time ( ) and PUSCH preparation time ( The additional complexity of PDCCH monitoring can be considered when configuring PDCCH monitoring capabilities across multiple time slot spans. For example, when configuring PDCCH monitoring capabilities across multiple time slot spans, the relaxation of PDSCH processing time and PUSCH preparation time can be regarded as an additional delay.

[0138] Example 15: In this example, it can be for each SCS. Span (i.e., for each) Determine the PDSCH processing time when PDCCH monitoring capabilities are configured based on multiple time slot spans. The additional delay in ) can be defined accordingly If the network is configured to satisfy multiple predefined spans. The timing of monitoring can determine the decoding delay. The minimum value in.

[0139] Example 16: In this example, it can be for each SCS. Span (i.e., for each) Determine the PUSCH processing time when PDCCH monitoring capabilities are configured based on multiple time slot spans. The additional delay in ) can be defined accordingly If the network is configured to satisfy multiple predefined spans. The timing of monitoring can determine the decoding delay. The minimum value in.

[0140] In some embodiments, the UE PDSCH scheduling delay can be adjusted with flexible PDCCH monitoring capabilities. For example, the potential impact on PDCCH decoding delay (due to flexible PDCCH monitoring capabilities) is on the front-end buffer in the UE receiver.

[0141] In the Rel-15 and Rel-16 specifications, the first symbol of the PDSCH can be as early as the first symbol of the PDCCH that schedules the PDSCH. In practice, the UE needs to buffer data after the FFT starting from the first symbol of the PDCCH monitoring time, even if this data does not contain PDSCH data. This data can be refreshed after decoding the PDCCH (or decoding failure) and after the UE confirms that the PDSCH was not scheduled in the saved data. The ability to aggregate PDCCH in time slots introduces additional PDCCH decoding latency, potentially requiring a larger buffer; such a requirement may be undesirable.

[0142] One alternative is to introduce [a new feature] when the network is configured with aggregated PDCCH capabilities in time slots. The minimum scheduling delay for each symbol is used to schedule the PDSCH. This delay can compensate for the additional time used to decode the PDCCH, thereby reducing the buffer size requirement.

[0143] The NR Rel-16 specification already contains a similar concept of PDSCH scheduling delay for cross-carrier scheduling (CCS). When the scheduling PDCCH and the scheduled PDSCH have different SCS, a delay (or gap) may exist in the PDSCH scheduling to compensate for the UE's PDSCH reception preparation time. The specific behavior is described in the following two paragraphs (from section 5.5 of TS 38.214), which reference... Figure 4E The table in the table (Table 5.5-1).

[0144] When µ PDCCH < µ PDSCH If the first symbol in the PDSCH allocation (including DMRS) is offset by a time slot offset K 0 Defined, and the start and length indicator SLIV of the scheduling DCI begins no earlier than the first symbol of the PDSCH receive slot, the PDSCH receive begins at least after the PDCCH of the scheduling PDSCH has ended. N pdsch If there are 1 PDCCH symbol, the UE is expected to receive the scheduled PDSCH, without considering the reception time difference between the scheduling cell and the scheduled cell.

[0145] When µ PDCCH > µ PDSCH If the first symbol in the PDSCH allocation (including DMRS) is offset by a time slot offset K 0 Defined, and the start and length indicator SLIV of the scheduling DCI begin no earlier than the end of the PDCCH of the scheduling PDSCH. N pdsch If there are 1 PDCCH symbol, the UE is expected to receive the scheduled PDSCH, without considering the reception time difference between the scheduling cell and the scheduled cell.

[0146] Example 17: In this example, when configuring time slots by aggregating the maximum BD / CCE across multiple time slots, if the scheduled PDSCH is no earlier than the start symbol of the PDCCH that schedules the PDSCH, If a symbol is present, the UE is expected to receive the scheduled PDSCH. Alternatively, the PDSCH scheduling delay can be defined relative to the end of the PDCCH that schedules the PDSCH, to further reduce the burden on the UE.

[0147] Example 18: In this example, when configuring time slots by aggregating the maximum BD / CCE across multiple time slots, if the scheduled PDSCH is not earlier than at least If the symbol begins, the UE is expected to receive the scheduled PDSCH.

[0148] In Example 13 or Example 14 The choice can be a predetermined value per SCS, or a value per SCS based on UE capability signaling notification. This value can also be the capacity aggregation number defined in Example 6. To scale. When the PDCCH monitoring capability for each multiple time slot span is defined as in Example 3, It can span multiple time slots The function.

[0149] Example 19a: In Example 18 The following options are available:

[0150] Alternative Option 1: This can be a fixed value per SCS, and this value can be predetermined or set based on UE capability signaling notifications. If the UE has no buffer constraints, then... The value can be 0.

[0151] Alternative Option 2: It can be per SCS The function, capacity aggregation number Defined in Example 6. Such a function can be about In the form of a lookup table (LUT), or a scaling function, for example... ,in, It can be a predetermined value per SCS or notified by UE capability signaling.

[0152] Alternative Option 3: It can be a multi-slot span per SCS Such a function can be different for each SCS. The LUT form. When the network configuration satisfies multiple predefined spans. When monitoring the timing, each of them may correspond to a scheduling delay. And scheduling delay can be The minimum value among them.

[0153] Furthermore, when BD / CCE aggregation across multiple time slots and CCS occurs simultaneously, the delay value... Further adjustments are possible. In some embodiments, the logic in Section 5.5 of TS 38.214 is applied to the newly defined value. This is used to aggregate BD / CCE limits across multiple time slots. In other words, the actual delay value of the scheduled cell is compared with that of the scheduled cell. The duration corresponding to each symbol. Specifically:

[0154] When µ PDCCH < µ PDSCH If the first symbol in the PDSCH allocation (including DMRS) is offset by a time slot offset K 0 Defined, and the start and length indicator SLIV of the scheduling DCI begins no earlier than the first symbol of the PDSCH receive slot, the PDSCH receive begins at least after the PDCCH of the scheduling PDSCH has ended. If there are 1 PDCCH symbol, the UE is expected to receive the scheduled PDSCH, without considering the reception time difference between the scheduling cell and the scheduled cell.

[0155] When µ PDCCH > µ PDSCH If the first symbol in the PDSCH allocation (including DMRS) is offset by a time slot offset K 0 Defined, and the start and length indicator SLIV of the scheduling DCI begin no earlier than the end of the PDCCH of the scheduling PDSCH. If there are 1 PDCCH symbol, the UE is expected to receive the scheduled PDSCH, without considering the reception time difference between the scheduling cell and the scheduled cell.

[0156] Example 19b: In this example, the scheduling of cells described in TS 38.214 (i) The duration corresponding to each symbol and (ii) scheduling cells N pdsch The maximum duration corresponding to each symbol is used as the minimum scheduling delay of the scheduled cell. In some embodiments, the scheduling delay of the cell is the same as that described in TS 38.214 (i). The duration corresponding to each symbol and (ii) scheduling cells N pdsch The duration corresponding to the sum or product of the durations of each symbol is used as the minimum scheduling delay of the scheduled cell.

[0157] Allowing for more flexible BD / CCE scheduling, as discussed and illustrated above, can result in a greater number of PDCCHs in some time slots. To achieve maximum throughput in this case, the gNB can schedule Physical Downlink Shared Channels (PDSCHs) covering each time slot. This can be achieved in several ways, such as (a) a single DCI can schedule multiple PDSCHs, (b) a single DCI can schedule a single multi-time slot PDSCH, or (c) multiple DCIs can schedule multiple PDSCHs and can support cross-time slot scheduling.

[0158] Of these possibilities, method (c) is supported under the current Rel-16 NR specification and has optional UE capabilities (which may require modification of some parameters). Method (b) may involve changes to the maximum transport block (TB) size and may require changes to the channel coding procedure, which may have a greater specification impact. Method (a) can be implemented using a combination of a redesigned DCI format 1_1 and an optional new Time Domain Resource Allocation (TDRA) table. For example, an implementation of method (a) may be described below.

[0159] In Rel-15, dynamic granting of PDSCH time domain allocation can be used. In NR, PDSCH time domain resources can be allocated indirectly through Time Domain Resource Allocation (TDRA) entries. The Scheduling Downlink Control Indicator (DCI) format 1_0 or 1_1 allocates time resources for a single PDSCH by indicating the index corresponding to the entry in the active TDRA table, with each row including the time slot offset (…). ) and start and length indicators ( ).

[0160] NR-U supports dynamic licensed PUSCH time-domain allocation. In Rel-16 NR-U, to improve channel utilization and reduce signaling overhead in unlicensed spectrum, multiple consecutive PUSCHs can be scheduled using a single DCI. This is achieved by combining an enhanced non-backoff DCI format (DCI format 0_1) and an enhanced TDRA table. The TDRA table structure can be modified as follows. Each row of the TDRA table includes 2 to 8 consecutive PUSCH resources, which contain: (i) a single This indicates the time slot of the first PUSCH to be sent, and (ii) the specification of the individual SLIV value and mapping type for each of the multiple PUSCHs. Different lines can specify different numbers of resources.

[0161] The DCI format 0_1 ​​field can be modified as follows. The NDI (New Data Indicator) field can be modified to be 2-8 bits in size, determined by the maximum number of schedulable PUSCHs across all entries in the TDRA table. Each bit corresponds to one scheduled PUSCH. The RV (Redundancy version) field can also be modified to be 2-8 bits in size, determined by the maximum number of schedulable PUSCHs across all entries in the TDRA table. Each bit corresponds to one scheduled PUSCH, and RV... The mapping follows Figure 5A The table. The HARQ process ID, notified by signaling in the DCI, is applied to the first scheduled PUSCH. Then, the HARQ process ID is incremented by 1 for subsequent PUSCHs in the scheduling order. A single MCS is applied to all PUSCHs, and the TB size is determined based on the Rel-15 procedure.

[0162] In some embodiments, multiple PDSCHs can be scheduled by a single DCI, such as Figure 5B As shown. Multiple PDSCHs scheduled by a single DCI can be implemented using a combination of the modified DCI format and, optionally, the modified TDRA table. DCI format 1_1 can be used, partly because the fallback DCI 1_0 format has a smaller size and may be less flexible for further expansion.

[0163] Example 20: In this example, the UE can be scheduled using N consecutive PDSCHs via DCI, as described below. Each row of the TDRA table configures N consecutive PDSCH resources (for example, a row of the TDRA table can specify the scheduling of the first PDCCH; and the same row of the TDRA table can also specify the scheduling of the second PDCCH), wherein, This indicates the time slot in which the UE is scheduled to receive the first PDSCH out of multiple PDSCHs. A separate SLIV value and mapping type are specified for each of the multiple PDSCHs (as described in Section 5.1.4 of TS38.214). The gNB implicitly configures the number N by the number of entries (SLIV, mapping type) in each row of the TDRA table.

[0164] The single HARQ process ID indicated by DCI 1_1 is applied to the first PDSCH; then, the HARQ process ID is incremented by 1 for each subsequent PDSCH in the scheduling order, and a modulo-16 operation is applied. An NDI exists and is indicated separately for each PDSCH allocation (1 bit per allocation, N bits per codeword) in the associated DCI 1_1. The RV for each PDSCH allocation is also indicated separately in the associated DCI 1_1 (1 bit per allocation, N bits per codeword). The definition of the 1-bit indicator is based on Figure 5A The table. DCI may also include Block Group (CBG) transmission information (CBGTI) and CBG refresh information (CBGFI), or the G of CBGTI. N bits and CBGFI, where G is 2, 4, 6, or 8 bits, are determined by higher-level parameters used in PDSCH. maxCodeBlockGroupsPerTransportBlock and maxNrofCodeWordsScheduledByDCI To determine.

[0165] One problem with the method in Example 20 might be that CBG support for multiple PDSCH scheduling in terms of DCI payload could be expensive if CBGs for all N PDSCHs were to be included. An alternative approach is to not support CBG operations in multiple PDSCH scheduling schemes (e.g., the DCI might not contain a CBG field).

[0166] Example 21: In this example, if the multiple PDSCH scheduling schemes of Example 20 do not support CBG-based operation, an improved granularity in time-domain allocation can be employed. A potential drawback of the method described in Example 20 is that once the TDRA table is configured, N is determined, and then the gNB schedules N consecutive PDSCHs to the UE. This scheduling of N consecutive PDSCHs (some of which may not be needed) can be wasteful of resources when the gNB has little data for a single UE. RRC reconfiguration is a relatively slow procedure, so this situation can reduce the flexibility of the gNB for scheduling. Therefore, in some embodiments, the size of the frequency domain allocation can be reduced. However, under certain conditions, this method can be challenging due to constraints in the frequency domain allocation, and in some embodiments, an improved granularity of time-domain allocation can be used.

[0167] For example, for each of the N scheduled PDSCHs, an additional N-bit flag can be included in the DCI to dynamically indicate whether the corresponding PDSCH should be sent. Specifically:

[0168] Example 22: In this example, an additional dynamic indicator for time-domain PDSCH allocation is introduced into the DCI used for multi-PDSCH scheduling, with the following possible options:

[0169] Alternative Solution 1: Introduce an additional N-bit flag in the DCI that schedules multiple PDSCHs to dynamically schedule fewer than N PDSCHs with the same TDRA table. Each bit of this flag indicates whether the corresponding PDSCH should be sent.

[0170] Alternative Option 2: Include additional features in DCI Bit indicator Only before sending PDSCH allocation.

[0171] Example 22 provides network flexibility to schedule fewer than N PDSCHs per DCI; however, it increases the overhead of the DCI, which may be undesirable. Therefore, in some embodiments, this N-bit information is included in the structure of the TDRA table. The following examples provide two alternatives to achieve this goal.

[0172] Example 23: In this example, an alternative structure is used for the TDRA table for flexible multi-PDSCH scheduling.

[0173] Alternative Solution 1: A special SLIV value X can be introduced. Each row of the TDRA table consists of N fixed SLIV entries. If a row has some entries with a value of X, then for those SLIV entries with a value of X, the corresponding PDSCH is not scheduled. An operational example based on this alternative solution is provided below. Figure 6A As shown in the image.

[0174] Alternative Option 2: Each row of the TDRA table can support a flexible number of SLIVs. SLIVs indicate the time domain allocation within separate time slots. An operational example based on this alternative is provided below. Figure 6B As shown in the image.

[0175] Alternative Option 3: Each row of the TDRA table includes rows with multiples. m And a new field for a single SLIV value. When scheduled by DCI, m Scheduling in consecutive time slots m A PDSCH with the same SLIV. An operational example based on this alternative is provided. Figure 6C As shown in the image.

[0176] In Alternative Option 3, the time-domain allocation pattern across multiple time slots is the same. This imposes some limitations on scheduling; however, it may have potential benefits in frequency bands above 52.6 GHz.

[0177] As mentioned above, higher SCS values ​​can lead to coverage issues. One way to combat this coverage loss in PDSCH transmission is through PDSCH repetition, which has been supported in NR since Rel-15. However, Rel-15 PDSCH repetition is achieved through the RRC parameter. pdsch-AggregationFactor The changes may be a slow process.

[0178] Due to the nature of beam operation in the frequency range above 52.6 GHz, the UE may need to operate in a more dynamic reception range and with greater flexibility in changing RRC parameters. pdsch-AggregationFactorIntroducing a faster way to dynamically switch PDSCH repetition and PDSCH multiple scheduling may be advantageous. For example, a TDRA scheme similar to Alternative Scheme 3 could be implemented, providing a way to dynamically switch PDSCH repetition and scheduling across multiple PDSCHs.

[0179] Example 24: In this example, dynamic switching between multiple PDSCHs and repeated PDSCH scheduling is supported. The method may include:

[0180] Alternative Option 1: Use the TDRA table, as in Alternative Option 3 of Example 23:

[0181] Each entry in the TDRA table provides a value m And a single SLIV value. Integer m It can indicate the number of multiple PDSCHs or the number of PDSCH repetitions. Switching between the two modes can be triggered by DCI or MAC-CE.

[0182] Alternative Option 2: Use the extended TDRA table with additional indicators from Alternative Option 3 of Example 23. The additional indicators explicitly indicate whether the corresponding entry is for multiple PDSCHs or PDSCH repetitions.

[0183] In some embodiments, the HARQ-ACK operation can be modified. For example, the PDSCH-to-HARQ timing offset can be adjusted.

[0184] Example 25: In this example, for a PDCCH that schedules multiple PDSCHs (where... (This is the maximum number of PDSCHs to be scheduled), and the values ​​of certain fields in the scheduled PDCCH can be set according to the following embodiments 6-1 to 6-3. In embodiment 25, the PDSCH-to-HARQ timing offset has One DCI field, , ,in, And L is configured for RRC.

[0185] Example 25-1: In Example 25, the UE can apply the PDSCH-to-HARQ timing offset, downlink allocation index (DAI), and PRI field, as shown below.

[0186] If the number of PDSCHs is scheduled Less than or equal to ,but Applied to l =1,…, L The l One PDSCH is scheduled.

[0187] If the number of PDSCHs is scheduled Greater than The scheduled PDSCH is then divided into L Group, so that in addition to including In addition to the last group of each PDSCH, each group includes One PDSCH. Applied to l =1,…, L group l All PDSCH in.

[0188] Example 25-2 (Single field of PDSCH-to-HARQ timing offset): In Example 25, L =1. It exists in DCI. A single entry. Time slot offset. The time slot is applied to the latest PDSCH in the scheduled PDSCH. All ACK / NACK (A / N) messages for scheduled PDSCHs are sent in the same PUCCH time slot.

[0189] Example 25-2 can be extended to include L The case is >1. In this case, DCI exists. Multiple entries are grouped by the scheduled PDSCH, and each It is applied from the latest PDSCH in the group to determine a PUCCH slot for all PDSCHs in the group.

[0190] Example 25-3 (for PDSCH-to-HARQ timing offset and multiple fields of the latest PDSCH as reference): In Example 25, the UE applies the PDSCH-to-HARQ timing offset as follows.

[0191] If the number of PDSCHs is scheduled Less than or equal to ,but Applied to l =1,…, L The l One PDSCH is scheduled.

[0192] If the number of PDSCHs is scheduled Greater than The scheduled PDSCH is then divided into L Group, so that in addition to including In addition to the last group of each PDSCH, each group includes One PDSCH. Applied to the receiving group l The latest PDSCH time slot in China. In applications... After that, the determined PUCCH slots are the PUCCH slots of all PDSCHs in the group.

[0193] In some embodiments, downlink allocation index and PUCCH resource determination may be affected.

[0194] Once a common understanding is established between the UE and gNB for determining the PUCCH slot for each scheduled PDSCH according to the methods described above or any other method, the UE applies the DAI and PRI fields in the DCI to each determined PUCCH slot according to one of the following methods: (See below) The number of PUCCH slots to be determined.

[0195] Example 26: In this example, for a PDCCH that schedules multiple PDSCHs, the number of the following fields in the scheduled PDCCH is determined as follows, wherein... The maximum number of PDSCHs to be scheduled.

[0196] The Downlink Allocation Index (DAI) and PUCCH Resource Indicator (PRI) have M DCI fields, such as... and ,in, And M is configured for RRC.

[0197] Example 27 (DAI and PUCCH Resource Determination): In this example, the number of PUCCH slots determined. Always less than or equal to the number of DAI and PRI fields in DCI UE will and Applied to the l There are 10 PUCCH slots, of which l =1,…, P The PUCCH slots are arranged in ascending order of their start times, i.e., the slot numbered 1 to 2. l The first PUCCH time slot starts earlier than the ( ) l +1) PUCCH slots.

[0198] In some embodiments, the HARQ-ACK codebook (CB), such as the Type-2 HARQ-ACK codebook, may be affected.

[0199] In the following method, it is assumed that a single PUCCH slot is used as a reference, and scheduling PDCCH includes a single entry of the DAI field and scheduling DCI of multiple PDSCH cells, and up to One PDSCH.

[0200] Example 28 (DAI increments according to the number of scheduled PDSCHs, and A / N bits are reserved based on the DAI value): In this example, in type-2 HARQ-ACK CB, if the scheduled PDCCH is scheduled... For each PDSCH, the C-DAI value in the DCI increases N times from the C-DAI value of the previous DCI. The UE reserves N A / N bits in case it detects such a DCI. The term "previous DCI" as used in this article refers to the order of the DCIs, where the DCIs are first sorted in ascending order in the serving cell index for the same monitoring time (MO), and then in ascending order in the MO start time.

[0201] Example 29 (DAI increments by 1, according to...) (Reserved A / N bits): In this embodiment, in type-2 HARQ-ACK CB, if the PDCCH is scheduled... For each PDSCH, the C-DAI value in the DCI increments by 1 sequentially from the C-DAI value of the previous DCI. Regardless of whether the UE detects the DCI, the UE retains... A / N bits. In the case of multiple CBGs per PDSCH, the UE may reserve (and transmit in PUCCH) a number of bits equal to the maximum product of the following items configured for the UE on each active serving cell: (i) the maximum number of CBGs per PDSCH on the serving cell, and (ii) the maximum number of SLIVs in any row of the TDRA table of the serving cell.

[0202] Example 30 (DAI increases according to the number of scheduled PDSCHs, based on...) (Reserved A / N bits): In this embodiment, in type-2 HARQ-ACK CB, if the PDCCH is scheduled... For each PDSCH, the C-DAI value in the DCI increases N times from the C-DAI value of the previous DCI. The UE retains the C-DAI value regardless of whether a DCI is detected. A / N bits.

[0203] Figure 7A method according to some embodiments is illustrated. The method includes, at 705, the UE reporting its ability to perform processing of non-overlapping control channel elements (CCEs) within a first constraint and processing of physical downlink control channels (PDCCHs) within a second constraint on several consecutive time slots. The first constraint is P non-overlapping CCEs, and the second constraint is Q PDCCHs, with the number of consecutive time slots being N, P, and Q, where N is a positive integer. This report from the UE may indicate that the UE is capable of supporting aggregation constraints on non-overlapping CCEs and PDCCHs, without necessarily specifying the aggregation constraints the UE can support (these constraints may be standard-defined, or they may be reported by the UE (e.g., reported separately)). The method also includes, at 710, the UE processing P CCEs received within M time slots, where M is less than or equal to N; and at 715, the UE processing Q PDCCHs received within M time slots. P can be greater than the per-slot limit specified in the corresponding standard (i.e., the limit applied without using the aggregation of limits on multiple slots), P can be less than or equal to the product of N and the per-slot limit specified in the corresponding standard, Q can be greater than the per-slot limit specified in the corresponding standard, and Q can be less than or equal to the product of N and the per-slot limit specified in the corresponding standard.

[0204] Figure 8 A system including a UE 805 and a gNB 810 communicating with each other is shown. The UE may include a radio 815 and processing circuitry (or means for processing) 820, which can perform various methods disclosed herein, such as Figure 7 The method is illustrated. For example, the processing circuit 820 can receive transmissions from the gNB 810 via radio 815, and the processing circuit 820 can send signals to the gNB 810 via radio 815.

[0205] As used herein, “a portion” means “at least some” of that thing, and therefore can mean less than all of that thing or refer to the whole thing. Thus, “a portion” of a thing includes the whole thing as a special case, i.e., an example where the whole thing is a portion of the thing. As used herein, when a second quantity is “within Y” of a first quantity X, it means that the second quantity is at least XY and at most X+Y. As used herein, when a second quantity is “within Y%” of a first quantity, it means that the second quantity is at least (1-Y / 100) times the first quantity and at most (1+Y / 100) times the first quantity. As used herein, the term “or” should be interpreted as “and / or”, for example, “A or B” means any one of “A” or “B” or “A and B”.

[0206] The terms “processing circuitry” and “means for processing” are used herein to refer to any combination of hardware, firmware, and software used for processing data or digital signals. Processing circuitry hardware may include, for example, application-specific integrated circuits (ASICs), general-purpose or special-purpose central processing units (CPUs), digital signal processors (DSPs), graphics processing units (GPUs), and programmable logic devices such as field-programmable gate arrays (FPGAs). In processing circuitry, as used herein, each function is either performed by hardware configured (i.e., hardwired) to perform that function or by hardware more generally configured to run instructions stored on a non-transitory storage medium (e.g., a CPU). Processing circuitry may be fabricated on a single printed circuit board (PCB) or distributed across multiple interconnected PCBs. Processing circuitry may include other processing circuitry; for example, processing circuitry may include two processing circuits, an FPGA and a CPU, interconnected on a PCB. As described above, processing circuitry or means for processing in a UE may perform the methods described herein, for example, by sending messages (via the UE’s radio) or by receiving messages (via the UE’s radio), and, in some cases, by performing further processing.

[0207] As used herein, when a method (e.g., adjustment) or a first quantity (e.g., a first variable) is referred to as “based on” a second quantity (e.g., a second variable), it means that the second quantity is an input to the method or affects the first quantity. For example, the second quantity may be an input to a function that computes the first quantity (e.g., a unique input or one of several inputs), or the first quantity may be equal to the second quantity, or the first quantity may be the same as the second quantity (e.g., stored in one or more of the same locations in memory as the second quantity).

[0208] It should be understood that although the terms "first," "second," "third," etc., may be used herein to describe various elements, components, regions, layers, and / or portions, these elements, components, regions, layers, and / or portions should not be limited by these terms. These terms are used only to distinguish one element, component, region, layer, or portion from another element, component, region, layer, or portion. Therefore, without departing from the spirit and scope of the inventive concept, the first element, component, region, layer, or portion discussed herein may be referred to as the second element, component, region, layer, or portion.

[0209] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the inventive concept. As used herein, the terms “substantially,” “approximately,” and similar terms are used as approximate terms rather than terms of degree and are intended to describe the inherent biases of measured or calculated values ​​that will be recognized by those skilled in the art.

[0210] As used herein, the singular forms “a” and “an” are also intended to include the plural forms, unless the context clearly indicates otherwise. It will be further understood that the terms “comprising” and / or “including”, when used in this specification, specify the presence of the stated features, integers, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or combinations thereof. As used herein, the term “and / or” includes any and all combinations of one or more associated listed items. Expressions such as “at least one of them”, when appearing before a list of elements, modify the entire list of elements without modifying any individual element in the list. Furthermore, the word “may” as used in describing embodiments of the inventive concept means “one or more embodiments of this disclosure.” Additionally, the term “exemplary” is intended to refer to an example or illustration. The terms “use,” “utilized,” and “being used” as used herein may be considered synonymous with the terms “exploited,” “utilized,” and “being exploited,” respectively.

[0211] Any numerical range described herein is intended to include all subranges containing the same numerical precision within the range described herein. For example, the range “1.0 to 10.0” or “between 1.0 and 10.0” is intended to include (and include) all subranges between the listed minimum value of 1.0 and the listed maximum value of 10.0, i.e., a minimum value equal to or greater than 1.0 and a maximum value equal to or less than 10.0, such as 2.4 to 7.6. Any maximum numerical limit described herein is intended to include all lower numerical limits contained herein, and any minimum numerical limit described in this specification is intended to include all higher numerical limits contained herein.

[0212] While exemplary embodiments of systems and methods for adapting high subcarrier spacing in mobile communications have been specifically described and illustrated herein, many modifications and variations will be apparent to those skilled in the art. Therefore, it should be understood that systems and methods for adapting high subcarrier spacing in mobile communications constructed according to the principles of this disclosure can be implemented in ways different from those specifically described herein. The invention is also defined by the following claims and their equivalents.

Claims

1. A method for mobile communication, comprising: The user equipment (UE) receives downlink control information (DCI). The UE reports the ability to perform processing of non-overlapping control channel element CCEs within a first limit and physical downlink control channel PDCCH candidates within a second limit on a number of consecutive time slots. The first limit is P non-overlapping CCEs, the second limit is Q PDCCH candidates, and the number of consecutive time slots is N, where P, Q, and N are positive integers. The UE processes P CCEs received within M time slots, where M is less than or equal to N; as well as The UE processes the Q PDCCH candidates received within M time slots. DCI specifies the scheduling of the first physical downlink shared channel (PDSCH) and the second PDSCH.

2. The method according to claim 1, wherein: The first row of the DCI identifier in the Time Domain Resource Allocation (TDRA) table; The first row of the TDRA table specifies the scheduling of the first number of PDSCHs; and The second row of the TDRA table specifies the scheduling of a second number of PDSCHs that are different from the first number.

3. The method according to claim 2, wherein, DCI does not include the code block group (CBG) field.

4. The method according to claim 1, further comprising: The UE receives an indication that the third PDSCH will not be sent; Receive the first PDSCH; Receive the second PDSCH; as well as Third-party PDSCHs are not accepted.

5. The method according to claim 1, wherein, DCI includes a first downlink allocation index (DAI) corresponding to the first PDSCH and a second DAI corresponding to the second PDSCH.

6. The method according to claim 1, wherein, The DCI includes the downlink allocation index DAI, which has a value that is more than 1 greater than the DAI in the most recently received DCI. The difference between the DAI and the DAI in the most recently received DCI is equal to the number of start and length indicators (SLIVs) in the row of the Time Domain Resource Allocation (TDRA) table identified by the DCI.

7. The method according to claim 1, further comprising: The maximum number of bits that the UE sends in the PUCCH is the product of the following configured for each active serving cell of the UE: The maximum number of code block groups (CBGs) per PDSCH in the activity service cell, and The maximum number of start and length indicators (SLIVs) in any row of the Time Domain Resource Allocation (TDRA) table for the serving cell of this activity. The DCI includes the downlink allocation index DAI, which has a value that is 1 greater than the DAI in the previous DCI.

8. The method according to claim 1, wherein: P is greater than the per-slot limit specified in the corresponding standard. P is less than or equal to the product of N and the per-slot limit specified in the corresponding standard. Q is greater than the per-slot limit specified in the corresponding standard, and Q is less than or equal to the product of N and the per-slot limit specified in the corresponding standard.

9. The method according to claim 8, further comprising: The value of P, as reported by the UE, represents the capability, and The value of Q is reported by the UE as a capability.

10. The method of claim 8, further comprising: The value of N is reported by the UE as a capability.

11. The method of claim 8, further comprising: The P CCEs are received in a resource element having a subcarrier spacing of 480 kHz or higher.

12. The method according to claim 8, wherein, The UE processes the P CCEs, including: not processing CCEs received in time slots N-N0, where N0 is a positive integer.

13. The method of claim 8, further comprising: The UE sends an ACK, which is sent after the last symbol of the corresponding physical downlink shared channel (PDSCH) after a processing time. This processing time is longer than the processing time specified in the corresponding standard for non-aggregated BD / CCE restrictions.

14. The method of claim 8, further comprising: The UE sends the PUSCH, which is followed by a preparation time after the last symbol of the corresponding PDCCH. This preparation time is longer than the preparation time specified in the corresponding standard for non-aggregated BD / CCE restrictions.

15. The method according to claim 8, wherein, The method further includes: receiving the PDSCH from the Q PDCCH candidates, wherein the PDSCH begins d symbols after the specific PDCCH, where d is a positive integer and is a standard-specified value or a value reported by the UE as a capability.

16. A system for mobile communication, comprising: User equipment (UE), the UE including: Radio; and Processing circuit, The processing circuit is configured as follows: Receive downlink control information (DCI). The report describes the ability to process non-overlapping control channel element CCEs within a first constraint and physical downlink control channel PDCCH candidates within a second constraint on a number of consecutive time slots. The first constraint is P non-overlapping CCEs, the second constraint is Q PDCCH candidates, and the number of consecutive time slots is N, where P, Q, and N are positive integers. Processing P CCEs received within M time slots, where M is less than or equal to N; and Process the Q PDCCH candidates received within M time slots. DCI specifies the scheduling of the first physical downlink shared channel (PDSCH) and the second PDSCH.

17. The system according to claim 16, wherein: The first row of the DCI identifier in the Time Domain Resource Allocation (TDRA) table; The first row of the TDRA table specifies the scheduling of the first number of PDSCHs; and The second row of the TDRA table specifies the scheduling of a second number of PDSCHs that are different from the first number.

18. The system according to claim 16, wherein, DCI does not include the code block group (CBG) field.

Images