PUCCH repetition multiplexing, apparatus, computer-readable storage medium and software product

Abstract

A wireless communication method is provided, the method including: determining that multiple physical uplink control channels (PUCCHs) overlap in the time domain and that at least one PUCCH among the multiple PUCCHs has a repetition factor greater than 1; multiplexing multiple uplink control information (UCI) of the multiple PUCCHs to obtain a resulting PUCCH if a predefined condition is met; and transmitting the resulting PUCCH to a base station. An apparatus and a computer-readable medium configured to implement the disclosed method are also provided.

Description

[Technical Field]

[0001] TECHNICAL FIELD This disclosure relates generally to PUCCH repetition, and more particularly to multiplexing of PUCCH repetition. [Background technology]

[0002] Wireless communication technologies are an important part of today's interconnected global communication networks. Wireless communication relies on precisely allocated time and frequency resources to transmit and receive radio signals. The Physical Uplink Control Channel (PUCCH) carries uplink control information from User Equipment (UE) to Base Station (BS). PUCCH repetition technology provides better uplink coverage performance for UEs at cell edges. However, resource allocation for PUCCH repetition can affect the overall performance of uplink (UL) and downlink (DL) transmissions. Summary of the Invention [Problem to be solved by the invention]

[0003] The present disclosure is a simplified description of certain aspects of the present disclosure and is not intended to limit the scope of the present disclosure. [Means for solving the problem]

[0004] An embodiment of the present disclosure provides a wireless communication method, determining that a plurality of PUCCHs overlap in the time domain, and at least one PUCCH of the plurality of PUCCHs has a repetition factor greater than 1; multiplexing multiple Uplink Control Information (UCI) of multiple PUCCHs to obtain a resulting PUCCH if a predefined condition is met; and transmitting the resulting PUCCH to the base station.

[0005] Another embodiment of the present disclosure provides a wireless communication method, comprising: determining that a plurality of PUCCHs overlap in the time domain, and at least one PUCCH of the plurality of PUCCHs has a repetition factor greater than 1; receiving a resultant PUCCH, where the resultant PUCCH is obtained by multiplexing multiple UCIs of multiple PUCCHs to obtain the resultant PUCCH if a predefined condition is met.

[0006] Yet another embodiment of the present disclosure provides a wireless communication device, the wireless communication device including: a memory storing one or more programs; and a processor electrically coupled to the memory and configured to execute the one or more programs to perform any method or step or combination thereof of the present disclosure.

[0007] Yet another embodiment of the present disclosure provides a non-transitory computer-readable storage medium storing one or more programs, the one or more programs being configured, when executed by a processor, to cause any method or step or combination thereof of the present disclosure to be performed.

[0008] [Brief description of the drawing] These and other aspects and embodiments thereof are described in more detail in the accompanying drawings, specification and claims.

[0009] Hereinafter, each exemplary embodiment of the present disclosure will be described in detail with reference to the following drawings. The drawings are provided for illustrative purposes and depict only exemplary embodiments of the present disclosure to facilitate understanding of the present disclosure. Therefore, the accompanying drawings should not be considered to limit the breadth, scope, or applicability of the present disclosure. Furthermore, for clarity and ease of explanation, the accompanying drawings may not necessarily be drawn to scale. [Brief explanation of the drawings]

[0010] [Figure 1] 1 illustrates an exemplary wireless communication system in which the methods and / or steps of the present disclosure may be implemented. [Figure 2A] 1 shows a timeslot diagram with multiple PUCCHs before multiplexing. [Figure 2B] 2B shows a time slot diagram with multiple PUCCHs after multiplexing of FIG. 2A. [Figure 3A] 1 shows a timeslot diagram with multiple PUCCHs before multiplexing. [Figure 3B] 3B shows a time slot diagram with multiple PUCCHs after multiplexing in FIG. 3A. [Figure 4A] 1 shows a timeslot diagram with multiple PUCCHs before multiplexing. [Figure 4B] 4B shows a time slot diagram with multiple PUCCHs after multiplexing in FIG. 4A. [Figure 5A] 1 shows a timeslot diagram with multiple PUCCHs before multiplexing. [Figure 5B] 5B shows a time slot diagram with multiple PUCCHs after multiplexing in FIG. 5A. [Figure 6A] 1 shows a timeslot diagram with multiple PUCCHs before multiplexing. [Figure 6B] 6B shows a time slot diagram with multiple PUCCHs after multiplexing in FIG. 6A. DETAILED DESCRIPTION OF THE INVENTION

[0011] 1 illustrates a block diagram of an exemplary wireless communication system 150 in accordance with some embodiments of the present disclosure. System 150 may perform various methods / steps disclosed in the present disclosure. System 150 may include components and elements configured to support operational characteristics not required to be described in detail herein.

[0012] The system 150 may include a BS 102 and a UE 104. The BS 102 includes a BS transceiver or transceiver module 152, a BS antenna system 154, a BS memory or memory module 156, a BS processor or processor module 158, and a network interface 160. The components of the BS 102 are electrically coupled to and communicatively connected with each other via a data communication bus 180, as needed. Similarly, the UE 104 includes a UE transceiver or transceiver module 162, a UE antenna system 164, a UE memory or memory module 166, a UE processor or processor module 168, and an input / output (I / O) interface 169. The components of the UE 104 are electrically coupled to and communicatively connected with each other via a data communication bus 190, as needed. The BS 102 communicates with the UE 104 via a communication channel 192, which may be any wireless channel or other medium known in the art suitable for transmitting data as described herein.

[0013] As will be appreciated by those skilled in the art, system 150 may further include any number of modules other than those illustrated in FIG. 1 . As will be appreciated by those skilled in the art, the various illustrative frames, modules, circuits, and processing logic described with reference to the embodiments disclosed herein may be implemented in hardware, computer-readable software, firmware, or any executable combination thereof. To clearly illustrate the compatibility and interchangeability of such hardware, firmware, and software, each illustrative element, block, module, circuit, and step is described substantially in terms of its functionality. Whether such functionality is implemented as hardware, firmware, or software depends on the particular application and design constraints imposed on the overall system. While those familiar with the concepts described herein will be able to implement such functionality in an appropriate manner for each particular application, such implementation decisions should not be construed as limiting the scope of the present disclosure.

[0014] Wireless transmissions from the UE 104's transmit antennas (for convenience, referred to as singular, but which may include multiple antennas) to the BS 102's receive antennas (for convenience, referred to as singular, but which may include multiple antennas) are referred to as uplink (UL) transmissions, and wireless transmissions from the BS 102's transmit antennas to the UE 104's receive antennas are referred to as downlink (DL) transmissions. According to some embodiments, the UE transceiver 162 may be referred to herein as an "uplink" transceiver 162, which includes RF transmitter and receiver circuitry systems, both coupled to the UE antenna 164. A duplexer (not shown) may alternatively couple the uplink transmitter or receiver to the uplink antenna in a time division duplexing manner. Similarly, according to some embodiments, the BS transceiver 152 may be referred to herein as a "downlink" transceiver 152, which includes RF transmitter and receiver circuitry systems, both coupled to the antenna array 154. The downlink duplexer can alternatively couple the downlink transmitter or receiver to the downlink antenna array 154 in a time division duplex manner. By time-coordinating the operation of the two transceivers 152 and 162, the uplink receiver is coupled to the uplink UE antenna 164 and receives transmissions over the wireless communication channel 192 at the same time that the downlink transmitter is coupled to the downlink antenna array 154. There is tightly synchronized timing with only a minimal guard time between duplex direction switches. The UE transceiver 162 communicates with the BS 102 over the wireless communication channel 192 using the UE antenna 164. The BS transceiver 152 communicates with another BS (e.g., the second BS 102-2) over the wireless communication channel 192 using the BS antenna 154 of the BS (e.g., the first BS 102). The wireless communication channel 196 may be any wireless channel or other medium known in the art suitable for direct communication between BSs.

[0015] The UE transceiver 162 and the BS transceiver 152 are configured to communicate over a wireless data communication channel 192 and cooperate with appropriately configured RF antenna arrangements 154 / 164 capable of supporting a particular wireless communication protocol and modulation scheme. In some exemplary embodiments, the UE transceiver 162 and the BS transceiver 152 are configured to support industry standards, such as Long-Term Evolution (LTE) and Fifth Generation (5G) standards (e.g., New Radio (NR)). However, it should be understood that the present invention is not necessarily limited in application to any particular standard and associated protocol. Conversely, the UE transceiver 162 and the BS transceiver 152 may be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.

[0016] Processor modules 158 and 168 may be implemented or realized using a general purpose processor, content access memory, digital signal processor, application specific integrated circuit, field programmable gate array, any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, designed to perform the functions described herein. As such, a processor module may be realized as a microprocessor, controller, microcontroller, state machine, etc. A processor module may also be implemented as a combination of computing devices, such as a combination of a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors in combination with a digital signal processor core, or any other such configuration.

[0017] Additionally, the steps incorporating the methods or algorithms described in the embodiments disclosed herein may be implemented directly in hardware, firmware, in software modules executed by processor modules 158 and 168, respectively, or in any executable combination thereof. Memory modules 156 and 166 may be implemented as Random Access Memory (RAM) memory, flash memory, Electrically Erasable Programmable Read-Only Memory (EEPROM) memory, registers, Read-Only Memory (ROM) memory, Erasable Programmable Read-Only Memory (EPROM) memory, hard disk, removable disk, Compact Disc Read-Only Memory (CD-ROM), or any other form of storage medium known in the art. In this aspect, memory modules 156 and 166 are coupled to processor modules 158 and 168, respectively, such that processor modules 158 and 168 can read information from and write information to memory modules 156 and 166, respectively. Memory modules 156 and 166 may also be integrated into their respective processor modules 158 and 168. In some embodiments, memory modules 156 and 166 may both include cache memory, which is used to store intermediate variables or other intermediate information when processor modules 158 and 168, respectively, execute instructions to be executed. Memory modules 156 and 166 may also both include non-volatile memory, which is used to store instructions to be executed by processor modules 158 and 168, respectively.

[0018] Network interface 160 generally represents hardware, software, firmware, processing logic, and / or other components of base station 102 that enable bidirectional communication between BS transceiver 152 and other network components or communication nodes configured to communicate with BS 102. For example, network interface 160 may be configured to support Internet or WiMAX services. In a typical, but non-limiting, configuration, network interface 160 provides an 802.3 Ethernet interface, allowing BS transceiver 152 to communicate with conventional Ethernet-based computer networks. As such, network interface 160 may include a physical interface for connecting to a computer network (e.g., a Mobile Switching Center (MSC)) or one or more core networks for mobile communications. As used herein, the terms "configured to use" or "configured" with respect to a given operation or function refer to a device, component, circuit, structure, equipment, signal, etc. that is physically constructed, programmed, formatted, and / or arranged to perform the given operation or function. The network interface 160 may allow the BS 102 to communicate with other BSs or a Core Network (CN) via wired or wireless connections.

[0019] The Physical Uplink Control Channel (PUCCH) carries a set of information, "Uplink Control Information (UCI)." Depending on the type of information carried by the UCI in the PUCCH, the PUCCH is classified into several formats. The content of the UCI may include, for example, channel quality information, confirmation, and scheduling request. Repeated PUCCH transmission can improve the reliability and coverage of the PUCCH. The repetition technique allows the UE to repeatedly transmit the same or similar PUCCH, ensuring that the BS receives accurate information to manage signaling between the BS and the UE. The PUCCH repetition factor controls the number of times the PUCCH is repeated within a period. The PUCCH repetition factor N may be set or indicated, typically 2, 4, or 8. The number of repetitions may be a predetermined factor between the BS and the UE, or it may be indicated by Radio Resource Control (RRC) signaling. Therefore, after a repeating PUCCH is triggered, the PUCCH is transmitted twice (N=2), four times (N=4) or eight times (N=8) repeatedly, depending on the set or indicated repetition factor.

[0020] For a PUCCH with a repetition factor of N (N>1), the time slot or sub-time slot for transmitting the first PUCCH repetition can be configured or indicated by the UE transmitting the PUCCH. In a Time Division Duplex (TDD) cell, the time slots for the remaining PUCCH repetitions can be determined based on at least one or more of the following rules: If an UL symbol or flexible symbol can be provided in the time slot, the UL symbol or flexible symbol is of the same type as the starting symbol configured for the PUCCH (e.g., has the same symbol index within the time slot) and / or consecutive subsequent UL symbols or flexible symbols can be provided in the time slot from the UL symbol or flexible symbol, and the total number of UL symbols or flexible symbols is equal to or greater than the number of symbols configured for the PUCCH (having enough space / symbols for the PUCCH configuration). Then, time slots that meet the requirements can be determined iteratively for the remaining PUCCH.

