CN112640339B

CN112640339B - Method, apparatus and computer readable program storage medium for wireless communication

Info

Publication number: CN112640339B
Application number: CN201880097080.3A
Authority: CN
Inventors: 付婷; 苟伟; 郝鹏
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2018-07-03
Filing date: 2018-07-03
Publication date: 2022-05-10
Anticipated expiration: 2038-07-03
Also published as: WO2020006678A1; CN112640339A

Abstract

Methods, systems, and devices are described for multiplexing with PUCCH and PUSCH in wireless communications. In one exemplary aspect, a method for wireless communication is disclosed. The method comprises the following steps: determining that a subset of a set of PUSCHs and a set of PUCCHs satisfy one or more timing conditions, and in response to determining that the subset of PUSCHs and the set of PUCCHs satisfy the one or more timing conditions, multiplexing UCI of at least one of the set of PUCCHs onto a selected PUSCH of the subset.

Description

Method, apparatus and computer readable program storage medium for wireless communication

Technical Field

This patent document is generally directed to wireless communications.

Background

Mobile communication technology is pushing the world to an increasingly interconnected and networked society. Next generation systems and wireless communication technologies need to support a wider range of use case characteristics and provide more sophisticated network access technologies than existing wireless networks.

Disclosure of Invention

The patent document relates to techniques, systems, and devices for communication multiplexing with a Physical Uplink Control Channel (PUCCH) and a Physical Uplink Shared Channel (PUSCH).

In one exemplary aspect, a method for wireless communication is disclosed. The method comprises the following steps: determining that a set of Physical Uplink Control Channels (PUCCHs) and a set of Physical Uplink Shared Channels (PUSCHs) at least partially overlap in a time domain; and determining whether a subset of the set of PUSCHs and the set of PUCCHs satisfy one or more timing conditions, wherein the subset of PUSCHs is smaller in size than the set of PUSCHs and includes at least one PUSCH. The method further comprises the following steps: multiplexing Uplink Control Information (UCI) of at least one of the set of PUCCHs onto a selected PUSCH of the subset in response to determining that the subset of PUSCHs and the set of PUCCHs satisfy one or more timing conditions.

In some embodiments, the one or more timing conditions comprise: in the set of PUCCH and the subset of PUSCH, the earliest first symbol of PUCCH or PUSCH does not precede symbol N1+ X after the last symbol of any corresponding PDSCH or semi-persistent scheduling (SPS) PDSCH release, and in the set of PUCCH and the subset of PUSCH, the earliest first symbol of PUCCH or PUSCH does not precede symbol N2+ Y after the last symbol of any corresponding Physical Downlink Control Channel (PDCCH).

In some embodiments, the set of PUCCHs consists of a single PUCCH or includes multiple PUCCHs. In some embodiments, the set of PUCCHs consists of a single PUCCH, and the single PUCCH at least partially overlaps with each PUSCH in the set of PUSCHs. In some embodiments, the set of PUCCHs comprises a plurality of PUCCHs, and each of the plurality of PUCCHs at least partially overlaps with each PUSCH in the set of PUSCHs.

In some embodiments, the method further comprises sequentially determining whether a single PUSCH and the set of PUCCHs satisfy one or more timing conditions according to an order of the single PUSCH in the set of PUSCHs. In some embodiments, the order of the single PUSCH is determined based at least in part on a respective Component Carrier (CC) index associated with the single PUSCH. In some embodiments, wherein the order of the single PUSCHs is further determined based at least in part on respective start times of the single PUSCHs on the same CC. In some embodiments, the order of the single PUSCH is further determined based on at least one of an associated frequency domain index, a length of a occupied symbol, or a number of occupied Resource Elements (REs). In some embodiments, the method further comprises: ending the sequentially determining whether a single PUSCH and a single PUCCH satisfy one or more timing conditions in response to determining that a first PUSCH of the set of PUSCHs and the set of PUCCHs satisfy one or more timing conditions. In some embodiments, the first PUSCH is a selected PUSCH of the subset.

In some embodiments, the method further comprises: sequentially determining whether (1) all PUSCHs on respective CCs belonging to the set of PUSCHs and (2) the set of PUCCHs satisfy one or more timing conditions according to an order of Component Carriers (CCs) associated with the set of PUSCHs. In some embodiments, the method further comprises: ending the sequentially determining whether (1) all PUSCHs belonging to respective CCs of the set of PUSCHs and (2) the set of PUCCHs satisfy one or more timing conditions in response to determining that all bursts on the first carrier and the group of bursts satisfy the one or more timing conditions. In some embodiments, the PUSCH on the first CC with the earliest start time among all PUSCHs on the first CC is the selected PUSCH of the subset.

In some embodiments, the method further comprises sequentially determining whether a single PUSCH and the set of PUCCHs satisfy one or more timing conditions according to an order of the single PUSCH in the set of PUSCHs. In some embodiments, the order of the single PUSCHs is determined based at least in part on respective start times of the single PUSCHs. In some embodiments, the order of the single PUSCHs is further determined based at least in part on indices of respective Component Carriers (CCs) associated with the single PUSCHs having the same start time. In some embodiments, the order of the single PUSCH is further determined based on at least one of an associated frequency domain index, a length of a occupied symbol, or a number of occupied Resource Elements (REs). In some embodiments, the selected PUSCH of the subset is associated with the smallest CC index of all PUSCHs determined to satisfy the one or more timing conditions. In some embodiments, the selected PUSCH of the subset has an earliest start time among all PUSCHs associated with a smallest CC index determined to satisfy the one or more timing conditions. In some embodiments, the order of the single PUSCH is determined based at least in part on respective end times of the single PDCCH corresponding to the single PUSCH. In some embodiments, the order of the single PUSCH is further determined based at least in part on a single Component Carrier (CC) index associated with the single PDCCH having the same end time.

In some embodiments, the method further comprises: sequentially determining, according to an order of individual PUSCHs in the set of PUSCHs, (1) a PUSCH sequence including an individual PUSCH at a particular start time, and (2) whether the set of PUSCHs satisfies one or more timing conditions. In some embodiments, the order of the single PUSCHs is determined based at least in part on respective start times of the single PUSCHs. In some embodiments, the PUSCH sequence further includes one or more PUSCHs in the PUSCH set that begin no earlier than a particular start time. In some embodiments, the method further comprises, in response to determining that the first PUSCH sequence and the set of PUCCHs satisfy the one or more timing conditions, ending the sequentially determining (1) a PUSCH sequence comprising a single PUSCH at a particular start time, and (2) whether the set of PUCCHs satisfies the one or more timing conditions. In some embodiments, the selected PUSCH of the subset is the PUSCH associated with the smallest CC index of all PUSCHs of the first PUSCH sequence. In some embodiments, the selected PUSCH of the subset has the earliest start time among all PUSCHs of the first PUSCH sequence associated with the smallest CC index.

