Method and device for indicating aggregation number in wireless communication system

Abstract

The present invention provides a method and device for indicating an aggregation number in a wireless communication system. In an example, a user equipment receives a message associated with a physical downlink shared channel parameter configuration. The message includes a first parameter indicating a first entry list associated with a time resource allocation for multiple physical downlink shared channels, a second parameter indicating multiple repeated receptions for a single physical downlink shared channel, and a third parameter indicating a second entry list associated with the time resource allocation. The user equipment receives multiple physical downlink shared channels based on the multiple time resource allocations indicated by the first entry. The first repetition number of the multiple physical downlink shared channels is determined to be one. The user equipment receives one or more physical downlink shared channels with repetitions based on a single time resource allocation indicated by the second entry. The second repetition number of the one or more physical downlink shared channels is determined based on the second parameter.

Description

Technical Field

[0001] The present disclosure relates generally to wireless communication networks, and more particularly, to a method and apparatus for indicating an aggregation number in a wireless communication system. Background Art

[0002] With the rapid growth of the demand for transmitting large amounts of data to and from mobile communication devices, traditional mobile voice communication networks have evolved into networks with Internet Protocol (IP) data packet communications, which can provide IP-bearing voice, multimedia, multicast and on-demand communication services to users of mobile communication devices.

[0003] An exemplary network structure is an Evolved Universal Terrestrial Radio Access Network (E-UTRAN). The E-UTRAN system can provide high data throughput to enable the above-mentioned IP-borne voice and multimedia services. Currently, the 3GPP standards organization is discussing new next-generation (e.g., 5G) radio technologies. Therefore, changes to the current body of 3GPP standards are currently being submitted and considered to evolve and complete the 3GPP standards. Summary of the invention

[0004] According to the present disclosure, one or more devices and / or methods are provided. In an example from the perspective of a network, the network transmits a message associated with a physical downlink shared channel (PDSCH) parameter configuration to a user equipment (UE). The network is not allowed to include a first parameter and a second parameter in parallel in a message. The message includes a first parameter or a second parameter. The first parameter indicates a list of entries associated with a time resource allocation for the PDSCH. The second parameter indicates an aggregation factor. The network transmits downlink control information (DCI) indicating a first entry in the list, wherein the first entry indicates one or more time resource allocations. The network performs one or more transmissions at one or more time occasions, wherein the number of time occasions of the one or more time occasions is a number of time resource allocations based on the one or more time resource allocations.

[0005] In an example from the perspective of a UE, the UE receives a configuration from a network to configure a list associated with time resource allocations for multiple PDSCHs. The list includes a first entry and a second entry. The first entry indicates multiple time resource allocations without repetitions. The second entry indicates a single time resource allocation with repetitions. The UE receives a DCI indicating an entry in the list. The UE performs a first reception based on the entry indicated by the DCI. If the entry indicated by the DCI is the first entry, then the first reception includes receiving multiple TBs based on multiple time resource allocations without repetitions. If the entry indicated by the DCI is the second entry, then the first reception includes receiving a single TB based on a single time resource allocation with repetitions.

[0006] In an example from the perspective of a UE, the UE receives a message associated with a PDSCH parameter configuration. The message includes a first parameter, a second parameter, and a third parameter. The first parameter indicates a first list of entries associated with a time resource allocation for multiple PDSCHs. The second parameter indicates multiple repetition receptions for a single PDSCH. The third parameter indicates a second list of entries associated with a time resource allocation. Each entry in the second list indicates a single time resource allocation. The first list, the second list, and / or the second parameter are used to determine the number of repetitions. If the UE receives a first DCI indicating a first entry in the first list, the UE receives multiple PDSCHs based on the multiple time resource allocations indicated by the first entry, wherein the first repetition number of the multiple PDSCHs is determined to be one. If the UE receives a second DCI indicating a second entry in the second list, the UE receives one or more PDSCHs with repetitions based on the single time resource allocation indicated by the second entry, wherein the second repetition number of the one or more PDSCHs is determined based on the second parameter. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] Figure 1 A diagram is shown of a wireless communication system according to an exemplary embodiment.

[0008] Figure 2 is a block diagram of a transmitter system (also referred to as an access network) and a receiver system (also referred to as a user equipment or UE) according to an exemplary embodiment.

[0009] Figure 3 is a functional block diagram of a communication system according to an exemplary embodiment.

[0010] Figure 4 According to an exemplary embodiment Figure 3 Functional block diagram of the program code.

[0011] Figure 5 is a diagram showing the association of a start and length indicator value (SLIV) of a starting orthogonal frequency division multiplexing (OFDM) symbol and a length according to an exemplary embodiment.

[0012] Figure 6 A list showing resource allocation for a physical uplink shared channel (PUSCH) according to an exemplary embodiment is shown.

[0013] Figure 7 is a diagram illustrating an exemplary scenario associated with an implementation of multiple PUSCH functionality according to an exemplary embodiment.

[0014] Figure 8is a diagram illustrating an exemplary scenario associated with PUSCH aggregation / repetition functionality according to an exemplary embodiment.

[0015] Fig. 9 is a diagram illustrating one or more operations associated with determining a mode, according to an exemplary embodiment.

[0016] Fig.10 is a diagram illustrating one or more operations associated with determining a mode, according to an exemplary embodiment.

[0017] Fig.11 is a diagram showing an example of a mode according to an exemplary embodiment.

[0018] Fig.12 is a diagram illustrating one or more operations associated with determining a mode, according to an exemplary embodiment.

[0019] Fig.13 is a diagram showing an example of a mode according to an exemplary embodiment.

[0020] Fig.14 is a diagram showing an example of a mode according to an exemplary embodiment.

[0021] Fig.15 is a diagram showing an example of a mode according to an exemplary embodiment.

[0022] Fig.16 is a diagram showing an example of a mode according to an exemplary embodiment.

[0023] Fig.17 is a table associated with example scenarios associated with determining a number of repetitions / aggregations according to an exemplary embodiment.

[0024] Fig.18 is a flow chart according to an exemplary embodiment.

[0025] Fig.19 is a flow chart according to an exemplary embodiment.

[0026] Fig. 20 is a flow chart according to an exemplary embodiment.

[0027] Fig.21 is a flow chart according to an exemplary embodiment.

[0028] Fig. 22 is a flow chart according to an exemplary embodiment. DETAILED DESCRIPTION

[0029] The exemplary wireless communication systems and devices described below adopt wireless communication systems that support broadcast services. Wireless communication systems are widely deployed to provide various types of communications, such as voice, data, etc. These systems can be based on code division multiple access (code division multiple access, CDMA), time division multiple access (time division multiple access, TDMA), orthogonal frequency division multiple access (orthogonal frequency division multiple access, OFDMA), third generation partnership project (3GPP) long term evolution (Long Term Evolution, LTE) radio access, 3GPP long term evolution advanced (Long Term Evolution Advanced, LTE-A or LTE-Advanced), 3GPP2 Ultra Mobile Broadband (Ultra Mobile Broadband, UMB), WiMax, 3GPP New Radio (New Radio, NR) radio access for 5G, or some other modulation technology.

[0030] Specifically, the exemplary wireless communication system apparatus described below can be designed to support one or more standards, such as standards provided by an association named "3rd Generation Partnership Project" (referred to as 3GPP in this article), including: RP-193196; 3GPP TS 38.212 V16.3.0 (2020-09), "3GPP TSG RAN; NR physical channels and modulation (Release 16)"; 3GPP TS 38.213 V16.3.0 (2020-09), "3GPP TSG RAN; NR physical channels and modulation (Release 16)"; 3GPP TS 38.214 V16.3.0 (2020-09), "3GPP TSG RAN; NR physical channels and modulation (Release 16)"; 3GPPTS 38.331 V16.2.0 (2020-09), "3GPP TSG RAN; NR Radio Resource Control (RRC) Protocol Specification (Release 16)”; 3GPP TS 37.213 V16.3.0 (2020-09), “3GPP TSG RAN; NR Physical Layer Procedures for Shared Spectrum Channel Access (Release 16)”. The standards and documents listed above are expressly incorporated herein by reference in their entirety.

[0031] Figure 1A multiple access wireless communication system according to one or more embodiments of the present disclosure is presented. An access network 100 (AN) includes multiple antenna groups, one antenna group includes 104 and 106, another antenna group includes 108 and 110, and another antenna group includes 112 and 114. Figure 1 , only two antennas are shown for each antenna group, but each antenna group may utilize more or fewer antennas. Access terminal 116 (AT) communicates with antennas 112 and 114, where antennas 112 and 114 transmit information to access terminal 116 via forward link 120 and receive information from access terminal 116 via reverse link 118. AT 122 communicates with antennas 106 and 108, where antennas 106 and 108 transmit information to AT 122 via forward link 126 and receive information from AT 122 via reverse link 124. In a frequency-division duplexing (FDD) system, communication links 118, 120, 124, and 126 may use different frequencies for communication. For example, forward link 120 may use a different frequency than the frequency used by reverse link 118.

[0032] Each antenna group and / or the area in which they are designed to communicate is often referred to as a sector of the access network. In an embodiment, the antenna groups can each be designed to communicate with access terminals in a sector of the area covered by the access network 100.

[0033] In communicating via forward links 120 and 126, the transmit antennas of access network 100 may utilize beamforming in order to improve the signal-to-noise ratio of the forward links for the different access terminals 116 and 122. Also, an access network that uses beamforming to transmit to access terminals that are randomly dispersed throughout the coverage area of ​​the access network will generally cause less interference to access terminals in neighboring cells than an access network that transmits to its access terminals via a single antenna.

[0034] An access network (AN) may be a fixed station or base station for communicating with a terminal, and may also be referred to as an access point, a Node B, a base station, an enhanced base station, an eNodeB (eNB), a next generation NodeB (gNB), or some other term. An access terminal (AT) may also be referred to as user equipment (UE), a wireless communication device, a terminal, an access terminal, or some other term.

[0035] Figure 2An embodiment of a transmitter system 210 (also referred to as an access network) and a receiver system 250 (also referred to as an access terminal (AT) or user equipment (UE)) are presented in a multiple-input and multiple-output (MIMO) system 200. At the transmitter system 210, traffic data for a number of data streams may be provided from a data source 212 to a transmit (TX) data processor 214.

[0036] In one embodiment, each data stream is transmitted via a respective transmit antenna.TX data processor 214 formats, codes, and interleaves the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide coded data.

[0037] The coded data for each data stream may be multiplexed with pilot data using orthogonal frequency-division multiplexing (OFDM) techniques. The pilot data may typically be a known data pattern that is processed in a known manner and may be used at the receiver system to estimate the channel response. The multiplexed pilot and coded data for each data stream may then be modulated (i.e., symbol mapped) based on a particular modulation scheme selected for each data stream (e.g., binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), M-ary phase shift keying (M-PSK), or M-ary quadrature amplitude modulation (M-QAM)) to provide modulation symbols. The data rate, coding, and modulation for each data stream may be determined by instructions executed by processor 230.

[0038] The modulation symbols for the data stream are then provided to a TX MIMO processor 220, which may further process the modulation symbols (eg, for OFDM). The TX MIMO processor 220 then converts the N T The modulation symbol stream is provided to N T transmitters (TMTR) 222a through 222t. In certain embodiments, TX MIMO processor 220 may apply beamforming weights to the symbols of the data streams and to the antenna from which the symbol is being transmitted.

[0039] Each transmitter 222 receives and processes a respective symbol stream to provide one or more analog signals, and further conditions (e.g., amplifies, filters, and / or upconverts) the analog signals to provide a modulated signal suitable for transmission via a MIMO channel. T The antennas 224a to 224t transmit the N signals from the transmitters 222a to 222t. T a modulated signal.

[0040] At the receiver system 250, N R The transmitted modulated signals are received by each antenna 252a through 252r and the received signal from each antenna 252 may be provided to a respective receiver (RCVR) 254a through 254r. Each receiver 254 may condition (e.g., filter, amplify, and downconvert) a respective received signal, digitize the conditioned signal to provide samples, and / or further process the samples to provide a corresponding “received” symbol stream.

[0041] RX data processor 260 then extracts the N R The receiver 254 receives and / or processes N R receive symbol streams to provide N T The RX data processor 260 may then demodulate, deinterleave, and / or decode each detected symbol stream to recover the traffic data for the data stream. The processing by the RX processor 260 may be complementary to the processing performed by the TX MIMO processor 220 and the TX data processor 214 at the transmitter system 210.

[0042] Processor 270 may periodically determine which pre-coding matrix to use (discussed below). Processor 270 formulates a reverse link message comprising a matrix index portion and a rank value portion.

[0043] The reverse link message may include various types of information related to the communication link and / or the received data stream. The reverse link message may then be processed by the TX data processor 238 (which may also receive traffic data for a number of data streams from the data source 236), modulated by the modulator 280, conditioned by the transmitters 254a to 254r, and / or transmitted back to the transmitter system 210.

[0044] At the transmitter system 210, the modulated signal from the receiver system 250 is received by the antenna 224, conditioned by the receiver 222, demodulated by the demodulator 240, and processed by the RX data processor 242 to extract the reverse link message transmitted by the receiver system 250. The processor 230 may then determine which precoding matrix to use to determine the beamforming weights and may then process the extracted message.

[0045] Figure 3 An alternative simplified functional block diagram of a communication device according to one embodiment of the disclosed subject matter is presented. Figure 3 As shown in FIG. , the communication device 300 in the wireless communication system can be used to implement Figure 1 UE (or AT) 116 and 122 in or Figure 1 The base station (AN) 100 in the wireless communication system may be an LTE system or an NR system. The communication device 300 may include an input device 302, an output device 304, a control circuit 306, a central processing unit (CPU) 308, a memory 310, a program code 312, and a transceiver 314. The control circuit 306 executes the program code 312 in the memory 310 through the CPU 308, thereby controlling the operation of the communication device 300. The communication device 300 may receive a signal input by a user through the input device 302 (for example, a keyboard or a keypad), and may output images and sounds through the output device 304 (for example, a display or a speaker). The transceiver 314 is used to receive and transmit wireless signals to pass the received signal to the control circuit 306 and wirelessly output the signal generated by the control circuit 306. The communication device 300 in the wireless communication system may also be used to implement Figure 1 AN 100 in.

[0046] Figure 4 According to one embodiment of the disclosed subject matter Figure 3 4. In this embodiment, program code 312 includes application layer 400, layer 3 portion 402, and layer 2 portion 404, and is coupled to layer 1 portion 406. Layer 3 portion 402 may perform radio resource control. Layer 2 portion 404 may perform link control. Layer 1 portion 406 may perform and / or implement physical connectivity.

[0047] The New Radio Unlicensed (NR-U) Status Report describes the 3GPP progress on NR-U from multiple working groups. One or more sections of the NR-U Status Report are referenced from RP-193196:

[0048] protocol:

[0049] TDRA table configuration allows indicating single or multiple consecutive PUSCHs in any of multiple scheduled time slots

[0050] To convey several scheduled PUSCHs and TDRA in one DCI format 0_1 ​​scheduling multiple PUSCHs, the TDRA table is extended so that each row indicates multiple PUSCHs (contiguous in the time domain)

[0051] - Each PUSCH has a separate SLIV and mapping type. The number of scheduled PUSCHs are transmitted by the number of indicated valid SLIVs in the row of the TDRA table transmitted in the DCI.

[0052] Note: For fallback DCI, use the Rel-15 TDRA table

[0053] The downlink control information (DCI) format is discussed in 3GPP TS 38.212 V16.3.0, one or more portions of which are quoted below:

[0054] 7.3.1.1.2 Format 0_1

[0055] DCI format 0_1 ​​is used for scheduling one or more PUSCHs in a cell, or to indicate CG downlink feedback information (CG-DFI) to the UE.

[0056] The following information is transmitted via DCI format 0_1, where the CRC is scrambled by C-RNTI or CS-RNTI or SP-CSI-RNTI or MCS-C-RNTI:

[0057] -DCI format identifier - 1 bit

[0058] - The value of this bit field is always set to 0, indicating the UL DCI format

[0059] - Carrier indicator - 0 or 3 bits, as defined in section 10.1 of [5, TS38.213].

[0060] -DFI flag - 0 or 1 bit

[0061] If DCI format 0_1 ​​is used to indicate CG-DFI, then…

[0062] Otherwise, set all remaining fields as follows:

[0063] -UL / SUL indicator - 0 bit.

[0064] - Bandwidth section indicator - 0, 1 or 2 bits

[0065] - Frequency domain resource allocation - The number of bits is determined by, where is the size of the active UL bandwidth portion:

[0066] - If the higher layer parameter useInterlacePUCCH-PUSCH in BWP-UplinkDedicated is not configured, then

[0067] -N only when resource allocation type 0 is configured RBG bits, where N RBG Defined in section 6.1.2.2.1 of [6, TS 38.214],

[0068] - Only when resource allocation type 1 is configured Units, or both configuration resource allocation types 0 and 1 Units digit.

[0069] - If both resource allocation type 0 and 1 are configured, the MSB bit is used to indicate resource allocation type 0 or resource allocation type 1, where a bit value of 0 indicates resource allocation type 0 and a bit value of 1 indicates resource allocation type 1.

[0070] - If the higher layer parameter useInterlacePUCCH-PUSCH in BWP-UplinkDedicated is configured, then

[0071] - If the subcarrier spacing of the active UL bandwidth part is 30 kHz, then 5+Y bits provide the frequency domain resource allocation according to section 6.1.2.2.3 of [6, TS 38.214]. The 5 MSBs provide the interleaved allocation and the Y LSBs provide the RB set allocation.

[0072] - If the subcarrier spacing of the active UL bandwidth part is 15 kHz, then 6+Y bits provide the frequency domain resource allocation according to section 6.1.2.2.3 of [6, TS 38.214]. The 6 MSBs provide the interleaved allocation and the Y LSBs provide the RB set allocation.

[0073] The value of Y is given by Decision, among which is the number of RB sets contained in the active UL BWP, as defined in section 7 of [6, TS38.214].

[0074] -Time domain resource allocation - 0, 1, 2, 3, 4, 5 or 6 bits

[0075] - If the higher layer parameter PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_1 is not configured, and if the higher layer parameter pusch-TimeDomainAllocationListForMultiPUSCH is not configured, and if the higher layer parameter pusch-TimeDomainAllocationList is configured, then 0, 1, 2, 3 or 4 bits, as defined in section 6.1.2.1 of [6, TS38.214]. The bit width of this field is determined as bits, where I is the number of entries in the higher-level parameter pusch-TimeDomainAllocationList;

[0076] - If the higher layer parameter PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_1 is configured, or if the higher layer parameter pusch-TimeDomainAllocationListForMultiPUSCH is configured, then 0, 1, 2, 3, 4, 5 or 6 bits, as defined in section 6.1.2.1 of [6, TS38.214]. The bit width of this field is determined as bits, where I is the number of entries in the higher layer parameter PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_1 or pusch-TimeDomainAllocationListForMultiPUSCH;

[0077] Otherwise, the bit width of this field is determined as bits, where I is the number of entries in the preset table.

[0078] -Frequency Hopping Flag - 0 or 1 bit:

[0079] - Modulation and coding scheme - 5 bits, as defined in section 6.1.4.1 of [6, TS 38.214]

[0080] - New Data Indicator - 1 bit if the number of scheduled PUSCHs indicated by the Time Domain Resource Allocation field is 1; otherwise 2, 3, 4, 5, 6, 7 or 8 bits, which is determined based on the maximum number of schedulable PUSCHs among all entries in the higher layer parameter pusch-TimeDomainAllocationListForMultiPUSCH, where each bit corresponds to one scheduled PUSCH, as defined in section 6.1.4 of [6, TS 38.214].

[0081] - Redundancy version - the number of bits determined by:

[0082] - If the number of scheduled PUSCHs indicated by the Time Domain Resource Allocation field is 1, then 2 bits, as defined in Table 7.3.1.1.1-2;

[0083] - Otherwise 2, 3, 4, 5, 6, 7 or 8 bits, determined by the maximum number of schedulable PUSCHs among all entries in the higher layer parameter pusch-TimeDomainAllocationListForMultiPUSCH, where each bit corresponds to one scheduled PUSCH, as defined in section 6.1.4 of [6, TS 38.214] and the redundancy version is determined according to Table 7.3.1.1.2-34.

[0084] -HARQ process number - 4 bits

[0085] …

[0086] …

[0087] …

[0088] …

[0089] -ChannelAccess-CPext-CAPC - 0, 1, 2, 3, 4, 5, or 6 bits. The bit width of this field is determined by bits, where I is the number of entries in the higher layer parameter ul-dci-triggered-UL-ChannelAccess-CPext-CAPC-r16 for operation in a cell with shared spectrum channel access; otherwise, 0 bits. One or more entries of Table 7.3.1.1.2-35 are configured by the higher layer parameter ul-dci-triggered-UL-ChannelAccess-CPext-CAPC-r16.

[0090] …

[0091] 7.3.1.2.2 Format 1_1

[0092] DCI format 1_1 is used to schedule PDSCH in one cell.

[0093] - Time Domain Resource Allocation - 0, 1, 2, 3 or 4 bits, as defined in [6, TS 38.214] Section 5.1.2.1. The bit width of this field is determined by bits, where if the higher layer parameter pdsch-TimeDomainAllocationList is configured, then I is the number of entries in the higher layer parameter pdsch-TimeDomainAllocationList; otherwise I is the number of entries in the preset table.

[0094] -HARQ process number - 4 bits

[0095] Resource allocation is discussed in 3GPP TS 38.214 V16.3.0, one or more portions of which are quoted below:

[0096] 6.1.2 Resource Allocation

[0097] 6.1.2.1 Resource Allocation in the Time Domain

[0098] When a UE is scheduled to transmit a transport block and there is no CSI report, or when a UE is scheduled to transmit a transport block and a CSI report on the PUSCH via DCI, the value m of the Time domain resource assignment field of the DCI provides the row index m + 1 of the allocation table. The determination of the resource allocation table used is defined in Section 6.1.2.1.1. The row with index defines the slot offset K to be applied in the PUSCH transmission 2 , the start and length indicator SLIV or the direct start symbol S and the allocation length L, the PUSCH mapping type, and the number of repetitions (if numberOfRepetitions-r16 exists in the resource allocation table).

[0099] - For PUSCH repetition type A, the start symbol S related to the slot start and the number of consecutive symbols L counted from the symbol S allocated for the PUSCH are determined according to the start and length indicator SLIV of the row with index:

[0100]

[0101] where 0 < L ≤ 14 - S, and

[0102] - For PUSCH repetition type B, the start symbol S related to the slot start and the number of consecutive symbols L counted from the symbol S allocated for the PUSCH are provided by startSymbol-r16 and length-r16 of the row with index in the resource allocation table, respectively.

[0103] - For PUSCH repetition type A, the PUSCH mapping type is set to type A or type B, as defined in Section 6.4.1.1.3 of [4, TS 38.211], as given by the row with index.

[0104] - For PUSCH repetition type B, the PUSCH mapping type is set to type B.

[0105] The UE shall consider the combination of S and L defined in Table 6.1.2.1-1 as a valid PDSCH allocation:

[0106] Table 6.1.2.1-1: Valid Combinations of S and L

[0107]

[0108]

[0109] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0110] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0111] - Otherwise, if the UE is configured to use pusch-AggregationFactor, then the number of repetitions K is equal to pusch-AggregationFactor;

[0112] - In other cases, K=1.

[0113] For PUSCH repetition type A, when K>1, the same symbol allocation is applied across the K consecutive time slots, and PUSCH is limited to a single transmission layer. The UE will repeat the TB across the K consecutive time slots, applying the same symbol allocation in each time slot. The redundancy version to be applied at the nth transmission opportunity of the TB is determined according to Table 6.1.2.1-2, where n=0, 1, ... K-1.

[0114] Table 6.1.2.1-2: Redundancy versions used for PUSCH transmission

[0115]

[0116]

[0117] For PUSCH repetition type A, PUSCH transmissions in slots of multi-slot PUSCH transmissions are omitted according to the conditions of sections 9, 11.1 and 11.2A of [6, TS38.213].