[0021] According to an embodiment of the present disclosure, when a PUCCH with repetition overlaps in the time domain with other PUCCHs (with or without repetition) in the time domain, various embodiments propose and discuss UCI multiplexing between these PUCCHs, where the overlapping PUCCHs have the same or different types of UCI.

[0022] Example 1 For example, in a timeslot, when one or more PUCCHs are scheduled or configured to start from the same timeslot, UCI multiplexing can be introduced. The multiplexing can be further conditioned on these PUCCHs having overlap in the time domain in the timeslot. The multiplexing can be further conditioned on these PUCCHs having the same repetition factor N (where N is an integer greater than 1). In one embodiment, when all the above conditions are met, UCI multiplexing can be performed on UCIs in these PUCCHs from or in the same timeslot, and a PUCCH can be obtained as a result of the multiplexing and transmitted N times repeatedly. The repetition factor N here may be, but is not necessarily, equal to, the maximum repetition factor among the repetition factors of these PUCCHs participating in UCI multiplexing.

[0023] For example, a PUCCH with a repetition factor N1 (N1>1) is configured or scheduled to start from time slot n, and one or more PUCCHs with a repetition factor N2 (N2>1) are also configured or scheduled to start from time slot n, where N1=N2. These PUCCHs overlap in the time domain. UCI multiplexing can be performed on the UCIs in these PUCCHs, and then a multiplexed PUCCH can be obtained.

[0024] UCI types on multiplexed PUCCH According to one embodiment, the type of UCI may be a factor in determining whether to perform UCI multiplexing or PUCCH multiplexing. According to one embodiment, PUCCH multiplexing is performed on the condition that the UCI types in the PUCCHs participating in UCI multiplexing are the same. For example, the type of UCI may be defined according to the content it carries. For example, PUCCHs carrying a delivery acknowledgement (HARQ-ACK), channel status information (CSI), or scheduling request (SR) may be defined as different types of PUCCHs.

[0025] Alternatively or additionally, the types of UCI in the PUCCH participating in UCI multiplexing may be different (or different from each other). For example, PUCCH multiplexing may be performed between HARQ-ACK PUCCH and SR PUCCH, between HARQ-ACK PUCCH and CSI PUCCH, between HARQ-ACK PUCCH, SR PUCCH and CSI PUCCH, or between SR PUCCH and CSI PUCCH.

[0026] Alternatively or additionally, the PUCCHs participating in the multiplexing include UCI of the same type (e.g., a first type) and also include UCI of a different type (e.g., a second type). In this way, PUCCHs with the same type of UCI are first multiplexed as a set, and then one or more intermediate resultant PUCCHs are obtained. Then, two or more intermediate resultant PUCCHs are multiplexed with each other to obtain a final resultant PUCCH. Alternatively or additionally, one or more intermediate resultant PUCCHs can be multiplexed with original PUCCHs that have not been multiplexed with the different UCI types to generate a final resultant PUCCH.

[0027] Result PUCCH repetition factor According to this embodiment, the resulting PUCCH can be used for PUCCH repetition, which means that the resulting PUCCH can be transmitted multiple times as PUCCH repetition.

[0028] Exemplarily, the repetition factor of the resulting PUCCH may be equal to the maximum repetition factor among the repetition factors of the PUCCHs participating in UCI multiplexing. For example, according to this example, when one PUCCH (N=2) and another PUCCH (N=4) participate in multiplexing, the resulting PUCCH has a repetition factor of N=4, which means that the resulting PUCCH is transmitted four times. If the PUCCHs participating in UCI multiplexing all have the same repetition factor, the repetition factor of the resulting PUCCH is equal to the same repetition factor.

[0029] According to one embodiment, the resulting PUCCH may be one of the PUCCHs participating in the UCI multiplexing. Alternatively or additionally, the resulting PUCCH may be different from the PUCCHs participating in the UCI multiplexing.

[0030] Alternatively or additionally, the repetition factor of the resulting PUCCH may be a repetition factor specifically set for the PUCCH resource corresponding to the resulting PDCCH. For example, a repetition factor may be set for each PUCCH resource in a PUCCH resource set. When UCI multiplexing is performed, one PUCCH resource in the PUCCH resource set can be selected as the resulting PUCCH. This selection can be based on the sum of the sizes of the multiplexed UCIs. Therefore, the repetition factor of the resulting PUCCH is equal to the repetition factor set for the (determined) PUCCH. In this way, if a repetition factor is not set for the PUCCH resource selected for the multiplexed resulting PUCCH, the multiplexed resulting PUCCH may have no repetition factor.

[0031] PUCCH repetition timeslot The time slot for transmitting the first repetition of the resulting PUCCH may be a time slot determined by the UE, which may be the first time slot scheduled for the PUCCH that first participates in multiplexing. The time slots used for the remaining PUCCH repetitions of the resulting PUCCH may be determined according to the following rules:

[0032] A UL symbol or a flexible symbol can be provided in a time slot, and the UL symbol or flexible symbol is the same as the starting symbol configured for the resulting PUCCH (e.g., has the same symbol index). In a time slot, consecutive UL symbols or flexible symbols can be provided from the UL symbol or flexible symbol, and the number of consecutive UL symbols or flexible symbols is equal to or greater than the number of symbols configured for the resulting PUCCH. With this implementation, a time slot that satisfies the above condition can be determined to transmit the remaining repetitions of the resulting PUCCH.

[0033] In some cases, the PUCCH format and / or symbol position of the resultant PUCCH may be different from that of the PUCCH initially participating in UCI multiplexing, so the time slots of the remaining repetitions determined based on the PUCCH participating in UCI multiplexing are ignored. The start symbol and number of symbols of the resultant PUCCH can be used to determine the time slots of the remaining repetitions.

[0034] UCI multiplexing in time slots In some examples, UCIs can be divided into two or more types, such as UCIs with high physical layer priority or UCIs with low physical layer priority. First, UCI multiplexing may be performed on PUCCHs with UCIs having the same physical layer priority to obtain an intermediate result PUCCH. Then, UCI multiplexing may be performed between intermediate result PUCCHs with UCIs of different physical layer priorities (including the result PUCCH output in the previous step). For example, UCIs with higher priorities may be multiplexed to obtain a first intermediate result PUCCH, and UCIs with lower priorities may be multiplexed to obtain a second intermediate result PUCCH. Then, to obtain a final result PUCCH of the PUCCH iteration, the first intermediate result PUCCH may be multiplexed with the second intermediate result PUCCH. If there is only one UCI of any type, the initial step of multiplexing UCIs may be skipped. The intermediate result PUCCH of another type may be further multiplexed with only one UCI of a different type. Several examples of different cases are provided below.

[0035] Case 1: UCIs participating in PUCCH only have the same physical layer priority In this case, the PUCCHs participating in the UCI multiplexing have the same repetition factor and overlap in the time domain. If the UCIs in the PUCCH have the same physical layer priority (e.g., high priority or low priority), the UCI bits in the PUCCH may be cascaded to obtain an intermediate bit sequence A. Then, the bit sequence A may be coded and modulated to obtain the resulting data (multiplexed UCI) transmitted on the PUCCH. Alternatively and additionally, the coding and modulation may be associated with CRC (cyclic redundancy) check coding and modulation to allow the receiver to perform a CRC check.

[0036] Alternatively or additionally, if bit sequence A is 1 to 2 bits, bit sequence A can be directly modulated to a promised sequence based on the format of the resulting PUCCH (e.g., PUCCH format 1) (no further coding is required), and the sequence modulated from bit sequence A is the data transmitted in the resulting PUCCH.

[0037] Alternatively or additionally, if bit sequence A is 1 to 2 bits, a sequence can be obtained by looking up a predefined table based on the value of bit sequence A and the format of the resulting PUCCH (e.g., PUCCH format 0), and the sequence obtained based on the value looked up from the table is the data transmitted in the resulting PUCCH. In these two cases, CRC check modulation can be skipped.

[0038] In either case above or in this disclosure, if the sequence A is greater than two bits, CRC check modulation or coding can be performed.

[0039] Case 2: UCIs in two PUCCHs have different physical layer priorities in one timeslot When UCIs in a PUCCH participating in UCI multiplexing have different physical layer priorities (e.g., high priority and low priority), UCI bits with different physical layer priorities may be coded and modulated to obtain transmission data in the resulting PUCCH. The modulation and coding may include CRC check coding and modulation.

[0040] For example, if UCI in PUCCH1 with repetition factor N1 has a high physical layer priority and UCI in PUCCH2 with repetition factor N1 has a low physical layer priority, UCI in PUCCH1 may be coded and modulated (optionally including CRC check coding and modulation) to obtain transmission data 1. UCI in PUCCH2 may be coded and modulated (optionally including CRC check coding and modulation) to obtain transmission data 2. Data 1 and Data 2 may be mapped to the same resultant PUCCH in a predetermined order to form a resultant PUCCH with resultant UCI.

[0041] Optionally, if the number of bits of the UCI is greater than 2 bits, CRC check coding or modulation can be added.

[0042] Case 3: UCIs in PUCCH have the same and different physical layer priorities in one timeslot In this case, the PUCCHs participating in UCI multiplexing have the same repetition factor and overlap in the time domain. PUCCHs have UCIs with different physical layer priorities, but the priorities of some UCIs may be the same as other (but not all) UCIs in the PUCCHs participating in the multiplexing. For example, UCIs in some of these PUCCHs have high physical layer priorities, and UCIs in the remaining PUCCHs have low physical layer priorities, and UCI multiplexing can be performed in the following manner:

[0043] There may be one or more PUCCHs for UCIs with high physical layer priorities. There may also be one or more PUCCHs for UCIs with low physical layer priorities. Therefore, if a UCI with one physical layer priority includes multiple PUCCHs, UCI multiplexing may be performed based on multiple PUCCHs each having the same physical layer priority to obtain an intermediate result PUCCH. Alternatively, if a UCI with one physical layer priority has only one PUCCH, this step may be skipped. Skipping this step means that no intermediate result PUCCH is generated for this physical layer priority. A single original PUCCH may be multiplexed with intermediate result PUCCHs generated for other physical layer priorities.

[0044] Specifically, first, UCI multiplexing is performed among PUCCHs of UCIs having the same high or low physical layer priority (assuming there are multiple PUCCHs having the same high or low physical layer priority), and one or more intermediate result PUCCHs can be obtained. If there is only one PUCCH of a UCI having low or high physical layer priority, there will be only one intermediate result PUCCH.

[0045] Then, UCI multiplexing may be performed between the intermediate result PUCCHs or between one intermediate result PUCCH and a single original PUCCH of its own physical layer priority to obtain a final result UCI to be transmitted as a final result PUCCH, which is transmitted from time slot n.

[0046] For example, the physical layer priority of the resulting PUCCH may be equal to the highest physical layer priority of the physical layer priorities of the UCIs participating in the UCI multiplexing. For example, when both high-priority and low-priority UCIs participate in the multiplexing, the physical layer priority of the resulting UCI of the resulting PUCCH may be the high physical layer priority.

[0047] 2A as an example, PUCCH1 and PUCCH2 are scheduled and configured to start transmission from or in the first time slot. Both PUCCH1 and PUCCH2 have the same repetition factor N (N=2), and PUCCH1 and PUCCH2 overlap in the time domain and fill the multiplexing timeline in the first time slot. If the above conditions are met, UCI may be multiplexed with UCI-1 in PUCCH1 and UCI-2 in PUCCH2 to obtain the resulting UCI.

[0048] The UCI-1 bits in PUCCH1 and the UCI-2 bits in PUCCH2 may be cascaded to obtain the bit sequence UCI-1-2. Assuming the number of UCI-1-2 bits is greater than 2, UCI-1-2 can be coded and modulated (including a CRC check mechanism) and then mapped to the resulting PUCCH for transmission.

[0049] 2B shows the multiplexing result of PUCCH1 and PUCCH2 in FIG. 1A. Since PUCCH1 and PUCCH2 both have the same PUCCH repetition factor, the repetition factor N of the multiplexed PUCCH may be determined to be equal to the repetition factor of PUCCH1 or PUCCH2. The multiplexed PUCCH may be transmitted from the first time slot and may be repeated a total of two times.