In some embodiments, the method further comprises: determining whether (1) a subset of PUSCHs associated with a PDCCH having a particular start time, and (2) the set of PUCCHs satisfy one or more timing conditions in turn according to an order of PDCCHs corresponding to a single PUSCH in a set of PUSCHs. In some embodiments, wherein the order of PDCCHs corresponding to a single PUSCH in the set of PUSCHs is determined based at least in part on a respective start time of the PDCCHs. In some embodiments, the PUSCH subset includes one or more PUSCHs of the set of PUSCHs corresponding to one or more PDCCHs beginning no earlier than a particular starting time. In some embodiments, the method further comprises, in response to determining that the first subset of the PUSCH and the set of PUCCHs satisfy one or more timing conditions, ending the sequentially determining (1) the subset of the PUSCH associated with the PDCCH having the particular start time, and (2) whether the set of PUCCHs satisfies the one or more timing conditions. In some embodiments, the selected PUSCH of the subset is the PUSCH associated with the smallest CC index among all PUSCHs of the first PUSCH subset. In some embodiments, the selected PUSCH of the subset has the earliest start time among all PUSCHs of the first PUSCH subset associated with the smallest CC index.

In some embodiments, multiplexing UCI of at least one PUCCH of the set of PUCCHs onto the selected PUSCH of the subset comprises: selecting at least one PUCCH from the PUCCH set based at least in part on one or more criteria. In some embodiments, the one or more criteria relate to at least one of a Scheduling Request (SR) or a traffic type.

In another exemplary aspect, the above-described method is embodied in the form of processor executable code and stored in a computer readable program medium.

In yet another exemplary embodiment, an apparatus configured or operable to perform the above method is disclosed.

The above and other aspects and embodiments thereof are described in more detail in the accompanying drawings, the description and the claims.

Drawings

Fig. 1 illustrates an example of a base station and one or more UEs in wireless communication, in accordance with some embodiments of the technology of the present disclosure.

Fig. 2 shows an example of two current timing conditions for evaluating UCI multiplexing.

Fig. 3A-3C illustrate example implementations of determining UCI reuse determination in accordance with some embodiments of the disclosed technology.

Fig. 4A-4C illustrate another example implementation of determining a UCI multiplexing determination in accordance with some embodiments of the disclosed technology.

Fig. 5A-5C illustrate another example implementation of determining a UCI multiplexing determination in accordance with some embodiments of the disclosed technology.

Fig. 6A-6C illustrate another example implementation of determining a UCI multiplexing determination in accordance with some embodiments of the disclosed technology.

Fig. 7A-7C illustrate yet another example implementation of determining a UCI multiplexing determination in accordance with some embodiments of the disclosed technology.

Fig. 8 is a flow diagram illustrating an example process for communication multiplexing in accordance with some embodiments of the disclosed technology.

Fig. 9 is a block diagram representation of a portion of a radio station in accordance with some embodiments of the disclosed technology.

Detailed Description

Rapid advances in wireless communications and advances in technology are intended to meet, in part, the demand for greater capacity and higher data rates. Other aspects such as latency, equipment cost, spectrum resource allocation and delay are also factors that affect future network success.

Fig. 1 illustrates an example of a base station and one or more UEs in wireless communication, in accordance with some embodiments of the technology of the present disclosure. The UE (110) may transmit information to the base station (120) via the corresponding one or more PUCCHs 130a and/or one or more PUSCHs 130 b. The technology of the present disclosure provides various embodiments for communication multiplexing using PUCCH and PUSCH in wireless communication between a UE and a base station.

In the standardization of New Radio (NR) technology, the problem of multiplexing of communications between one or more PUCCHs and one or more PUSCHs has been discussed. For example, in a multicarrier Carrier Aggregation (CA) scenario, if one or more PUCCHs fully or partially overlap with multiple PUSCHs of the same slot (the one or more PUCCHs and the one or more PUSCHs may be single-or multi-slot), the UE may multiplex information in the one or more PUCCHs onto one of the PUSCHs when two of the following two timing conditions are met:

condition 1: in an overlapping PUCCH or PUSCH including an earliest PUCCH or PUSCH in a slot, the first symbol of the earliest PUCCH or PUSCH does not precede symbol N1+ X after the last symbol of any corresponding Physical Downlink Shared Channel (PDSCH) or semi-persistent scheduling (SPS) PDSCH release; and is

Condition 2: in overlapping PUCCH and PUSCH including the earliest PUCCH or PUSCH in a slot, the first symbol of the earliest PUCCH or PUSCH does not precede symbol N2+ Y following the last symbol of any corresponding Physical Downlink Control Channel (PDCCH).

According to the current protocol TS38.214, N1 of condition 1 corresponds to a time when the UE receives and processes the PDSCH, and N2 of condition 2 corresponds to a time when the UE prepares the PUSCH. X and Y may be two constants to be determined in one or more future versions of the standard specification and may be related to parameters such as subcarrier spacing (SCS). The two timing conditions described above are commonly referred to as Uplink Control Information (UCI) multiplexing timing conditions.

UCI may be multiplexed onto one of the overlapping PUSCHs if one or more PUCCHs and all overlapping PUSCHs satisfy the above timing condition. More specifically, the UE may multiplex UCI onto an overlapped PUSCH on a Component Carrier (CC) having a smallest CC index. If the UE transmits more than one PUSCH in a slot on a CC with the smallest CC index, the UE may multiplex UCI in the PUSCH that the UE first transmits in the slot. These actions are commonly referred to as UCI multiplexing methods.

If any pair of channels a and B (where a is selected from one or more PUCCHs and B is selected from all overlapping PUSCHs) cannot satisfy the UCI multiplexing timing condition described above, the current protocol considers that an error condition has occurred. In the case of errors, the behavior of the UE is irregular. The corresponding base station will attempt to avoid PUCCH and/or PUSCH configurations that may lead to error conditions. However, if an error condition occurs, the base station will not be able to determine the behavior of the UE, and the UE may drop the PUCCH or multiple PUSCHs, which may affect PUCCH/PUSCH transmission performance.

Since UCI in one or more PUCCHs is multiplexed only on one overlapping PUSCH, not all overlapping PUSCHs, and multiple PUSCHs are not multiplexed with each other, the error case definition for UCI multiplexing scenario according to current protocols may be too strict, especially when applied to base station configuration in CA scenario.

