Method and apparatus relating to UCI multiplexing in a node for wireless communication

Abstract

The invention discloses a method and an apparatus related to UCI multiplexing in a node for wireless communication. A method for a terminal is characterized by comprising: transmitting a plurality of PUSCHs, each of the plurality of PUSCHs overlapping a first PUCCH, a first UCI being associated with the first PUCCH; wherein the first UCI is multiplexed into one PUSCH in the plurality of PUSCHs, and the first UCI is a symbol type which is multiplexed into the earliest PUSCH in the plurality of PUSCHs or the symbol type which depends on a symbol corresponding to at least one PUSCH in the plurality of PUSCHs in the other PUSCHs, and the first UCI is multiplexed into the earliest PUSCH in the plurality of PUSCHs or the symbol type which depends on a symbol corresponding to at least one PUSCH in the plurality of PUSCHs; the symbol type of the symbol corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types comprise full duplex and non-full duplex.

Description

Technical Field

[0001] The present application relates to a transmission method and apparatus in a wireless communication system, and in particular to a method and apparatus for transmitting wireless signals in a wireless communication system supporting a cellular network. Background Art

[0002] In the existing NR (New Radio) system, spectrum resources are statically divided into FDD (Frequency Division Duplex) spectrum and TDD (Time Division Duplex) spectrum. For the TDD spectrum, both the base station and the UE (User Equipment) operate in a half-duplex mode. This half-duplex mode avoids self-interference and can mitigate the impact of cross-link interference (CLI), but it also brings problems such as decreased resource utilization and increased latency. To address these problems, it becomes a possible solution to support a flexible duplex mode or variable link directions (uplink or downlink or flexible) on the TDD spectrum or FDD spectrum. 3GPP (3rd Generation Partner Project) agreed to carry out research work on duplex technologies (especially the sub-band non-overlapping full-duplex (SBFD) mode at the gNB (NR Node B) side); corresponding optimization of the system design is an important part of the research work. Summary of the Invention

[0003] UCI (Uplink Control Information) multiplexing is an important part of mobile communication technology. How to optimize UCI multiplexing is an issue worthy of study in system design; the present application discloses a solution to the above problem. It should be noted that the present application can be applied to various wireless communication scenarios, such as scenarios using the SBFD mode, scenarios using other types of full-duplex modes other than SBFD, scenarios using a more flexible duplex mode, etc., and achieve similar technical effects. In addition, adopting a unified solution for different scenarios (including but not limited to scenarios using the SBFD mode, scenarios using other types of full-duplex modes other than SBFD, scenarios using a more flexible duplex mode) helps to reduce hardware complexity and cost, or improve performance. Without conflict, the embodiments and features in the embodiments of any node in the present application can be applied to any other node. Without conflict, the embodiments and features in the embodiments of the present application can be combined with each other arbitrarily.

[0004] If necessary, the explanations of the terms in this application can refer to the descriptions in the 3GPP specification protocols TS37 series and TS38 series.

[0005] This application discloses a method in a first node for wireless communication, characterized by including:

[0006] Transmitting a plurality of PUSCHs, all of the plurality of PUSCHs overlapping with a first PUCCH, and a first UCI being associated with the first PUCCH;

[0007] Wherein, the first UCI is multiplexed into one of the plurality of PUSCHs. Whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbols corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types includes full duplex and non-full duplex.

[0008] As an embodiment, the first node is a terminal.

[0009] As an embodiment, the problems to be solved by this application include: how to enhance the UCI multiplexing on the PUSCH (Physical Uplink Shared Channel) under the configuration of full-duplex symbols and non-full-duplex symbols.

[0010] As an embodiment, the advantages of the above method include: being beneficial to improving the uplink transmission efficiency.

[0011] As an embodiment, the advantages of the above method include: less modification is required for improvement on the existing 3GPP protocol version, and the standardization workload is small.

[0012] According to one aspect of this application, the above method is characterized in that

[0013] If at least one of the plurality of PUSCHs corresponds to full-duplex symbols and at least one of the plurality of PUSCHs corresponds to non-full-duplex symbols, then the PUSCH for multiplexing the first UCI is one of the plurality of PUSCHs corresponding to non-full-duplex symbols; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0014] As an example, in the above method, when at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, the UCI is preferentially multiplexed onto the PUSCH corresponding to the non-full-duplex symbol to reduce the interference suffered by the UCI transmission (generally, the transmission in the full-duplex symbol is subject to stronger inter-link interference than the transmission in the non-full-duplex symbol);

[0015] Only when each of the plurality of PUSCHs corresponds to a full-duplex symbol or each corresponds to a non-full-duplex symbol, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs; such a characteristic is beneficial to minimizing the transmission delay of the UCI to the greatest extent on the premise of reducing the interference suffered by the UCI transmission as described above.

[0016] According to one aspect of the present application, the above method is characterized in that,

[0017] When at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the plurality of PUSCHs corresponding to the non-full-duplex symbol.

[0018] As an example, the advantages of the above method include: being beneficial to further reducing the transmission delay of the UCI.

[0019] According to one aspect of the present application, the above method is characterized in that,

[0020] If at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS adopted by any one of the PUSCHs corresponding to the full-duplex symbol among the plurality of PUSCHs is lower than the index of the MCS adopted by each of the PUSCHs corresponding to the non-full-duplex symbol among the plurality of PUSCHs: then the PUSCH for multiplexing the first UCI is a PUSCH corresponding to the non-full-duplex symbol among the plurality of PUSCHs; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0021] As an example, the above method combines MCS (Modulation and Coding Scheme) information to determine whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or into other PUSCHs, which is beneficial to optimizing the transmission performance.

[0022] According to one aspect of the present application, the above method is characterized in that

[0023] Only when the first set of conditions is satisfied, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs.

[0024] Wherein, one condition in the first set of conditions includes: none of the multiple PUSCHs carry aperiodic CSI.

[0025] As an embodiment, generally speaking, to ensure the reporting efficiency of aperiodic CSI, the transmission performance of the PUSCHs scheduled to transmit aperiodic CSI is relatively good; combining the above features, the solution disclosed in the present application can achieve preferentially multiplexing the UCI into the PUSCHs carrying aperiodic CSI, and comprehensively considering the transmission delay of the UCI and the interference suffered during transmission when at least none of the multiple PUSCHs carry aperiodic CSI; such a solution is beneficial to achieving overall optimization after comprehensively considering various scenarios.

[0026] According to one aspect of the present application, the above method is characterized in that it includes:

[0027] Receiving multiple DCI formats;

[0028] Wherein, each of the multiple PUSCHs is scheduled by one of the multiple DCI formats.

[0029] As an embodiment, the advantages of the above method include: high scheduling flexibility.

[0030] According to one aspect of the present application, the above method is characterized in that

[0031] The multiple PUSCHs are on the same serving cell.

[0032] According to one aspect of the present application, the above method is characterized in that

[0033] When a symbol is indicated as downlink and available for uplink transmission by the uplink-downlink TDD configuration signaling, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0034] The present application discloses a method in a second node for wireless communication, which is characterized in that it includes:

[0035] Receiving multiple PUSCHs, all of the multiple PUSCHs overlapping with a first PUCCH, and a first UCI being associated with the first PUCCH;

[0036] Among them, the first UCI is multiplexed into one of the multiple PUSCHs. Whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; the symbol type of the symbol corresponding to one PUSCH among the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full-duplex and non-full-duplex.

[0037] As an embodiment, the second node is a base station.

[0038] According to one aspect of the present application, the above method is characterized in that

[0039] If at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is one of the multiple PUSCHs corresponding to the non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

[0040] According to one aspect of the present application, the above method is characterized in that

[0041] When at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the multiple PUSCHs corresponding to the non-full-duplex symbol.

[0042] According to one aspect of the present application, the above method is characterized in that

[0043] If at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS adopted by any PUSCH corresponding to the full-duplex symbol among the multiple PUSCHs is lower than the index of the MCS adopted by each PUSCH corresponding to the non-full-duplex symbol among the multiple PUSCHs: then the PUSCH for multiplexing the first UCI is one of the multiple PUSCHs corresponding to the non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

[0044] According to one aspect of the present application, the above method is characterized in that

[0045] Whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs only when the first set of conditions is satisfied; one condition in the first set of conditions includes that none of the multiple PUSCHs carry aperiodic CSI.

[0046] According to one aspect of the present application, the above method is characterized in that it includes:

[0047] Transmitting multiple DCI formats;

[0048] Wherein, each of the multiple PUSCHs is scheduled by one of the multiple DCI formats.

[0049] According to one aspect of the present application, the above method is characterized in that

[0050] The multiple PUSCHs are on the same serving cell.

[0051] According to one aspect of the present application, the above method is characterized in that