[0050] Example 2 In this embodiment, the prerequisites for PUCCH multiplexing include that one or more PUCCHs are scheduled or configured to start from the same time slot, that these PUCCHs overlap in the time domain in the time slot, and that at least one of these PUCCHs has a repetition factor greater than 1. If the conditions are met, UCI multiplexing can be performed on UCIs in these PUCCHs from or in the same time slot. The resulting PUCCH is obtained and transmitted repeatedly N times, where N may be equal to the maximum repetition factor among the repetition factors of these PUCCHs participating in UCI multiplexing.

[0051] UCI types on multiplexed PUCCH According to one embodiment, the type of UCI may be a factor in determining whether to perform UCI multiplexing or PUCCH multiplexing. According to one embodiment, PUCCH multiplexing is performed on the condition that the UCI types in the PUCCHs participating in UCI multiplexing are the same. For example, the type of UCI can be defined by the content it carries. For example, the PUCCH carries an acknowledgement (HARQ-ACK), channel state information (CSI), or a scheduling request (SR).

[0052] Alternatively or additionally, the UCI types in the PUCCHs participating in UCI multiplexing may be different (or different from each other). For example, PUCCH multiplexing may be performed between HARQ-ACK PUCCH and SR PUCCH, between HARQ-ACK PUCCH and CSI PUCCH, between HARQ-ACK PUCCH, SR PUCCH and CSI PUCCH, or between SR PUCCH and CSI PUCCH.

[0053] Alternatively or additionally, the PUCCHs participating in multiplexing include UCI of the same type (e.g., a first type) and also include UCI of a different type (e.g., a second type). In this way, PUCCHs with the same type of UCI are first multiplexed as a set, and then one or more intermediate multiplexed PUCCHs are obtained. Then, two or more intermediate multiplexed PUCCHs are multiplexed with each other to obtain a final PUCCH. Alternatively or additionally, one or more intermediate PUCCHs can be multiplexed with original PUCCHs that have not been multiplexed with the different UCI types to generate a final PUCCH.

[0054] Result PUCCH repetition factor According to the present disclosure, the resulting PUCCH can be used for PUCCH repetition, which means that the resulting PUCCH can be transmitted multiple times as PUCCH repetition.

[0055] Exemplarily, the repetition factor of the resulting PUCCH may be equal to the maximum repetition factor among the repetition factors of the PUCCHs participating in UCI multiplexing. For example, according to this example, when one PUCCH (N=2) and another PUCCH (N=4) participate in multiplexing, the resulting PUCCH has a repetition factor of N=4, which means that the resulting PUCCH is transmitted four times. If the PUCCHs participating in UCI multiplexing all have the same repetition factor, the repetition factor of the resulting PUCCH is equal to the same repetition factor.

[0056] In some cases, UCI in a PUCCH without a repetition factor is actually transmitted repeatedly, with the number of repetitions being equal to the repetition factor of the resulting PUCCH, since the resulting PUCCH has a repetition factor greater than one.

[0057] Alternatively or additionally, the repetition factor of the resulting PUCCH may be a repetition factor specifically set for the PUCCH resource corresponding to the resulting PDCCH. For example, a repetition factor may be set for each PUCCH resource in a PUCCH resource set. When UCI multiplexing is performed, one PUCCH resource in the PUCCH resource set is selected as the resulting PUCCH. This selection may be based on the sum of the sizes of the multiplexed UCIs. Therefore, the repetition factor of the multiplexed resulting PUCCH is equal to the repetition factor set for the (determined) PUCCH. In this way, if a repetition factor is not set for the PUCCH resource selected for the multiplexed resulting PUCCH, the multiplexed resulting PUCCH may have no repetition factor.

[0058] In some cases, the resultant PUCCH may be one of the PUCCHs participating in the UCI multiplexing, or may be a new PUCCH different from the PUCCHs participating in the UCI multiplexing.

[0059] PUCCH repetition timeslot The time slot for transmitting the first repetition of the resulting PUCCH may be a time slot determined by the UE, which may be the first time slot scheduled for the PUCCH that first participates in multiplexing. The time slots used for the remaining PUCCH repetitions of the resulting PUCCH may be determined according to the following rules:

[0060] A UL symbol or a flexible symbol can be provided in the time slot, and the UL symbol or flexible symbol is the same as the starting symbol configured for the resulting PUCCH (e.g., has the same symbol index). In the time slot, consecutive UL symbols or flexible symbols can be provided from the UL symbol or flexible symbol, and the number of consecutive UL symbols or flexible symbols is equal to or greater than the number of symbols configured for the resulting PUCCH. With this implementation, time slots that satisfy all, some, or at least one of the above conditions can be determined to transmit the remaining repetitions of the resulting PUCCH.

[0061] In some cases, the PUCCH format and / or symbol position of the resultant PUCCH may be different from that of the PUCCH initially participating in UCI multiplexing, so the time slots of the remaining repetitions determined based on the PUCCH participating in UCI multiplexing are ignored. The start symbol and number of symbols of the resultant PUCCH can be used to determine the time slots of the remaining repetitions.

[0062] UCI multiplexing in time slots In some examples, UCIs can be divided into two types, such as UCIs with high physical layer priority and UCIs with low physical layer priority. First, UCI multiplexing may be performed on PUCCHs with UCIs having the same physical layer priority to obtain an intermediate result PUCCH. Second, UCI multiplexing may be performed between intermediate result PUCCHs with UCIs of different physical layer priorities (including the result PUCCH output in the previous step). For example, UCIs with higher priorities may be multiplexed to obtain a first intermediate result PUCCH, and UCIs with lower priorities may be multiplexed to obtain a second intermediate result PUCCH. Then, to obtain a final result PUCCH of the PUCCH iteration, the first intermediate result PUCCH may be multiplexed with the second intermediate result PUCCH. If there is only one UCI of either type, the initial step of multiplexing UCIs may be skipped. The intermediate result PUCCH of another type may be multiplexed with only one UCI of a different type. Several examples of different cases are provided below.

[0063] Case 1: UCIs in PUCCH only have the same physical layer priority in one timeslot In this case, for PUCCHs participating in UCI multiplexing, some PUCCHs have the same repetition factor, and other PUCCHs have different repetition factors. If the UCIs in a PUCCH have the same physical layer priority (e.g., high priority or low priority), the UCI bits in the PUCCH may be cascaded to obtain an intermediate bit sequence A, and then the bit sequence A may be coded and modulated to obtain the resulting data (multiplexed UCI) transmitted on the PUCCH. Alternatively and additionally, the coding and modulation may be associated with CRC (cyclic redundancy) check coding and modulation to allow the receiver to perform a CRC check.

[0064] Alternatively or additionally, if bit sequence A is 1 to 2 bits, bit sequence A can be directly modulated into a promised sequence based on the format of the resulting PUCCH (e.g., PUCCH format 1), so that the sequence modulated from bit sequence A is the data transmitted in the resulting PUCCH.

[0065] Alternatively or additionally, if bit sequence A is 1 to 2 bits, a sequence can be obtained by looking up a predefined table based on the value of bit sequence A and the format of the resulting PUCCH (e.g., PUCCH format 0). The obtained sequence may be the data transmitted in the resulting PUCCH. In both of these cases, there is no need to add a CRC check. If bit sequence A is greater than 2 bits, a CRC check may be added to bit sequence A.

[0066] Case 2: UCIs in two PUCCHs have different physical layer priorities in one timeslot If the UCIs in the two PUCCHs have different physical layer priorities (e.g., high priority and low priority), the UCI bits with different physical layer priorities may be coded and modulated to obtain the transmission data in the resulting PUCCH. The coding and modulation may include CRC check coding and modulation.

[0067] For example, if UCI in PUCCH1 with a repetition factor of N1 has a high physical layer priority and UCI in PUCCH2 with a repetition factor of N2 has a low physical layer priority, the UCI in PUCCH1 may be coded and modulated (optionally including CRC check coding and modulation) to obtain transmission data 1, and the UCI in PUCCH2 may be coded and modulated (optionally including CRC check coding and modulation) to obtain transmission data 2. Then, data 1 and data 2 may be mapped to the same resultant PUCCH in a predetermined order to form a resultant PUCCH having the resultant UCI.

[0068] Optionally, if the number of bits of the UCI is greater than 2 bits, CRC check coding or modulation can be added.

[0069] Case 3: UCIs in PUCCH have the same and different physical layer priorities in one timeslot In this case, UCIs in some PUCCHs among the PUCCHs participating in UCI multiplexing have high physical layer priority, and UCIs in the remaining PUCCHs have low physical layer priority.

[0070] There may be one or more PUCCHs for UCIs with high physical layer priorities. Similarly, there may be one or more PUCCHs for UCIs with low physical layer priorities. Therefore, if a UCI with one physical layer priority includes multiple PUCCHs, UCI multiplexing may be performed on the multiple PUCCHs to obtain an intermediate result PUCCH. On the other hand, if a UCI with one physical layer priority includes only one PUCCH, this step may be skipped. If this step is skipped, no intermediate result PUCCH is generated for this physical layer priority. A single original PUCCH may be multiplexed with intermediate result PUCCHs generated for other physical layer priorities.

[0071] Specifically, first, UCI multiplexing is performed among PUCCHs of UCIs having the same high or low physical layer priority (assuming there are multiple PUCCHs having the same high or low physical layer priority), and one or more intermediate result PUCCHs can be obtained. If there is only one PUCCH of a UCI having low or high physical layer priority, there will be only one intermediate result PUCCH.

[0072] Then, UCI multiplexing may be performed between intermediate result PUCCHs with UCIs of different physical layer priorities that overlap in the time domain, or between one intermediate result PUCCH and a single original PUCCH of its own physical layer priority, to obtain a final result UCI and transmit it as a final result PUCCH, which may be multiple non-overlapping PUCCHs in the time domain.

[0073] For example, the physical layer priority of the resulting PUCCH may be equal to the highest physical layer priority of the physical layer priorities of the UCIs participating in the UCI multiplexing. For example, when both high-priority and low-priority UCIs participate in the multiplexing, the physical layer priority of the resulting UCI of the resulting PUCCH may be the high physical layer priority.

[0074] Referring to Figure 3A, PUCCH1, PUCCH2, PUCCH3, and PUCCH4 are scheduled or configured to start transmission from the first time slot. PUCCH1, PUCCH2, PUCCH3, and PUCCH4 overlap each other in the time domain and complete the multiplexing timeline in the first time slot. If the above conditions are met, UCI multiplexing can be performed for UCI within these PUCCHs. Furthermore, PUCCH1 and PUCCH2 have the same repetition factor of 2. PUCCH3 and PUCCH4 have a repetition factor of 1. In other words, PUCCH3 and PUCCH4 do not have a repetition factor and will not be repeatedly transmitted if they do not participate in multiplexing. In this example, it is assumed that these PUCCHs have the same physical layer priority.

[0075] When multiplexing is performed, the UCI bits corresponding to PUCCH1, PUCCH2, PUCCH3, and PUCCH4 are cascaded to obtain the bit sequence UCI-1-2-3-4 in the first time slot (assuming the number of bits in UCI-1-2-3-4 is greater than 2). UCI-1-2-3-4 may be added with a CRC check before being coded and modulated. UCI-1-2-3-4 can then be mapped to the resulting PUCCH for transmission.

[0076] 3B shows the resultant PUCCH in the first time slot of the superimposed PUCCH in FIG. 3A. The repetition factor N of the resultant PUCCH can be determined to be equal to the repetition factor of PUCCH1 or PUCCH2, because this repetition factor is the largest among the PUCCHs participating in UCI multiplexing. The resultant PUCCH is transmitted from the first time slot and may be repeated a total of two times. Compared to the UCI before multiplexing, the UCI of PUCCH3 and PUCCH4 is transmitted once more.

[0077] Referring to FIG. 4A as another example, PUCCH1, PUCCH2, PUCCH3, and PUCCH4 are scheduled or configured to start transmission from the first time slot, and PUCCH1, PUCCH2, PUCCH3, and PUCCH4 overlap in the time domain and fill the multiplexing timeline in the first time slot. If the above conditions are met, UCI multiplexing can be performed for UCI within these PUCCHs. Furthermore, PUCCH1 here has the same repetition factor of 4, and PUCCH2 has the same repetition factor of 2. PUCCH3 and PUCCH4 have a repetition factor of 1, which means that PUCCH3 and PUCCH4 have no repetition factor and are not repeatedly transmitted. Here, it is assumed that these PUCCHs have the same physical layer priority. Details are as follows:

[0078] To perform the multiplexing, the UCI bits corresponding to PUCCH1, PUCCH2, PUCCH3, and PUCCH4 may be cascaded to obtain a bit sequence UCI-1-2-3-4 in the first time slot (assuming the number of bits in UCI-1-2-3-4 is greater than 2). UCI-1-2-3-4 may be added with a CRC check, and then coded and modulated. UCI-1-2-3-4 can then be mapped to the multiplexed PUCCH for transmission.

[0079] 4B shows the multiplexing result of the superimposed PUCCHs in the first time slot of FIG. 4A. The repetition factor N of the multiplexed PUCCH can be determined to be equal to the repetition factor of PUCCH1, because this repetition factor is the largest among the PUCCHs participating in UCI multiplexing. The multiplexed PUCCH is transmitted starting from the first time slot and may be repeated a total of four times. Therefore, the UCI of PUCCH2 is transmitted twice, and the UCI of PUCCH3 and PUCCH4 is transmitted three times.

[0080] Example 3 Example 3 may be an improvement based on Example 2, but UCI multiplexing may be performed on a time slot basis. UCI multiplexing is performed in each time slot based on the superposition of a specific PUCCH in each time slot. In Example 2, the UCI multiplexing result is determined in the first time slot, and then the UCI multiplexing result is repeated in the starting time slot and subsequent time slots until the correct number of PUCCH repetitions is transmitted, thereby forming PUCCH repetitions.

[0081] In this embodiment, the prerequisites for PUCCH multiplexing include that one or more PUCCHs are scheduled or configured to start from (the same) timeslot, that these PUCCHs overlap in the time domain in the timeslot, and that at least one of these PUCCHs has a repetition factor greater than 1. If the above conditions are met, UCI multiplexing can be performed for UCIs in these PUCCHs from or in (the same) timeslot.

[0082] UCI types on multiplexed PUCCH According to one embodiment, the type of UCI may be a factor in determining whether to perform UCI multiplexing or PUCCH multiplexing. According to one embodiment, PUCCH multiplexing is performed on the condition that the UCI types in the PUCCHs participating in UCI multiplexing are the same. For example, the type of UCI can be defined by the content it carries. For example, the PUCCH carries an acknowledgement (HARQ-ACK), channel state information (CSI), or a scheduling request (SR).

[0083] Alternatively or additionally, the UCI types in the PUCCHs participating in UCI multiplexing may be different (or different from each other). For example, PUCCH multiplexing may be performed between HARQ-ACK PUCCH and SR PUCCH, between HARQ-ACK PUCCH and CSI PUCCH, between HARQ-ACK PUCCH, SR PUCCH and CSI PUCCH, or between SR PUCCH and CSI PUCCH.

[0084] Alternatively or additionally, the PUCCHs participating in multiplexing include UCI of the same type (e.g., a first type) and also include UCI of a different type (e.g., a second type). In this way, PUCCHs with the same type of UCI are first multiplexed as a set, and then one or more intermediate multiplexed PUCCHs are obtained. Then, two or more intermediate multiplexed PUCCHs are multiplexed with each other to obtain a final PUCCH. Alternatively or additionally, one or more intermediate PUCCHs can be multiplexed with original PUCCHs that have not been multiplexed with the different UCI types to generate a final PUCCH.

[0085] Result PUCCH repetition factor In this embodiment, UCI multiplexing is performed on a time slot basis, so that the resulting PUCCH is transmitted in its own time slot. The repetition factor of the resulting PUCCH is 1, that is, the resulting PUCCH has no repetition factor. In the next or subsequent time slot, UCI multiplexing can be performed again for UCI, and the same multiplexing result can be obtained if the PUCCHs participating in UCI multiplexing are not changed. Otherwise, the original participating PUCCHs may be different, so the multiplexing result in the next time slot may be different.

[0086] Also, the resultant PUCCH may be one of the PUCCHs participating in UCI multiplexing, or alternatively, the resultant PUCCH may be a new PUCCH different from the PUCCHs participating in UCI multiplexing.

[0087] PUCCH repetition timeslot In this embodiment, UCI multiplexing is performed on a time slot basis, so the resulting PUCCH is transmitted in its own time slot. The repetition factor of the resulting PUCCH is 1, that is, the resulting PUCCH has no repetition factor. There is no need to specifically allocate time slots to repetitions. Therefore, the time slots of the remaining repetitions determined based on the PUCCHs participating in UCI multiplexing can be ignored.

[0088] UCI multiplexing in time slots In some examples, UCI can be divided into two types, such as UCI with high physical layer priority or UCI with low physical layer priority. The PUCCHs of UCIs may have the same or different repetition factors. Multiplexing can be performed based on the following exemplary methods.

[0089] Method 1 S11: First, UCI multiplexing is performed on the PUCCHs of UCIs within the same physical layer priority.

[0090] S11-1: One or more UCI bit sequences H1, H2, H3, ... H for different repetition factorsi UCIs in PUCCHs with high physical layer priorities and the same repetition factor may be cascaded to obtain H1 (where i is the number of UCI bit sequences and i is equal to the number of different repetition factors of UCIs with high physical layer priorities), respectively. For example, if the PUCCH in a timeslot has a repetition factor N equal to 2 or 4 for high-priority UCIs, UCIs with high priorities of N=2 are cascaded to obtain H1, and the remaining UCIs with high priorities of N=4 are cascaded to obtain H2. If there are no high-priority UCIs, this step may be skipped. In another example, if there is only one PUCCH with a specific repetition factor, such as N=1 (for example), this step may be skipped for that repetition factor (N=1), and this step may be performed only for UCI sets of multiple PUCCHs with the same repetition factor. In one example, the original UCI (N=1) may be H1. In another example, if the only PUCCH has two repetition factors of 2 and 4, the only cascaded sequences are eg H1, H2 (for N=2 and N=4 respectively).

[0091] Optionally, you can split the sequence into H1, H2, H3, ... H i An intermediate result PUCCH can be obtained by mapping the intermediate PUCCHs to PUCCH resources. In this case, the intermediate PUCCHs with different repetition factors can be used in the following steps. For example, the intermediate PUCCHs with different repetition factors can be multiplexed in the following steps:

[0092] Similarly, one or more UCI bit sequences L1, L2, L3...L jTo obtain L1 (where j is the number of UCI bit sequences and j is equal to the number of different repetition factors of UCIs with low physical layer priorities), UCIs in PUCCHs with low physical layer priorities and the same repetition factor may be cascaded. For example, if the PUCCH in a timeslot has a repetition factor N equal to 2 or 4 for low-priority UCIs, UCIs with low priorities with N=2 are cascaded to obtain L1, and the remaining UCIs with high priorities with N=4 are cascaded to obtain L2. If there is no low-priority UCI, this step may be skipped. In another example, if there is only one PUCCH with a specific repetition factor, such as N=1 (for example), this step may be skipped for that repetition factor (N=1), and this step may be performed only for UCI sets of multiple PUCCHs with the same repetition factor. In one example, the original UCI may be L1. In another example, if the only PUCCH has two repetition factors of 2 and 4, the cascaded sequences are eg L1, L2 (for N=2 and N=4 respectively).

[0093] Optionally, the sequence L1, L2, L3...L j to the PUCCH resource to obtain an intermediate result PUCCH. In this case, the intermediate PUCCHs with different repetition factors can be used in the following steps. For example, the intermediate PUCCHs with different repetition factors can be multiplexed in the following steps:

[0094] S11-2: If there is a PUCCH with high physical layer priority UCI but with a different repetition factor (optionally including the resulting PUCCH obtained from S11-1), then the sequence H1, H2, H3, ... H i (if obtained from S11-1) to obtain a UCI bit sequence, and record it as sequence E1 (optionally including the resulting PUCCH obtained from S11-1). For example, the resulting sequence H1, H2, H3, ... H iWhen the previous step outputs, these existing sequences are cascaded. Note that if there is only one sequence (only UCI with the same repetition factor in the time slot), this step S11-2 may be skipped for the UCI of that particular priority. If this step is skipped, the sequence E1 is not generated in this step.

[0095] Similarly, if there are PUCCHs with lower physical layer priority UCI but different repetition factors (optionally including the resulting PUCCH obtained from S11-1), L1, L2, L3...L j are cascaded to obtain a UCI bit sequence, which is recorded as the sequence E0. For example, the resulting sequence L1, L2, L3...L j When the previous step outputs, these existing sequences are cascaded. Note that if there is only one sequence (only UCI with the same repetition factor in the time slot), this step S11-2 may be skipped for the UCI of that particular priority. If this step is skipped, the sequence E0 is not generated in this step.

[0096] S11-3: Perform UCI multiplexing on the PUCCHs of UCIs with different physical layer priorities (including the result PUCCHs output in the previous step).

[0097] If E0 and E1 exist (which means that the two priorities each have a UCI with a different repetition factor), E0 and E1 are coded and modulated respectively to obtain the data to be transmitted, and the data (resulting UCI) can be mapped to the final resulting PUCCH for transmission.

[0098] If E1 is present but E0 is not (meaning that the low-priority UCIs have the same repetition factor), then L j (where j=1) and E1 are encoded and modulated (optionally including CRC check encoding).

[0099] If E0 is present but E1 is not, then H i (where i=1) and E0 are encoded and modulated (optionally including CRC check encoding).

[0100] If neither E0 nor E1 is present, then H i and L j (where i and j are equal to 1, which means that the high-priority and low-priority UCIs have the same repetition coefficients).

[0101] In other words, UCIs in the PUCCH in the same time slot are classified based on their physical layer priorities. For each physical layer priority, UCIs in the PUCCH with the same repetition factor are cascaded to form corresponding sequences (sequence H and sequence J) for each repetition factor for each physical layer priority. If there is only one PUCCH with one repetition factor, then, according to one example, a single UCI does not need to be cascaded. Then, for each physical layer priority, sequence H or sequence J is cascaded to form E1 and E0. If there is only one sequence for the physical layer priority, no cascading is performed. Then, to obtain data to be transmitted in the resulting PUCCH in the current time slot, the resulting sequences for each physical layer priority (high-priority sequence H1 or E1 and low-priority sequence L1 or E0) are coded and modulated, respectively. In one example, if all UCIs in the time slot have the same physical layer priority, the steps for the existing physical layer priority only need to be performed, and modulation and coding are performed on the sequences generated for only that physical layer priority.

[0102] Method 2 S12: First, UCI multiplexing is performed on the PUCCHs of UCIs within the same physical layer priority.

[0103] S12-1: One or more UCI bit sequences H1, H2, H3, ... H for different repetition factors i UCIs in PUCCHs with high physical layer priorities and the same repetition factor may be cascaded to obtain H1 (where i is the number of UCI bit sequences and i is equal to the number of different repetition factors of UCIs with high physical layer priorities), respectively. For example, if the PUCCH in a timeslot has a repetition factor N equal to 2 or 4 for high-priority UCIs, UCIs with high priorities of N=2 are cascaded to obtain H1, and the remaining UCIs with high priorities of N=4 are cascaded to obtain H2. If there are no high-priority UCIs, this step may be skipped. In another example, if there is only one PUCCH with a specific repetition factor, such as N=1 (for example), this step may be skipped for that repetition factor (N=1), and this step may be performed only for UCI sets of multiple PUCCHs with the same repetition factor. In one example, the original UCI (N=1) may be H1. In another example, if the only PUCCH has two repetition factors of 2 and 4, the only cascaded sequences are eg H1, H2 (for N=2 and N=4 respectively).

[0104] Optionally, you can split the sequence into H1, H2, H3, ... H i By mapping to PUCCH resources, an intermediate result PUCCH can be obtained.

[0105] Similarly, one or more UCI bit sequences L1, L2, L3...L jTo obtain L1 (where j is the number of UCI bit sequences and j is equal to the number of different repetition factors of UCIs with low physical layer priorities), UCIs in PUCCHs with low physical layer priorities and the same repetition factor may be cascaded. For example, if the PUCCH in a timeslot has a repetition factor N equal to 2 or 4 for low-priority UCIs, UCIs with low priorities with N=2 are cascaded to obtain L1, and the remaining UCIs with high priorities with N=4 are cascaded to obtain L2. If there is no low-priority UCI, this step may be skipped. In another example, if there is only one PUCCH with a specific repetition factor, such as N=1 (for example), this step may be skipped for that repetition factor (N=1), and this step may be performed only for UCI sets of multiple PUCCHs with the same repetition factor. In one example, the original UCI may be L1. In another example, if the only PUCCH has two repetition factors of 2 and 4, the cascaded sequences are eg L1, L2 (for N=2 and N=4 respectively).

