WO2023050105A1

WO2023050105A1 - Wireless communication method, user equipment, and base station

Info

Publication number: WO2023050105A1
Application number: PCT/CN2021/121490
Authority: WO
Inventors: Aijuan Feng; Jia SHENG
Original assignee: Huizhou Tcl Cloud Internet Corporation Technology Co., Ltd
Priority date: 2021-09-28
Filing date: 2021-09-28
Publication date: 2023-04-06

Abstract

A user equipment (UE) and a base station execute a wireless communication method. The UE determines, among symbols in a time unit on a physical uplink shared channel (PUSCH), a time domain position of a foremost symbol that first satisfies a timeline limit for a type of UCI. The UE performs UCI multiplexing by multiplexing UCI belonging to the type of UCI on one or more PUSCH resources after the foremost symbol, wherein the multiplexed UCI is in response to a downlink signal.

Description

WIRELESS COMMUNICATION METHOD, USER EQUIPMENT, AND BASE STATION

Technical Field

The present disclosure relates to the field of communication systems, and more particularly, to a wireless communication method, a user equipment, and a base station.

Background Art

Wireless communication systems, such as the third-generation (3G) of mobile telephone standards and technology are well known. Such 3G standards and technology have been developed by the Third Generation Partnership Project (3GPP) . The 3rd generation of wireless communications has generally been developed to support macro-cell mobile phone communications. Communication systems and networks have developed towards being a broadband and mobile system. In cellular wireless communication systems, user equipment (UE) is connected by a wireless link to a radio access network (RAN) . The RAN comprises a set of base stations (BSs) which provide wireless links to the UEs located in cells covered by the base station, and an interface to a core network (CN) which provides overall network control. As will be appreciated the RAN and CN each conduct respective functions in relation to the overall network. The 3rd Generation Partnership Project has developed the so-called Long Term Evolution (LTE) system, namely, an Evolved Universal Mobile Telecommunication System Territorial Radio Access Network, (E-UTRAN) , for a mobile access network where one or more macro-cells are supported by a base station known as an eNodeB or eNB (evolved NodeB) . More recently, LTE is evolving further towards the so-called 5G or NR (new radio) systems where one or more cells are supported by a base station known as a gNB.

Technical Problem

In 3GPP Release 17, the work item “NR coverage enhancements” is in progress. Coverage is one of the key factors of service quality for a cellular communication network. Compared to LTE, NR is designed to operate at much higher frequencies such as 28GHz or 39GHz in FR2. Due to the higher frequencies, it is inevitable that NR wireless channels will be subject to higher path-loss making it more challenging to maintain an adequate quality of service comparable to that of legacy radio access technologies (RATs) . Coverage-enhancement techniques are essentially providing UEs with good service quality wherever the UEs are located.

Coverage enhancement is to specify enhancements for physical uplink shared channel (PUSCH) , physical uplink control channel (PUCCH) and Msg3 PUSCH for both FR1 and FR2 as well as time-division duplex (TDD) and frequency-division duplex (FDD) . PUSCH enhancements include a mechanism to support transport block (TB) processing over multi-slot PUSCH (referred to as TBoMS hereinafter) .

In the current specification, when a single-slot PUCCH and PUSCH transmissions of same priority overlap, the uplink control information (UCI) carried on the PUCCH is multiplexed on the PUSCH in the overlapped slot and the transmission of PUCCH would be canceled if the timeline limits are satisfied.

Since TBoMS is a transmission of one TB over multiple slots, the legacy UCI multiplexing mechanism is not applicable. When overlapping with the PUCCH is determined before the start of TBoMS PUSCH transmission, the UE can determine the amount of resource elements (REs) for the TBoMS PUSCH taking UCI transmission resources into account, and perform rate-matching of the TBoMS PUSCH based on this. The rate-matching includes bit selection and bit interleaving. When the TB consists of multiple CBs, rate-matching is performed for each CB by uniformly considering the effect of the number of REs for transmission of UCI.

Therefore, composition and the number of the rate-matched bits of each CB are different for the case where UCI multiplexing is performed and the case where UCI multiplexing is not performed.

When UCI multiplexing on TBoMS PUSCH is determined and performed after activation of TBoMS PUSCH transmission, for which the UE has determined rate-matching and started code block (CB) transmission, the rate-matching for the TBoMS PUSCH did not take UCI into account. It is necessary to improve the rate-matching process or introduce a new mechanism so that UCI multiplexing does not affect ongoing PUSCH transmission.

It is desired to provide methods to solve the problem of UCI multiplexing.

Technical Solution

An object of the present disclosure is to propose a wireless communication method, a user equipment, and a base station

In a first aspect, an embodiment of the invention provides a wireless communication method, executable in a user equipment (UE) , comprising:

determining, among symbols in a time unit on a physical uplink shared channel (PUSCH) , a time domain position of a foremost symbol that first satisfies a timeline limit for a type of UCI;

performing UCI multiplexing by multiplexing UCI belonging to the type of UCI on one or more PUSCH resources after the foremost symbol, wherein the multiplexed UCI is in response to a downlink signal.

In a second aspect, an embodiment of the invention provides a user equipment (UE) comprising a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the disclosed method.

In a third aspect, an embodiment of the invention provides a wireless communication method, executable in a base station, comprising:

obtain UCI multiplexing configuration of a user equipment (UE) ;

transmitting a downlink signal to the UE; and

receiving and decoding multiplexed UCI from the UE according to the UCI multiplexing configuration, wherein the multiplexed UCI is in response to the downlink signal;

wherein the UCI multiplexing configuration comprises a timeline limit for the type of UCI, the timeline limit is used for determining a foremost symbol among symbols in a time unit on a physical uplink shared channel (PUSCH) for UCI multiplexing.

In a fourth aspect, an embodiment of the invention provides a base station comprising a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the disclosed method.

The disclosed method may be implemented in a chip. The chip may include a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the disclosed method.

The disclosed method may be programmed as computer executable instructions stored in non-transitory computer-readable medium. The non-transitory computer readable medium, when loaded to a computer, directs a processor of the computer to execute the disclosed method.

The non-transitory computer-readable medium may comprise at least one from a group consisting of: a hard disk, a CD-ROM, an optical storage device, a magnetic storage device, a read only memory, a programmable read only memory, an erasable programmable read only memory, EPROM, an electrically erasable programmable read only memory and a flash memory.

The disclosed method may be programmed as computer program product, that causes a computer to execute the disclosed method.

The disclosed method may be programmed as a computer program, that causes a computer to execute the disclosed method.

Advantageous Effects

Embodiments of this disclosure are to provide methods to solve the problem of UCI multiplexing. The invention provides specific methods to define and indicate a time unit and a pattern of UCI multiplexing. An embodiment of the invention provides a UCI multiplexing method with foremost symbols defined for UCI multiplexing via rate matching and UCI multiplexing via puncturing. An embodiment of the invention provides a UCI multiplexing method to determine the number of coded modulation symbols per layer for different types of UCI and different UCI scenarios. An embodiment of the invention provides a UCI multiplexing method to realize multiplexing of repetitions of UCI.

Description of Drawings

In order to more clearly illustrate the embodiments of the present disclosure or related art, the following figures will be described in the embodiments are briefly introduced. It is obvious that the drawings are merely some embodiments of the present disclosure, a person having ordinary skill in this field can obtain other figures according to these figures without paying the premise.

FIG. 1 illustrates a schematic view of a telecommunication system.

FIG. 2 illustrates a schematic view showing a wireless communication method according to an embodiment of the invention.

FIG. 3 illustrates a schematic view showing an example of a timeline limit between a downlink signal and a UCI responding to the downlink signal in some scenarios.

FIG. 4 illustrates a schematic view showing an example of TOT (Transmission Occasion for TBoMS) .

FIG. 5 illustrates a schematic view showing an example of a TBoMS PUSCH with the scalingFactorK K and the parameter numberOfSlot.

FIG. 6 illustrates a schematic view showing signal processing stages of a UE.

FIG. 7 illustrates a schematic view showing UCI multiplexing patterns of per-TOT/per-TBoMS UCI multiplexing.

FIG. 8 illustrates a schematic view showing UCI multiplexing by rate matching and UCI multiplexing by puncturing.

FIG. 9 illustrates a schematic view showing an example of signaling for UCI multiplexing.

FIG. 10 illustrates a schematic view showing an example of a PUSCH processing time T _proc, 1 and a time interval between an HARQ-ACK feedback time and a PDSCH data receiving time.

FIG. 11 illustrates a schematic view showing a foremost symbol S ₀ and timeline limits for UCI multiplexing.

FIG. 12 illustrates a schematic view showing a foremost symbol S ₀ and timeline limits for UCI multiplexing with different UCI multiplexing patterns in UCI multiplexing time units.

FIG. 13 illustrates a schematic view showing an example of signaling for UCI repetition.