[0052] When a symbol is indicated as downlink and available for uplink transmission by the uplink-downlink TDD configuration signaling, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0053] The present application discloses a first node for wireless communication, which is characterized in that it includes:

[0054] A first transmitter that transmits multiple PUSCHs, all of the multiple PUSCHs overlap with a first PUCCH, and a first UCI is associated with the first PUCCH;

[0055] Wherein, the first UCI is multiplexed into one of the multiple PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; the symbol type of the symbol corresponding to one of the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full-duplex and non-full-duplex.

[0056] The present application discloses a second node for wireless communication, which is characterized in that it includes:

[0057] A second receiver that receives multiple PUSCHs, all of the multiple PUSCHs overlap with a first PUCCH, and a first UCI is associated with the first PUCCH;

[0058] Among them, the first UCI is multiplexed into one PUSCH among the multiple PUSCHs. Whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the multiple PUSCHs; the symbol type of the symbols corresponding to one PUSCH among the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full duplex and half duplex.

[0059] As an embodiment, the present application has the following advantages:

[0060] · Optimize UCI multiplexing under the comprehensive consideration of the interference received by UCI transmission and the transmission delay of UCI according to the characteristics of full-duplex symbols and half-duplex symbols;

[0061] · Facilitate improving the uplink transmission efficiency under the configuration of full-duplex symbols and half-duplex symbols;

[0062] · Facilitate overall optimization by comprehensively considering different uplink transmission scenarios;

[0063] · Small standardization workload. Description of the Drawings

[0064] By reading the following detailed description of non-limiting embodiments with reference to the accompanying drawings, other features, objects, and advantages of the present application will become more apparent:

[0065] Figure 1 Shows a processing flow chart of a first node according to an embodiment of the present application;

[0066] Figure 2 Shows a schematic diagram of a network architecture according to an embodiment of the present application;

[0067] Figure 3 Shows a schematic diagram of a radio protocol architecture of a user plane and a control plane according to an embodiment of the present application;

[0068] Figure 4 Shows a schematic diagram of a first communication device and a second communication device according to an embodiment of the present application;

[0069] Figure 5 Shows a signal transmission flow chart according to an embodiment of the present application;

[0070] Figure 6 Shows an illustrative schematic diagram in which multiple PUSCHs all overlap with a first PUCCH according to an embodiment of the present application;

[0071] Figure 7 It shows an explanatory schematic diagram of whether the first UCI according to an embodiment of the present application is multiplexed into the earliest PUSCH among multiple PUSCHs or other PUSCHs, depending on the symbol type of at least one symbol corresponding to the multiple PUSCHs;

[0072] Figure 8 It shows an explanatory schematic diagram of whether the first UCI according to an embodiment of the present application is multiplexed into the earliest PUSCH among multiple PUSCHs or other PUSCHs, depending on the symbol type of at least one symbol corresponding to the multiple PUSCHs;

[0073] Figure 9 It shows an explanatory schematic diagram of the preconditions for whether the first UCI according to an embodiment of the present application is multiplexed into the earliest PUSCH among multiple PUSCHs or other PUSCHs, depending on the symbol type of at least one symbol corresponding to the multiple PUSCHs;

[0074] Figure 10 It shows an explanatory schematic diagram of full-duplex symbols and non-full-duplex symbols according to an embodiment of the present application;

[0075] Figure 11 It shows a structural block diagram of a processing device in a first node according to an embodiment of the present application;

[0076] Figure 12 It shows a structural block diagram of a processing device in a second node according to an embodiment of the present application. Detailed implementation manners

[0077] The technical solutions of the present application will be further described in detail below with reference to the accompanying drawings. It should be noted that, without conflict, the embodiments of the present application and the features in the embodiments can be combined arbitrarily with each other.

[0078] Example 1

[0079] Embodiment 1 exemplifies a processing flowchart of a first node according to an embodiment of the present application, as shown in the attached Figure 1 figure.

[0080] In Embodiment 1, the first node in the present application sends multiple PUSCHs in step 101.

[0081] In Embodiment 1, the multiple PUSCHs all overlap with a first PUCCH, and a first UCI is associated with the first PUCCH; the first UCI is multiplexed into one of the multiple PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; the symbol type of the symbol corresponding to one of the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full duplex and non-full duplex.

[0082] As an embodiment, the multiple PUSCHs are 2 PUSCHs.

[0083] As an embodiment, the multiple PUSCHs are more than 2 PUSCHs.

[0084] As an embodiment, with reference to slots for PUCCH (Physical Uplink Control CHannel) transmissions, the multiple PUSCHs are in the same time slot.

[0085] As an embodiment, the multiple PUSCHs are transmitted on their respective serving cells.

[0086] As an embodiment, the multiple PUSCHs are on the same serving cell, and the serving cell index corresponding to the serving cell where any PUSCH overlapping with the first PUCCH is located is not less than the serving cell index corresponding to the same serving cell.

[0087] As an embodiment, the multiple PUSCHs are all PUSCHs scheduled in DCI (Downlink Control Information) format.

[0088] As an embodiment, the multiple PUSCHs are all PUSCHs with configured grant.

[0089] As an embodiment, transmitting the multiple PUSCHs includes: transmitting at least one of a transport block and UCI in each of the multiple PUSCHs.

[0090] As an embodiment, in this application, the overlap between a PUSCH and a PUCCH refers to the overlap in the time domain.

[0091] As an example, the first PUCCH carries the first UCI.

[0092] As an example, the first UCI would be transmitted in the first PUCCH.

[0093] As an example, the first PUCCH is triggered to send the first UCI.

[0094] As an example, the first UCI includes HARQ-ACK (Hybrid Automatic Repeat Request Acknowledgement) information.

[0095] As an example, the first UCI includes HARQ-ACK information and CSI (Channel State Information) report(s).

[0096] As an example, the first UCI is multiplexed into one of the multiple PUSCHs, including: after multiplexing the first UCI with data and / or aperiodic CSI, it is transmitted on the one of the multiple PUSCHs.

[0097] As an example, the first UCI is multiplexed into one of the multiple PUSCHs, and the one of the multiple PUSCHs is the PUSCH for multiplexing the first UCI.

[0098] As an example, the symbol type of the symbols corresponding to each of the multiple PUSCHs is one of the multiple symbol types.

[0099] As an example, any one of the multiple PUSCHs corresponds to a full-duplex symbol or a non-full-duplex symbol.

[0100] As an example, one PUSCH corresponds to a full-duplex symbol, and the symbol type of the symbols corresponding to this PUSCH is full-duplex.

[0101] As an example, one PUSCH corresponds to a non-full-duplex symbol, and the symbol type of the symbols corresponding to this PUSCH is non-full-duplex.

[0102] As an example, when the symbols allocated to a PUSCH in the time domain are all full-duplex symbols, this PUSCH corresponds to a full-duplex symbol.

[0103] As an example, when the symbols allocated to a PUSCH in the time domain are all non-full-duplex symbols, this PUSCH corresponds to non-full-duplex symbols.

[0104] As an example, when the time-domain allocation of a PUSCH is within full-duplex symbols, this PUSCH corresponds to full-duplex symbols.

[0105] As an example, when the time-domain allocation of a PUSCH is within non-full-duplex symbols, this PUSCH corresponds to non-full-duplex symbols.

[0106] As an example, the time-domain allocation of any one of the plurality of PUSCHs does not span full-duplex symbols and non-full-duplex symbols.

[0107] As an example, when at least one of the plurality of PUSCHs corresponds to full-duplex symbols and at least one of the plurality of PUSCHs corresponds to non-full-duplex symbols, the PUSCH for multiplexing the first UCI is one of the plurality of PUSCHs that corresponds to non-full-duplex symbols.

[0108] Example 2