[0118] If the pusch-TimeDomainAllocationList in the pusch-Config contains a row indicating resource allocations for two to eight consecutive PUSCHs, then K 2 Indicates the time slot in which the UE will transmit the first PUSCH of multiple PUSCHs. Each PUSCH has a separate SLIV and mapping type. A number of scheduled PUSCHs are transmitted by a number of valid SLIVs indicated in the rows of pusch-TimeDomainAllocationList transmitted in DCI format 0_1.

[0119] …

[0120] 6.1.2.1.1 Determine the resource allocation table to be used for PDSCH

[0121] Table 6.1.2.1.1-1, Table 6.1.2.1.1-1A and Table 6.1.2.1.1-1B define the PUSCH time domain resource allocation configuration to be applied.

[0122] Table 6.1.2.1.1-4 defines a specific value of subcarrier spacing j. j is used in conjunction with Table 6.1.2.1.1-2 for normal CP or Table 6.1.2.1.1.-3 for extended CP to determine K 2 , where μ PUSCH It is the subcarrier spacing configuration of PUSCH.

[0123] Table 6.1.2.1.1-5 defines the additional subcarrier spacing specific slot delay values ​​for the first transmission of a RAR or fallback RAR scheduled PUSCH. When a UE transmits a RAR or fallback RAR scheduled PUSCH, except for K 2 In addition to the value, the PUSCH-specific subcarrier spacing μ PUSCH The Δ value of .

[0124] Table 6.1.2.1.1-1A: Applicable PUSCH time domain resource allocation for DCI format 0_1 ​​scrambled by C-RNTI, MCS-C-RNTI, CS-RNTI or SP-CSI-RNTI in UE-specific search space

[0125]

[0126]

[0127] Table 6.1.2.1.1-1B: Applicable PUSCH time domain resource allocation for DCI format 0_2 scrambled by C-RNTI, MCS-C-RNTI, CS-RNTI or SP-CSI-RNTI in UE-specific search space

[0128]

[0129] The information elements and / or fields are discussed in 3GPP TS 38.331 V16.2.0, one or more portions of which are quoted below:

[0130]

[0131]

[0132]

[0133]

[0134]

[0135]

[0136]

[0137]

[0138]

[0139]

[0140]

[0141]

[0142]

[0143]

[0144] The channel access procedure is discussed in 3GPP TS 37.213 V16.3.0, one or more parts of which are quoted below:

[0145] 4 Channel Access Procedure

[0146] 4.0 Overview

[0147] Unless otherwise indicated, the following definitions apply to the following terms used in this specification:

[0148] - A channel refers to a carrier or a portion of a carrier, consisting of a set of contiguous resource blocks (RBs) on which a channel access procedure is performed in a shared spectrum.

[0149] - The channel access procedure is a procedure based on sensing to assess the availability of the channel for performing transmissions. The basic unit of sensing is a sensing slot, with a duration of T sl =9us. If the eNB / gNB or UE senses the channel during the sensing time slot duration, then the sensing time slot duration T sl is considered idle and determines that the power detected is less than the energy detection threshold X for at least 4us during the sensing slot duration Thresh In other cases, the sensing time slot duration T sl Considered busy.

[0150] -Channel occupancy refers to the transmission of the eNB / gNB / UE on the channel after performing the corresponding channel access procedure in this section.

[0151] - Channel occupancy time refers to the total time that the eNB / gNB / UE and any eNB / gNB / UE sharing the channel occupancy perform transmissions on the channel after the eNB / gNB / UE performs the corresponding channel access procedures described in this section. To determine the channel occupancy time, if a transmission gap is less than or equal to 25us, then the gap duration is counted in the channel occupancy time. The channel occupancy time can be shared for transmissions between the eNB / gNB and the corresponding UE.

[0152] - An UL transmit burst is defined as a group of transmissions from a UE without any gaps greater than 16 us. Transmissions from a UE separated by gaps greater than 16 us are considered separate UL transmit bursts. A UE may transmit a transmission after a gap within a UL transmit burst without sensing the availability of the corresponding channel.

[0153] One, some and / or all of the following terms and assumptions may be used below.

[0154] Base Station (BS): A network central unit and / or network node in New Radio (NR) for controlling one or more Transmit Reception Points (TRPs) associated with one or more cells. Communication between a base station and one or more TRPs may be via fronthaul. A base station may be referred to as a Central Unit (CU), eNB, gNB, and / or NodeB.

[0155] Cell: A cell includes one or more associated TRPs (e.g., the coverage of a cell may include the coverage of some and / or all associated TRPs). A cell may be controlled by one base station. A cell may be referred to as a TRP group (TRPG).

[0156] Uplink control signal (UL control signal): The UL control signal may include at least one of a scheduling request (SR), a channel state information (CSI), a hybrid automatic repeat request (HARQ)-acknowledgement (ACK) / negative acknowledgement (NACK) for downlink (DL) transmission.

[0157] Slot: A slot is a scheduling unit in NR. The slot duration (e.g., the duration of a slot) may be 14 Orthogonal Frequency Division Multiplexing (OFDM) symbols.

[0158] For operations with shared spectrum channel access in a serving cell, the UE may need to perform a channel access and / or listen-before-talk (LBT) procedure before performing an uplink (UL) transmission (e.g., the UE may need to perform a channel access and / or LBT procedure in order to perform an uplink transmission). In order to reduce LBT attempts and / or channel access attempts (and / or to reduce control signaling overhead), a single downlink control information (DCI) may schedule multiple PUSCHs. For example, a multi-PUSCH functionality of a single DCI that schedules multiple PUSCHs may be introduced to reduce LBT attempts and / or channel access attempts (and / or to reduce control signaling overhead). In some instances, multiple PUSCHs scheduled by a single DCI may include multiple PUSCHs scheduled by a single DCI. A single DCI may schedule multiple PUSCHs continuously. For example, multiple PUSCHs may be scheduled within continuous (e.g., contiguous) time units and / or time slots. In some instances, when multiple PUSCH functionality is implemented (e.g., so that multiple PUSCHs can be scheduled via a single DCI), the network (e.g., gNB) does not need to perform channel access and / or LBT (e.g., for DCI transmission) each time the network schedules a physical uplink shared channel (PUSCH) (because the network can transmit a single DCI to schedule multiple PUSCHs, where, for example, the network may not need to transmit a separate DCI for each PUSCH in the multiple PUSCHs). The PUSCHs in the scheduled multiple PUSCHs may be used to transmit transport blocks (TBs), medium access control (MAC) protocol data units (PDUs), and / or data services. For example, different PUSCHs in the scheduled multiple PUSCHs may be used to transmit different TBs, different MAC PDUs and / or different data services (for example, the first PUSCH in the scheduled multiple PUSCHs may be used to transmit the first TB, the first MAC PDU and / or the first data service, and / or the second PUSCH in the scheduled multiple PUSCHs may be used to transmit the second TB, the second MAC PDU and / or the second data service, wherein the second TB, the second MAC PDU and / or the second data service are different from the first TB, the first MAC PDU and / or the first data service). Different PUSCHs in the scheduled multiple PUSCHs may be associated with different HARQ process numbers / IDs (for example, the first PUSCH in the scheduled multiple PUSCHs may be associated with the first HARQ process number / ID, and / or the second PUSCH in the scheduled multiple PUSCHs may be associated with the second HARQ process number / ID, wherein the second HARQ process number / ID may be different from the first HARQ process number / ID). As used herein, "HARQ process number / ID" may refer to a HARQ process number (eg, a number identifying a HARQ process) of a HARQ process and / or a HARQ process identification (ID) of a HARQ process. The HARQ process ID may be an example of a HARQ process number.As used herein, "multi-PUSCH functionality" may refer to the functionality of scheduling multiple PUSCHs using a single DCI (e.g., intended to reduce LBT attempts, channel access attempts, and / or control signaling overhead), where the multiple PUSCHs are used to transmit at least one of different TBs, different MAC PDUs, different groups of data services, and the like.

[0159] In Rel-16 (e.g., 3GPP Release 16), the UE may be configured to use a time domain allocation list (e.g., PUSCH-TimeDomainResourceAllocationList-r16). Each entry in the time domain allocation list may indicate a time slot offset (e.g., one time slot offset) and one or more time resource allocation configurations (e.g., a time resource allocation configuration in the one or more time resource allocation configurations may be PUSCH-Allocation-r16). The number of time resource allocation configurations in the one or more time resource allocation configurations may indicate the number of PUSCHs scheduled by the DCI (e.g., the number of scheduled PUSCHs of different TBs). The code points of the time-related fields in the DCI correspond to the entries in the time domain allocation list (e.g., one code point of one time-related field in the DCI corresponds to one entry in the time domain allocation list). The UE may be configured to use pusch-TimeDomainAllocationListForMultiPUSCH-r16 so that the entries in the time domain allocation list indicate one or more start and length indicator values ​​(SLIV). Each SLIV of the one or more SLIVs may indicate a starting OFDM symbol and a number of consecutive OFDM symbols from the starting OFDM symbol (eg, the number of consecutive OFDM symbols may correspond to a length including the starting OFDM symbol).