FIG. 14 illustrates a schematic view showing examples of per-TBoMS UCI multiplexing.

FIG. 15 illustrates a schematic view showing examples of per-TOT UCI multiplexing with repetitions and per-slot UCI multiplexing with repetitions.

FIG. 16 illustrates a schematic view showing examples of per-TOT UCI multiplexing with repetitions and per-slot UCI multiplexing with repetitions.

FIG. 17 illustrates a schematic view showing a system for wireless communication according to an embodiment of the present disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS

Embodiments of the disclosure are described in detail with the technical matters, structural features, achieved objects, and effects with reference to the accompanying drawings as follows. Specifically, the terminologies in the embodiments of the present disclosure are merely for describing the purpose of the certain embodiment, but not to limit the disclosure.

Fifth-generation (5G) wireless systems are generally a cellular communication system in a frequency range 2 (FR2) ranging from 24.25 GHz to 52.6 GHz, where multiplex transmit (Tx) and receive (Rx) beams are employed by a base station (BS) and/or a user equipment (UE) to combat a large path loss in a high frequency band. Due to hardware limitations and costs, the BS and the UE might only be equipped with a limited number of transmission and reception units (TXRUs) .

With reference to FIG. 1, a telecommunication system including a UE 10a, a UE 10b, a base station (BS) 20a, and a network entity device 30 executes the disclosed method according to an embodiment of the present disclosure. FIG. 1 is shown for illustrative not limiting, and the system may comprise more UEs, BSs, and CN entities. Connections between devices and device components are shown as lines and arrows in the FIGs. The UE 10a may include a processor 11a, a memory 12a, and a transceiver 13a. The UE 10b may include a processor 11b, a memory 12b, and a transceiver 13b. The base station 20a may include a processor 21a, a memory 22a, and a transceiver 23a. The network entity device 30 may include a processor 31, a memory 32, and a transceiver 33. Each of the

processors

11a, 11b, 21a, and 31 may be configured to implement proposed functions, procedures and/or methods described in the description. Layers of radio interface protocol may be implemented in the

processors

11a, 11b, 21a, and 31. Each of the

memory

12a, 12b, 22a, and 32 operatively stores a variety of programs and information to operate a connected processor. Each of the

transceivers

13a, 13b, 23a, and 33 is operatively coupled with a connected processor, transmits and/or receives radio signals or wireline signals. The UE 10a may be in communication with the UE 10b through a sidelink. The base station 20a may be an eNB, a gNB, or one of other types of radio nodes, and may configure radio resources for the UE 10a and UE 10b.

Each of the

processors

11a, 11b, 21a, and 31 may include application-specific integrated circuits (ASICs) , other chipsets, logic circuits and/or data processing devices. Each of the

memory

12a, 12b, 22a, and 32 may include read-only memory (ROM) , a random access memory (RAM) , a flash memory, a memory card, a storage medium and/or other storage devices. Each of the

transceivers

13a, 13b, 23a, and 33 may include baseband circuitry and radio frequency (RF) circuitry to process radio frequency signals. When the embodiments are implemented in software, the techniques described herein can be implemented with modules, procedures, functions, entities and so on, that perform the functions described herein. The modules can be stored in a memory and executed by the processors. The memory can be implemented within a processor or external to the processor, in which those can be communicatively coupled to the processor via various means are known in the art.

The network entity device 30 may be a node in a CN. CN may include LTE CN or 5G core (5GC) which includes user plane function (UPF) , session management function (SMF) , mobility management function (AMF) , unified data management (UDM) , policy control function (PCF) , control plane (CP) /user plane (UP) separation (CUPS) , authentication server (AUSF) , network slice selection function (NSSF) , and the network exposure function (NEF) .

With reference to FIG. 2, an example of a UE 10 in the description may include one of the UE 10a or UE 10b. An example of a base station 20 in the description may include the base station 200a. Uplink (UL) transmission of a control signal or data may be a transmission operation from a UE to a base station. Downlink (DL) transmission of a control signal or data may be a transmission operation from a base station to a UE. A wireless communication method is detailed in the following. The UE 10 and the base station 20, such as a gNB, execute the UCI multiplexing method to obtain UCI multiplexing configuration (208) . The UCI multiplexing configuration may comprise explicit or implicit configuration of UCI multiplexing. In an embodiment, the UCI multiplexing configuration comprises a timeline limit for the type of UCI. The timeline limit is used for determining a foremost symbol located in an earliest time unit among one or more transmission occasions in PUSCH resources for UCI multiplexing. In an embodiment, the UCI multiplexing configuration comprises an association between a configuration of a UCI multiplexing time unit and a configuration of a rate matching time unit. The rate matching time unit is configured for rate matching for transmission of UCI belonging to a type of UCI. The UCI multiplexing time unit is configured for UCI multiplexing that multiplexes the UCI on physical uplink shared channel (PUSCH) resources.

The base station 20 transmits a downlink signal 2091 to the UE 10 (209) , and the UE 10 receives the downlink signal 2091 from the base station 20 (210) .

The UE 10 determines, among symbols in a UCI multiplexing time unit on a physical uplink shared channel (PUSCH) , a time domain position of a foremost symbol that first satisfies a timeline limit for a type of UCI (212) .

The UE 10 performs UCI multiplexing by multiplexing UCI belonging to the type of UCI on one or more PUSCH resources after the foremost symbol, wherein the multiplexed UCI is in response to the downlink signal (214) . The UCI multiplexing time unit may comprise one slot, one TOT, or one TBoMS.

The UE 10 performs rate matching for transmission of UCI belonging to a type of UCI based on a rate matching time unit and performs UCI multiplexing by multiplexing the UCI in PUSCH transmission 2141 on physical uplink shared channel (PUSCH) resources based on a UCI multiplexing time unit, a timeline limit for the type of UCI, and a foremost symbol satisfies the timeline limit, wherein the foremost symbol is located in an earliest time unit among one or more transmission occasions in the PUSCH resources for the UCI multiplexing. The foremost symbol may be a first symbol of the earliest time unit or a symbol that first satisfies the timeline limit and located in the earliest time unit. The UCI multiplexing may be performed through puncturing or rate matching. When the UCI multiplexing is performed through puncturing, the timeline limit comprises a timeline limit for UCI transmission without multiplexing. When the UCI multiplexing is performed through rate matching, the timeline limit comprises a timeline limit for UCI transmission with multiplexing. Example of the timeline limit for UCI transmission with multiplexing and without multiplexing are shown in Table 3.

In an embodiment, the UE 10 performs UCI multiplexing based on a UCI multiplexing time unit according to the UCI multiplexing configuration, comprising association between a configuration of the UCI multiplexing time unit and a configuration of the rate matching time unit. The UCI may belong to one of a plurality of types of UCI. Each UCI type of plurality of types of UCI is associated with a scenario (or use case) which is illustrated in the description. UCI, such as HARQ-ACK, a CSI report part one, or a CSI report part two, of a type of UCI is to respond a downlink signal, such as PDSCH or DCI, or CSI report triggering PDCCH, in the associated scenario. The rate matching time unit may comprise slot, ToT, or TBoMS. ToT represents a transmission occasion for TBoMS. TBoMS represents one TB over multi-slot (TBoMS) . Radio resources for UCI multiplexing may be referred to as UCI multiplexing resources.

The base station 20 receives and decodes the multiplexed UCI according to the UCI multiplexing configuration (216) .

UCI includes scheduling request (SR) , hybrid automatic repeat request (HARQ) -acknowledgement -ACK) and channel state information (CSI) . Among them, HARQ-ACK and CSI can be transmitted together with uplink shared channel (UL-SCH) data on PUSCH. CSI consists of two parts: CSI Part 1 and CSI Part 2. CSI Part 1 has a fixed payload size and is used to identify bits of information from CSI Part 2, so CSI Part 1 is always transmitted before CSI Part 2.

In current UCI multiplexing mechanism, beta offset values are defined for a UE to determine a number of resources for multiplexing UCI information and for multiplexing CSI reports in a PUSCH. Offset values are predefined in specification. The beta offset values are signaled to a UE with an index either by a DCI or by higher layers signal.

The split of resources between UCI and PUSCH data is controlled through beta factors (i.e., the beta offsets) for different kinds of UCI. Table 1 and Table 2 provide examples of mapping between an index (e.g.,

) signaled by higher layers and the beta offsets

or

Table 1

Table 2

The following formulas (1) - (5) are for calculation of Q′, the number of coded modulation symbols per layer, for UCI multiplexing by rate-matching in current specification for UCI transmission of:

When the UCI comprises HARQ-ACK transmission on PUSCH not using repetition type B with UL-SCH (Q′ _ACK) , the Q′ is Q′ _ACK calculated by the following formula:

