Uplink information multiplexing method and apparatus, and device, medium and program product

Abstract

The present application belongs to the field of wireless communications. Disclosed are an uplink information multiplexing method and apparatus, and a device, a medium and a program product. The method is executed by a terminal device. The method comprises: when one or more uplink channels are to be transmitted within a first time period and a first timing condition is satisfied, multiplexing uplink control information (UCI) carried in the one or more uplink channels onto a first channel for transmission.

Description

Uplink information multiplexing method, device, equipment, medium and program product TECHNICAL FIELD

[0001] The present application relates to the field of wireless communication, in particular to an uplink information multiplexing method, device, equipment, medium and program product. BACKGROUND

[0002] Under the 5th Generation (5G) mobile communication technology, uplink information multiplexing is symbol level multiplexing based on overlap judgment. However, the implementation of such symbol level uplink information multiplexing is relatively complex, and will also cause large power consumption of terminal devices and network devices.

[0003] Since the 6th Generation (6G) mobile communication technology needs to consider low-power design, how to implement low-power uplink information multiplexing under the 6G mobile communication technology is a problem to be solved at present. SUMMARY

[0004] The present application provides an uplink information multiplexing method, device, equipment, medium and program product, which at least includes:

[0005] According to an aspect of an embodiment of the present application, an uplink information multiplexing method is provided, which is executed by a terminal device, and the method includes:

[0006] In a case where one or more uplink channels are to be transmitted in a first time period and a first timing condition is met, multiplexing uplink control information (UCI) carried in the one or more uplink channels on a first channel for transmission.

[0007] According to an aspect of an embodiment of the present application, an uplink information multiplexing method is provided, which is executed by a network device, and the method includes:

[0008] In a case where one or more uplink channels transmitted by a terminal device are to be received in a first time period, and the one or more uplink channels carry UCI and a first timing condition is met, receiving the multiplexed UCI on a first channel.

[0009] According to an aspect of an embodiment of the present application, an uplink information multiplexing device is provided, which includes:

[0010] The sending module is configured to, in a case where one or more uplink channels are to be transmitted in a first time period and a first timing condition is met, multiplex UCI carried in the one or more uplink channels on a first channel for transmission.

[0011] According to an aspect of some embodiments of the present application, an apparatus for multiplexing uplink information is provided, the apparatus comprising:

[0012] a receiving module configured to receive, on a first channel, multiplexed UCI transmitted by a terminal device, in a case where one or more uplink channels to be received by the terminal device in a first time period carry the UCI and satisfy a first timing condition.

[0013] According to an aspect of some embodiments of the present application, a terminal device is provided, the terminal device comprising:

[0014] a sending module configured to multiplex, on a first channel, UCI carried by one or more uplink channels to be transmitted by the terminal device in a first time period, in a case where the one or more uplink channels satisfy a first timing condition.

[0015] According to an aspect of some embodiments of the present application, a network device is provided, the network device comprising:

[0016] a receiving module configured to receive, on a first channel, multiplexed UCI transmitted by a terminal device, in a case where one or more uplink channels to be received by the terminal device in a first time period carry the UCI and satisfy a first timing condition.

[0017] According to an aspect of some embodiments of the present application, a terminal device is provided, the terminal device comprising: a processor; a transceiver connected to the processor; a memory for storing executable instructions of the processor; wherein the transceiver is configured to load and execute the executable instructions to implement the method for multiplexing uplink information performed by the terminal device.

[0018] According to an aspect of some embodiments of the present application, a network device is provided, the network device comprising: a processor; a transceiver connected to the processor; a memory for storing executable instructions of the processor; wherein the transceiver is configured to load and execute the executable instructions to implement the method for multiplexing uplink information performed by the network device.

[0019] According to an aspect of some embodiments of the present application, a chip is provided, the chip comprising programmable logic circuitry and / or at least one program, when the chip is running on a terminal device, to implement the method for multiplexing uplink information performed by the terminal device.

[0020] According to an aspect of some embodiments of the present application, a chip is provided, the chip comprising programmable logic circuitry and / or at least one program, when the chip is running on a network device, to implement the method for multiplexing uplink information performed by the network device.

[0021] According to an aspect of some embodiments of the present application, a computer readable storage medium is provided, and the computer readable storage medium stores at least one program, and the at least one program is loaded and executed by a processor to implement the uplink information multiplexing method performed by the terminal device.

[0022] According to an aspect of some embodiments of the present application, a computer readable storage medium is provided, and the computer readable storage medium stores at least one program, and the at least one program is loaded and executed by a processor to implement the uplink information multiplexing method performed by the network device.

[0023] According to an aspect of some embodiments of the present application, a computer program product is provided, and the computer program product includes computer instructions, the computer instructions are stored in a computer readable storage medium, a processor acquires the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to implement the uplink information multiplexing method performed by the terminal device.

[0024] According to an aspect of some embodiments of the present application, a computer program product is provided, and the computer program product includes computer instructions, the computer instructions are stored in a computer readable storage medium, a processor acquires the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to implement the uplink information multiplexing method performed by the network device.

[0025] According to an aspect of some embodiments of the present application, a computer program is provided, and the computer program is executed by a processor or a transceiver of a terminal device to implement the uplink information multiplexing method performed by the terminal device.

[0026] According to an aspect of some embodiments of the present application, a computer program is provided, and the computer program is executed by a processor or a transceiver of a network device to implement the uplink information multiplexing method performed by the network device.

[0027] The technical scheme provided by the embodiments of the present application can include the following beneficial effects:

[0028] In the case that the first time period is taken as a granularity, there is one or more uplink channels to be transmitted in the first time period, and the first timing condition is met, the UCI carried in the one or more uplink channels is multiplexed and transmitted. The complexity of UCI multiplexing transmission is reduced, and the terminal device does not need to judge through a complex time line, but can judge based on the first time period to achieve multiplexing UCI on the first channel and transmitting. BRIEF DESCRIPTION OF DRAWINGS

[0029] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly introduced. Obviously, the drawings in the following description only constitute some embodiments of the present application, and for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0030] FIG. 1 shows a schematic diagram of a communication system according to an example embodiment of the present application;

[0031] FIG. 2 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0032] FIG. 3 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0033] FIG. 4 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0034] FIG. 5 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0035] FIG. 6 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0036] FIG. 7 shows a flow chart of an uplink information multiplexing method according to an example embodiment of the present application;

[0037] FIG. 8 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0038] FIG. 9 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0039] FIG. 10 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0040] FIG. 11 shows a schematic diagram of an uplink information multiplexing method according to an example embodiment of the present application;

[0041] FIG. 12 shows a flow chart of an uplink information multiplexing method according to an example embodiment of the present application;

[0042] FIG. 13 shows a structural block diagram of a terminal device according to an example embodiment of the present application;

[0043] FIG. 14 shows a structural block diagram of a network device according to an example embodiment of the present application;

[0044] FIG. 15 shows a structural diagram of a communication device according to an example embodiment of the present application. DETAILED DESCRIPTION

[0045] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in further detail below with reference to the accompanying drawings. Exemplary embodiments will be described in detail here, examples of which are illustrated in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0046] The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The singular forms “a,” “the,” and “the” used in this application and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used herein refers to and includes any or all possible combinations of one or more of the associated listed items.

[0047] It should be understood that although the terms first, second, third, etc., may be used in this application to describe various information, this information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, without departing from the scope of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the word "if" as used herein can be interpreted as "in the case of," "when," or "in response to determination." In this specification, when expressing the meaning of Boolean values, "0" is expressed as "first meaning" and "1" as "second meaning." Without loss of generality, those skilled in the art will understand that the meanings they represent can be interchanged, i.e., "1" represents "first meaning" and "0" represents "second meaning."

[0048] It should be understood that the format, name, and value of the frames / elements / fields involved in the various embodiments of this application are merely examples and do not imply any limitation on the format, name, and value of the frames / elements / fields. In different embodiments or designs, it is possible that one or more of the aforementioned element / field names, their positions in the frame, their arrangement order with other elements / fields, the number of bytes occupied, or the number of bits occupied may change. Similarly, in different embodiments or designs, it is possible that one or more of the aforementioned frame names, included elements / fields, the number of bytes occupied, or the number of bits occupied may change.

[0049] Figure 1 shows a schematic diagram of a communication system provided in an exemplary embodiment of this application. The communication system includes at least a network device 110 and a terminal device 120. The communication system may or may not include a terminal device 130, and this application does not limit this.

[0050] The network device 110 in this application provides wireless communication functionality. This network device 110 includes, but is not limited to: an evolved Node B (eNB), a Radio Network Controller (RNC), a Node B (NB), a Base Station Controller (BSC), a Base Transceiver Station (BTS), a Home Evolved Node B (or Home Node B, HNB), a Base Band Unit (BBU), an Access Point (AP) in a Wireless Fidelity (Wi-Fi) system, a wireless relay node, a wireless backhaul node, a Transmission Point (TP), or a Transmission and Reception Point (TRP), etc. It can also be used for next-generation Node B (Next Generation Node) systems in 5G mobile communication systems. B, gNB) or transmission point (TRP or TP), or, in a 5G system, one or a group of antenna panels (including multiple antenna panels) of a base station, or, network nodes constituting a gNB or transmission point, such as baseband unit (BBU) or distributed unit (DU), or base stations in Beyond Fifth Generation (B5G) or 6th Generation (6G) mobile communication systems, or core network (CN), fronthaul, backhaul, radio access network (RAN), network slicing, etc., or serving cell, primary cell (PCell), primary secondary cell (PSCell), special cell (SpCell), secondary cell (SCell), neighboring cell, etc. of terminal equipment.

[0051] The terminal equipment 120 in this application is also referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user device. This terminal includes, but is not limited to: handheld devices, wearable devices, in-vehicle devices, and IoT devices, such as: mobile phones, tablets, e-readers, laptops, desktop computers, televisions, game consoles, mobile internet devices (MID), augmented reality (AR) terminals, virtual reality (VR) terminals, mixed reality (MR) terminals, extended reality (XR) terminals, baffle reality (BR) terminals, cinematic reality (CR) terminals, deceive reality (DR) terminals, wearable devices, controllers, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, and wireless terminals in remote surgery. Wireless terminals, cellular phones, cordless phones, Session Initiation Protocol (SIP) phones, Wireless Local Loop (WLL) stations, Personal Digital Assistants (PDAs), Set-Top Boxes (STBs), and Customer Premise Equipment (CPEs) are all examples of devices used in medical surgery.

[0052] In some embodiments, network device 110 and terminal device 120 communicate with each other through some air interface technology, such as the Uu interface.

[0053] For example, there are two communication scenarios between network device 110 and terminal device 120: uplink communication scenario and downlink communication scenario. Uplink communication, or uplink transmission, refers to sending signals or data to network device 110; downlink communication, or downlink transmission, refers to sending signals or data to terminal device 120.

[0054] In some embodiments, terminal device 120 and terminal device 130 communicate with each other through some air interface technology, such as the PC5 interface.

[0055] For example, there are two communication scenarios between terminal device 120 and terminal device 130: a first side-by-side communication scenario and a second side-by-side communication scenario. The first side-by-side communication refers to terminal device 120 sending signals to terminal device 130; the second side-by-side communication refers to terminal device 130 sending signals to terminal device 120.

[0056] In some embodiments, terminal device 120 and terminal device 130 are both within network coverage and located in the same cell, or terminal device 120 and terminal device 130 are both within network coverage but located in different cells, or terminal device 120 is within network coverage but terminal device 130 is outside network coverage.

[0057] In some embodiments of this application, "NR" may also be referred to as a 5G NR system or a 5G system. The 5G mobile communication system may include non-standalone (NSA) and / or standalone (SA) networking.

[0058] The technical solutions provided in the embodiments of this application can also be applied to Machine-Type Communication (MTC), Long Term Evolution-Machine (LTE-M) technology, Device-to-Device (D2D) networks, Machine-to-Machine (M2M) networks, Internet of Things (IoT) networks, or other networks. Among them, IoT networks may include, for example, vehicle-to-everything (V2X) networks. The communication methods in V2X systems are collectively referred to as Vehicle to X (V2X), where X can represent anything. For example, V2X may include: Vehicle to Vehicle (V2V) communication, Vehicle to Infrastructure (V2I) communication, Vehicle to Pedestrian (V2P) communication, or Vehicle to Network (V2N) communication, etc.

[0059] The communication system provided in this application embodiment can be applied to at least one of the following communication scenarios: uplink communication scenario, downlink communication scenario, and sidelink communication scenario.

[0060] Next, let me introduce the relevant technologies in this case:

[0061] 15G Uplink Control Information (UCI) multiplexing

[0062] In 5G New Radio (NR) systems, uplink control information transmitted via the Physical Uplink Control Channel (PUCCH) includes one or more of the following: Scheduling Request (SR) information, Acknowledgment Feedback (ACK / NACK) information, Channel-state Information (CSI) information, and Link Recovery Request (LRR) information. If multiple PUCCH resources to be transmitted by the User Equipment (UE) overlap, or if at least one PUCCH resource overlaps with at least one PUSCH resource, then the uplink control information in at least one uplink control channel will be multiplexed into one PUCCH or PUSCH for transmission.

[0063] For example, as shown in part (a) of Figure 2, if the UE needs to transmit {PUCCH1, PUCCH2, PUCCH3} with overlapping resources, where PUCCH1 carries CSI, PUCCH2 carries Hybrid Automatic Repeat Request-Acknowledgement (HARQ-ACK) information, and PUCCH3 carries SR, then the uplink control information carried in {PUCCH1, PUCCH2, PUCCH3} will be multiplexed into a single PUCCH for transmission. This PUCCH will be used to carry {CSI, HARQ-ACK, SR}. This PUCCH used to carry {CSI, HARQ-ACK, SR} is one of {PUCCH1, PUCCH2, PUCCH3}.

[0064] For example, as shown in part (b) of Figure 2, if the {PUCCH1, PUCCH2, PUSCH} to be transmitted by the UE have overlapping resources, where PUCCH1 carries CSI and PUCCH2 carries HARQ-ACK information, then the uplink control information carried in {PUCCH1, PUCCH2} will be multiplexed into a single PUSCH for transmission. This PUSCH will be used to carry {CSI, HARQ-ACK}.

[0065] In some embodiments, the "resource overlap" mentioned in this application refers to overlap in the time domain, or can be understood as "time-domain resource overlap" or "time-domain location overlap". In some embodiments, the "resource overlap" mentioned in this application refers to "time-frequency resource overlap", or can be understood as "time-frequency resource block overlap".

[0066] In 5G NR systems, UCI multiplexing is symbol-level multiplexing. When multiple PUCCHs carrying UCIs exist in a time slot, the UE determines one or more PUCCHs for transmitting the multiplexed UCIs. The process of determining one or more PUCCHs is as follows:

[0067] For example, as shown in Figure 3, there are three PUCCHs {PUCCH1, PUCCH2, PUCCH3} in one time slot. PUCCH1 carries UCI1, PUCCH2 carries UCI2, and PUCCH3 carries UCI3. When performing UCI multiplexing in this time slot, the following steps are performed:

[0068] Step 1: Construct a PUCCH set Q, which contains PUCCHs from a single time slot. For example, as shown in Figure 3, {PUCCH1, PUCCH2, PUCCH3}. These PUCCHs are first sorted by the earliest start symbol. If the start symbols are the same, they are then sorted by the longest duration. If both the start symbol and duration are the same, the sorting method is arbitrary.

[0069] Step 2: Locate the earliest start symbol PUCCH, as shown in Figure 3 (PUCCH1). Then, find all PUCCHs that overlap with PUCCH1, as shown in Figure 3 (PUCCH2). Multiplex the UCI1 carried in PUCCH1 and the UCI2 carried in PUCCH2 according to the specified rules. Assume the multiplexed PUCCH is PUCCH2'.

[0070] Step 3: Remove PUCCH1 and PUCCH2 from set Q and add PUCCH2'. The updated set Q then contains PUCCH2' and PUCCH3. Reorder according to step 1, and repeat step 2 until there are no overlapping PUCCHs. For example, if PUCCH2' and PUCCH3 do not overlap (as shown in Figure 4), the UE determines one or more PUCCHs as PUCCH2' and PUCCH3; if PUCCH2' and PUCCH3 overlap (as shown in Figure 5), the UE needs to further multiplex UCI1, UCI2, and UCI3 to determine a new PUCCH3'.