[0109] Embodiment 2 exemplifies a schematic diagram of a network architecture according to an embodiment of the present application, as shown in the appendix Figure 2 shown. Appendix Figure 2Describes the network architecture 200 of the 5G NR (New Radio) / LTE (Long-Term Evolution) / LTE-A (Long-Term Evolution Advanced) system. The 5G NR / LTE / LTE-A network architecture 200 may be referred to as 5GS (5G System) / EPS (Evolved Packet System) or some other suitable term. The 5GS / EPS 200 includes at least one of UE (User Equipment) 201, RAN (Radio Access Network) 202, 5GC (5G Core Network) / EPC (Evolved Packet Core) 210, HSS (Home Subscriber Server) / UDM (Unified Data Management) 220, and Internet service 230. The 5GS / EPS may be interconnected with other access networks, but these entities / interfaces are not shown for simplicity. As shown, the 5GS / EPS provides packet-switched services. However, those skilled in the art will readily understand that the various concepts presented throughout this application can be extended to networks providing circuit-switched services or other cellular networks. The RAN includes node 203 and other nodes 204. Node 203 provides user and control plane protocol termination towards UE 201. Node 203 may be connected to other nodes 204 via the Xn interface (e.g., backhaul) / X2 interface. Node 203 may also be referred to as a base station, base transceiver station, radio base station, radio transceiver, transceiver function, Basic Service Set (BSS), Extended Service Set (ESS), TRP (Transmitter Receiver Point), or some other suitable term. Node 203 provides an access point for UE 201 to the 5GC / EPC 210. Examples of UE 201 include cellular phones, smartphones, Session Initiation Protocol (SIP) phones, laptop computers, personal digital assistants (PDAs), satellite radios, non-terrestrial base station communications, satellite mobile communications, global positioning systems, multimedia devices, video devices, digital audio players (e.g., MP3 players), cameras, game consoles, drones, aircraft, narrowband Internet of Things devices, machine type communication devices, land vehicles, cars, wearable devices, or any other similar functional device.A person skilled in the art may also refer to the UE 201 as a mobile station, subscriber station, mobile unit, subscriber unit, radio unit, remote unit, mobile device, radio device, wireless communication device, remote device, mobile subscriber station, access terminal, mobile terminal, wireless terminal, remote terminal, handset, user agent, mobile client, client, or some other suitable term. The node 203 is connected to the 5GC / EPC 210 via the S1 / NG interface. The 5GC / EPC 210 includes an MME (Mobility Management Entity) / AMF (Authentication Management Field) / SMF (Session Management Function) 211, other MME / AMF / SMF 214, an S-GW (Service Gateway) / UPF (User Plane Function) 212, and a P-GW (Packet Date Network Gateway) / UPF 213. The MME / AMF / SMF 211 is a control node that processes the signaling between the UE 201 and the 5GC / EPC 210. Generally, the MME / AMF / SMF 211 provides bearer and connection management. All user IP (Internet Protocol) packets are transmitted through the S-GW / UPF 212, and the S-GW / UPF 212 itself is connected to the P-GW / UPF 213. The P-GW provides UE IP address allocation and other functions. The P-GW / UPF 213 is connected to the Internet service 230. The Internet service 230 includes operator-corresponding Internet protocol services, which may specifically include the Internet, intranet, IMS (IP Multimedia Subsystem), and packet switching services.

[0110] As an embodiment, the UE 201 corresponds to the first node in the present application.

[0111] As an embodiment, the gNB 203 corresponds to the second node in the present application.

[0112] As an embodiment, the gNB 203 is a macrocellular base station.

[0113] As an embodiment, the gNB 203 is a microcell base station.

[0114] As an example, the gNB 203 is a pico cell base station.

[0115] As an example, the gNB 203 is a femto cell.

[0116] As an example, the gNB 203 is a base station device supporting large delay differences.

[0117] As an example, the gNB 203 is a flying platform device.

[0118] As an example, the gNB 203 is a satellite device.

[0119] Example 3

[0120] Embodiment 3 shows a schematic diagram of an embodiment of a radio protocol architecture for a user plane and a control plane according to the present application, as shown in the appendix Figure 3 as follows. Figure 3 It is a schematic diagram illustrating an embodiment of a radio protocol architecture for a user plane 350 and a control plane 300. Figure 3Show the radio protocol architecture of the control plane 300 for a first communication node device (UE, gNB or RSU (Road Side Unit), in-vehicle device or in-vehicle communication module in V2X (Vehicle to Everything)) and a second communication node device (gNB, UE or RSU in V2X, in-vehicle device or in-vehicle communication module), or between two UEs, using three layers: Layer 1 (L1), Layer 2 (L2) and Layer 3 (L3). L1 is the lowest layer and implements various PHY (Physical Layer) signal processing functions. L1 will be referred to as PHY301 in this document. Layer 2 (L2 layer) 305 is above PHY301 and is responsible for the link between the first communication node device and the second communication node device and between two UEs through PHY301. L2 305 includes a MAC (Medium Access Control) sublayer 302, an RLC (Radio Link Control) sublayer 303 and a PDCP (Packet Data Convergence Protocol) sublayer 304, and these sublayers terminate at the second communication node device. The PDCP sublayer 304 provides multiplexing between different radio bearers and logical channels. The PDCP sublayer 304 also provides security by encrypting data packets and provides handover support for the first communication node device between the second communication node devices. The RLC sublayer 303 provides segmentation and reassembly of upper layer data packets, retransmission of lost data packets and reordering of data packets to compensate for disordered reception due to HARQ (Hybrid Automatic Repeat Qequest). The MAC sublayer 302 provides multiplexing between logical and transport channels. The MAC sublayer 302 is also responsible for allocating various radio resources (e.g., resource blocks) in a cell between the first communication node devices. The MAC sublayer 302 is also responsible for HARQ operations. The RRC (Radio Resource Control) sublayer 306 in L3 in the control plane 300 is responsible for obtaining radio resources (i.e., radio bearers) and configuring the lower layers using RRC signaling between the second communication node device and the first communication node device.The radio protocol architecture of the user plane 350 includes Layer 1 (L1) and Layer 2 (L2). The radio protocol architecture for the first communication node device and the second communication node device in the user plane 350 is substantially the same as the corresponding layers and sub-layers in the control plane 300 for the physical layer 351, the PDCP sub-layer 354 in the L2 layer 355, the RLC sub-layer 353 in the L2 layer 355, and the MAC sub-layer 352 in the L2 layer 355. However, the PDCP sub-layer 354 also provides header compression for upper layer data packets to reduce radio transmission overhead. The L2 layer 355 in the user plane 350 also includes an SDAP (Service Data Adaptation Protocol) sub-layer 356, and the SDAP sub-layer 356 is responsible for the mapping between QoS (Quality of Service) flows and data radio bearers (DRBs, Data Radio Bearer) to support the diversity of services. Although not shown, the first communication node device may have several upper layers above the L2 layer 355, including a network layer (e.g., an IP (Internet Protocol) layer) that terminates at the P-GW on the network side and an application layer that terminates at the other end of the connection (e.g., a remote UE, a server, etc.).

[0121] As an example, the Figure 3 radio protocol architecture in

[0122] As an example, the Figure 3 radio protocol architecture in

[0123] As an example, the multiple DCI formats in this application are all generated in the PHY301.

[0124] As an example, the multiple PUSCHs in this application are all generated in the PHY351.

[0125] Example 4

[0126] Embodiment 4 shows a schematic diagram of the first communication device and the second communication device according to this application, as shown in Figure 4 shown. Figure 4 It is a block diagram of the first communication device 410 and the second communication device 450 that communicate with each other in the access network.

[0127] The first communication device 410 includes a controller / processor 475, a memory 476, a receiving processor 470, a transmitting processor 416, a multi-antenna receiving processor 472, a multi-antenna transmitting processor 471, a transmitter / receiver 418, and an antenna 420.

[0128] The second communication device 450 includes a controller / processor 459, a memory 460, a data source 467, a transmit processor 468, a receive processor 456, a multi-antenna transmit processor 457, a multi-antenna receive processor 458, a transmitter / receiver 454, and an antenna 452.

[0129] In the transmission from the first communication device 410 to the second communication device 450, at the first communication device 410, upper layer data packets from the core network are provided to the controller / processor 475. The controller / processor 475 implements the functionality of the L2 layer. In the transmission from the first communication device 410 to the second communication device 450, the controller / processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the second communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for retransmission of lost packets and signaling to the second communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 416 implements encoding and interleaving to facilitate forward error correction (FEC) at the second communication device 450, and mapping of signal constellations based on various modulation schemes (e.g., binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), M-phase shift keying (M-PSK), M-quadrature amplitude modulation (M-QAM)). The multi-antenna transmit processor 471 performs digital spatial precoding on the encoded and modulated symbols, including codebook-based precoding and non-codebook-based precoding, and beamforming processing, to generate one or more spatial streams. The transmit processor 416 then maps each spatial stream to subcarriers, multiplexes with reference signals (e.g., pilots) in the time domain and / or frequency domain, and then uses an inverse fast Fourier transform (IFFT) to generate a physical channel carrying a time-domain multi-carrier symbol stream. Subsequently, the multi-antenna transmit processor 471 performs transmit analog precoding / beamforming operations on the time-domain multi-carrier symbol stream. Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 471 into a radio frequency stream, and then provides it to a different antenna 420.