For example, as shown in fig. 2, the PUCCH on component carrier CC0 overlaps (partially or completely) with the PUSCH on CC1, CC2, and CC3 in the time domain. In fig. 2, the horizontal direction represents time, PUCCH0 is hybrid automatic repeat request-acknowledgement (HARQ-ACK) feedback corresponding to PDSCH0, and PDCCH1, PDCCH2, PDCCH3 correspond to PUSCH1, PUSCH2, PUSCH3, respectively. According to the current UCI multiplexing timing conditions, the first symbol of the earliest of the PUCCH and the overlapping PUSCH is the first symbol of PUSCH2, the last symbol of any corresponding PDSCH is the last symbol of PDSCH0, and the last symbol of any corresponding PDCCH is the last symbol of PDCCH 1. Thus, according to fig. 2, time intervals T11 and T12 are used to evaluate two current timing conditions for UCI multiplexing.

If T11 ≧ N1+ X and T12 ≧ N2+ Y, the current UCI multiplexing timing condition is satisfied, and according to the current UCI multiplexing method, UCI of PUCCH0 can be multiplexed onto PUSCH1 (which has the smallest CC index).

If T11 < N1+ X or T12 < N2+ Y, the current UCI multiplexing timing condition is not satisfied, i.e., an error condition occurs. In a CA scenario with multiple carriers, the configuration of the base station may be limited or restricted in order to avoid such error situations. As described above, upon occurrence of an error condition, the base station may not be able to determine the processing mode of the UE, and the UE may drop one or more PUCCHs or one or more PUSCHs, thereby affecting the PUCCH/PUSCH transmission performance.

The techniques of the present disclosure address these issues. In general, according to some embodiments of the disclosed technology, when one or more PUCCHs and a plurality of PUSCHs of the same slot are completely or partially overlapped in a time domain, if at least one selected from the plurality of PUSCHs and the at least one PUCCH satisfy a revised UCI multiplexing timing condition, a corresponding UE may multiplex UCI of the at least one PUCCH onto a PUSCH of the plurality of PUSCHs that satisfies the revised timing condition.

The corrected UCI multiplexing timing conditions are as follows:

modified condition 1: in at least one PUCCH and at least one PUSCH selected from a plurality of PUSCHs, the first symbol of the earliest PUCCH or PUSCH does not precede symbol N1+ X after the last symbol of any corresponding PDSCH or semi-persistent scheduling (SPS) PDSCH release; and is

Modified condition 2: in at least one PUCCH and at least one PUSCH selected from a plurality of PUSCHs, the first symbol of the earliest PUCCH or PUSCH does not precede symbol N2+ Y following the last symbol of any corresponding Physical Downlink Control Channel (PDCCH).

In some embodiments, if there are no subsets of PUSCHs that can be selected from the multiple PUSCHs to satisfy the revised UCI multiplexing timing condition for at least one PUCCH in the same slot, the corresponding UE may drop UCI, drop all PUSCHs, drop PUCCH and all PUSCH, and/or drop PUCCH and some PUSCH.

According to various embodiments, the disclosed communication multiplexing techniques for utilizing one or more PUCCHs and one or more PUSCHs may mitigate configuration restrictions on the base station and reduce negative impact on PUCCH/PUSCH transmission performance.

First embodiment example

In some embodiments, the UE sequentially detects whether the single PUCCH and each overlapped PUSCH on the corresponding CC satisfy the modified UCI multiplexing timing condition according to an ascending order of CC indexes. If there are multiple PUSCHs on a particular CC, the UE may further determine in turn whether a single PUCCH and each PUSCH on the CC satisfy the modified timing condition according to a temporal order (e.g., from first to last) of respective start times of the multiple PUSCHs. If the multiple PUSCHs on the CC have the same start time, the UE may order the multiple PUSCHs according to a specific rule and sequentially determine whether the modified timing condition is satisfied. For example, the ordering may be based on factors such as the frequency domain index of each PUSCH, the length of occupied symbols, the number of occupied Resource Elements (REs), and/or other factors.

According to the sequentially detecting, once the UE detects that a certain PUSCH and a single PUCCH satisfy the revised timing condition, the UE may determine that UCI of the PUCCH is multiplexed onto the detected PUSCH. In some embodiments, the UE need not continue to detect whether the subsequent PUSCH or PUSCHs satisfy the revised timing condition. In some embodiments, the UE may determine that an error condition has occurred if the UE traverses all PUSCHs overlapping with a single PUCCH and does not detect a PUSCH that satisfies the revised timing condition with respect to the PUCCH.

Illustratively, as shown in fig. 3A, the UE first detects whether PUSCH1 on PUCCH0 and CC1 (with the smallest CC index) satisfies the revised UCI multiplexing timing condition. At this time, the UE does not analyze PUSCH/PDCCH on CC2 or CC 3. Referring to fig. 3A, the UE evaluates time intervals T21 and T22 to determine whether PUCCH0 and PUSCH1 satisfy two revised UCI multiplexing timing conditions. More specifically, if T21 ≧ N1+ X and T22 ≧ N2+ Y, PUCCH0 and PUSCH1 satisfy the corrected timing condition, and PUCCH0 can be multiplexed onto PUSCH1 of CC 1. The UE need not further determine whether PUSCH2 or PUSCH3 satisfies the revised timing condition for PUCCH 0.

If T21 < N1+ X or T22 < N2+ Y, PUCCH0 and PUSCH1 cannot meet the modified UCI multiplexing timing condition and the UE continues to evaluate the next PUSCH. Since there is only one PUSCH (i.e., PUSCH1) on CC1 that overlaps with PUCCH0, the UE will look at the next CC index, i.e., the UE will continue to check whether PUSCH2 and PUCCH0 on CC2 meet the revised timing condition. Referring to FIG. 3B, if T31 ≧ N1+ X and T32 ≧ N2+ Y, PUCCH0 and PUSCH2 can satisfy the modified UCI multiplexing timing condition, and PUCCH0 can be multiplexed onto PUSCH2 of CC 2. The UE need not further determine whether PUSCH3 satisfies the revised timing condition for PUCCH 0.

If T31 < N1+ X or T32 < N2+ Y, PUCCH0 and PUSCH2 cannot meet the modified UCI multiplexing timing condition and the UE continues to evaluate the next PUSCH. Since there is only one PUSCH (i.e., PUSCH2) on CC2 that overlaps with PUCCH0, the UE looks at the next CC index, that is, the UE continues to check whether PUSCH3 and PUCCH0 on CC3 satisfy the revised timing condition. Referring to FIG. 3C, if T41 ≧ N1+ X and T42 ≧ N2+ Y, PUCCH0 and PUSCH3 can satisfy the modified UCI multiplexing timing condition, and PUCCH0 can be multiplexed onto PUSCH3 of CC 3.