[0071] Based on steps 1-3 above, it can be understood that in related technologies, the target PUCCH for UCI multiplexing is determined from one or more PUCCHs based on the judgment of overlap, with the granularity of a single PUCCH.

[0072] Furthermore, if a UE needs to transmit multiple overlapping PUCCHs and / or PUSCHs in a single time slot, and at least one of these overlapping PUCCHs and / or PUSCHs corresponds to or is scheduled by Downlink Control Information (DCI), the UE will multiplex the various UCI types carried in the multiple overlapping PUCCHs and / or PUSCHs together for transmission, provided the multiplexing timeline condition is met. The multiplexing timeline condition is defined by the start symbol S0 of the earliest PUCCH or PUSCH among the multiple overlapping PUCCHs and / or PUSCHs, and includes, but is not limited to:

[0073] • The start time of S0 is no earlier than the last symbol of any Physical Downlink Shared Channel (PDSCH). Time;

[0074] • The start time of S0 is no earlier than the last symbol of any Physical Downlink Control Channel (PDCCH). During the time period, the PDCCH is used to carry the DCI format, which has corresponding HARQ-ACK information, such as semi-persistent scheduling (SPS) PDSCH release, Scell ​​dormancy, etc.

[0075] • If aperiodic CSI reports are not reused in multiple overlapping PUCCHs and / or PUSCHs, then the start time of S0 shall not be earlier than the last symbol of any DCI. The time, any DCI includes a DCI for scheduling PUSCH, the PUSCH being included in the plurality of overlapping PUCCHs and / or PUSCHs, and any DCI also includes its corresponding HARQ-ACK information in the plurality of overlapping PUCCHs.

[0076] • If a non-periodic CSI report is multiplexed across multiple overlapping PUCCHs and / or PUSCHs, then the start time of S0 shall not be earlier than the last symbol of any DCI. At any given time, any DCI includes a DCI for scheduling PUSCH, which is included in the plurality of overlapping PUCCHs and / or PUSCHs, and any DCI also includes its corresponding HARQ-ACK information in the plurality of overlapping PUCCHs.

[0077] Refer to the related art description and details will not be elaborated here. For example, if a UE would transmit multiple overlapping PUCCHs in a slot or overlapping PUCCH(s) and PUSCH(s) in a slot and, when applicable as described in clauses 9.2.5.1, 9.2.5.2, 9.2.5.3 and 18, the UE is configured to multiplex different UCI types or UCI of different priority indexes in one PUCCH, and at least one of the multiple overlapping PUCCHs or PUSCHs is in response to a DCI format detection by the UE, the UE multiplexes all corresponding UCI types or UCI of different priority indexes if the following conditions are met. If one of the PUCCH transmissions or PUSCH transmissions is in response to a DCI format detection by the UE, the UE expects that the first symbol S0 of the earliest PUCCH or PUSCH, among a group overlapping PUCCHs and PUSCHs in the slot, satisfies the following timeline conditions:

[0078] - S0 is not before a symbol with CP starting after after a last symbol of any corresponding PDSCH, is given by maximum of where for the i-th PDSCH with corresponding HARQ-ACK transmission on a PUCCH which is in the group of overlapping PUCCHs and PUSCHs, d 1,1 is selected for the i-th PDSCH following[6,TS 38.214],N1is selected based on the UE PDSCH processing capability of the i-th PDSCH and SCS configurationμ,whereμcorresponds to the smallest SCS configuration among the SCS configurations used for the PDCCH scheduling the i-th PDSCH if any,the i-th PDSCH,the PUCCH with corresponding HARQ-ACK transmission for the i-th PDSCH,and all PUSCHs in the group of overlapping PUCCHs and PUSCHs.

[0079] -S0is not before a symbol with CP starting after after a last symbol of a PDCCH reception providing a DCI format having associated HARQ-ACK information without scheduling a PDSCH reception. is given by maximum of where for the i-th PDCCH providing the DCI format with corresponding HARQ-ACK transmission on a PUCCH which is in the group of overlapping PUCCHs and PUSCHs, N as described in clause 10.2,whereμcorresponds to the smallest SCS configuration among the SCS configurations used for the PDCCH,the PUCCH with corresponding HARQ-ACK information,and all PUSCHs in the group of overlapping PUCCHs and PUSCHs.

[0080] -if there is no aperiodic CSI report multiplexed in a PUSCH in the group of overlapping PUCCHs and PUSCHs,S0is not before a symbol with CP starting after after a last symbol of

[0081] -any PDCCH with the DCI format scheduling an overlapping PUSCH,and

[0082] -any PDCCH providing a DCI format with corresponding HARQ-ACK information in an overlapping PUCCH in the slot.

[0083] If there is at least one PUSCH in the group of overlapping PUCCHs and PUSCHs, is given by maximum of where for the i-th PUSCH which is in the group of overlapping PUCCHs and PUSCHs, d 2,1 ,d 2,2 and T switch are selected for the i-th PUSCH following[6,TS 38.214],N2is selected based on the UE PUSCH processing capability of the i-th PUSCH and SCS configurationμ,whereμcorresponds to the smallest SCS configuration among the SCS configurations used for the PDCCH scheduling the i-th PUSCH,the PDCCHs scheduling the PDSCHs,or providing the DCI formats without scheduling PDSCHs,with corresponding HARQ-ACK information on a PUCCH which is in the group of overlapping PUCCHs / PUSCHs,and all PUSCHs in the group of overlapping PUCCHs and PUSCHs.

[0084] If there is no PUSCH in the group of overlapping PUCCHs and PUSCHs, is given by maximum of where for the i-th PDSCH,or the i-th PDCCH providing a DCI format without scheduling PDSCH,with corresponding HARQ-ACK information on a PUCCH which is in the group of overlapping PUCCHs, N2is selected based on the UE PUSCH processing capability of the PUCCH serving cell if configured.N2is selected based on the UE PUSCH processing capability 1,if PUSCH processing capability is not configured for the PUCCH serving cell.μis selected based on the smallest SCS configuration between the SCS configuration used for the PDCCH scheduling the i-th PDSCH,or providing the i-th DCI format without scheduling PDSCH,with corresponding HARQ-ACK information on a PUCCH which is in the group of overlapping PUCCHs,and the SCS configuration for the PUCCH serving cell.

[0085] -if there is an aperiodic CSI report multiplexed in a PUSCH in the group of overlapping PUCCHs and PUSCHs,S0is not before a symbol with CP starting after after a last symbol of

[0086] -any PDCCH with the DCI format scheduling an overlapping PUSCH,and

[0087] -any PDCCH scheduling a PDSCH,or providing a DCI format,with corresponding HARQ-ACK information in an overlapping PUCCH in the slot.

[0088] whereμcorresponds to the smallest SCS configuration among the SCS configuration of the PDCCHs,the smallest SCS configuration for the group of the overlapping PUSCHs,and the smallest SCS configuration of CSI-RS associated with the DCI format scheduling the PUSCH with the multiplexed aperiodic CSI report,and d=2 forμ=0,1,d=3 for μ=2,and d=4 forμ≥3.T switch is defined in[6,TS 38.214]and it is applied only if Z1of Table 5.4-1in[6,TS 38.214]is applied to the determination of Z.

[0089] -N1,N2,d 1,1 ,d 2,1 ,d 2,2 ,and Z are defined in[6,TS 38.214]andκand T C are defined in[4,TS 38.211].

[0090] As described in the above scheme, 5G UCI multiplexing is symbol-level multiplexing. The condition for determining multiplexing is that there is overlap between PUCCH and / PUSCH, and the multiplexing timeline condition is met. However, symbol-level multiplexing introduces certain complexity to the processing of both the base station and the terminal. This complexity stems from the following two aspects:

[0091] Question 1: Complexity of Dynamic Multiplexing Timeline: As described in the above scheme, the multiplexing timeline of 5G PUCCH / PUSCH is defined based on the start symbol of the earliest PUCCH / PUSCH among the overlapping PUCCH / PUSCH, as shown in Figure 6. If PUCCH2 is semi-statically configured, the network side schedules PUCCH1 first, based on the first symbol of the earliest PUCCH in PUCCH1 and PUCCH2. Given the first S0 (symbol) shown in Figure 6 and the multiplexing timeline, it can be determined that the network side can send DCI / PDSCH before the multiplexing timeline before the first S0, for example, before the first S1. If the network side sends DCI and schedules PUCCH3 before the first S1, then based on the first symbol of the earliest PUCCH of PUCCH1, PUCCH2, and PUCCH3 as the second S0 and the multiplexing timeline, it can be determined that the network side can send DCI / PDSCH before the multiplexing timeline before the second S0, for example, before the second S1. This will cause the network side's previous scheduling plan to need to be changed with the dynamic changes of the multiplexing timeline, increasing the complexity of the network side scheduler. From the terminal's perspective, the terminal only needs to check the deadline of the multiplexing timeline before the first S0. However, due to the dynamic changes of the multiplexing timeline, the UE needs to perform a multiplexing check every time it receives a DCI, which also increases the complexity of the UE implementation.

[0092] Question 2: Complexity of determining the PUCCH to be transmitted from the set Q: As described in the above scheme, the terminal needs to perform complex pseudocode / loop steps to determine the PUCCH to be transmitted from the PUCCH set of a time slot. The pseudocode / loop steps need to be continuously updated iteratively based on the multiplexing results. Although this can reduce the latency of UCI to some extent, the terminal and the network side need to perform this step once in each time slot, which will bring high complexity and power consumption to the network side and the terminal side.

[0093] The design of 6G systems needs to consider low power consumption on both the network and terminal sides. Therefore, this application proposes a time-slot-level UCI multiplexing scheme, which can not only reduce the complexity of network-side schedulers and UE implementations and reduce power consumption, but also simplify standard design, remove complex pseudocode and loop steps from the standard, and make the standard more concise and clear.

[0094] Figure 7 illustrates a flowchart of an uplink information multiplexing method provided in an exemplary embodiment of this application. The method is executed by a terminal device and includes:

[0095] Step 220: If one or more uplink channels are to be transmitted within the first time period and the first timing condition is met, the UCI carried in one or more uplink channels is multiplexed and transmitted on the first channel.

[0096] The first time period includes one or more of the following: time slot, sub-time slot, subframe, half-frame, and multiple time units. Optionally, the time unit described in the embodiments of this application may be understood as a time-domain resource unit, including one or more of the following: symbol, symbol group, time slot, sub-time slot, frame, and subframe. In the embodiments of this application, one time unit is used as an example of one symbol for illustration.

[0097] Uplink channels include PUCCH and / or PUSCH. One or more uplink channels include: one or more PUCCH, or one or more PUSCH, or one or more PUCCH and one or more PUSCH.

[0098] First timing condition:

[0099] The first timing condition is determined based on the start time unit of the first time period. Optionally, the first timing condition is determined based on the start symbol of the first time period; or, the first timing condition is determined based on the start symbol group of the first time period; or, the first timing condition is determined based on the start time slot of the first time period; or, the first timing condition is determined based on the start sub-time slot of the first time period; or, the first timing condition is determined based on the start frame of the first time period; or, the first timing condition is determined based on the start sub-frame of the first time period. In this embodiment, the first timing condition is determined based on the start symbol of the first time period.

[0100] In some embodiments, satisfying the first timing condition includes one or more of the following:

[0101] • The start time unit of the first time period is no earlier than the first time unit. The first time unit is determined based on the first processing time after the first PDSCH ends. The first PDSCH is the PDSCH corresponding to the UCI carried in one or more uplink channels.

[0102] • The start time unit of the first time period is no earlier than the second time unit. The second time unit is determined based on the second processing time after the first PDCCH ends. The first PDCCH is used to carry the first DCI format. The first DCI format has corresponding first HARQ-ACK information. The first HARQ-ACK information is carried in one or more uplink channels.

[0103] • The start time unit of the first time period is no earlier than the third time unit. The third time unit is determined based on the third processing time after the end of the second PDCCH. The second PDCCH is used to schedule the first PUSCH and / or to carry the second DCI format or schedule the second PDSCH. The second DCI format or the second PDSCH has corresponding second HARQ-ACK information. The second HARQ-ACK information is carried in one or more uplink channels, and the one or more uplink channels include the first PUSCH.

[0104] In some embodiments, satisfying the first timing condition includes one or more of the following:

[0105] • The start time unit of the first time period is no earlier than the first time unit. The first time unit is determined based on the first processing time after the first PDSCH ends. The first PDSCH is the PDSCH corresponding to the UCI carried in one or more uplink channels.

[0106] • The start time unit of the first time period is no earlier than the second time unit. The second time unit is determined based on the second processing time after the first PDCCH ends. The first PDCCH is used to carry the first DCI format. The first DCI format has corresponding first HARQ-ACK information. The first HARQ-ACK information is carried in one or more uplink channels.

[0107] • The start time unit of the first time period is no earlier than the third time unit. The third time unit is determined based on the third processing time after the end of the second PDCCH. The second PDCCH is used to schedule the first PUSCH and / or to carry the second DCI format or schedule the second PDSCH. The second DCI format or the second PDSCH has corresponding second HARQ-ACK information. The second HARQ-ACK information is carried in one or more uplink channels, and the one or more uplink channels include the first PUSCH.

[0108] In some embodiments, taking T0 as the starting time unit of the first time period as an example, satisfying the first timing condition includes one or more of the following:

[0109] • T0 is not earlier than the first time unit, which begins after the first processing time following the end of the first PDSCH; that is, the first time unit is the first time unit following the first processing time following the end of the first PDSCH.

[0110] • T0 is not earlier than the second time unit, which begins after the second processing time following the end of the first PDCCH; that is, the second time unit is the first time unit following the second processing time following the end of the first PDCCH.

[0111] • T0 is not earlier than the third time unit, which begins after the third processing time following the end of the second PDCCH; that is, the third time unit is the first time unit following the third processing time following the end of the second PDCCH.

[0112] -T0is not before a symbol with CP starting after T proc,1 after a last symbol of any corresponding PDSCH,

[0113] -T0is not before a symbol with CP starting after T proc,2 after a last symbol of a PDCCH reception providing a DCI format having associated HARQ-ACK information without scheduling a PDSCH reception.

[0114] -T0is not before a symbol with CP starting after T proc,3 after a last symbol of

[0115] -any PDCCH with the DCI format scheduling an overlapping PUSCH,and

[0116] -any PDCCH providing a DCI format with corresponding HARQ-ACK information in an overlapping PUCCH in the slot.

[0117] It should be understood that the processing time mentioned in the embodiments of this application refers to the processing time period during which the terminal device processes data and / or control information.

[0118] In this embodiment, the multiplexing timeline is changed from the start symbol of the earliest PUCCH / PUSCH in the overlapping PUCCH / PUSCH set to the first symbol of the first time period (e.g., time slot / sub-time slot). This is equivalent to the dynamic timeline becoming a semi-static timeline, which allows the network side to perform better pre-scheduling and the terminal side to semi-statically determine the time period for multiplexing judgment, effectively reducing the implementation complexity of the network-side scheduler / terminal.

[0119] To address issue 1 above, the terminal device does not need to determine whether the multiplexing timeline conditions are met based on overlap at the granularity of a single uplink channel. For example, assuming the terminal device is about to transmit three uplink channels {uplink channel 1, uplink channel 2, uplink channel 3}, in related technologies, the terminal device needs to perform a multiplexing judgment and update the multiplexing deadline every time it receives a DCI-scheduled uplink channel. Furthermore, the network side's pre-scheduling and pre-arrangements may change each time it sends a DCI-scheduled uplink channel. When the number of uplink channels is sufficient, or when the dynamic changes of uplink channels are complex, the judgment process of the terminal device and the pre-scheduling arrangement of the network side become more complex. Based on the embodiments of this application, the terminal device only needs to determine whether the timing conditions are met based on the start symbol of the first time period. Since the first time period is semi-static, regardless of the number of uplink channels in the first time period or how the uplink channels change dynamically, it is only necessary to make a judgment based on the start time unit of the first time period. There is no need for multiple judgments, and the judgment result will not change dynamically. This will not increase the judgment complexity of the terminal device or the complexity of network device scheduling and arrangement.

[0120] In some embodiments, the UCI carried in one or more uplink channels includes one or more of the following: SR information, ACK / NACK, CSI, LRR, CLI.