[0130] In the transmission from the first communication device 410 to the second communication device 450, at the second communication device 450, each receiver 454 receives signals via its respective antenna 452. Each receiver 454 recovers the information modulated onto the radio frequency carrier and converts the radio frequency stream into a baseband multi-carrier symbol stream that is provided to the receive processor 456. The receive processor 456 and the multi-antenna receive processor 458 perform various signal processing functions of the L1 layer. The multi-antenna receive processor 458 performs receive analog precoding / beamforming operations on the baseband multi-carrier symbol stream from the receivers 454. The receive processor 456 uses the Fast Fourier Transform (FFT) to convert the baseband multi-carrier symbol stream after the receive analog precoding / beamforming operations from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receive processor 456, where the reference signal will be used for channel estimation, and the data signal is recovered for any spatial stream destined for the second communication device 450 after multi-antenna detection in the multi-antenna receive processor 458. The symbols on each spatial stream are demodulated and recovered in the receive processor 456, and soft decisions are generated. Subsequently, the receive processor 456 decodes and de-interleaves the soft decisions to recover the upper layer data and control signals transmitted by the first communication device 410 on the physical channel. Subsequently, the upper layer data and control signals are provided to the controller / processor 459. The controller / processor 459 performs the functions of the L2 layer. The controller / processor 459 may be associated with a memory 460 that stores program code and data. The memory 460 may be referred to as a computer-readable medium. In the transmission from the first communication device 410 to the second communication device 450, the controller / processor 459 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover upper layer data packets from the core network. Subsequently, the upper layer data packets are provided to all protocol layers above the L2 layer. Various control signals may also be provided to the L3 for L3 processing.

[0131] In the transmission from the second communication device 450 to the first communication device 410, at the second communication device 450, the data source 467 is used to provide upper layer data packets to the controller / processor 459. The data source 467 represents all protocol layers above the L2 layer. Similar to the transmission function described at the first communication device 410 in the transmission from the first communication device 410 to the second communication device 450, the controller / processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels based on radio resource allocation, and implements the L2 layer functions for the user plane and the control plane. The controller / processor 459 is also responsible for retransmitting lost packets and signaling to the first communication device 410. The transmit processor 468 performs modulation mapping and channel coding processing, and the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing. Subsequently, the transmit processor 468 modulates the generated spatial streams into multi-carrier / single-carrier symbol streams, and after passing through the analog precoding / beamforming operation in the multi-antenna transmit processor 457, provides them to different antennas 452 via the transmitter 454. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a radio frequency symbol stream and then provides it to the antenna 452.

[0132] In the transmission from the second communication device 450 to the first communication device 410, the functions at the first communication device 410 are similar to the receiving functions described at the second communication device 450 in the transmission from the first communication device 410 to the second communication device 450. Each receiver 418 receives a radio frequency signal through its corresponding antenna 420, converts the received radio frequency signal into a baseband signal, and provides the baseband signal to the multi-antenna receive processor 472 and the receive processor 470. The receive processor 470 and the multi-antenna receive processor 472 jointly implement the L1 layer functions. The controller / processor 475 implements the L2 layer functions. The controller / processor 475 may be associated with a memory 476 that stores program code and data. The memory 476 may be referred to as a computer-readable medium. In the transmission from the second communication device 450 to the first communication device 410, the controller / processor 475 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover the upper layer data packets from the UE 450. The upper layer data packets from the controller / processor 475 may be provided to the core network.

[0133] As an example, the first node in this application includes the second communication device 450, and the second node in this application includes the first communication device 410.

[0134] As a sub - embodiment of the above - mentioned embodiment, the first node is a user equipment, and the second node is a relay node.

[0135] As a sub - embodiment of the above - mentioned embodiment, the first node is a user equipment, and the second node is a base station device.

[0136] As a sub - embodiment of the above - mentioned embodiment, the first node is a relay node, and the second node is a base station device.

[0137] As an embodiment, the second communication device 450 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor. The second communication device 450 is at least configured to: transmit a plurality of PUSCHs, all of the plurality of PUSCHs overlapping with a first PUCCH, and a first UCI being associated with the first PUCCH;

[0138] Wherein, the first UCI is multiplexed into one of the plurality of PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbol corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types includes full - duplex and non - full - duplex.

[0139] As a sub - embodiment of the above - mentioned embodiment, the second communication device 450 corresponds to the first node in the present application.

[0140] As an embodiment, the second communication device 450 includes: a memory storing a computer - readable instruction program, the computer - readable instruction program generating actions when executed by at least one processor, the actions including: transmitting a plurality of PUSCHs, all of the plurality of PUSCHs overlapping with a first PUCCH, and a first UCI being associated with the first PUCCH;

[0141] Wherein, the first UCI is multiplexed into one of the plurality of PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbol corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types includes full - duplex and non - full - duplex.

[0142] As a sub - embodiment of the above - mentioned embodiment, the second communication device 450 corresponds to the first node in the present application.

[0143] As an embodiment, the first communication device 410 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used together with the at least one processor. The first communication device 410 is at least configured to: receive a plurality of PUSCHs, all of the plurality of PUSCHs overlapping with a first PUCCH, and a first UCI being associated with the first PUCCH;

[0144] Wherein, the first UCI is multiplexed into one of the plurality of PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbol corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types include full - duplex and non - full - duplex.

[0145] As a sub - embodiment of the above - mentioned embodiment, the first communication device 410 corresponds to the second node in the present application.

[0146] As an embodiment, the first communication device 410 includes: a memory storing a computer - readable instruction program, and the computer - readable instruction program generates actions when executed by at least one processor, the actions including: receiving a plurality of PUSCHs, all of the plurality of PUSCHs overlapping with a first PUCCH, and a first UCI being associated with the first PUCCH;

[0147] Wherein, the first UCI is multiplexed into one of the plurality of PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbol corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types include full - duplex and non - full - duplex.

[0148] As a sub - embodiment of the above - mentioned embodiment, the first communication device 410 corresponds to the second node in the present application.

[0149] As an embodiment, the first node in the present application includes the second communication device 450.

[0150] As an example, the second node in the present application includes the first communication device 410.

[0151] As an example, at least one of {the antenna 452, the receiver 454, the multi-antenna reception processor 458, the reception processor 456, the controller / processor 459, the memory 460, the data source 467} is used to receive the multiple DCI formats in the present application.

[0152] As an example, at least one of {the antenna 420, the transmitter 418, the multi-antenna transmission processor 471, the transmission processor 416, the controller / processor 475, the memory 476} is used to send the multiple DCI formats in the present application.

[0153] As an example, at least one of {the antenna 452, the transmitter 454, the multi-antenna transmission processor 457, the transmission processor 468, the controller / processor 459, the memory 460, the data source 467} is used to send the multiple PUSCHs in the present application.

[0154] As an example, at least one of {the antenna 420, the receiver 418, the multi-antenna reception processor 472, the reception processor 470, the controller / processor 475, the memory 476} is used to receive the multiple PUSCHs in the present application.

[0155] Example 5

[0156] Embodiment 5 exemplifies a signal transmission flowchart according to an embodiment of the present application, as shown in the appendix Figure 5 as shown. In the appendix Figure 5 the first node U1 and the second node U2 communicate through an air interface. Specifically, in the appendix Figure 5 the steps in the dashed box F1 are optional.

[0157] The first node U1 receives multiple DCI formats in step S511; and sends multiple PUSCHs in step S512.

[0158] The second node U2 sends multiple DCI formats in step S521; and receives multiple PUSCHs in step S522.

[0159] In Embodiment 5, the multiple PUSCHs all overlap with a first PUCCH, and a first UCI is associated with the first PUCCH; the first UCI is multiplexed into one of the multiple PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the multiple PUSCHs; the symbol type of the symbols corresponding to one of the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full duplex and non-full duplex; when a symbol is indicated as downlink by uplink-downlink TDD configuration signaling and is available for uplink transmission, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by uplink-downlink TDD configuration signaling, this symbol is a non-full duplex symbol; the multiple PUSCHs are on the same serving cell; each of the multiple PUSCHs is scheduled by one of the multiple DCI formats.

[0160] As a sub-embodiment of Embodiment 5, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the multiple PUSCHs only when a first set of conditions is satisfied; one of the conditions in the first set of conditions includes that none of the multiple PUSCHs carry aperiodic CSI.

[0161] As a sub-embodiment of Embodiment 5, if at least one of the multiple PUSCHs corresponds to a full-duplex symbol and at least one of the multiple PUSCHs corresponds to a non-full duplex symbol, the PUSCH for multiplexing the first UCI is one of the multiple PUSCHs corresponding to a non-full duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

[0162] As a sub-embodiment of Embodiment 5, if at least one of the multiple PUSCHs corresponds to a full-duplex symbol and at least one of the multiple PUSCHs corresponds to a non-full duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the multiple PUSCHs corresponding to a non-full duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