If T41 < N1+ X or T42 < N2+ Y, PUCCH0 and PUSCH3 cannot satisfy the modified UCI multiplexing timing condition. At this point, the UE has traversed all PUSCHs overlapping PUCCH0, and none of the PUSCHs can satisfy the revised timing condition for PUCCH 0. The UE may determine that an error condition has occurred and drop PUCCH0, drop all PUSCH (i.e., PUSCH1, PUSCH2, and PUSCH3), drop PUCCH0 and all PUSCH, or drop one or more of PUCCH0, PUSCH1, PUSCH2, or PUSCH 3.

In some embodiments, the UE sequentially detects whether the plurality of PUCCHs and each overlapped PUSCH on the corresponding CC satisfy the modified UCI multiplexing timing condition according to an ascending order of the CC indexes. If there are multiple PUSCHs on a particular CC, the UE may further determine in turn whether the multiple PUSCHs on the CC and each PUSCH satisfy the revised timing condition according to a temporal order (e.g., from first to last) of respective start times of the multiple PUSCHs. If the multiple PUSCHs on the CC have the same start time, the UE may order the multiple PUSCHs according to a specific rule and sequentially determine whether the modified timing condition is satisfied. For example, the ordering may be based on factors such as the frequency domain index of each PUSCH, the length of occupied symbols, the number of occupied Resource Elements (REs), and/or other factors.

According to the sequential detection, once the UE detects that a certain PUSCH and a plurality of PUCCHs satisfy the corrected timing condition, the UE may determine that UCI of the plurality of PUCCHs is multiplexed onto the detected PUSCH. In some embodiments, the UE need not continue to detect whether the subsequent PUSCH satisfies the revised timing condition. In some embodiments, the UE may determine that an error condition has occurred if the UE traverses all PUSCHs overlapping the multiple PUCCHs and does not detect a PUSCH that satisfies the revised timing conditions for the multiple PUCCHs.

Illustratively, as shown in fig. 4A, the UE first detects whether PUSCH1 on PUCCH0 and PUCCH1 (hereinafter referred to as "PUCCH 0/PUCCH 1") and CC1 (where the CC index is minimum) satisfies the modified UCI multiplexing timing condition. At this time, the UE does not analyze PUSCH/PDCCH on CC2 or CC 3. Referring to fig. 4A, the UE evaluates time intervals T21 and T22 to determine whether PUCCH0/PUCCH1 and PUSCH1 satisfy two revised UCI multiplexing timing conditions. More specifically, if T21 ≧ N1+ X and T22 ≧ N2+ Y, PUCCH0/PUCCH1 and PUSCH1 satisfy the modified timing condition, PUCCH0/PUCCH1 can be multiplexed onto PUSCH1 of CC 1. The UE need not further determine whether PUSCH2 or PUSCH3 satisfies the revised timing conditions for PUCCH0/PUCCH 1.

If T21 < N1+ X or T22 < N2+ Y, the PUCCH0/PUCCH1 and PUSCH1 cannot meet the modified UCI multiplexing timing condition and the UE continues to evaluate the next PUSCH. Since there is only one PUSCH (i.e., PUSCH1) on CC1 that overlaps with PUCCH0/PUCCH1, the UE looks at the next CC index, i.e., the UE continues to detect whether PUSCH2 and PUCCH0/PUCCH1 on CC2 satisfy the revised timing condition. Referring to fig. 4B, if T31 ≧ N1+ X and T32 ≧ N2+ Y, the PUCCH0/PUCCH1 and PUSCH2 can satisfy the modified UCI multiplexing timing condition, and PUCCH0/PUCCH1 can be multiplexed onto PUSCH2 of CC 2. The UE need not further determine whether PUSCH3 satisfies the corrected timing condition for PUCCH0/PUCCH 1.

If T31 < N1+ X or T32 < N2+ Y, the PUCCH0/PUCCH1 and PUSCH2 cannot meet the modified UCI multiplexing timing condition and the UE continues to evaluate the next PUSCH. Since there is only one PUSCH (i.e., PUSCH2) on CC2 that overlaps with PUCCH0/PUCCH1, the UE will look at the next CC index, i.e., the UE will continue to check whether PUSCH3 and PUCCH0/PUCCH1 on CC3 satisfy the revised timing condition. Referring to FIG. 4C, if T41 ≧ N1+ X and T42 ≧ N2+ Y, the PUCCH0/PUCCH1 and PUSCH3 can satisfy the modified UCI multiplexing timing condition, and PUCCH0/PUCCH1 can be multiplexed onto PUSCH3 of CC 3.

If T41 < N1+ X or T42 < N2+ Y, the PUCCH0/PUCCH1 and PUSCH3 cannot satisfy the modified UCI multiplexing timing condition. At this time, the UE has traversed all PUSCHs overlapping PUCCH0/PUCCH1, and none of the PUSCHs can satisfy the modified timing condition with respect to PUCCH0/PUCCH 1. The UE may determine that an error condition has occurred, drop all UCI (i.e., UCI of PUCCH0/PUCCH 1), drop a portion of UCI (i.e., UCI of PUCCH0 or UCI of PUCCH 1), drop all PUSCH (e.g., PUSCH1, PUSCH2, and PUSCH3), drop all UCI and all PUSCH, or drop at least one of PUCCH0 or PUCCH1 and at least one of PUSCH1, PUSCH2, or PUSCH 3.

In some embodiments, the UE sequentially detects whether one or more PUCCHs on the respective CCs and their overlapped one or more PUSCHs satisfy the modified UCI multiplexing timing condition in ascending order of CC indexes. If there are multiple PUSCHs on a particular CC, the UE may analyze the multiple PUSCHs as a whole and determine whether (1) the one or more PUCCHs and (2) all PUSCHs on the CC satisfy the revised timing condition. In this way, the UE only needs to perform one evaluation of the corrected timing condition for each CC.

According to the sequential detection, once the UE detects that the PUSCH and the one or more PUCCHs on a particular CC satisfy the revised timing condition, the UE may determine that UCI of the one or more PUCCHs is multiplexed onto the detected one or more PUSCHs. If there are multiple PUSCHs on a particular CC, the one or more PUCCHs may be multiplexed onto the PUSCH with the earliest start time. In some embodiments, the UE need not continue to detect whether one or more PUSCHs on subsequent CCs satisfy the revised timing condition. In some embodiments, if the UE traverses all PUSCHs overlapping one or more PUCCHs and finds no CC with one or more PUSCHs to satisfy the revised timing conditions for the one or more PUCCHs, the UE may determine that an error condition has occurred and perform a corresponding error-conditioned operation.