[0106] Optionally, the sequence L1, L2, L3...L j The intermediate result PUCCH can be obtained by mapping the PUCCH resource to the PUCCH resource.

[0107] S12-2: If there is a PUCCH with a high physical layer priority UCI but a different repetition factor (optionally including the resulting PUCCH obtained from S12-1), H i Each sequence H in remains unchanged (which means there is no cascading in this example).

[0108] Similarly, if there is a PUCCH (including the obtained result PUCCH) with a lower physical layer priority UCI but with a different repetition factor, L j Each sequence L in remains unchanged (which means there is no cascading in this example).

[0109] S12-3: Perform UCI multiplexing on the PUCCHs of UCIs with different physical layer priorities (optionally including the result PUCCHs output in the previous step).

[0110] To obtain the data to be transmitted, i Each H (if any) and L in j Each L (if any) in is coded and modulated (optionally including CRC check coding and modulation). The obtained data to be transmitted are multiplexed in the same PUCCH.

[0111] example The following PUCCHs overlap in the time domain and have the same starting time slot.

[0112] PUCCH1 and PUCCH2 have a repetition factor of 4 and high physical layer priority; PUCCH3 and PUCCH4 have a repetition factor of 2 and high physical layer priority; PUCCH5 and PUCCH6 have high physical layer priority but no repetition factor (or a repetition factor of 1), PUCCH7 and PUCCH8 have a repetition factor of 4 and low physical layer priority; PUCCH9 and PUCCH10 have a repetition factor of 2 and low physical layer priority, and PUCCH11 and PUCCH12 have low physical layer priority but no repetition factor (or a repetition factor of 1).

[0113] According to the above multiplexing rules, UCI multiplexing can be performed for these PUCCHs in the starting time slot, as follows:

[0114] According to Method 1, performing UCI multiplexing for PUCCHs of UCIs with the same physical layer priority includes the following operations:

[0115] Since PUCCH1 and PUCCH2 have high physical layer priority and the same repetition factor, cascade the UCIs in PUCCH1 and PUCCH2 to obtain UCI-1-2; Since PUCCH3 and PUCCH4 have high physical layer priority and the same repetition factor, cascade the UCIs in PUCCH3 and PUCCH4 to obtain UCI-3-4; Since PUCCH5 and PUCCH6 have high physical layer priority and the same repetition factor, cascade the UCIs in PUCCH5 and PUCCH6 to obtain UCI-5-6; Since PUCCH7 and PUCCH8 have low physical layer priority and the same repetition factor, cascade the UCIs in PUCCH7 and PUCCH8 to obtain UCI-7-8; Since PUCCH9 and PUCCH10 have low physical layer priority and the same repetition factor, cascade the UCIs in PUCCH9 and PUCCH10 to obtain UCI-9-10; Since PUCCH11 and PUCCH12 have low physical layer priority and the same repetition factor, cascade the UCIs in PUCCH11 and PUCCH12 to obtain UCI-11-12; Cascading UCI-1-2, UCI-3-4 and UCI-5-6 to obtain a sequence E1 of high physical layer priority to transmit; and To obtain the low physical layer priority sequence E0 to transmit, UCI-7-8, UCI-9-10 and UCI-11-12 are cascaded.

[0116] According to Method 1, performing UCI multiplexing for PUCCHs of UCIs with different physical layer priorities includes the following steps:

[0117] To obtain data-1-2-3-4-5-6 and data-7-8-9-10-11-12 to be transmitted, sequences E1 and E0 are coded and modulated (with selectable CRC check), respectively. Data-1-2-3-4-5-6 and data-7-8-9-10-11-12 are mapped to the same resulting PUCCH-1-2-3-4-5-6-7-8-9-10-11-12. Based on the operation in Example 3, PUCCH-1-2-3-4-5-6-7-8-9-10-11-12 has no repetition factor. Based on the operation in Example 2, the repetition factor of PUCCH-1-2-3-4-5-6-7-8-9-10-11-12 is 4.

[0118] Alternatively or additionally, if multiplexing UCIs with different physical layer priorities in the same PUCCH is not supported, Data-1-2-3-4-5-6 and Data-7-8-9-10-11-12 can each obtain a resulting PUCCH (where one has a high physical layer priority and the other has a low physical layer priority).

[0119] According to Method 2, UCI multiplexing to PUCCH of UCIs with the same physical layer priority includes the following steps:

[0120] Since PUCCH1 and PUCCH2 have high physical layer priority and the same repetition factor, cascade the UCIs in PUCCH1 and PUCCH2 to obtain UCI-1-2; Since PUCCH3 and PUCCH4 have high physical layer priority and the same repetition factor, cascade the UCIs in PUCCH3 and PUCCH4 to obtain UCI-3-4; Since PUCCH5 and PUCCH6 have high physical layer priority and the same repetition factor, cascade the UCIs in PUCCH5 and PUCCH6 to obtain UCI-5-6; Cascading the UCIs in PUCCH7 and PUCCH8 to obtain UCI-7-8, since PUCCH7 and PUCCH8 have low physical layer priority and the same repetition factor; Cascading the UCIs in PUCCH9 and PUCCH10 to obtain UCI-9-10 because PUCCH9 and PUCCH10 have low physical layer priority and the same repetition factor; and Since PUCCH11 and PUCCH12 have low physical layer priority and the same repetition factor, the UCIs in PUCCH11 and PUCCH12 are cascaded to obtain UCI-11-12.

[0121] According to Method 2, performing UCI multiplexing for PUCCHs of UCIs with different physical layer priorities includes the following steps:

[0122] UCI-1-2, UCI-3-4, UCI-5-6, UCI-7-8, UCI-9-10, and UCI-11-12 are coded and modulated (each with a selectable CRC check) to obtain data-1-2, data-3-4, data-5-6, data-7-8, data-9-10, and data-11-12, respectively. Data-1-2, data-3-4, data-5-6, data-7-8, data-9-10, and data-11-12 are then mapped to the same resulting PUCCH-1-2-3-4-5-6-7-8-9-10-11-12. Based on the operation in Example 3, PUCCH-1-2-3-4-5-6-7-8-9-10-11-12 does not have a repetition factor. Based on the operation of Example 2, the repetition factor of PUCCH-1-2-3-4-5-6-7-8-9-10-11-12 is 4.

[0123] Similarly, if multiplexing UCIs with different physical layer priorities in the same PUCCH is not supported, Data-1-2, Data-3-4 and Data-5-6 are multiplexed in the same result PUCCH-1-2-3-4-5-6, and Data-7-8, Data-9-10 and Data-11-12 are multiplexed in the same result PUCCH-7-8-9-10-11-12.

[0124] Another example is provided as follows: Case 1: UCIs in PUCCH only have the same physical layer priority in one timeslot If the UCIs in the PUCCH participating in UCI multiplexing have the same physical layer priority, these UCI bits are cascaded to obtain sequence A, and then sequence A is coded and modulated (optionally with a uniform CRC check) to obtain the data to be transmitted in the PUCCH. For example, the UCIs in multiple PUCCHs with a repetition factor of N1 each have a high (or low) priority, and one repetition in the multiple PUCCHs overlaps in a time slot in the time domain.

[0125] If sequence A is 1 to 2 bits, sequence A may be directly modulated into a promised sequence based on the resulting PUCCH format (e.g., PUCCH format 1), and the sequence modulated with sequence A is the data to be transmitted. Alternatively or additionally, if sequence A is 1 to 2 bits, a predefined table can be looked up based on the value state of sequence A (e.g., PUCCH format 0) to obtain the sequence, and the obtained sequence is the data to be transmitted.

[0126] Case 2: UCIs in two PUCCHs have different physical layer priorities in one timeslot If UCIs in two PUCCHs have different physical layer priorities, UCI bits with different physical layer priorities (each with a selectable CRC check) are coded and modulated, and then mapped to the same PUCCH for transmission. For example, UCI in a PUCCH with a repetition factor of N1 has a high priority, and UCI in a PUCCH with a repetition factor of N2 has a low priority. One repetition overlaps in a time slot in the time domain.

[0127] Case 3: UCIs in PUCCH have the same and different physical layer priorities in one timeslot In this case, several UCIs in a PUCCH have the same repetition factor, but one or more UCIs have high priority and one or more UCIs have low priority, and the repetitions of these UCIs overlap in time slots in the time domain.

[0128] First, UCI multiplexing may be performed between PUCCHs of UCIs with the same physical layer priority to obtain a resultant PUCCH (PUCCH-a), where the resultant PUCCH-a may include two PUCCHs, one including a resultant PUCCH (PUCCH-al) of a PUCCH of a UCI with a low physical layer priority and the other including a resultant PUCCH (recorded as PUCCH-ah, if any) of a UCI with a high physical layer priority.

[0129] Then, UCI multiplexing is performed between PUCCHs of UCIs with different physical layer priorities that overlap in the time domain to obtain a resultant PUCCH-b (including resultant PUCCH-a if resultant PUCCH-a overlaps with a PUCCH with a different priority in the time domain). PUCCH-b may further include multiple PUCCHs. Resultant PUCCH-b can be transmitted as the final resultant PUCCH. PUCCH-b also has the same repetition factor N1 or N2 and is transmitted from time slot n. In one example, the physical layer priority of the resultant PUCCH may be equal to the highest physical layer priority among the physical layer priorities of the UCIs participating in the UCI multiplexing.

[0130] Referring to FIG. 5A as an example, PUCCH1 and PUCCH2 are scheduled to start transmission in the first time slot. PUCCH1 and PUCCH2 have the same repetition factor N (N=2). PUCCH3 and PUCCH4 are also scheduled in the first time slot, and have a repetition factor M (M=1), meaning that PUCCH3 and PUCCH4 are not repeatedly transmitted. These PUCCHs overlap in the time domain and satisfy the multiplexing timeline. If the above conditions are met, UCI multiplexing can be performed for UCIs within these PUCCHs. It is assumed that these PUCCHs have the same physical layer priority. Details are as follows:

[0131] In the first time slot, the UCI bits corresponding to PUCCH1, PUCCH2, PUCCH3, and PUCCH4 are cascaded to obtain the bit sequence UCI-1-2-3-4 (assuming the number of bits in UCI-1-2-3-4 is greater than 2). A CRC check is added to UCI-1-2-3-4, which is then coded and modulated. UCI-1-2-3-4 is then mapped to the resulting PUCCH for transmission.

[0132] In the second time slot, the UCI bits corresponding to PUCCH1 and PUCCH2 are cascaded to obtain a bit sequence UCI-1-2 (assuming the number of bits in UCI-1-2 is greater than 2), which is then subjected to a CRC check, coded and modulated, and mapped to the resulting PUCCH for transmission.

[0133] 5B shows the multiplexing result of the superimposed PUCCH in FIG. 5A, where UCI multiplexing can be performed on a time slot basis, and the multiplexed PUCCH is transmitted only in the corresponding time slot.

[0134] Example 4 In this embodiment, the precondition for UCI multiplexing may include the condition that there are multiple PUCCHs whose time domains overlap in one timeslot, and at least one of them has a repetition factor greater than 1. If the above condition is met, UCI multiplexing can be performed for UCIs in multiple PUCCHs in a specific timeslot. For simplicity, it is assumed that UCIs in multiple PUCCHs have the same physical layer priority. However, UCIs with different physical layer priorities may be individually coded and modulated and mapped to PUCCHs for transmission, as interpreted in other embodiments of the present disclosure. Detailed operations may include the following: In this embodiment, PUCCH multiplexing may also be performed on a timeslot-by-timeslot basis. Briefly, the following procedures are performed for PUCCHs that meet the respective requirements in the same timeslot, and then a resulting PUCCH can be generated in that timeslot. The resulting PUCCH is transmitted in the original timeslot.

[0135] Step 1: For PUCCH with the same repetition factor For PUCCHs (if any) with the same starting time slot and the same repetition factor R (R>1) in the time slot, the UCI bits in these PUCCHs may be cascaded (with optional CRC check added) to encode and modulate to obtain the data to be transmitted. These data may be multiplexed in the same multiplexed result PUCCH, and the result PUCCH may be transmitted in the same time slot. This transmission time slot may not be the starting time slot of these PUCCHs.

[0136] Step 2: For PUCCH without repetition factor For PUCCHs (if any) without a repetition factor in that time slot, the UCI bits in these PUCCHs may be cascaded (with optional CRC check added) to encode and modulate to obtain the data to be transmitted, which can then be multiplexed in the same resulting PUCCH and transmitted in that time slot.