[0163] As a sub - embodiment of Embodiment 5, if at least one of the plurality of PUSCHs corresponds to a full - duplex symbol and at least one of the plurality of PUSCHs corresponds to a non - full - duplex symbol, and the index of the MCS used by any one of the PUSCHs corresponding to the full - duplex symbol among the plurality of PUSCHs is lower than the index of the MCS used by each of the PUSCHs corresponding to the non - full - duplex symbol among the plurality of PUSCHs: then the PUSCH for multiplexing the first UCI is one of the PUSCHs corresponding to the non - full - duplex symbol among the plurality of PUSCHs; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0164] As an embodiment, the first PUCCH is triggered by a signaling sent from the second node to the first node.

[0165] As an embodiment, the plurality of DCI formats correspond one - to - one with the plurality of PUSCHs.

[0166] As an embodiment, the first node U1 is the first node in this application.

[0167] As an embodiment, the second node U2 is the second node in this application.

[0168] As an embodiment, the first node U1 is a UE.

[0169] As an embodiment, the second node U2 is a base station.

[0170] As an embodiment, the air interface between the second node U2 and the first node U1 is the Uu interface.

[0171] As an embodiment, the air interface between the second node U2 and the first node U1 includes a cellular link.

[0172] As an embodiment, the air interface between the second node U2 and the first node U1 includes a wireless interface between a base station device and a user equipment.

[0173] As an embodiment, the air interface between the second node U2 and the first node U1 includes a wireless interface between a satellite device and a user equipment.

[0174] As an embodiment, the air interface between the second node U2 and the first node U1 includes a wireless interface between a relay device and a user equipment.

[0175] As an embodiment, the first PUCCH is not transmitted.

[0176] As an embodiment, the steps in the dashed box F1 exist.

[0177] As an embodiment, the steps in the dashed box F1 do not exist.

[0178] Example 6

[0179] Embodiment 6 exemplifies an illustrative schematic diagram in which multiple PUSCHs according to an embodiment of the present application all overlap with a first PUCCH, as shown in the appendix Figure 6 shown. In the appendix Figure 6 a blank box represents one PUSCH among the multiple PUSCHs, and a gray-filled box represents the first PUCCH.

[0180] In Embodiment 6, the multiple PUSCHs include 3 PUSCHs, and each PUSCH among the multiple PUSCHs overlaps with the first PUCCH in the time domain.

[0181] Example 7

[0182] Embodiment 7 exemplifies an illustrative schematic diagram of whether a first UCI is multiplexed into the earliest PUSCH among multiple PUSCHs or other PUSCHs depending on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs, as shown in the appendix Figure 7 shown.

[0183] In Embodiment 7, if at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH used to multiplex the first UCI is the earliest PUSCH among the multiple PUSCHs that corresponds to a non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

[0184] As an embodiment, the multiple PUSCHs do not overlap with each other in the time domain.

[0185] As an embodiment, the start times of the multiple PUSCHs are different from each other; the "earliest" is determined according to the start time.

[0186] As an embodiment, when there is only one PUSCH corresponding to a non-full-duplex symbol among the multiple PUSCHs, the only one PUSCH corresponding to a non-full-duplex symbol is the earliest PUSCH among the multiple PUSCHs that corresponds to a non-full-duplex symbol.

[0187] As an example, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs, including: regardless of whether the earliest PUSCH among the plurality of PUSCHs corresponds to a full-duplex symbol or a non-full-duplex symbol, the first UCI is always multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0188] As an example, at least one PUSCH among the plurality of PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the plurality of PUSCHs corresponds to a non-full-duplex symbol. The PUSCH for multiplexing the first UCI is the earliest PUSCH among the plurality of PUSCHs that corresponds to a non-full-duplex symbol; or, all the plurality of PUSCHs correspond to full-duplex symbols, and the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs; or, all the plurality of PUSCHs correspond to non-full-duplex symbols, and the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0189] As an example, when at least one PUSCH among the plurality of PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the plurality of PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the plurality of PUSCHs that corresponds to a non-full-duplex symbol.

[0190] As an example, when all the plurality of PUSCHs correspond to full-duplex symbols, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0191] As an example, when all the plurality of PUSCHs correspond to non-full-duplex symbols, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0192] Example 8

[0193] Example 8 exemplifies a schematic diagram showing whether the first UCI according to an embodiment of the present application is multiplexed into the earliest PUSCH among a plurality of PUSCHs or other PUSCHs depending on the symbol type of the symbol corresponding to at least one PUSCH among the plurality of PUSCHs, as shown in the attached Figure 8 figure.

[0194] In Embodiment 8, if at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS used for any one of the PUSCHs corresponding to the full-duplex symbol among the plurality of PUSCHs is at least k less than the index of the MCS used for each of the PUSCHs corresponding to the non-full-duplex symbol among the plurality of PUSCHs: then the PUSCH used for multiplexing the first UCI is one of the PUSCHs corresponding to the non-full-duplex symbol among the plurality of PUSCHs; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs;

[0195] Wherein, the k is a positive integer greater than 1.

[0196] As an embodiment, generally speaking, a large MCS gap and a large channel quality gap are positively correlated; in the case of a relatively large MCS gap, multiplexing the UCI onto the PUSCH corresponding to the non-full-duplex symbol (which generally has less interference) can more significantly improve the transmission performance.

[0197] As an embodiment, the k is configurable.

[0198] As an embodiment, the k is indicated by RRC signaling.

[0199] As an embodiment, the k is predefined.

[0200] As an embodiment, if at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS used for any one of the PUSCHs corresponding to the full-duplex symbol among the plurality of PUSCHs is at least k less than the index of the MCS used for each of the PUSCHs corresponding to the non-full-duplex symbol among the plurality of PUSCHs: then the PUSCH used for multiplexing the first UCI is the earliest PUSCH corresponding to the non-full-duplex symbol among the plurality of PUSCHs.

[0201] As an embodiment, all of the plurality of PUSCHs are PUSCHs used for the initial transmission of a transport block.

[0202] As an embodiment, all of the plurality of PUSCHs are used to transmit one transport block.

[0203] As an embodiment, the index of the MCS used for one of the plurality of PUSCHs is indicated by the DCI format that schedules the one PUSCH among the plurality of PUSCHs.

[0204] As an example, one of the multiple PUSCHs is used for retransmission of a transport block, and the index of the MCS used by the one PUSCH among the multiple PUSCHs is the MCS index indicated by the DCI format that schedules the initial transmission of the transport block.

[0205] As an example, the index of the MCS used by one of the multiple PUSCHs is configured by higher layer signaling.

[0206] As an example, the larger the index of the MCS used by a PUSCH, the higher the corresponding spectral efficiency.

[0207] Example 9

[0208] Embodiment 9 exemplifies a schematic diagram for explaining the prerequisite conditions of whether the first UCI according to an embodiment of the present application is multiplexed into the earliest PUSCH among multiple PUSCHs or other PUSCHs depending on the symbol type of the symbol corresponding to at least one of the multiple PUSCHs, as shown in the appendix Figure 9 as shown.

[0209] In Embodiment 9, only when the first condition set is satisfied, there is: whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs depends on the symbol type of the symbol corresponding to at least one of the multiple PUSCHs;

[0210] Among them, one condition in the first condition set includes: none of the multiple PUSCHs carry aperiodic CSI.

[0211] As an example, none of the multiple PUSCHs carry aperiodic CSI, which means that the first node does not multiplex aperiodic CSI in any of the multiple PUSCHs.

[0212] As an example, when the first condition set is not satisfied, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs does not depend on the symbol type of the symbols corresponding to the multiple PUSCHs.

[0213] As an example, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or other PUSCHs regardless of the symbol type of the symbols corresponding to the multiple PUSCHs includes: (regardless of the symbol type of the symbols corresponding to the multiple PUSCHs,) the first UCI is multiplexed into the PUSCH among the multiple PUSCHs that carries the aperiodic CSI.

[0214] As an example, that the first condition set is satisfied means that all conditions in the first condition set are satisfied.

[0215] As an example, the first condition set includes only one condition.

[0216] As an example, the first condition set includes multiple conditions.

[0217] As an example, the first condition set is that none of the multiple PUSCHs carry aperiodic CSI.

[0218] As an example, one condition in the first condition set is that none of the multiple PUSCHs carry aperiodic CSI.

[0219] As an example, one condition in the first condition set is that none of the PUSCHs overlapping with the first PUCCH carry aperiodic CSI.

[0220] As an example, that none of the PUSCHs overlapping with the first PUCCH carry aperiodic CSI means that the first node does not multiplex aperiodic CSI in any of the PUSCHs overlapping with the first PUCCH.

[0221] As an example, the first condition set further includes the following condition: the multiple PUSCHs are on the same serving cell, and the serving cell index corresponding to the serving cell where any PUSCH overlapping with the first PUCCH is located is not less than the serving cell index corresponding to the same serving cell.

[0222] As an example, the multiple PUSCHs are all PUSCHs scheduled by DCI format.