Illustratively, as shown in fig. 5A, the UE first detects whether PUCCH0 and PUSCH on CC1 (where the CC index is smallest) satisfy the revised UCI multiplexing timing condition. Referring to fig. 5A, there are 2 PUSCHs (PUSCH1-0 and PUSCH1-1) on CC1 that overlap with PUCCH0, but the UE only performs one evaluation. That is, the UE determines whether the PUCCH0 and PUSCHs 1-0 and 1-1 satisfy the corrected timing conditions. With continued reference to fig. 5A, the UE illustratively evaluates time intervals T21 and T22 to determine whether PUCCH0 and PUSCH1-0 and PUSCH1-1 satisfy two revised UCI multiplexing timing conditions. More specifically, if T21 ≧ N1+ X and T22 ≧ N2+ Y, both PUCCH0 and PUSCH1-0 and PUSCH1-1 satisfy the modified timing condition. In this case, PUCCH0 may be multiplexed onto PUSCH1-0 of CC1 (which has an earlier start time than PUSCH 1-1). The UE need not further determine whether the PUSCH on CC2 or CC3 satisfies the revised timing condition for PUCCH 0.

If T21 < N1+ X or T22 < N2+ Y, the PUSCH on PUCCH0 and CC1 cannot meet the modified UCI multiplexing timing condition and the UE continues to evaluate one or more PUSCHs on the next CC, i.e., PUSCH2 on CC 2. Illustratively, the UE continues to detect whether PUSCH2 and PUCCH0 on CC2 satisfy the revised timing conditions. Referring to FIG. 5B, if T31 ≧ N1+ X and T32 ≧ N2+ Y, PUCCH0 and PUSCH2 can satisfy the modified UCI multiplexing timing condition, and PUCCH0 can be multiplexed onto PUSCH2 of CC 2. The UE need not further determine whether PUSCH3 on CC3 satisfies the revised timing condition for PUCCH 0.

If T31 < N1+ X or T32 < N2+ Y, PUCCH0 and PUSCH2 cannot meet the modified UCI multiplexing timing condition and the UE continues to evaluate one or more PUSCHs on the next CC, i.e., PUSCH3 on CC 3. Illustratively, the UE continues to detect whether PUSCH3 and PUCCH0 on CC3 satisfy the revised timing conditions. Referring to FIG. 5C, if T41 ≧ N1+ X and T42 ≧ N2+ Y, PUCCH0 and PUSCH3 can satisfy the modified UCI multiplexing timing condition, and PUCCH0 can be multiplexed onto PUSCH3 of CC 3.

If T41 < N1+ X or T42 < N2+ Y, PUCCH0 and PUSCH3 cannot satisfy the modified UCI multiplexing timing condition. At this point, the UE has traversed all PUSCHs (on all CCs) overlapping with PUCCH0, and none of the PUSCH on a particular CC is able to satisfy the revised timing condition for PUCCH 0. The UE may determine that an error condition has occurred and drop PUCCH0, drop all PUSCH (i.e., PUSCH1-0, PUSCH1-1, PUSCH2, and PUSCH3), drop PUCCH0 and all PUSCH, or drop one or more of PUCCH0, PUSCH1-0, PUSCH1-1, PUSCH2, or PUSCH 3.

Second embodiment example

In some embodiments, the UE sequentially detects whether one or more PUSCHs and each overlapping PUSCH satisfy the revised UCI multiplexing timing condition according to a temporal order (e.g., from first to last) of respective start times of the plurality of PUSCHs. If some of the multiple PUSCHs have the same start time, the UE may order them in ascending order of their CC index and sequentially determine whether any of the PUSCHs satisfies the revised timing condition for one or more PUCCHs. If there are still more than one PUSCH for the same CC index, the UE may further order them according to a specific rule and in turn determine whether the modified timing condition is satisfied. For example, the ordering may be based on factors such as the frequency domain index of each PUSCH, the length of occupied symbols, the number of occupied Resource Elements (REs), and/or other factors.

In this way, the UE may traverse all PUSCHs that overlap with one or more PUCCHs. If the UE detects that one or more PUSCHs and one or more PUCCHs satisfy the modified UCI multiplexing timing condition, the UE can multiplex the PUCCHs onto a PUSCH on a CC having the smallest CC index. If there are multiple PUSCHs on the CC, one or more PUCCHs may be multiplexed onto the PUSCH with the earliest start time.

If the UE traverses all PUSCHs overlapping with the PUCCH and determines that neither the PUSCH nor the PUCCH satisfies the revised timing condition, the UE may determine that an error condition has occurred and drop one or more PUCCHs, drop all PUSCHs, drop one or more PUCCHs and all PUSCHs, or drop one or more PUCCHs and some PUSCHs.

Third embodiment example

In some embodiments, the UE sequentially detects whether one or more PUSCHs and each overlapping PUSCH satisfy the modified UCI multiplexing timing condition according to a temporal order (e.g., from first to last) of respective end times of PDCCHs corresponding to the PUSCHs. If certain PDCCHs have the same end time, the UE may sort them in ascending order of their CC index and sequentially determine whether any PUSCH corresponding to a PDCCH satisfies the modified timing condition with respect to the PUCCH.

In this way, the UE may traverse all PUSCHs that overlap with the PUCCH. If the UE detects that the one or more PUSCHs and the one or more PUCCHs satisfy the revised UCI multiplexing timing condition, the UE may multiplex the one or more PUCCHs onto a PUSCH on a CC having the smallest CC index. If there are multiple PUSCHs on a CC, the one or more PUCCHs can be multiplexed onto the PUSCH with the earliest start time.

If the UE traverses all PUSCHs overlapping with the PUCCH and determines that neither the PUSCH nor the PUCCH satisfies the revised timing condition, the UE may determine that an error condition has occurred and drop one or more PUCCHs, drop all PUSCHs, drop one or more PUCCHs and all PUSCHs, or drop one or more PUCCHs and a portion of the PUSCH.

Example of the fourth embodiment

In some embodiments, the UE sequentially detects whether (1) one or more PUCCHs and (2) each PUSCH of a specific start time and all subsequent PUSCHs not starting earlier than the specific start time (hereinafter simply referred to as "PUSCH sequence of a specific start time") satisfy the modified UCI multiplexing timing condition according to a time order (e.g., from first to last) of the respective start times of the PUSCHs.

According to the sequentially detecting, once the UE detects that the first PUSCH sequence of a specific start time satisfies the revised UCI multiplexing condition with respect to the one or more PUCCHs, the UE may multiplex the one or more PUCCHs onto a PUSCH having a smallest CC index among all PUSCHs in the detected PUSCH sequences. If there are multiple PUSCHs with the smallest CC index on a CC, one or more PUCCHs can be multiplexed onto the PUSCH with the earliest start time. Furthermore, the UE does not need to perform further sequential detection of the PUSCH.