[0160] The association of SLIV, starting OFDM symbol and length (e.g., consecutive OFDM symbol length) is described in Figure 5 For example, SLIV=28 may mean and / or imply time resource allocation {#0~#2}. Figure 5 As shown, SLIV=28 corresponds to a starting OFDM symbol of 0 and a length of 3. The length may be a consecutive OFDM symbol length (e.g., the length may correspond to the number of OFDM symbols associated with the resource allocation in the OFDM symbol, where the starting OFDM symbol is included in the length). Therefore, based on the starting OFDM symbol of 0 and the length of 3, the time resource allocation (indicated by SLIV=28) may correspond to OFDM symbols {#0-#2}. Therefore, in an example where a transmission is performed in a time slot based on SLIV=28, the transmission may be performed within OFDM symbols {#0-#2}.

[0161] Figure 6600 is shown as a list of resource allocations for PUSCH. A UE may be configured to use list 600. In some examples, each entry in the list (e.g., Figure 6 As shown, each row) indicates a time slot offset (k2) and a PUSCH allocation. In some instances, the time slot offset (k2) is between a time slot for scheduling a physical downlink control channel (PDCCH) and a time slot for a scheduled PUSCH (e.g., an initial scheduled PUSCH). For example, the time slot offset (k2) may be a time slot offset between a time slot for scheduling a PDCCH and a time slot for a scheduled PUSCH, wherein the scheduled PUSCH may be an initial PUSCH transmission among one or more PUSCH transmissions scheduled by the scheduled PDCCH. In some instances, the PUSCH allocation may include one or more sets of resource allocation information, wherein each set of resource allocation information in the one or more sets of resource allocation information includes an indication of a PUSCH mapping type and a SLIV. Figure 6 In the example, each set of resource allocation information is within a set of curly brackets (e.g., "{PUSCH mapping type, SLIV}"). In this example, entry 5 contains four sets of resource allocation information, where each set of resource allocation information includes an indication of a PUSCH mapping type and a SLIV (e.g., the first set of resource allocation information in entry 5 includes an indication of a first PUSCH mapping type "type-A" and a first SLIV "70", the second set of resource allocation information in entry 5 includes an indication of a second PUSCH mapping type "type-A" and a second SLIV "71", and so on).

[0162] Figure 7 An example scenario associated with an implementation of the multiple PUSCH functionality is shown. Figure 7 In the example scenario, the UE receives DCI in time slot n. The time domain resource allocation (TDRA) field in the DCI may indicate Figure 6 Entry 5 of list 600 (e.g., the UE is configured to use list 600). The UE may transmit PUSCH1 in time slot n+k2 (e.g., time slot n+k2 is time slot n+2 because entry 5 of list 600 indicates k2=2) (e.g., an initial PUSCH among multiple PUSCHs scheduled by DCI), PUSCH2 in time slot n+k2+1 (e.g., a second PUSCH among multiple PUSCHs after the initial PUSCH), PUSCH3 in time slot n+k2+2 (e.g., a third PUSCH among multiple PUSCHs after the second PUSCH), and / or PUSCH4 in time slot n+k2+3 (e.g., a fourth PUSCH among multiple PUSCHs after the third PUSCH). Different PUSCHs may include different TBs associated with different HARQ process numbers. Figure 7In the example shown, the DCI may indicate HARQ process number 3. Based on the DCI indicating HARQ process number 3, the HARQ process numbers of PUSCHs 1 to 4 may be {3, 4, 5, 6} (e.g., PUSCH 1 may be associated with HARQ process number 3, PUSCH 2 may be associated with HARQ process number 4, etc.). For example, the HARQ process number (e.g., HARQ process number 3) indicated by the DCI is associated with (e.g., applied to) an initial scheduled PUSCH (e.g., PUSCH 1) among a plurality of PUSCHs (e.g., scheduled by the DCI). The HARQ processes of the remaining PUSCHs (e.g., PUSCHs 2 to 4) among the plurality of PUSCHs (non-initial PUSCH transmissions) are based on the indicated HARQ process number 3. For example, for each of the remaining PUSCHs, the previous HARQ process number of the previous PUSCH may be increased (e.g., increased by 1) to determine the HARQ process number corresponding to the PUSCH. In an example, the HARQ process number corresponding to the PUSCH may be determined by performing a modulo operation in association with increasing a previous HARQ process number of a previous PUSCH to determine the HARQ process number corresponding to the PUSCH. For example, the HARQ process number corresponding to the PUSCH may be equal to (previous HARQ process number+1) modulo the number of HARQ process numbers. The number of HARQ process numbers may be 16. The number of HARQ process numbers may correspond to the number of HARQ process numbers supported and / or used by the UE (e.g., the total number of HARQ process numbers) and / or the number of HARQ process numbers that the UE is configured to use (e.g., the total number of HARQ process numbers) (e.g., the number of HARQ process numbers that the UE can process and / or the number of HARQ process numbers that the UE can process simultaneously).

[0163] In some instances, Figure 6 List 600 may be used for a physical downlink shared channel (PDSCH), where k2 may be replaced by k0, and PUSCH allocation may be replaced by PDSCH allocation. In an example, k0 indicates a time slot offset between a time slot for scheduling a PDCCH and a time slot for a scheduled PDSCH (e.g., an initial scheduled PDSCH). For example, k0 may be a time slot offset between a time slot for scheduling a PDCCH and a time slot for scheduling a PDSCH, where the scheduled PDSCH may be an initial PDSCH transmission among one or more PDSCH transmissions scheduled by the scheduled PDCCH. In an example where list 600 is used for PDSCH, the PUSCH mapping type of table 600 may be replaced by a PDSCH mapping type. A design similar to that of PUSCH may also be applied in PDSCH. One or more techniques provided herein with respect to PUSCH may be applied in PDSCH.

[0164] In some instances, in order to improve (e.g., guarantee) PUSCH transmission reliability, a PUSCH aggregation / repetition function may be implemented to apply time slot aggregation of PUSCH and / or repetition of PUSCH to a single TB. As used herein, "PUSCH aggregation / repetition function" may refer to a function that applies aggregation of PUSCH and / or repetition of PUSCH to a single TB (e.g., in order to improve PUSCH transmission reliability). The UE may be configured to use pusch-AggregationFactor to semi-statically repeat PUSCH transmissions of a single TB. For example, the scheduling unit for a single TB may be the number of consecutive time slots indicated by pusch-AggregationFactor. An example scenario associated with the PUSCH aggregation / repetition function is described in Figure 8 In Figure 8 In an example scenario, assuming that the UE is configured to use pusch-AggregationFactor=2, in response to the UE receiving a DCI in time slot n (e.g., after this) (wherein the DCI indicates resource allocation {#0~#10} for time slot n+k2), according to pusch-AggregationFactor=2, the UE may consider allocating the same resource allocation {#0~#10} allocated for time slot n+k2 for consecutive time slots after time slot n+k2 (e.g., the consecutive time slots are time slot n+k2+1). The UE may be configured to use another list that is not list 600 (e.g., a second list, such as a list of PUSCH resource allocations), where each entry in the second list indicates a resource allocation for a PUSCH and a repetition number for the PUSCH. The UE may receive a DCI indicating an entry in the second list to dynamically change the repetition number based on the indicated entry. In an example, if the entry indicated by the DCI indicates a repetition number of 2, the UE may perform a scheduled PUSCH transmission (e.g., Figure 8 For example, the repetition number may be based on (e.g., equal to) an aggregation factor, where the repetition number (and / or the aggregation factor) may correspond to the number of times the UE transmits the same data (e.g., the same TB).

[0165] However, in order to obtain the benefits of reduced overhead (e.g., reduced LBT attempts and / or channel access attempts) and the benefits of improved reliability associated with repetition and / or aggregation (e.g., improved PUSCH transmission reliability), further consideration is needed for a single DCI to dynamically and / or semi-statically indicate the number of repetitions and / or time slot aggregation number (and / or aggregation factor) for scheduling multiple PUSCHs.

[0166] The original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 is quoted as follows:

[0167] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0168] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0169] - Otherwise, if the UE is configured to use pusch-AggregationFactor, then the number of repetitions K is equal to pusch-AggregationFactor;

[0170] - In other cases, K=1.

[0171] …

[0172] If the pusch-TimeDomainAllocationList in pusch-Config contains a row indicating resource allocations for two to eight contiguous PUSCHs, then K 2 Indicates the time slot in which the UE will transmit the first PUSCH of multiple PUSCHs. Each PUSCH has a separate SLIV and mapping type. A number of scheduled PUSCHs are transmitted by a number of valid SLIVs indicated in the rows of pusch-TimeDomainAllocationList transmitted in DCI format 0_1.

[0173] The UE may not be able to interpret and / or implement (and / or may be confused about how to interpret and / or implement) the above-quoted portion of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0.

[0174] For example, once the UE uses numberOfRepetitions-r16 or pusch-AggregationFactor (e.g., a pusch-AggregationFactor greater than 1), the UE may not be able to determine (and / or may be confused) the resource allocation of time slot n+k2+1. The UE may not be able to determine (and / or may be confused) the resource allocation of time slot n+k2+1 because from the perspective of repetition (e.g., an implementation of PUSCH aggregation / repetition functionality), time slots n+k2+1 to n+k2+pusch-AggregationFactor-1 may be one or more repetition time slots of time slot n+k2, while from the perspective of multiple PUSCH (e.g., an implementation of multiple PUSCH functionality), time slots n+k2+1 to n+k2+#SLIV-1 may be used for other transmissions that are not repetitions of the PUSCH transmission of time slot n+k2. In other words, for an implementation of the PUSCH aggregation / repetition function, each of one, some, and / or all of the time slots n+k2+1 to n+k2+pusch-AggregationFactor-1 may have the same and / or similar resource allocation as time slot n+k2, the same and / or similar mapping type as time slot n+k2, and / or may have the same TB transmission as time slot n+k2, but for an implementation of the multi-PUSCH function, each of one, some, and / or all of the time slots n+k2+1 to n+k2+#SLIV-1 may have a resource allocation different from that of time slot n+k2, a mapping type different from that of time slot n+k2, and / or a TB transmission different from the TB transmitted in time slot n+k2. Therefore, how the UE considers and / or uses the scheduled resource allocation with repetition number and / or time slot aggregation may require further consideration. Alternatively and / or in addition, the scheduled resource allocation may be dynamically granted for scheduling.

[0175] The techniques of this disclosure may be used for, but are not limited to, operation in unlicensed spectrum and / or shared spectrum channel access.The techniques of this disclosure may be applied to licensed spectrum.

[0176] A first concept of the present disclosure is that for DCI that schedules multi-TB transmission and / or reception with TB repetition (eg, same TB repetition), a certain pattern may be used to determine the association between TBs and time slots and / or the association between HARQ process numbers and time slots.

[0177] The second number may be configured and / or indicated by the network. For example, the UE may be configured to use the second number (e.g., the network may transmit an indication of the second number to the UE). The second number may be a repetition factor and / or an aggregation factor (e.g., the repetition factor and / or the aggregation factor may be set to the second number).

[0178] The DCI may schedule and / or indicate a first number. The first number is a first number of TBs, a first number of HARQ process numbers, a first number of time slots, and / or a first number of SLIVs.

[0179] The DCI indicates a first HARQ process number (eg, a specific HARQ process number). The first HARQ process number is applied to an initial scheduled time slot scheduled by the DCI (eg, the first HARQ process number is applied to an initial scheduled time slot among one or more scheduled time slots scheduled by the DCI).

[0180] The DCI may be DCI format 0_1, DCI format 0_2, DCI format 1_1 or DCI format 1_2.

[0181] In an example, the pattern corresponds to: (i) performing a first group of transmissions within a first group of time slots, wherein the number of transmissions of the first group of transmissions and the number of time slots of the first group of consecutive time slots are equal to a first number of SLIVs, wherein a HARQ process number associated with the first group of transmissions is increased (e.g., increased by 1) for each transmission in the first group of transmissions, and / or (ii) performing one or more groups of transmissions within one or more groups of time slots until the number of transmission groups including the first group of transmissions and the one or more groups of transmissions meets a second number corresponding to an aggregation factor, wherein the one or more groups of transmissions correspond to one or more repetitions of the first group of transmissions. In some examples, the HARQ process number is increased for each transmission in a group of transmissions modulo a third number. The third number may be 16. The third number may correspond to a number of HARQ process numbers, such as a number of HARQ process numbers supported and / or used by the UE and / or a number of HARQ process numbers that the UE is configured to use (e.g., a number of HARQ process numbers that the UE can process and / or a number of HARQ process numbers that the UE can process simultaneously).

[0182] In an instance where the first number of SLIVs is 4 and the second number corresponding to the aggregation factor is 2, the pattern may correspond to: (i) performing a first group of transmissions within a first group of time slots, wherein the first group of transmissions includes 4 transmissions, including: an initial transmission associated with a first HARQ process number (e.g., FIRSTHARQPROCESS), a second transmission after the initial transmission and associated with a second HARQ process number (e.g., FIRSTHARQPROCESS+1), a third transmission after the second transmission and associated with a third HARQ process number (e.g., FIRSTHARQPROCESS+2), and the first group of transmissions The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a first time slot and the second group of transmissions are performed in a second time slot. The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a first time slot and the second group of transmissions are performed in a second time slot. The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a second time slot and the second group of transmissions are performed in a second time slot. The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a first time slot and the second group of transmissions are performed in a second time slot. The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a second time slot and the second group of transmissions are performed in a second time slot. The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a first time slot and the second group of transmissions are performed in a second time slot. The method of claim 1 , wherein the first group of transmissions and the second group of transmissions are performed in a second time slot and the second group of transmissions are performed in a second time slot. In some examples, for each transmission in the first set of transmissions after the initial transmission and / or for each transmission in the second set of transmissions after the initial transmission, a previous HARQ process number associated with the previous transmission is increased (e.g., increased by 1) and / or a modulo operation of a third number is performed to determine the HARQ process number of the transmission. In an example where the third number is 16, a second HARQ process number (associated with a second transmission in the first set of transmissions and a second transmission in the second set of transmissions) may be equal to (FIRSTHARQPROCESS+1) modulo (16).

[0183] For example, in an instance where the second number corresponding to the aggregation factor exceeds 1, the pattern may be two or more rounds of HARQ process numbers, wherein each round of HARQ process numbers includes a first number of HARQ process numbers equal to SLIV, wherein the HARQ process numbers in each round of HARQ process numbers increase continuously (e.g., increase by 1 and / or increase by a modulo operation of a third number), wherein the initial HARQ process number in each round of HARQ process numbers is the first HARQ process number, and / or wherein the number of rounds of the two or more rounds of HARQ process numbers is equal to the second number corresponding to the aggregation factor. The pattern may be applied to a plurality of time slots (e.g., a plurality of consecutive time slots starting at time slot n+k2). Each round of the two or more rounds of HARQ process numbers may be applied to a group of time slots among the plurality of time slots. In an example where the second number corresponding to the aggregation factor is 2 (and, for example, the pattern is two rounds of HARQ process numbers) and the first number of SLIVs is 4, the plurality of time slots may be 8 time slots (e.g., 8 consecutive time slots starting at time slot n+k2, such as 8 time slots that are contiguous with each other), wherein a first group of 4 time slots in the plurality of time slots may correspond to a first round of HARQ process numbers, and a second group of 4 time slots in the plurality of time slots may correspond to a second round of HARQ process numbers, and / or wherein the HARQ process numbers in the second round of HARQ process numbers match the HARQ process numbers in the first round of HARQ process numbers. In an example where the first HARQ process number is 3, the first group of 4 time slots may be associated with HARQ process numbers {3, 4, 5, 6}, respectively, and / or the second group of 4 time slots may be associated with the same HARQ process numbers {3, 4, 5, 6}, respectively.

[0184] The mode may be determined based on (eg, derived from) a first number of SLIVs and a second number corresponding to an aggregation factor.

[0185] In some instances, if the second number corresponding to the aggregation factor is greater than the first number of SLIVs, then the pattern may be a repetition of the first HARQ process number until the number of repetitions of the first HARQ process number is equal to the first number of SLIVs. For example, the pattern may correspond to performing a first transmission associated with the first HARQ process number in a first time slot, wherein the number of transmissions of the first transmission and / or the number of time slots of the first time slot are equal to the first number of SLIVs. For example, the first time slot may be a consecutive time slot (e.g., the first time slots may be connected to each other). Alternatively and / or in addition, the pattern may be applied to the first time slot by associating the first HARQ process number with each time slot in the first time slot. For example, in an instance where the first number of SLIVs is 4 and the second number corresponding to the aggregation factor is greater than 4, the number of transmissions of the first transmission may be 4 (e.g., the first number of SLIVs) and / or the number of time slots of the first time slot may be 4 (e.g., the first number of SLIVs).

[0186] In some examples, if the second number corresponding to the aggregation factor is less than or equal to the first number of SLIVs, then the pattern may be one or more rounds of HARQ process numbers, wherein a first round (e.g., an initial round) of the one or more rounds includes successively increasing HARQ process numbers starting from the first HARQ process number. The number of HARQ process numbers of the successively increasing HARQ process numbers in the first round (and / or the number of times the HARQ process number is increased in the first round) is equal to Where z corresponds to a first number of SLIVs, and x corresponds to a second number corresponding to an aggregation factor. In some examples, a round-up (e.g., round-to-one) operation and / or a round-down operation may be performed to determine the number of HARQ process numbers of the HARQ process numbers that are successively increased in the first round (and / or the number of times the HARQ process number is increased in the first round). For example, a value (e.g., ) may be rounded up (e.g., rounded up to a minimum integer higher than the value according to a round-up operation) or rounded down (e.g., rounded down to a maximum integer lower than the value according to a round-down operation) to determine the number of HARQ process numbers of the HARQ process numbers that are continuously increased in the first round (and / or the number of times the HARQ process number is increased in the first round). A second round of the one or more rounds (e.g., a next round after the initial round) may include continuously increasing the HARQ process number starting from the first HARQ process number. The number of HARQ process numbers of the HARQ process numbers that are continuously increased in the second round. The number of HARQ process numbers of the HARQ process numbers that are continuously increased in the second round may be equal to the first number of SLIVs or the number of HARQ process numbers of the first round (e.g., In an example, the number of HARQ process numbers of the second round is equal to the first number of SLIVs and the number of HARQ process numbers of the first round (eg, ) among the minimum value (e.g., minimum number).

[0187] In some examples, the pattern length (eg, the number of time slots of the pattern) may be (and / or may be based on) the first number of SLIVs.

[0188] In some instances, the pattern is a cyclic repetition of HARQ process numbers from a first HARQ process number to a last HARQ process number. In some instances, the last HARQ process number may be equal to the first HARQ process number + a fourth number - 1. Alternatively and / or in addition, a modulo operation with a third number (e.g., the number of HARQ process numbers supported and / or used by the UE and / or the number of HARQ process numbers that the UE is configured to use) may be performed to determine the last HARQ process number. In an instance where the third number is 16, the last HARQ process number may be equal to (the first HARQ process number + the fourth number - 1) modulo 16. In an example, each of the cyclic repetitions may be a cyclic repetition of the first HARQ process number, a second HARQ process number corresponding to the first HARQ process number + 1, ..., a cyclic repetition of the last HARQ process number corresponding to the first HARQ process number + the third number - 1. Alternatively and / or in addition, one or more HARQ process numbers of the cyclic repetition (e.g., the one or more HARQ process numbers may include at least one of the second HARQ process number, ..., the last HARQ process number) may be determined by performing one or more modulo operations with the third number. In an instance where the third number is 16, the second HARQ process number may be equal to (the first HARQ process number+1) modulo 16. In some instances, the fourth number is equal to (and / or based on) the first number of SLIVs divided by the second number corresponding to the aggregation factor. In some instances, a round-up (e.g., round-to-one) operation and / or a round-down operation may be performed to determine the fourth number. For example, a value (e.g., the first number of SLIVs divided by the second number corresponding to the aggregation factor) may be rounded up (e.g., rounded up to the smallest integer higher than the value according to the round-up operation) or rounded down (e.g., rounded down to the largest integer lower than the value according to the round-down operation) to determine the fourth number. In some instances, the number of cyclic repetitions of the cyclic repetitions in the pattern may be equal to the first number of SLIVs. Alternatively and / or additionally, the number of HARQ process numbers in the pattern (e.g., the total number of HARQ process numbers in the pattern, such as one or more repetitions including one or more HARQ process numbers) may be equal to the first number of SLIVs. Alternatively and / or additionally, the cyclic repetition may be applied to a plurality of time slots (e.g., a plurality of consecutive time slots starting at time slot n+k2). Each of the cyclic repetitions may be applied to a group of time slots in the plurality of time slots.In an instance where the first number of SLIVs is 4 (and, for example, the number of cyclic repetitions of the cyclic repetition is 4), a first group of time slots in the plurality of time slots may correspond to a first cyclic repetition in the cyclic repetition (for example, an initial time slot in the first group of time slots may be associated with a first HARQ process number, a second time slot in the first group of time slots may be associated with a second HARQ process number equal to the first HARQ process number+1, ..., a last time slot in the first group of time slots may be associated with the last HARQ process number), and a second group of time slots in the plurality of time slots may correspond to a second cyclic repetition in the cyclic repetition (for example, an initial time slot in the second group of time slots may be associated with a first HARQ process number, a second time slot in the second group of time slots may be associated with a second HARQ process number equal to the first HARQ process number+1, ..., a last time slot in the second group of time slots may be associated with the last HARQ process number). The first time slot in the third group of time slots may be associated with the first HARQ process number, the second time slot in the third group of time slots may be associated with the second HARQ process number equal to the first HARQ process number+1, ..., the last time slot in the third group of time slots may be associated with the last HARQ process number), and the fourth group of time slots in the plurality of time slots may correspond to the fourth cyclic repetition in the cyclic repetition (e.g., the first time slot in the fourth group of time slots may be associated with the first HARQ process number, the second time slot in the fourth group of time slots may be associated with the second HARQ process number equal to the first HARQ process number+1, ..., the last time slot in the fourth group of time slots may be associated with the last HARQ process number). An example of a pattern is. Fig. 9 In Fig. 9 In the example shown, a mode may be executed based on at least some of the information 902, and / or the mode may include a cyclic repetition 904 of {first HARQ process number, first HARQ process number+1, ..., first HARQ process number+fourth number-1}, wherein the mode is completed 906 after the number of HARQ process numbers in the pattern (e.g., the total number of HARQ process numbers in the pattern, such as one or more repetitions including one or more HARQ process numbers) reaches a first number of SLIV.

[0189] In some instances, if the second number corresponding to the aggregation factor is less than or equal to the first number of SLIVs, then the pattern may be one or more rounds of HARQ process numbers. An initial round in the one or more rounds includes repetitions of the first HARQ process number, wherein the number of repetitions of the repetitions of the first HARQ process number is the second number corresponding to the aggregation factor (e.g., for the initial round in the one or more rounds, the first HARQ process number is repeated one or more times, wherein the one or more times are equal to the second number corresponding to the aggregation factor). Each of one or more subsequent rounds in the one or more rounds after the initial round may include repetitions of the associated HARQ process number, wherein the number of repetitions of the repetitions of the associated HARQ process number is a fifth number, and wherein the associated HARQ process number is equal to the sum of the second number corresponding to the aggregation factor and a previous HARQ process number associated with a previous round before the round (e.g., a previous HARQ process number associated with a previous round just before the round, such as the first HARQ process number associated with the initial round). The fifth number may be a minimum value (e.g., a minimum number) among: (i) the first number of SLIVs minus the second number corresponding to the aggregation factor, and (ii) the second number corresponding to the aggregation factor. For example, if the first number of SLIVs minus the second number corresponding to the aggregation factor is greater than the second number corresponding to the aggregation factor, then the fifth number may be equal to the second number corresponding to the aggregation factor. Alternatively and / or in addition, if the first number of SLIVs minus the second number corresponding to the aggregation factor is less than the second number corresponding to the aggregation factor, then the fifth number may be equal to the first number of SLIVs minus the second number corresponding to the aggregation factor. In an example, the one or more subsequent rounds after the initial round include a second round after the initial round (e.g., just after the initial round) and a third round after the second round (e.g., just after the second round). The second round may include repetitions of a second HARQ process number (e.g., the first associated HARQ process number), wherein the number of repetitions of the repetitions of the second HARQ process number in the second round is the fifth number, and wherein the second HARQ process number is equal to the sum of the second number corresponding to the aggregation factor and the first HARQ process number. Alternatively and / or in addition, the third round may include repetitions of a third HARQ process number (e.g., a second associated HARQ process number), wherein the number of repetitions of the repetitions of the third HARQ process number in the third round is a fifth number, and wherein the third HARQ process number is equal to the sum of the second number corresponding to the aggregation factor and the second HARQ process number. In some instances, the pattern length (e.g., the number of time slots of the pattern) may be (and / or may be based on) the first number of SLIVs. In some instances, the one or more rounds may be applied to a plurality of time slots (e.g., a plurality of consecutive time slots starting at time slot n+k2). Each of the one or more rounds may be applied to a group of time slots among the plurality of time slots.In an instance, a first group of time slots among the multiple time slots may correspond to an initial round of the one or more rounds (e.g., the first group of time slots may be associated with a first HARQ process number, e.g., wherein each time slot in the first group of time slots is associated with a repetition of the first HARQ process number in the initial round, and / or wherein the number of time slots in the first group of time slots is equal to a second number corresponding to an aggregation factor), a second group of time slots among the multiple time slots may correspond to a second round of the one or more rounds (e.g., the second group of time slots may be associated with a second HARQ process number, e.g., wherein each time slot in the second group of time slots is associated with a repetition of the second HARQ process number in the second round, and / or wherein the number of time slots in the second group of time slots is equal to a fifth number), and so on.

[0190] In some instances, the pattern includes sequentially repeating a first HARQ process number and one or more associated HARQ process numbers. In some instances, each of the one or more associated HARQ process numbers may be equal to the first HARQ process number plus a multiple of a second number corresponding to a aggregation factor. For example, the one or more associated HARQ process numbers may include at least one of the following: a first associated HARQ process number equal to the first HARQ process number + (1×the second number corresponding to the aggregation factor), a second associated HARQ process number equal to the first HARQ process number + (2×the second number corresponding to the aggregation factor), a third associated HARQ process number equal to the first HARQ process number + (3×the second number corresponding to the aggregation factor), and so on.

[0191] An example of the pattern is Fig.10 In Fig.10In the example shown, a pattern may be performed based on at least some of the information 1002. The pattern may include, at 1004, repeating a first HARQ process number (e.g., for an initial instance of 1004, HARQ process number X is set to the first HARQ process number), wherein the number of repetitions of the first HARQ process number in 1004 is a minimum value (e.g., a minimum number) of: (i) a remaining number before a first number of SLIVs (e.g., the first number of SLIVs may be equal to the remaining number before the first number of SLIVs at the start of the pattern), and (ii) a second number corresponding to an aggregation factor. In an example, the remaining number before the first number of SLIVs may be equal to the first number of SLIVs minus the number of HARQ process numbers in the pattern to that point (e.g., the total number of HARQ process numbers in the pattern to that point, such as including one or more repetitions of one or more HARQ process numbers). At 1010, if the first number of SLIVs is reached for the pattern (e.g., if the number of HARQ process numbers in the pattern reaches the first number of SLIVs), then the pattern is completed 1008. Otherwise, if the first number of SLIVs has not been reached for the pattern, then at 1006, the HARQ process number X may be updated by setting the HARQ process number X equal to the HARQ process number X + the second number of HARQ process numbers corresponding to the aggregation factor (e.g., such that the updated HARQ process number X is repeated one or more times in 1004). Actions 1004 and / or 1006 may be performed until it is determined 1010 that the first number of SLIVs has been reached for the pattern (indicating pattern completion 1008). In the example where the first number of SLIVs is 8, the second number corresponding to the aggregation factor is 2, and the first HARQ process number is 3, according to Fig.10 In the example, the pattern could be {3, 3, 5, 5, 7, 7, 9, 9}.

[0192] In some instances, the pattern includes n repetitions of each HARQ process number in the HARQ process numbers from the first HARQ process number to the last HARQ process number (e.g., n is equal to and / or based on a second number corresponding to the aggregation factor). In some instances, the last HARQ process number may be equal to the first HARQ process number+the first number (e.g., the first number of SLIVs)-1. In some instances, the HARQ process numbers may include each HARQ process number from the first HARQ process number to the last HARQ process number (e.g., each HARQ process number supported and / or used by the UE and / or each HARQ process number configured for use by the UE) (e.g., if the first HARQ process number is 3 and the last HARQ process number is 6, then the HARQ process numbers may include HARQ process numbers 3, 4, 5, and 6). Alternatively and / or in addition, a modulo operation with a third number (e.g., the number of HARQ process numbers supported and / or used by the UE and / or the number of HARQ process numbers configured for use by the UE) may be performed to determine the last HARQ process number. In an instance where the third number is 16, the last HARQ process number may be equal to (first HARQ process number + first number - 1) modulo 16. In an instance, n repetitions of each of the HARQ process numbers may be performed in a sequential order. For example, a pattern may include n repetitions of a first HARQ process number, followed by n repetitions of a first HARQ process number + 1, ..., followed by n repetitions of a last HARQ process number. In an instance where the first HARQ process number is 3 and the last HARQ process number is 6, the pattern may include n repetitions of HARQ process number 3, followed by n repetitions of HARQ process number 4, followed by n repetitions of HARQ process number 5, followed by n repetitions of HARQ process number 6 (e.g., if n = 2, then the pattern includes {3, 3, 4, 4, 5, 5, 6, 6}). The pattern may be applied to multiple time slots (e.g., multiple consecutive time slots starting at time slot n + k2). In an example where the first HARQ process number is 3 and the last HARQ process number is 6, the first group of time slots (e.g., the first group of n time slots in the plurality of time slots) may be associated with HARQ process number 3, the second group of time slots (e.g., the second group of n time slots in the plurality of time slots) may be associated with HARQ process number 4, the third group of time slots (e.g., the third group of n time slots in the plurality of time slots) may be associated with HARQ process number 5, and / or the fourth group of time slots (e.g., the fourth group of n time slots in the plurality of time slots) may be associated with HARQ process number 6. Fig.11 Option 4 is shown in which for HARQ process numbers {3, 4, 5, 6}, each HARQ process number is repeated twice (e.g., the pattern is HARQ process numbers {3, 3, 4, 4, 5, 5, 6, 6}).

[0193] In some instances, the pattern includes sequential repetitions of each HARQ process number among HARQ process numbers including a first HARQ process number and one or more associated HARQ process numbers. For example, the pattern may include n repetitions of the first HARQ process number, followed by n repetitions of the second HARQ process number equal to the first HARQ process number+1, ..., followed by n repetitions of the last HARQ process number equal to the first HARQ process number plus a first number (e.g., the first number of SLIVs) minus 1 (e.g., n is equal to and / or based on a second number corresponding to an aggregation factor). In an instance, the pattern includes multiple groups of n repetitions of the HARQ process number. An initial group of n repetitions of the first HARQ process number. For each group of n repetitions after the initial group of n repetitions, a previous HARQ process number associated with the previous group of n repetitions (e.g., a previous HARQ process number associated with the previous group of n repetitions just before the group of n repetitions) may be increased (e.g., by 1) to determine the HARQ process number of the group of n repetitions. The group of n repetitions is performed until a group of n repetitions of the last HARQ process number is completed. Each group of n repetitions in the plurality of groups of n repetitions may be applied to a group of time slots in the plurality of time slots. In an example, a first group of time slots in the plurality of time slots may correspond to a group of initial n repetitions (e.g., the first group of time slots may be associated with a first HARQ process number, such as where each time slot in the first group of time slots is associated with a repetition of a first HARQ process number in a group of initial n repetitions, and / or where the number of time slots in the first group of time slots is equal to n), a second group of time slots in the plurality of time slots may correspond to a second group of n repetitions (e.g., the second group of time slots may be associated with a second HARQ process number equal to the first HARQ process number plus 1, such as where each time slot in the second group of time slots is associated with a repetition of a second HARQ process number in the second group of n repetitions, and / or where the number of time slots in the second group of time slots is equal to n), and so on.

[0194] In some instances, if the second number corresponding to the aggregation factor is less than or equal to the first number of SLIVs, then the pattern may be one or more rounds of HARQ process numbers. An initial round in the one or more rounds includes repetitions of the first HARQ process number, wherein the number of repetitions of the repetitions of the first HARQ process number is the second number corresponding to the aggregation factor (e.g., for the initial round in the one or more rounds, the first HARQ process number is repeated one or more times, wherein the one or more times is equal to the second number corresponding to the aggregation factor). For each round after the initial round (in the one or more rounds), a previous HARQ process number associated with the previous round (e.g., a previous HARQ process number associated with the previous round just before the round) may be increased (e.g., increased by 1) to determine the HARQ process number of the round, and a group of m repetitions of the HARQ process number is performed in the round. In some instances, the one or more rounds are performed until a round including a group of repetitions of the last HARQ process number (e.g., a group of m repetitions of the last HARQ process number) is performed and / or completed. In some instances, the last HARQ process number is equal to the first HARQ process number plus a fourth number (e.g., the first number of SLIVs divided by the second number corresponding to the aggregation factor). In some instances, m can be the minimum value (e.g., the minimum number) of the following: (i) the first number of SLIVs minus the second number corresponding to the aggregation factor, and (ii) the second number corresponding to the aggregation factor. In an example, one or more subsequent rounds after the initial round include a second round after the initial round (e.g., just after the initial round) and a third round after the second round (e.g., just after the second round). The second round may include m repetitions of the second HARQ process number equal to the first HARQ process number+1. Alternatively and / or in addition, the third round may include m repetitions of the third HARQ process number equal to the second HARQ process number+1. In some instances, the pattern length (e.g., the number of time slots of the pattern) can be (and / or can be based on) the first number of SLIVs. In some instances, the one or more rounds can be applied to multiple time slots (e.g., multiple consecutive time slots starting at time slot n+k2). Each of the one or more rounds may be applied to a group of time slots among the plurality of time slots.In an instance, a first group of time slots among the multiple time slots may correspond to an initial round of the one or more rounds (e.g., the first group of time slots may be associated with a first HARQ process number, e.g., wherein each time slot in the first group of time slots is associated with a repetition of the first HARQ process number in the initial round, and / or wherein the number of time slots in the first group of time slots is equal to a second number corresponding to an aggregation factor), a second group of time slots among the multiple time slots may correspond to a second round of the one or more rounds (e.g., the second group of time slots may be associated with a second HARQ process number, e.g., wherein each time slot in the second group of time slots is associated with a repetition of the second HARQ process number in the second round, and / or wherein the number of time slots in the second group of time slots is equal to m), and so on.

[0195] In some instances, the pattern includes sequentially repeating a first HARQ process number and one or more HARQ process numbers. In some instances, the one or more HARQ process numbers may be consecutive HARQ process numbers following (eg, by a modulo operation) the first HARQ process number.

[0196] An example of the pattern is Fig.12 In Fig.12 In the example shown, a pattern may be performed based on at least some of the information 1202. The pattern may include sequentially repeating 1204 each HARQ process number of at least some of the HARQ process numbers {first HARQ process number, first HARQ process number+1, ..., first HARQ process number+fourth number-1}, wherein each HARQ process number of at least some of the HARQ process numbers is repeated a number of times equal to a second number of times, and / or wherein after the number of HARQ process numbers in the pattern (e.g., the total number of HARQ process numbers in the pattern, such as one or more repetitions including one or more HARQ process numbers) reaches a first number of SLIVs, the pattern is completed 1206. In an example where the first number of SLIVs is 8, the second number corresponding to the aggregation factor is 2, and the first HARQ process number is 3, according to Fig.12 In the example in , the pattern may be {3, 3, 4, 4, 5, 5, 6, 6} (eg, HARQ process numbers 7 to 10 do not exist in the pattern).

[0197] In some instances, the DCI schedules resource allocations (e.g., time resource allocations) within a time slot for one or more TBs. In some instances, the resource allocations (e.g., time resource allocations) within a time slot indicate OFDM symbols (e.g., consecutive OFDM symbols) within the time slot. For example, the resource allocation may indicate a starting OFDM symbol of an OFDM symbol and / or a consecutive OFDM symbol length (e.g., the length may correspond to the number of OFDM symbols of the OFDM symbols associated with the resource allocation, where the starting OFDM symbol is included in the length). The DCI may schedule the same resource allocation (e.g., the same time resource allocation) within each time slot for one of the one or more TBs. For example, the OFDM symbol used to transmit the first TB of the one or more TBs in a first time slot may be the same as the OFDM symbol used to transmit the first TB in a second time slot. Alternatively and / or in addition, the DCI may schedule the same resource allocation (e.g., the same time resource allocation) within each time slot for multiple TBs of the one or more TBs. For example, the OFDM symbol used to transmit the first TB of the one or more TBs in the first time slot may be the same as the OFDM symbol used to transmit the second TB of the one or more TBs in the second time slot. Alternatively and / or in addition, the DCI may schedule different resource allocations (e.g., different time resource allocations) within a time slot for one of the one or more TBs. For example, the OFDM symbol used to transmit the first TB of the one or more TBs in the first time slot may be different from the OFDM symbol used to transmit the first TB in the second time slot. Alternatively and / or in addition, the DCI may schedule different resource allocations (e.g., different time resource allocations) within a time slot for multiple TBs of the one or more TBs. For example, the OFDM symbol used to transmit the first TB of the one or more TBs in the first time slot may be different from the OFDM symbol used to transmit the second TB of the one or more TBs in the second time slot.

[0198] Fig.11 An example of a pattern (e.g., of resource allocation) across multiple time slots is shown, where a second number corresponding to an aggregation factor (e.g., an aggregation number of time slots that the UE is configured to use) is less than or equal to the first number of SLIVs. The UE receives a DCI in time slot n, where the DCI indicates a time slot offset (e.g., k2) for an initial scheduled transmission (e.g., the initial transmission scheduled by the DCI is scheduled for time slot n+k2). Fig.11 In the example shown, the second number corresponding to the aggregation factor is 2 (eg, the UE is configured to use a slot aggregation number of "2"). Fig.11 In the example shown, the first number of SLIVs is 4. For example, based on an indication (e.g., Figure 6 The DCI of the entry of list 600 includes 4 SLIVs (eg, the DCI may include corresponding Figure 6 ), the first number of SLIVs is 4. Alternatively and / or in addition, the DCI may indicate a first HARQ process number (eg, for an initial scheduled transmission and / or a first scheduled SLIV).

[0199] Fig.11 Example modes for selections 1-5 are shown. For each selection, Fig.11 HARQ process numbers associated with time slots (eg, consecutive time slots) in a pattern starting at time slot n+k2 are shown.

[0200] In option 1, the pattern may correspond to HARQ process numbers {3, 4, 5, 6, 3, 4, 5, 6} across the plurality of time slots (e.g., the plurality of time slots includes 8 time slots). For example, the plurality of time slots (to which the pattern is applied) includes a first group of time slots including time slots from time slot n+k2 to time slot n+k2+3 (e.g., 4 time slots) associated with HARQ process numbers {3, 4, 5, 6}, respectively. The plurality of time slots includes a second group of time slots including time slots (e.g., 4 time slots), wherein the HARQ process numbers applied to the second group of time slots are respectively the same as (e.g., a repetition of) the HARQ process numbers applied to the first group of time slots. For example, the repeated HARQ process numbers (e.g., associated with the second group of time slots) are after the original HARQ process numbers (e.g., associated with the first group of time slots).

[0201] In option 2, the pattern may correspond to HARQ process numbers {3, 4, 3, 4} across the plurality of time slots (e.g., the plurality of time slots includes 4 time slots). In some instances, the number (e.g., a total number, such as 4) of HARQ process numbers (e.g., including repetitions of HARQ process numbers) of the pattern and / or the number of time slots associated with the pattern is based on a first number of SLIVs (e.g., the number of SLIVs in the indicated entry, such as #SLIV) being 4. For example, the number of HARQ process numbers and / or the number of time slots may be equal to (and / or based on) the first number of SLIVs. In some instances, the number of unique HARQ process numbers in the HARQ process numbers may be determined (e.g., may be derived therefrom) based on the first number of SLIVs (e.g., 4) divided by an aggregation factor (e.g., 2). In some instances, a round-up (e.g., round-to-one) operation and / or a round-down operation may be performed to determine the number of unique HARQ process numbers. For example, the value (e.g., the first number of SLIVs divided by the aggregation factor) may be rounded up (e.g., to a smallest integer above the value according to a round-up operation) or rounded down (e.g., to a largest integer below the value according to a round-down operation) to determine the number of unique HARQ process numbers. Fig.11In the example shown, the number of unique HARQ process numbers for the pattern is 2 (eg, where the unique HARQ process numbers for the pattern are 3 and 4).

[0202] In option 3, the pattern may correspond to HARQ process numbers {3, 3, 5, 5} across the plurality of time slots (e.g., the plurality of time slots includes 4 time slots). In some instances, the number (e.g., a total number, such as 4) of HARQ process numbers (e.g., including repetitions of HARQ process numbers) of the pattern and / or the number of time slots associated with the pattern is based on a first number of SLIVs (e.g., the number of SLIVs in the indicated entry, such as #SLIV) of 4. For example, the number of HARQ process numbers and / or the number of time slots may be equal to (and / or based on) the first number of SLIVs. In some instances, HARQ process number 3 is repeated for one or more consecutive time slots, wherein the number of time slots of the one or more consecutive time slots is equal to the aggregation factor (e.g., the one or more consecutive time slots include time slot n+k2). The one or more consecutive time slots are followed by one or more second consecutive time slots, wherein the associated HARQ process number is repeated for the one or more second consecutive time slots. In an example, the one or more consecutive time slots in which the first HARQ process number (e.g., 3) repeats include time slot n+k2 and time slot n+k2+1, and the one or more second consecutive time slots in which the associated HARQ process number repeats include time slot n+k2+2 and time slot n+k2+3. In some examples, the associated HARQ process number is 5. For example, the associated HARQ process number associated with the one or more second consecutive time slots may be equal to (and / or based on) the first HARQ process number (e.g., 3) plus an aggregation factor (e.g., 2). In some examples, Fig.11 In the example shown, the UE does not use (and / or does not consider using) HARQ process number 4.

[0203] In option 4, the pattern may correspond to HARQ process numbers {3, 3, 4, 4, 5, 5, 6, 6} across the plurality of time slots (e.g., the plurality of time slots includes 8 time slots). In some examples, for each HARQ process number in HARQ process numbers 3-6, the HARQ process number may repeat in a number of time slots totaling a aggregation factor (e.g., 2 time slots since the aggregation factor is equal to 2). In some examples, the number of time slots in the plurality of time slots (e.g., 8) is based on the first number of SLIVs and the aggregation factor (e.g., the number of time slots may be equal to the first number of SLIVs multiplied by the aggregation factor).

[0204] In option 5, the pattern may correspond to HARQ process numbers {3, 3, 4, 4} across the plurality of time slots (e.g., the plurality of time slots includes 4 time slots). In some instances, the number (e.g., a total number, such as 4) of HARQ process numbers (e.g., including repetitions of HARQ process numbers) of the pattern and / or the number of time slots associated with the pattern based on a first number of SLIVs (e.g., the number of SLIVs in the indicated entry, such as #SLIV) is 4. For example, the number of HARQ process numbers and / or the number of time slots may be equal to (and / or based on) the first number of SLIVs. In some instances, HARQ process number 3 is repeated for one or more consecutive time slots, wherein the number of time slots of the one or more consecutive time slots is equal to the aggregation factor (e.g., the one or more consecutive time slots include time slot n+k2). The one or more consecutive time slots are followed by one or more second consecutive time slots, wherein consecutive HARQ process numbers are repeated for the one or more second consecutive time slots. In an example, the one or more consecutive time slots in which the first HARQ process number (e.g., 3) repeats include time slot n+k2 and time slot n+k2+1, and the one or more second consecutive time slots in which the consecutive HARQ process number repeats include time slot n+k2+2 and time slot n+k2+3. In some examples, the consecutive HARQ process number is 4. For example, the consecutive HARQ process number associated with the one or more second consecutive time slots may be equal to (and / or based on) the first HARQ process number (e.g., 3) plus 1 (e.g., the consecutive HARQ process number may correspond to a HARQ process number that consecutively follows the first HARQ process number).

[0205] In some examples, the mode may be specified in a standard and / or fixed.

[0206] In some examples, the mode may be configured (eg, pre-configured) by the network (eg, the UE may be configured to use the mode by receiving a configuration and / or indication of the mode from the network).

[0207] In some instances, the same HARQ process number corresponds to the same TB. For example, if a first time slot and a second time slot are associated with the same HARQ process number, then the same TB may be transmitted via the first time slot and via the second time slot.

[0208] In some examples, the same HARQ process number corresponds to the same SLIV. For example, if the first time slot and the second time slot are associated with the same HARQ process number, then the first time slot and the second time slot may be associated with the same SLIV.

[0209] In some instances, the same HARQ process number corresponds to the same mapping type. For example, if the first time slot and the second time slot are associated with the same HARQ process number, then the first time slot and the second time slot may be associated with the same mapping type.

[0210] Fig.13 An example of a pattern (e.g., of resource allocation) across multiple time slots is shown, where a second number corresponding to an aggregation factor (e.g., an aggregation number of time slots that the UE is configured to use) is less than or equal to the first number of SLIVs. The UE receives a DCI in time slot n, where the DCI indicates a time slot offset (e.g., k2) for an initial scheduled transmission (e.g., the initial transmission scheduled by the DCI is scheduled for time slot n+k2). Fig.13 In the example shown, the second number corresponding to the aggregation factor is 2 (eg, the UE is configured to use a slot aggregation number of "2"). Fig.13 In the example shown, the first number of SLIVs is 4. For example, based on an indication (e.g., Figure 6 The DCI of the entry of list 600 includes 4 SLIVs (eg, the DCI may include corresponding Figure 6 ), the first number of SLIVs is 4. Alternatively and / or in addition, the DCI may indicate a first HARQ process number (eg, for an initial scheduled transmission and / or a first scheduled SLIV).

[0211] For each option, Fig.13 SLIVs associated with the plurality of time slots (eg, consecutive time slots) in the pattern starting at time slot n+k2 are shown. In some examples, Fig.11 The HARQ process number shown in each selection scheme can be respectively Fig.13 The SLIV is associated with the SLIV shown in each selection scheme. The SLIV is based on the entry indicated by the DCI received by the UE (e.g., entry 5).

[0212] In some instances, according to Fig.11 The HARQ process numbers of the selection scheme 1 and / or the selection scheme 4 are respectively the same as those according to Fig.13 is associated with the SLIV of Option 1 and / or Option 4.

[0213] In some instances, according to Fig.11 The HARQ process numbers of the options 2, 3 and / or 5 in the above embodiment are respectively the same as those according to Fig.13 is associated with the SLIV of Option 2, Option 3 and / or Option 5.

[0214] In some examples, the UE may determine (eg, derive) a pattern length (eg, the number of slots of a pattern) based on configuration (eg, pre-configuration) by the network.

[0215] In some examples, the UE may determine (eg, derive) a pattern length (eg, the number of slots of a pattern) based on a fixed value and / or a value specified in a specification.

[0216] In an example, the pattern length is 6, the UE is configured to use a slot aggregation number of "2", and the UE receives a DCI, wherein the DCI indicates 4 SLIVs (e.g., based on the entry indicated by the DCI including 4 SLIVs, the first number of SLIVs is 4), and the DCI indicates that the first HARQ process number (e.g., for the initial scheduled SLIV) is 3. In an example, if the pattern is determined according to selection scheme 1, the UE may determine (e.g., derive, identify and / or assume) that the pattern of selection scheme 1 is {3, 4, 5, 6, 3, 4}. Alternatively and / or additionally, in an example, if the pattern is determined according to selection scheme 2, the pattern may be {3, 4, 5, 3, 4, 5}. Alternatively and / or additionally, in an example, if the pattern is determined according to selection scheme 3, the pattern may be {3, 3, 5, 5, 3, 3}. Alternatively and / or additionally, in an example, if the pattern is determined according to selection scheme 4, the pattern may be {3, 3, 4, 4, 5, 5}. Alternatively and / or additionally, in an example, if the pattern is determined according to option 5, then the pattern may be {3, 3, 4, 4, 5, 5}.

[0217] Figures 14 to 16 Other examples of patterns are shown with respect to various selection schemes (eg, selection schemes 1-5). Fig.14 An example of a pattern (e.g., of resource allocation) across multiple time slots is shown, where a second number corresponding to an aggregation factor (e.g., the number of time slot aggregations that the UE is configured to use) is less than or equal to a first number of SLIVs, and where the first number of SLIVs is an odd number. Fig.15 An example of a pattern (eg, of resource allocation) across multiple time slots is shown, where a second number corresponding to an aggregation factor (eg, an aggregation number of time slots that the UE is configured to use) is greater than a first number of SLIVs. Fig.16 An example of a pattern (e.g., of resource allocation) across multiple time slots is shown, where a second number corresponding to an aggregation factor (e.g., an aggregation number of time slots that the UE is configured to use) is greater than a first number of SLIVs, and where the first number of SLIVs is an odd number.

[0218] The second concept of the present disclosure is to apply restrictions (e.g., constraints). For example, restrictions may be applied to the UE and / or the network. The restriction may be that only one of the multiple PUSCH functions (e.g., multiple TBs) or the PUSCH aggregation / repetition functions (e.g., PUSCH aggregation factor) can be configured and / or provided (e.g., for the UE). For example, the restriction may be that the UE cannot be configured to use and / or cannot be provided in parallel (e.g., simultaneously) with both the multiple PUSCH functions (e.g., multiple TBs) and the PUSCH aggregation / repetition functions (e.g., PUSCH aggregation factor). For example, the UE may be configured to use and / or provide multiple PUSCH functions (e.g., multiple TBs) or the PUSCH aggregation / repetition functions (e.g., PUSCH aggregation factor).

[0219] In an instance, if the UE is configured to use a multi-PUSCH functionality-related configuration (e.g., a multi-TB-related configuration), such as where pusch-TimeDomainAllocationListForMultiPUSCH-r16 is enabled, then the UE is not expected (and / or not expected) to be configured to use the PUSCH aggregation / repetition functionality. For example, if the UE is configured to use a multi-PUSCH functionality-related configuration (e.g., a multi-TB-related configuration), such as where pusch-TimeDomainAllocationListForMultiPUSCH-r16 is enabled, then the UE is not expected (and / or not expected) to be configured to use an aggregation factor. Alternatively and / or in addition, if the UE is configured to use a multi-PUSCH functionality-related configuration (e.g., a multi-TB-related configuration), such as where pusch-TimeDomainAllocationListForMultiPUSCH-r16 is enabled, then the UE is not expected (and / or not expected) to be configured to use a repetition number.

[0220] In an instance, if the UE is configured to use PUSCH aggregation / repetition functionality (e.g., if the UE is configured to use an aggregation factor), then the UE is not expected (and / or is not expected) to be configured to use a multi-PUSCH functionality related configuration (e.g., a multi-TB related configuration) (e.g., the UE is not expected and / or is not expected to enable pusch-TimeDomainAllocationListForMultiPUSCH-r16).

[0221] In some instances, the network is not configured (e.g., the network is not allowed to be configured, is prohibited from being configured, and / or is unable to be configured) to configure the UE to use multiple PDSCH function-related configurations (e.g., multiple TB-related configurations) and PDSCH aggregation / repetition configurations and / or parameters (e.g., aggregation factor configurations and / or parameters) in parallel (e.g., simultaneously).

[0222] In some instances, in response to (and / or after) being configured to use a multiple PDSCH function-related configuration (e.g., a multiple TB-related configuration), the UE may ignore (and / or may not apply and / or implement) a PDSCH aggregation / repetition function-related configuration (e.g., an aggregation factor-related configuration). For example, when the UE is configured to use a multiple PDSCH function-related configuration (e.g., a multiple TB-related configuration), the UE may ignore (e.g., the UE may not apply and / or implement) a PDSCH aggregation / repetition function-related configuration (e.g., an aggregation factor-related configuration).

[0223] In some instances, in response to receiving configuration of both a multiple PDSCH function (e.g., multiple TBs) and a PDSCH aggregation / repetition function (e.g., a PDSC aggregation factor) (and / or thereafter), the UE may report (e.g., transmit) a message to the network for reconfiguration. For example, the UE may report a message to the network for reconfiguration in response to being configured to use both a multiple PDSCH function (e.g., multiple TBs) and a PDSCH aggregation / repetition function (e.g., a PDSCH aggregation factor) in parallel (e.g., simultaneously). In some instances, in response to receiving the message, the network may configure the UE to use only one of the multiple PDSCH function (e.g., multiple TBs) and the PDSCH aggregation / repetition function (e.g., a PUSCH aggregation factor).

[0224] According to some embodiments herein, in order to enhance the 3GPP wireless communication specifications, enhancements 1-7 are provided herein. Enhancements 1-7 reflect implementations according to some embodiments herein and include additions to various parts of the 3GPP specifications. According to some embodiments, one, some, and / or all of the enhancements 1-7 may be implemented, and / or a portion of one, some, and / or all of the enhancements 1-7 may be implemented.

[0225] Enhancement 1 includes additions to 3GPP TS 38.331 V16.2.0. The following quotes refer to the original part of 3GPP TS 38.331 V16.2.0 without adding any Enhancement 1 (some parts of the original part are not included in the quote):

[0226]

[0227]

[0228] Number of repetitions of the data (see TS 38.214

[19] Section 6.1.2.1). If this field is not present, the UE shall use a value of 1.

[0229] In enhancement 1, according to some embodiments of the present disclosure, addition 1 is made to the original part of 3GPP TS 38.331 V16.2.0. To distinguish addition 1 from the content originally included in the original part of 3GPP TS 38.331 V16.2.0, addition 1 is in bold, preceded by the term "(addition 1 starts:)" and followed by the term "(addition 1 ends)".

[0230] Enhancement 1:

[0231]

[0232] Number of repetitions of the data (see TS 38.214

[19] Section 6.1.2.1). If this field is not present, the UE shall apply a value of 1. (Starting with adding 1:) If pusch-TimeDomainAllocationListForMultiPUSCH-r16 is configured, this field shall not be present.

[0233] (Add 1 to end)

[0234] For example, enhancement 1 provides that if pusch-TimeDomainAllocationListForMultiPUSCH-r16 is configured (e.g., for the UE), then a certain field (e.g., the pusch-AggregationFactor field) does not exist (e.g., does not exist in the PUSCH-Config information element). For example, the PUSCH-Config information element may be configured (e.g., by the network) such that the field (e.g., the pusch-AggregationFactor field) does not exist when the UE is configured to use pusch-TimeDomainAllocationListForMultiPUSCH-r16.

[0235] Enhancement 2 includes an addition to section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 (Addition 2). Section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 is entitled Resource Allocation in the Time Domain.

[0236] Enhancement 2:

[0237] Add 2 to start:

[0238] If the UE is configured to use the higher layer parameter pusch-TimeDomainAllocationListForMultiPUSCH-r16, the UE is not expected to be configured to use pusch-AggregationFactor.

[0239] Add 2 to end

[0240] Enhancement 3 includes additions to section 6.1.2.1 of 3GPP TS 38.214 V16.3.0. The following quote quotes the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 without adding any enhancement 3 (some parts of the original part are not included in the quote):

[0241] 6.1.2 Resource Allocation

[0242] 6.1.2.1 Resource Allocation in the Time Domain

[0243] …

[0244] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0245] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0246] - Otherwise, if the UE is configured to use pusch-AggregationFactor, then the number of repetitions K is equal to pusch-AggregationFactor;

[0247] - In other cases, K=1.

[0248] In enhancement 3, according to some embodiments of the present disclosure, addition 3 is made to the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0. In order to distinguish addition 3 from the content originally contained in the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0, addition 3 is in bold, preceded by the term "(addition 3 starts:)" and followed by the term "(addition 3 ends)".

[0249] Enhancement 3:

[0250] 6.1.2 Resource Allocation

[0251] 6.1.2.1 Resource Allocation in the Time Domain

[0252] …

[0253] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0254] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0255] - Otherwise, if the UE is configured to use pusch-AggregationFactor (add 3 start:) and pusch-TimeDomainAllocationListForMultiPUSCH-r16 is not configured (add 3 end), then the repetition number K is equal to pusch-AggregationFactor;

[0256] - In other cases, K=1.

[0257] For example, enhancement 3 specifies that if the UE is configured to use pusch-AggregationFactor and pusch-TimeDomainAllocationListForMultiPUSCH-r16 is not configured (eg, for the UE), then the repetition number K may be set to pusch-AggregationFactor.

[0258] Enhancement 4 includes additions to 3GPP TS 38.331 V16.2.0. The following quotes refer to the original part of 3GPP TS 38.331 V16.2.0 without adding any Enhancement 4 (some parts of the original part are not included in the quotes):

[0259]

[0260]

[0261] In enhancement 4, according to some embodiments of the present disclosure, addition 4 is made to the original part of 3GPP TS 38.331 V16.2.0. To distinguish addition 4 from the content originally included in the original part of 3GPP TS 38.331 V16.2.0, addition 4 is in bold, preceded by the term "(begin addition 4:)" and followed by the term "(end addition 4)".

[0262] Enhancement 4:

[0263]

[0264] A third concept of the present disclosure is to determine whether to apply a second number corresponding to a time slot aggregation factor based on a first number of SLIVs. For example, determining whether to apply a second number (corresponding to a time slot aggregation factor) is based on the first number of SLIVs. In an example, if the first number of SLIVs is equal to a first defined number (and / or if the first number of SLIVs is a number in a first set of defined numbers), then the second number corresponding to the time slot aggregation factor may be applied. Alternatively and / or in addition, if the first number of SLIVs is equal to a second defined number (and / or if the second number of SLIVs is a number in a second set of defined numbers), then the second number corresponding to the time slot aggregation factor may not be applied.

[0265] In some examples, the first defined number is 1. Alternatively and / or additionally, the first set of defined numbers may include 1.

[0266] In some examples, the first defined number is an integer divisible by the second number corresponding to the time slot aggregation factor (e.g., such that there is no remainder when the first defined number is divided by the second number corresponding to the time slot aggregation factor). Alternatively and / or in addition, the first set of defined numbers may include one or more integers divisible by the second number corresponding to the time slot aggregation factor.

[0267] In an example, if the second number corresponding to the time slot aggregation factor is 2, then the first defined number may be 1. Alternatively and / or additionally, if the second number corresponding to the time slot aggregation factor is 2, then the first set of defined numbers may include 1 and / or one or more integers greater than or equal to 2 (e.g., one or more even numbers).

[0268] Table 1700 associated with the example scenario is in Fig.17 . In some instances, if the UE is not configured to use pusch-AggregationFactor (e.g., associated with PUSCH aggregation / repetition functionality), then the repetition number / aggregation number "K" is equal to one. The repetition number / aggregation number "K" may correspond to an aggregation factor (e.g., a PUSCH aggregation factor) and / or a repetition factor (e.g., a PUSCH repetition factor). If the UE is configured to use pusch-AggregationFactor (e.g., associated with PUSCH aggregation / repetition functionality) and is configured to use a first list (e.g., a multi-TB list associated with a multi-PUSCH functionality) having entries (e.g., at least one entry) indicating multiple SLIVs (e.g., Figure 6600 in the table), then the repetition number / aggregation number "K" of the one entry is 1, and / or the repetition number / aggregation number "K" of the entry is not equal to (and / or is not based on) pusch-AggregationFactor. Alternatively and / or in addition, if the UE is configured to use pusch-AggregationFactor (e.g., associated with PUSCH aggregation / repetition functionality) and is configured to use a first list (e.g., a multi-TB list associated with a multi-PUSCH functionality) having entries (e.g., at least one entry) indicating multiple SLIVs (e.g., Figure 6 600 in the first list), then the repetition number / aggregation number "K" for one or more entries in the list is 1, and / or the UE ignores and / or does not apply the pusch-AggregationFactor to determine the repetition number / aggregation number "K". For one or more entries in the first list indicating a single SLIV (e.g., only one SLIV), the repetition number / aggregation number "K" may be equal to (and / or based on) the pusch-AggregationFactor. If the UE is configured to use the pusch-AggregationFactor and is configured to use the second list (e.g., a single TB list not associated with multi-PUSCH functionality), then the repetition number / aggregation number "K" is equal to (and / or based on) the pusch-AggregationFactor (e.g., for each entry in the second list, the repetition number / aggregation number "K" is equal to and / or based on the pusch-AggregationFactor). Designs similar to the PUSCH design may also be applied in the PDSCH. One or more techniques provided herein with respect to the PUSCH may be applied in the PDSCH.

[0269] Enhancement 5-7 includes additions to section 6.1.2.1 of 3GPP TS 38.214 V16.3.0. The following citation quotes the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 without adding any enhancement 5-7 (some parts of the original part are not included in the citation):

[0270] 6.1.2 Resource Allocation

[0271] 6.1.2.1 Resource Allocation in the Time Domain

[0272] …

[0273] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0274] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0275] - Otherwise, if the UE is configured to use pusch-AggregationFactor, then the number of repetitions K is equal to pusch-AggregationFactor;