When the UCI comprises CSI part 1 transmission on PUSCH not using repetition type B with UL-SCH (Q′ _CSI-1) , the Q′ is Q′ _CSI-1 calculated by the following formula:

When the UCI comprises CSI part 2 transmission on PUSCH not using repetition type B with UL-SCH (Q′ _CSI-2) , the Q′ is Q′ _CSI-2 calculated by the following formula:

When the UCI comprises CG-UCI transmission on PUSCH with UL-SCH (Q′ _Q-UCI) , the Q′ is Q′ _CG-UCI calculated by the following formula:

When the UCI comprises HARQ-ACK and CG-UCI transmission on PUSCH with UL-SCH (Q′ _ACK) , the Q′ is Q′ _ACK calculated by the following formula:

● α is configured by higher layer parameter scaling.

●

or

for respective scenarios.

● C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

■ if the DCI format scheduling the PUSCH transmission includes a CBGTI field indicating that the UE shall not transmit the r-th code block (CB) , K _r=0; or

■ otherwise, K _r is the r-th code block size for UL-SCH of the PUSCH transmission.

●

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for

in the PUSCH transmission.

is the total number of OFDM symbols of the PUSCH, including all OFDM symbols used for DMRS.

In current technical specification (TS) 38.214, a timing offset is configured for PDSCH HARQ-ACK and CSI reporting on PUSCH. FIG. 3 shows an example of a timeline limit between a downlink signal and a UCI responding the downlink signal in some scenarios. A time interval between a downlink signal and a UCI responding the downlink signal in some scenarios is an actual processing time or preparation time of the UCI. The actual processing time of the UCI is required to be equal to or greater than a timeline limit, shown as a timeline in the FIG. 3. The timeline limits for different scenarios are illustrated in Table 3.

Table 3

Example of the timeline limit for UCI transmission with multiplexing comprise T _proc, 1, T _{proc, release}, T _proc, 2, T _proc, CSI, and T′ _prov, CSI.

Example of the timeline limit for UCI transmission without multiplexing comprise

and

each of which is labeled with a superscription mux. Note that example of definition of the timeline limits can be found in TS 38.214.

● PDSCH processing procedure time T _proc, 1:

■ The first uplink symbol, which carries the HARQ-ACK information, starts no earlier than at symbol L1, where L1 is defined as the next uplink symbol with its CP starting after T _proc, 1 after the end of the last symbol of the PDSCH carrying the TB being acknowledged, then the UE 10 shall provide a valid HARQ-ACK message.

● SPS Release processing procedure time T _{proc, release}:

■ The HARQ-ACK information in response to an SPS PDSCH release starts after N symbols (T _{proc, release}) from the last symbol of a PDCCH providing the SPS PDSCH release.

● CSI computation time T _proc, CSI, T′ _proc, CSI,

or

■ When the CSI request field on a DCI triggers a CSI report (s) on PUSCH, the UE 10 shall provide a valid CSI report for the n-th triggered report,

◆ if the first uplink symbol to carry the corresponding CSI report (s) including the effect of the timing advance, starts no earlier than at symbol Zref, and

◆ if the first uplink symbol to carry the n-th CSI report including the effect of the timing advance, starts no earlier than at symbol Z'ref (n) .

◆ Z _ref for CSI report part one is defined as the next uplink symbol with its cyclic prefix (CP) starting T _proc, CSI after the end of the last symbol of the PDCCH triggering the CSI report (s) .

◆ z′ _ref (n) for CSI report part two is defined as the next uplink symbol with its CP starting T′ _proc, CSIafter the end of the last symbol in time of the latest of CSI resource.

● PUSCH preparation procedure time T _proc, 2 or

■ The first uplink symbol in the PUSCH for a transport block is no earlier than at symbol L2, where L2 is defined as the next uplink symbol starting T _proc, 2 after the end of the reception of the last symbol of the PDCCH carrying the DCI scheduling the PUSCH, then the UE 10 shall transmit the transport block. TOT definition:

In the current PUSCH channel design, the transmission occasion concept is used in physical channel generation, but no explicit definition can be used for TB size determination. FIG. 4 is a schematic diagram showing an example of TOT (Transmission Occasion for TBoMS) , where U represents an uplink slot, D represents a downlink slot, and S represents a special slot. For TDD case, S slot may or may not be contained in a TOT. Each of TBoMS 2141a and TBoMS 2141b is an example of the uplink transmission 2141.

An explicit definition means UE 10 is configured with a TOT containing how many available time slots explicitly. An implicit definition means UE 10 deduces how many available slots each TOT contains based on TDD DL/UL configuration.

In current 3GPP standardization work, such as in RAN1#106e meeting, a scaling factor K represented by a parameter scalingFactorK was introduced for TBoMS TBS determination. The scaling factor K can be an information element (IE) of time domain resources allocation (TDRA) for TBoMS, and the TDRA can be a separate TDRA for TBoMS, or the legacy TDRA reused for TBoMS. If it is a reused legacy TDRA, the scalingFactorK is dedicated for TBoMS, and enabled jointly with the TBoMS capability. A parameter numberOfSlot representing a number of slot is an integer multiple of scalingFactorK, preferably. The scalingFactorK can be obtained by determining a row index of a TDRA list via RRC or DCI. FIG. 5 is a schematic diagram showing an example of a TBoMS PUSCH with the scalingFactorK K and the parameter numberOfSlot. TBoMS 2141c is an example of the uplink transmission 2141.

Alternatively, the scaling factor K can be indicated by a DCI scheduling TBoMS PUSCH or RRC signaling. A new field in DCI or some current fields in DCI, such as FDRA, may be used to indicate the parameter scalingFactorK.

The following is an example of an information element (IE) of time domain resource allocation (TDRA) for TBoMS, including the added parameter scalingFactorK. The TDRA may be a dedicated TDRA for TBoMS or a legacy TDRA reused to TBoMS.

Table 4

The scaling factor K can be used to define TOT implicitly. After the UE 10 obtains K value, K implicitly specifies the number of available slots which constitute a TOT. Preferably, the number of available slots of TBoMS is an integer multiple of K. If the available slots are not an integer multiple of K, except for the first or last TOT that contains fewer available slots, each TOT contains K available slots.

Additionally, if the total number of available slots of TBoMS is not a large value (e.g., 2, 3, 4) , multiple TOTs are not necessary, and one TOT might be enough. The function of implicitly determining TOT by the scaling factor K can be disabled by default, or the base station 20, such as a gNB, indicates whether it is disabled or not.

In some embodiments, UE 10 reports to the base station 20, such as a gNB, a set of patterns of UCI multiplexing that is supported by the UE. The set of patterns of UCI multiplexing may be reported as a portion of UE capability. The base station 20 receives the set of patterns and performs the above the procedure using the pattern set. The first symbol S ₀:

If one of the PUCCH transmissions or PUSCH transmissions is in response to a DCI format detected by the UE, the UE 10 expects that the first symbol S ₀ (i.e., the foremost symbol) in a slot of the earliest PUSCH, among a group of overlapping PUCCHs and PUSCHs, satisfies the following timeline limits. The timeline limits are shown in Table 3. These timeline limits are time intervals required for UE 10 processing PDSCH (such as demodulation and decoding of received data) , CSI computing time, or processing SPS release.

For example, the PUSCH processing time T _proc, 1 is defined in the current specification as a timeline limit. FIG. 10 shows an example of a PUSCH processing time T _proc, 1 and a time interval between an HARQ-ACK feedback time and a PDSCH data receiving time. During downlink data transmission, the network needs to indicate the feedback time of HARQ-ACK/NACK to UE. The UE 10 needs to send an ACK/NACK at the specified feedback time. The time interval between the feedback time and PDSCH data receiving time must be greater than T _proc, 1; otherwise, the UE 10 cannot complete PDSCH processing before the ACK/NACK feedback.

Similarly, when the UE 10 receives PDCCH DCI for scheduling PUSCH, it also needs a time interval to prepare data. Therefore, the PUSCH processing time Tproc, 2 is defined in the current specification as a timeline limit. The network indicates a specified PUSCH transmission time to the UE, and the UE 10 transmits PUSCH at the specified PUSCH transmission time. The time interval between the specified PUSCH transmission time and the last symbol of the PDCCH DCI must be greater than the PUSCH processing time or preparation time represented by the time limit; otherwise, the UE 10 cannot complete data preparation before the specified time.

For the other scenarios with UCI multiplexing on PUSCH, there are similar timeline as above. The related scenarios and timeline limits are described in Table 5.

Table 5

A timeline limit is different for the cases with and without multiplexing. The reason for the difference is that UCI multiplexing is performed via rate-matching in current standard, and processing time or preparation time for other type messages should be considered. Only a single S ₀ is introduced to represent the first symbol of the earliest PUSCH, as shown in FIG. 3.