If the UE traverses all PUSCHs overlapping with one or more PUCCHs according to the above operation, and does not find a PUSCH sequence that can satisfy the modified UCI multiplexing timing condition with respect to the one or more PUCCHs, the UE may determine that an error condition has occurred.

Illustratively, as shown in fig. 6A, of all PUSCHs overlapping PUCCH0, PUSCH2 has the earliest start time. Therefore, the UE first determines PUSCH2, and then determines whether PUSCH1 and PUSCH3 (hereinafter referred to as PUSCH2/1/3 sequences) satisfy the corrected UCI multiplexing timing condition with respect to PUCCH 0. Referring to fig. 6A, the UE evaluates time intervals T51 and T52 to make the determination. More specifically, if T51 ≧ N1+ X and T52 ≧ N2+ Y, the PUCCH0 and PUSCH2/1/3 sequences can satisfy the revised timing condition, and PUCCH0 can be multiplexed onto PUSCH1 of CC1 with the smallest CC index. The UE does not need to continue PUSCH detection.

If T51 < N1+ X or T52 < N2+ Y, the PUCCH0 and PUSCH2/1/3 sequences cannot meet the revised UCI multiplexing timing condition and the UE may continue to evaluate PUSCH3, which is the next PUSCH starting after PUSCH 2. As shown in fig. 6B, the UE determines from PUCCH0 whether the PUSCH3/1 sequence satisfies the modified UCI multiplexing timing condition for PUCCH 0. At this time, PUSCH2 and its corresponding PDCCH2 are excluded from the basis of the determination. Referring to fig. 6B, the UE evaluates time intervals T61 and T62 to make the determination. If T61 ≧ N1+ X and T62 ≧ N2+ Y, the PUCCH0 and PUSCH3/1 sequences can satisfy the revised timing condition, and the PUCCH0 can be multiplexed onto the PUSCH1 with the smallest CC index of CC 1. The UE does not need to continue PUSCH detection.

If T61 < N1+ X or T62 < N2+ Y, the PUCCH0 and PUSCH3/1 sequences cannot satisfy the modified UCI multiplexing timing condition and the UE can continue to evaluate the PUSCH with the next start time, that is, PUSCH 1. At this time, PUSCH2 and PDCCH2 corresponding thereto, and PUSCH3 and PDCCH3 corresponding thereto are excluded from the basis for determining whether or not the modified UCI multiplexing timing condition is satisfied. Referring to fig. 6C, the UE evaluates time intervals T71 and T72 to make the determination. If T71 ≧ N1+ X and T72 ≧ N2+ Y, PUCCH0 and PUSCH1 can satisfy the modified UCI multiplexing timing condition, and PUCCH0 can be multiplexed onto PUSCH 1.

If T71 < N1+ X or T72 < N2+ Y, PUCCH0 and PUSCH1 cannot satisfy the modified UCI multiplexing timing condition. Since PUSCH1 is the last of all PUSCHs overlapping PUCCH0, the UE does not find that no PUSCH sequence can satisfy the corrected timing condition for PUCCH 0. Thus, the UE can determine that an error condition has occurred and can drop PUCCH0, drop all PUSCHs (i.e., PUSCH1, PUSCH2, and PUSCH3), drop PUCCH0 and all PUSCHs, or drop one or more of PUCCH0, PUSCH1, PUSCH2, or PUSCH 3.

Fifth embodiment example

In some embodiments, the UE sequentially detects (1) one or more PUCCHs and (2) one or more PUSCHs of each PDCCH corresponding to a specific start time and all subsequent PDCCHs not starting earlier than the specific start time (hereinafter, simply referred to as "PUSCH of a PDCCH sequence corresponding to the specific start time") according to a time order (e.g., from first to last) of respective start times of PDCCHs corresponding to the PUSCHs, satisfying the modified UCI multiplexing timing condition.

According to the sequentially detecting, once the UE detects that the PUSCH of the first PUSCH sequence corresponding to a specific start time satisfies the revised UCI multiplexing timing condition with respect to the one or more PUCCHs, the UE may multiplex the one or more PUCCHs onto a PUSCH having the smallest CC index among all PUSCHs of the detected PUSCH sequence. If there are multiple PUSCHs on the CC with the smallest CC index, the PUCCH may be multiplexed onto the PUSCH with the earliest start time. Furthermore, the UE does not need to perform further sequential detection of the PUSCH.

According to the above operation, after the UE traverses all PDCCHs corresponding to PUSCHs overlapping with one or more PUCCHs, in some embodiments, the UE finds no PDCCH sequence corresponding to a PUSCH satisfying the modified UCI multiplexing timing condition with respect to the one or more PUCCHs, and the UE can determine that an error condition has occurred.

Illustratively, as shown in fig. 7A, PDCCH2 has the earliest start time among all PDCCHs corresponding to the PUSCH overlapping with PUCCH 0. PDCCH2 corresponds to PUSCH 2. PDCCH3 and PDCCH1 start after PDCCH2 start time and correspond to PUSCH3 and PUSCH1, respectively. Therefore, the UE first determines whether PUSCH2/3/1 (PUSCH corresponding to PDCCH2/3/1 sequence) satisfies the corrected UCI multiplexing timing condition for PUCCH 0. Referring to fig. 7A, the UE evaluates time intervals T81 and T82 to make the determination. More specifically, if T81 ≧ N1+ X and T82 ≧ N2+ Y, PUCCH0 and PUSCH2/3/1 can satisfy the corrected timing condition, and PUCCH0 can be multiplexed onto PUSCH1 of CC1 with the smallest CC index. The UE does not need to continue PDCCH/PUSCH detection.

If T81 < N1+ X or T82 < N2+ Y, PUCCH0 and PUSCH2/3/1 cannot satisfy the modified UCI multiplexing timing condition, and the UE may continue to evaluate PDCCH3, which is the next PDCCH starting after PDCCH 2. As shown in fig. 7B, the UE determines whether PUSCH3/1 (PUSCH corresponding to PDCCH3/1 sequence) satisfies the corrected UCI multiplexing timing condition for PUCCH 0. At this time, PDCCH2 and its corresponding PUSCH2 are excluded from the basis of the determination. Referring to fig. 7B, the UE evaluates time intervals T91 and T92 to make the determination. If T91 ≧ N1+ X and T92 ≧ N2+ Y, PUCCH0 and PUSCH3/1 can satisfy the corrected timing condition, and PUCCH0 can be multiplexed onto PUSCH1 of CC1 with the smallest CC index. The UE does not need to continue PDCCH/PUSCH detection.