[0121] In some embodiments, the UCIs carried in one or more uplink channels are transmitted in the first channel using joint coding or separate coding. Joint coding refers to concatenating and coding the UCIs from one or more uplink channels in a specific order. Optionally, joint coding refers to concatenating and coding the UCIs from one or more uplink channels in a first order. The first order is predefined or preconfigured. The first order is related to the type of UCI. In one example, the order is HARQ-ACK priority over SR information, and SR information priority over CSI. It should be noted that this is only an illustrative example, and the first order can be other possible cases, which are not limited in this embodiment. Separate coding refers to independently coding the UCIs from one or more uplink channels and mapping them to independently determined physical resources for transmission.

[0122] In some embodiments, the first channel is one or more of one or more uplink channels, or the first channel is a new uplink channel determined based on the content carried by one or more uplink channels. When multiple uplink channels are to be transmitted within a first time period, the first channel is determined according to a preset rule. See the following embodiments for a specific determination method.

[0123] In summary, the method provided in this application, using a first time period as the granularity, multiplexes the UCI carried in one or more uplink channels for transmission within the first time period, provided that a first timing condition is met. This reduces the complexity of UCI multiplexing transmission. Terminal devices do not need to rely on complex and dynamic timelines for judgment; they can achieve UCI multiplexing transmission on the first channel based on the first time period. The network side can also perform pre-scheduling more easily, reducing the implementation complexity of the scheduler.

[0124] In some embodiments, depending on the type of uplink channel, the present application proposes the following three schemes:

[0125] Option 1: One or more PUCCHs will be transmitted within the first time period;

[0126] Option 2: One or more PUCCHs and one or more PUSCHs will be transmitted within the first time period;

[0127] Option 3: One or more PUCCHs and / or one or more PUSCHs will be transmitted during the first time period.

[0128] Regarding Option 1:

[0129] In some embodiments, if one or more PUCCHs are to be transmitted within a first time period and a first timing condition is met, the UCIs carried in the one or more PUCCHs are multiplexed and transmitted on a first channel. In this case, the first channel is either the first PUCCH among the one or more PUCCHs, or a new first PUCCH determined based on the UCIs carried by the one or more PUCCHs.

[0130] 1.1 First timing condition

[0131] The first timing condition is satisfied, including one or more of the following:

[0132] • The start time unit of the first time period is no earlier than the first time unit. The first time unit is determined based on the first processing time after the first PDSCH ends. The first PDSCH is the PDSCH corresponding to the UCI carried in one or more uplink channels.

[0133] • The start time unit of the first time period is no earlier than the second time unit. The second time unit is determined based on the second processing time after the first PDCCH ends. The first PDCCH is used to carry the first DCI format. The first DCI format has corresponding first HARQ-ACK information. The first HARQ-ACK information is carried in one or more uplink channels.

[0134] In some embodiments, the first time unit is the time unit that begins after the first processing time following the end of the first PDSCH. Alternatively, the first time unit is the first time unit after the first processing time following the end of the first PDSCH. Or, the first time unit is the next time unit after the last processing time corresponding to the first processing time following the end of the first PDSCH.

[0135] In some embodiments, the start time unit of the first time period is not earlier than the time unit after the first processing time following the end of the first PDSCH. Alternatively, the start time unit of the first time period is not earlier than the first time unit after the first processing time following the end of the first PDSCH. Alternatively, the start time unit of the first time period is not earlier than the next time unit after the last processing time corresponding to the first processing time following the end of the first PDSCH.

[0136] For example, as shown in Figure 8, the start time unit K3 of the first time period is not earlier than the first time unit K2 after the last time unit K1 corresponding to the first processing time after the first PDSCH ends.

[0137] Optionally, if multiple first PDSCHs exist, one implementation is as follows: the start time unit of the first time period is no earlier than the first time unit, the first time unit is the time unit after the first processing time following any PDSCH among the multiple first PDSCHs, and the first processing time is the maximum value among the multiple first processing times corresponding to the multiple first PDSCHs. Another implementation is as follows: the start time unit of the first time period is no earlier than the first time unit, the first time unit is the maximum value among the multiple first reference time units corresponding to the multiple first PDSCHs, and each first reference time unit is the time unit after the corresponding first processing time following the corresponding first PDSCH.

[0138] For example, suppose there are three first PDSCHs {first PDSCH1, first PDSCH2, first PDSCH3}, where first PDSCH1 corresponds to first processing time 1, first PDSCH2 corresponds to first processing time 2, and first PDSCH3 corresponds to first processing time 3. One implementation: the duration of first processing time 1 is greater than the duration of first processing time 2, and the duration of first processing time 2 is greater than the duration of first processing time 3. Then, the start time unit of the first time period is no earlier than the first time unit after first processing time 1 following any PDSCH in {first PDSCH1, first PDSCH2, first PDSCH3}. Another implementation: the first reference time unit 1 after first processing time 1 following first PDSCH1 is earlier than the first reference time unit 2 after first processing time 2 following second PDSCH2, and the first reference time unit 2 is earlier than the first reference time unit 3 after first processing time 3 following third PDSCH3. Then, the start time unit of the first time period is no earlier than the first time unit after first processing time 3 following third PDSCH3.

[0139] Optionally, the first PDSCH is the PDSCH corresponding to the HARQ-ACK information carried in one or more PUCCHs. Optionally, the first PDSCH includes one or more PDSCHs. There is a one-to-one correspondence between the one or more PDSCHs and the one or more PUCCHs. For example, the first PDSCH includes two PDSCHs, each corresponding to one of the two PUCCHs. Optionally, multiple PDSCHs correspond to one PUCCH. This application does not limit this aspect.

[0140] In some embodiments, the second time unit is the time unit that begins after the second processing time following the end of the first PDCCH. Alternatively, the second time unit is the first time unit after the second processing time following the end of the first PDCCH. Or, the second time unit is the next time unit after the last processing time corresponding to the second processing time following the end of the first PDCCH.

[0141] In some embodiments, the start time unit of the first time period is not earlier than the time unit after the second processing time following the end of the first PDCCH. Alternatively, the start time unit of the first time period is not earlier than the first time unit after the second processing time following the end of the first PDCCH. Alternatively, the start time unit of the first time period is not earlier than the next time unit after the last processing time corresponding to the second processing time following the end of the first PDCCH.

[0142] For example, as shown in Figure 8, the start time unit K3 of the first time period is not earlier than the first time unit K5 after the last time unit K4 corresponding to the second processing time after the end of the first PDCCH.

[0143] Optionally, if multiple first PDCCHs exist, one implementation is as follows: the start time unit of the first time period is no earlier than the second time unit, the second time unit is the time unit after the second processing time following any PDCCH among the multiple first PDCCHs, and the second processing time is the maximum value among the multiple second processing times corresponding to the multiple first PDCCHs. Another implementation is as follows: the start time unit of the first time period is no earlier than the second time unit, the second time unit is the maximum value among the multiple second reference time units corresponding to the multiple first PDCCHs, and each second reference time unit is the time unit after the corresponding second processing time following the corresponding first PDCCH.

[0144] Optionally, the first PDCCH is the PDCCH corresponding to the first HARQ-ACK information carried in one or more PUCCHs. Optionally, the first PDCCH includes one or more PDCCHs. There is a one-to-one correspondence between the one or more PDCCHs and the one or more PUCCHs. For example, the first PDCCH includes two PDCCHs, each corresponding to one of the two PUCCHs. Optionally, multiple PDCCHs correspond to one PUCCH. This application does not limit this aspect.

[0145] 1.2 First Channel

[0146] The first channel is the first PUCCH. The first PUCCH is determined according to one or more of the following:

[0147] • The payload size of the UCI carried in one or more PUCCHs;

[0148] • The types of UCIs carried in one or more PUCCHs;

[0149] • One or more DCIs corresponding to PUCCH.

[0150] Optionally, the first PUCCH is determined based on the payload size of all UCIs carried in one or more PUCCHs. For example, the first PUCCH is determined based on the sum of the payload sizes of all UCIs carried in one or more PUCCHs. Alternatively, the first PUCCH is determined based on the maximum payload size among all UCIs carried in one or more PUCCHs.

[0151] Optionally, the first PUCCH is determined based on the payload size of a portion of the UCIs carried in one or more PUCCHs. For example, assuming that the UCIs carried in one or more PUCCHs include {SR, HARQ-ACK, CSI}, the first PUCCH can be determined solely based on the payload size of {HARQ-ACK, CSI}.

[0152] Optionally, the first PUCCH is determined based on the DCI corresponding to the HARQ-ACK in the UCI carried in one or more PUCCHs.

[0153] Optionally, the first PUCCH is determined based on the DCI corresponding to the earliest of one or more PUCCHs. Or, the first PUCCH is determined based on the DCI corresponding to the latest of one or more PUCCHs.

[0154] The earliest PUCCH is determined based on the start time unit of each of the one or more PUCCHs. The PUCCH with the earliest start time unit is the earliest of the one or more PUCCHs. Alternatively, the earliest PUCCH is determined based on the end time unit of each of the one or more PUCCHs. The PUCCH with the earliest end time unit is the earliest of the one or more PUCCHs.

[0155] The latest PUCCH is determined based on the start time unit of each of the one or more PUCCHs. The PUCCH with the latest start time unit is the latest of the one or more PUCCHs. Alternatively, the latest PUCCH is determined based on the end time unit of each of the one or more PUCCHs. The PUCCH with the latest end time unit is the latest of the one or more PUCCHs.

[0156] Optionally, if at least one of the one or more PUCCHs corresponds to a DCI schedule, the first PUCCH is determined based on the DCI indication and the total payload size of the UCI carried in the one or more PUCCHs.

[0157] Optionally, if multiple PUCCHs correspond to multiple DCIs, the first PUCCH is determined based on the last DCI. Alternatively, the first PUCCH is determined based on the earliest DCI.

[0158] In some embodiments, the method further includes: the terminal device determining a first PUCCH. Alternatively, this can be understood as the terminal device determining the first PUCCH from one or more PUCCHs, or the terminal device determining a new first PUCCH based on the content carried in one or more PUCCHs. Specifically, the terminal device determines the first PUCCH based on one or more of the factors described above, which will not be elaborated further here.

[0159] In this embodiment, the design complexity of determining the first PUCCH for multiplexing transmission UCI from a set of PUCCHs in a time slot is reduced, and the standard no longer needs to write complex pseudocode.

[0160] To address issue 2 above, the terminal device can directly determine the first PUCCH for multiplexing transmission of UCI from one or more PUCCHs based on one or more of the aforementioned factors, without needing to perform cyclic overlap judgments and multiplexing operations. For example, as shown in Figure 9, if there are three PUCCHs {PUCCH1, PUCCH2, PUCCH3} in a time slot that do not overlap and satisfy the first timing condition, then according to Scheme 1 above, the terminal device can directly determine the first PUCCH and multiplex the UCI from the three PUCCHs into the first PUCCH for transmission. The terminal device no longer needs to perform at least three steps and iteratively update as shown in Figures 3-5 above to finally determine the first PUCCH for multiplexing transmission of UCI.

[0161] It should be noted that sections 1.1 and 1.2 above can be implemented individually or in combination. Optionally, in one possible case, satisfying the first timing condition is achieved using the scheme described in section 1.1 above, while the first channel is determined based on the scheme of steps 1-3 in the aforementioned related technologies. Optionally, in another possible case, satisfying the first timing condition can be understood as satisfying the multiplexing timeline condition in the aforementioned related technologies, while the first channel is determined using the scheme described in section 1.2 above. Optionally, in yet another possible case, satisfying the first timing condition is achieved using the scheme described in section 1.1 above, and the first channel is determined using the scheme described in section 1.2 above.

[0162] Regarding Option Two:

[0163] In some embodiments, if one or more PUCCHs and one or more PUSCHs are to be transmitted within a first time period, and a first timing condition is met, the UCIs carried in the one or more PUCCHs and one or more PUSCHs are multiplexed and transmitted on a first channel. In this case, the first channel is a second PUSCH among the one or more PUSCHs, or the first channel is a new first PUSCH determined based on the UCIs carried by the one or more PUCCHs and one or more PUSCHs. It should be noted that in this case, the one or more uplink channels to be transmitted in the first time period are at least two uplink channels, and these at least two uplink channels include one or more PUCCHs and one or more PUSCHs. Alternatively, it can be understood that at least one PUCCH and at least one PUSCH are to be transmitted within the first time period.

[0164] 2.1 First timing condition

[0165] The first timing condition is satisfied, including one or more of the following:

[0166] • The start time unit of the first time period is no earlier than the first time unit. The first time unit is determined based on the first processing time after the first PDSCH ends. The first PDSCH is the PDSCH corresponding to the UCI carried in one or more uplink channels.

[0167] • The start time unit of the first time period is no earlier than the second time unit. The second time unit is determined based on the second processing time after the first PDCCH ends. The first PDCCH is used to carry the first DCI format. The first DCI format has corresponding first HARQ-ACK information. The first HARQ-ACK information is carried in one or more uplink channels.

[0168] • The start time unit of the first time period is no earlier than the third time unit. The third time unit is determined based on the third processing time after the end of the second PDCCH. The second PDCCH is used to schedule the first PUSCH and / or to carry the second DCI format or schedule the second PDSCH. The second DCI format or the second PDSCH has corresponding second HARQ-ACK information. The second HARQ-ACK information is carried in one or more uplink channels, and the one or more uplink channels include the first PUSCH.

[0169] In some embodiments, the first time unit is the time unit that begins after the first processing time following the end of the first PDSCH. Alternatively, the first time unit is the first time unit after the first processing time following the end of the first PDSCH. Or, the first time unit is the next time unit after the last processing time corresponding to the first processing time following the end of the first PDSCH.

[0170] In some embodiments, the start time unit of the first time period is not earlier than the time unit after the first processing time following the end of the first PDSCH. Alternatively, the start time unit of the first time period is not earlier than the first time unit after the first processing time following the end of the first PDSCH. Alternatively, the start time unit of the first time period is not earlier than the next time unit after the last processing time corresponding to the first processing time following the end of the first PDSCH.

[0171] For example, as shown in Figure 8, the start time unit K3 of the first time period is not earlier than the first time unit K2 after the last time unit K1 corresponding to the first processing time after the first PDSCH ends.

[0172] Optionally, if multiple first PDSCHs exist, one implementation is as follows: the start time unit of the first time period is no earlier than the first time unit, the first time unit is the time unit after the first processing time following any PDSCH among the multiple first PDSCHs, and the first processing time is the maximum value among the multiple first processing times corresponding to the multiple first PDSCHs. Another implementation is as follows: the start time unit of the first time period is no earlier than the first time unit, the first time unit is the maximum value among the multiple first reference time units corresponding to the multiple first PDSCHs, and each first reference time unit is the time unit after the corresponding first processing time following the corresponding first PDSCH.

[0173] For example, suppose there are three first PDSCHs {first PDSCH1, first PDSCH2, first PDSCH3}, where first PDSCH1 corresponds to first processing time 1, first PDSCH2 corresponds to first processing time 2, and first PDSCH3 corresponds to first processing time 3. One implementation: the duration of first processing time 1 is greater than the duration of first processing time 2, and the duration of first processing time 2 is greater than the duration of first processing time 3. Then, the start time unit of the first time period is no earlier than the first time unit after first processing time 1 following any PDSCH in {first PDSCH1, first PDSCH2, first PDSCH3}. Another implementation: the first reference time unit 1 after first processing time 1 following first PDSCH1 is earlier than the first reference time unit 2 after first processing time 2 following second PDSCH2, and the first reference time unit 2 is earlier than the first reference time unit 3 after first processing time 3 following third PDSCH3. Then, the start time unit of the first time period is no earlier than the first time unit after first processing time 3 following third PDSCH3.

[0174] Optionally, the first PDSCH is the PDSCH corresponding to the HARQ-ACK information carried in one or more PUCCHs. Optionally, the first PDSCH includes one or more PDSCHs. There is a one-to-one correspondence between the one or more PDSCHs and the one or more PUCCHs. For example, the first PDSCH includes two PDSCHs, each corresponding to one of the two PUCCHs. Optionally, multiple PDSCHs correspond to one PUCCH. This application does not limit this aspect.

[0175] In some embodiments, the second time unit is the time unit that begins after the second processing time following the end of the first PDCCH. Alternatively, the second time unit is the first time unit after the second processing time following the end of the first PDCCH. Or, the second time unit is the next time unit after the last processing time corresponding to the second processing time following the end of the first PDCCH.