[0223] As an example, when one of the multiple PUSCHs carries aperiodic CSI, the first UCI is multiplexed into the PUSCH among the multiple PUSCHs that carries aperiodic CSI.

[0224] As an embodiment, only when none of the PUSCHs overlapping with the first PUCCH carry aperiodic CSI, which PUSCH among the multiple PUSCHs the first UCI is multiplexed into depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs.

[0225] As an embodiment, when one PUSCH overlapping with the first PUCCH carries aperiodic CSI, the first UCI is multiplexed into the one PUSCH overlapping with the first PUCCH.

[0226] As an embodiment, among the PUSCHs overlapping with the first PUCCH, there is at most one PUSCH carrying aperiodic CSI.

[0227] Example 10

[0228] Embodiment 10 exemplifies an explanatory schematic diagram of full-duplex symbols and non-full-duplex symbols according to an embodiment of the present application, as shown in the appendix Figure 10 as follows.

[0229] In Embodiment 10, when a symbol is indicated as Downlink by the uplink-downlink TDD configuration signaling and is available for uplink transmission, this symbol is a full-duplex symbol; when a symbol is indicated as Uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0230] As an embodiment, a symbol in the present application is an OFDM (Orthogonal Frequency Division Multiplex) symbol.

[0231] As an embodiment, a symbol in the present application is a symbol in a slot.

[0232] As an embodiment, a symbol in the present application is a symbol defined in the time domain.

[0233] As an embodiment, a symbol can be configured as one of a full-duplex symbol or a non-full-duplex symbol.

[0234] As an embodiment, the symbol type of a full-duplex symbol is full-duplex.

[0235] As an embodiment, the symbol type of a non-full-duplex symbol is non-full-duplex.

[0236] As an example, when a symbol is in a symbol indicated as downlink by the uplink-downlink TDD configuration signaling and is available for uplink transmission, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0237] As an example, when a symbol is in a time-domain resource indicated as downlink by the uplink-downlink TDD configuration signaling and is available for uplink transmission, this symbol is a full-duplex symbol; when a symbol is in a time-domain resource indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0238] As an example, when a symbol is indicated as downlink by the uplink-downlink TDD configuration signaling and is available for uplink transmission, this symbol is a full-duplex symbol.

[0239] As an example, when a symbol is in a time-domain resource indicated as downlink by the uplink-downlink TDD configuration signaling and is available for uplink transmission, this symbol is a full-duplex symbol.

[0240] As an example, the advantages of the above method include: being conducive to improving the uplink capacity.

[0241] As an example, whether a symbol is a full-duplex symbol or a non-full-duplex symbol depends on the uplink-downlink TDD configuration signaling.

[0242] As an example, there does not exist a symbol that is both a full-duplex symbol and a non-full-duplex symbol.

[0243] As an example, when a symbol is not a full-duplex symbol, this symbol is a non-full-duplex symbol.

[0244] As an example, when a symbol is indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0245] As an example, when a symbol is in a time-domain resource indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0246] As an example, when a symbol is configured to be available for full-duplex operation, this symbol is a full-duplex symbol; when a symbol is configured not to be available for full-duplex operation, this symbol is a non-full-duplex symbol.

[0247] As an example, when a symbol is configured to be available for full-duplex operation, this symbol is a full-duplex symbol; when a symbol is not configured to be available for full-duplex operation, this symbol is a non-full-duplex symbol.

[0248] As an example, the symbols used for SBFD operations are full-duplex symbols, not half-duplex symbols.

[0249] As an example, the symbols not used for SBFD operations are half-duplex symbols, not full-duplex symbols.

[0250] As an example, SBFD symbols are full-duplex symbols, and non-SBFD symbols are half-duplex symbols.

[0251] As an example, the symbols in a full-duplex time slot are all full-duplex symbols.

[0252] As an example, the symbols in a half-duplex time slot are all half-duplex symbols.

[0253] As an example, the symbols indicated as downlink by the uplink / downlink TDD configuration signaling and available for uplink transmission are full-duplex symbols.

[0254] As an example, the above method is beneficial to improving the resource utilization efficiency on the symbols indicated as downlink by the uplink / downlink TDD configuration signaling and available for uplink transmission.

[0255] As an example, whether a flexible symbol is a full-duplex symbol is configurable.

[0256] As an example, whether a flexible symbol is a full-duplex symbol is configured by RRC signaling.

[0257] As an example, there is a flexible symbol configured as a full-duplex symbol.

[0258] As an example, a symbol indicated as downlink by the uplink / downlink TDD configuration signaling and available for uplink transmission is indicated as downlink by the uplink / downlink TDD configuration signaling, and this symbol is available for uplink transmission.

[0259] As an example, there is at least one symbol indicated as downlink by the uplink / downlink TDD configuration signaling that is not a full-duplex symbol.

[0260] As an example, whether a symbol indicated as downlink by the uplink / downlink TDD configuration signaling is a full-duplex symbol is configurable.

[0261] As an example, whether a symbol indicated as downlink by the uplink / downlink TDD configuration signaling is a full-duplex symbol is configured by RRC signaling.

[0262] As an example, the symbol indicated by the uplink-downlink TDD configuration signaling as a downlink symbol and not available for uplink transmission is not a full-duplex symbol.

[0263] As an example, the symbol indicated by the uplink-downlink TDD configuration signaling as a downlink symbol and available for uplink transmission is a full-duplex symbol; the symbol indicated by the uplink-downlink TDD configuration signaling as a downlink symbol and not available for uplink transmission is a non-full-duplex symbol.

[0264] As an example, the symbol indicated by the uplink-downlink TDD configuration signaling as an uplink is not available for downlink transmission.

[0265] As an example, the available for uplink transmission includes: at least available for PUSCH transmission(s).

[0266] As an example, the available for uplink transmission includes: at least available for transmitting PUSCH on at least part of the frequency band.

[0267] As an example, the above method is beneficial to improving the uplink capacity of the system.

[0268] As an example, the available for uplink transmission includes: at least available for PUSCH transmission(s) and PUCCH transmission(s).

[0269] As an example, the available for uplink transmission includes: available for PUSCH transmission(s), PUCCH transmission(s) and SRS transmission(s).

[0270] As an example, the available for uplink transmission includes: at least available for PUSCH transmission(s) and PRACH (Physical Random Access CHannel) transmission(s).

[0271] As an example, the available for uplink transmission includes: available for PUSCH transmission(s), PUCCH transmission(s), PRACH (Physical Random Access CHannel) transmission(s) and SRS transmission(s).

[0272] As an example, the transmission available for uplink includes the transmission available for UL-SCH (Uplink Shared Channel(s)).

[0273] As an example, the uplink / downlink (Uplink / Downlink) TDD (Time Division Duplex) configuration signaling is the signaling that indicates the link direction of symbols.

[0274] As an example, the uplink / downlink TDD configuration signaling designates at least one symbol as downlink.

[0275] As an example, the uplink / downlink TDD configuration signaling designates at least one symbol as uplink.

[0276] As an example, the uplink / downlink TDD configuration signaling is RRC signaling.

[0277] As an example, the advantages of the above method include high reliability of signaling transmission.

[0278] As an example, the uplink / downlink TDD configuration signaling is tdd-UL-DL-ConfigurationCommon.

[0279] As an example, the advantages of the above method include that the uplink / downlink TDD configuration signaling can be applicable to multiple users, which is beneficial to reducing the control signaling overhead.

[0280] As an example, the uplink / downlink TDD configuration signaling is tdd-UL-DL-ConfigurationDedicated.

[0281] As an example, the uplink / downlink TDD configuration signaling includes tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated.

[0282] As an example, the uplink / downlink TDD configuration signaling includes at least one of tdd-UL-DL-ConfigurationCommon and tdd-UL-DL-ConfigurationDedicated.

[0283] As an example, the uplink / downlink TDD configuration signaling includes tdd-UL-DL-ConfigurationCommon and tdd-UL-DL-ConfigurationDedicated.

[0284] As an embodiment, when a symbol is indicated as uplink / downlink by tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated, this symbol is the symbol indicated as uplink / downlink by the uplink / downlink TDD configuration signaling.

[0285] Example 11

[0286] Embodiment 11 exemplifies a structural block diagram of a processing device in a first node according to an embodiment of the present application, as shown in the appendix Figure 11 as shown. In the appendix Figure 11 the processing device A00 in the first node includes a first receiver A01 and a first transmitter A02.

[0287] As an embodiment, the first node is a user equipment.

[0288] As an embodiment, the first node is a relay node.

[0289] As an embodiment, the first node is a vehicular communication device.

[0290] As an embodiment, the first node is a user equipment capable of sensing SBFD.

[0291] As an embodiment, the first node is a user equipment supporting SBFD operation.

[0292] As an embodiment, the first node is a user equipment supporting configuration of full-duplex symbols and non-full-duplex symbols.