[0137] Step 3: For the remaining PUCCHs Step 3 may include three steps: step 3-1, step 3-2, and step 3-3.

[0138] In step 3-1, for PUCCHs with different starting time slots or different repetition factors in the time slot (excluding the PUCCHs processed in steps 1 and 2), the UCI bits (each with an optional CRC check) in these PUCCHs may be coded and modulated to obtain data to be transmitted, and these data may be multiplexed in the same resulting PUCCH, and the resulting PUCCH may be transmitted in the time slot.

[0139] Alternatively or additionally, in step 3-2, for PUCCHs with different starting timeslots or different repetition factors in the time slot (excluding the PUCCHs processed in steps 1 and 2), UCI bits in these PUCCHs (each with an optional CRC check) may be coded and modulated to obtain data to be transmitted, which may then be multiplexed in the same resulting PUCCH and transmitted in the time slot.

[0140] Step 3-3: Alternatively or additionally, for PUCCHs in the time slot (excluding the PUCCHs processed in steps 1 and 2) that have a different starting time slot or a different repetition factor, discard the UCI bits in these PUCCHs and do not transmit these PUCCHs.

[0141] When the above procedures are performed or skipped for a PUCCH that does not meet the conditions, the data obtained from procedures 1, 2 and 3 may be multiplexed in the same resulting PUCCH based on the following order: (1) procedure 1, then procedure 2, then procedure 3, or (2) procedure 1, then procedure 3, then procedure 2.

[0142] According to the cascading embodiment of the above procedure of this or other embodiments of the present disclosure, different types of UCI bits may be cascaded in the order of HARQ-ACK, then SR, and then CSI. UCI of the same type may be cascaded in a small-to-large sequence based on the starting symbol index of the PUCCH. For PUCCHs with the same starting symbol, the order is from large to small based on the number of PUCCH symbols. Data obtained by separate coding and modulation may be multiplexed in the same resulting PUCCH based on the order of HARQ-ACK, SR, and CSI.

[0143] Referring to Figure 6A, it is assumed that the repetition factor of PUCCH1 and PUCCH5 is 4, the starting time slot is the first time slot, and the subsequent time slots of PUCCH1 and PUCCH5 are determined as shown in Figure 6A. It is assumed that the repetition factor of PUCCH2 is 2, the starting time slot is the first time slot, and the subsequent time slots of PUCCH2 are determined as shown in Figure 6A. It is assumed that PUCCH3 has no repetition factor (or a repetition factor of 1) and the starting time slot is the third time slot. It is assumed that the repetition factor of PUCCH4 is 2, the starting time slot is the fourth time slot (from the left), and the subsequent time slots of PUCCH4 are determined as shown in Figure 6A. Taking Figure 6A as an example, UCI multiplexing can be performed for these PUCCHs as follows:

[0144] In the first time slot (from the left), there are PUCCH1, PUCCH2, and PUCCH5. PUCCH1 and PUCCH5 have the same starting time slot and the same repetition factor. Therefore, according to step 1, the UCIs in PUCCH1 and PUCCH5 are cascaded to obtain UCI-1-5. UCI-1-5 are coded and modulated to obtain data-1-5. PUCCH2 satisfies step 3. When PUCCH2 is processed according to step 3-1, the UCI in PUCCH2 generates UCI-2. UCI-2 is coded and modulated to obtain data-2. Data-2 and data-1-5 can be multiplexed in the same resulting PUCCH, and the resulting PUCCH can be transmitted in the same time slot.

[0145] Alternatively, if PUCCH2 is processed according to procedure 3-2, the UCI in PUCCH2 generates UCI-2. UCI-2 is coded and modulated to obtain Data-2. Data-2 and Data-1-5 are multiplexed in the same Resulting PUCCH, and the Resulting PUCCH is transmitted in the same time slot. As shown in the figure, if only one PUCCH is processed according to procedures 3-1 and 3-2, respectively, the result is the same.

[0146] Alternatively, when processing PUCCH2 according to procedure 3-3, PUCCH2 is not transmitted and UCI is not multiplexed in PUCCH2, Data-1-5 are multiplexed in the same resulting PUCCH, and the resulting PUCCH is transmitted in the same time slot.

[0147] In the second time slot (from the left), there are PUCCH1, PUCCH2 and PUCCH5. The same procedure as in the first time slot is carried out. The resulting PUCCH is transmitted in the second time slot.

[0148] In the third time slot, there are PUCCH1, PUCCH3, and PUCCH5. PUCCH1 and PUCCH5 have the same starting time slot (from the first time slot in FIG. 6A) and the same repetition factor (N=4). Therefore, based on step 1, the UCIs in PUCCH1 and PUCCH5 can be cascaded to obtain UCI-1-5. UCI-1-5 are coded and modulated to obtain data-1-5. PUCCH3 satisfies step 3. When PUCCH3 is processed based on step 3-1, the UCI in PUCCH3 generates UCI-3. UCI-3 is coded and modulated to obtain data-3. Data-3 and data-1-5 are multiplexed in the same resulting PUCCH, and the resulting PUCCH is transmitted in the third time slot.

[0149] Alternatively, when PUCCH3 is processed according to procedure 3-2, the UCI in PUCCH3 generates UCI-3, which is then coded and modulated to obtain Data-3, Data-3 and Data-1-5 are multiplexed in the same Resulting PUCCH, and the Resulting PUCCH is transmitted in the third time slot.

[0150] Alternatively, when processing PUCCH3 according to procedure 3-3, PUCCH3 is not transmitted and UCI is not multiplexed in PUCCH3, Data-1-5 are multiplexed in the same Resulting PUCCH, and the Resulting PUCCH is transmitted in the third time slot.

[0151] In the fourth time slot, there are PUCCH1, PUCCH4, and PUCCH5. PUCCH1 and PUCCH5 have the same starting time slot (from the first time slot in FIG. 6A) and the same repetition factor. Therefore, based on step 1, the UCIs in PUCCH1 and PUCCH5 are cascaded to obtain UCI-1-5. UCI-1-5 are coded and modulated to obtain data-1-5. PUCCH4 satisfies step 3. When PUCCH4 is processed based on step 3-1, the UCI in PUCCH4 generates UCI-4. UCI-4 is coded and modulated to obtain data-4. Data-4 and data-1-5 are multiplexed in the same resulting PUCCH, and the resulting PUCCH is transmitted in the fourth time slot.

[0152] Alternatively, when PUCCH4 is processed according to procedure 3-2, the UCI in PUCCH4 generates UCI-4, which is then coded and modulated to obtain Data-4, Data-4 and Data-1-5 are multiplexed in the same Resulting PUCCH, and the Resulting PUCCH is transmitted in the fourth time slot.

[0153] Alternatively, when PUCCH4 is processed according to procedure 3-3, PUCCH4 is not transmitted and UCI is not multiplexed in PUCCH4, Data-1-5 are multiplexed in the same Resulting PUCCH, and the Resulting PUCCH is transmitted in the fourth time slot.

[0154] In the fifth time slot of Figure 6A, there is only one PUCCH4 and no PUCCH overlap in the time domain, so PUCCH4 is transmitted and there is no need to perform UCI multiplexing.

[0155] For the PUCCH superposition in Figure 6A, after performing UCI multiplexing, the resulting PUCCH is shown in Figure 6B. UCI in PUCCH1 and PUCCH5 is repeated four times to meet the requirement (according to the maximum repetition factor for multiplexing PUCCHs). UCI in PUCCH2 and PUCCH4 is transmitted twice each to meet the requirement. UCI in PUCCH3 is transmitted only once, which also meets the requirement.

[0156] According to an example of the present disclosure, there is provided a wireless communication method, the method including: determining that multiple PUCCHs overlap in a time domain and at least one PUCCH among the multiple PUCCHs has a repetition factor greater than 1; if a predefined condition is satisfied, multiplexing multiple UCIs of the multiple PUCCHs to obtain a resulting PUCCH; and transmitting the resulting PUCCH to a base station.

[0157] According to one embodiment of the disclosed wireless communication method, the predefined conditions include that the multiple PUCCHs have the same repetition factor and the same starting time slot, or that the multiple PUCCHs each have a repetition and use the same time slot.

[0158] According to one embodiment of the disclosed wireless communication method, the predefined conditions include that the multiple PUCCHs have the same starting time slot, and at least one PUCCH among the multiple PUCCHs has a repetition factor greater than 1.

[0159] According to one embodiment of the disclosed wireless communication method, the repetition factor of the resulting PUCCH is one of the maximum repetition factors of the multiple PUCCHs associated with the multiple UCIs or the repetition factor configured in the signaling for the resulting PUCCH.

[0160] According to one embodiment of the disclosed wireless communication method, each UCI in the plurality of UCIs carries at least one type of information: a confirmation, a scheduling request (SR), or channel state information (CSI).

[0161] According to one embodiment of the disclosed wireless communication method, each UCI contains the same type of conveyed information.

[0162] According to one embodiment of the disclosed wireless communication method, each UCI includes a different type of conveyed information.

[0163] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the steps of multiplexing a first set of UCIs carrying the same first type of carrier information to obtain an intermediate UCI, and multiplexing one or more additional UCIs having a second type of carrier information different from the intermediate UCI and the first type of carrier information to obtain resultant data carried by the resultant PUCCH.

[0164] According to one embodiment of the disclosed wireless communication method, the method further includes a step of determining one or more time slots for transmitting the resulting PUCCH, wherein the one or more time slots include an uplink symbol or flexible symbol that coincides with the start symbol set for the resulting PUCCH, and the one or more time slots include consecutive uplink symbols or flexible symbols that are greater than or equal to the number of symbols of the resulting PUCCH.

[0165] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the steps of multiplexing a first set of UCIs of a first physical layer priority to obtain intermediate UCIs, multiplexing a second set of UCIs of a second physical layer priority to obtain intermediate UCIs, and multiplexing the intermediate UCIs obtained from the first physical layer priority and the second physical layer priority to obtain resultant data carried by the resultant PUCCH.

[0166] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the steps of cascading the multiple UCIs to obtain an intermediate sequence, and encoding and modulating the intermediate sequence to obtain resultant data, wherein the multiple UCIs have the same physical layer priority and the multiple PUCCHs associated with the multiple UCIs have the same repetition factor and are scheduled to have time overlap.

[0167] According to one embodiment of the disclosed wireless communication method, the step of encoding and modulating the intermediate sequence to obtain the resultant data includes at least one of the steps of modulating the intermediate sequence based on a format of the resultant PUCCH and a predetermined sequence, where the intermediate sequence has 1-2 bits, or modulating the intermediate sequence based on a table lookup and a format of the resultant PUCCH, where the intermediate sequence has more than 1-2 bits.

[0168] According to one embodiment of the disclosed wireless communication method, the step of encoding and modulating the intermediate sequence to obtain result data includes modulating the intermediate sequence and performing a CRC check if the intermediate sequence has more than two bits.

[0169] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the steps of modulating and encoding one or more UCIs of a first physical layer priority to obtain first intermediate data, modulating and encoding one or more UCIs of a second physical layer priority to obtain second intermediate data, and mapping the first intermediate data and the second intermediate data to obtain a resultant PUCCH.

[0170] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH further includes a step of modulating and encoding one or more UCIs of a first physical layer priority or a second physical layer priority to perform a CRC check.

[0171] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the steps of multiplexing one or more UCIs of a first physical layer priority to obtain one or more first intermediate PUCCHs, multiplexing one or more UCIs of a second physical layer priority to obtain one or more second intermediate PUCCHs, and multiplexing the one or more first intermediate PUCCHs and the one or more second intermediate PUCCHs to obtain a resultant PUCCH.

[0172] According to one embodiment of the disclosed wireless communication method, the physical layer priority of the one or more PUCCHs is the highest physical layer priority of the first physical layer priority and the second physical layer priority.

[0173] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the step of multiplexing multiple UCIs in corresponding timeslots of multiple PUCCHs associated with the multiple UCIs to obtain a resultant PUCCH for the corresponding timeslot.

[0174] According to one embodiment of the disclosed wireless communication method, transmitting the resulting PUCCHs includes transmitting each of the resulting PUCCHs in a corresponding timeslot.

[0175] According to one embodiment of the disclosed wireless communication method, each UCI in the plurality of UCIs carries at least one type of information: a confirmation, a scheduling request (SR), or channel state information (CSI).