For UCI multiplexing performed via puncturing, the processing time impact on PUSCH transmission will be ignored, and S ₀ can be defined for the overlapping PUCCH and PUSCH channels When the UCI multiplexing comprises UCI multiplexing by puncturing, a processing time T _proc, 1 for the UCI and a foremost symbol S ₀ of an earliest TOT of the UCI are determined. When the UCI multiplexing is performed through puncturing, the timeline limit comprises a timeline limit for UCI transmission without multiplexing. The foremost symbol S ₀ is defined as the first symbol of the earliest time unit on PUSCH for the UCI multiplexing where the first symbol satisfying a time line limit of the UCI. FIG. 11 is a schematic diagram that takes PDSCH HARQ-ACK and PUSCH scheduling as an example. TBoMS 2141d and TBoMS 2141e are examples of uplink transmission 2141. The TBoMS 2141d comprises UCI that responds to a downlink signal 2143d. The TBoMS 2141e comprises UCI that responds to a downlink signal 2143e. The other scenarios are similar, such as scenarios of CSI and SPS PDSCH release. In an embodiment, the foremost symbol S ₀ in the TBoMS 2141d is a symbol (e.g., sixth symbol in first slot of 2141d) in an earliest time unit (e.g., a 1 ^st slot, TOT, or TBoMS) of the UCI, that first satisfies a timeline limit (i.e., timeline 1) of the UCI. In another embodiment, the foremost symbol S ₀ in the TBoMS 2141e is a fist symbol (e.g., first symbol in first slot of 2141e) leading an earliest time unit (e.g., a 1 ^st slot, TOT, or TBoMS) of the UCI, that satisfies a timeline limit (i.e., timeline 2) of the UCI. The foremost symbol S ₀ of an earliest time unit (e.g., a 1 ^st slot, TOT, or TBoMS) of a TBoMS PUSCH transmission may be scheduled by a DCI.

For UCI multiplexing performed via rate-matching, the position of S ₀ is related to UCI multiplexing pattern. When the UCI multiplexing comprises UCI multiplexing by rate-matching, a processing time T _proc, x for the UCI and a foremost symbol S ₀ of an earliest TOT of the UCI are determined for the UCI and PUSCH transmission that is multiplexed with the UCI on the PUSCH resources. When the UCI multiplexing is performed through rate matching, the timeline limit comprises a timeline limit for UCI transmission with multiplexing. S ₀ corresponds to the first symbol at the earliest UL slot or TOT of PUSCH rather than the first symbol of the overlapping slot.

Whether the UCI multiplexing is performed based on puncturing or rate matching, a pattern of UCI occupation in a slot in a subsequent time unit (e.g., a i-th slot, TOT, or TBoMS, where the variable i is an integer greater than 1 and no greater than a maximum of the numbering of the last time unit for the UCI multiplexing) for the UCI multiplexing may be the same with or different from a pattern of UCI occupation in a slot in a 1st time unit for the UCI multiplexing.

FIG. 11 shows examples where a pattern of UCI occupation in a slot in each subsequent time unit for the UCI multiplexing is the same with a pattern of UCI occupation in a slot in a 1st time unit for the UCI multiplexing.

FIG. 12 shows examples where a pattern of UCI occupation in a slot in a subsequent time unit for the UCI multiplexing is the different from a pattern of UCI occupation in a slot in a 1st time unit for the UCI multiplexing. Note that the time unit of slot is illustrated in the examples but is not for limiting the invention, the time unit for UCI multiplexing may be a slot, a TOT, or a TBoMS PUSCH. The foremost symbol S ₀ may be allocated for the UCI for UCI multiplexing or not. That is, transmission of the UCI on the PUSCH resources may be include the foremost symbol S ₀ or not. Transmission of the UCI may start from an available symbol subsequent to the foremost symbol S ₀ on the PUSCH resources.

UCI multiplexing:

Based on the current progress of 3GPP standardization efforts regarding TBoMS structure and rate-matching, a TBoMS may contain multiple TOTs (transmission occasions for TBoMS) . Rate-matching may be performed per slot, per TOT or across the whole TBoMS. In an embodiment of the invention, the time domain units of rate-matching are compatible with time domain units of UCI multiplexing. That is, a time unit of rate-matching is greater than or equal to a time unit of UCI multiplexing. A time unit of rate-matching is referred to as rate matching (RM) time unit, and a time unit of UCI multiplexing is referred to as a UCI multiplexing time unit. FIG. 6 shows signal processing stages of the UE 10. The UE 10 comprises a code block segment stage 111, a coding stage 112, a rate matching stage 113, a code block concatenation stage 114, and a multiplexing stage 115 for UCI, such as UL-SCH 2142a, CSI report 2142b, and HARQ-ACK 2142c. The code block segment stage 111 performs code block segment for the UCI. The coding stage 112 performs coding for the UCI. The rate matching stage 113 performs rate matching for the UCI. The code block concatenation stage 114 performs code block concatenation for the UCI. The multiplexing stage 115 performs multiplexing for the UCI.

Table 6 shows mappings between time units for rate-matching and time units for UCI multiplexing. the UCI multiplexing time unit is no greater than the rate matching time unit.

● For per-slot rate-matching, UCI multiplexing is per-slot. The configuration of the UCI multiplexing time unit indicates per-slot based UCI multiplexing when the configuration of the rate matching time unit indicates per-slot based rate matching.

● For per-TOT rate-matching, UCI multiplexing may be per-slot or per-TOT. The configuration of the UCI multiplexing time unit indicates one of per-slot based UCI multiplexing or per-TOT based UCI multiplexing when the configuration of the rate matching time unit indicates per-TOT based rate matching.

● For per-TBoMS rate-matching, UCI multiplexing may be per-slot, per-TOT, or per-TBoMS. The configuration of the UCI multiplexing time unit indicates one of per-slot based UCI multiplexing, per-TOT based UCI multiplexing, or per-TBoMS based UCI multiplexing when the configuration of the rate matching time unit indicates per-TBoMS based rate matching.

Table 6: Combinations of RM time unit &UCI multiplexing time unit

FIG. 7 shows UCI multiplexing patterns of per-TOT/per-TBoMS UCI multiplexing, where one TOT consisting of 3 slots is illustrated. FIG. 4 is just one example and not precludes other cases where S slot and more slots are included in a TOT. TOTs can be back-to-back or non-back-to-back. The slot number of each TOT can be same or not.

UCI multiplexing pattern:

For pattern 1: According to pattern 1, the UCI is multiplexed on an overlapping slot of a PUSCH, which is overlapped with a PUCCH. An overlapping slot of a PUSCH is a slot of the PUSCH that overlaps with a PUCCH of the UCI in time. The UE 10 may determine an overlapping slot of a PUSCH as a transmission occasion for the PUSCH.

If UCI multiplexing is determined before the start of PUSCH preparation, the UE 10 may perform rate-matching or puncture for UCI multiplexing. The UE 10 obtains an onset time at which activation of the UCI multiplexing is determined and determines whether the onset time is before a range of PUSCH preparation time of the UE 10. When the onset time is before the range of PUSCH preparation time of the UE 10, the UE 10 may perform the UCI multiplexing via rate-matching or puncturing. In an embodiment, when the onset time is before the range of PUSCH preparation time of the UE 10, the UE 10 performs the UCI multiplexing via rate-matching, and the foremost symbol is a first symbol of the earliest time unit that satisfies the timeline limit or a symbol that first satisfies the timeline limit and located in the earliest time unit. When the onset time is in the range of PUSCH preparation time of the UE or after a start position of the range of PUSCH preparation time of the UE 10, the UE 10 may perform the UCI multiplexing via puncturing. In an embodiment, when the onset time is in the range of PUSCH preparation time of the UE or after a start position of the range of PUSCH preparation time of the UE 10, the UE 10 performs the UCI multiplexing via puncturing, and the foremost symbol is a symbol that first satisfies the timeline limit and located in the earliest time unit. As shown in FIG. 8 (a) , when UCI multiplexing is determined at time T1 before the PUSCH preparation time, the UE 10 can perform rate-matching for UCI multiplexing. As shown in FIG. 8 (b) , when UCI multiplexing is determined at time T2 after a start position of the PUSCH preparation time, the UE 10 can perform puncturing for UCI multiplexing. This mechanism also is applicable for per-slot RM with per-slot UCI multiplexing.

For pattern 2-4: The UCI is multiplexed across multiple slots or all slots of an overlapping TOT of a TBoMS PUSCH, which is overlapped with a PUCCH. An overlapping TOT of a TBoMS PUSCH is a TOT of the TBoMS PUSCH that overlaps with a PUCCH of the UCI in time. The UE 10 may determine an overlapping TOT of a PUSCH as a transmission occasion for the PUSCH. Some combinations are shown in patterns 2 to 4.

● Pattern 2: According to pattern 2, UCI is multiplexed across the overlapping slot and one or more slots after the overlapping slot in the overlapping TOT.