[0293] As an embodiment, the first receiver A01 includes at least one of the antenna 452, the receiver 454, the multi-antenna reception processor 458, the reception processor 456, the controller / processor 459, the memory 460, and the data source 467 in the appendix of the present application Figure 4 as shown.

[0294] As an embodiment, the first receiver A01 includes at least the first five of the antenna 452, the receiver 454, the multi-antenna reception processor 458, the reception processor 456, the controller / processor 459, the memory 460, and the data source 467 in the appendix of the present application Figure 4 as shown.

[0295] As an embodiment, the first receiver A01 includes at least one of the antenna 452, the receiver 454, the multi-antenna reception processor 458, the reception processor 456, the controller / processor 459, the memory 460, and the data source 467 in the appendix of the present application Figure 4at least the first four of the antenna 452, the receiver 454, the multi-antenna receiving processor 458, the receiving processor 456, the controller / processor 459, the memory 460, and the data source 467 therein.

[0296] As an example, the first receiver A01 includes the attachment of this application Figure 4 at least the first three of the antenna 452, the receiver 454, the multi-antenna receiving processor 458, the receiving processor 456, the controller / processor 459, the memory 460, and the data source 467 therein.

[0297] As an example, the first receiver A01 includes the attachment of this application Figure 4 at least the first two of the antenna 452, the receiver 454, the multi-antenna receiving processor 458, the receiving processor 456, the controller / processor 459, the memory 460, and the data source 467 therein.

[0298] As an example, the first transmitter A02 includes the attachment of this application Figure 4 at least one of the antenna 452, the transmitter 454, the multi-antenna transmitting processor 457, the transmitting processor 468, the controller / processor 459, the memory 460, and the data source 467 therein.

[0299] As an example, the first transmitter A02 includes the attachment of this application Figure 4 at least the first five of the antenna 452, the transmitter 454, the multi-antenna transmitting processor 457, the transmitting processor 468, the controller / processor 459, the memory 460, and the data source 467 therein.

[0300] As an example, the first transmitter A02 includes the attachment of this application Figure 4 at least the first four of the antenna 452, the transmitter 454, the multi-antenna transmitting processor 457, the transmitting processor 468, the controller / processor 459, the memory 460, and the data source 467 therein.

[0301] As an example, the first transmitter A02 includes the attachment of this application Figure 4 at least the first three of the antenna 452, the transmitter 454, the multi-antenna transmitting processor 457, the transmitting processor 468, the controller / processor 459, the memory 460, and the data source 467 therein.

[0302] As an example, the first transmitter A02 includes the attachment of this application Figure 4 at least the first two of the antenna 452, the transmitter 454, the multi-antenna transmitting processor 457, the transmitting processor 468, the controller / processor 459, the memory 460, and the data source 467 therein.

[0303] As an example, the first transmitter A02 transmits a plurality of PUSCHs, and the plurality of PUSCHs all overlap with the first PUCCH, and a first UCI is associated with the first PUCCH;

[0304] Wherein, the first UCI is multiplexed into one PUSCH among the plurality of PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbol corresponding to one PUSCH among the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types includes full duplex and non-full duplex.

[0305] As an example, if at least one PUSCH among the plurality of PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the plurality of PUSCHs corresponds to a non-full-duplex symbol, then the PUSCH for multiplexing the first UCI is one PUSCH among the plurality of PUSCHs that corresponds to a non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0306] As an example, when at least one PUSCH among the plurality of PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the plurality of PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the plurality of PUSCHs that corresponds to a non-full-duplex symbol.

[0307] As an example, if at least one PUSCH among the plurality of PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the plurality of PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS adopted by any PUSCH corresponding to the full-duplex symbol among the plurality of PUSCHs is lower than the index of the MCS adopted by each PUSCH corresponding to the non-full-duplex symbol among the plurality of PUSCHs: then the PUSCH for multiplexing the first UCI is one PUSCH among the plurality of PUSCHs that corresponds to a non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0308] As an example, only when a first set of conditions is satisfied, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; one condition in the first set of conditions includes: none of the multiple PUSCHs carry aperiodic CSI.

[0309] As an example, the first receiver A01 receives multiple DCI formats;

[0310] Wherein, each of the multiple PUSCHs is scheduled by one of the multiple DCI formats.

[0311] As an example, the multiple PUSCHs are on the same serving cell.

[0312] As an example, when a symbol is indicated as downlink and available for uplink transmission by uplink-downlink TDD configuration signaling, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0313] As an example, the first transmitter A02 transmits multiple PUSCHs, all of the multiple PUSCHs overlap with a first PUCCH, and a first UCI is associated with the first PUCCH;

[0314] Wherein, the first UCI is multiplexed into one of the multiple PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; the symbol type of the symbol corresponding to one of the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full-duplex and non-full-duplex; when a symbol is indicated as downlink and available for uplink transmission by uplink-downlink TDD configuration signaling, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol;

[0315] If at least one of the multiple PUSCHs corresponds to a full-duplex symbol and at least one of the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is one of the multiple PUSCHs corresponding to a non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

[0316] As a sub - embodiment of the above - mentioned embodiment, when at least one of the plurality of PUSCHs corresponds to a full - duplex symbol and at least one of the plurality of PUSCHs corresponds to a non - full - duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the plurality of PUSCHs that corresponds to a non - full - duplex symbol.

[0317] As a sub - embodiment of the above - mentioned embodiment, only when a first set of conditions is satisfied does it depend on the symbol type of the symbol corresponding to at least one of the plurality of PUSCHs whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or into other PUSCHs; one of the conditions in the first set of conditions includes: none of the plurality of PUSCHs carries non - periodic CSI.

[0318] Example 12

[0319] Embodiment 12 illustrates a structural block diagram of a processing device in a second node according to an embodiment of the present application, as shown in the appendix Figure 12 shown. In the appendix Figure 12 the processing device B00 in the second node includes a second transmitter B01 and a second receiver B02.

[0320] As an embodiment, the second node is a base station.

[0321] As an embodiment, the second node is a satellite device.

[0322] As an embodiment, the second node is a relay node.

[0323] As an embodiment, the second node is one of a test device, a test equipment, and a test instrument.

[0324] As an embodiment, the second transmitter B01 includes at least one of the antenna 420, transmitter 418, multi - antenna transmission processor 471, transmission processor 416, controller / processor 475, and memory 476 in the appendix of the present application Figure 4 shown.

[0325] As an embodiment, the second transmitter B01 includes at least the first five of the antenna 420, transmitter 418, multi - antenna transmission processor 471, transmission processor 416, controller / processor 475, and memory 476 in the appendix of the present application Figure 4 shown.

[0326] As an embodiment, the second transmitter B01 includes the antenna 420, transmitter 418, multi - antenna transmission processor 471, transmission processor 416, controller / processor 475, and memory 476 in the appendix of the present application Figure 4at least the first four of the antenna 420, the transmitter 418, the multi-antenna transmission processor 471, the transmission processor 416, the controller / processor 475, and the memory 476 therein.

[0327] As an example, the second transmitter B01 includes the attachment of this application Figure 4 at least the first three of the antenna 420, the transmitter 418, the multi-antenna transmission processor 471, the transmission processor 416, the controller / processor 475, and the memory 476 therein.

[0328] As an example, the second transmitter B01 includes the attachment of this application Figure 4 at least the first two of the antenna 420, the transmitter 418, the multi-antenna transmission processor 471, the transmission processor 416, the controller / processor 475, and the memory 476 therein.

[0329] As an example, the second receiver B02 includes the attachment of this application Figure 4 at least one of the antenna 420, the receiver 418, the multi-antenna reception processor 472, the reception processor 470, the controller / processor 475, and the memory 476 therein.

[0330] As an example, the second receiver B02 includes the attachment of this application Figure 4 at least the first five of the antenna 420, the receiver 418, the multi-antenna reception processor 472, the reception processor 470, the controller / processor 475, and the memory 476 therein.

[0331] As an example, the second receiver B02 includes the attachment of this application Figure 4 at least the first four of the antenna 420, the receiver 418, the multi-antenna reception processor 472, the reception processor 470, the controller / processor 475, and the memory 476 therein.

[0332] As an example, the second receiver B02 includes the attachment of this application Figure 4 at least the first three of the antenna 420, the receiver 418, the multi-antenna reception processor 472, the reception processor 470, the controller / processor 475, and the memory 476 therein.

[0333] As an example, the second receiver B02 includes the attachment of this application Figure 4 at least the first two of the antenna 420, the receiver 418, the multi-antenna reception processor 472, the reception processor 470, the controller / processor 475, and the memory 476 therein.

[0334] As an example, the second receiver B02 receives a plurality of PUSCHs, and the plurality of PUSCHs all overlap with a first PUCCH, and a first UCI is associated with the first PUCCH;