[0276] - In other cases, K=1.

[0277] In enhancement 5, according to some embodiments of the present disclosure, addition 5 is made to the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0. In order to distinguish addition 5 from the content originally contained in the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0, addition 5 is in bold, preceded by the term "(begins addition 5:)" and followed by the term "(end of addition 5)".

[0278] Enhancement 5:

[0279] 6.1.2 Resource Allocation

[0280] 6.1.2.1 Resource Allocation in the Time Domain

[0281] …

[0282] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0283] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0284] - Otherwise, if the UE is configured to use pusch-AggregationFactor (add 5 start:) and the DCI indicates a row in PUSCH-TimeDomainResourceAllocationList-r16 (if present) in pusch-Config, where the row indicates resource allocation for one PUSCH (add 5 end), then the repetition number K is equal to pusch-AggregationFactor;

[0285] - In other cases, K=1.

[0286] For example, enhancement 5 provides that if the UE is configured to use pusch-AggregationFactor and the DCI (e.g., received by the UE) indicates a row (e.g., entry) in pusch-TimeDomainAllocationListForMultiPUSCH-r16 indicating resource allocation for one PUSCH (e.g., no more than one PUSCH), then the repetition number K may be set to pusch-AggregationFactor.

[0287] In enhancement 6, according to some embodiments of the present disclosure, addition 6 is made to the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0. In order to distinguish addition 6 from the content originally contained in the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0, addition 6 is in bold, preceded by the term "(begins addition 6:)" and followed by the term "(end of addition 6)".