[0176] In some embodiments, the start time unit of the first time period is not earlier than the time unit after the second processing time following the end of the first PDCCH. Alternatively, the start time unit of the first time period is not earlier than the first time unit after the second processing time following the end of the first PDCCH. Alternatively, the start time unit of the first time period is not earlier than the next time unit after the last processing time corresponding to the second processing time following the end of the first PDCCH.

[0177] For example, as shown in Figure 8, the start time unit K3 of the first time period is not earlier than the first time unit K5 after the last time unit K4 corresponding to the second processing time after the end of the first PDCCH.

[0178] Optionally, if multiple first PDCCHs exist, one implementation is as follows: the start time unit of the first time period is no earlier than the second time unit, the second time unit is the time unit after the second processing time following any PDCCH among the multiple first PDCCHs, and the second processing time is the maximum value among the multiple second processing times corresponding to the multiple first PDCCHs. Another implementation is as follows: the start time unit of the first time period is no earlier than the second time unit, the second time unit is the maximum value among the multiple second reference time units corresponding to the multiple first PDCCHs, and each second reference time unit is the time unit after the corresponding second processing time following the corresponding first PDCCH.

[0179] Optionally, the first PDCCH is the PDCCH corresponding to the first HARQ-ACK information carried in one or more PUCCHs. Optionally, the first PDCCH includes one or more PDCCHs. There is a one-to-one correspondence between the one or more PDCCHs and the one or more PUCCHs. For example, the first PDCCH includes two PDCCHs, each corresponding to one of the two PUCCHs. Optionally, multiple PDCCHs correspond to one PUCCH. This application does not limit this aspect.

[0180] In some embodiments, the third time unit is the time unit that begins after the third processing time following the end of the second PDCCH. Alternatively, the third time unit is the first time unit after the third processing time following the end of the second PDCCH. Or, the third time unit is the next time unit after the last processing time corresponding to the third processing time following the end of the second PDCCH.

[0181] In some embodiments, the start time unit of the first time period is not earlier than the time unit after the third processing time following the end of the second PDCCH. Alternatively, the start time unit of the first time period is not earlier than the first time unit after the third processing time following the end of the second PDCCH. Alternatively, the start time unit of the first time period is not earlier than the next time unit after the last processing time corresponding to the third processing time following the end of the second PDCCH.

[0182] Optionally, if multiple second PDCCHs exist, one implementation is as follows: the start time unit of the first time period is no earlier than the third time unit, the third time unit is the time unit after the third processing time following any PDCCH among the multiple second PDCCHs, and the third processing time is the maximum value among the multiple third processing times corresponding to the multiple second PDCCHs. Another implementation is as follows: the start time unit of the first time period is no earlier than the third time unit, the third time unit is the maximum value among the multiple third reference time units corresponding to the multiple second PDCCHs, and each third reference time unit is the time unit after the corresponding third processing time following the corresponding second PDCCH.

[0183] 2.2 First Channel

[0184] The first channel is the second PUSCH. The second PUSCH is determined based on one or more of the following:

[0185] • The temporal location of one or more PUCCHs;

[0186] • The temporal location of the first PUCCH;

[0187] • The temporal location of one or more PUSCHs;

[0188] • Frequency domain location of one or more PUSCHs;

[0189] • Serving cell indexes corresponding to one or more PUSCHs;

[0190] • Modulation and Coding Scheme (MCS) corresponding to one or more PUSCHs.

[0191] In some embodiments, the first PUCCH is determined based on one or more PUCCHs. See section 1.2 above for details on how it is determined. Optionally, since the second PUSCH needs to be determined based on the first PUCCH, the terminal device needs to determine the first PUCCH before determining the second PUSCH.

[0192] In some embodiments, the above method further includes:

[0193] Step 11: The terminal device determines the first PUCCH. Alternatively, this can be understood as the terminal device determining the first PUCCH from one or more PUCCHs.

[0194] Step 12: The terminal device determines the second PUSCH. Alternatively, this can be understood as the terminal device determining the second PUSCH from one or more PUSCHs.

[0195] It should be noted that step 12 above can be implemented as a separate embodiment. When the second PUSCH needs to be determined based on the first PUCCH, steps 11 and 12 above are combined into a combined embodiment, and step 11 is performed before step 12.

[0196] In some embodiments, the "time domain position" described in this application includes one or more of the following: a start time unit, an end time unit, and an occupied time unit. Alternatively, it can be understood that the time domain position is determined based on one or more of the start time unit, end time unit, and occupied time unit.

[0197] The time-domain location in the embodiments of this application can also be understood as a time-domain resource. For example, the time-domain location of one or more PUCCHs can be understood as a time-domain resource of one or more PUCCHs. Similarly, the time-domain location of the first PUCCH can be understood as a time-domain resource of the first PUCCH. Likewise, the time-domain location of one or more PUSCHs can be understood as a time-domain resource of one or more PUSCHs.

[0198] The frequency domain location in the embodiments of this application can also be understood as a frequency domain resource. For example, the frequency domain location of one or more PUSCHs mentioned above can be understood as the frequency domain resource of one or more PUSCHs.

[0199] In some embodiments, the second PUSCH includes one or more of the following:

[0200] • One or more PUSCHs that overlap with the first PUCCH;

[0201] • A PUSCH that overlaps with one or more PUCCHs in one or more PUSCHs;

[0202] • The earliest start time of one or more PUSCHs;

[0203] • The PUSCH with the latest start time among one or more PUSCHs;

[0204] • The PUSCH with the earliest end time among one or more PUSCHs;

[0205] • The PUSCH with the latest end time among one or more PUSCHs;

[0206] • The PUSCH that occupies the most time units among one or more PUSCHs;

[0207] • The PUSCH that occupies the fewest time units among one or more PUSCHs;

[0208] • The PUSCH that occupies the most frequency domain resource units among one or more PUSCHs;

[0209] • The PUSCH that occupies the fewest frequency domain resource units among one or more PUSCHs;

[0210] • The PUSCH with the lowest modulation order among one or more PUSCHs;

[0211] • The PUSCH with the highest modulation order among one or more PUSCHs;

[0212] • The PUSCH with the lowest bit rate among one or more PUSCHs;

[0213] • The PUSCH with the highest bit rate among one or more PUSCHs;

[0214] • The PUSCH with the highest MCS among one or more PUSCHs;

[0215] • The PUSCH with the lowest MCS among one or more PUSCHs;

[0216] • The PUSCH with the smallest serving cell index value among one or more PUSCHs;

[0217] • The PUSCH with the largest serving cell index value among one or more PUSCHs;

[0218] • All PUSCHs in one or more PUSCHs;

[0219] • One or more PUSCHs that satisfy the first timing condition;

[0220] • One or more PUSCHs except for the third PUSCH.

[0221] It should be noted that the frequency domain resource units described in the embodiments of this application include one or more of the following: resource block (RB), resource element (RE), RB group, RE group, and subband.

[0222] In some embodiments, if only one PUSCH exists in the first time period (e.g., PUSCH1), then the second PUSCH is PUSCH1.

[0223] In some embodiments, if multiple PUSCHs exist within the first time period, then:

[0224] a) The second PUSCH is a PUSCH whose time domain location overlaps with the first PUCCH, which is beneficial to ensuring a balance between latency and reliability.

[0225] b) The second PUSCH is a PUSCH whose temporal location overlaps with one or more PUCCHs.

[0226] c) The second PUSCH is the earliest of one or more PUSCHs. Optionally, the earliest can be the earliest start time unit or the earliest end time unit; this helps reduce latency.

[0227] d) The second PUSCH is the latest of one or more PUSCHs. Optionally, the latest can be the latest start time unit or the latest end time unit; the latest is beneficial to ensure that the processing time of multiple channels is satisfied.

[0228] e) The second PUSCH is the PUSCH that occupies the most time units and / or frequency domain resource units among one or more PUSCHs, which is beneficial to improving reliability.

[0229] f) The second PUSCH is the PUSCH that occupies the fewest time units and / or frequency domain resource units among one or more PUSCHs, which is beneficial to improving transmission efficiency.

[0230] g) The second PUSCH is the PUSCH with the lowest or highest MCS among one or more PUSCHs; a low MCS means a larger total number of resources, which can be allocated to the UCI. Optionally, the MCS is related to the modulation order and / or code rate. The lowest MCS can be understood as the lowest modulation order and / or the lowest code rate, and the highest MCS can be understood as the highest modulation order and / or the highest code rate.

[0231] h) The second PUSCH is the PUSCH with the smallest or largest corresponding serving cell index.

[0232] i) The first PUSCH is a PUSCH that can satisfy the first timing condition described above. Optionally, the first PUSCH is all PUSCHs that satisfy the first timing condition described above. Optionally, the first PUSCH is a subset of PUSCHs that satisfy the first timing condition described above, and this subset of PUSCHs is determined with reference to a) to h) described above.

[0233] j) The second PUSCH is all of the PUSCHs in one or more PUSCHs, which is beneficial to ensure reliability and has the highest reliability.

[0234] k) The second PUSCH is all PUSCHs out of one or more PUSCHs. Optionally, the third PUSCH includes one or more of the following:

[0235] • One or more PUSCHs that occupy less than or equal to the first threshold number of time units;

[0236] • PUSCHs that occupy less than or equal to the second threshold number of frequency domain resource units in one or more PUSCHs;

[0237] • One or more PUSCHs whose modulation order is greater than or equal to the third threshold;

[0238] • One or more PUSCHs with a code rate greater than or equal to the fourth threshold;

[0239] • One or more PUSCHs whose MCS is greater than or equal to the sixth threshold.

[0240] It is important to understand that if the PUSCH uses too few resources or has too high a bit rate, there may not be enough resources to transmit data after multiplexing. Therefore, PUSCHs that use too few resources or have too high a bit rate are not suitable for UCI multiplexing, meaning that the third PUSCH mentioned above is not suitable as the second PUSCH.

[0241] l) Combinations of a) to k) above:

[0242] For example, a)+c): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the earliest among the multiple PUSCHs that overlap with the first PUCCH. Alternatively, when multiple PUSCHs within the first time period have the earliest start time unit, the second PUSCH is the PUSCH that overlaps with the first PUCCH. Or, when multiple PUSCHs within the first time period have the earliest end time unit, the second PUSCH is the PUSCH that overlaps with the first PUCCH.

[0243] For example, a)+d): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the latest PUSCH among those overlapping with the first PUCCH. Alternatively, when multiple PUSCHs within the first time period have the latest start time unit, the second PUSCH is the PUSCH among those overlapping with the first PUCCH. Or, when multiple PUSCHs within the first time period have the latest end time unit, the second PUSCH is the PUSCH among those overlapping with the first PUCCH.

[0244] For example, a)+e): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the PUSCH that occupies the most time units and / or frequency domain resource units among the multiple PUSCHs that overlap with the first PUCCH. Or, when multiple PUSCHs in the first time period have the highest number of time units and / or frequency domain resource units respectively, the second PUSCH is the PUSCH that overlaps with the first PUCCH among the multiple PUSCHs.

[0245] For example, a)+f): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the PUSCH that occupies the fewest time units and / or frequency domain resource units among the multiple PUSCHs that overlap with the first PUCCH. Or, when multiple PUSCHs within the first time period have the fewest occupied time units and / or frequency domain resource units, the second PUSCH is the PUSCH that overlaps with the first PUCCH among the multiple PUSCHs.

[0246] For example, a)+g): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the PUSCH with the lowest or highest MCS among the multiple PUSCHs overlapping with the first PUCCH. Alternatively, when multiple PUSCHs within the first time period have the lowest corresponding MCS, the second PUSCH is the PUSCH overlapping with the first PUCCH among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the highest corresponding MCS, the second PUSCH is the PUSCH overlapping with the first PUCCH among these multiple PUSCHs.

[0247] For example, a)+h): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the PUSCH with the smallest or largest serving cell index among the multiple PUSCHs overlapping with the first PUCCH. Alternatively, when multiple PUSCHs within the first time period have the smallest serving cell indexes, the second PUSCH is the PUSCH that overlaps with the first PUCCH. Or, when multiple PUSCHs within the first time period have the largest serving cell indexes, the second PUSCH is the PUSCH that overlaps with the first PUCCH.

[0248] For example, a)+i): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with the first PUCCH that satisfies the first timing condition. Or, when multiple PUSCHs satisfy the first timing condition within the first time period, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with the first PUCCH.

[0249] For example, a)+k): When multiple PUSCHs overlap with the first PUCCH within the first time period, the second PUSCH is any PUSCH that overlaps with the first PUCCH except for the third PUSCH. Or, when multiple PUSCHs exist within one or more PUSCHs in the first time period besides the third PUSCH, the second PUSCH is any PUSCH that overlaps with the first PUCCH.

[0250] For example, b)+c): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the earliest among the multiple PUSCHs that overlap with one or more PUCCHs. Alternatively, when multiple PUSCHs within the first time period have the earliest start time unit, the second PUSCH is the PUSCH that overlaps with one or more PUCCHs. Or, when multiple PUSCHs within the first time period have the earliest end time unit, the second PUSCH is the PUSCH that overlaps with one or more PUCCHs.

[0251] For example, b)+d): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the latest PUSCH among those overlapping with one or more PUCCHs. Alternatively, when multiple PUSCHs within the first time period have the latest start time unit, the second PUSCH is the PUSCH among those overlapping with one or more PUCCHs. Or, when multiple PUSCHs within the first time period have the latest end time unit, the second PUSCH is the PUSCH among those overlapping with one or more PUCCHs.

[0252] For example, b)+e): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the PUSCH that occupies the most time units and / or frequency domain resource units among the multiple PUSCHs that overlap with one or more PUCCHs. Or, when multiple PUSCHs in the first time period have the highest number of time units and / or frequency domain resource units respectively, the second PUSCH is the PUSCH that overlaps with one or more PUCCHs.

[0253] For example, b)+f): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the PUSCH that occupies the fewest time units and / or frequency domain resource units among the multiple PUSCHs that overlap with one or more PUCCHs. Or, when multiple PUSCHs within the first time period have the fewest occupied time units and / or frequency domain resource units, the second PUSCH is the PUSCH that overlaps with one or more PUCCHs among the multiple PUSCHs.

[0254] For example, b)+g): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the PUSCH with the lowest or highest MCS among the multiple PUSCHs overlapping with one or more PUCCHs. Alternatively, when multiple PUSCHs within the first time period have the lowest corresponding MCS, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with one or more PUCCHs. Or, when multiple PUSCHs within the first time period have the highest corresponding MCS, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with one or more PUCCHs.

[0255] For example, b)+h): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the PUSCH with the smallest or largest serving cell index among the multiple PUSCHs overlapping with one or more PUCCHs. Alternatively, when the serving cell indices of multiple PUSCHs within the first time period are all the smallest, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with one or more PUCCHs. Or, when the serving cell indices of multiple PUSCHs within the first time period are all the largest, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with one or more PUCCHs.

[0256] For example, b)+i): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with one or more PUCCHs and satisfies the first timing condition. Or, when multiple PUSCHs satisfy the first timing condition within the first time period, the second PUSCH is the PUSCH among the multiple PUSCHs that overlap with one or more PUCCHs.

[0257] For example, b)+k): When multiple PUSCHs overlap with one or more PUCCHs within the first time period, the second PUSCH is the PUSCH that overlaps with one or more PUCCHs, excluding the third PUSCH. Or, when multiple PUSCHs exist within the first time period, excluding the third PUSCH, the second PUSCH is the PUSCH that overlaps with one or more PUCCHs.

[0258] For example, c)+e): When multiple PUSCHs within the first time period have the earliest start or end time units, the second PUSCH is the PUSCH with the most time units occupied and / or the most frequency domain resource units among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the most time units occupied and / or the most frequency domain resource units, the second PUSCH is the PUSCH with the earliest start or end time unit among these multiple PUSCHs.

[0259] For example, c)+f): When multiple PUSCHs within the first time period have the earliest start or end time units, the second PUSCH is the PUSCH with the fewest occupied time units and / or frequency domain resource units among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the fewest occupied time units and / or frequency domain resource units, the second PUSCH is the PUSCH with the earliest start or end time units among these multiple PUSCHs.