[0335] Wherein, the first UCI is multiplexed into one of the plurality of PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of at least one PUSCH among the plurality of PUSCHs; the symbol type of the symbol corresponding to one of the plurality of PUSCHs is one of a plurality of symbol types, and the plurality of symbol types include full-duplex and non-full-duplex.

[0336] As an example, if at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, then the PUSCH for multiplexing the first UCI is one of the plurality of PUSCHs corresponding to non-full-duplex symbols; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0337] As an example, when at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, the PUSCH for multiplexing the first UCI is the earliest PUSCH among the plurality of PUSCHs corresponding to non-full-duplex symbols.

[0338] As an example, if at least one of the plurality of PUSCHs corresponds to a full-duplex symbol and at least one of the plurality of PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS used by any one of the PUSCHs corresponding to the full-duplex symbol among the plurality of PUSCHs is lower than the index of the MCS used by each of the PUSCHs corresponding to the non-full-duplex symbol among the plurality of PUSCHs: then the PUSCH for multiplexing the first UCI is one of the plurality of PUSCHs corresponding to non-full-duplex symbols; otherwise, the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs.

[0339] As an example, only when a first set of conditions is satisfied, whether the first UCI is multiplexed into the earliest PUSCH among the plurality of PUSCHs or other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the plurality of PUSCHs; one of the conditions in the first set of conditions includes: none of the plurality of PUSCHs carry aperiodic CSI.

[0340] As an embodiment, the second transmitter B01 transmits multiple DCI formats;

[0341] Wherein, each PUSCH among the multiple PUSCHs is scheduled by one DCI format among the multiple DCI formats.

[0342] As an embodiment, the multiple PUSCHs are on the same serving cell.

[0343] As an embodiment, when a symbol is indicated as downlink and available for uplink transmission by the uplink-downlink TDD configuration signaling, this symbol is a full-duplex symbol; when a symbol is indicated as uplink by the uplink-downlink TDD configuration signaling, this symbol is a non-full-duplex symbol.

[0344] Those of ordinary skill in the art can understand that all or part of the steps in the above method can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium, such as a read-only memory, a hard disk, or an optical disc, etc. Optionally, all or part of the steps in the above embodiments can also be implemented using one or more integrated circuits. Correspondingly, each module unit in the above embodiments can be implemented in a hardware form or in the form of a software function module. This application is not limited to any specific form of the combination of software and hardware. The user equipment, terminal, and UE in this application include, but are not limited to, unmanned aerial vehicles, communication modules on unmanned aerial vehicles, remote control airplanes, aircraft, small airplanes, mobile phones, tablet computers, laptops, vehicle-mounted communication devices, transportation means, vehicles, RSU, wireless sensors, network cards, Internet of Things terminals, RFID (Radio Frequency Identification) terminals, NB-IoT (Narrow Band Internet of Things) terminals, MTC (Machine Type Communication) terminals, eMTC (enhanced MTC) terminals, data cards, network cards, vehicle-mounted communication devices, low-cost mobile phones, low-cost tablet computers, and other wireless communication devices. The base station or system device in this application includes, but is not limited to, macrocell base stations, microcell base stations, small cell base stations, home base stations, relay base stations, eNB (evolved Node B), gNB, TRP, GNSS (Global Navigation Satellite System), relay satellites, satellite base stations, aerial base stations, RSU, unmanned aerial vehicles, test equipment, such as transceiver devices or signaling testers that simulate some functions of the base station, and other wireless communication devices.

[0345] Those skilled in the art should understand that the present invention can be implemented in other specific forms without departing from its core or essential features. Therefore, the presently disclosed embodiments should be considered descriptive rather than restrictive in any case. The scope of the invention is determined by the appended claims rather than the preceding description, and all modifications within the equivalent meaning and scope thereof are considered to be included therein.

Claims

1. A method for a terminal, characterized in that: include: Sending multiple PUSCHs, where the multiple PUSCHs overlap with a first PUCCH, and a first UCI is associated with the first PUCCH; Among them, the first UCI is multiplexed into one PUSCH among the multiple PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; the symbol type of the symbol corresponding to one PUSCH among the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full-duplex and non-full-duplex.

2. The method according to claim 1, characterized in that If at least one of the multiple PUSCHs corresponds to a full-duplex symbol and at least one of the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH used to multiplex the first UCI is a PUSCH among the multiple PUSCHs corresponding to a non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

3. The method according to claim 1 or 2, characterized in that: When at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH used for multiplexing the first UCI is an earliest PUSCH among the multiple PUSCHs corresponding to a non-full-duplex symbol.

4. The method according to claim 1, characterized in that If at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS adopted by any PUSCH among the multiple PUSCHs corresponding to the full-duplex symbol is lower than the index of the MCS adopted by each PUSCH among the multiple PUSCHs corresponding to the non-full-duplex symbol: then the PUSCH used to multiplex the first UCI is a PUSCH among the multiple PUSCHs corresponding to the non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

5. The method according to any one of claims 1 to 4, characterized in that Only when a first set of conditions is satisfied, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; One condition in the first condition set includes: none of the multiple PUSCHs carry non-periodic CSI.

6. The method according to any one of claims 1 to 5, characterized in that include: Receive multiple DCI formats; Each of the multiple PUSCHs is scheduled by one of the multiple DCI formats.

7. The method according to any one of claims 1 to 6, characterized in that The multiple PUSCHs are on the same serving cell.

8. The method according to any one of claims 1 to 7, characterized in that When a symbol is indicated as downlink by uplink and downlink TDD configuration signaling and can be used for uplink transmission, the symbol is a full-duplex symbol; when a symbol is indicated as uplink by uplink and downlink TDD configuration signaling, the symbol is a non-full-duplex symbol.

9. A terminal, characterized in that: The terminal includes: one or more processors and a memory; The memory is coupled to the one or more processors, and the memory is used to store computer program codes, where the computer program codes include computer instructions. The one or more processors call the computer instructions to enable the terminal to execute the method according to any one of claims 1 to 8.

10. A method for a base station, characterized in that: include: receiving a plurality of PUSCHs, where the plurality of PUSCHs overlap with a first PUCCH, and a first UCI is associated with the first PUCCH; Among them, the first UCI is multiplexed into one PUSCH among the multiple PUSCHs, and whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; the symbol type of the symbol corresponding to one PUSCH among the multiple PUSCHs is one of multiple symbol types, and the multiple symbol types include full-duplex and non-full-duplex.

11. The method according to claim 10, characterized in that If at least one of the multiple PUSCHs corresponds to a full-duplex symbol and at least one of the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH used to multiplex the first UCI is a PUSCH among the multiple PUSCHs corresponding to a non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

12. The method according to claim 10 or 11, characterized in that: When at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, the PUSCH used for multiplexing the first UCI is an earliest PUSCH among the multiple PUSCHs corresponding to a non-full-duplex symbol.

13. The method according to claim 10, characterized in that If at least one PUSCH among the multiple PUSCHs corresponds to a full-duplex symbol and at least one PUSCH among the multiple PUSCHs corresponds to a non-full-duplex symbol, and the index of the MCS adopted by any PUSCH among the multiple PUSCHs corresponding to the full-duplex symbol is lower than the index of the MCS adopted by each PUSCH among the multiple PUSCHs corresponding to the non-full-duplex symbol: then the PUSCH used to multiplex the first UCI is a PUSCH among the multiple PUSCHs corresponding to the non-full-duplex symbol; otherwise, the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs.

14. The method according to any one of claims 10 to 13, characterized in that Only when a first set of conditions is satisfied, whether the first UCI is multiplexed into the earliest PUSCH among the multiple PUSCHs or into other PUSCHs depends on the symbol type of the symbol corresponding to at least one PUSCH among the multiple PUSCHs; One condition in the first condition set includes: none of the multiple PUSCHs carry non-periodic CSI.

15. The method according to any one of claims 10 to 14, characterized in that include: Send multiple DCI formats; Each of the multiple PUSCHs is scheduled by one of the multiple DCI formats.

16. The method according to any one of claims 10 to 15, characterized in that The multiple PUSCHs are on the same serving cell.

17. The method according to any one of claims 10 to 16, characterized in that When a symbol is indicated as downlink by uplink and downlink TDD configuration signaling and can be used for uplink transmission, the symbol is a full-duplex symbol; when a symbol is indicated as uplink by uplink and downlink TDD configuration signaling, the symbol is a non-full-duplex symbol.

18. A base station, characterized in that: The base station includes: one or more processors and a memory; The memory is coupled to the one or more processors, and the memory is used to store computer program codes, where the computer program codes include computer instructions, and the one or more processors call the computer instructions to enable the base station to perform the method according to any one of claims 10 to 17.

Images