[0288] Enhancement 6:

[0289] 6.1.2 Resource Allocation

[0290] 6.1.2.1 Resource Allocation in the Time Domain

[0291] …

[0292] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0293] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0294] - Otherwise, if the UE is configured to use pusch-AggregationFactor (starting with adding 5:) and the DCI schedules a PUSCH (ending with adding 6), then the repetition number K is equal to pusch-AggregationFactor;

[0295] - In other cases, K=1.

[0296] For example, enhancement 6 specifies that if the UE is configured to use pusch-AggregationFactor and the DCI (eg, received by the UE) schedules one PUSCH (eg, no more than one PUSCH), then the repetition number K may be set to the pusch-AggregationFactor.

[0297] In enhancement 7, according to some embodiments of the present disclosure, addition 7 is made to the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0. In order to distinguish addition 7 from the content originally contained in the original part of section 6.1.2.1 of 3GPP TS 38.214 V16.3.0, addition 7 is in bold, preceded by the term "(begins addition 7:)" and followed by the term "(end of addition 7)".

[0298] Enhancement 7:

[0299] 6.1.2 Resource Allocation

[0300] 6.1.2.1 Resource Allocation in the Time Domain

[0301] …

[0302] For PUSCH repetition type A, when a PUSCH scheduled by DCI format 0_1 ​​or 0_2 (where the CRC is scrambled by C-RNTI, MCS-C-RNTI, or CS-RNTI with NDI=1) is transmitted in the PDCCH, the repetition number K is determined as

[0303] - If numberOfRepetitions-r16 exists in the resource allocation table, then the number of repetitions K is equal to numberOfRepetitions-r16;

[0304] - Otherwise, if the UE is configured to use pusch-AggregationFactor And DCI is based on pusch-Config The row in PUSCH-TimeDomainResourceAllocationList-r16 (if any) schedules a PUSCH , then the number of repetitions K is equal to the pusch-AggregationFactor;

[0305] - In other cases, K=1.

[0306] For example, enhancement 7 specifies that if the UE is configured to use pusch-AggregationFactor and the DCI (e.g., received by the UE) schedules one PUSCH (e.g., no more than one PUSCH) according to a row (e.g., entry) in pusch-TimeDomainAllocationListForMultiPUSCH-r16, then the repetition number K may be set to the pusch-AggregationFactor.

[0307] Example scenario 1

[0308] The UE receives a configuration from a network (e.g., the configuration is configured by the network) to configure a list of time resource allocations (e.g., the UE is configured to use the list of time resource allocations via the configuration). At least one entry in the list indicates multiple time resource allocations for multiple HARQ process numbers. The UE receives a second configuration from the network (e.g., the second configuration is configured by the network) to configure an aggregation factor (e.g., the UE is configured to use an aggregation factor via the second configuration). The UE receives a DCI indicating an entry in the list (e.g., one entry). The entry indicates one or more time resource allocations totaling the number of time resource allocations. The UE performs transmission or reception at one or more time occasions. An association between each of the one or more time occasions and a TB, a HARQ process number, and / or a time resource allocation is determined based on a pattern.

[0309] In some examples, the value of the aggregation factor is greater than one.

[0310] In some instances, a number of time resource allocations of the one or more time resource allocations indicated by an entry is greater than one.

[0311] In some instances, the UE operates with shared spectrum channel access on a carrier and / or cell.

[0312] In some examples, the pattern length (eg, the number of time opportunities of the pattern) is equal to (and / or based on) the number of time resource allocations of the one or more time resource allocations indicated by the DCI.

[0313] In some instances, the pattern length is equal to (and / or based on) the number of time resource allocations of the one or more time resource allocations indicated by the DCI multiplied by an aggregation factor (i.e., the pattern length is equal to and / or based on the product of the number of time resource allocations and the aggregation factor).

[0314] In some examples, the pattern length is fixed, specified, and / or configured by the network (eg, preconfigured).

[0315] In some examples, a pattern is (and / or includes) the one or more time resource allocations indicated by the DCI being repeated sequentially (e.g., within the one or more time opportunities) until the number of time opportunities of the pattern is equal to the aggregation factor (e.g., Fig.13 In the instance where the one or more time resource allocations are SLIVs and the one or more time opportunities are time slots, relative to option 4).

[0316] In some instances, the pattern is (and / or includes) applying the mth time resource allocation of the one or more time resource allocations at a group of time opportunities, the group of time opportunities including the mth time opportunity of the one or more time opportunities, the nth time opportunity of the one or more time opportunities (where n is equal to m plus the number of time resource allocations), ..., the oth time opportunity of the one or more time opportunities (where o is equal to m plus the product of the number of time resource allocations and a number equal to the aggregation factor minus 1, i.e., o is equal to m + the number of time resource allocations × (aggregation factor - 1)), wherein the group of time opportunities is within the pattern length.

[0317] In some examples, the pattern is (and / or includes) one or more first time resource allocations of the one or more time resource allocations indicated by the DCI are cyclically repeated (e.g., within the one or more time opportunities), e.g. Fig.13 As shown with respect to option 2 in an instance where the one or more time resource allocations are SLIVs and the one or more time opportunities are time slots.

[0318] In some instances, the second number of time resource allocations of the one or more first time resource allocations (of the one or more time resource allocations) is determined based on the pattern length divided by the aggregation factor (e.g., utilizing a round-down operation, such as where a value equal to the pattern length divided by the aggregation factor is rounded down to the nearest integer if it is not an integer).

[0319] In some instances, the pattern length is greater than or equal to the aggregation factor.

[0320] In some instances, the pattern is (and / or includes) applying the mth time resource allocation of the one or more first time resource allocations (of the one or more time resource allocations) at a group of time opportunities, the group of time opportunities including the mth time opportunity of the one or more time opportunities, the nth time opportunity of the one or more time opportunities (where n is equal to m plus a number, such as the second number of time resource allocations), ..., the oth time opportunity of the one or more time opportunities (where o is equal to m plus the product of i and a number, such as the second number of time resource allocations), wherein the group of time opportunities is within the pattern length and wherein i is a positive integer.

[0321] In some examples, the pattern is (and / or includes) a subset of the one or more time resource allocations indicated by the DCI being repeated in sequence (e.g. Fig.13In an instance in which the one or more time resource allocations are SLIVs and the one or more time opportunities are time slots, relative to option 3 and / or option 5), wherein the second number of time resource allocations of the time resource allocation subset is less than or equal to the number of time resource allocations of the one or more time resource allocations.

[0322] In some instances, a time resource allocation subset of the one or more time resource allocations indicated by the DCI includes a first time resource allocation among the one or more time resource allocations, an mth time resource allocation among the one or more time resource allocations (where m is equal to 1 plus the product of i and an aggregation factor, i.e., m is equal to 1+i×aggregation factor), wherein the time resource allocation subset applies to the one or more time opportunities within the pattern length, and wherein i is a positive integer.

[0323] In some instances, the pattern length is greater than or equal to the aggregation factor.

[0324] In some instances, the pattern includes a first time resource allocation among the one or more time resource allocations being repeated from a first time opportunity among the one or more time opportunities to an mth time opportunity among the one or more time opportunities (where m is equal to an aggregation factor), and an nth time resource allocation among the one or more time resource allocations being repeated from the nth time opportunity to a pth time opportunity (where n is equal to 1 plus the product of i and the aggregation factor (i.e., n is equal to 1+i×aggregation factor), and p is equal to 1 plus the product of a number and the aggregation factor (i.e., p is equal to 1+the number×aggregation factor), where the number is equal to i+1) and / or repeating until a pattern length (e.g., i can be a positive integer).

[0325] In some examples, the pattern is (and / or includes) one of the one or more time resource allocations being repeated one or more times, wherein the number of times is equal to the aggregation factor.

[0326] In some examples, the pattern is (and / or includes) each of the one or more time resource allocations being repeated one or more times in sequence, wherein the number of times is equal to the aggregation factor.

[0327] In some instances, the pattern is (and / or includes) the mth time resource allocation corresponding to a set of time opportunities from the nth time opportunity of the one or more time opportunities (where n is equal to 1 plus the product of the aggregation factor and a number, i.e., n is equal to 1+aggregation factor×the number, where the number is equal to m minus 1) to the oth time opportunity (where o is equal to 1 plus the product of the aggregation factor and m, i.e., o is equal to 1+aggregation factor×m), where the set of time opportunities is within the pattern length.

[0328] In some examples, the pattern is (and / or includes) sequential repetition of one or more first time resource allocations of the one or more time resource allocations indicated by the DCI.

[0329] In some instances, the second number of time resource allocations of the one or more first time resource allocations (of the one or more time resource allocations) is determined based on the pattern length divided by the aggregation factor (e.g., utilizing a round-down operation, such as where a value equal to the pattern length divided by the aggregation factor is rounded down to the nearest integer if it is not an integer).

[0330] In some instances, the pattern length is greater than or equal to the aggregation factor.

[0331] In some instances, the pattern is (and / or includes) applying the mth time resource allocation of the one or more first time resource allocations (of the one or more time resource allocations) over a set of time opportunities, the set of time opportunities ranging from the nth time opportunity of the one or more time opportunities (where n is equal to 1 plus the product of the aggregation factor and a number, i.e., n is equal to 1+aggregation factor×the number, where the number is equal to m minus 1) to the pth time opportunity of the one or more time opportunities (where p is equal to 1 plus the product of the aggregation factor and m, i.e., p is equal to 1+aggregation factor×m), where the set of time opportunities is within the pattern length.

[0332] Example scenario 2

[0333] In some instances, the UE receives first information (eg, configuration and / or signal) from the network to configure one or more different time resource allocations for transmitting or receiving different data (eg, different sets of data, such as different TBs).

[0334] Alternatively and / or in addition, the UE may receive second information (e.g., configuration and / or signal) from the network to configure a repetition number (e.g., aggregation factor) for repeatedly transmitting or receiving the same data (e.g., repeatedly transmitting at least one of the same TB, the same MAC PDU, etc.), where the same data may be repeatedly transmitted in the same redundancy version or in different redundancy versions.

[0335] Alternatively and / or in addition, the UE may receive a DCI from the network indicating a first HARQ process (e.g., a specific HARQ process) for data transmission or reception and indicating information associated with one or more time resource allocations (and / or associated with a first number of time resource allocations among the one or more time resource allocations).

[0336] Alternatively and / or in addition, the UE may transmit or receive different groups of data, including a group of data "data 1" to a group of data "data X" (e.g., data 1, data 2, ..., data X), repeatedly using the first HARQ process and one or more other HARQ processes on the one or more time resource allocations with the repetition number.

[0337] In some instances, the UE transmits or receives different sets of data via a data pattern that includes [data 1, data 1, ..., data 2, data 2, ..., data X-1, dataX-1, ..., data X, dataX, ...] or [data 1, data 2, ..., data X, data 1, data 2, ..., data X, data 1, data2, ..., data X, ...].

[0338] In some examples, the repetition number is K, the ID of the first HARQ process is N, and the one or more IDs of the one or more other HARQ processes for the data mode are the values ​​shown in Examples 1, 2, and 3 below (for example, the values ​​shown below can be determined using a modulo operation with a third number, for example, the number of HARQ process numbers supported and / or used by the UE and / or the number of HARQ process numbers that the UE is configured to use):

[0339] Example 1: [N, N, …, N, N+1, N+1, …, N+1, N+2, N+2, …]

[0340] Example 2: [N, N,…, N, N+K, N+K,…, N+K, N+2K, N+2K,…]

[0341] Example 3: [N, N+1, N+2, …, N+X, N, N+1, N+2, …].

[0342] In some examples, the first information and the second information are carried in the same message.

[0343] In some examples, if the total number of data transmissions or receptions is greater than or equal to the first number of time resource allocations, then the one or more time resource allocations indicated by the DCI are used to repeat the data transmissions or receptions.

[0344] Example scenario 3

[0345] The network transmits a first signal to the UE to configure a list of time resource allocations. At least one entry in the list indicates multiple time resource allocations for multiple TBs and / or multiple HARQ process numbers. The network transmits a second signal to the UE to configure an aggregation factor. The network is not configured to configure (e.g., is not allowed to configure, cannot be configured, and / or is prohibited from configuring) an aggregation factor. Alternatively and / or in addition, the network may not be configured to configure the aggregation factor to be greater than one (e.g., is not allowed to configure so, cannot be configured so, and / or is prohibited from configuring so). The network transmits a DCI indicating an entry (e.g., one entry) in the list to the UE, wherein the entry indicates one or more time resource allocations. The network performs reception or transmission at one or more time occasions. The number of time occasions of the one or more time occasions is equal to (and / or based on) the number of time resource allocations of the one or more time resource allocations.

[0346] Example scenario 4

[0347] The UE receives a first configuration from a network to configure a list of time resource allocations. At least one entry in the list indicates multiple time resource allocations for multiple TBs and / or multiple HARQ process numbers. The UE receives a second configuration from the network (or from a second network) to configure an aggregation factor. The UE is not expected to be configured to use an aggregation factor. Alternatively and / or in addition, the UE may not be expected to be configured to use an aggregation factor greater than one. The UE receives a DCI indicating an entry (e.g., one entry) in the list, wherein the entry indicates one or more time resource allocations. The UE performs transmission or reception at one or more time occasions. The number of time occasions of the one or more time occasions is equal to (and / or based on) the number of time resource allocations of the one or more time resource allocations.

[0348] Regarding Example Scenario 3 and Example Scenario 4 In some examples, the network and / or UE operates with shared spectrum channel access on a carrier and / or cell.

[0349] In some examples, the first signal and the second signal are carried in the same message (eg, the same message transmitted to the UE includes the first signal and the second signal).

[0350] In some examples, each TB of the plurality of TBs is transmitted or received at least once by the UE (eg, via the one or more time opportunities).

[0351] In some examples, each TB of the plurality of TBs is transmitted or received by the UE only once (eg, via the one or more time opportunities).

[0352] In some examples, TBs of the plurality of TBs (eg, some and / or all of the plurality of TBs) are transmitted or received by the UE in consecutive time slots in the time domain.

[0353] In some instances, each of the multiple TBs is associated with a time resource allocation in the one or more time resource allocations. For example, each of the multiple TBs may be associated with a different time resource allocation in the one or more time resource allocations. For example, each of the multiple TBs is associated with a time resource allocation in the one or more time resource allocations that is different from other time resource allocations (in the one or more time resource allocations) associated with other TBs in the multiple TBs. For example, a first TB in the multiple TBs may be associated with a first time resource allocation in the one or more time resource allocations, and / or a second TB in the multiple TBs may be associated with a second time resource allocation in the one or more time resource allocations (wherein the second time resource allocation is different from the first time resource allocation), and so on.

[0354] Example Scenario 5

[0355] The UE receives a configuration from the network (e.g., the configuration is configured by the network) to configure a list of time resource allocations (e.g., the UE is configured to use the list of time resource allocations via the configuration). At least one entry in the list indicates multiple time resource allocations for multiple TBs and / or multiple HARQ process numbers. The UE receives a second configuration from the network (e.g., the second configuration is configured by the network) to configure an aggregation factor (e.g., the UE is configured to use an aggregation factor via the second configuration). The UE receives a DCI indicating an entry (e.g., one entry) in the list. The entry indicates one or more time resource allocations totaling to the number of time resource allocations. The UE determines the number of repetitions based on the aggregation factor and the number of time resource allocations (and / or based on other information in addition to the aggregation factor and the number of time resource allocations).

[0356] In some examples, if the number of time resource allocations is the first defined number, then the number of repetitions is consistent with (eg, the number of repetitions is equal to and / or based on) the aggregation factor.

[0357] In some examples, the first defined number is one.

[0358] In some examples, if the number of temporal resource allocations is not the first defined number, then the number of repetitions is 1 and / or is not based on an aggregation factor.

[0359] In some examples, the repetition number corresponds to the number of times the UE transmits data (eg, TB) in response to the DCI.

[0360] In some instances, the UE transmits multiple TBs based on the one or more time resource allocations indicated by the entry.

[0361] In some instances, each of the multiple TBs is associated with a time resource allocation in the one or more time resource allocations. For example, each of the multiple TBs may be associated with a different time resource allocation in the one or more time resource allocations. For example, each of the multiple TBs is associated with a time resource allocation in the one or more time resource allocations that is different from other time resource allocations (in the one or more time resource allocations) associated with other TBs in the multiple TBs. For example, a first TB in the multiple TBs may be associated with a first time resource allocation in the one or more time resource allocations, and / or a second TB in the multiple TBs may be associated with a second time resource allocation in the one or more time resource allocations (wherein the second time resource allocation is different from the first time resource allocation), and so on.

[0362] In some examples, the UE transmits a single TB multiple times or the UE transmits multiple TBs (eg, multiple different TBs), where the number of TBs of the multiple TBs is based on the number of time resource allocations.

[0363] In some examples, if the number of time resource allocations is the first defined number, the UE transmits a single TB multiple times based on the aggregation factor (eg, the UE may transmit a single TB multiple times based on the DCI).

[0364] In some examples, the first defined number is one.

[0365] In some instances, if the number of time resource allocations is not the first defined number, the UE transmits multiple TBs (e.g., multiple different TBs), where the number of TBs of the multiple TBs is based on the number of time resource allocations (e.g., the UE may transmit the multiple TBs based on DCI).

[0366] In some examples, the plurality of TBs are respectively associated with the plurality of time resource allocations. For example, a first TB of the plurality of TBs may be associated with a first time resource allocation of the plurality of time resource allocations (e.g., the first TB may be transmitted via the first time resource allocation), and / or a second TB of the plurality of TBs may be associated with a second time resource allocation of the plurality of time resource allocations (e.g., the second TB may be transmitted via the second time resource allocation), and so on.

[0367] In some instances, in response to (and / or based on) the DCI and / or the one or more time resource allocations indicated by the entry, either the UE transmits (or receives) a single TB multiple times, or the UE transmits multiple TBs.

[0368] In some instances, when the number of time resource allocations is the first defined number, the UE transmits or receives a single TB multiple times, wherein the number of times (the single TB is transmitted or received) is equal to (and / or based on) an aggregation factor.

[0369] In some examples, the first defined number is one.

[0370] In some examples, when the number of time resource allocations is not the first defined number, the UE transmits a plurality of TBs, wherein the number of TBs of the plurality of TBs is equal to the number of time resource allocations.

[0371] In some examples, a UE performs transmission or reception at one or more time occasions.

[0372] In some examples, if the number of time resource allocations (of the one or more time resource allocations indicated by an entry) is a first defined number, then the number of time opportunities of the one or more time opportunities is equal to (and / or based on) an aggregation factor.

[0373] In some examples, the first defined number is one.

[0374] In some examples, if the number of time resource allocations indicated by the entry is not the first defined number, then the number of time opportunities of the one or more time opportunities is not equal to (and / or is not based on) the aggregation factor.

[0375] In some examples, if the number of time resource allocations indicated by the entry is not the first defined number, then the number of time opportunities of the one or more time opportunities is equal to (and / or based on) the number of aggregation factors.

[0376] In some examples, the UE performs transmission or reception at one or more time opportunities, wherein a number of time opportunities of the one or more time opportunities is determined based on a number of time resource allocations or an aggregation factor.

[0377] In some examples, when the number of time resource allocations indicated by the entry is a first defined number, the number of time opportunities is equal to (and / or based on) the aggregation factor.

[0378] In some examples, the first defined number is one.

[0379] In some examples, when the number of time resource allocations indicated by the entry is not the first defined number, the number of time opportunities is equal to (and / or based on) the number of time resource allocations.

[0380] In some examples, the UE performs transmission or reception on one or more time occasions, wherein whether the one or more time occasions are associated with a single HARQ process number or multiple HARQ process numbers is based on the number of time resource allocations.

[0381] In some examples, the one or more time opportunities are associated with a number and / or an aggregation factor of time resource allocations.

[0382] In some instances, the one or more time opportunities are associated with a single HARQ process number (e.g., each of the one or more time opportunities corresponds to the single HARQ process number), different time opportunities (e.g., among the one or more time opportunities) are associated with a single TB (e.g., each of the different time opportunities corresponds to the same TB), and / or the number of time opportunities of the one or more time opportunities is equal to (and / or based on) an aggregation factor.

[0383] In some instances, when the number of time resource allocations is a first defined number, the one or more time opportunities are associated with a single HARQ process number (e.g., each of the one or more time opportunities corresponds to the single HARQ process number), different time opportunities (e.g., among the one or more time opportunities) are associated with a single TB (e.g., each of the different time opportunities corresponds to the same TB), and / or the number of time opportunities of the one or more time opportunities is equal to (and / or based on) an aggregation factor.

[0384] In some instances, the one or more time opportunities are associated with multiple HARQ process numbers, different time opportunities (e.g., among the one or more time opportunities) are associated with multiple TBs (e.g., the different time opportunities are associated with different TBs, for example, wherein a first time opportunity among the different time opportunities is associated with a first TB and a second time opportunity among the different time opportunities is associated with a second TB), and / or the number of time opportunities of the one or more time opportunities is equal to (and / or based on) the number of time resource allocations.

[0385] In some instances, when the number of time resource allocations is not a first defined number, the one or more time opportunities are associated with multiple HARQ process numbers, different time opportunities (e.g., among the one or more time opportunities) are associated with multiple TBs (e.g., the different time opportunities are associated with different TBs, for example, wherein a first time opportunity among the different time opportunities is associated with a first TB and a second time opportunity among the different time opportunities is associated with a second TB), and / or the number of time opportunities of the one or more time opportunities is equal to (and / or based on) the number of time resource allocations.

[0386] In some examples, the first defined number is one.

[0387] In some examples, the number of time resource allocations not being the first defined number means that the number of time resource allocations is greater than the first defined number.

[0388] In some examples, the first defined number is equal to a number (e.g., an integer) divided by the number of time resource allocations (of the one or more time resource allocations). In some examples, the first defined number is an integer (e.g., the number can be divided by the number of time resource allocations and a first defined number without a remainder is determined by a rounding up operation or a rounding down operation). Alternatively and / or in addition, the first defined number may include a set of defined numbers (e.g., wherein each defined number in the set of defined numbers is an integer).

[0389] In some instances, the UE performs retransmissions on one or more time occasions, wherein whether the one or more time occasions are associated with a single HARQ process number or multiple HARQ process numbers is based on a number of time resource allocations of the one or more time resource allocations.

[0390] In some instances, the one or more time opportunities are associated with a first HARQ process number (e.g., each of the one or more time opportunities corresponds to the first HARQ process number). For example, when the number of time resource allocations is one, the one or more time opportunities are associated with the first HARQ process number (e.g., when the number of time resource allocations is one, each of the one or more time opportunities corresponds to the first HARQ process number).

[0391] In some instances, the one or more time opportunities are associated with a plurality of HARQ process numbers, wherein the plurality of HARQ process numbers include a first HARQ process number (e.g., at least one of the one or more time opportunities corresponds to the first HARQ process number). For example, when the number of time resource allocations is one, the one or more time opportunities are associated with a plurality of HARQ process numbers, wherein the plurality of HARQ process numbers include a first HARQ process number (e.g., at least one of the one or more time opportunities corresponds to the first HARQ process number).

[0392] In some instances, the one or more time opportunities are associated with a plurality of HARQ process numbers, wherein the plurality of HARQ process numbers include a second HARQ process number (e.g., at least one of the one or more time opportunities corresponds to the second HARQ process number). For example, when the number of time resource allocations is one, the one or more time opportunities are associated with a plurality of HARQ process numbers, wherein the plurality of HARQ process numbers include a second HARQ process number (e.g., at least one of the one or more time opportunities corresponds to the second HARQ process number).

[0393] One, some and / or all of the above-mentioned techniques and / or embodiments may be formed into new embodiments.