[0176] According to one embodiment of the disclosed wireless communication method, each UCI contains the same type of conveyed information.

[0177] According to one embodiment of the disclosed wireless communication method, each UCI includes a different type of conveyed information.

[0178] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH includes the steps of multiplexing multiple UCIs of corresponding types to obtain intermediate UCIs, and multiplexing the multiple intermediate UCIs to obtain resultant data carried by the resultant PUCCHs.

[0179] According to one embodiment of the disclosed wireless communication method, the step of multiplexing a plurality of UCIs of a plurality of PUCCHs to obtain a resultant PUCCH includes the step of multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of the corresponding physical layer priority and repetition factor.

[0180] According to one embodiment of the disclosed wireless communication method, the step of multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences for the corresponding physical layer priority and repetition factor comprises the step of cascading the first intermediate sequences for each repetition factor of the corresponding physical layer priority to obtain one or more second intermediate sequences.

[0181] According to one embodiment of the disclosed wireless communication method, the step of multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of the corresponding physical layer priority and repetition factor further includes at least one of the steps of modulating and encoding at least two second intermediate sequences of the second intermediate sequences, respectively, to obtain resultant data of the resultant PUCCH, modulating and encoding the first intermediate sequence and the second intermediate sequence, respectively, to obtain resultant data of the resultant PUCCH, or modulating and encoding at least two first intermediate sequences of the first intermediate sequences, respectively, to obtain resultant data of the resultant PUCCH.

[0182] According to one embodiment of the disclosed wireless communication method, the step of multiplexing a plurality of UCIs having the same corresponding physical layer priority and associated with PUCCHs of the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor comprises the step of modulating and encoding the one or more corresponding first intermediate sequences of the corresponding physical layer priority and repetition factor, respectively.

[0183] According to one embodiment of the disclosed wireless communication method, the step of multiplexing a plurality of UCIs having the same corresponding physical layer priority and associated with PUCCHs of the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of the corresponding physical layer priority and repetition factor includes the steps of multiplexing a plurality of UCIs each having the same physical layer priority to obtain corresponding first intermediate sequences of the corresponding physical layer priority, and modulating and encoding the corresponding first intermediate sequences of the corresponding physical layer priorities to obtain resultant data of the resulting PUCCH.

[0184] According to one embodiment of the disclosed wireless communication method, the step of multiplexing a plurality of UCIs to obtain a resulting PUCCH includes the steps of cascading a first set of UCIs associated with PUCCHs having the same starting time slot and the same repetition factor to obtain a first intermediate sequence, and modulating and encoding the intermediate sequence to obtain first resulting data carried by the resulting PUCCH.

[0185] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resulting PUCCH further includes a step of cascading a second set of UCIs and the first set of UCIs associated with the PUCCHs in the same time slot to obtain a second intermediate sequence, and there is no repetition factor, and a step of modulating and encoding the second intermediate sequence to obtain second resulting data carried by the resulting PUCCH.

[0186] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH further includes a step of modulating and encoding a third set of UCIs associated with one or more remaining PUCCHs other than the first set of UCIs or the second set of UCIs in the same time slot, respectively, to obtain third resultant data carried by the resultant PUCCH, wherein the remaining PUCCHs have different starting time slots or different repetition factors from each other.

[0187] According to one embodiment of the disclosed wireless communication method, the step of multiplexing multiple UCIs of multiple PUCCHs to obtain a resultant PUCCH further includes the steps of cascading a third set of UCIs associated with the remaining PUCCHs other than the first set of UCIs or the second set of UCIs in the same time slot to obtain a third intermediate sequence, wherein the remaining PUCCHs have different starting time slots or different repetition factors from each other, and modulating and encoding the third intermediate sequence to obtain third resultant data carried by the resultant PUCCH.

[0188] According to one embodiment of the disclosed wireless communication method, the method further comprises ignoring remaining UCI associated with remaining PUCCHs other than the first set of UCI or the second set of UCI.

[0189] Various exemplary embodiments of the present disclosure are described herein with reference to the accompanying drawings to enable those skilled in the art to make and use the present disclosure. The present disclosure is not limited to the exemplary embodiments and applications described and illustrated herein. Additionally, the specific order and / or hierarchy of steps in the methods disclosed herein is merely exemplary. Based on design preferences, the specific order or hierarchy of steps in a disclosed method or procedure may be rearranged while remaining within the scope of the present disclosure. Thus, those skilled in the art will understand that the methods and techniques disclosed herein present various steps or operations in an exemplary order, and that the present disclosure is not limited to the specific order or hierarchy presented, unless expressly stated otherwise.

[0190] This disclosure is intended to cover any conceivable variation, use, combination, or adaptive modification of the present disclosure in accordance with the general principles of the present disclosure, including commonly known knowledge and conventional technical means in the art and not disclosed in this application.

[0191] It should be understood that the present disclosure is not limited to the exact construction or operation described above and illustrated in the accompanying drawings, and that various modifications and changes are possible without departing from the scope of the present application, which is governed solely by the appended claims.

[0192] The methods, devices, processes, circuit systems, and logic described above can be implemented in many different ways and with many different combinations of hardware and software. For example, all or part of the implementations may be a circuit system including an instruction processor or controller, such as a central processing unit (CPU), microcontroller, or microprocessor; an application specific integrated circuit (ASIC), programmable logic device (PLD), or field programmable gate array (FPGA); or a circuit system including discrete logic or other circuit elements, including analog circuit elements, digital circuit elements, or both, or any combination thereof. For example, the circuit system may include discrete interconnected hardware elements, combined on a single integrated circuit chip, distributed among multiple integrated circuit chips, or implemented in a multi-chip module (MCM) of multiple integrated circuit chips in a common package.

[0193] Thus, the circuitry may store or access instructions for execution, or may implement its functions solely in hardware. The instructions may be stored in a transitory, non-signal, tangible storage medium such as flash memory, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or stored in or on a disk or optical disk, such as a compact disc read-only memory (CD-ROM), hard disk drive (HDD), other disk or optical disk, or other machine-readable medium. An article of manufacture (such as a computer program product) may include a storage medium and instructions stored in or on the medium, and when executed by the circuitry in an apparatus, the instructions may cause the apparatus to implement any of the processes described above or illustrated in the accompanying drawings.

[0194] The implementation may be distributed. For example, a circuit system may include multiple different system components, such as multiple processors and memories, and may span multiple distributed processing systems. Parameters, databases, and other data structures may be stored and managed separately, integrated into a single memory or database, and may be logically and physically organized and implemented in many different ways. Exemplary embodiments include linked lists, program variables, hash tables, arrays, records (e.g., database records), objects, and implicit storage mechanisms. Instructions may form part of a single program (e.g., a subroutine or other code segment), form multiple separate programs, be distributed across multiple memories and processors, and may be implemented in many different ways. Exemplary embodiments include standalone programs and shared libraries, such as dynamic link libraries (DLLs), as part of a library. For example, the library may include shared data and one or more shared programs containing instructions that, when executed by the circuit system, perform any of the operations described above or illustrated in the accompanying drawings.

[0195] In some examples, each unit, subunit, and / or module of a system may include a logical component. Each logical component may be hardware or a combination of hardware and software. For example, each logical component may include an ASIC, an FPGA, digital logic circuitry, analog circuitry, a combination of discrete circuitry, gates, or any other type of hardware or combination thereof. Alternatively or additionally, each logical component may include memory hardware, such as a portion of memory containing instructions executable by a processor or other processor to implement one or more features of the logical component. If any of the logical components includes a portion of memory containing instructions executable by a processor, the logical component may or may not include a processor. In some examples, each logical component may simply be a portion of memory or other physical memory containing instructions executable by a processor or other processor to implement the features of the corresponding logical component, and the logical component does not include any other hardware. Because each logical component includes at least some hardware, even if the included hardware includes software, each logical component may be interchangeably referred to as a hardware logical component.

[0196] A second action can be said to "respond" to a first action regardless of whether the second action is directly or indirectly caused by the first action. A second action can respond to a first action even if it occurs much later than the first action. Similarly, a second action can be said to respond to a first action even if intervening actions occur between the first and second actions, and even if one or more intervening actions directly result in the execution of the second action. For example, if a flag is set for a first action, a second action can respond to the first action, and a third action can initiate the second action when the flag is later set.

[0197] For the purpose of clarifying the use and notifying the public hereof, the applicant 、 , ...and <n> At least one of the following" or "< / n> 、 、... <n> or a combination thereof" or "< / n> 、 , ...and / or <n> " defines the phrase "in any combination of any of the elements A, B, ..., and N" in its broadest sense and replaces any other implied definition above or below, unless applicant expressly states to the contrary. In other words, the phrase refers to any combination of one or more of the elements A, B, ..., or N, including any one element alone or in combination with one or more other elements, which may also be combined to include additional elements not listed.< / n>

Claims

1. 1. A wireless communication method, comprising: determining that a plurality of physical uplink control channels (PUCCHs) overlap in a time domain, and at least one PUCCH among the plurality of PUCCHs has a repetition factor greater than 1; multiplexing the plurality of uplink control information UCIs of the plurality of PUCCHs to obtain a resultant PUCCH if a predefined condition is met; transmitting the resulting PUCCH to a base station.

2. The predefined condition is: The multiple PUCCHs have the same repetition factor and the same starting time slot; or The method of claim 1 , wherein the plurality of PUCCHs each have repetition and use the same time slot.

3. The predefined condition is: The method of claim 1 , wherein the plurality of PUCCHs have the same starting time slot, and at least one PUCCH of the plurality of PUCCHs has a repetition factor greater than one.

4. The resulting PUCCH repetition factor is a maximum repetition factor of the plurality of PUCCHs associated with the plurality of UCIs; or The method of claim 1 , wherein the repetition factor is one of the repetition factors configured in the signaling for the resulting PUCCH.

5. The method according to any one of claims 1 to 4, wherein each UCI in the plurality of UCIs carries at least one type of information: a confirmation, a scheduling request SR, or channel state information CSI.

6. The method of claim 5 , wherein each UCI contains the same type of conveyed information.

7. The method of claim 5 , wherein each UCI includes a different type of conveyed information.

8. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, multiplexing a first set of UCI carrying the same first type of conveying information to obtain intermediate UCI; and multiplexing the intermediate UCI and one or more additional UCIs carrying second type of carrier information different from the first type of carrier information to obtain resultant data carried by the resulting PUCCH.

9. 2. The method of claim 1, further comprising: determining one or more time slots for transmitting the resulting PUCCH, wherein the one or more time slots satisfy a condition that the one or more time slots include an uplink symbol or a flexible symbol that matches a start symbol configured for the resulting PUCCH, and the one or more time slots include, from the uplink symbol or the flexible symbol, consecutive uplink symbols or flexible symbols that are equal to or greater than the number of symbols of the resulting PUCCH.

10. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises: multiplexing a first set of UCIs of a first physical layer priority to obtain a first intermediate UCI; multiplexing a second set of UCI of a second physical layer priority to obtain a second intermediate UCI; and multiplexing the first and second intermediate UCIs obtained from the first and second physical layer priorities to obtain resultant data carried by the resulting PUCCH.

11. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises: cascading the plurality of UCIs to obtain an intermediate sequence; encoding and modulating the intermediate sequence to obtain result data, the plurality of UCIs have the same physical layer priority; and and scheduling the PUCCHs associated with the UCIs to have the same repetition factor and to have time overlap.

12. encoding and modulating the intermediate sequence to obtain the resultant data, modulating the intermediate sequence based on a format of the resulting PUCCH and a predetermined sequence, wherein the intermediate sequence has 1 to 2 bits; or 12. The method of claim 11, comprising at least one of the steps of: modulating the intermediate sequence based on a table lookup and a format of the resulting PUCCH, wherein the intermediate sequence has more than 1-2 bits.

13. 12. The method of claim 11, wherein encoding and modulating the intermediate sequence to obtain the resultant data comprises modulating the intermediate sequence and performing a CRC check if the intermediate sequence has more than two bits.

14. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, modulating and encoding one or more UCIs of a first physical layer priority to obtain first intermediate data; modulating and encoding one or more UCIs of a second physical layer priority to obtain second intermediate data; and mapping the first intermediate data and the second intermediate data to obtain the resulting PUCCH.

15. 15. The method of claim 14, wherein multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH further comprises modulating and coding the one or more UCIs of the first physical layer priority or the second physical layer priority to perform a CRC check.

16. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, multiplexing one or more UCIs of a first physical layer priority to obtain one or more first intermediate PUCCHs; multiplexing one or more UCIs of a second physical layer priority to obtain one or more second intermediate PUCCHs; and multiplexing the one or more first intermediate PUCCHs and the one or more second intermediate PUCCHs to obtain the resulting PUCCH.

17. 17. The method of claim 16, wherein the physical layer priority of the one or more PUCCHs is the highest physical layer priority of the first physical layer priority and the second physical layer priority.

18. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, 2. The method of claim 1, comprising multiplexing a plurality of UCIs in corresponding timeslots of the plurality of PUCCHs associated with the plurality of UCIs to obtain a resulting PUCCH for the corresponding timeslot.

19. 20. The method of claim 18, wherein transmitting the resulting PUCCHs comprises transmitting each of the resulting PUCCHs in the corresponding timeslot.

20. The method according to any one of claims 18 to 19, wherein each UCI in the plurality of UCIs carries at least one type of information: a confirmation, a scheduling request SR, or channel state information CSI.

21. 21. The method of claim 20, wherein each UCI contains the same type of conveyed information.

22. 21. The method of claim 20, wherein each UCI includes a different type of conveyed information.

23. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, multiplexing a plurality of UCIs of the corresponding type to obtain a plurality of intermediate UCIs; and multiplexing the plurality of intermediate UCIs to obtain resultant data carried by the resultant PUCCH.

24. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises:

2. The method of claim 1, comprising: multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of the corresponding physical layer priority and repetition factor.

25. multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor, 25. The method of claim 24, comprising cascading the first intermediate sequences for each repetition factor of the corresponding physical layer priority to obtain one or more second intermediate sequences.

26. The step of multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor further comprises: modulating and encoding at least two second intermediate sequences of the second intermediate sequences, respectively, to obtain resultant data of the resultant PUCCH; modulating and encoding the first intermediate sequence and the second intermediate sequence, respectively, to obtain resulting data of the resulting PUCCH; or 26. The method of claim 25, comprising at least one of modulating and coding at least two first intermediate sequences of the first intermediate sequences, respectively, to obtain resultant data of the resultant PUCCH.

27. 25. The method of claim 24, wherein multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priorities and repetition factors comprises modulating and encoding the one or more first intermediate sequences of corresponding physical layer priorities and repetition factors, respectively.

28. multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor, multiplexing a plurality of UCIs each having the same physical layer priority to obtain a corresponding first intermediate sequence of the corresponding physical layer priority; and modulating and encoding the corresponding first intermediate sequences of the corresponding physical layer priorities, respectively, to obtain the resulting data of the resulting PUCCH.

29. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises: cascading a first set of UCIs associated with PUCCHs having the same starting timeslot and the same repetition factor to obtain a first intermediate sequence; and modulating and coding the intermediate sequence to obtain first resulting data carried by the resulting PUCCH.

30. The step of multiplexing the UCIs of the PUCCHs to obtain the resulting PUCCH further includes: cascading the first set of UCI and a second set of UCI associated with a PUCCH in the same time slot and without a repetition factor to obtain a second intermediate sequence; and modulating and encoding the second intermediate sequence to obtain second resulting data carried by the resulting PUCCH.

31. The step of multiplexing the UCIs of the PUCCHs to obtain the resulting PUCCH further includes:

31. The method of claim 30, comprising modulating and coding a third set of UCI associated with one or more remaining PUCCHs other than the first set of UCI or the second set of UCI in the same time slot, respectively, to obtain third result data carried by the resulting PUCCH, wherein the remaining PUCCHs have different starting time slots or different repetition factors from each other.

32. The step of multiplexing the UCIs of the PUCCHs to obtain the resulting PUCCH further includes: cascading a third set of UCIs associated with remaining PUCCHs other than the first set of UCIs or the second set of UCIs in the same time slot to obtain a third intermediate sequence, wherein the remaining PUCCHs have different starting time slots or different repetition factors; and modulating and encoding the third intermediate sequence to obtain third resulting data carried by the resulting PUCCH.

33. 31. The method of claim 30, further comprising ignoring remaining UCI associated with remaining PUCCHs other than the first set of UCI or the second set of UCI.

34. 1. A wireless communication method, comprising: determining that a plurality of physical uplink control channels (PUCCHs) overlap in a time domain, and at least one PUCCH among the plurality of PUCCHs has a repetition factor greater than 1; receiving a resultant PUCCH, wherein the resultant PUCCH is obtained by multiplexing a plurality of uplink control information UCIs of the plurality of PUCCHs to obtain the resultant PUCCH when a predefined condition is satisfied.

35. The predefined condition is: The multiple PUCCHs have the same repetition factor and the same starting time slot; or 35. The method of claim 34, wherein the plurality of PUCCHs each have repetition and use the same time slot.

36. The predefined condition is:

35. The method of claim 34, wherein the plurality of PUCCHs have the same starting time slot, and at least one PUCCH of the plurality of PUCCHs has a repetition factor greater than one.

37. The resulting PUCCH repetition factor is a maximum repetition factor of the plurality of PUCCHs associated with the plurality of UCIs; or 35. The method of claim 34, wherein the repetition factor is one of the repetition factors configured in the signaling for the resulting PUCCH.

38. The method according to any one of claims 34 to 37, wherein each UCI in the plurality of UCIs carries at least one type of information: a confirmation, a scheduling request SR, or channel state information CSI.

39. 39. The method of claim 38, wherein each UCI includes the same type of conveying information.

40. 39. The method of claim 38, wherein each UCI includes a different type of conveying information.

41. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, multiplexing a first set of UCI carrying the same first type of conveying information to obtain intermediate UCI; and multiplexing the intermediate UCI and one or more additional UCIs carrying a second type of carrier information different from the first type of carrier information to obtain resultant data carried by the resulting PUCCH.

42. 35. The method of claim 34, wherein the resulting PUCCH is received from one or more time slots for transmission, where the one or more time slots satisfy a condition that the one or more time slots include an uplink symbol or flexible symbol that coincides with a start symbol configured for the resulting PUCCH, and the one or more time slots include consecutive uplink symbols or flexible symbols that are equal to or greater than the number of symbols of the resulting PUCCH.

43. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises: multiplexing a first set of UCIs of a first physical layer priority to obtain a first intermediate UCI; multiplexing a second set of UCI of a second physical layer priority to obtain a second intermediate UCI; and multiplexing the first intermediate UCI and the second intermediate UCI obtained from the first physical layer priority and the second physical layer priority to obtain resulting data carried by the resulting PUCCH.

44. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises: cascading the plurality of UCIs to obtain an intermediate sequence; encoding and modulating the intermediate sequence to obtain result data, the plurality of UCIs have the same physical layer priority; and and scheduling the PUCCHs associated with the UCIs to have the same repetition factor and to have time overlap.

45. encoding and modulating the intermediate sequence to obtain the resultant data, modulating the intermediate sequence based on a format of the resulting PUCCH and a predetermined sequence, wherein the intermediate sequence has 1 to 2 bits; or 45. The method of claim 44, comprising at least one of the steps of: table lookup and modulating the intermediate sequence based on a format of the resulting PUCCH, wherein the intermediate sequence has more than 1-2 bits.

46. 45. The method of claim 44, wherein encoding and modulating the intermediate sequence to obtain the resultant data comprises modulating the intermediate sequence and performing a CRC check if the intermediate sequence has more than two bits.

47. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, modulating and encoding one or more UCIs of a first physical layer priority to obtain first intermediate data; modulating and encoding one or more UCIs of a second physical layer priority to obtain second intermediate data; and mapping the first intermediate data and the second intermediate data to obtain the resulting PUCCH.

48. 48. The method of claim 47, wherein multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH further comprises modulating and coding the one or more UCIs of the first physical layer priority or the second physical layer priority to perform a CRC check.

49. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, multiplexing one or more UCIs of a first physical layer priority to obtain one or more first intermediate PUCCHs; multiplexing one or more UCIs of a second physical layer priority to obtain one or more second intermediate PUCCHs; and multiplexing the one or more first intermediate PUCCHs and the one or more second intermediate PUCCHs to obtain the resulting PUCCH.

50. 50. The method of claim 49, wherein the physical layer priority of the one or more PUCCHs is the highest physical layer priority of the first physical layer priority and the second physical layer priority.

51. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, 35. The method of claim 34, comprising multiplexing a plurality of UCIs in corresponding timeslots of the plurality of PUCCHs associated with the plurality of UCIs to obtain a resulting PUCCH for the corresponding timeslot.

52. 52. The method of claim 51, wherein transmitting the resulting PUCCHs comprises transmitting each of the resulting PUCCHs in the corresponding timeslot.

53. The method according to any one of claims 51 to 52, wherein each UCI in the plurality of UCIs carries at least one type of information: a confirmation, a scheduling request SR, or channel state information CSI.

54. 54. The method of claim 53, wherein each UCI includes the same type of conveying information.

55. 54. The method of claim 53, wherein each UCI includes a different type of conveying information.

56. multiplexing the plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH, multiplexing a plurality of UCIs of the corresponding type to obtain a plurality of intermediate UCIs; and multiplexing the plurality of intermediate UCIs to obtain resultant data carried by the resultant PUCCH.

57. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises:

35. The method of claim 34, comprising multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of the corresponding physical layer priority and repetition factor.

58. multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor, 58. The method of claim 57, comprising cascading the first intermediate sequences for each repetition factor of the corresponding physical layer priority to obtain one or more second intermediate sequences.

59. The step of multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor further comprises: modulating and encoding at least two second intermediate sequences of the second intermediate sequences, respectively, to obtain resultant data of the resultant PUCCH; modulating and encoding the first intermediate sequence and the second intermediate sequence, respectively, to obtain resulting data of the resulting PUCCH; or 60. The method of claim 58, comprising at least one of modulating and encoding at least two first intermediate sequences of the first intermediate sequences, respectively, to obtain resultant data for the resulting PUCCH.

60. 58. The method of claim 57, wherein multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor comprises modulating and encoding the one or more first intermediate sequences of corresponding physical layer priority and repetition factor, respectively.

61. multiplexing a plurality of UCIs associated with PUCCHs having the same corresponding physical layer priority and the same corresponding repetition factor to obtain one or more corresponding first intermediate sequences of corresponding physical layer priority and repetition factor, multiplexing a plurality of UCIs each having the same physical layer priority to obtain a corresponding first intermediate sequence of the corresponding physical layer priority; and modulating and encoding the corresponding first intermediate sequences of the corresponding physical layer priorities, respectively, to obtain the resulting data of the resulting PUCCH.

62. The step of multiplexing a plurality of UCIs of the plurality of PUCCHs to obtain the resulting PUCCH comprises: cascading a first set of UCIs associated with PUCCHs having the same starting timeslot and the same repetition factor to obtain a first intermediate sequence; and modulating and coding the intermediate sequence to obtain first resulting data carried by the resulting PUCCH.

63. The step of multiplexing the UCIs of the PUCCHs to obtain the resulting PUCCH further includes: cascading the first set of UCI and a second set of UCI associated with a PUCCH in the same time slot and without a repetition factor to obtain a second intermediate sequence; and modulating and encoding the second intermediate sequence to obtain second resulting data carried by the resulting PUCCH.

64. The step of multiplexing the UCIs of the PUCCHs to obtain the resulting PUCCH further includes:

64. The method of claim 63, comprising modulating and coding a third set of UCI associated with one or more remaining PUCCHs other than the first set of UCI or the second set of UCI in the same time slot, respectively, to obtain third result data carried by the resulting PUCCH, wherein the remaining PUCCHs have different starting time slots or different repetition factors from each other.

65. The step of multiplexing the UCIs of the PUCCHs to obtain the resulting PUCCH further includes: cascading a third set of UCIs associated with remaining PUCCHs other than the first set of UCIs or the second set of UCIs in the same time slot to obtain a third intermediate sequence, wherein the remaining PUCCHs have different starting time slots or different repetition factors; and modulating and encoding the third intermediate sequence to obtain third resulting data carried by the resulting PUCCH.

66. 64. The method of claim 63, further comprising ignoring remaining UCI associated with remaining PUCCHs other than the first set of UCI or the second set of UCI.

67. 67. A wireless communication device comprising: a memory storing one or more programs; and one or more processors electrically coupled to the memory and configured to execute the one or more programs to perform the method of any one of claims 1 to 66.

68. 67. A non-transitory computer readable storage medium storing one or more programs, the one or more programs being configured, when executed by a processor, to cause the processor to perform the method of any one of claims 1 to 66.

Images