● Pattern 3: According to pattern 3, UCI is multiplexed across the overlapping slot and the previous slot (s) (i.e., one or more slots before the overlapping slot) in the overlapping TOT.

● Pattern 4: According to pattern 4, UCI is multiplexed across all slots of the overlapping TOT.

■ In this case of pattern 4, multiple slots are evenly or unevenly multiplexed with the same resource element (RE) or REs and it reduces the impact on TBoMS transmission. UCI multiplexing can be performed via puncturing, regardless of when the UCI multiplexing on TBoMS PUSCH is determined. Of course, if the interval between the determination of UCI multiplexing and the start of overlapping transmission (e.g., PUSCH overlapped with PUCCH, including an overlapping slot or an overlapping TOT) satisfies the timeline limit, UCI multiplexing can be performed via rate-matching.

■ In general, after bits interleaving, high-priority system bits are mapped to the front of the transmission occasion for the PUSCH, so pattern 2 may have less impact on TBoMS transmission, regardless of whether UCI multiplexing is performed via puncturing or rate-matching. Pattern 2 is preferred.

For patterns 5 to 7: the UCI is multiplexing across multiple TOTs or all ToTs of a TBoMS PUSCH transmission, which is overlapped with a PUCCH. Some combinations are shown in patterns 5 to 7.

● Pattern 5: According to pattern 5, UCI is multiplexed across the overlapping TOT and one or more TOTs) after the overlapping TOT in the TBoMS PUSCH transmission.

● Pattern 6: According to pattern 6, UCI is multiplexed across the overlapping TOT and the previous TOT (s) (i.e., one or more TOTs before the overlapping TOT) in the overlapping TBoMS PUSCH transmission.

● Pattern 7: According to pattern 7, UCI is multiplexed across all TOTs of the TBoMS PUSCH transmission.

■ In this case, multiple TOTs are multiplexed, and it reduces the impact on TBoMS transmission. UCI multiplexing can be performed via puncturing, regardless of when UCI multiplexing on TBoMS PUSCH is determined. Of course, if the interval between the determination of UCI multiplexing and the start of overlapping transmission satisfies the timeline limit, UCI multiplexing can be performed via rate-matching.

Other combinations are not precluded. For example, different slot combinations within one TOT with a greater k.

In some embodiments, for the multiplexing resources of per-TOT/per-TBoMS UCI multiplexing, UE 10 is configured/indicated a pattern of UCI multiplexing by the base station 20, and based on the pattern to perform UCI multiplexing.

In an embodiment, the UE has one default pattern of UCI multiplexing. In some embodiments, one pattern of UCI multiplexing is provided to UE 10 via TBoMS configuration or PUCCH configuration by the base station 20, such as a gNB. Then UE 10 performs UCI multiplexing based on the pattern, when PUCCH and TBoMS PUSCH overlaps.

With reference to FIG. 9, in some embodiments, UE 10 is configured a set/list of patterns of UCI multiplexing in TBoMS configuration or PUCCH configuration by the base station 20, such as a gNB (220) . The base station 20 provides the set of patterns of UCI multiplexing to the UE 10 via TBoMS configuration or PUCCH configuration. The base station 20 transmits an indication in DCI or RRC signaling to the UE 10 to indicate which pattern in the sets/list of the patterns is adopted or selected for UCI multiplexing between the base station 20 and the UE 10. The UE 10 transmits the UCI on a TBoMS PUSCH transmission to the base station 20 (224) .

Resources of UCI multiplexing:

In Rel-15/16, the resources on PUSCH for UCI multiplexing is derived based on RRC parameters beta-offset

scaling (α) and PUSCH length

or N . The number of symbols for UCI multiplexing on a PUSCH is derived based on the formulas (1) - (5) .

For per-TBoMS rate-matching,

is the total number of OFDM symbols of the PUSCH of N allocated slot for TBoMS. C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission . Since C _UL-SCH is correlated with transport block size (TBS) , and TBS of TBoMS is correlated with the scaling factor value k.At least the scaling factor value k = N is supported in the agreements of RAN1#106e meeting, where N is the number of allocated slots for a single TBoMS. Other values of k with a range 1<k<N may be supported in the future. K _r is the r-th code block size for UL-SCH of the PUSCH transmission.

If the above formulas (1) - (5) are reused by TBoMS, the number of resource elements used for UCI transmission may increase dramatically and overly occupy the resources of TBoMS. To maintain the resources or reliability of UCI similar to the current specification, two embodiments are provided as option 1 and option 2 in the following.

Option 1: A set of new formulas are introduced, Q′ (i.e., the number of coded modulation symbols per layer) should be scaled by k/N. The first parameter of the min function must be scaled by k/N, but the second parameter scaled by k/N is optional. In an embodiment, a number Q′ of coded modulation symbols per layer for the UCI is calculated based on an RRC parameter beta-offset

scaled by k/N, k is a scaling factor for TBoMS, and N is the number of allocated slots for a single TBoMS. The number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on the RRC parameter beta-offset

scaled by k/N, and the second input parameter is calculated based on a scaling value α, and the scaling value α is scaled by k/N.

When the type of UCI is HARQ-ACK, the beta-offset

is

the number Q′ of coded modulation symbols per layer is Q′ _ACK that is obtained from:

When the type of UCI is CSI part one, the beta-offset

is

the number Q′ of coded modulation symbols per layer is Q′ _CSI-1 that is obtained from:

When the type of UCI is CSI part two, the beta-offset

is

the number Q′ of coded modulation symbols per layer is Q′ _CSI-2 that is obtained from:

When the type of UCI is HARQ-ACK and CG UCI, the beta-offset

is

or

the number Q′ of coded modulation symbols per layer is Q′ _CG-UCI and Q′ _ACK that is obtained from:

Option 2: The legacy formulas (1) to (5) are reused, but the parameters (

and/or α) are reinterpreted as following:

●

● α = (k/N) ·scaling (higher layer parameter scaling) . Note that α scaled by k/N is optional.

In the embodiment, the number Q′ of coded modulation symbols per layer for the UCI is calculated based on an RRC parameter beta-offset

● When the type of UCI is HARQ-ACK, the beta-offset

is

k is a scaling factor for TBoMS, and N is the number of allocated slots for a single TBoMS.

● When the type of UCI is CSI part one, the beta-offset

is

● When the type of UCI is CSI part two, the beta-offset

is

● When the type of UCI is HARQ-ACK and CG UCI, the beta-offset

is

or

In an embodiment, the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on the RRC parameter beta-offset

scaled by k/N, and the second input parameter is calculated based on a scaling value α, and the scaling value α is a higher layer parameter “scaling” scaled by k/N.

For per-TOT rate-matching, Q′ is the number of coded modulation symbols per layer for the i-th TOT. The number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on is a total number

of OFDM symbols of i-th TOT in a PUSCH transmission and a number C _UL-SCH (i) of code blocks of the i-th TOT in the PUSCH transmission, and the second input parameter is calculated based on the total number

of OFDM symbols of the i-th TOT in the PUSCH transmission.

●

is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission.

● C _UL-SCH (i) is the number of code blocks of the i-th TOT in the PUSCH transmission.

When the type of UCI is HARQ-ACK, the beta-offset

is

When the type of UCI is CSI part one, the beta-offset

is

When the type of UCI is CSI part two, the beta-offset

is

When the type of UCI is HARQ-ACK and CG UCI, the beta-offset

is

or

This mechanism maintains the resource or reliability of UCI similar to the current specification without overly occupying TBoMS resources.

UCI repetition:

When TBoMS is scheduled, UE 10 may be located at the edge of the cell with poor coverage. If UCI multiplexing occurs at this time, PUCCH (UCI) coverage may also be poor. UCI coverage also needs to be enhanced, which can be addressed by increasing UCI resources with UCI repetition.

With reference to FIG. 13, in an embodiment, the base station 20 explicitly or implicitly provides a UCI repetition indicator (optional) (230) and a UCI repetition number r (232) to the UE. The UE 10 is provided a UCI repetition number r in a downlink control signal, such as a DCI, RRC signaling, or TDRA field, representing a number of repetitions of the UCI. The base station 20 may provide the UCI repetition indicator and the UCI repetition number r via a DCI, RRC signaling, or TDRA field. In an example of implicitly signaling the UCI repetition number r,

or rounding of N/k. UE 10 allocates radio resources for the UCI with r repetitions (234) . The UE 10 repeats the UCI r times as r repetitions and transmits the r repetition on PUSCH (236) .

For per-TBoMS rate-matching:

● In an embodiment of an implicit configuration of repetition versions (RVs) of a UCI on PUSCH, UCI is repeated r times (

or rounding of N/k) , where k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS. The formulas (1) to (5) are used to calculate the total UCI multiplexing resources for multiplexing while the resources used for a single repetition version (RV) follow the formulas (1.1) to (5.1) . The repetitions of the UCI on PUSCH can be the same. For example, all repetitions are the same repetition version and denoted as rv ₀. Alternatively, repetitions of the UCI on PUSCH can circle through a sequence according to certain rules. For example, a first RV, a second RV, a third RV, and a fourth RV are respectively denoted as rv ₀, rv ₁, rv ₂ and rv ₃. The repetitions of the UCI on PUSCH can circle a sequence of rv ₀, rv ₃, rv ₂, and rv ₁.

■ If N is an integer multiple of k, each repetition of the TBoMS has the same number of UCI resources, as shown in FIG. 14 (a) . TBoMS 2141h, TBoMS 2141i, and TBoMS 2141j are examples of the uplink transmission 2141.

■ If N is not an integer multiple of k and

each repetition of the TBoMS may have the same number of UCI resources except the last or first repetition of the TBoMS, which may have more UCI resources, as shown in FIG. 14 (b) .

■ If N is not an integer multiple of k and

each repetition of the TBoMS may have the same number of UCI resources except the last or first repetition of the TBoMS, which may have less UCI resources, as shown in FIG. 14 (c) .

● In another embodiment of an implicit configuration of repetition versions of a UCI on PUSCH, UCI is repeated in r repetitions from the first slot to the last slot of the TBoMS PUSCH transmission implicitly. The repetition versions of the UCI on PUSCH can be the same or circle according to certain rules, such as cycling a sequence of rv ₀, rv ₃, rv ₂, and rv ₁. In some embodiments, r can be limited by a maximum value, such as 8 or 16. (implicit)

● In another embodiment of an explicit configuration of repetition versions of a UCI on PUSCH, the UE 10 is provided a UCI repetition number r by the base station 20, such as a gNB. The UE 10 determines the UCI multiplexing resources as r times multiple of the resources for a single RV. The UCI is repeated r times. The repetition versions of the UCI on PUSCH can be the same or circle according to certain rules, such as cycling a sequence of rv ₀, rv ₃, rv ₂, and rv ₁.

For per-TOT/per-slot rate-matching:

● With reference to FIG. 15, in an embodiment, the UE 10 determines the UCI multiplexing resources as r times multiple of the resources for a single repetition in a TOT/slot, and the UE 10 transmits repetitions of the UCI in a TOT/slot. TBoMS 2141k and TBoMS 2141m are examples of the uplink transmission 2141. The base station 20 determines that, when UCI multiplexing resources are r times multiple of resources for a single repetition in a TOT/slot, repetitions of the UCI are transmitted by the UE 10 in a TOT/slot. The repetition versions of the UCI on PUSCH can be the same or circle according to certain rules, such as cycling a sequence of rv ₀, rv ₃, rv ₂, and rv ₁.

■ In some embodiments, the UE 10 is provided a UCI repetition number r by the base station 20 explicitly.

■ In some embodiments, UCI is repeated in r repetitions from the first TOT/slot to the last time TOT/slot of the TBoMS PUSCH transmission automatically. In some embodiments, r can be limited by a maximum value, such as 8 or 16.

● With reference to FIG. 16, in an embodiment, the UE 10 determines the UCI multiplexing resources for a single repetition in the r TOTs/slots, and UE 10 transmits repetitions of the UCI in r TOTs/slots. The base station 20 determines that, when the UCI multiplexing resources for a single repetition of the UCI is in the r TOTs/slots, repetitions of the UCI are transmitted by the UE 10 in r TOTs/slots. The repetition versions of the UCI on PUSCH can be the same or circle according to certain rules, such as cycling a sequence of rv ₀, rv ₃, rv ₂, and rv ₁.TBoMS 2141n and TBoMS 2141o are examples of the uplink transmission 2141.

■ In some embodiments, UCI is repeated from the first TOT/slot to the last TOT/slot of the TBoMS PUSCH transmission automatically. In some embodiments, r can be limited by a maximum value, such as 8 or 16.

FIG. 17 is a block diagram of an example system 700 for wireless communication according to an embodiment of the present disclosure. Embodiments described herein may be implemented into the system using any suitably configured hardware and/or software. FIG. 17 illustrates the system 700 including a radio frequency (RF) circuitry 710, a baseband circuitry 720, a processing unit 730, a memory/storage 740, a display 750, a camera 760, a sensor 770, and an input/output (I/O) interface 780, coupled with each other as illustrated.

The processing unit 730 may include circuitry, such as, but not limited to, one or more single-core or multi- core processors. The processors may include any combinations of general-purpose processors and dedicated processors, such as graphics processors and application processors. The processors may be coupled with the memory/storage and configured to execute instructions stored in the memory/storage to enable various applications and/or operating systems running on the system.

The radio control functions may include, but are not limited to, signal modulation, encoding, decoding, radio frequency shifting, etc. In some embodiments, the baseband circuitry may provide for communication compatible with one or more radio technologies. For example, in some embodiments, the baseband circuitry may support communication with 5G NR, LTE, an evolved universal terrestrial radio access network (EUTRAN) and/or other wireless metropolitan area networks (WMAN) , a wireless local area network (WLAN) , a wireless personal area network (WPAN) . Embodiments in which the baseband circuitry is configured to support radio communications of more than one wireless protocol may be referred to as multi-mode baseband circuitry. In various embodiments, the baseband circuitry 720 may include circuitry to operate with signals that are not strictly considered as being in a baseband frequency. For example, in some embodiments, baseband circuitry may include circuitry to operate with signals having an intermediate frequency, which is between a baseband frequency and a radio frequency.

In various embodiments, the system 700 may be a mobile computing device such as, but not limited to, a laptop computing device, a tablet computing device, a netbook, an ultrabook, a smartphone, etc. In various embodiments, the system may have more or less components, and/or different architectures. Where appropriate, the methods described herein may be implemented as a computer program. The computer program may be stored on a storage medium, such as a non-transitory storage medium.

The embodiment of the present disclosure is a combination of techniques/processes that can be adopted in 3GPP specification to create an end product.

If the software function unit is realized and used and sold as a product, it can be stored in a readable storage medium in a computer. Based on this understanding, the technical plan proposed by the present disclosure can be essentially or partially realized as the form of a software product. Or, one part of the technical plan beneficial to the conventional technology can be realized as the form of a software product. The software product in the computer is stored in a storage medium, including a plurality of commands for a computational device (such as a personal computer, a server, or a network device) to run all or some of the steps disclosed by the embodiments of the present disclosure. The storage medium includes a USB disk, a mobile hard disk, a read-only memory (ROM) , a random access memory (RAM) , a floppy disk, or other kinds of media capable of storing program codes.

Embodiments of this disclosure is to provide methods to solve the problem of UCI multiplexing. The invention provides specific methods to define and indicate a time unit and a pattern of UCI multiplexing. An embodiment of the invention provides a UCI multiplexing method with foremost symbols defined for UCI multiplexing via rate matching and UCI multiplexing via puncturing. An embodiment of the invention provides a UCI multiplexing method to determine the number of coded modulation symbols per layer for different types of UCI and different UCI scenarios. An embodiment of the invention provides a UCI multiplexing method to realize multiplexing of repetitions of UCI.

While the present disclosure has been described in connection with what is considered the most practical and preferred embodiments, it is understood that the present disclosure is not limited to the disclosed embodiments but is intended to cover various arrangements made without departing from the scope of the broadest interpretation of the appended claims.

Claims

A wireless communication method, executable in a user equipment (UE) , comprising:

determining, among symbols in a time unit on a physical uplink shared channel (PUSCH) , a time domain position of a foremost symbol that first satisfies a timeline limit for a type of UCI;

performing UCI multiplexing by multiplexing UCI belonging to the type of UCI on one or more PUSCH resources after the foremost symbol, wherein the multiplexed UCI is in response to a downlink signal.
The method of claim 1, wherein the time unit comprises one slot, one TOT, or one TBoMS.
The method of claim 1, wherein the UCI multiplexing is performed through puncturing or rate matching;

when the UCI multiplexing is performed through puncturing, the timeline limit comprises a timeline limit for UCI transmission without multiplexing; and

when the UCI multiplexing is performed through rate matching, the timeline limit comprises a timeline limit for UCI transmission with multiplexing.
The method of claim 3, wherein the UE obtains an onset time at which activation of the UCI multiplexing is determined and determines whether the onset time is before a range of PUSCH preparation time of the UE, and when the onset time is before the range of PUSCH preparation time of the UE, the UCI multiplexing is performed via rate-matching, and the foremost symbol is a first symbol of an earliest time unit that satisfies the timeline limit or a symbol that first satisfies the timeline limit and located in the earliest time unit.
The method of claim 4, wherein when the onset time is in the range of PUSCH preparation time of the UE or after a start position of the range of PUSCH preparation time of the UE, the UCI multiplexing is performed via puncturing, and the foremost symbol is a symbol that first satisfies the timeline limit and located in the earliest time unit.
The method of claim 4, comprising performing rate matching for transmission of UCI belonging to the type of UCI based on a rate matching time unit.
The method of claim 6, wherein the UCI multiplexing is performed according to a UCI multiplexing pattern.
The method of claim 7, wherein a UCI multiplexing time unit of the UCI multiplexing indicates per-slot based UCI multiplexing when the rate matching time unit indicates per-slot based rate matching;