[0394] In some examples, the embodiments disclosed herein may be implemented independently and / or individually, such as the embodiments described with respect to the first concept, the second concept, the third concept, example scenario 1, example scenario 2, example scenario 3, example scenario 4, and example scenario 5. Alternatively and / or additionally, a combination of the embodiments described herein may be implemented, such as a combination of the embodiments described with respect to the first concept, the second concept, the third concept, example scenario 1, example scenario 2, example scenario 3, example scenario 4, and / or example scenario 5. Alternatively and / or additionally, a combination of the embodiments described herein may be implemented in parallel and / or simultaneously, such as a combination of the embodiments described with respect to the first concept, the second concept, the third concept, example scenario 1, example scenario 2, example scenario 3, example scenario 4, and / or example scenario 5.

[0395] The various techniques, embodiments, methods and / or alternatives of the present disclosure may be performed independently and / or individually. Alternatively and / or in addition, the various techniques, embodiments, methods and / or alternatives of the present disclosure may be combined and / or implemented using a single system. Alternatively and / or in addition, the various techniques, embodiments, methods and / or alternatives of the present disclosure may be implemented in parallel and / or simultaneously.

[0396] With respect to one or more embodiments herein, such as one or more techniques, apparatuses, concepts, methods, example scenarios, and / or alternatives described above, in some instances, the UE receives a DCI in time slot n, and / or the DCI indicates a time slot offset.

[0397] With respect to one or more embodiments herein, in some instances, if the number of time resource allocations is greater than one, then the time slot offset may indicate a time slot of an initial scheduled time opportunity associated with a first time resource allocation among the one or more time resource allocations (e.g., multiple time resource allocations) indicated by a DCI (e.g., an entry in a DCI indication list that includes the one or more time resource allocations).

[0398] With respect to one or more embodiments herein, in some instances, if the number of time resource allocations is one (e.g., if the one or more time resource allocations include only a single time resource allocation), then the time slot offset may indicate a time slot of an initial scheduled time opportunity associated with the single time resource allocation indicated by the DCI.

[0399] With respect to one or more embodiments herein, in some instances, a time resource allocation (e.g., one time resource allocation) corresponds to a starting OFDM symbol, an OFDM symbol length (e.g., a consecutive OFDM symbol length), and / or a mapping type. In an instance, the OFDM symbol length may be the number of one or more OFDM symbols corresponding to the time resource allocation.

[0400] With respect to one or more embodiments herein, in some instances, a time opportunity may be a time slot, a mini-slot, a resource associated with a time resource allocation (eg, a time resource allocation), a PUSCH, or a PDSCH.

[0401] With respect to one or more embodiments herein, in some instances, a time resource allocation (e.g., a time resource allocation) corresponds to a SLIV index / number (e.g., a SLIV index / number, such as a SLIV index corresponding to a SLIV and / or a SLIV number corresponding to a SLIV).

[0402] With respect to one or more embodiments herein, in some instances, a time resource allocation (eg, a time resource allocation) indicates one or more symbols (eg, one or more consecutive symbols) in a time slot.

[0403] With respect to one or more embodiments herein, in some instances, a time resource allocation (eg, one time resource allocation) is indicated (eg, represented) by the number of bits of a field (eg, startSymbolAndLength or startSymbolAndLength-r16).

[0404] With respect to one or more embodiments herein, in some examples, there are 105 time resource allocations (eg, 105 candidate time resource allocations) within a time slot.

[0405] With respect to one or more embodiments herein, in some instances, the number of bits is 7.

[0406] With respect to one or more embodiments herein, in some instances, a time resource allocation list is used to indicate time resource allocations for uplink or downlink transmissions.

[0407] With respect to one or more embodiments herein, in some examples, each entry in the time resource allocation list indicates (eg, includes) at most a maximum number of time resource allocations. In an example, the maximum number of time resource allocations is eight.

[0408] With respect to one or more embodiments herein, in some instances, the DCI indicates a first HARQ process number (eg, a specific HARQ process number).

[0409] With respect to one or more embodiments herein, in some instances, the first HARQ process number corresponds to one or more time opportunities in the time domain including an initial time opportunity (eg, an initial time opportunity among one or more time opportunities scheduled by DCI).

[0410] With respect to one or more embodiments herein, in some instances, the initial time opportunity corresponds to a time resource allocation indicated by an entry (eg, the one entry), such as an initial time resource allocation indicated by the entry.

[0411] With respect to one or more embodiments herein, in some instances, the mth time resource allocation of the one or more time resource allocations indicated by the DCI corresponds to a HARQ process number equal to the first HARQ process number+m-1.

[0412] With respect to one or more embodiments herein, in some instances, one or more operations (e.g., at least one of an addition operation, a subtraction operation, etc.) associated with determining a HARQ process number may apply a modulo operation of g. For example, in an instance in which the HARQ process number is described as being equal to a certain number, the HARQ process number may be equal to the number modulo g. For example, if the HARQ process number is described herein as being equal to the first HARQ process number + m-1, then the HARQ process number may be equal to (first HARQ process number + m-1) modulo g. In an instance in which the first HARQ process number = 15, m = 3, and g = 16, the HARQ process number (described herein as being equal to the first HARQ process number + m-1) may be determined using a modulo operation and may be equal to (15+3-1) modulo 16 = 1.

[0413] With respect to one or more embodiments herein, in some instances, g corresponds to the number of HARQ processes, such as the total number of HARQ processes supported and / or used by the UE and / or the total number of HARQ processes that the UE is configured to use (e.g., the number of HARQ processes that the UE can process, and / or the number of HARQ processes that the UE can process simultaneously). In an instance, g corresponds to the number of HARQ process numbers, such as the total number of HARQ process numbers supported and / or used by the UE and / or the total number of HARQ process numbers that the UE is configured to use (e.g., the number of HARQ process numbers that the UE can process, and / or the number of HARQ process numbers that the UE can process simultaneously).

[0414] With respect to one or more embodiments herein, in some instances, g (eg, the number of HARQ processes and / or the number of HARQ process numbers) is equal to 16.

[0415] With respect to one or more embodiments herein, in some instances, an aggregation factor is associated with (e.g., used for) consecutive transmissions, consecutive time opportunities, and / or consecutive time slots for transmitting a single TB. For example, the aggregation factor may be associated with (e.g., used for) the number of consecutive transmissions of the consecutive transmissions configured (e.g., to be used for transmitting the single TB), the number of consecutive time opportunities of the consecutive time opportunities (e.g., to be used for transmitting the single TB), and / or the number of consecutive time slots of the consecutive time slots (e.g., to be used for transmitting the single TB).

[0416] With respect to one or more embodiments herein, in some instances, the aggregation factor is associated with (eg, for) time slot aggregation and / or transmission aggregation of a single TB.

[0417] With respect to one or more embodiments herein, in some instances, an aggregation factor is used for downlink transmissions or uplink transmissions.

[0418] With respect to one or more embodiments herein, in some instances, the value of the aggregation factor is a number (eg, an integer) greater than 1. In an example, the aggregation factor is equal to 2. r , where r is an integer greater than 0 (eg, the aggregation factor may be one of 2, 4, 8, etc.).

[0419] With respect to one or more embodiments herein, in some examples, the aggregation factor is updated based on a radio resource control (RRC) signaling.

[0420] With respect to one or more embodiments herein, in some instances, an entry of a list (eg, each entry in the list) does not include parameters for configuring an aggregation factor.

[0421] With respect to one or more embodiments herein, in some instances, each entry in the list does not indicate an aggregation factor.

[0422] With respect to one or more embodiments herein, in some instances, if an entry of the list includes one or more parameters for configuring the aggregation factor and / or if the aggregation factor is indicated by one or more entries in the list, then the network is limited to (e.g., constrained to) configuring the aggregation factor to one.

[0423] With respect to one or more embodiments herein, in some instances, if an entry of a list includes one or more parameters for configuring an aggregation factor and / or if an aggregation factor is indicated by one or more entries in the list, then the network does not configure the aggregation factor (e.g., for the UE).

[0424] With respect to one or more embodiments herein, in some instances, if an entry of a list includes one or more parameters for configuring an aggregation factor and / or if an aggregation factor is indicated by one or more entries in the list, then the network may cause one or more parameters (e.g., associated with the aggregation factor) to be absent (e.g., the network may not include the one or more parameters in the configuration of the UE).

[0425] With respect to one or more embodiments herein, in some instances, after the aggregation factor is configured (e.g., after the aggregation factor is configured and / or in response to the aggregation factor being configured), based on different entries indicated by the DCI, the number of repetitions of a single TB and / or the number of repetitions of a single time resource allocation remains unchanged (e.g., cannot be changed), wherein the number of time resource allocations of the one or more time resource allocations indicated by the DCI may be 1.

[0426] With respect to one or more embodiments herein, in some instances, an initial time opportunity (e.g., an initial time opportunity among one or more time opportunities scheduled by DCI) corresponds to time slot n+time slot offset (e.g., the time slot offset may be "k2") (e.g., including time slot n+time slot offset and / or within time slot n+time slot offset).

[0427] With respect to one or more embodiments herein, in some instances, the one or more time opportunities correspond to time slots including time slot n+time slot offset, time slot n+time slot offset+1, ..., time slot n+time slot offset+aggregation factor-1 (e.g., including the time slot and / or within the time slot) (e.g., the one or more time opportunities may correspond to consecutive time slots from time slot n+time slot offset to time slot n+time slot offset+aggregation factor-1).

[0428] With respect to one or more embodiments herein, in some instances, the one or more time opportunities correspond to time slot n+time slot offset, time slot n+time slot offset+1, ..., time slot n+time slot offset+time resource allocation number-1 (e.g., the time resource allocation number is the time resource allocation number of the one or more time resource allocations indicated by the DCI) (e.g., including them and / or within them). For example, the one or more time opportunities may correspond to consecutive time slots from time slot n+time slot offset to time slot n+time slot offset+time resource allocation number-1.

[0429] With respect to one or more embodiments herein, in some instances, the DCI is scrambled with a cell radio network temporary identifier (C-RNTI) of the UE.

[0430] With respect to one or more embodiments herein, in some instances, the DCI indicates one or more new transmissions of one or more TBs. The new transmissions may be initial transmissions of data and / or transmissions of data that are not retransmissions of data.

[0431] With respect to one or more embodiments herein, in some instances, a DCI indicates one or more transmissions of one or more TBs, wherein the one or more transmissions of the one or more TBs may be one or more new transmissions of the one or more TBs or one or more retransmissions of the one or more TBs. In an example, the DCI indicates four SLIVs (e.g., the DCI indicates entries indicating four SLIVs), and a first HARQ process number equal to 3 (e.g., a specific HARQ process). In the example, the HARQ process numbers {3, 4, 5, 6} may be associated with the four SLIVs, respectively. In some instances, whether the one or more transmissions are one or more new transmissions or one or more retransmissions is determined based on one or more new data indicator (NDI) values. The number of NDI values ​​of the one or more NDI values ​​may be equal to (and / or based on) the number of SLIVs (e.g., based on the number of SLIVs being four, the number of NDI values ​​may be four). The one or more NDI values ​​are associated with the HARQ process numbers {3, 4, 5, 6}, respectively. For example, each of the one or more NDI values ​​may be associated with a HARQ process number among HARQ process numbers {3, 4, 5, 6} (eg, the NDI value may indicate whether the HARQ process number associated with the NDI value is for a new transmission or for a retransmission).

[0432] Regarding one or more embodiments herein, in some instances, regarding Figure 6 600 (e.g., entry 5), the network may configure the SLIVs to be 0 to 105. For example, although the four SLIVs in entry 5 of list 600 are Figure 6 5 are shown as being connected to each other (eg, the four SLIVs in entry 5 include {70, 71, 72, 73}), but the SLIVs of entry 5 are not limited to being connected SLIVs.

[0433] With respect to one or more embodiments herein, in some instances, for uplink transmissions in an unlicensed spectrum, the uplink transmission may include (e.g., deliver and / or carry) uplink control information (UCI).

[0434] With respect to one or more embodiments herein, in some instances, the UCI indicates an NDI, a HARQ process number, and / or a redundancy version (RV) index associated with an uplink transmission.

[0435] With respect to one or more embodiments herein, in some instances, the network indicates a portion of the occupied time to one or more UEs such that the one or more UEs perform uplink transmission during the portion of the occupied time.

[0436] With respect to one or more embodiments herein, in some instances, a bandwidth part (BWP) on a carrier includes one or more contiguous LBT bandwidths on the carrier.

[0437] With respect to one or more embodiments herein, in some instances, the LBT bandwidth (eg, an LBT bandwidth) is 20 MHz.

[0438] Throughout this disclosure, if a first number is equal to a second number, then this may mean that the first number is the same as the second number.For example, if the number of time resource allocations is equal to a defined number, then the number of time resource allocations may be the same as the defined number.

[0439] Throughout this disclosure, if the first number is the second number, then this may mean that the first number is equal to the second number.For example, if the number of time resource allocations is a defined number, then the number of time resource allocations may be equal to the defined number.

[0440] Throughout this disclosure, one, some and / or all instances of "equal" may be replaced with "equivalent".

[0441] Fig.181800 is a flowchart according to an exemplary embodiment from the perspective of a UE. In step 1805, the UE receives from a network first information associated with one or more first time resource allocations configured for one or more data transmissions or one or more data receptions. In an example, the one or more data transmissions may include different data transmissions (e.g., the one or more data transmissions may include transmissions of different data sets). In an example, the one or more data receptions may include different data receptions (e.g., the one or more data receptions may include receptions of different data sets). In an example, the UE is configured to use the one or more first time resource allocations via the first information. In step 1810, the UE receives from the network second information associated with a number of repetitions (e.g., aggregation factor) configured for repeated transmission of the same data set (e.g., repeated transmission of the same data set) or repeated reception of the same data set (e.g., repeated reception of the same data set). In an example, the same data set is (and / or includes) at least one of a TB, a MAC PDU, etc. In an example, the repeated transmission or repeated reception is performed with the same redundancy version. In an example, the repeated transmission or repeated reception is performed with different redundancy versions. In step 1815, the UE receives a DCI from the network, wherein the DCI indicates a first HARQ process (e.g., a specific HARQ process) for data transmission or data reception, and indicates information associated with the one or more first time resource allocations and / or associated with a first number of time resource allocations in the one or more first time resource allocations. In an example, the information (indicated by the DCI) includes the one or more first time resource allocations (e.g., the DCI indicates the one or more first time resource allocations). In step 1820, based on the repetition number, the UE repeatedly transmits or receives different data sets on the one or more first time resource allocations according to a certain mode (e.g., a data transmission mode or a data reception mode). In an example, the number of times the UE transmits or receives a data set in the different data sets (and / or the number of times the UE transmits or receives each data set in the different data sets) is equal to the repetition number.

[0442] In one embodiment, the different data sets include data 1 to X. In an instance where X=3 (eg, the number of data sets of the different data sets is 3), the different data sets may include a first data set "data 1", a second data set "data 2", and a third data set "data 3".

[0443] In one embodiment, the pattern is [data 1, data 1, ..., data 2, data 2, ..., data X-1, data X-1, ..., data X, data X, ...]. In an instance where X=2 (e.g., the number of data sets of the different data sets is 2), the pattern may be [data 1, data 1, ..., data 2, data 2, ...]. In an instance where X=3 (e.g., the number of data sets of the different data sets is 3), the pattern may be [data 1, data 1, ..., data2, data 2, ..., data3, data 3, ...]. For example, the pattern may be [p repetitions of data 1, p repetitions of data 2, ..., p repetitions of data X-1, p repetitions of data X]. In an instance where p=2 and X=3, the pattern may be [data 1, data 1, data 2, data 2, data 3, data 3]. In an example where p=3 and X=3, the pattern may be [data 1, data 1, data 1, data 2, data 2, data 2, data 3, data 3, data 3]. In an example, p may be the number of repetitions.

[0444] In an instance where the pattern is [data 1, data 1, data 2, data 2, data 3, data 3], the transmission or reception of the different data sets (of step 1820) may include the transmission or reception of data set "data 1", followed by the transmission or reception of data set "data 1", followed by the transmission or reception of data set "data 2", followed by the transmission or reception of data set "data 2", followed by the transmission or reception of data set "data 3", followed by the transmission or reception of data set "data 3".

[0445] In one embodiment, the pattern is [data 1, data 2, ..., data X-1, data X, data1, data2, ...]. In an instance where X=2 (e.g., the number of data sets of the different data sets is 2), the pattern may be [data 1, data 2, data 1, data 2, ...]. In an instance where X=3 (e.g., the number of data sets of the different data sets is 3), the pattern may be [data 1, data2, data 3, data 1, data 2, data 3, ...]. For example, the pattern may be p repetitions of [data 1, data 2, ..., data X-1, data X]. In an instance where p=2 and X=3, the pattern may be [data1, data 2, data 3, data 1, data 2, data 3]. In an instance where p=3 and X=3, the pattern may be [data 1, data 2, data 3, data 1, data 2, data 3, data 1, data 2, data3]. In an example, p can be the number of repetitions.

[0446] In one embodiment, the number of repetitions is K, and the ID of the first HARQ process (e.g., a HARQ process number) is N, wherein the ID of the HARQ process for transmission or reception of the different data sets according to the mode is the value shown below in HARQ process ID mode 1, HARQ process ID mode 2, HARQ process ID mode 3, HARQ process ID mode 4, HARQ process ID mode 5 and / or HARQ process ID mode 6 (e.g., at least some of the values ​​shown below can be determined using a modulo operation with a second number, wherein the second number is, for example, the number of HARQ process IDs supported and / or used by the UE and / or the number of HARQ process IDs configured for use by the UE, for example, wherein the value "N+1" of the value shown below is equal to (N+1) modulo R, where R is the second number):

[0447] HARQ process ID mode 1: [N, N, ..., N, N+1, N+1, ..., N+1, N+2, N+2, ...]

[0448] HARQ process ID mode 2: [K repetitions of N, K repetitions of N+1, K repetitions of N+2, ...]

[0449] HARQ process ID mode 3: [N, N, …, N, N+K, N+K, …, N+K, N+2K, N+2K, …]

[0450] HARQ process ID mode 4: [K repetitions of N, K repetitions of N+K, K repetitions of N+2K, ...]

[0451] HARQ process ID mode 5: [N, N+1, N+2, ..., N+X, N, N+1, N+2, ...]

[0452] HARQ process ID mode 6: K repetitions of [N, N+1, N+2, ..., N+X]

[0453] In one embodiment, the first information and the second information are carried in the same message (eg, the same message includes the first information and the second information).

[0454] In one embodiment, if the total number of data transmissions or the total number of data receptions of the data transmissions is greater than or equal to the first number of time resource allocations, then the one or more first time resource allocations are used to repeatedly perform the data transmission or data reception indicated by the DCI.

[0455] Return to reference Figure 3 and 4 In an exemplary embodiment of the UE, the apparatus 300 includes a program code 312 stored in the memory 310. The CPU 308 can execute the program code 312 to enable the UE to: (i) receive first information associated with one or more first time resource allocations configured for one or more data transmissions or one or more data receptions from the network, (ii) receive second information associated with a repetition number (e.g., an aggregation factor) configured for repeated transmission of the same data set (e.g., repeatedly transmitting the same data set) or repeated reception of the same data set (e.g., repeatedly receiving the same data set) from the network, (iii) receive a DCI indicating a first HARQ process (e.g., a specific HARQ process) for data transmission or data reception and indicating information associated with the one or more first time resource allocations and / or associated with a first number of time resource allocations in the one or more first time resource allocations from the network, and (iv) repeatedly transmit or receive different data sets on the one or more first time resource allocations according to a certain mode (e.g., a data transmission mode or a data reception mode) based on the repetition number. Furthermore, CPU 308 may execute program code 312 to perform one, some, and / or all of the actions and steps described above and / or other actions and steps described herein.

[0456] Fig.191900 is a flowchart according to an exemplary embodiment from the perspective of the network. In step 1905, the network transmits a message associated with a PDSCH parameter configuration to the UE (e.g., a message for configuring one or more PDSCH parameters). The network is not allowed to include the first parameter and the second parameter in parallel (e.g., at the same time) in the message. For example, the network is not allowed to configure the message to include the first parameter and the second parameter in parallel (e.g., at the same time). For example, the network is not configured to include the first parameter and the second parameter in parallel (e.g., at the same time) in the message and / or the network cannot and / or is prohibited from including the first parameter and the second parameter in parallel (e.g., at the same time) in the message. For example, the network may not include the first parameter and the second parameter in parallel (e.g., at the same time) in the message. The message includes the first parameter or the second parameter. For example, the message includes only a single parameter of the first parameter and the second parameter, and the message does not include the first parameter and the second parameter at the same time. In some instances, the message includes one or more parameters (not the single parameter) and / or information other than the single parameter (e.g., the single parameter is the first parameter or the second parameter). In the example, the message includes the first parameter but not the second parameter. In an example, the message includes a second parameter but does not include the first parameter. The first parameter indicates (e.g., configures) a list of entries associated with time resource allocations for multiple PDSCHs. In an example, the UE can be configured to use the list of entries using the first parameter. The second parameter can indicate (e.g., configure) an aggregation factor. In an example, the aggregation factor can be configured for the UE using the second parameter. The second parameter configures and / or indicates the aggregation factor. In step 1910, the network transmits a DCI indicating a first entry in the list, wherein the first entry indicates one or more time resource allocations. In step 1915, the network performs one or more transmissions at one or more time opportunities, wherein the number of time opportunities for the one or more time opportunities is based on the number of time resource allocations for the one or more time resource allocations. In an example, the number of time opportunities is equal to the number of time resource allocations. In an example, the network performs the one or more transmissions to the UE.

[0457] In one embodiment, the network operates with shared spectrum channel access on a carrier and / or cell. For example, the network operates with shared spectrum channel access on a carrier and / or cell during a time period when the network transmits a message, transmits DCI, and / or performs the one or more transmissions.

[0458] In one embodiment, the message is a RRC message.

[0459] In one embodiment, for each TB in a plurality of TBs, the one or more transmissions include transmission of the TB. For example, each TB in a plurality of TBs is transmitted at least once via the one or more transmissions. Alternatively and / or in addition, each TB in a plurality of TBs is transmitted only once via the one or more transmissions.

[0460] In one embodiment, the one or more transmitting include transmitting TBs of the plurality of TBs (eg, all TBs of the plurality of TBs) in consecutive time slots (eg, time slots adjacent to each other) in the time domain.

[0461] In one embodiment, each TB in a plurality of TBs is associated with a time resource allocation in the one or more time resource allocations. For example, the one or more time resource allocations may include a plurality of time resource allocations, wherein a TB in a plurality of TBs (e.g., all TBs in a plurality of TBs) is respectively associated with a time resource allocation in the plurality of time resource allocations (e.g., each TB in a plurality of TBs is respectively associated with each time resource allocation in the plurality of time resource allocations). In an example, each TB in a plurality of TBs may be associated with a different time resource allocation in the plurality of time resource allocations. For example, each TB in a plurality of TBs is associated with a time resource allocation in the plurality of time resource allocations that is different from other time resource allocations (in the plurality of time resource allocations) associated with other TBs in the plurality of TBs. For example, a first TB in a plurality of TBs may be associated with a first time resource allocation in the plurality of time resource allocations, and / or a second TB in a plurality of TBs may be associated with a second time resource allocation in the plurality of time resource allocations (wherein the second time resource allocation is different from the first time resource allocation), and so on.

[0462] In one embodiment, a time resource allocation (eg, one time resource allocation) of the one or more time resource allocations corresponds to a starting OFDM symbol, a consecutive OFDM symbol length, and / or a mapping type.

[0463] In one embodiment, a time opportunity among the one or more time opportunities (and / or each time opportunity among the one or more time opportunities) is a time slot, a mini-time slot, a resource associated with a time resource allocation (e.g., one time resource allocation) among the one or more time resource allocations, and / or a PDSCH.

[0464] In one embodiment, a time resource allocation (e.g., a time resource allocation) in the one or more time resource allocations corresponds to a SLIV. For example, the time resource allocation may correspond to a SLIV index / number (e.g., a SLIV index / number, such as a SLIV index corresponding to the SLIV and / or a SLIV number corresponding to the SLIV).

[0465] In one embodiment, a time resource allocation (eg, one time resource allocation) of the one or more time resource allocations corresponds to a SLIV and a mapping type.