[0260] For example, c)+g): When multiple PUSCHs within the first time period have the earliest start or end time units, the second PUSCH is the PUSCH with the lowest or highest corresponding MCS among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the lowest corresponding MCS, the second PUSCH is the PUSCH with the earliest start or end time unit among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the highest corresponding MCS, the second PUSCH is the PUSCH with the earliest start or end time unit among these multiple PUSCHs.

[0261] For example, c)+h): When multiple PUSCHs within the first time period have the earliest start or end time units, the second PUSCH is the PUSCH with the smallest or largest serving cell index among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the smallest serving cell indexes, the second PUSCH is the PUSCH with the earliest start or end time unit among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the largest serving cell indexes, the second PUSCH is the PUSCH with the earliest start or end time unit among these multiple PUSCHs.

[0262] For example, c)+i): When multiple PUSCHs exist within the first time period that have the earliest start or end time units, then the second PUSCH is the PUSCH among these multiple PUSCHs that satisfies the first timing condition. Or, when multiple PUSCHs exist within the first time period that satisfy the first timing condition, then the second PUSCH is the PUSCH among these multiple PUSCHs that has the earliest start or end time unit.

[0263] For example, c)+k): When multiple PUSCHs exist within the first time period that have the earliest start or end time units, then the second PUSCH is the PUSCH excluding the third PUSCH. Or, when multiple PUSCHs exist within the first time period that have the earliest start or end time units (excluding the third PUSCH), then the second PUSCH is the PUSCH with the earliest start or end time units among the multiple PUSCHs.

[0264] For example, d)+e): When multiple PUSCHs within the first time period have the latest start or end time units, the second PUSCH is the PUSCH with the most time units occupied and / or the most frequency domain resource units among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the highest number of time units occupied and / or the most frequency domain resource units, the second PUSCH is the PUSCH with the latest start or end time unit among these multiple PUSCHs.

[0265] For example, d)+f): When multiple PUSCHs within the first time period have the latest start or end time units, the second PUSCH is the PUSCH with the fewest time units and / or frequency domain resource units among the multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the fewest time units and / or frequency domain resource units respectively, the second PUSCH is the PUSCH with the latest start or end time unit among the multiple PUSCHs.

[0266] For example, d)+g): When multiple PUSCHs within the first time period have the latest start or end time units, the second PUSCH is the PUSCH with the lowest or highest corresponding MCS among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the lowest corresponding MCS, the second PUSCH is the PUSCH with the latest start or end time unit among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the highest corresponding MCS, the second PUSCH is the PUSCH with the latest start or end time unit among these multiple PUSCHs.

[0267] For example, d)+h): When multiple PUSCHs within the first time period have the latest start or end time units, the second PUSCH is the PUSCH with the smallest or largest serving cell index among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the smallest serving cell indexes, the second PUSCH is the PUSCH with the latest start or end time unit among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the largest serving cell indexes, the second PUSCH is the PUSCH with the latest start or end time unit among these multiple PUSCHs.

[0268] For example, d)+i): When there are multiple PUSCHs within the first time period that have the latest start or end time units, then the second PUSCH is the PUSCH among the multiple PUSCHs that satisfies the first timing condition. Or, when there are multiple PUSCHs within the first time period that satisfy the first timing condition, then the second PUSCH is the PUSCH among the multiple PUSCHs that has the latest start or end time unit.

[0269] For example, d)+k): When there are multiple PUSCHs within the first time period that have the latest start or end time units, then the second PUSCH is any PUSCH other than the third PUSCH. Or, when there are multiple PUSCHs other than the third PUSCH within one or more PUSCHs in the first time period, then the second PUSCH is any PUSCH with the latest start or end time unit.

[0270] For example, e)+g): When multiple PUSCHs occupy the most time units and / or frequency domain resource units within the first time period, the second PUSCH is the PUSCH with the lowest or highest corresponding MCS among these multiple PUSCHs. Alternatively, when multiple PUSCHs have the lowest corresponding MCS within the first time period, the second PUSCH is the PUSCH with the highest number of time units and / or frequency domain resource units among these multiple PUSCHs. Or, when multiple PUSCHs have the highest corresponding MCS within the first time period, the second PUSCH is the PUSCH with the highest number of time units and / or frequency domain resource units among these multiple PUSCHs.

[0271] For example, e)+h): When multiple PUSCHs within the first time period have the highest number of time units and / or frequency domain resource units occupied, the second PUSCH is the PUSCH with the smallest or largest serving cell index among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the smallest serving cell indexes, the second PUSCH is the PUSCH with the highest number of time units and / or frequency domain resource units occupied among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the largest serving cell indexes, the second PUSCH is the PUSCH with the highest number of time units and / or frequency domain resource units occupied among these multiple PUSCHs.

[0272] For example, e)+i): When multiple PUSCHs occupy the most time units and / or frequency domain resource units within the first time period, the second PUSCH is the PUSCH that satisfies the first timing condition among the multiple PUSCHs. Or, when multiple PUSCHs satisfy the first timing condition within the first time period, the second PUSCH is the PUSCH that occupies the most time units and / or frequency domain resource units among the multiple PUSCHs.

[0273] For example, e)+k): When multiple PUSCHs occupy the most time units and / or frequency domain resource units within the first time period, the second PUSCH is the PUSCH excluding the third PUSCH. Or, when multiple PUSCHs exist within the first time period other than the third PUSCH, the second PUSCH is the PUSCH occupying the most time units and / or frequency domain resource units.

[0274] For example, f)+g): When multiple PUSCHs within the first time period have the fewest time units and / or frequency domain resource units, the second PUSCH is the PUSCH with the lowest or highest corresponding MCS among these PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the lowest corresponding MCS, the second PUSCH is the PUSCH with the fewest time units and / or frequency domain resource units among these PUSCHs. Or, when multiple PUSCHs within the first time period have the highest corresponding MCS, the second PUSCH is the PUSCH with the fewest time units and / or frequency domain resource units among these PUSCHs.

[0275] For example, f)+h): When multiple PUSCHs within the first time period have the fewest occupied time units and / or frequency domain resource units, the second PUSCH is the PUSCH with the smallest or largest serving cell index among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the smallest serving cell indexes, the second PUSCH is the PUSCH with the fewest occupied time units and / or frequency domain resource units among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the largest serving cell indexes, the second PUSCH is the PUSCH with the fewest occupied time units and / or frequency domain resource units among these multiple PUSCHs.

[0276] For example, f)+i): When multiple PUSCHs within the first time period have the fewest occupied time units and / or frequency domain resource units, then the second PUSCH is the PUSCH among the multiple PUSCHs that satisfies the first timing condition. Or, when multiple PUSCHs within the first time period satisfy the first timing condition, then the second PUSCH is the PUSCH among the multiple PUSCHs that occupies the fewest time units and / or frequency domain resource units.

[0277] For example, f)+k): When multiple PUSCHs exist within the first time period that occupy the fewest time units and / or frequency domain resource units, then the second PUSCH is the PUSCH excluding the third PUSCH among these multiple PUSCHs. Or, when multiple PUSCHs exist within the first time period that, excluding the third PUSCH, among one or more PUSCHs, then the second PUSCH is the PUSCH that occupies the fewest time units and / or frequency domain resource units among these multiple PUSCHs.

[0278] For example, g)+h): When multiple PUSCHs within the first time period have the lowest or highest corresponding MCS, then the second PUSCH is the PUSCH with the lowest or highest corresponding serving cell index among these multiple PUSCHs. Alternatively, when multiple PUSCHs within the first time period have the lowest corresponding serving cell index, then the second PUSCH is the PUSCH with the lowest or highest corresponding MCS among these multiple PUSCHs. Or, when multiple PUSCHs within the first time period have the highest corresponding serving cell index, then the second PUSCH is the PUSCH with the lowest or highest corresponding MCS among these multiple PUSCHs.

[0279] For example, g)+i): When multiple PUSCHs exist within the first time period that have the lowest or highest corresponding MCS, then the second PUSCH is the PUSCH among the multiple PUSCHs that satisfies the first timing condition. Or, when multiple PUSCHs exist within the first time period that satisfy the first timing condition, then the second PUSCH is the PUSCH among the multiple PUSCHs that has the lowest or highest corresponding MCS.

[0280] For example, g)+k): When multiple PUSCHs exist within the first time period that have the lowest or highest corresponding MCS, then the second PUSCH is any PUSCH other than the third PUSCH. Or, when multiple PUSCHs exist within the first time period other than the third PUSCH, then the second PUSCH is any PUSCH with the lowest or highest corresponding MCS.

[0281] For example, h)+i): When multiple PUSCHs within the first time period have the smallest or largest corresponding serving cell index, then the second PUSCH is the PUSCH among the multiple PUSCHs that satisfies the first time-series condition. Or, when multiple PUSCHs within the first time period satisfy the first time-series condition, then the second PUSCH is the PUSCH among the multiple PUSCHs with the smallest or largest corresponding serving cell index.

[0282] For example, h)+k): When multiple PUSCHs exist within the first time period that have the smallest or largest corresponding serving cell index, then the second PUSCH is any PUSCH other than the third PUSCH. Or, when multiple PUSCHs exist within the first time period that have the smallest or largest corresponding serving cell index, then the second PUSCH is any PUSCH among these multiple PUSCHs.

[0283] For example, i)+k): When multiple PUSCHs satisfy the first timing condition exist within the first time period, the second PUSCH is the PUSCH other than the third PUSCH among the multiple PUSCHs. Or, when multiple PUSCHs exist within the first time period other than the third PUSCH among one or more PUSCHs, the second PUSCH is the PUSCH that satisfies the first timing condition among the multiple PUSCHs.

[0284] It should be noted that the above combinations are merely illustrative examples and not limitations. In some possible embodiments, the above combinations can be varied further. For example, the combinations of a) to k) above include three of them, such as a)+c)+e), or a)+d)+e), etc., which will not be elaborated further in the embodiments of this application. Implementation schemes based on at least two combinations of a) to k) above are all within the scope of protection of the embodiments of this application.

[0285] In some embodiments, when there is only one PUSCH (e.g., PUSCH1) in the first time period and one or more of the above a) to k) are satisfied, the second PUSCH is PUSCH1.

[0286] To address issue 2 above, the terminal device can directly determine the second PUSCH for multiplexing transmission UCI from one or more PUSCHs based on one or more of the above factors, without having to repeatedly determine whether each PUSCH meets the multiplexing timeline conditions when there are multiple PUSCHs.

[0287] It should be noted that sections 2.1 and 2.2 above can be implemented individually or in combination. Optionally, in one possible case, satisfying the first timing condition is achieved using the scheme described in section 2.1 above, while the first channel is determined based on the scheme of steps 1-3 in the aforementioned related technologies. Optionally, in another possible case, satisfying the first timing condition can be understood as satisfying the multiplexing timeline condition in the aforementioned related technologies, while the first channel is determined using the scheme described in section 2.2 above. Optionally, in yet another possible case, satisfying the first timing condition is achieved using the scheme described in section 2.1 above, and the first channel is determined using the scheme described in section 2.2 above.

[0288] Regarding Option 3:

[0289] In some embodiments, if one or more PUCCHs and / or one or more PUSCHs are to be transmitted within a first time period and a first timing condition is met, the UCIs carried in one or more PUCCHs and / or one or more PUSCHs are multiplexed and transmitted on the first channel.

[0290] The difference between Scheme 3 and Schemes 1 and 2 is that Scheme 3 does not distinguish whether one or more PUCCHs will be transmitted in the first time period, or whether one or more PUCCHs and one or more PUSCHs will be transmitted. In other words, Scheme 3 does not differentiate whether only PUCCHs are transmitted in the first time period, or whether both PUCCHs and PUSCHs are transmitted. Scheme 3 does not require separating the determination of the first PUCCH and the determination of the second PUSCH into two steps; instead, it processes the PUCCHs and PUSCHs in the first time period together. However, it is inevitable that when the PUCCHs and PUSCHs in the first time period are placed together, the rules for selecting the first channel will be more complex.

[0291] 3.1 First timing condition

[0292] As is the case in section 2.1 above, it will not be repeated here.

[0293] 3.2 First Channel

[0294] In some embodiments, before determining the first channel, the method further includes: sorting the channels according to a first arrangement to obtain a first channel set. The first channel is determined based on the first channel set.

[0295] In some embodiments, the first channel set is obtained by sorting one or more uplink channels according to a first arrangement; or, the first channel set is obtained by sorting one or more uplink channels that satisfy a first timing condition according to a first arrangement.

[0296] Optionally, the first channel set is obtained by sorting one or more PUCCHs and / or one or more PUSCHs according to a first arrangement; or, the first channel set is obtained by sorting the PUCCHs / PUSCHs that satisfy the first timing condition among one or more PUCCHs and / or one or more PUSCHs according to the first arrangement.

[0297] 3.2.1 First arrangement method

[0298] In some embodiments, the first arrangement includes one or more of the following:

[0299] • Start times range from morning to night;

[0300] • Start times range from late to early;

[0301] • End time varies from morning to night;

[0302] • End times range from evening to morning;

[0303] • The number of time units occupied by the uplink channel decreases from high to low;

[0304] • The number of time units occupied by the uplink channel increases from few to many;

[0305] • The number of frequency domain resource units occupied by the uplink channel decreases from high to low;

[0306] • The number of frequency domain resource elements occupied by the uplink channel increases from few to many;

[0307] • Modulation order from high to low;

[0308] • Modulation order from low to high;

[0309] • Bitrate from high to low;

[0310] • Bitrate from low to high;

[0311] • MCS from low to high;

[0312] • MCS from high to low;

[0313] • The serving cell index values ​​corresponding to the uplink channels are listed from largest to smallest;

[0314] • The serving cell index values ​​corresponding to the uplink channels are listed from smallest to largest;

[0315] • From an uplink channel with a corresponding DCI indication to an uplink channel without a corresponding DCI indication;

[0316] • From uplink channels that never correspond to DCI indication to uplink channels that correspond to DCI indication.

[0317] In some embodiments, the first arrangement described above may be a combination of at least two arrangements.

[0318] For example, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by end time from earliest to latest. Alternatively, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by end time from latest to earliest. Another example: first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by the number of time units occupied from most to least. Yet another example: first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by the number of time units occupied from least to most. Finally, another example: first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by the number of frequency domain resource units occupied from most to least. For example, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by the number of frequency domain resource units they occupy from lowest to highest. Alternatively, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by MCS from lowest to highest. Another example, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by MCS from highest to lowest. Yet another example, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by their corresponding serving cell index value from highest to lowest. Finally, first sort by start time from earliest to latest. If multiple uplink channels have the same start time, then sort them by their corresponding serving cell index value from lowest to highest.

[0319] For example, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort the uplink channels with the same start time by end time from earliest to latest. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort the uplink channels with the same start time by end time from latest to earliest. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort the uplink channels with the same start time by the number of time units occupied from most to least. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort the uplink channels with the same start time by the number of time units occupied from least to most. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort the uplink channels with the same start time by the number of frequency domain resource units occupied from most to least. For example, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort them by the number of frequency domain resource units they occupy from least to most. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort them by MCS from lowest to highest. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort them by MCS from highest to lowest. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort them by their corresponding serving cell index value from highest to lowest. Alternatively, first sort by start time from latest to earliest. If multiple uplink channels have the same start time, then sort them by their corresponding serving cell index value from lowest to highest.

[0320] For example, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from earliest to latest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to earliest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, sort by the number of frequency domain resource units occupied from latest to latest. For example, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by the number of frequency domain resource units occupied from lowest to highest. Alternatively, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by MCS from lowest to highest. Another example, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by MCS from highest to lowest. Yet another example, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by their corresponding serving cell index value from highest to lowest. Finally, first sort by end time from earliest to latest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by their corresponding serving cell index value from lowest to highest.

[0321] For example, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from earliest to latest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to earliest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to earliest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time from latest to latest. For example, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by the number of frequency domain resource units occupied from lowest to highest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by MCS from lowest to highest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by MCS from highest to lowest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by their corresponding serving cell index value from highest to lowest. Alternatively, first sort by end time from latest to earliest. If multiple uplink channels have the same end time, then sort the uplink channels with the same start time by their corresponding serving cell index value from lowest to highest.