the UCI multiplexing time unit indicates one of per-slot based UCI multiplexing or per-TOT based UCI multiplexing when the rate matching time unit indicates per-TOT based rate matching; or

the UCI multiplexing time unit indicates one of per-slot based UCI multiplexing, per-TOT based UCI multiplexing, or per-TBoMS based UCI multiplexing when the rate matching time unit indicates per-TBoMS based rate matching.
The method of claim 1, wherein the UE has one default pattern of UCI multiplexing; or

one pattern of UCI multiplexing is provided to the UE via TBoMS configuration or PUCCH configuration; or

a set of patterns of UCI multiplexing is provided to the UE via TBoMS configuration or PUCCH configuration.
The method of claim 9, wherein an indication is carried in DCI or RRC signaling to indicate which pattern in the sets of the patterns is adopted for UCI multiplexing.
The method of claim 1, wherein the UE reports a set of patterns of UCI multiplexing that is supported by the UE.
The method of claim 1, 9, 10 or 11, wherein when the UCI multiplexing is per-TOT UCI multiplexing, the UCI is multiplexed across multiple slots or all slots of an overlapping TOT of a TBoMS PUSCH, which is overlapped with a PUCCH.
The method of claim 12, wherein according to a first pattern, the UCI is multiplexed on an overlapping slot of the PUSCH, which is overlapped with a PUCCH;

according to a second pattern, the UCI is multiplexed across the overlapping slot and one or more slots after the overlapping slot in the overlapping TOT;

according to a third pattern, the UCI is multiplexed across the overlapping slot and one or more slots before the overlapping slot in the overlapping TOT; or

according to a fourth pattern, the UCI is multiplexed across all slots of the overlapping TOT.
The method of claim 1, 9, 10 or 11, wherein when the UCI multiplexing is per-TBoMS UCI multiplexing, the UCI is multiplexing across multiple TOTs or all ToTs of a TBoMS PUSCH, which is overlapped with a PUCCH.
The method of claim 14, wherein according to according to a first pattern, the UCI is multiplexed on an overlapping slot of the PUSCH, which is overlapped with a PUCCH;

according to a second pattern, the UCI is multiplexed across the overlapping slot and one or more slots after the overlapping slot in an overlapping TOT;

according to a third pattern, the UCI is multiplexed across the overlapping slot and one or more slots before the overlapping slot in the overlapping TOT;

according to a fourth pattern, the UCI is multiplexed across all slots of the overlapping TOT;

according to a fifth pattern, the UCI is multiplexed across the overlapping TOT and one or more TOTs after the overlapping TOT in the TBoMS PUSCH.

according to a sixth pattern, the UCI is multiplexed across the overlapping TOT and one or more TOTs before the overlapping TOT in the TBoMS PUSCH.

according to a seventh pattern, the UCI is multiplexed across all TOTs of the TBoMS PUSCH.
The method of claim 1, 12, or 14, wherein a pattern of UCI occupation in a slot in a subsequent time unit for the UCI multiplexing is the same with or different from a pattern of UCI occupation in a slot in a 1st time unit for the UCI multiplexing.
The method of claim 1, wherein when the UCI multiplexing comprises UCI multiplexing by puncturing, a processing time for the UCI and a foremost symbol of an earliest TOT of the UCI are determined, and a processing time for a PUSCH transmission that is multiplexed with the UCI on the PUSCH resources and a foremost symbol of an earliest TOT of the PUSCH transmission are determined.
The method of claim 1, wherein when the UCI multiplexing comprises UCI multiplexing by rate-matching, a processing time for the UCI and a foremost symbol of an earliest TOT of the UCI are determined for the UCI and PUSCH transmission that is multiplexed with the UCI on the PUSCH resources.
The method of claim 1, wherein a number Q′ of coded modulation symbols per layer for the UCI is calculated based on an RRC parameter beta-offset
scaled by k/N, k is a scaling factor for TBoMS, and N is the number of allocated slots for a single TBoMS.
The method of claim 19, wherein the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on the RRC parameter beta-offset
scaled by k/N, and the second input parameter is calculated based on a scaling value α, and the scaling value α is scaled by k/N.
The method of claim 20, wherein when the type of UCI is HARQ-ACK, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _ACK that is obtained from:

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 20, wherein when the type of UCI is CSI part one, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-1 that is obtained from:

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 20, wherein when the type of UCI is CSI part two, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-2 that is obtained from:

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 20, wherein when the type of UCI is HARQ-ACK and CG UCI, the beta-offset
is
or
the number Q′ of coded modulation symbols per layer is Q′ _CG-UCI and Q′ _ACK that is obtained from:

and

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 1, wherein a number Q′ of coded modulation symbols per layer for the UCI is calculated based on an RRC parameter beta-offset

when the type of UCI is HARQ-ACK, the beta-offset
is
k is a scaling factor for TBoMS, and N is the number of allocated slots for a single TBoMS;

when the type of UCI is CSI part one, the beta-offset
is

when the type of UCI is CSI part two, the beta-offset
is
or

when the type of UCI is HARQ-ACK and CG UCI, the beta-offset
is
or
The method of claim 25, wherein the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on the RRC parameter beta-offset
scaled by k/N, and the second input parameter is calculated based on a scaling value α, and the scaling value α is a higher layer parameter “scaling” scaled by k/N.
The method of claim 1, wherein the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on is a total number
of OFDM symbols of i-th TOT in a PUSCH transmission and a number C _UL-SCH (i) of code blocks of the i-th TOT in the PUSCH transmission, and the second input parameter is calculated based on the total number
of OFDM symbols of the i-th TOT in the PUSCH transmission.
The method of claim 27, wherein when the type of UCI is HARQ-ACK, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _ACK that is obtained from:

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 27, wherein when the type of UCI is CSI part one, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-1 that is obtained from:

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 27, wherein when the type of UCI is CSI part two, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-2 that is obtained from:

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 27, wherein when the type of UCI is HARQ-ACK and CG UCI, the beta-offset
is
or
the number Q′ of coded modulation symbols per layer is Q′ _CG-UCI and Q′ _ACK that is obtained from:

and

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 1, wherein for per-TBoMS rate-matching, in an implicit configuration of the UCI, the UCI is repeated r times in a number r of repetitions, the number r is obtained by
or rounding of N/k.
The method of claim 32, wherein k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS; and

if N is an integer multiple of k, each repetition of the TBoMS has the same number of UCI resources.
The method of claim 32, wherein k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS; and

if N is not an integer multiple of k, and
each repetition of the TBoMS has the same number of UCI resources except the last or first repetition of the TBoMS which has more UCI resources.
The method of claim 32, wherein k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS; and

if N is not an integer multiple of k, and
each repetition of the TBoMS has the same number of UCI resources except the last or first repetition of the TBoMS which has less UCI resources.
The method of claim 1, wherein for per-TBoMS rate-matching, in an implicit configuration of the UCI, the UCI is repeated in r repetitions from a first slot to a last slot of a TBoMS PUSCH transmission.
The method of claim 36, wherein the r is limited by a maximum value.
The method of claim 1, wherein for per-TBoMS rate-matching, in an explicit configuration of the UCI, the UE is provided a UCI repetition number r in a downlink control signal representing a number of repetitions of the UCI.
The method of claim 38, wherein the downlink control signal including the UCI repetition number r is a DCI, RRC signaling, or TDRA field.
The method of claim 1, wherein for per-ToT/per-slot rate-matching, the UE determines UCI multiplexing resources as r times multiple of resources for a single repetition in a TOT/slot, and the UE transmits repetitions of the UCI in a TOT/slot.
The method of claim 1, wherein for per-ToT/per-slot rate-matching, the UE determines the UCI multiplexing resources for a single RV in the r TOTs/slots, and UE transmits repetitions of the UCI in r TOTs/slots.
The method of any one of claim 32, 40, or 41, wherein repetitions of the UCI on PUSCH are the same or circle through a sequence of repetition versions.
The method of any one of claim 40 or 41, wherein the r is limited by a maximum value.
A user equipment (UE) comprising:

a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the method of any of claims 1 to 43.
A chip, comprising:

a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the method of any of claims 1 to 43.
A computer readable storage medium, in which a computer program is stored, wherein the computer program causes a computer to execute the method of any of claims 1 to 43.
A computer program product, comprising a computer program, wherein the computer program causes a computer to execute the method of any of claims 1 to 43.
A computer program, wherein the computer program causes a computer to execute the method of any of claims 1 to 43.
A wireless communication method, executable in a base station, comprising:

obtain UCI multiplexing configuration of a user equipment (UE) ;

transmitting a downlink signal to the UE; and

receiving and decoding multiplexed UCI from the UE according to the UCI multiplexing configuration, wherein the multiplexed UCI is in response to the downlink signal;

wherein the UCI multiplexing configuration comprises a timeline limit for the type of UCI, the timeline limit is used for determining a foremost symbol among symbols in a time unit on a physical uplink shared channel (PUSCH) for UCI multiplexing.
The method of claim 49, wherein the time unit comprises one slot, one TOT, or one TBoMS.
The method of claim 49, wherein the UCI multiplexing is performed according to a UCI multiplexing pattern.
The method of claim 51, wherein a UCI multiplexing time unit of the UCI multiplexing indicates per-slot based UCI multiplexing when a rate matching time unit indicates per-slot based rate matching;

the UCI multiplexing time unit indicates one of per-slot based UCI multiplexing or per-TOT based UCI multiplexing when the rate matching time unit indicates per-TOT based rate matching; or

the UCI multiplexing time unit indicates one of per-slot based UCI multiplexing, per-TOT based UCI multiplexing, or per-TBoMS based UCI multiplexing when the rate matching time unit indicates per-TBoMS based rate matching.
The method of claim 49, wherein the UCI is multiplexed on an overlapping slot of a PUSCH, which is overlapped with a PUCCH;

the UCI is multiplexed across multiple slots or all slots of an overlapping TOT of a TBoMS PUSCH, which is overlapped with a PUCCH; or

the UCI is multiplexing across multiple TOTs or all ToTs of a TBoMS PUSCH, which is overlapped with a PUCCH.
The method of claim 49, wherein the UE has one default pattern of UCI multiplexing; or

one pattern of UCI multiplexing is provided to the UE via TBoMS configuration or PUCCH configuration; or

a set of patterns of UCI multiplexing is provided to the UE via TBoMS configuration or PUCCH configuration.
The method of claim 54, wherein an indication is carried in DCI or RRC signaling to indicate which pattern in the sets of the patterns is adopted for UCI multiplexing.
The method of claim 49, wherein the base station receives a set of patterns of UCI multiplexing that is supported by the UE.
The method of claim 49, wherein the foremost symbol is a first symbol of the earliest time unit or a symbol that first satisfies the timeline limit and located in the earliest time unit.
The method of claim 49, wherein when the UCI multiplexing comprises UCI multiplexing by puncturing, a processing time for the UCI and a foremost symbol of an earliest TOT of the UCI are determined, and a processing time for a PUSCH transmission that is multiplexed with the UCI on the PUSCH resources and a foremost symbol of an earliest TOT of the PUSCH transmission are determined.
The method of claim 49, wherein when the UCI multiplexing comprises UCI multiplexing by rate-matching, a processing time for the UCI and a foremost symbol of an earliest TOT of the UCI are determined for the UCI and PUSCH transmission that is multiplexed with the UCI on the PUSCH resources.
The method of claim 49, wherein a number Q′ of coded modulation symbols per layer for the UCI is calculated based on an RRC parameter beta-offset
scaled by k/N, k is a scaling factor for TBoMS, and N is the number of allocated slots for a single TBoMS.
The method of claim 60, wherein the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on the RRC parameter beta-offset
scaled by k/N, and the second input parameter is calculated based on a scaling value α, and the scaling value α is scaled by k/N.
The method of claim 61, wherein when the type of UCI is HARQ-ACK, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _ACK that is obtained from:

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 61, wherein when the type of UCI is CSI part one, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-1 that is obtained from:

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 61, wherein when the type of UCI is CSI part two, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-2 that is obtained from:

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 61, wherein when the type of UCI is HARQ-ACK and CG UCI, the beta-offset
is
or
the number Q′ of coded modulation symbols per layer is Q′ _CG-UCI and Q′ _ACK that is obtained from:

and

wherein for per-TBoMS rate-matching,
is the total number of OFDM symbols of a PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 49, wherein a number Q′ of coded modulation symbols per layer for the UCI is calculated based on an RRC parameter beta-offset

when the type of UCI is HARQ-ACK, the beta-offset
is
k is a scaling factor for TBoMS, and N is the number of allocated slots for a single TBoMS;

when the type of UCI is CSI part one, the beta-offset
is

when the type of UCI is CSI part two, the beta-offset
is
or

when the type of UCI is HARQ-ACK and CG UCI, the beta-offset
is
or
The method of claim 66, wherein the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on the RRC parameter beta-offset
scaled by k/N, and the second input parameter is calculated based on a scaling value α, and the scaling value α is a higher layer parameter “scaling” scaled by k/N.
The method of claim 49, wherein the number Q′ of coded modulation symbols per layer for the UCI is calculated based on a min function that selects a minimum from a first input parameter and a second input parameter, the first parameter is calculated based on is a total number
of OFDM symbols of i-th TOT in a PUSCH transmission and a number C _UL-SCH (i) of code blocks of the i-th TOT in the PUSCH transmission, and the second input parameter is calculated based on the total number
of OFDM symbols of the i-th TOT in the PUSCH transmission.
The method of claim 68, wherein when the type of UCI is HARQ-ACK, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _ACK that is obtained from:

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 68, wherein when the type of UCI is CSI part one, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-1 that is obtained from:

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 68, wherein when the type of UCI is CSI part two, the beta-offset
is
the number Q′ of coded modulation symbols per layer is Q′ _CSI-2 that is obtained from:

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 68, wherein when the type of UCI is HARQ-ACK and CG UCI, the beta-offset
is
or
the number Q′ of coded modulation symbols per layer is Q′ _CG-UCI and Q′ _ACK that is obtained from:

and

wherein for per-ToT rate-matching,
is the total number of OFDM symbols of the i-th TOT in the PUSCH transmission of N allocated slot for TBoMS;

C _UL-SCH is the number of code blocks for UL-SCH of the i-th TOT in the PUSCH transmission;

K _r is the r-th code block size for UL-SCH of the PUSCH transmission; and

is the number of resource elements (REs) that are available for transmission of UCI in OFDM symbol l, for
The method of claim 49, wherein for per-TBoMS rate-matching, in an implicit configuration of the UCI, the UCI is repeated r times in a number r of repetitions, the number r is obtained by
or rounding of N/k.
The method of claim 73, wherein k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS; and

if N is an integer multiple of k, each repetition of the TBoMS has the same number of UCI resources.
The method of claim 73, wherein k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS; and

if N is not an integer multiple of k, and
each repetition of the TBoMS has the same number of UCI resources except the last or first repetition of the TBoMS which has more UCI resources.
The method of claim 73, wherein k is a scaling factor for implicitly define a ToT of a TBoMS, and N is the number of allocated slots for the TBoMS; and

if N is not an integer multiple of k, and
each repetition of the TBoMS has the same number of UCI resources except the last or first repetition of the TBoMS which has less UCI resources.
The method of claim 49, wherein for per-TBoMS rate-matching, in an implicit configuration of the UCI, the UCI is repeated in r repetitions from a first slot to a last slot of a TBoMS PUSCH transmission.
The method of claim 77, wherein the r is limited by a maximum value.
The method of claim 49, wherein for per-TBoMS rate-matching, in an explicit configuration of the UCI, the base station provides a UCI repetition number r in a downlink control signal representing a number of repetitions of the UCI.
The method of claim 79, wherein the downlink control signal including the UCI repetition number r is a DCI, RRC signaling, or TDRA field.
The method of claim 49, wherein for per-ToT/per-slot rate-matching, when UCI multiplexing resources are r times multiple of resources for a single repetition in a TOT/slot, repetitions of the UCI are transmitted in a TOT/slot.
The method of claim 49, wherein for per-ToT/per-slot rate-matching, when the UCI multiplexing resources for a single repetition of the UCI is in the r TOTs/slots, repetitions of the UCI are transmitted in r TOTs/slots.
The method of any one of claim 73, 81, or 82, wherein repetitions of the UCI on PUSCH are the same or circle through a sequence of repetition versions.
The method of any one of claim 81 or 82, wherein the r is limited by a maximum value.
A base station comprising:

a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the method of any of claims 49 to 84.
A chip, comprising:

a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the method of any of claims 49 to 84.
A computer readable storage medium, in which a computer program is stored, wherein the computer program causes a computer to execute the method of any of claims 49 to 84.
A computer program product, comprising a computer program, wherein the computer program causes a computer to execute the method of any of claims 49 to 84.
A computer program, wherein the computer program causes a computer to execute the method of any of claims 49 to 84.