If T91 < N1+ X or T92 < N2+ Y, PUCCH0 and PUSCH3/1 cannot satisfy the modified UCI multiplexing timing condition, and the UE may continue to evaluate the PDCCH with the next start time, that is, PDCCH 1. At this time, PDCCH2 and PUSCH2 corresponding thereto, and PDCCH3 and PUSCH3 corresponding thereto are excluded from the basis for determining whether the modified UCI multiplexing timing condition is satisfied. Referring to fig. 7C, the UE evaluates time intervals T101 and T102 to make the determination. If T101 ≧ N1+ X and T102 ≧ N2+ Y, PUCCH0 and PUSCH1 can satisfy the revised UCI multiplexing timing condition, and PUCCH0 can be multiplexed onto PUSCH 1.

If T101 < N1+ X or T102 < N2+ Y, PUCCH0 and PUSCH1 cannot satisfy the modified UCI multiplexing timing condition. Since PUSCH1 corresponds to the last of all PDCCHs that can be considered, the UE does not find a PUSCH capable of satisfying the corrected timing condition with respect to PUCCH 0. Thus, the UE can determine that an error condition has occurred and can drop PUCCH0, drop all PUSCHs (i.e., PUSCH1, PUSCH2, and PUSCH3), drop PUCCH0 and all PUSCHs, or drop one or more of PUCCH0, PUSCH1, PUSCH2, or PUSCH 3.

Example of the sixth embodiment

In some embodiments, there are multiple PUCCHs overlapping multiple PUSCHs in the time domain. The UE may determine to multiplex only UCI of some PUCCHs, but not UCI of all PUCCHs, onto an overlapping PUSCH.

For example, there are two PUCCHs overlapping with multiple PUSCHs. The information carried by the first PUCCH is a Scheduling Request (SR) for requesting an uplink transmission resource from the base station. In this case, the UE may determine to drop the SR information (i.e., drop the first PUCCH carrying the SR), and multiplex only UCI information in the second PUCCH onto a selected PUSCH from among the plurality of PUSCHs;

as another example, there are two PUCCHs overlapping with multiple PUSCHs, the first PUCCH carrying information associated with traffic type 1 and the second PUCCH and multiple PUSCHs associated with traffic type 2. When the QOS requirements of traffic type 1 and traffic type 2 are sufficiently different, the UE may determine to multiplex UCI in the second PUCCH only on one of the plurality of PUSCHs associated with traffic type 2.

Fig. 8 is a flow diagram illustrating an example process for communication multiplexing in accordance with some embodiments of the disclosed technology. The process of fig. 8 may be performed by a UE. In block 802, the UE determines a set (or group) of PUCCHs and a set (or group) of PUSCHs that at least partially overlap in a time domain. In block 804, the UE determines whether a subset (or subgroup) of the set (or group) of PUSCHs and the set (or group) of PUCCHs satisfy one or more timing conditions (e.g., a revised UCI multiplexing timing condition). A subset (or subgroup) of PUSCHs may be smaller in size than a set (or group) of PUSCHs and may contain at least one PUSCH. If the UE determines that the subset (or subgroup) of the PUSCH and the set (or group) of PUCCHs satisfy one or more timing conditions, then in block 806, the UE multiplexes UCI of at least one PUCCH in the set (or group) of PUCCHs onto the selected PUSCH of the subset (or subgroup). Otherwise, in block 808, the UE may determine that an error condition has occurred and perform one or more error condition operations.

Fig. 9 is a block diagram representation of a portion of a radio station in accordance with some embodiments of the disclosed technology. A radio station 905, such as a wireless device (or UE), may include processor electronics 910, such as a microprocessor, that implements one or more of the techniques presented in this document. The radio station 905 may include transceiver electronics 915 to transmit and/or receive wireless signals through one or more communication interfaces, such as one or more antennas 920. The radio station 905 may include other communication interfaces for transmitting and receiving data. The radio station 905 may include one or more memories (not explicitly shown) configured to store information such as data and/or instructions. In some implementations, at least some of the disclosed techniques, modules, or functions are implemented using a radio station 905.

Some embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers in networked environments. Computer-readable media may include removable and non-removable storage devices, including but not limited to Read Only Memory (ROM), Random Access Memory (RAM), Compact Disks (CDs), Digital Versatile Disks (DVDs), and the like. Thus, a computer-readable medium may include a non-transitory storage medium. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-or processor-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.

Some embodiments disclosed may be implemented as a device or module using hardware circuitry, software, or a combination thereof. For example, a hardware circuit implementation may include discrete analog and/or digital components that are integrated as part of a printed circuit board, for example. Alternatively or additionally, the disclosed components or modules may be implemented as Application Specific Integrated Circuits (ASICs) and/or Field Programmable Gate Array (FPGA) devices. Some embodiments may additionally or alternatively include a Digital Signal Processor (DSP), which is a special purpose microprocessor having an architecture optimized with respect to the operational requirements of the digital signal processing associated with the functions disclosed herein. Similarly, the various components or sub-components within each module may be implemented in software, hardware, or firmware. Connections between modules and/or components within modules may be provided using any of the connection methods and media known in the art, including, but not limited to, communications over the internet, wired, or wireless networks using appropriate protocols.

While this patent document contains many specifics, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments. Herein, "and/or" in "a and/or B" refers to a alone, B alone, and both a and B.

Claims

1. A method for wireless communication, comprising:

determining at least partial overlap in a time domain of at least one Physical Uplink Control Channel (PUCCH) in a set of PUCCHs and at least one Physical Uplink Shared Channel (PUSCH) in a set of PUSCHs;

determining whether one of the set of PUSCHs and the set of PUCCHs satisfy one or more timing conditions, wherein the PUSCH subset contains a smaller number of PUSCHs than the set of PUSCHs and includes at least one PUSCH;

multiplexing Uplink Control Information (UCI) in at least one PUCCH in the PUCCH set onto a selected PUSCH in the PUSCH subset in response to determining that the PUSCH subset and the PUCCH set satisfy one or more timing conditions,

wherein the one or more timing conditions comprise:

in the set of PUCCHs and the PUSCH subset, the first symbol of the earliest PUCCH or PUSCH is not before symbol N1+ X after the last symbol of any corresponding PDSCH or semi-persistent scheduling (SPS) PDSCH release; and

in the PUCCH set and the PUSCH subset, a first symbol of an earliest PUCCH or PUSCH does not precede a symbol N2+ Y following a last symbol of any corresponding Physical Downlink Control Channel (PDCCH),