[0322] For example, first sort by the number of time units occupied from most to least; if multiple uplink channels occupy the same number of time units, then sort by start time from earliest to latest. (This process is repeated three times in the original text.) For example, first sort by the number of time units occupied, from most to least. If multiple uplink channels occupy the same number of time units, then sort by the number of frequency domain resource units occupied by the uplink channels, from least to most. For example, first sort by the number of time units occupied, from most to least. If multiple uplink channels occupy the same number of time units, then sort by modulation order, from highest to lowest. For example, first sort by the number of time units occupied, from most to least. If multiple uplink channels occupy the same number of time units, then sort by modulation order, from lowest to highest. For example, first sort by the number of time units occupied, from most to least. If multiple uplink channels occupy the same number of time units, then sort by code rate, from highest to lowest. For example, first sort by the number of time units occupied, from most to least. If multiple uplink channels occupy the same number of time units, then sort by code rate, from lowest to highest. For example, first sort by the number of time units occupied from most to least. If multiple uplink channels have the same number of time units occupied, then sort by MCS from lowest to highest. Alternatively, first sort by the number of time units occupied from most to least. If multiple uplink channels have the same number of time units occupied, then sort by MCS from highest to lowest. Alternatively, first sort by the number of time units occupied from most to least. If multiple uplink channels have the same number of time units occupied, then sort by the serving cell index value corresponding to the uplink channel from highest to lowest. Alternatively, first sort by the number of time units occupied from most to least. If multiple uplink channels have the same number of time units occupied, then sort by the serving cell index value corresponding to the uplink channel from lowest to highest. Alternatively, first sort by the number of time units occupied from most to least. If multiple uplink channels have the same number of time units occupied, then sort by uplink channel from those with DCI indication to those without.For example, first sort them according to the number of time units occupied from most to least. If multiple uplink channels occupy the same number of time units, then sort them according to the uplink channel that has never had a corresponding DCI indication to the uplink channel that has a corresponding DCI indication.

[0323] For example, first sort by the number of time units occupied in ascending order; if multiple uplink channels occupy the same number of time units, then sort by start time in ascending order. (This process is repeated three times in the original text.) For example, first sort by the number of time units occupied, from least to most. If multiple uplink channels occupy the same number of time units, then sort by the number of frequency domain resource units occupied by the uplink channels, from least to most. Alternatively, first sort by the number of time units occupied, from least to most. If multiple uplink channels occupy the same number of time units, then sort by modulation order, from highest to lowest. Alternatively, first sort by the number of time units occupied, from least to most. If multiple uplink channels occupy the same number of time units, then sort by modulation order, from lowest to highest. Alternatively, first sort by the number of time units occupied, from least to most. If multiple uplink channels occupy the same number of time units, then sort by code rate, from highest to lowest. Alternatively, first sort by the number of time units occupied, from least to most. If multiple uplink channels occupy the same number of time units, then sort by code rate, from lowest to highest. For example, first sort by the number of time units occupied in ascending order; if multiple uplink channels have the same number of time units occupied, then sort by MCS in ascending order. Alternatively, first sort by the number of time units occupied in ascending order; if multiple uplink channels have the same number of time units occupied, then sort by MCS in descending order. Another example, first sort by the number of time units occupied in ascending order; if multiple uplink channels have the same number of time units occupied, then sort by the serving cell index value corresponding to the uplink channel in descending order. Yet another example, first sort by the number of time units occupied in ascending order; if multiple uplink channels have the same number of time units occupied, then sort by the serving cell index value corresponding to the uplink channel in ascending order. Finally, first sort by the number of time units occupied in ascending order; if multiple uplink channels have the same number of time units occupied, then sort by uplink channels from those with DCI indication to those without.For example, first sort them according to the number of time units occupied from the least to the most. If there are multiple uplink channels with the same number of time units occupied, then sort them according to the uplink channel that has never had a corresponding DCI indication to the uplink channel that has a corresponding DCI indication.

[0324] For example, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by start time, from earliest to latest. Alternatively, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by start time, from latest to earliest. Alternatively, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by end time, from earliest to latest. Alternatively, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by end time, from latest to earliest. Alternatively, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the number of time units occupied by the uplink channel, from most to least. For example, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the number of time units occupied by the uplink channels, from least to most. Alternatively, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by modulation order, from highest to lowest. Another example, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by modulation order, from lowest to highest. Yet another example, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by code rate, from highest to lowest. Finally, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by code rate, from lowest to highest. For example, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by MCS from lowest to highest. Alternatively, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by MCS from highest to lowest. Another example, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the serving cell index value corresponding to the uplink channel, from highest to lowest. Finally, secondly, first sort by the number of frequency domain resource units occupied, from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the serving cell index value corresponding to the uplink channel, from lowest to highest. For example, first sort them according to the number of frequency domain resource units occupied from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort them according to the uplink channels that correspond to DCI indications to the uplink channels that do not correspond to DCI indications.For example, first sort them according to the number of frequency domain resource units occupied from most to least. If multiple uplink channels occupy the same number of frequency domain resource units, then sort them according to the uplink channels that have never had a corresponding DCI indication to the uplink channels that have a corresponding DCI indication.

[0325] For example, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by start time, from earliest to latest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by start time, from latest to earliest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by end time, from earliest to latest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by end time, from latest to earliest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the number of time units occupied by the uplink channel, from most to least. For example, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the number of time units occupied by the uplink channels, from least to most. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by modulation order, from highest to lowest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by modulation order, from lowest to highest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by code rate, from highest to lowest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by code rate, from lowest to highest. For example, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by MCS from lowest to highest. Alternatively, first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by MCS from highest to lowest. Another example: first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the serving cell index value corresponding to the uplink channel from highest to lowest. Finally, another example: first sort by the number of frequency domain resource units occupied, from least to most. If multiple uplink channels occupy the same number of frequency domain resource units, then sort by the serving cell index value corresponding to the uplink channel from lowest to highest. For example, first sort them according to the number of frequency domain resource units occupied from the fewest to the most. If there are multiple uplink channels occupying the same number of frequency domain resource units, then sort them according to the uplink channels that correspond to DCI indications to the uplink channels that do not correspond to DCI indications.For example, first sort them according to the number of frequency domain resource units occupied from the least to the most. If there are multiple uplink channels occupying the same number of frequency domain resource units, then sort them according to the uplink channel that has never had a corresponding DCI indication to the uplink channel that has a corresponding DCI indication.

[0326] For example, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by start time from earliest to latest. Alternatively, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by start time from latest to earliest. Or, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by end time from earliest to latest. For example, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by end time from latest to earliest. Alternatively, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by the number of time units occupied by the uplink channels from most to least. Alternatively, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by the number of time units occupied by the uplink channels from least to most. For example, first sort the uplink channels from those with corresponding DCI indicators to those without. If multiple uplink channels have corresponding DCI indicators or multiple uplink channels do not, then sort them by the number of frequency domain resource units occupied by each uplink channel, from most to least. Alternatively, first sort the uplink channels from those with corresponding DCI indicators to those without. If multiple uplink channels have corresponding DCI indicators or multiple uplink channels do not, then sort them by the number of frequency domain resource units occupied by each uplink channel, from least to most. Alternatively, first sort the uplink channels from those with corresponding DCI indicators to those without. If multiple uplink channels have corresponding DCI indicators or multiple uplink channels do not, then sort them by modulation order, from highest to lowest. For example, first sort the uplink channels from those with DCI indications to those without. If there are multiple uplink channels with DCI indications or multiple uplink channels without DCI indications, then sort them from low to high according to the modulation order.For example, first sort the uplink channels from those with corresponding DCI indicators to those without. If multiple uplink channels have corresponding DCI indicators or multiple uplink channels do not, then sort them by code rate from high to low. Alternatively, first sort the uplink channels from those with corresponding DCI indicators to those without. If multiple uplink channels have corresponding DCI indicators or multiple uplink channels do not, then sort them by code rate from low to high. Or, first sort the uplink channels from those with corresponding DCI indicators to those without. If multiple uplink channels have corresponding DCI indicators or multiple uplink channels do not, then sort them by MCS from low to high. For example, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by MCS from high to low. Alternatively, first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by the serving cell index value corresponding to the uplink channel from large to small. Another example: first sort the uplink channels from those with corresponding DCI indications to those without. If multiple uplink channels have corresponding DCI indications or multiple uplink channels do not, then sort them by the serving cell index value corresponding to the uplink channel from small to large.

[0327] There are many other possibilities, which will not be elaborated here.

[0328] It should be noted that when multiple channels cannot be sorted using any of the above methods, or when multiple channels meet the same conditions, the sorting methods can be freely combined, and this application does not limit this. For example, first sort by start time from earliest to latest; if multiple uplink channels have the same start time, sort by end time from earliest to latest; if multiple uplink channels have the same end time, sort by the number of time units occupied from most to least, until a first set of channels arranged in chronological order is obtained.

[0329] In some embodiments, after determining the first channel set, the channels in the first channel set are judged sequentially to determine the first channel.

[0330] For example, as shown in Figure 10, this embodiment of the application describes the process from the perspective of judging the m-th channel in the first channel set, where m is a positive integer, and includes one or more of the following steps:

[0331] Step 21: Determine whether the m-th channel is PUCCH or PUSCH.

[0332] If the m-th channel is PUCCH, then continue with step 22.1 after step 21.

[0333] Step 22.1: Determine whether the m-th channel satisfies the first judgment condition. The m-th channel satisfying the first judgment condition includes one or more of the following:

[0334] • The m-th channel does not overlap with any PUSCH;

[0335] • The m-th channel can carry the total payload size of all UCIs within the first time period, or the channel determined based on the m-th channel can carry the total payload size of all UCIs within the first time period.

[0336] If the first judgment condition is met on the m-th channel, continue to execute step 23.

[0337] Step 23: Determine the first channel as the m-th channel. This can be understood as identifying the m-th channel in the first channel set as the first channel. Alternatively, the first channel can be determined based on the m-th channel in the first channel set. For example, it can be determined based on the resource index corresponding to the m-th channel. Another example is determining the first channel based on the PRI index corresponding to the m-th channel and the total UCI payload size.

[0338] If the first judgment condition is not met on the m-th channel, one or more of the following two methods are included:

[0339] Method 1: Continue to check the (m+1)th channel. That is, if the current channel does not meet the judgment condition, continue to check the next channel.

[0340] Method 2: Continue to determine whether the m-th channel overlaps with at least one PUSCH. As shown in Figure 11, continue to execute step 24.

[0341] Step 24: Determine whether the m-th channel overlaps with at least one PUSCH.

[0342] Optionally, if the m-th channel does not overlap with any PUSCH, then continue to judge the (m+1)-th channel.

[0343] Optionally, if the m-th channel overlaps with at least one PUSCH, then proceed to step 25.

[0344] Step 25: Determine whether there exists a first set of PUSCHs in at least one PUSCH that satisfies the second judgment condition.

[0345] If at least one PUSCH exists in the first PUSCH set that satisfies the PUSCH judgment condition, then the first channel is the fourth PUSCH in the first PUSCH set. That is, continue to execute step 26.

[0346] If there is no first PUSCH set that satisfies the PUSCH judgment condition in at least one PUSCH, then continue to judge the (m+1)th channel, or judge the next channel in the first channel set after removing the PUSCH that overlaps with the mth channel.

[0347] In some embodiments, the first PUSCH set satisfies one or more of the following conditions:

[0348] • The number of time units occupied by each channel in the first PUSCH set is greater than or equal to the first threshold;

[0349] • The number of frequency domain resource units occupied by each channel in the first PUSCH set is greater than or equal to the second threshold;

[0350] • The modulation order of each channel in the first PUSCH set is less than or equal to the third threshold;

[0351] • The code rate corresponding to each channel in the first PUSCH set is less than or equal to the fourth threshold;

[0352] • The number of UCI bits that each channel in the first PUSCH set can carry is greater than or equal to the fifth threshold;

[0353] • The MCS corresponding to each channel in the first PUSCH set is less than or equal to the sixth threshold.

[0354] In some embodiments, the fourth PUSCH includes one or more of the following:

[0355] • The earliest start time of the PUSCH in the first PUSCH set;

[0356] • The PUSCH with the latest start time in the first PUSCH set;

[0357] • The PUSCH with the earliest end time in the first PUSCH set;

[0358] • The PUSCH with the latest end time in the first PUSCH set;

[0359] • The PUSCH that occupies the most time units in the first PUSCH set;

[0360] • The PUSCH that occupies the fewest time units in the first PUSCH set;

[0361] • The PUSCH that occupies the most frequency domain resource units in the first PUSCH set;

[0362] • The PUSCH that occupies the fewest frequency domain resource units in the first PUSCH set;

[0363] • The PUSCH with the highest modulation order in the first PUSCH set;

[0364] • The PUSCH with the lowest modulation order in the first PUSCH set;

[0365] • The PUSCH with the highest code rate in the first PUSCH set;

[0366] • The PUSCH with the lowest code rate in the first PUSCH set;

[0367] • The PUSCH with the highest MCS in the first PUSCH set;

[0368] • The PUSCH with the highest MCS in the first PUSCH set;

[0369] • The PUSCH with the smallest serving cell index value in the first PUSCH set;

[0370] • The PUSCH with the largest serving cell index value in the first PUSCH set.

[0371] In some embodiments, the fourth PUSCH can be determined based on a combination of at least two of the above methods. For example, first determine the PUSCH with the earliest start time in the first PUSCH set; if multiple PUSCHs have the earliest start time, then determine the fourth PUSCH from among these multiple earliest start time PUSCHs. Alternatively, first determine the PUSCH with the most time units occupied in the first PUSCH set; if multiple PUSCHs have the most time units occupied, then determine the fourth PUSCH from among these multiple time units occupied. Other possible embodiments based on the above combinations are not described in detail here.

[0372] If the m-th channel is PUSCH, then continue with step 22.2 after step 21.

[0373] Step 22.2: Determine whether the m-th channel satisfies the second judgment condition. The m-th channel satisfying the second judgment condition includes one or more of the following:

[0374] • The number of time units occupied by the m-th channel is greater than or equal to the first threshold;

[0375] • The number of frequency domain resource units occupied by the m-th channel is greater than or equal to the second threshold;

[0376] • The modulation order corresponding to the m-th channel is less than or equal to the third threshold;

[0377] • The code rate corresponding to the m-th channel is less than or equal to the fourth threshold;

[0378] • The number of UCI bits that the m-th channel can carry is greater than or equal to the fifth threshold;

[0379] • The MCS corresponding to the m-th channel is less than or equal to the sixth threshold.

[0380] If the second judgment condition is met on the m-th channel, continue to execute step 23.

[0381] If the second judgment condition is not met on the m-th channel, the judgment continues to the (m+1)-th channel. That is, if the judgment condition is not met on the current channel, the judgment continues to the next channel.

[0382] The first channel is the i-th channel (PUCCH or PUSCH).

[0383] The first channel is the i-th channel in the first channel set. The i-th channel satisfies the judgment condition, and the i-1 channels before the i-th channel do not satisfy the judgment condition. The value of i is a positive integer.

[0384] In some embodiments, since the one or more uplink channels to be transmitted in the first time period include one or more PUCCHs and / or one or more PUSCHs, the i-th channel may be a PUCCH or a PUSCH.

[0385] Optionally, when the i-th channel is PUCCH, the i-th channel satisfies one or more of the following judgment conditions:

[0386] • The i-th channel does not overlap with any PUSCH;

[0387] • The i-th channel can carry the entire payload size of UCI within the first time period.

[0388] Optionally, when the i-th channel is PUSCH, the i-th channel satisfies one or more of the following judgment conditions:

[0389] • The number of time units occupied by the i-th channel is greater than or equal to the first threshold;

[0390] • The number of frequency domain resource units occupied by the i-th channel is greater than or equal to the second threshold;

[0391] • The modulation order corresponding to the i-th channel is less than or equal to the third threshold;

[0392] • The code rate corresponding to the i-th channel is less than or equal to the fourth threshold;

[0393] • The number of UCI bits that the i-th channel can carry is greater than or equal to the fifth threshold;

[0394] • The MCS corresponding to the i-th channel is less than or equal to the sixth threshold.

[0395] In some embodiments, when judging the (i-1) channels preceding the i-th channel, for the j-th channel, if the judgment condition is not met, the judgment continues to the (j+1)-th channel, where j is a positive integer less than i. Optionally, the j-th channel is PUCCH or PUSCH.

[0396] The first channel is the fourth PUSCH.