[0466] In one embodiment, a time resource allocation in the one or more time resource allocations (e.g., one time resource allocation) indicates one or more symbols (e.g., one or more consecutive symbols) in a time slot (e.g., a transmission in the one or more transmissions may be performed via the one or more symbols based on the time resource allocation).

[0467] In one embodiment, the list is associated with a time resource allocation for downlink transmissions. For example, the list may be used to indicate a time resource allocation for downlink transmissions.

[0468] In one embodiment, each entry in the list indicates (eg, includes) a maximum threshold number of time resource allocations. In an example, the threshold number of time resource allocations is eight.

[0469] In one embodiment, the time resource allocations in the one or more time resource allocations (e.g., all time resource allocations in the one or more time resource allocations) correspond to different starting OFDM symbols, different consecutive OFDM symbol lengths, and / or different mapping types. For example, the one or more time resource allocations may include multiple time resource allocations, wherein the time resource allocations in the multiple time resource allocations (e.g., all time resource allocations in the multiple time resource allocations) correspond to different starting OFDM symbols, different consecutive OFDM symbol lengths, and / or different mapping types. In an instance, each time resource allocation in the multiple time resource allocations corresponds to a different (e.g., unique) starting OFDM symbol, a different (e.g., unique) consecutive OFDM symbol length, and / or a different (e.g., unique) mapping type. For example, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a starting OFDM symbol different from other starting OFDM symbols corresponding to other time resource allocations in the multiple time resource allocations. Alternatively and / or in addition, a time resource allocation in the plurality of time resource allocations (and / or each of the plurality of time resource allocations) may correspond to a continuous OFDM symbol length different from other continuous OFDM symbol lengths corresponding to other time resource allocations in the plurality of time resource allocations.Alternatively and / or in addition, a time resource allocation in the plurality of time resource allocations (and / or each of the plurality of time resource allocations) may correspond to a mapping type different from other mapping types corresponding to other time resource allocations in the plurality of time resource allocations.

[0470] In one embodiment, the time resource allocations in the one or more time resource allocations (e.g., all time resource allocations in the one or more time resource allocations) correspond to the same starting OFDM symbol, the same continuous OFDM symbol length, and / or the same mapping type. For example, each time resource allocation in the one or more time resource allocations corresponds to the same starting OFDM symbol, the same continuous OFDM symbol length, and / or the same mapping type.

[0471] In one embodiment, the time resource allocations in the one or more time resource allocations (e.g., all time resource allocations in the one or more time resource allocations) correspond to different time slots and / or different time opportunities. For example, the one or more time resource allocations may include multiple time resource allocations, wherein the time resource allocations in the multiple time resource allocations (e.g., all time resource allocations in the multiple time resource allocations) correspond to different time slots and / or different time opportunities. In an example, each time resource allocation in the multiple time resource allocations corresponds to a different (e.g., unique) time slot and / or a different (e.g., unique) time opportunity. For example, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a time slot different from other time slots corresponding to other time resource allocations in the multiple time resource allocations. Alternatively and / or in addition, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a time opportunity different from other time opportunities corresponding to other time resource allocations in the multiple time resource allocations.

[0472] In one embodiment, the aggregation factor is associated with consecutive transmissions, consecutive time opportunities, and / or consecutive time slots configured for transmitting a single TB (e.g., for the configuration). For example, the aggregation factor may be associated with the number of transmissions configured for consecutive transmissions of the single TB, the number of time opportunities for consecutive time opportunities for transmitting the single TB multiple times, and / or the number of time slots for consecutive time slots for transmitting the single TB multiple times (e.g., for the configuration).

[0473] In one embodiment, the aggregation factor is associated with (eg, for) a timeslot aggregation and / or a transmission aggregation of a single TB.

[0474] In one embodiment, the aggregation factor is associated with downlink transmissions (eg, for uplink transmissions).

[0475] In one embodiment, the aggregation factor is updated based on RRC signaling (eg, the aggregation factor may be updated by setting the aggregation factor to a value indicated by RRC signaling).

[0476] Return to reference Figure 3 and 4In an exemplary embodiment of the network, the apparatus 300 includes program code 312 stored in the memory 310. The CPU 308 can execute the program code 312 to enable the network to: (i) transmit a message associated with a PDSCH parameter configuration to the UE, wherein the network is not allowed to include a first parameter and a second parameter in parallel in the message, wherein the message includes the first parameter or the second parameter, wherein the first parameter indicates a list of entries associated with time resource allocations for multiple PDSCHs, and wherein the second parameter indicates an aggregation factor, (ii) transmit a DCI indicating a first entry in the list, wherein the first entry indicates one or more time resource allocations, and (iii) perform one or more transmissions on one or more time occasions, wherein the time opportunity number of the one or more time occasions is based on the time resource allocation number of the one or more time resource allocations. In addition, the CPU 308 can execute the program code 312 to perform one, some and / or all of the above actions and steps and / or other actions and steps described herein.

[0477] Fig. 202000 is a flowchart according to an exemplary embodiment from the perspective of a UE. In step 2005, the UE receives a configuration from a network to configure a list associated with a plurality of PDSCH time resource allocations (e.g., a time resource allocation list). In an example, the UE is configured to use a list via the configuration (e.g., the configuration may indicate a list). The list includes a first entry and a second entry (and / or one or more other entries in addition to the first entry and the second entry). The first entry indicates a plurality of time resource allocations without repetition. In an example, the first entry indicates that reception is performed without repetition using the plurality of time resource allocations (e.g., without repeated reception). The second entry indicates a single time resource allocation with repetition. For example, the second entry may only indicate the single time resource allocation and / or may not indicate one or more other time resource allocations other than the single time resource allocation. In an example, the second entry indicates that reception is performed with repetition using the single time resource allocation (e.g., with repeated reception). In step 2010, the UE receives a DCI indicating an entry (e.g., one entry) in the list. In an example, the UE receives the DCI from the network. In step 2015, the UE performs a first reception based on an entry (e.g., the one entry) indicated by the DCI. If the entry (e.g., the one entry) indicated by the DCI is a first entry, the first reception includes receiving multiple TBs without repetition based on the multiple time resource allocations (e.g., without repeated reception of TBs). If the entry (e.g., the one entry) indicated by the DCI is a second entry, the first reception includes receiving a single TB with repetition based on the single time resource allocation (e.g., with repeated reception of the single TB) (e.g., the first reception may include only reception of the single TB based on the single time resource allocation and / or may not include reception of one or more other TBs other than the single TB).

[0478] In one embodiment, wherein the entry indicated by the DCI is the first entry, receiving the plurality of TBs without duplication based on the plurality of time resource allocations comprises performing one or more receptions at one or more time opportunities, wherein a number of time opportunities of the one or more time opportunities is a number of time resource allocations based on the plurality of time resource allocations. In an example, the number of time opportunities is equal to the number of time resource allocations.

[0479] In one embodiment, for each TB in the plurality of TBs, the one or more receptions include reception of the TB. For example, each TB in the plurality of TBs is received at least once via the one or more receptions. Alternatively and / or in addition, each TB in the plurality of TBs is received only once via the one or more receptions.

[0480] In one embodiment, the one or more receiving includes receiving TBs of the plurality of TBs (eg, all TBs of the plurality of TBs) in consecutive time slots (eg, time slots adjacent to each other) in the time domain.

[0481] In one embodiment, each of the plurality of TBs is associated with a time resource allocation in the plurality of time resource allocations. For example, a TB in the plurality of TBs (e.g., all TBs in the plurality of TBs) is respectively associated with a time resource allocation in the plurality of time resource allocations (e.g., each TB in the plurality of TBs is respectively associated with each time resource allocation in the plurality of time resource allocations). In an example, each of the plurality of TBs may be associated with a different time resource allocation in the plurality of time resource allocations. For example, each of the plurality of TBs is associated with a time resource allocation in the plurality of time resource allocations that is different from other time resource allocations (in the plurality of time resource allocations) associated with other TBs in the plurality of TBs. For example, a first TB in the plurality of TBs may be associated with a first time resource allocation in the plurality of time resource allocations, and / or a second TB in the plurality of TBs may be associated with a second time resource allocation in the plurality of time resource allocations (wherein the second time resource allocation is different from the first time resource allocation), and so on.

[0482] In one embodiment, the time resource allocations in the plurality of time resource allocations (e.g., all time resource allocations in the plurality of time resource allocations) correspond to different starting OFDM symbols, different consecutive OFDM symbol lengths, and / or different mapping types. In an example, each time resource allocation in the plurality of time resource allocations corresponds to a different (e.g., unique) starting OFDM symbol, a different (e.g., unique) consecutive OFDM symbol length, and / or a different (e.g., unique) mapping type. For example, the time resource allocation in the plurality of time resource allocations (and / or each time resource allocation in the plurality of time resource allocations) may correspond to a starting OFDM symbol different from other starting OFDM symbols corresponding to other time resource allocations in the plurality of time resource allocations. Alternatively and / or in addition, the time resource allocation in the plurality of time resource allocations (and / or each time resource allocation in the plurality of time resource allocations) may correspond to a consecutive OFDM symbol length different from other consecutive OFDM symbol lengths corresponding to other time resource allocations in the plurality of time resource allocations. Alternatively and / or in addition, a time resource allocation in the plurality of time resource allocations (and / or each time resource allocation in the plurality of time resource allocations) may correspond to a mapping type different from other mapping types corresponding to other time resource allocations in the plurality of time resource allocations.

[0483] In one embodiment, the time resource allocations in the multiple time resource allocations (e.g., all time resource allocations in the multiple time resource allocations) correspond to the same starting OFDM symbol, the same continuous OFDM symbol length and / or the same mapping type. For example, each time resource allocation in the multiple time resource allocations corresponds to the same starting OFDM symbol, the same continuous OFDM symbol length and / or the same mapping type.

[0484] In one embodiment, the time resource allocations in the multiple time resource allocations (e.g., all time resource allocations in the multiple time resource allocations) correspond to different time slots and / or different time opportunities. In an example, each time resource allocation in the multiple time resource allocations corresponds to a different (e.g., unique) time slot and / or a different (e.g., unique) time opportunity. For example, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a time slot different from other time slots corresponding to other time resource allocations in the multiple time resource allocations. Alternatively and / or in addition, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a time opportunity different from other time opportunities corresponding to other time resource allocations in the multiple time resource allocations.

[0485] In one embodiment, wherein the entry indicated by the DCI is the second entry, repeatedly receiving the single TB based on the single time resource allocation band includes performing one or more receptions at one or more time opportunities, wherein the number of time opportunities of the one or more time opportunities is based on the repetition number. In an example, the number of time opportunities is equal to the number of time resource allocations. In an example, the one or more receptions include multiple receptions of the single TB.

[0486] In one embodiment, the number of repetitions is based on (eg, configured by) an aggregation factor.

[0487] In one embodiment, the aggregation factor is associated with (e.g., for the configuration of) consecutive transmissions, consecutive time opportunities, and / or consecutive time slots configured for receiving the second single TB. For example, the aggregation factor may be associated with (e.g., for the configuration of) the number of transmissions for which consecutive transmissions of the second single TB are configured, the number of time opportunities for multiple consecutive time opportunities for receiving the second single TB, and / or the number of time slots for multiple consecutive time slots for receiving the second single TB.

[0488] In one embodiment, the aggregation factor is associated with (eg, for) a timeslot aggregation and / or a transmission aggregation of a third single TB.

[0489] In one embodiment, the aggregation factor is associated with (eg, used for) downlink transmissions.

[0490] In one embodiment, a time resource allocation (e.g., one time resource allocation) among one or more time resource allocations indicated by a list (e.g., all time resource allocations indicated by a list) corresponds to a starting OFDM symbol, a consecutive OFDM symbol length and / or a mapping type.

[0491] In one embodiment, the first receiving includes performing one or more receptions at one or more time occasions.

[0492] In one embodiment, a time opportunity among the one or more time opportunities (and / or each time opportunity among the one or more time opportunities) is a time slot, a mini-time slot, a resource associated with a time resource allocation (e.g., one time resource allocation) among the one or more time resource allocations, and / or a PDSCH.

[0493] In one embodiment, a time resource allocation (e.g., a time resource allocation) in the one or more time resource allocations corresponds to a SLIV. For example, the time resource allocation may correspond to a SLIV index / number (e.g., a SLIV index / number, such as a SLIV index corresponding to the SLIV and / or a SLIV number corresponding to the SLIV).

[0494] In one embodiment, a time resource allocation (eg, one time resource allocation) of the one or more time resource allocations corresponds to a SLIV and a mapping type.

[0495] In one embodiment, a time resource allocation in the one or more time resource allocations (e.g., one time resource allocation) indicates one or more symbols (e.g., one or more consecutive symbols) in a time slot (e.g., reception in the one or more receptions may be performed via the one or more symbols based on the time resource allocation).

[0496] Return to reference Figure 3 and 4In an exemplary embodiment of the UE, the apparatus 300 includes a program code 312 stored in the memory 310. The CPU 308 can execute the program code 312 to enable the UE to: (i) receive a configuration from the network to configure a list associated with multiple PDSCH time resource allocations, wherein the list includes a first entry and a second entry, wherein the first entry indicates multiple time resource allocations without repetition, and wherein the second entry indicates a single time resource allocation with repetition, (ii) receive a DCI indicating an entry in the list, and (iii) based on the entry indicated by the DCI, perform a first reception, wherein if the entry indicated by the DCI is the first entry, then the first reception includes receiving multiple TBs without repetition based on the multiple time resource allocations, and wherein if the entry indicated by the DCI is the second entry, then the first reception includes receiving a single TB with repetition based on the single time resource allocation. In addition, the CPU 308 can execute the program code 312 to perform one, some and / or all of the above actions and steps and / or other actions and steps described herein.

[0497] Fig.21 2100 is a flowchart according to an exemplary embodiment from the perspective of a UE. In step 2105, the UE receives a message associated with a PDSCH parameter configuration (e.g., the message is used to configure one or more PDSCH parameters). The message includes a first parameter and a second parameter. In some instances, the message includes one or more parameters (not the first and second parameters) and / or information other than the first and second parameters. The first parameter indicates (e.g., configures) a first list of entries associated with time resource allocations for multiple PDSCHs. In an example, the UE can be configured to use the first list of entries using the first parameter. The second parameter indicates (e.g., configures) multiple repetition receptions for a single TB (e.g., the second parameter indicates receiving multiple repetitions of a single TB). In step 2110, the UE receives a DCI indicating a first entry in the first list, wherein the first entry indicates one or more time resource allocations. In step 2115, the UE performs one or more receptions at one or more time opportunities, wherein the number of time opportunities of the one or more time opportunities is a number of time resource allocations based on the one or more time resource allocations. In an example, the number of time opportunities is equal to the number of time resource allocations.

[0498] In one embodiment, the message is a RRC message.

[0499] In one embodiment, the UE performs the one or more receptions (e.g., one or more TB receptions) at the one or more time occasions without applying the multiple repetitions associated with the second parameter. Alternatively and / or in addition, the UE may not apply the multiple repetitions associated with the second parameter to perform the one or more receptions at the one or more time occasions. Alternatively and / or in addition, the UE may ignore the multiple repetitions associated with the second parameter to perform the one or more receptions at the one or more time occasions. Alternatively and / or in addition, the UE may determine (e.g., consider) that the number of repetitions for a single TB for performing the one or more receptions at the one or more time occasions is one (e.g., the UE may not receive a single TB more than once via the one or more receptions). Alternatively and / or in addition, the one or more receptions may not include a time opportunity for TB repetitions. Alternatively and / or in addition, the UE may determine (e.g., consider) that the number of repetitions for a single TB for each of the one or more time resource allocations is one.

[0500] In one embodiment, the DCI is DCI format 1_1.

[0501] In one embodiment, the number of repetitions of the multiple repetitions for the single TB corresponds to the number of time opportunities for the single TB (e.g., the total number of time opportunities). Alternatively and / or additionally, if the number of repetitions of the multiple repetitions for the single TB is two, then the number of time opportunities for the single TB (e.g., the total number of time opportunities) is two. Alternatively and / or additionally, the number of repetitions for the single TB corresponds to the number of time opportunities for the single TB (e.g., the total number of time opportunities). Alternatively and / or additionally, if the number of repetitions for the single TB is one, then the number of time opportunities for the single TB (e.g., the total number of time opportunities) is one.

[0502] In one embodiment, the time opportunity number of the one or more time opportunities is equal to (e.g., is the same as) the time resource allocation number of the one or more time resource allocations.Alternatively and / or additionally, the time opportunity number of the one or more time opportunities is determined as the time resource allocation number of the one or more time resource allocations.

[0503] In one embodiment, the one or more time opportunities do not include time opportunities associated with the multiple repetitions associated with the second parameter. Alternatively and / or in addition, the number of time opportunities of the one or more time opportunities is not based on the multiple repetitions associated with the second parameter. Alternatively and / or in addition, the time opportunities in the one or more time opportunities may correspond to different TBs (e.g., each time opportunity in the one or more time opportunities corresponds to a different TB, such as where the first time opportunity corresponds to the first TB, the second time opportunity corresponds to the second TB different from the first TB, etc.). Alternatively and / or in addition, each time opportunity in the one or more time opportunities may not have the multiple repetitions associated with the second parameter. Alternatively and / or in addition, each time opportunity in the one or more time opportunities may be associated with a repetition number equal to one. Alternatively and / or in addition, each time opportunity in the one or more time opportunities may not be associated with the multiple repetitions associated with the second parameter.

[0504] In one embodiment, for each TB in a plurality of TBs, the one or more TB receptions include reception of the TB. Alternatively and / or in addition, the one or more TB receptions may include receiving the TB in the plurality of TBs in different time slots. Alternatively and / or in addition, each TB in the plurality of TBs may be associated with a time resource allocation in the one or more time resource allocations. Alternatively and / or in addition, the entries in the first list (e.g., at least one entry in the first list) indicate multiple time resource allocations for multiple TBs and / or multiple HARQ process numbers.

[0505] In one embodiment, the time resource allocations in the one or more time resource allocations (e.g., all time resource allocations in the one or more time resource allocations) correspond to different starting OFDM symbols, different consecutive OFDM symbol lengths, and / or different mapping types. For example, the one or more time resource allocations may include multiple time resource allocations, wherein the time resource allocations in the multiple time resource allocations (e.g., all time resource allocations in the multiple time resource allocations) correspond to different starting OFDM symbols, different consecutive OFDM symbol lengths, and / or different mapping types. In an instance, each time resource allocation in the multiple time resource allocations corresponds to a different (e.g., unique) starting OFDM symbol, a different (e.g., unique) consecutive OFDM symbol length, and / or a different (e.g., unique) mapping type. For example, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a starting OFDM symbol different from other starting OFDM symbols corresponding to other time resource allocations in the multiple time resource allocations. Alternatively and / or in addition, a time resource allocation in the plurality of time resource allocations (and / or each of the plurality of time resource allocations) may correspond to a continuous OFDM symbol length different from other continuous OFDM symbol lengths corresponding to other time resource allocations in the plurality of time resource allocations.Alternatively and / or in addition, a time resource allocation in the plurality of time resource allocations (and / or each of the plurality of time resource allocations) may correspond to a mapping type different from other mapping types corresponding to other time resource allocations in the plurality of time resource allocations.

[0506] In one embodiment, the time resource allocations in the one or more time resource allocations (e.g., all time resource allocations in the one or more time resource allocations) correspond to the same starting OFDM symbol, the same continuous OFDM symbol length, and / or the same mapping type. For example, each time resource allocation in the one or more time resource allocations corresponds to the same starting OFDM symbol, the same continuous OFDM symbol length, and / or the same mapping type.

[0507] In one embodiment, the time resource allocations in the one or more time resource allocations (e.g., all time resource allocations in the one or more time resource allocations) correspond to different time slots and / or different time opportunities. For example, the one or more time resource allocations may include multiple time resource allocations, wherein the time resource allocations in the multiple time resource allocations (e.g., all time resource allocations in the multiple time resource allocations) correspond to different time slots and / or different time opportunities. In an example, each time resource allocation in the multiple time resource allocations corresponds to a different (e.g., unique) time slot and / or a different (e.g., unique) time opportunity. For example, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a time slot different from other time slots corresponding to other time resource allocations in the multiple time resource allocations. Alternatively and / or in addition, the time resource allocations in the multiple time resource allocations (and / or each time resource allocation in the multiple time resource allocations) may correspond to a time opportunity different from other time opportunities corresponding to other time resource allocations in the multiple time resource allocations.

[0508] In one embodiment, the first list is associated with a time resource allocation for downlink transmission. Alternatively and / or in addition, each entry in the first list may indicate up to eight time resource allocations. Alternatively and / or in addition, the time resource allocations in the one or more time resource allocations may correspond to different starting OFDM symbols, different continuous OFDM symbol lengths and / or different mapping types. Alternatively and / or in addition, the time resource allocations in the one or more time resource allocations may correspond to the same starting OFDM symbol, the same continuous OFDM symbol length and / or the same mapping type. Alternatively and / or in addition, the time resource allocations in the one or more time resource allocations may correspond to different time slots and / or different time opportunities.

[0509] In one embodiment, the second parameter is pdsch-AggregationFactor. Alternatively and / or in addition, the multiple repetitions are associated with configuring continuous reception (e.g., continuous reception for receiving a single TB), continuous time opportunities (e.g., continuous time opportunities for receiving a single TB) and / or continuous time slots (e.g., continuous time slots for receiving a single TB). Alternatively and / or in addition, the multiple repetitions are associated with time slot aggregation and / or transmission aggregation of a single TB. Alternatively and / or in addition, the multiple repetitions are associated with downlink transmissions. Alternatively and / or in addition, the multiple repetitions are updated based on RRC signaling.

[0510] In one embodiment, the message includes a third parameter indicating a second list of entries associated with time resource allocations, wherein each entry in the second list indicates a single time resource allocation. Alternatively and / or additionally, the UE may receive a second DCI indicating an entry in the second list, and the UE may perform one or more receptions at one or more time opportunities, wherein the number of time opportunities of the one or more time opportunities is based on the second parameter. Alternatively and / or additionally, the second list is associated with time resource allocations for downlink transmissions.

[0511] In one embodiment, the UE performs the one or more receptions at one or more time occasions by applying the multiple repetitions associated with the second parameter. Alternatively and / or in addition, the UE applies the multiple repetitions associated with the second parameter to perform the one or more receptions at one or more time occasions. Alternatively and / or in addition, in order to perform the one or more receptions at one or more time occasions, the UE may determine (e.g., consider) the number of repetitions (e.g., of the one or more receptions) for a single TB to be the number of repetitions of the multiple repetitions associated with the second parameter. Alternatively and / or in addition, the one or more receptions may include one or more time occasions for TB repetitions. Alternatively and / or in addition, the UE may determine (e.g., consider) the number of repetitions for a single TB to be the number of repetitions of the multiple repetitions associated with the second parameter.

[0512] In one embodiment, the number of time opportunities of the one or more time opportunities is equal to (e.g., is the same as) the number of repetitions associated with the second parameter (e.g., the number of time opportunities of the one or more time opportunities is equal to the number of repetitions of the plurality of repetitions). Alternatively and / or additionally, each of the one or more time opportunities may be associated with a time resource allocation transmitted by the entry in the second list. Alternatively and / or additionally, each of the one or more time opportunities may correspond to the same TB.

[0513] Return to reference Figure 3 and 4In an exemplary embodiment of the UE, the apparatus 300 includes a program code 312 stored in the memory 310. The CPU 308 can execute the program code 312 to enable the UE to: (i) receive a message associated with a PDSCH parameter configuration, wherein the message includes a first parameter and a second parameter, wherein the first parameter indicates a first list of entries associated with time resource allocations for multiple PDSCHs, and wherein the second parameter indicates (e.g., configures) multiple repetition receptions for a single TB (e.g., the second parameter indicates receiving multiple repetitions of a single TB), (ii) receive a DCI indicating a first entry in the first list, wherein the first entry indicates one or more time resource allocations, and (iii) perform one or more receptions at one or more time opportunities, wherein the time opportunity number of the one or more time opportunities is based on the time resource allocation number of the one or more time resource allocations. In addition, the CPU 308 can execute the program code 312 to perform one, some and / or all of the above actions and steps and / or other actions and steps described herein.