where N1 corresponds to the time when the UE receives and processes the PDSCH, N2 corresponds to the time when the UE prepares the PUSCH, X, Y is a constant.

2. The method of claim 1, wherein the PUCCH set consists of a single PUCCH or includes multiple PUCCHs.

3. The method of claim 2, wherein the PUCCH set consists of a single PUCCH, and the single PUCCH at least partially overlaps with each PUSCH in the PUSCH set.

4. The method of claim 2, further comprising: sequentially determining whether the single PUSCH and the PUCCH set satisfy one or more timing conditions according to the order of the single PUSCH in the PUSCH set.

5. The method of claim 4, wherein the order of the single PUSCH is determined based at least in part on an index of a respective Component Carrier (CC) associated with the single PUSCH.

6. The method of claim 5, wherein the order of the single PUSCHs is further determined based at least in part on respective start times of single PUSCHs on a same CC.

7. The method of claim 6, wherein the order of the single PUSCH is further determined based on at least one of an associated frequency domain index, a length of a occupied symbol, or a number of occupied Resource Elements (REs).

8. The method of claim 4, further comprising:

ending the sequentially determining whether the single PUSCH and the single PUCCH satisfy one or more timing conditions in response to determining that the first PUSCH of the set of PUSCHs and the set of PUCCHs satisfy the one or more timing conditions.

9. The method of claim 8, wherein the first PUSCH is a selected PUSCH of the PUSCH subset.

10. The method of claim 2, wherein the PUCCH set comprises a plurality of the PUCCHs, and each of the plurality of PUCCHs at least partially overlaps with each PUSCH in the PUSCH set.

11. The method of claim 2, further comprising, in accordance with an order of Component Carriers (CCs) associated with the set of PUSCHs, sequentially determining (1) all PUSCHs on respective CCs belonging to the set of PUSCHs, and (2) whether the set of PUCCH satisfies one or more timing conditions.

12. The method of claim 11, further comprising:

in response to determining that all PUSCHs on a first CC and the PUCCH set satisfy one or more timing conditions, ending the sequentially determining (1) all PUSCHs of respective CCs belonging to the set of PUSCHs, and (2) whether the PUCCH set satisfies the one or more timing conditions.

13. The method of claim 12, wherein a PUSCH with an earliest start time among all PUSCHs on the first CC is a selected PUSCH in the PUSCH subset.

14. The method of claim 1, further comprising: sequentially determining whether a single PUSCH and the set of PUCCHs satisfy one or more timing conditions according to an order of the single PUSCH of the set of PUSCHs.

15. The method of claim 14, wherein an order of the single PUSCHs is determined based at least in part on respective start times of the single PUSCHs.

16. The method of claim 15, wherein the order of the single PUSCH is further determined based at least in part on an index of a respective Component Carrier (CC) associated with the single PUSCH having a same starting time.

17. The method of claim 16, wherein the order of the single PUSCH is further determined based on at least one of an associated frequency domain index, a length of a occupied symbol, or a number of occupied Resource Elements (REs).

18. The method of claim 14, wherein the selected PUSCH of the PUSCH subset is associated with a smallest CC index of the CCs corresponding to all PUSCHs determined to satisfy one or more timing conditions.

19. The method of claim 18, wherein the selected PUSCH of the PUSCH subset is the PUSCH with the earliest start time of all PUSCHs associated with the smallest CC index.

20. The method of claim 14, wherein the order of the single PUSCH is determined based at least in part on a respective end time of a single PDCCH corresponding to the single PUSCH.

21. The method of claim 20, wherein the order of the single PUSCH is further determined based at least in part on an index of a respective Component Carrier (CC) associated with the single PDCCH having a same end time.

22. The method of claim 1, further comprising: sequentially determining, according to an order of individual PUSCHs in the set of PUSCHs, (1) a PUSCH sequence of an individual PUSCH that includes a particular start time, and (2) whether the set of PUCCHs satisfies one or more timing conditions.

23. The method of claim 22, wherein an order of the single PUSCHs is determined based at least in part on respective start times of the single PUSCHs.

24. The method of claim 23, wherein the PUSCH sequence further comprises one or more PUSCHs in the PUSCH set starting no earlier than a particular starting time.

25. The method of claim 22, further comprising:

in response to determining that the first PUSCH sequence and the set of PUCCHs satisfy one or more timing conditions, ending the sequentially determining (1) a PUSCH sequence comprising a single PUSCH at a particular start time, and (2) whether the set of PUCCHs satisfy the one or more timing conditions.

26. The method of claim 25, wherein the selected PUSCH of the subset is the PUSCH associated with the smallest CC index of all PUSCHs of the first PUSCH sequence.

27. The method of claim 26, wherein the selected PUSCH of the subset has an earliest start time among all PUSCHs of the first PUSCH sequence associated with a smallest CC index.

28. The method of claim 1, further comprising: sequentially determining, according to a PDCCH order corresponding to a single PUSCH in the set of PUSCHs, (1) a subset of PUSCHs associated with a PDCCH having a particular start time, and (2) whether the set of PUCCHs satisfies one or more timing conditions.

29. The method of claim 28, wherein an order of PDCCHs corresponding to a single PUSCH in the set of PUSCHs is determined based at least in part on respective start times of PDCCHs.

30. The method of claim 29, wherein the PUSCH subset comprises one or more PUSCHs of the set of PUSCHs corresponding to one or more PDCCHs beginning no earlier than the particular start time.

31. The method of claim 28, further comprising:

in response to determining that the first subset of PUSCHs and the set of PUCCHs satisfy one or more timing conditions, ending the sequentially determining (1) a subset of PUSCHs associated with a PDCCH having a particular start time, and (2) whether the set of PUCCHs satisfy the one or more timing conditions.

32. The method of claim 31, wherein the selected PUSCH of the subset is the PUSCH associated with the smallest CC index of all PUSCHs of the first PUSCH subset.

33. The method of claim 32, wherein the selected PUSCH of the subset has an earliest start time among all PUSCHs of the first PUSCH subset associated with a smallest CC index.

34. The method of claim 1, wherein multiplexing UCI of the at least one PUCCH set to the selected PUSCH of the subset comprises selecting at least one PUCCH from the PUCCH set based at least in part on one or more criteria.

35. The method of claim 34, wherein the one or more criteria relate to at least one of a Scheduling Request (SR) or a traffic type.

36. An apparatus for wireless communication comprising a memory and a processor, wherein the processor reads code from the memory and implements the method of any of claims 1 to 35.

37. A computer readable program storage medium having code stored thereon, which when executed by a processor causes the processor to implement the method of any of claims 1 to 35.