[0397] The first channel is the fourth PUSCH in the first channel set. The fourth PUSCH is determined from the first PUSCH set when the k-th channel in the first channel set does not meet the judgment condition, the k-th channel overlaps with at least one PUSCH in one or more PUSCHs, and there is at least one PUSCH in the first PUSCH set that meets the judgment condition. The k-th channel is a PUCCH, and the value of k is a positive integer.

[0398] In some embodiments, if no first PUSCH set satisfies the judgment condition in at least one PUSCH, the judgment continues to the (k+1)th channel; or, if no first PUSCH set satisfies the judgment condition in at least one PUSCH, the judgment continues to the ath channel, where the ath channel is the first channel after the kth channel except for the fifth PUSCH, the fifth PUSCH overlaps with the kth channel, and the value of a is an integer greater than k.

[0399] By not distinguishing whether only PUCCH or both PUSCH are transmitted in the first time period, Scheme 3 avoids separating the determination of the first PUCCH and the determination of the second PUSCH into two steps. Instead, it treats the PUCCH and PUSCH in the first time period as a unified process, which helps to simplify the complexity of the standard design.

[0400] It should be noted that sections 3.1 and 3.2 above can be implemented individually or in combination. Optionally, in one possible case, satisfying the first timing condition is achieved using the scheme described in section 3.1 above, while the first channel is determined based on the scheme of steps 1-3 in the aforementioned related technologies. Optionally, in another possible case, satisfying the first timing condition can be understood as satisfying the multiplexing timeline condition in the aforementioned related technologies, while the first channel is determined using the scheme described in section 3.2 above. Optionally, in yet another possible case, satisfying the first timing condition is achieved using the scheme described in section 3.1 above, and the first channel is determined using the scheme described in section 3.2 above.

[0401] Figure 12 illustrates a flowchart of an uplink information multiplexing method provided in an exemplary embodiment of this application. The method is executed by a network device and includes:

[0402] Step 320: During the first time period, receive one or more uplink channels transmitted by the terminal device. If one or more uplink channels carry UCI and meet the first timing condition, receive the multiplexed UCI on the first channel.

[0403] For the first time period, please refer to the description of step 220 above.

[0404] For one or more uplink channels, please refer to the description in step 220 above.

[0405] The first timing condition is described in step 220 above.

[0406] Optionally, depending on the type of uplink channel, the method by which the network device determines the first channel can be found in one or more of the above schemes one to three, and will not be repeated here.

[0407] To reiterate, the combinations shown in the above embodiments are merely examples and not limitations. This application supports modifications to the combinations described above, such as changing the order of combinations, changing the number of combinations, etc.

[0408] Figure 13 shows a structural block diagram of a terminal device provided in an exemplary embodiment of this application. The terminal device includes a transmitting module 910.

[0409] The transmitting module 910 is used to multiplex the UCI carried in the one or more uplink channels for transmission on the first channel when one or more uplink channels are to be transmitted within a first time period and a first timing condition is met.

[0410] For the first time period, please refer to the description of step 220 above.

[0411] For one or more uplink channels, please refer to the description in step 220 above.

[0412] The first timing condition is described in step 220 above.

[0413] In some embodiments, the above-described apparatus further includes a determining module 920.

[0414] The determination module 920 is used to determine whether the first timing condition is met. Depending on the type of uplink channel, the satisfaction of the first timing condition is described in the embodiments of Schemes 1 to 3 above.

[0415] The determining module 920 is also used to determine the first PUCCH. The first PUCCH is described in a partial embodiment of the above scheme.

[0416] The determining module 920 is also used to determine the second PUCCH. The second PUCCH is described in the description of the embodiments in Part Two of the above scheme.

[0417] In some embodiments, for the m-th channel in the first channel set, the determining module 920 is further configured to: determine whether the m-th channel is PUCCH or PUSCH.

[0418] If the m-th channel is PUCCH, then determine whether the m-th channel satisfies the first judgment condition.

[0419] If the first judgment condition is met in the m-th channel, the m-th channel will continue to be determined as the first channel.

[0420] If the first judgment condition is not met on the m-th channel: Optionally, continue to judge the (m+1)-th channel. Optionally, if the m-th channel overlaps with at least one PUSCH, then continue to judge whether there exists a first PUSCH set that satisfies the second judgment condition among at least one PUSCH.

[0421] If there exists a first PUSCH set that satisfies the PUSCH judgment condition in at least one PUSCH, then the fourth PUSCH in the first PUSCH set is determined as the first channel; if there does not exist a first PUSCH set that satisfies the PUSCH judgment condition in at least one PUSCH, then the (m+1)th channel is judged, or the next channel in the first channel set after removing the PUSCH that overlaps with the mth channel is judged.

[0422] If the m-th channel is PUSCH, then determine whether the m-th channel satisfies the second judgment condition.

[0423] If the second judgment condition is met in the m-th channel, the m-th channel will continue to be determined as the first channel.

[0424] If the second judgment condition is not met on the m-th channel, continue to judge the (m+1)-th channel.

[0425] It should be noted that the content described in the preceding method embodiments is applicable to the uplink information multiplexing device shown in Figure 13. For details not described in detail in this embodiment, please refer to the above embodiments, which will not be repeated here.

[0426] Figure 14 shows a structural block diagram of a network device provided in an exemplary embodiment of this application. The network device includes a receiving module 1010.

[0427] The receiving module 1010 is used to receive one or more uplink channels transmitted by the terminal device during a first time period. If one or more uplink channels carry UCI and meet the first timing condition, the receiving module 1010 receives the multiplexed UCI on the first channel.

[0428] For the first time period, please refer to the description of step 220 above.

[0429] For one or more uplink channels, please refer to the description in step 220 above.

[0430] The first timing condition is described in step 220 above.

[0431] In some embodiments, the above-described apparatus further includes a determining module 1020.

[0432] The determining module 1020 is used to determine whether the first timing condition is met. Depending on the type of uplink channel, the satisfaction of the first timing condition is described in the embodiments of Schemes 1 to 3 above.

[0433] The determining module 1020 is also used to determine the first PUCCH. The first PUCCH is described in a partial embodiment of the above scheme.

[0434] The determining module 1020 is also used to determine the second PUCCH. The second PUCCH is described in the above-described embodiment of Scheme 2.

[0435] In some embodiments, for the m-th channel in the first channel set, the determining module 1020 is further configured to: determine whether the m-th channel is a PUCCH or a PUSCH.

[0436] If the m-th channel is PUCCH, then determine whether the m-th channel satisfies the first judgment condition.

[0437] If the first judgment condition is met in the m-th channel, the m-th channel will continue to be determined as the first channel.

[0438] If the first judgment condition is not met on the m-th channel: Optionally, continue to judge the (m+1)-th channel. Optionally, if the m-th channel overlaps with at least one PUSCH, then continue to judge whether there exists a first PUSCH set that satisfies the second judgment condition among at least one PUSCH.

[0439] If there exists a first PUSCH set that satisfies the PUSCH judgment condition in at least one PUSCH, then the fourth PUSCH in the first PUSCH set is determined as the first channel; if there does not exist a first PUSCH set that satisfies the PUSCH judgment condition in at least one PUSCH, then the (m+1)th channel is judged, or the next channel in the first channel set after removing the PUSCH that overlaps with the mth channel is judged.

[0440] If the m-th channel is PUSCH, then determine whether the m-th channel satisfies the second judgment condition.

[0441] If the second judgment condition is met in the m-th channel, the m-th channel will continue to be determined as the first channel.

[0442] If the second judgment condition is not met on the m-th channel, continue to judge the (m+1)-th channel.

[0443] It should be noted that the content described in the preceding method embodiments is applicable to the uplink information multiplexing device shown in Figure 14. For details not described in detail in this embodiment, please refer to the above embodiments, which will not be repeated here.

[0444] Figure 15 shows a schematic diagram of a communication device provided in one embodiment of this application. This communication device can optionally be implemented as a terminal device or a network device. The communication device may include: a processor 901, a receiver 902, a transmitter 903, a memory 904, and a bus 905.

[0445] The processor 901 includes one or more processing cores. The processor 901 executes various functional applications and information processing by running software programs and modules.

[0446] The receiver 902 and the transmitter 903 can be implemented as a transceiver 906, which can be a communication chip.

[0447] In some embodiments, when the communication device is implemented as a terminal device, the transmitter 903 is configured to multiplex the uplink control information (UCI) carried in one or more uplink channels for transmission on the first channel, provided that one or more uplink channels are to be transmitted within a first time period and a first timing condition is met. Optionally, the transmitter 903 is further configured to perform the transmission steps performed by the terminal device in the above method embodiments.

[0448] In some embodiments, where the communication device is implemented as a network device, the receiver 902 is configured to receive one or more uplink channels transmitted by the terminal device within a first time period, wherein the one or more uplink channels carry UCI and satisfy a first timing condition, and to receive the multiplexed UCI transmitted on the first channel. Optionally, the receiver 902 is further configured to perform the receiving steps performed by the network device in the above method embodiments.