[0514] Fig. 222200 is a flowchart according to an exemplary embodiment from the perspective of a UE. In step 2205, the UE receives a message associated with a PDSCH parameter configuration (e.g., the message is used to configure one or more PDSCH parameters). The message includes a first parameter, a second parameter, and a third parameter. In some instances, the message includes one or more parameters (not the first, second, and third parameters) and / or information other than the first, second, and third parameters. The first parameter indicates (e.g., configures) a first list of entries associated with a time resource allocation for multiple PDSCHs. In an example, the UE can be configured to use the first list of entries using the first parameter. The second parameter indicates (e.g., configures) multiple repetition receptions for a single PDSCH (e.g., one PDSCH) (e.g., the second parameter indicates receiving multiple repetitions of a single TB). In an example, the UE can be configured to use the multiple repetition receptions for a single PDSCH using the second parameter. The third parameter indicates (e.g., configures) a second list of entries associated with a time resource allocation. In an example, the UE can be configured to use the second list of entries using the third parameter. Each entry in the second list indicates a single time resource allocation. The first list, the second list and / or the second parameter (and / or other information in addition to the first list, the second list and / or the second parameter) are used to determine the repetition number (for example, the repetition number may correspond to the repetition number of PDSCH reception). In the example, the UE determines the repetition number (for example, the repetition number may correspond to the repetition number of PDSCH reception) based on the second parameter and the first list or the second list (or based on the first list or based on the second list and the second parameter). In step 2210, if the UE receives a first DCI indicating a first entry in the first list, the UE receives a plurality of PDSCHs based on a plurality of time resource allocations indicated by the first entry, wherein a first repetition number of the plurality of PDSCHs is determined to be one (for example, a first repetition number equal to one is for each PDSCH in the plurality of PDSCHs, such as wherein the first repetition number corresponds to the number of receptions of each PDSCH in the plurality of PDSCHs). In step 2215, if the UE receives a second DCI indicating a second entry in the second list, then the UE receives one or more PDSCHs with repetitions based on a single time resource allocation indicated by the second entry, wherein a second repetition number of the one or more PDSCHs is determined based on a second parameter (for example, the second repetition number is for each PDSCH in the one or more PDSCHs, such as where the second repetition number corresponds to the number of receptions of each PDSCH in the one or more PDSCHs).

[0515] In one embodiment, the number of PDSCHs of the plurality of PDSCHs is a number of time resource allocations based on the plurality of time resource allocations. Alternatively and / or additionally, the number of PDSCHs of the plurality of PDSCHs is equal to (e.g., is the same as) the number of time resource allocations of the plurality of time resource allocations. Alternatively and / or additionally, the number of PDSCHs of the plurality of PDSCHs is determined as the number of time resource allocations of the plurality of time resource allocations.

[0516] In one embodiment, the number of PDSCHs of the one or more PDSCHs (with repetitions) is equal to (eg, the same as) a number of repetitions of the plurality of repetitions associated with the second parameter (eg, the plurality of repetitions transmitted by the second parameter).

[0517] In one embodiment, the first DCI is DCI format 1_1.

[0518] In one embodiment, the second DCI is not DCI format 1_1.

[0519] In one embodiment, the first repetition number corresponds to the number of time opportunities for each PDSCH in the plurality of PDSCHs (e.g., the total number of time opportunities).Alternatively and / or in addition, the second repetition number may correspond to the second number of time opportunities for each PDSCH in the one or more PDSCHs (e.g., the total number of time opportunities).

[0520] In one embodiment, the repetition number for PDSCH corresponds to the number of time opportunities for the PDSCH (eg, total number of time opportunities). In an example, if the repetition number for the PDSCH is two, then the number of time opportunities for the PDSCH (eg, total number of time opportunities) is two.

[0521] In one embodiment, one PDSCH corresponds to one TB. Alternatively and / or in addition, the PDSCHs in the multiple PDSCHs correspond to different TBs (e.g., each of the multiple PDSCHs corresponds to a different TB, such as wherein the first PDSCH in the multiple PDSCHs corresponds to a first TB, the second PDSCH in the multiple PDSCHs corresponds to a second TB different from the first TB, and so on). Alternatively and / or in addition, the PDSCHs in the multiple PDSCHs are associated with different hybrid automatic repeat request (HARQ) process numbers (e.g., each of the multiple PDSCHs is associated with a different HARQ process number, such as wherein the first PDSCH in the multiple PDSCHs is associated with a first HARQ process number, the second PDSCH in the multiple PDSCHs is associated with a second HARQ process number different from the first HARQ process number, and so on). Alternatively and / or in addition, a PDSCH of the plurality of PDSCHs is associated with a time resource allocation of the plurality of time resource allocations indicated by the first DCI (e.g., each of the plurality of PDSCHs is respectively associated with each of the plurality of time resource allocations indicated by the first DCI). Alternatively and / or in addition, each of the plurality of PDSCHs is associated with a time opportunity (e.g., received in a time opportunity). Alternatively and / or in addition, each of the plurality of PDSCHs is associated with a time slot (e.g., received in a time slot). Alternatively and / or in addition, the UE receives the plurality of PDSCHs without applying the plurality of repetitions associated with the second parameter (e.g., the UE may not receive the plurality of PDSCHs based on the plurality of repetitions and / or the number of repetitions of the plurality of repetitions).

[0522] In one embodiment, each of the one or more PDSCHs (with repetition) corresponds to a TB. Alternatively and / or in addition, each of the one or more PDSCHs is associated with the same HARQ process number. Alternatively and / or in addition, each of the one or more PDSCHs is associated with a time opportunity (e.g., received in a time opportunity). Alternatively and / or in addition, each of the one or more PDSCHs is associated with a time slot (e.g., received in a time slot). Alternatively and / or in addition, each of the one or more PDSCHs is associated with the single time resource allocation (e.g., the single time resource allocation transmitted by the second DCI).

[0523] In one embodiment, the time resource allocation (e.g., the single time resource allocation and / or the time resource allocation in the multiple time resource allocations) corresponds to a starting OFDM symbol, a consecutive OFDM symbol length, and / or a mapping type. Alternatively and / or in addition, the time resource allocation (e.g., the single time resource allocation and / or the time resource allocation in the multiple time resource allocations) corresponds to a SLIV. Alternatively and / or in addition, the time resource allocation (e.g., the single time resource allocation and / or the time resource allocation in the multiple time resource allocations) corresponds to a SLIV and a mapping type.

[0524] In one embodiment, the first list is associated with a time resource allocation for downlink transmission. Alternatively and / or in addition, the second list is associated with a time resource allocation for downlink transmission. Alternatively and / or in addition, each entry in the first list indicates a maximum of eight time resource allocations. Alternatively and / or in addition, the time resource allocations in the multiple time resource allocations correspond to different starting OFDM symbols, different continuous OFDM symbol lengths and / or different mapping types. Alternatively and / or in addition, the time resource allocations in the multiple time resource allocations correspond to the same starting OFDM symbol, the same continuous OFDM symbol length and / or the same mapping type. Alternatively and / or in addition, the time resource allocations in the multiple time resource allocations correspond to different time slots and / or different time opportunities.

[0525] In one embodiment, the second parameter is a pdsch-AggregationFactor. Alternatively and / or in addition, the plurality of repetitions associated with the second parameter are associated with continuous transmissions, continuous time opportunities and / or continuous time slots configured for transmitting a single TB. Alternatively and / or in addition, the plurality of repetitions are associated with time slot aggregation and / or transmission aggregation of a single TB. Alternatively and / or in addition, the plurality of repetitions are associated with downlink transmissions. Alternatively and / or in addition, the plurality of repetitions are updated based on RRC signaling (e.g., the plurality of repetitions may be updated based on RRC signaling to indicate an updated number of the plurality of repetitions).

[0526] Return to reference Figure 3 and 4In an exemplary embodiment of a UE, the apparatus 300 includes a program code 312 stored in a memory 310 . The CPU 308 can execute the program code 312 to enable the UE to: (i) receive a message associated with a PDSCH parameter configuration, wherein the message includes a first parameter, a second parameter, and a third parameter, wherein the first parameter indicates (e.g., configures) a first list of entries associated with time resource allocations for multiple PDSCHs, the second parameter indicates (e.g., configures) multiple repetition receptions for a single PDSCH, and the third parameter indicates a second list of entries associated with time resource allocations, wherein each entry in the second list indicates a single time resource allocation, and wherein the first list, the second list, and / or the second parameter are used to determine a repetition number, (ii) in a case where the UE receives a first DCI indicating a first entry in the first list, receive a plurality of PDSCHs based on the plurality of time resource allocations indicated by the first entry, wherein the first repetition number for the plurality of PDSCHs is determined to be one, and (iii) in a case where the UE receives a second DCI indicating a second entry in the second list, receive one or more PDSCHs with repetitions based on the single time resource allocation indicated by the second entry, wherein the second repetition number for the one or more PDSCHs is determined based on the second parameter. Furthermore, CPU 308 may execute program code 312 to perform one, some, and / or all of the actions and steps described above and / or other actions and steps described herein.

[0527] A communication device (e.g., UE, base station, network, etc.) may be provided, wherein the communication device may include a control circuit, a processor installed in the control circuit, and / or a memory installed in the control circuit and coupled to the processor. The processor may be configured to execute a program code stored in the memory to perform Figure 18-22 In addition, the processor may execute program code to perform one, some and / or all of the above actions and steps and / or other actions and steps described herein.

[0528] A computer readable medium may be provided. The computer readable medium may be a non-transitory computer readable medium. The computer readable medium may include a flash memory device, a hard drive, a disk (e.g., a magnetic disk and / or an optical disk, such as at least one of a digital versatile disk (DVD), a compact disk (CD), etc.), and / or a memory semiconductor, such as at least one of a static random access memory (SRAM), a dynamic random access memory (DRAM), a synchronous dynamic random access memory (SDRAM), etc. The computer readable medium may include processor executable instructions that, when executed, cause the processor to execute a program that performs a program execution. Figure 18-22One, some and / or all of the method steps shown in and / or one, some and / or all of the actions and steps described above and / or other actions and steps described herein are performed.

[0529] It should be appreciated that applying one or more techniques presented herein may produce one or more benefits, including but not limited to improved communication efficiency between devices (e.g., UEs and / or networks), such as by enabling the UEs and / or networks to interpret and / or determine time resource allocation for multi-TB PDSCHs with a number of repetitions and / or time slot aggregation for PDSCHs. For example, by enabling the UEs and / or networks to perform (e.g., correctly perform) communications using a multi-PDSCH function and / or a PDSCH aggregation / repetition function, the UEs and networks may communicate with each other with less control signaling overhead and / or improved PDSCH transmission reliability, etc.

[0530] Various aspects of the present disclosure have been described above. It should be clear that the teachings herein can be implemented in a wide variety of forms, and any specific structure, function, or both disclosed herein are only representative. Based on the teachings herein, it should be understood by those skilled in the art that the aspects disclosed herein can be implemented independently of any other aspects, and two or more of these aspects can be combined in various ways. For example, any number of aspects set forth herein can be used to implement a device or practice method. In addition, by using other structures, functionality, or structures and functionality other than one or more aspects of the aspects set forth herein or different from one or more aspects of the aspects set forth herein, this device can be implemented or this method can be practiced. As an example of some of the above concepts, in some aspects, parallel channels can be established based on pulse repetition frequency. In some aspects, parallel channels can be established based on pulse position or offset. In some aspects, parallel channels can be established based on time hopping sequences. In some aspects, parallel channels can be established based on pulse repetition frequency, pulse position or offset, and time hopping sequences.

[0531] Those skilled in the art will understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltage, current, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0532] Those skilled in the art will further appreciate that the various illustrative logical blocks, modules, processors, components, circuits, and algorithm steps described in conjunction with the various aspects disclosed herein may be implemented as electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two, which may be designed using source decoding or some other technique), and various forms of programs or design code with instructions (which may be referred to herein as "software" or "software modules" for convenience), or a combination of the two. To clearly illustrate this interchangeability of hardware and software, the various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether this functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. Those skilled in the art may implement the described functionality in different ways for each specific application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

[0533] In addition, the various illustrative logical blocks, modules, and circuits described in conjunction with the aspects disclosed herein may be implemented within or performed by an integrated circuit ("IC"), an access terminal, or an access point. An IC may include a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, electrical components, optical components, mechanical components, or any combination thereof designed to perform the functions described herein, and may execute code or instructions residing within the IC, outside the IC, or both. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a combination of multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0534] It should be understood that any specific order or hierarchy of steps in any disclosed process is an example of an exemplary method. It should be understood that based on design preferences, the specific order or hierarchy of steps in a process can be rearranged while remaining within the scope of the present disclosure. The accompanying method claims present elements of the various steps in an exemplary order, but are not meant to be limited to the specific order or hierarchy presented.

[0535] The steps of the method or algorithm described in conjunction with the various aspects disclosed herein can be implemented directly with hardware, with a software module executed by a processor, or with a combination of the two. Software modules (e.g., including executable instructions and related data) and other data may reside in a data memory, such as a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of computer-readable storage medium known in the art. An example storage medium may be coupled to a machine such as a computer / processor (for convenience, the machine may be referred to as a "processor" in this article) so that the processor can read information (e.g., code) from the storage medium and write information to the storage medium. An example storage medium may be integrated with a processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user device. In an alternative, the processor and the storage medium may reside in a user device as discrete components. Alternatively or additionally, in some aspects, any suitable computer program product may include a computer-readable medium, which includes a code related to one or more aspects of the present disclosure. In some aspects, a computer program product may include packaging materials.

[0536] Although the disclosed subject matter has been described in conjunction with various aspects, it will be understood that the disclosed subject matter is capable of further modification. This application is intended to cover any changes, uses, or adaptations of the disclosed subject matter that generally follow the principles of the disclosed subject matter and include such deviations from the present disclosure as come within the scope of known and customary practice in the art to which the disclosed subject matter belongs.

[0537] CROSS-REFERENCE TO RELATED APPLICATIONS

[0538] This application claims the benefit of U.S. Provisional Patent Application No. 63 / 122,610, filed on December 8, 2020, the entire disclosure of which is incorporated herein by reference in its entirety.

Claims

1. A method of a user device, It is characterized in that The method comprises: A message associated with a physical downlink shared channel parameter configuration is received, wherein: The message includes a first parameter indicating a first list of entries associated with time resource allocations for a plurality of physical downlink shared channels; The message includes a second parameter indicating a plurality of repeated receptions for a single physical downlink shared channel; the message comprising a third parameter indicating a second list of entries associated with a time resource allocation; Each entry in the second list of entries indicates a single time resource allocation; and If the user equipment receives first downlink control information indicating a first entry in the first list of entries, receiving a plurality of physical downlink shared channels based on a plurality of time resource allocations indicated by the first entry, wherein a first repetition number of the plurality of physical downlink shared channels is determined to be one; and If the user equipment receives second downlink control information indicating a second entry in the second list of entries, then based on the single time resource allocation indicated by the second entry, one or more physical downlink shared channels with repetitions are received, wherein a second repetition number of the one or more physical downlink shared channels is determined based on the second parameter.

2. The method according to claim 1, Features At least one of the following: The number of physical downlink shared channels of the plurality of physical downlink shared channels is a number of time resource allocations based on the plurality of time resource allocations; The number of physical downlink shared channels of the plurality of physical downlink shared channels is equal to the number of time resource allocations of the plurality of time resource allocations; or The number of physical downlink shared channels of the plurality of physical downlink shared channels is determined as the number of time resource allocations of the plurality of time resource allocations.

3. The method according to claim 1, It is characterized in that A number of physical downlink shared channels of the one or more physical downlink shared channels is equal to a repetition number of the plurality of repetitions associated with the second parameter.

4. The method according to claim 1, Features At least one of the following: The first downlink control information is downlink control information format 1_1; or The second downlink control information is not in downlink control information format 1_1.

5. The method according to claim 1, Features At least one of the following: The first repetition number corresponds to the number of time opportunities of each physical downlink shared channel in the plurality of physical downlink shared channels; or The second repetition number corresponds to a second time opportunity number of each physical downlink shared channel of the one or more physical downlink shared channels.

6. The method according to claim 1, Features At least one of the following: One physical downlink shared channel corresponds to one transport block; The physical downlink shared channels of the plurality of physical downlink shared channels correspond to different transport blocks; A physical downlink shared channel among the plurality of physical downlink shared channels is associated with a different hybrid automatic repeat request process number; a physical downlink shared channel of the plurality of physical downlink shared channels being associated with a time resource allocation of the plurality of time resource allocations indicated by the first downlink control information; Each physical downlink shared channel of the plurality of physical downlink shared channels is associated with a time opportunity; Each physical downlink shared channel of the plurality of physical downlink shared channels is associated with a time slot; or The user equipment receives the plurality of physical downlink shared channels without applying the plurality of repetitions associated with the second parameter.

7. The method according to claim 1, Features At least one of the following: Each of the one or more physical downlink shared channels corresponds to a transport block; Each of the one or more physical downlink shared channels is associated with a same hybrid automatic repeat request process number; Each physical downlink shared channel of the one or more physical downlink shared channels is associated with a time opportunity; Each of the one or more physical downlink shared channels is associated with a time slot; or Each of the one or more physical downlink shared channels is associated with the single time resource allocation indicated by the second entry.

8. The method according to claim 1, It is characterized by the following At least one of: A time resource allocation in the plurality of time resource allocations corresponds to at least one of a starting OFDM symbol, a consecutive OFDM symbol length, or a mapping type; A time resource allocation in the plurality of time resource allocations corresponds to a start and length indicator value; A time resource allocation in the plurality of time resource allocations corresponds to a start and length indicator value and a mapping type; The single time resource allocation indicated by the second entry corresponds to at least one of a starting OFDM symbol, a consecutive OFDM symbol length, or a mapping type; said single time resource allocation indicated by said second entry corresponds to a start and length indicator value; or The single time resource allocation indicated by the second entry corresponds to a start and length indicator value and a mapping type.

9. The method according to claim 1, Features At least one of the following: The first list of entries is associated with a time resource allocation for downlink transmission; The second list of entries is associated with time resource allocations for downlink transmissions; Each entry in the first list of entries indicates a maximum of eight time resource allocations; The time resource allocations in the plurality of time resource allocations correspond to at least one of different starting OFDM symbols, different consecutive OFDM symbol lengths, or different mapping types; The time resource allocations in the plurality of time resource allocations correspond to at least one of a same starting OFDM symbol, a same consecutive OFDM symbol length, or a same mapping type; or The time resource allocations of the plurality of time resource allocations correspond to at least one of different time slots or different time opportunities.

10. The method according to claim 1, characterized by at least one of the following: The second parameter is pdsch-AggregationFactor; The plurality of repetitions associated with the second parameter is associated with at least one of consecutive transmissions, consecutive time opportunities, or consecutive time slots configured for transmitting a single transport block; The plurality of repetitions are associated with at least one of a slot aggregation or a transmit aggregation of a single transport block; The plurality of repetitions are associated with downlink transmissions; or The plurality of repetitions are based on radio resource control signaling updates.

11. A method for a user device, It is characterized in that include: A configuration is received from a network to configure a list associated with a time resource allocation, wherein: The list includes a first entry and a second entry; The first entry indicates a time resource allocation for a plurality of physical downlink shared channels without duplication; and The second entry indicates a single temporal resource allocation having repetitions; receiving downlink control information indicating an entry in the list; and Based on the entry indicated by the downlink control information, a first reception is performed, wherein: If the entry indicated by the downlink control information is the first entry, the first receiving comprises receiving a plurality of transport blocks without duplication based on the plurality of time resource allocations; and If the entry indicated by the downlink control information is the second entry, the first reception includes repeatedly receiving a single transport block based on the single time resource allocation band.

12. The method according to claim 11, It is characterized in that The receiving the plurality of transport blocks without duplication based on the plurality of time resource allocations comprises performing one or more receptions at one or more time occasions, wherein a number of time occasions of the one or more time occasions is a number of time resource allocations based on the plurality of time resource allocations.

13. The method according to claim 12, Features At least one of the following: For each transport block of the plurality of transport blocks, the one or more receptions include reception of the transport block; The one or more receptions include receiving transport blocks of the plurality of transport blocks in consecutive time slots; or Each transport block of the plurality of transport blocks is associated with a time resource allocation of the plurality of time resource allocations.

14. The method according to claim 11, It is characterized by the following At least one of: The time resource allocations in the plurality of time resource allocations correspond to at least one of different starting OFDM symbols, different consecutive OFDM symbol lengths, or different mapping types; The time resource allocations in the plurality of time resource allocations correspond to at least one of a same starting OFDM symbol, a same consecutive OFDM symbol length, or a same mapping type; or The time resource allocations of the plurality of time resource allocations correspond to at least one of different time slots or different time opportunities.

15. The method according to claim 11, It is characterized in that The repeatedly receiving the single transport block based on the single time resource allocation band includes performing one or more receptions at one or more time occasions, wherein a number of time occasions of the one or more time occasions is based on a repetition number.

16. The method according to claim 15, It is characterized by the following At least one of: The number of repeats is based on the aggregation factor; the aggregation factor being associated with at least one of consecutive transmissions, consecutive time opportunities, or consecutive time slots configured for receiving the second single transport block; The aggregation factor is associated with at least one of a slot aggregation or a transmit aggregation of a third single transport block; or The aggregation factor is associated with downlink transmissions.

17. The method according to claim 11, Features At least one of the following: A time resource allocation of the one or more time resource allocations indicated by the list corresponds to at least one of a starting OFDM symbol, a consecutive OFDM symbol length, or a mapping type; The first receiving includes performing one or more receptions at one or more time occasions; A time opportunity of the one or more time opportunities is at least one of a time slot, a mini-slot, a resource associated with a time resource allocation of the one or more time resource allocations, or a physical downlink shared channel; A time resource allocation of the one or more time resource allocations corresponds to a start and length indicator value; A time resource allocation of the one or more time resource allocations corresponds to a start and length indicator value and a mapping type; or A time resource allocation of the one or more time resource allocations indicates one or more symbols in a time slot.

18. A user device, It is characterized in that include: Control circuit; a processor installed in the control circuit; as well as a memory installed in the control circuit and operably coupled to the processor, wherein the processor is configured to execute program code stored in the memory to perform operations including: A message associated with a physical downlink shared channel parameter configuration is received, wherein: The message includes a first parameter indicating a first list of entries associated with time resource allocations for a plurality of physical downlink shared channels; The message includes a second parameter indicating a plurality of repeated receptions for a single physical downlink shared channel; the message comprising a third parameter indicating a second list of entries associated with a time resource allocation; Each entry in the second list of entries indicates a single time resource allocation; and If the user equipment receives first downlink control information indicating a first entry in the first list of entries, receiving a plurality of physical downlink shared channels based on a plurality of time resource allocations indicated by the first entry, wherein a first repetition number of the plurality of physical downlink shared channels is determined to be one; and If the user equipment receives second downlink control information indicating a second entry in the second list of entries, then based on the single time resource allocation indicated by the second entry, one or more physical downlink shared channels with repetitions are received, wherein a second repetition number of the one or more physical downlink shared channels is determined based on the second parameter.

19. The user equipment according to claim 18, Features At least one of the following: The number of physical downlink shared channels of the plurality of physical downlink shared channels is a number of time resource allocations based on the plurality of time resource allocations; The number of physical downlink shared channels of the plurality of physical downlink shared channels is equal to the number of time resource allocations of the plurality of time resource allocations; or The number of physical downlink shared channels of the plurality of physical downlink shared channels is determined as the number of time resource allocations of the plurality of time resource allocations.

20. The user equipment according to claim 18, It is characterized in that A number of physical downlink shared channels of the one or more physical downlink shared channels is equal to a repetition number of the plurality of repetitions indicated by the second parameter.

Images