[0449] The memory 904 is connected to the processor 901 via a bus 905. The memory 904 can be used to store computer programs, and the processor 901 uses to execute the computer programs. Furthermore, the memory 904 can be implemented using any type of volatile or non-volatile storage device or a combination thereof. Volatile or non-volatile storage devices include, but are not limited to: RAM (Random-Access Memory) and ROM (Read-Only Memory), EPROM (Erasable Programmable Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash memory or other solid-state storage technologies, CD-ROM (Compact Disc Read-Only Memory), DVD (Digital Video Disc) or other optical storage, magnetic tape cassettes, magnetic tape, disk storage, or other magnetic storage devices.

[0450] This application also provides a computer-readable storage medium storing a computer program. The computer program is used by the processor of a communication device to implement the various steps in the aforementioned uplink information multiplexing method. In some embodiments, the computer-readable storage medium may include ROM (Read-Only Memory), RAM (Random-Access Memory), SSD (Solid State Drives), or optical disc, etc. The random access memory may include ReRAM (Resistance Random Access Memory) and DRAM (Dynamic Random Access Memory).

[0451] This application also provides a chip, which includes programmable logic circuits and / or program instructions. When the chip is running on a terminal device, it is used to implement the various steps in the uplink information multiplexing method executed by the terminal device.

[0452] In some embodiments, the chip is used to multiplex the UCI carried in the one or more uplink channels for transmission on a first channel when one or more uplink channels are to be transmitted within a first time period and a first timing condition is met.

[0453] This application also provides a chip, which includes programmable logic circuits and / or program instructions. When the chip is running on a network device, it is used to implement the various steps in the uplink information multiplexing method executed by the network device.

[0454] In some embodiments, the chip is configured to receive one or more uplink channels transmitted by a terminal device during a first time period, wherein the one or more uplink channels carry UCI and satisfy a first timing condition, and to receive multiplexed UCI on a first channel.

[0455] This application also provides a computer program product, which includes computer instructions stored in a computer-readable storage medium. The processor or transceiver of the terminal device reads and executes the computer instructions from the computer-readable storage medium to implement the various steps in the uplink information multiplexing method executed by the terminal device described above.

[0456] This application also provides a computer program product, which includes computer instructions stored in a computer-readable storage medium. The processor or transceiver of a network device reads and executes the computer instructions from the computer-readable storage medium to implement the various steps in the uplink information multiplexing method executed by the network device described above.

[0457] Those skilled in the art will recognize that the functions described in the embodiments of this application in one or more of the above examples can be implemented using hardware, software, firmware, or any combination thereof. When implemented using software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or code on a computer-readable medium. Computer-readable media include computer storage media and communication media, wherein communication media include any medium that facilitates the transfer of a computer program from one place to another. Storage media can be any available medium that can be accessed by a general-purpose or special-purpose computer.

[0458] The above description is merely an exemplary embodiment of this application and is not intended to limit this application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A method for uplink information multiplexing, characterized in that, The method is executed by a terminal device, and the method includes: If one or more uplink channels are to be transmitted within a first time period and the first timing condition is met, the uplink control information (UCI) carried in the one or more uplink channels will be multiplexed and transmitted on the first channel.

2. The method according to claim 1, characterized in that, The first timing condition is determined based on the start time unit of the first time period.

3. The method according to claim 2, characterized in that, The condition of satisfying the first timing condition includes one or more of the following: The start time unit of the first time period is not earlier than the first time unit. The first time unit is determined based on the first processing time after the end of the first physical downlink shared channel PDSCH. The first PDSCH is the PDSCH corresponding to the UCI carried in the one or more uplink channels. The start time unit of the first time period is not earlier than the second time unit. The second time unit is determined based on the second processing time after the end of the first physical downlink control channel PDCCH. The first PDCCH is used to carry the first downlink control information DCI format. The first DCI format has a corresponding first hybrid automatic repeat request acknowledgment (HARQ-ACK) information. The first HARQ-ACK information is carried in the one or more uplink channels. The start time unit of the first time period is not earlier than the third time unit. The third time unit is determined based on the third processing time after the end of the second PDCCH. The second PDCCH is used to schedule the first physical uplink shared channel PUSCH and / or to carry the second DCI format or schedule the second PDSCH. The second DCI format or the second PDSCH has corresponding second HARQ-ACK information. The second HARQ-ACK information is carried in the one or more uplink channels, and the one or more uplink channels include the first PUSCH.

4. The method according to any one of claims 1 to 3, characterized in that, The one or more uplink channels include one or more PUCCHs, and the first channel is the first physical uplink control channel PUCCH.

5. The method according to claim 4, characterized in that, The first PUCCH is determined according to one or more of the following: The payload size of the UCI carried in the one or more PUCCHs; The types of UCIs carried in one or more PUCCHs; Downlink control information (DCI) corresponding to one or more PUCCHs.

6. The method according to any one of claims 1 to 3, characterized in that, The one or more uplink channels are at least two uplink channels, and the at least two uplink channels include one or more PUCCHs and one or more PUSCHs, wherein the first channel is a second PUSCH.

7. The method according to claim 6, characterized in that, The second PUSCH is determined according to one or more of the following: The temporal location of the one or more PUCCHs; The temporal location of the first PUCCH, which is determined based on the one or more PUCCHs; The time-domain location of the one or more PUSCHs; The frequency domain location of the one or more PUSCHs; The serving cell index corresponding to the one or more PUSCHs; The modulation and coding scheme (MCS) corresponding to one or more PUSCHs.

8. The method according to claim 7, characterized in that, The second PUSCH includes one or more of the following: The PUSCH that overlaps with the first PUCCH in one or more PUSCHs; PUSCHs that overlap with the one or more PUCCHs; The PUSCH with the earliest start time among the one or more PUSCHs; The PUSCH with the latest start time among the one or more PUSCHs; The PUSCH with the earliest end time among the one or more PUSCHs; The PUSCH with the latest end time among the one or more PUSCHs; The PUSCH that occupies the most time units among the one or more PUSCHs; The PUSCH that occupies the fewest time units among the one or more PUSCHs; The PUSCH that occupies the most frequency domain resource units among the one or more PUSCHs; The PUSCH that occupies the fewest frequency domain resource units among the one or more PUSCHs; The PUSCH with the lowest modulation order among the one or more PUSCHs; The PUSCH with the highest modulation order among the one or more PUSCHs; The PUSCH with the lowest code rate among the one or more PUSCHs; The PUSCH with the highest code rate among the one or more PUSCHs; The PUSCH with the highest MCS among the one or more PUSCHs; The PUSCH with the lowest MCS among the one or more PUSCHs; The PUSCH with the smallest serving cell index value among the one or more PUSCHs; The PUSCH with the largest serving cell index value among the one or more PUSCHs; All PUSCHs in the one or more PUSCHs; The PUSCH that satisfies the first timing condition among the one or more PUSCHs; The PUSCH other than the third PUSCH among the one or more PUSCHs.

9. The method according to claim 8, characterized in that, The third PUSCH includes one or more of the following: The number of time units occupied in one or more PUSCHs is less than or equal to the first threshold. The number of frequency domain resource units occupied in one or more PUSCHs is less than or equal to the second threshold. The PUSCH in the one or more PUSCHs whose modulation order is greater than or equal to the third threshold; The PUSCHs in the one or more PUSCHs whose code rate is greater than or equal to the fourth threshold; The PUSCH in which the MCS is greater than or equal to the sixth threshold.

10. The method according to any one of claims 1 to 3, characterized in that, The one or more uplink channels include one or more PUCCHs and / or one or more PUSCHs, the first channel is the i-th channel in the first channel set, the i-th channel satisfies the judgment condition, and the i-1 channels before the i-th channel do not satisfy the judgment condition, where i is a positive integer.

11. The method according to claim 10, characterized in that, The first channel set is obtained by sorting the one or more uplink channels according to a first arrangement; or, The first channel set is obtained by sorting the uplink channels that satisfy the first timing condition among the one or more uplink channels according to the first arrangement.

12. The method according to claim 10 or 11, characterized in that, The i-th channel is PUCCH, and the i-th channel satisfies one or more of the following judgment conditions: The i-th channel does not overlap with any PUSCH; The i-th channel is capable of carrying the entire payload size of UCI within the first time period.

13. The method according to claim 10 or 11, characterized in that, The i-th channel is a PUSCH, and the i-th channel satisfies one or more of the following judgment conditions: The number of time units occupied by the i-th channel is greater than or equal to the first threshold; The number of frequency domain resource units occupied by the i-th channel is greater than or equal to the second threshold. The modulation order corresponding to the i-th channel is less than or equal to the third threshold; The code rate corresponding to the i-th channel is less than or equal to the fourth threshold; The number of UCI bits that the i-th channel can carry is greater than or equal to the fifth threshold. The MCS corresponding to the i-th channel is less than or equal to the sixth threshold.

14. The method according to any one of claims 10 to 13, characterized in that, The method further includes: If the j-th channel in the first channel set does not meet the judgment condition, continue to judge the (j+1)-th channel; Wherein, the j-th channel is either PUCCH or PUSCH, and the value of j is a positive integer less than i.

15. The method according to any one of claims 10 to 14, characterized in that, The first channel is the fourth PUSCH in the first channel set.

16. The method according to claim 15, characterized in that, The fourth PUSCH is determined from the first PUSCH set when the k-th channel in the first channel set does not meet the judgment condition, and the k-th channel overlaps with at least one PUSCH in the one or more PUSCHs, and there is a first PUSCH set in the at least one PUSCH that meets the judgment condition. The k-th channel is a PUCCH, and the value of k is a positive integer.

17. The method according to claim 16, characterized in that, The fourth PUSCH includes one or more of the following: The PUSCH with the earliest start time in the first PUSCH set; The PUSCH with the latest start time in the first PUSCH set; The PUSCH with the earliest end time in the first PUSCH set; The PUSCH with the latest end time in the first PUSCH set; The PUSCH that occupies the most time units in the first PUSCH set; The PUSCH that occupies the fewest time units in the first PUSCH set; The PUSCH that occupies the most frequency domain resource units in the first PUSCH set; The PUSCH that occupies the fewest frequency domain resource units in the first PUSCH set; The PUSCH with the highest modulation order in the first PUSCH set; The PUSCH with the lowest modulation order in the first set of PUSCHs; The PUSCH with the highest code rate in the first PUSCH set; The PUSCH with the lowest code rate in the first PUSCH set; The PUSCH with the highest MCS in the first PUSCH set; The PUSCH with the lowest MCS in the first set of PUSCHs; The PUSCH with the smallest serving cell index value in the first PUSCH set; The PUSCH with the largest serving cell index value in the first PUSCH set.

18. The method according to claim 16 or 17, characterized in that, The method further includes: If none of the at least one PUSCHs satisfies the judgment condition in the first PUSCH set, continue judging the (k+1)th channel; or, If none of the at least one PUSCH sets satisfies the judgment condition, the judgment continues to the a-th channel, which is the first channel after the k-th channel except the fifth PUSCH, and the fifth PUSCH overlaps with the k-th channel, and the value of a is an integer greater than k.

19. The method according to claim 11, characterized in that, The first arrangement includes one or more of the following: Start times range from morning to night; Start times range from late to early; End time varies from morning to night; End times range from evening to morning; The number of time units occupied by the uplink channel decreases from the highest to the lowest. The number of time units occupied by the uplink channel increases from few to many. The number of frequency domain resource units occupied by the uplink channel decreases from the highest to the lowest. The number of frequency domain resource elements occupied by the uplink channel increases from few to many. Modulation order from high to low; Modulation order from low to high; Bitrate from high to low; Bitrate from low to high; MCS from low to high; MCS from high to low; The serving cell index values ​​corresponding to the uplink channels are listed from largest to smallest. The serving cell index values ​​corresponding to the uplink channels are arranged from smallest to largest. From uplink channels with corresponding DCI indications to uplink channels without corresponding DCI indications; From an uplink channel that never corresponds to an uplink channel with a DCI indication to an uplink channel that corresponds to an uplink channel with a DCI indication.

20. The method according to any one of claims 1 to 19, characterized in that, The first time period includes one or more of the following: time slot, sub-time slot, sub-frame, half-frame, and multiple time units.

21. The method according to any one of claims 1 to 20, characterized in that, The UCI carried in the one or more uplink channels is transmitted in the first channel using joint coding or separate coding.

22. A method for uplink information multiplexing, characterized in that, The method is performed by a network device, and the method includes: If, during a first time period, one or more uplink channels transmitted by a terminal device are to be received, and the one or more uplink channels carry a UCI and satisfy a first timing condition, the multiplexed UCI is received on the first channel.

23. The method according to claim 22, characterized in that, The first timing condition is determined based on the start time unit of the first time period.

24. The method according to claim 23, characterized in that, The condition of satisfying the first timing condition includes one or more of the following: The start time unit of the first time period is not earlier than the first time unit. The first time unit is determined based on the first processing time after the first PDSCH ends. The first PDSCH is the PDSCH corresponding to the UCI carried in the one or more uplink channels. The start time unit of the first time period is not earlier than the second time unit. The second time unit is determined based on the second processing time after the first PDCCH ends. The first PDCCH is used to carry the first DCI format. The first DCI format has corresponding first HARQ-ACK information. The first HARQ-ACK information is carried in the one or more uplink channels. The start time unit of the first time period is not earlier than the third time unit. The third time unit is determined based on the third processing time after the end of the second PDCCH. The second PDCCH is used to schedule the first PUSCH and / or to carry the second DCI format or schedule the second PDSCH. The second DCI format or the second PDSCH has corresponding second HARQ-ACK information. The second HARQ-ACK information is carried in the one or more uplink channels, and the one or more uplink channels include the first PUSCH.

25. The method according to any one of claims 22 to 24, characterized in that, The one or more uplink channels include one or more PUCCHs, and the first channel is the first PUCCH.

26. The method according to claim 25, characterized in that, The first PUCCH is determined according to one or more of the following: The payload size of the UCI carried in the one or more PUCCHs; The types of UCIs carried in one or more PUCCHs; Downlink control information (DCI) corresponding to one or more PUCCHs.

27. The method according to any one of claims 22 to 24, characterized in that, The one or more uplink channels include one or more PUCCHs and one or more PUSCHs, wherein the first channel is a second PUSCH.

28. The method according to claim 27, characterized in that, The second PUSCH is determined according to one or more of the following: The temporal location of the one or more PUCCHs; The temporal location of the first PUCCH, which is determined based on the one or more PUCCHs; The time-domain location of the one or more PUSCHs; The frequency domain location of the one or more PUSCHs; The serving cell index corresponding to the one or more PUSCHs; The modulation and coding scheme (MCS) corresponding to one or more PUSCHs.

29. The method according to claim 28, characterized in that, The second PUSCH includes one or more of the following: The PUSCH that overlaps with the first PUCCH in one or more PUSCHs; PUSCHs that overlap with the one or more PUCCHs; The PUSCH with the earliest start time among the one or more PUSCHs; The PUSCH with the latest start time among the one or more PUSCHs; The PUSCH with the earliest end time among the one or more PUSCHs; The PUSCH with the latest end time among the one or more PUSCHs; The PUSCH that occupies the most time units among the one or more PUSCHs; The PUSCH that occupies the fewest time units among the one or more PUSCHs; The PUSCH that occupies the most frequency domain resource units among the one or more PUSCHs; The PUSCH that occupies the fewest frequency domain resource units among the one or more PUSCHs; The PUSCH with the lowest modulation order among the one or more PUSCHs; The PUSCH with the highest modulation order among the one or more PUSCHs; The PUSCH with the lowest code rate among the one or more PUSCHs; The PUSCH with the highest code rate among the one or more PUSCHs; The PUSCH with the highest MCS among the one or more PUSCHs; The PUSCH with the lowest MCS among the one or more PUSCHs; The PUSCH with the smallest serving cell index value among the one or more PUSCHs; The PUSCH with the largest serving cell index value among the one or more PUSCHs; All PUSCHs in the one or more PUSCHs; The PUSCH that satisfies the first timing condition among the one or more PUSCHs; The PUSCH other than the third PUSCH among the one or more PUSCHs.

30. The method according to claim 29, characterized in that, The third PUSCH includes one or more of the following: The number of time units occupied in one or more PUSCHs is less than or equal to the first threshold. The number of frequency domain resource units occupied in one or more PUSCHs is less than or equal to the second threshold. The PUSCH in the one or more PUSCHs whose modulation order is greater than or equal to the third threshold; The PUSCHs in the one or more PUSCHs whose code rate is greater than or equal to the fourth threshold; The PUSCH in which the MCS is greater than or equal to the sixth threshold.

31. The method according to any one of claims 22 to 24, characterized in that, The one or more uplink channels include one or more PUCCHs and / or one or more PUSCHs, the first channel is the i-th channel in the first channel set, the i-th channel satisfies the judgment condition, and the i-1 channels before the i-th channel do not satisfy the judgment condition, where i is a positive integer.

32. The method according to claim 31, characterized in that, The first channel set is obtained by sorting the one or more uplink channels according to a first arrangement; or, The first channel set is obtained by sorting the uplink channels that satisfy the first timing condition among the one or more uplink channels according to the first arrangement.

33. The method according to claim 31 or 32, characterized in that, The i-th channel is PUCCH, and the i-th channel satisfies one or more of the following judgment conditions: The i-th channel does not overlap with any PUSCH; The i-th channel is capable of carrying the entire payload size of UCI within the first time period.

34. The method according to claim 31 or 32, characterized in that, The i-th channel is a PUSCH, and the i-th channel satisfies one or more of the following judgment conditions: The number of time units occupied by the i-th channel is greater than or equal to the first threshold; The number of frequency domain resource units occupied by the i-th channel is greater than or equal to the second threshold. The modulation order corresponding to the i-th channel is less than or equal to the third threshold; The code rate corresponding to the i-th channel is less than or equal to the fourth threshold; The number of UCI bits that the i-th channel can carry is greater than or equal to the fifth threshold. The MCS corresponding to the i-th channel is less than or equal to the sixth threshold.

35. The method according to any one of claims 31 to 34, characterized in that, The method further includes: If the j-th channel in the first channel set does not meet the judgment condition, continue to judge the (j+1)-th channel; Wherein, the j-th channel is either PUCCH or PUSCH, and the value of j is a positive integer less than i.

36. The method according to any one of claims 31 to 35, characterized in that, The first channel is the fourth PUSCH in the first channel set.

37. The method according to claim 36, characterized in that, The one or more uplink channels include one or more PUCCHs and / or one or more PUSCHs. The fourth PUSCH is determined from the first PUSCH set when the k-th channel in the first channel set does not meet the judgment condition, and the k-th channel overlaps with at least one PUSCH in the one or more PUSCHs, and there is a first PUSCH set in the at least one PUSCH that meets the judgment condition. The k-th channel is a PUCCH, and the value of k is a positive integer.

38. The method according to claim 37, characterized in that, The fourth PUSCH includes one or more of the following: The PUSCH with the earliest start time in the first PUSCH set; The PUSCH with the latest start time in the first PUSCH set; The PUSCH with the earliest end time in the first PUSCH set; The PUSCH with the latest end time in the first PUSCH set; The PUSCH that occupies the most time units in the first PUSCH set; The PUSCH that occupies the fewest time units in the first PUSCH set; The PUSCH that occupies the most frequency domain resource units in the first PUSCH set; The PUSCH that occupies the fewest frequency domain resource units in the first PUSCH set; The PUSCH with the highest modulation order in the first PUSCH set; The PUSCH with the lowest modulation order in the first set of PUSCHs; The PUSCH with the highest code rate in the first PUSCH set; The PUSCH with the lowest code rate in the first PUSCH set; The PUSCH with the highest MCS in the first PUSCH set; The PUSCH with the lowest MCS in the first set of PUSCHs; The PUSCH with the smallest serving cell index value in the first PUSCH set; The PUSCH with the largest serving cell index value in the first PUSCH set.

39. The method according to claim 37 or 38, characterized in that, The method further includes: If none of the at least one PUSCHs satisfies the judgment condition in the first PUSCH set, continue judging the (k+1)th channel; or, If none of the at least one PUSCH sets satisfies the judgment condition, the judgment continues to the a-th channel, which is the first channel after the k-th channel except the fifth PUSCH, and the fifth PUSCH overlaps with the k-th channel, and the value of a is an integer greater than k.

40. The method according to claim 32, characterized in that, The first arrangement includes one or more of the following: Start times range from morning to night; Start times range from late to early; End time varies from morning to night; End times range from evening to morning; The number of time units occupied by the uplink channel decreases from the highest to the lowest. The number of time units occupied by the uplink channel increases from few to many. The number of frequency domain resource units occupied by the uplink channel decreases from the highest to the lowest. The number of frequency domain resource elements occupied by the uplink channel increases from few to many. Modulation order from high to low; Modulation order from low to high; Bitrate from high to low; Bitrate from low to high; MCS from low to high; MCS from high to low; The serving cell index values ​​corresponding to the uplink channels are listed from largest to smallest. The serving cell index values ​​corresponding to the uplink channels are arranged from smallest to largest. From uplink channels with corresponding DCI indications to uplink channels without corresponding DCI indications; From an uplink channel that never corresponds to an uplink channel with a DCI indication to an uplink channel that corresponds to an uplink channel with a DCI indication.

41. The method according to any one of claims 22 to 40, characterized in that, The first time period includes one or more of the following: time slot, sub-time slot, sub-frame, half-frame, and multiple time units.

42. The method according to any one of claims 22 to 41, characterized in that, The UCI carried in the one or more uplink channels is transmitted in the first channel using joint coding or separate coding.

43. A terminal device, characterized in that, The terminal device includes: The transmitting module is configured to transmit the UCI carried in one or more uplink channels on a first channel when one or more uplink channels are to be transmitted within a first time period and a first timing condition is met.

44. A network device, characterized in that, The network device includes: A receiving module is configured to receive one or more uplink channels transmitted by a terminal device within a first time period, wherein the one or more uplink channels carry UCI and satisfy a first timing condition, and receive the multiplexed UCI transmitted on a first channel.

45. A terminal device, characterized in that, The terminal device includes: processor; A transceiver connected to the processor; Memory for storing the executable instructions of the processor; The transceiver is configured to load and execute the executable instructions to implement the uplink information multiplexing method as described in any one of claims 1 to 21.

46. ​​A network device, characterized in that, The network device includes: processor; A transceiver connected to the processor; Memory for storing the executable instructions of the processor; The transceiver is configured to load and execute the executable instructions to implement the uplink information multiplexing method as described in any one of claims 22 to 42.

47. A chip, characterized in that, The chip includes programmable logic circuits and / or program instructions. When the chip is running on a terminal device, the chip is used to implement the uplink information multiplexing method as described in any one of claims 1 to 21.

48. A chip, characterized in that, The chip includes programmable logic circuits and / or program instructions. When the chip is running on a network device, the chip is used to implement the uplink information multiplexing method as described in any one of claims 22 to 42.

49. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, which is loaded and executed by a processor to implement the uplink information multiplexing method as described in any one of claims 1 to 21.

50. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, which is loaded and executed by a processor to implement the uplink information multiplexing method as described in any one of claims 22 to 42.

51. A computer program product, characterized in that, The computer program product includes computer instructions stored in a computer-readable storage medium, a processor retrieves the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to implement the uplink information multiplexing method as described in any one of claims 1 to 21.

52. A computer program product, characterized in that, The computer program product includes computer instructions stored in a computer-readable storage medium, a processor retrieves the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to implement the uplink information multiplexing method as described in any one of claims 22 to 42.

53. A computer program, characterized in that, The computer program is executed by the processor of the terminal device to implement the uplink information multiplexing method according to any one of claims 1 to 21.

54. A computer program, characterized in that, The computer program is executed by the processor of the network device to implement the uplink information multiplexing method according to any one of claims 22 to 42.

Images