Communication method and apparatus, terminal device, and network device

Abstract

The present application relates to the technical field of communications. Disclosed are a communication method and apparatus, a terminal device, and a network device. The method comprises: on the basis of a first OCC sequence, grouping a plurality of PUSCHs for PUSCH repetition transmission, and determining at least one PUSCH group, wherein each of the at least one PUSCH group uses the first OCC sequence. In this way, a plurality of PUSCHs for PUSCH repetition transmission are grouped by means of OCC sequences, so as to ensure the use of the same OCC sequence by each PUSCH group and to use OCCs in the PUSCH repetition transmission, thereby facilitating an increase in the system capacity and / or spectrum utilization efficiency of the PUSCH repetition transmission.

Description

Communication method and apparatus, terminal device and network device

[0001] Cross-reference to Related Applications

[0002] This application claims priority to Chinese Patent Application No. 202411096383.7, filed on August 9, 2024, entitled “Communication method and apparatus, terminal device and network device”, which is incorporated by reference herein in its entirety. TECHNICAL FIELD

[0003] The present application relates to the field of communication technology, and in particular to a communication method and apparatus, a terminal device and a network device. BACKGROUND

[0004] In some communication systems (e.g., non-terrestrial network (NTN) systems), the demand for uplink (UL) communication is large, resulting in a heavy burden of uplink transmission. When the uplink channel of these communication systems also supports repetition transmission, this will further exacerbate the burden and / or spectrum overhead of uplink transmission. Therefore, in these communication systems, how to improve the system capacity and / or spectrum utilization efficiency of the uplink becomes a technical problem to be solved. SUMMARY

[0005] The present application provides a communication method and apparatus, a terminal device and a network device to improve the system capacity and / or spectrum utilization efficiency of PUSCH repetition transmission.

[0006] In a first aspect, a communication method of the present application comprises:

[0007] grouping the plurality of PUSCHs of the PUSCH repetition transmission according to a first OCC sequence, determining at least one PUSCH group, each PUSCH group in the at least one PUSCH group using the first OCC sequence.

[0008] As can be seen, by grouping the plurality of PUSCHs of the PUSCH repetition transmission according to the OCC sequence, it is ensured that each PUSCH group uses the same OCC sequence, and the OCC is used for PUSCH repetition transmission, thereby facilitating the improvement of the system capacity and / or spectrum utilization efficiency of the PUSCH repetition transmission.

[0009] In some possible examples, further comprising:

[0010] determining at least one PUCCH, the resources of the PUCCH in the at least one PUCCH overlapping the resources of the PUSCH in the at least one PUSCH;

[0011] determining a multiplexing status of UCI of the at least one PUCCH and PUSCHs in the at least one PUSCH group.

[0012] In some possible examples, the determining the multiplexing status of UCI of the at least one PUCCH and PUSCHs in the at least one PUSCH group comprises:

[0013] if a resource of the first PUCCH overlaps with a resource of a first PUSCH or a resource of a PUSCH other than the first PUSCH in the first PUSCH group, determining that the first UCI is multiplexed on all PUSCHs in the first PUSCH group;

[0014] wherein the first PUCCH is one or more PUCCHs in the at least one PUCCH, and the first PUSCH group is one PUSCH group in the at least one PUSCH group.

[0015] the first UCI is UCI of the first PUCCH, or the first UCI is UCI after UCI multiplexing of UCI of the first PUCCH and UCI of a second PUCCH;

[0016] the second PUCCH is one or more PUCCHs in the at least one PUCCH other than the first PUCCH.

[0017] In some possible examples, a resource of the second PUCCH overlaps with a resource of the first PUSCH in the first PUSCH group; or,

[0018] a resource of the second PUCCH overlaps with a resource of a PUSCH other than the first PUSCH in the first PUSCH group.

[0019] In some possible examples, the determining the multiplexing status of UCI of the at least one PUCCH and PUSCHs in the at least one PUSCH group comprises:

[0020] if a resource of the first PUCCH overlaps with a resource of a PUSCH other than the first PUSCH in the first PUSCH group, determining that UCI of the first PUCCH is discarded;

[0021] wherein the first PUCCH is one or more PUCCHs in the at least one PUCCH, and the first PUSCH group is one PUSCH group in the at least one PUSCH group.

[0022] In some possible examples, the determining the multiplexing status of UCI of the at least one PUCCH and PUSCHs in the at least one PUSCH group comprises:

[0023] if a resource of the first PUCCH overlaps with a resource of a PUSCH other than the first PUSCH in the first PUSCH group, determining to multiplex the second UCI on all PUSCHs in the second PUSCH group;

[0024] wherein the first PUCCH is one or more PUCCHs in the at least one PUCCH, the first PUSCH group is one PUSCH group in the at least one PUSCH group, and the second PUSCH group is one adjacent PUSCH group after the first PUSCH group in the at least one PUSCH group;

[0025] the second UCI is UCI of the first PUCCH, or the second UCI is UCI after multiplexing UCI of the first PUCCH and UCI of a third PUCCH;

[0026] the third PUCCH is one or more PUCCHs in the at least one PUCCH other than the first PUCCH.

[0027] In some possible examples, a resource of the third PUCCH overlaps with a resource of a PUSCH other than the first PUSCH in the first PUSCH group; or,

[0028] a resource of the third PUCCH overlaps with a resource of the first PUSCH in the second PUSCH group; or,

[0029] a resource of the third PUCCH overlaps with a resource of a PUSCH other than the first PUSCH in the second PUSCH group.

[0030] In some possible examples, if a PUSCH in the at least one PUCCH and / or the at least one PUSCH group is scheduled by at least one downlink control information (DCI), a time interval between a latest ending position of the at least one DCI and the first starting position is greater than a time threshold;

[0031] wherein the first starting position is an earliest one of a starting position of the at least one PUSCH group and a starting position of the at least one PUCCH.

[0032] In some possible examples, the method further includes:

[0033] if a target PUSCH in the at least one PUSCH group is discarded, and the target PUSCH is one or more PUSCHs, discarding all PUSCHs in a PUSCH group in which the target PUSCH is located.

[0034] In some possible examples, the resources of the target PUSCH overlap with the resources of the first uplink channel, and the first uplink channel is other than all PUSCHs of the at least one PUSCH group.

[0035] In some possible examples, the method further includes:

[0036] If the PUSCHs in the at least one PUSCH group and / or the first uplink channel are scheduled by at least one DCI, determining that a time interval between a latest end position of the at least one DCI and the target start position is greater than a time threshold;

[0037] The target start position is the earliest one of a start position of the at least one PUSCH group and a start position of the first uplink channel.

[0038] In some possible examples, the method further includes:

[0039] Determining the first OCC sequence.

[0040] In some possible examples, the determining the first OCC sequence includes:

[0041] Determining the first OCC sequence according to the first DMRS port index and an OCC sequence length, the first DMRS port index being a DMRS port index used by the multiple PUSCHs of the PUSCH repetition transmission.

[0042] In some possible examples, the first OCC sequence is a remainder of the first DMRS port index divided by the OCC sequence length.

[0043] In some possible examples, the determining the first OCC sequence includes:

[0044] Determining the first OCC sequence according to the first antenna port index and an OCC sequence length, the first antenna port index being an antenna port index used by the multiple PUSCHs of the PUSCH repetition transmission.

[0045] In some possible examples, an index of the first OCC sequence is a remainder of the first antenna port index divided by the OCC sequence length.

[0046] In some possible examples, the determining the first OCC sequence includes:

[0047] Determining the first OCC sequence according to the indication information, the indication information indicating the first OCC sequence, or an index of the first OCC sequence, or a row index or a column index of an OCC matrix.

[0048] In some possible examples, the method further includes:

[0049] transmit at least one phase tracking reference signal PT-RS in a time unit occupied by the first PUSCH group, each of the at least one PT-RS being the same, the first PUSCH group being one of the at least one PUSCH group.

[0050] In some possible examples, each of the at least one PT-RS corresponds to a scrambling initial sequence determined according to a time unit occupied by a first PUSCH in the first PUSCH group.

[0051] In some possible examples, the method further includes:

[0052] If a PUSCH in the at least one PUSCH group is scheduled by the first DCI, determining that aperiodic CSI triggered by the first DCI is multiplexed on all PUSCHs in a first PUSCH group of the at least one PUSCH group.

[0053] In some possible examples, the method further includes:

[0054] determining a first RV sequence;

[0055] determining that an RV of a PUSCH in the at least one PUSCH group is one of the first RV sequence, and that the RVs of all PUSCHs in a same PUSCH group are the same.

[0056] In some possible examples, determining that the RV of the PUSCH in the at least one PUSCH group is one of the first RV sequence includes:

[0057] the PUSCHs in the at least one PUSCH group take one RV from the first RV sequence in order from a first RV of the first RV sequence to a last RV of the first RV sequence;

[0058] If a PUSCH group takes the last RV of the first RV sequence, it is determined that a next PUSCH group takes the first RV of the first RV sequence, until the last PUSCH group takes one RV.

[0059] In some possible examples, determining that the RV of the PUSCH in the at least one PUSCH group is one of the first RV sequence includes:

[0060] determining that the RV of the PUSCH n in the at least one PUSCH group is the RV i in the first RV sequence, i = ((n – (n mod L)) / L) mod M, or i = (mod(((n-mod(n,L)) / L)-1,M)+1);

[0061] wherein n represents an index of the PUSCH in the at least one PUSCH group, i represents an index of the RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, and M represents a length of the first RV sequence.

[0062] In some possible examples, determining the RV of the PUSCH in the at least one PUSCH group as one RV in the first RV sequence comprises:

[0063] determining the RV of the PUSCH n in the at least one PUSCH group as the RV j in the first RV sequence, j = ((n - (n mod(L*N))) / (L*N)) mod M, or j = (mod(((n - mod(n, (L*N))) / (L*N))-1, M)+1).

[0064] wherein n represents an index of the PUSCH in the at least one PUSCH group, j represents an index of the RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, N represents a number of slots spanned by TB transmission of one PUSCH in TB spanning multiple slots, and M represents a length of the first RV sequence.

[0065] In some possible examples, determining the RV of the PUSCH in the at least one PUSCH group as one RV in the first RV sequence comprises:

[0066] determining the RV of all PUSCHs within the PUSCH group k in the at least one PUSCH group as the RV z in the first RV sequence, z = ((k - (k mod N)) / N) mod M.

[0067] wherein k represents an index of the PUSCH group in the at least one PUSCH group, z represents an index of the RV in the first RV sequence, N represents a number of slots spanned by TB transmission of one PUSCH in TB spanning multiple slots, and M represents a length of the first RV sequence.

[0068] A second aspect is a communication apparatus, comprising:

[0069] a determining unit, configured to group a plurality of PUSCHs of PUSCH repetition transmission according to a first OCC sequence, and determine at least one PUSCH group, each PUSCH group in the at least one PUSCH group using the first OCC sequence.

[0070] A third aspect is that the steps in the method in the first aspect are applied to a terminal device.

[0071] A fourth aspect is that the steps in the method in the first aspect are applied to a network device.

[0072] In a fifth aspect, a terminal device is provided. The terminal device includes a processor, a memory, and a computer program or instructions stored in the memory. The processor executes the computer program or instructions to implement the steps in the method of the first aspect.

[0073] In a sixth aspect, a network device is provided. The network device includes a processor, a memory, and a computer program or instructions stored in the memory. The processor executes the computer program or instructions to implement the steps in the method of the first aspect.

[0074] In a seventh aspect, a chip is provided. The chip includes a processor. The processor executes the steps in the method of the first aspect.

[0075] In an eighth aspect, a chip module is provided. The chip module includes a transceiver assembly and a chip. The chip includes a processor. The processor executes the steps in the method of the first aspect.

[0076] In a ninth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores a computer program or instructions. The computer program or instructions, when executed, implement the steps in the method of the first aspect.

[0077] In a tenth aspect, a computer program product is provided. The computer program product includes a computer program or instructions. The computer program or instructions, when executed, implement the steps in the method of the first aspect. For example, the computer program product can be a software installation package.

[0078] It is worth noting that the beneficial effects brought by the technical solutions of the second aspect to the tenth aspect can refer to the technical effects brought by the technical solutions of the first aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0079] FIG. 1 is a schematic diagram of an architecture of a communication system according to an embodiment of the present application;

[0080] FIG. 2 is a schematic diagram of an architecture of an NTN system according to an embodiment of the present application;

[0081] FIG. 3 is a schematic diagram of an architecture of another communication system according to an embodiment of the present application;

[0082] FIGS. 4 to 7 are schematic diagrams of time-domain position distribution of a PUSCH according to an embodiment of the present application;

[0083] FIG. 8 is a flowchart of a communication method according to an embodiment of the present application;

[0084] FIG. 9 is a schematic diagram of resource distribution of PUCCH and PUSCH according to an embodiment of the present application;

[0085] FIG. 10 is a flow diagram of another communication method according to an embodiment of the present application;

[0086] FIG. 11 to FIG. 21 are schematic diagrams of time domain position distribution of PUSCH and PUCCH according to an embodiment of the present application;

[0087] FIG. 22 to FIG. 23 are schematic diagrams of time domain position distribution of PUSCH according to an embodiment of the present application;

[0088] FIG. 24 is a functional unit constituent block diagram of a communication apparatus according to an embodiment of the present application;

[0089] FIG. 25 is a structural schematic diagram of a terminal device according to an embodiment of the present application;

[0090] FIG. 26 is a structural schematic diagram of a network device according to an embodiment of the present application. DETAILED DESCRIPTION

[0091] It should be understood that the terms "first", "second" and the like in the embodiments of the present application are used to distinguish different objects, and are not used to describe a particular order. In addition, the terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, software, product or device including a series of steps or units is not limited to the steps or units listed, but can also include steps or units not listed, or can also include other steps or units inherent to the process, method, product or device.

[0092] "Embodiments" referred to in the embodiments of the present application mean that the specific features, structures or properties described in conjunction with the embodiments can be included in at least one embodiment of the present application. The appearance of this phrase at various places in the specification does not necessarily mean the same embodiment, nor is it an independent or alternative embodiment to other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0093] "at least one" or "at least one" in the embodiments of the present application means one or more, and more means two or more.

[0094] "and / or" in the embodiments of the present application describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B can represent the following three cases: A exists alone, A and B exist together, and B exists alone. Wherein, A, B can be singular or plural.

[0095] The "at least one of" or similar expressions in the embodiments of the present application refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can represent the following seven cases: a, b, c, a and b, a and c, b and c, a, b and c. Wherein, each of a, b, c can be an element or a set containing one or more elements.

[0096] The "equal to" in the embodiments of the present application can be combined with greater than, which is applicable to the technical solutions adopted when greater than, or combined with less than, which is applicable to the technical solutions adopted when less than. When equal to is combined with greater than, it is not combined with less than; when equal to is combined with less than, it is not combined with greater than.

[0097] The "of", "corresponding", "corresponding", "associated", "mapped" in the embodiments of the present application can be mixed sometimes. It should be pointed out that the concepts or meanings to be expressed are consistent when no distinction is emphasized.

[0098] The "network" in the embodiments of the present application can be the same concept as "system" and the like, and the communication system is the communication network.

[0099] The "connection" in the embodiments of the present application refers to various connection modes such as direct connection or indirect connection to realize communication between devices, which is not limited specifically.

[0100] The related content involved in the technical solutions of the embodiments of the present application is specifically introduced as follows.

[0101] The communication system of the present embodiment is specifically described as follows.

[0102]

Communication system

[0103] The technical solutions of the embodiments of the present application can be applied to various communication systems, such as a long term evolution (LTE) system, an advanced long term evolution (LTE-A) system, a New Radio (NR) system, an evolved system of the NR system, an LTE-based access to unlicensed spectrum (LTE-U) system, an NR-based access to unlicensed spectrum (NR-U) system, a non-terrestrial network (NTN) system, a universal mobile telecommunication system (UMTS), a 6th-Generation (6G) communication system, or other communication systems in the future, and the like.

[0104] It should be noted that some communication systems support a limited number of user connections and are easy to implement. With the development of communication technology, the communication system of the present application can also support device to device (D2D) communication, machine to machine (M2M) communication, machine type communication (MTC), vehicle to vehicle (V2V) communication, vehicle to everything (V2X) communication, narrow band internet of things (NB-IoT) communication, and the like. Therefore, the technical solutions of the embodiments of the present application can also be applied to the above communication systems.

[0105] In some possible examples, the embodiments of the present application can be applied to beamforming, carrier aggregation (CA), dual connectivity (DC), or standalone (SA) deployment scenarios, and the like.

[0106] In some possible examples, the embodiments of the present application can be applied to a communication scenario of unlicensed spectrum. In the embodiments of the present application, the unlicensed spectrum can also be considered as a shared spectrum. Alternatively, the embodiments of the present application can also be applied to a licensed spectrum. The licensed spectrum can also be considered as a non-shared spectrum.

[0107] Exemplarily, a network architecture of a communication system according to an embodiment of the present application is shown in FIG. 1. In FIG. 1, the communication system 10 can include a network device 110 and a terminal device 120. The terminal device 120 can communicate with the network device 110 in a wireless manner.

[0108] Of course, FIG. 1 is only an example of a network architecture of a communication system, and does not limit the network architecture of the communication system according to the embodiments of the present application. For example, the communication system 10 can further include a server or other devices, or the communication system 10 can include other network devices in addition to the network device 110, or the communication system 10 can include other terminal devices in addition to the terminal device 120.

[0109] Exemplarily, a network architecture of an NTN system according to an embodiment of the present application is shown in FIG. 2. In FIG. 2, the NTN system 20 can include a terminal device 210, a satellite 220, a non-terrestrial network gateway (NTN gateway) 230, and a network device 240. The terminal device 210, the non-terrestrial network gateway 230, and the network device 240 can be located on the earth's surface, while the satellite 220 is located in the earth's orbit. The satellite 220 can provide communication services to a geographical area covered by its own signal, and can communicate with the terminal device 210 located in the signal coverage area. The non-terrestrial network gateway 230 and the network device 240 can be integrated into the same device, or can be separate devices, which are not specifically limited.

[0110] Among them, the terminal device 210 is located in the coverage of a certain beam or a certain cell, and the coverage of the beam or the cell includes a reference point 260. In addition, the communication link between the terminal device 210 and the satellite 220 is called a service link. The communication link between the satellite 220 and the non-terrestrial network gateway 230 is called a feeder link.

[0111] Of course, FIG. 2 is only an example of a network architecture of an NTN system, and does not limit the network architecture of the NTN system according to the embodiments of the present application. For example, the NTN system 20 can further include a server or other devices, or the NTN system 20 can include other network devices in addition to the network device 240, or the NTN system 20 can include other terminal devices in addition to the terminal device 210, or the NTN system 20 can include other satellites in addition to the satellite 220, or the NTN system 20 can include other non-terrestrial network gateways in addition to the non-terrestrial network gateway 230.

[0112] The terminal device and the network device mentioned in the embodiments are exemplarily described below.

[0113]

[0114] In some possible examples, the terminal device can be a device with a transceiving function, which can also be referred to as a terminal, a user equipment (UE), a remote terminal device, a relay device, an access terminal device, a subscriber unit, a subscriber station, a mobile station, a mobile, a remote station, a mobile device, a user terminal device, a smart terminal device, a wireless communication device, a user agent or a user apparatus. It should be noted that the relay device is a terminal device capable of providing relay forwarding services for other terminal devices (including remote terminal devices).

[0115] For example, the terminal device can be a mobile phone, a tablet computer (Pad), a computer with wireless transceiving function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal device in industrial control, a wireless terminal device in unmanned automatic driving, a wireless terminal device in remote medical treatment, a wireless terminal device in smart grid, a wireless terminal device in transportation safety, a wireless terminal device in smart city or a wireless terminal device in smart home, etc.

[0116] For another example, the terminal device can be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a next-generation communication system (such as an NR communication system or a 6G communication system), or a terminal device in a future evolved public land mobile network (PLMN), etc., without specific limitation.

[0117] ​In some possible examples, the terminal device can be deployed on land, including indoors or outdoors, handheld, wearable, or vehicle-mounted; can be deployed on water (such as ships, etc.); can be deployed in the air (such as airplanes, balloons, and satellites, etc.). The terminal device can include a device with wireless communication functions, such as a chip system, a chip, or a chip module. For example, the chip system can include a chip, and can also include other discrete devices. The terminal device can be a chip, a chip module, a device, a unit, etc., and is not specifically limited.

[0118] [Network device]

[0119] In some possible examples, the network device can be a device with transceiver functions, and can be used to communicate with the terminal device.

[0120] In some possible examples, the network device can include a device with wireless communication functions for the terminal device, such as a chip system, a chip, or a chip module. For example, the chip system can include a chip or other discrete devices. The network device serves a cell, and the terminal device in the cell can communicate with the network device through a transmission resource (such as a spectrum resource). The cell can be a macro cell, a small cell, a metro cell, a micro cell, a pico cell, a femto cell, etc.

[0121] In some possible examples, the network device has a mobile feature, for example, the network device can be a mobile device. Alternatively, the network device can be a satellite, a balloon station. For example, the satellite can be a low earth orbit (LEO) satellite, a medium earth orbit (MEO) satellite, a geostationary earth orbit (GEO) satellite, a high elliptical orbit (HEO) satellite, etc. Alternatively, the network device can also be a base station arranged on land, water, etc.

[0122] In some possible examples, the network device can include a device in an access network device and / or a core network (CN).

[0123] The access network device and the core network device are described below.

[0124] [Access network device]

[0125] In some possible examples, the access network device can be referred to as a radio access network (RAN) node. The RAN can be a network composed of multiple RAN nodes (for example, 5G-RAN nodes), implementing radio physical layer functions, resource scheduling and radio resource management, radio access control, and mobility management functions. The RAN can be connected to a user plane function (UPF) through a user plane interface N3, and can be used to transmit data of the terminal device; the RAN can establish a control plane signaling connection through a control plane interface N2 and a mobility management function (AMF), and can be used to implement radio access bearer control and other functions. The RAN node can be any device with wireless transceiver functions, which can include but is not limited to a 5G base station (gNB), an evolved node base station (eNB), an access point (AP), a world interoperability for microwave access base station (WiMAX BS), a transmission receiving point (TRP), a wireless relay node, a wireless backhaul node, a master node (MN) in a dual connectivity architecture, a second node or a secondary node (SN) in a dual connectivity architecture, and the like.

[0126] In some possible examples, the access network device can refer to a device used for communication with the terminal device. For example, the access network device can be a base station (base transceiver station, BTS) in a global system of mobile communication (GSM) system or a code division multiple access (CDMA) system, can be a base station (nodeB, NB) in a wideband code division multiple access (WCDMA) system, can be an evolved node base station (eNB) in an LTE system, can be a radio controller in a cloud radio access network (CRAN) scenario, or can be a relay station, an access point, a vehicle-mounted device, a wearable device, and an access network device in a future 5G network or an access network device in a future evolved PLMN network, and the like. Embodiments of the present application are not limited.

[0127] In some possible examples, in 5G NR, the functions of the access network device are divided into two parts, referred to as centralized unit (CU)-distributed unit (DU) separation. From the perspective of the protocol stack, the CU includes the radio resource control (RRC) layer and the packet data convergence protocol (PDCP) layer of the LTE base station, and the DU includes the radio link control (RLC) layer, the media access control (MAC) layer, and the physical (PHY) layer of the LTE base station. In a common 5G base station deployment, the CU and the DU can be connected by an optical fiber in a physical manner, and there is a specially defined F1 interface between the CU and the DU for communication between the CU and the DU. From the perspective of functions, the CU is mainly responsible for radio resource control and configuration, cross-cell mobility management, bearer management, and the like. The DU is mainly responsible for scheduling, physical signal generation, and transmission.

[0128] In some possible examples, the access network device can be a macro base station, a micro base station, a pico base station, a small station, a relay station, a balloon station, and the like.

[0129]

Core network device

[0130] In some possible examples, the core network device can include network elements providing various types of functions. Among them, the "network element" can also be referred to as an entity, device, apparatus or module, etc., which is not specifically limited. In addition, in order to facilitate understanding and description, the description of "network element" is omitted in part of the description, for example, the network function exposure function (network exposure function, NEF) network element is simply referred to as NEF, in this case, the "NEF" should be understood as the NEF network element or the NEF entity, and the following description of the same or similar cases is omitted.

[0131] For example, the core network device can include a mobility management entity (mobility management entity, MME), a broadcast multicast service center (broadcast multicast service center, BMSC), etc., or can include a corresponding functional entity in a 5G system, such as a core network control plane (control plane, CP) or user plane (user plan, UP) network function, etc., and the core network control plane can also be understood as a core network control plane function (control plane function, CPF) entity.

[0132] In some possible examples, the network element included in the core network device includes at least one of the following: a session management function (SMF), a user plane function (UPF), a policy control function (PCF), an NEF, an authentication server function (AUSF), a unified data management (UDM), a network slice selection function (NSSF), a network repository function (NRF), a unified data management (UDM), an application function (AP), a unified data repository (UDR), a network data analytics function (NWDAF), a service control point (SCP), a network slice admission control function (NSACF), or a network slice specific authentication and authorization function (NSSAAF).

[0133] It should be noted that the terminal device can be connected to the access network device in a wireless manner, the access network device can be connected to the core network device in a wireless or wired manner, and the core network device can be connected to a data network (DN). The access network device and the core network device can be independent and different physical devices, can be integrated into the same physical device, or can be a physical device integrated with part of the functions of the core network device and part of the functions of the access network device.

[0134] For example, FIG. 3 is a schematic diagram of an architecture of another communication system according to embodiments of the present application. The names of the network elements included in FIG. 3 are only names, and the names do not limit the functions of the network elements. In 5G networks and future other networks, the network elements described above can also be other names, and no specific limitation is made. For example, in a 6G network, some or all of the network elements described above can use the terms in 5G, or other names, etc. A unified description is made here, and the following will not be described again.

[0135] In addition, the network elements in FIG. 3 are not necessarily present at the same time, and it can be determined according to the needs which network elements are needed. The connection relationship between the network elements in FIG. 3 is also not uniquely determined, and can be adjusted according to the needs. It can be understood that the network elements or functions described above can be network elements in a hardware device, or software functions running on a dedicated hardware, or virtualized functions instantiated on a platform (for example, a cloud platform).

[0136] Of course, FIG. 3 is only an example of the network architecture of a communication system, and does not limit the network architecture of the communication system according to embodiments of the present application.

[0137] The communication system has been described above, and the embodiments below specifically describe improving the uplink capacity and / or spectrum utilization efficiency of the communication system.

[0138] In some communication systems, the communication demand of the uplink is large, and there is a large uplink sending burden. For example, taking an NTN system as an example, a terminal device communicates with a network device through an air platform such as a satellite. Because the area covered by the air platform such as the satellite is large, the number of terminal devices served in an NTN cell is usually much larger than that in a terrestrial network (TN) cell, and in order to meet the uplink transmission of the terminal devices in the NTN cell, the communication demand of the uplink is usually large.

[0139] When the uplink channel of these communication systems also supports repeated transmission, it will further aggravate the burden and / or spectrum overhead of the uplink sending, and therefore it is urgent to improve the uplink capacity and / or spectrum utilization efficiency.

[0140] It should be noted that the repeated transmission of the uplink channel can be understood as that the sending end repeatedly transmits the same uplink signal or uplink data (i.e., the same uplink signal or uplink data) on different resources. In this way, through the repeated transmission of the uplink channel, the receiving end can receive multiple same uplink signals or uplink data, so as to improve the receiving performance by the receiving end combining and detecting the multiple same uplink signals or uplink data, improve the probability of correct reception of the uplink, and achieve uplink coverage enhancement. Of course, the repeated transmission of the uplink channel also needs to occupy more spectrum resources, etc.

[0141] In some possible examples, the types of the uplink channel repeated transmission of the embodiment can include repetition type A and repetition type B. The repetition type A can represent that the time units occupied by the multiple uplink channels of the uplink channel repeated transmission are discontinuous, and the repetition type B can represent that the time units occupied by the multiple uplink channels of the uplink channel repeated transmission are continuous. The time unit can represent a basic unit of time domain resources, for example, the time unit can include a slot, a symbol, or a mini slot, etc.

[0142] For example, in the repetition type B, assuming that the number of times of the uplink channel repeated transmission is N, and the number of time units occupied by each of the N uplink channels is L, the repeated transmission is performed on the N*L continuous time units.

[0143] In addition, for the repetition type B, the uplink channel can perform multiple nominal repeated transmissions, and one nominal repeated transmission can be transmitted across a slot. The time domain position of the first nominal repeated transmission can be configured by the network.

[0144] For example, the time domain resource allocation (TDRA) field in the downlink control information (DCI) or the TDRA parameter in the type 1 grant-free scheduling indicates the time domain position of the first nominal repeated transmission, and the time domain positions of the remaining nominal repeated transmissions can be calculated based on the time domain position of the first nominal repeated transmission and the uplink (UL) / downlink (DL) slot configuration. If any nominal repeated transmission crosses the slot boundary or the DL / UL switching point, the nominal repeated transmission is split into multiple actual repeated transmissions at the slot boundary or the DL / UL switching point. If one nominal repeated transmission includes invalid symbols or unavailable symbols, the nominal repeated transmission is segmented into multiple actual repeated transmissions at the invalid symbols. Therefore, the actual number of repetitions can be greater than the indicated value of the number of nominal repeated transmissions.

[0145] Of course, the nominal repeated transmission and the actual repeated transmission are the names of the transmission mode when the uplink channel repeated transmission is performed under the repetition type B, and the nominal repeated transmission can also be named as standard repetition, or normal repetition, etc., and the actual repeated transmission can also be named as sub-repetition, or segmented repetition, etc. The naming manner of the nominal repeated transmission and the actual repeated transmission in the present application is not specifically limited.

[0146] In some possible examples, the uplink channel repetition transmission of the embodiment includes a physical uplink shared channel (PUSCH) repetition transmission, a physical uplink control channel (PUCCH) repetition transmission, a low priority PUSCH (LP PUSCH) repetition transmission, a high priority PUSCH (HP PUSCH) repetition transmission, a low priority PUCCH (LP PUCCH) repetition transmission, a high priority PUCCH (HP PUCCH) repetition transmission, a configured grant PUSCH (CG PUSCH) repetition transmission, or a dynamic scheduled PUSCH repetition transmission, and the like.

[0147] For example, taking a repetition type A of a PUSCH repetition transmission as an example, as shown in FIG. 4. In FIG. 4, the network configures time domain positions of multiple PUSCHs of the PUSCH repetition transmission of the terminal device. The multiple PUSCHs include a PUSCH at a time unit n, a PUSCH at a time unit n+1, a PUSCH at a time unit n+2, and a PUSCH at a time unit n+3. Wherein, n represents an integer.

[0148] For another example, taking a repetition type B of a PUSCH repetition transmission as an example, as shown in FIG. 5. In FIG. 5, the network configures time domain positions of multiple PUSCHs of the PUSCH repetition transmission of the terminal device. The multiple PUSCHs include PUSCHs from a time unit n to a time unit n+2, the time domain positions of the multiple PUSCHs are continuous in time, and the time domain positions of the multiple PUSCHs can span time units. In the following, the embodiment mainly takes the repetition type A as an example for specific description, and the same can be known for the repetition type B, which will not be described herein.

[0149] Based on this, for the uplink channel repetition transmission, the embodiment considers that the uplink channel repetition transmission uses an orthogonal cover code (OCC) to improve the uplink transmission capacity and / or the spectrum utilization efficiency.

[0150] OCC is a technology that can realize time-frequency domain resource multiplexing in a communication system. OCC is a set of mutually orthogonal code words, so that multiple sending ends can simultaneously transmit on the same time-frequency domain resource through OCC without interfering with each other. Specifically, due to the mutual orthogonality of OCC, the signals of multiple sending ends after superposition through OCC can be ensured not to interfere with each other in the time-frequency domain resource, so as to realize the multiplexing of the signals of multiple sending ends on the same time-frequency domain resource through OCC. Correspondingly, the receiving end can use the corresponding demodulation and decoding technology to separate the superimposed signals to obtain the original signals of each sending end.

[0151] In this way, the uplink channels of multiple terminal devices can use OCC to multiplex the same time-frequency domain resource (such as the same resource block (RB) or the same physical resource block (PRB), etc.). That is, the uplink channels of the multiple terminal devices can be transmitted in the same time-frequency domain resource through OCC to produce higher uplink capacity gain, thereby realizing uplink coverage enhancement.

[0152] It should be noted that the OCC used by the uplink channel of the terminal device can be an OCC sequence. The OCC sequence can represent a sequence composed of a set of factors or OCC values. The OCC sequence can be distinguished by an OCC sequence index. The length of the OCC sequence can be 2, 4, 6, or 8, etc., which is not specifically limited.

[0153] Taking the length of the OCC sequence as 4 as an example, the OCC sequence is [x(0), x(1), x(2), x(3)], the first factor (or the first OCC value or the first numerical value) of the OCC sequence is x(0), the second factor (or the second OCC value or the second numerical value) is x(1), the third factor (or the third OCC value or the third numerical value) is x(2), and the fourth factor (or the fourth OCC value or the fourth numerical value) is x(3). Wherein, x(0) is +1 or -1, x(1) is +1 or -1, x(2) is +1 or -1, and x(3) is +1 or -1.

[0154] In addition, the OCC used by the uplink channel of the terminal device can be a certain row or a certain column in the OCC matrix. Each row or each column in the OCC matrix can represent an OCC sequence. The OCC matrix can be network configuration, network indication, pre-configuration, pre-definition, standard protocol specification, or default, etc.

[0155] In some possible examples, the OCC used by the uplink channel of the terminal device can be network configuration, network indication, pre-configuration, pre-definition, standard protocol specification, or default, etc. For example, taking network configuration as an example, the DCI of the downlink physical downlink control channel (PDCCH) indicates the OCC sequence, or the OCC sequence index, or the row index of a certain row or the column index of a certain column in the OCC matrix, etc.

[0156] The following takes the PUSCH repetition transmission as the PUSCH repetition transmission, the PUSCH of the four terminal devices as the repetition transmission on different slots, and uses OCC to multiplex the same time-frequency domain resource on the slot as an example for illustration.

[0157] As shown in FIG. 6, the network configures the time domain positions of the multiple PUSCHs of the PUSCH repetition transmission of the terminal device 1. Wherein the multiple PUSCHs include the PUSCH 1 on the slot n, the PUSCH 1 on the slot n+1, the PUSCH 1 on the slot n+2, and the PUSCH 1 on the slot n+3.

[0158] The network configures the time domain positions of the multiple PUSCHs of the PUSCH repetition transmission of the terminal device 2. Wherein the multiple PUSCHs include the PUSCH 2 on the slot n, the PUSCH 2 on the slot n+1, the PUSCH 2 on the slot n+2, and the PUSCH 2 on the slot n+3.

[0159] The network configures the time domain positions of the multiple PUSCHs of the PUSCH repetition transmission of the terminal device 3. Wherein the multiple PUSCHs include the PUSCH 3 on the slot n, the PUSCH 3 on the slot n+1, the PUSCH 3 on the slot n+2, and the PUSCH 3 on the slot n+3.

[0160] The network configures the time domain positions of the multiple PUSCHs of the PUSCH repetition transmission of the terminal device 4. Wherein the multiple PUSCHs include the PUSCH 4 on the slot n, the PUSCH 4 on the slot n+1, the PUSCH 4 on the slot n+2, and the PUSCH 4 on the slot n+3.

[0161] The PUSCH repetition transmission of the terminal device 1, the PUSCH repetition transmission of the terminal device 2, the PUSCH repetition transmission of the terminal device 3, and the PUSCH repetition transmission of the terminal device 4 multiplex the same time-frequency domain resource on a slot by OCC. That is, the PUSCH 1 on the slot n, the PUSCH 2 on the slot n, the PUSCH 3 on the slot n, and the PUSCH 4 on the slot n multiplex the same time-frequency domain resource on the slot n by OCC; the PUSCH 1 on the slot n+1, the PUSCH 2 on the slot n+1, the PUSCH 3 on the slot n+1, and the PUSCH 4 on the slot n+1 multiplex the same time-frequency domain resource on the slot n+1 by OCC; and the rest can be known in the same manner.

[0162] It is assumed that the length of the OCC sequence is 4, and the OCC sequence used by the PUSCH repetition transmission of the terminal device 1 is [+1, +1, +1, +1], and the index of the OCC sequence is OCC sequence index 0. Among them, the first factor of the OCC sequence is +1, the second factor is +1, the third factor is +1, and the fourth factor is +1. The PUSCH 1 on the slot n uses the first factor, the PUSCH 1 on the slot n+1 uses the second factor, the PUSCH 1 on the slot n+2 uses the third factor, and the PUSCH 1 on the slot n+3 uses the fourth factor.

[0163] The OCC sequence used by the PUSCH repetition transmission of the terminal device 2 is [+1, -1, +1, -1], and the index of the OCC sequence is OCC sequence index 1. Among them, the first factor corresponding to the OCC sequence is +1, the second factor is -1, the third factor is +1, and the fourth factor is -1. The PUSCH 2 on the slot n uses the first factor, the PUSCH 2 on the slot n+1 uses the second factor, the PUSCH 2 on the slot n+2 uses the third factor, and the PUSCH 2 on the slot n+3 uses the fourth factor.

[0164] The OCC sequence used by the PUSCH repetition transmission of the terminal device 3 is [+1, +1, -1, -1], and the index of the OCC sequence is OCC sequence index 2. Among them, the first factor corresponding to the OCC sequence is +1, the second factor is +1, the third factor is -1, and the fourth factor is -1. The PUSCH 3 on the slot n uses the first factor, the PUSCH 3 on the slot n+1 uses the second factor, the PUSCH 3 on the slot n+2 uses the third factor, and the PUSCH 3 on the slot n+3 uses the fourth factor.

[0165] The OCC sequence used by the PUSCH repeated transmission of the terminal device 4 is [+1, -1, -1, +1], and the index of the OCC sequence is OCC sequence index 3. Among them, the first factor corresponding to the OCC sequence is +1, the second factor is -1, the third factor is -1, and the fourth factor is +1. The PUSCH 4 on the time slot n uses the first factor, the PUSCH 4 on the time slot n+1 uses the second factor, the PUSCH 4 on the time slot n+2 uses the third factor, and the PUSCH 4 on the time slot n+3 uses the fourth factor.

[0166] The following describes the grouping of the plurality of uplink channels of the uplink channel repeated transmission of the same terminal device according to the OCC.

[0167] In the repeated transmission of the uplink channel, the embodiment can group the plurality of uplink channels of the uplink channel repeated transmission of the same terminal device according to the OCC sequence to determine at least one uplink channel group, and each uplink channel group in the at least one uplink channel group uses the same OCC sequence. Among them, the uplink channels in each uplink channel group use one factor (or OCC value or numerical value) in the OCC sequence in turn according to the time sequence.

[0168] In this way, by grouping the plurality of uplink channels of the uplink channel repeated transmission according to the OCC sequence, ensuring that each uplink channel group uses the same OCC sequence, the uplink channel repeated transmission uses the OCC, thereby facilitating to improve the uplink transmission capacity and / or spectrum utilization efficiency.

[0169] For example, in FIG. 6, for the PUSCH repeated transmission of the terminal device 1, the PUSCH 1 on the time slot n, the PUSCH 1 on the time slot n+1, the PUSCH 1 on the time slot n+2, and the PUSCH 1 on the time slot n+3 are in the same PUSCH group, and the PUSCH group uses the OCC sequence [+1, +1, +1, +1];

[0170] For the PUSCH repeated transmission of the terminal device 2, the PUSCH 2 on the time slot n, the PUSCH 2 on the time slot n+1, the PUSCH 2 on the time slot n+2, and the PUSCH 2 on the time slot n+3 are in the same PUSCH group, and the PUSCH group uses the OCC sequence [+1, -1, +1, -1];

[0171] For the PUSCH repeated transmission of the terminal device 3, the PUSCH 3 on the time slot n, the PUSCH 3 on the time slot n+1, the PUSCH 3 on the time slot n+2, and the PUSCH 3 on the time slot n+3 are in the same PUSCH group, and the PUSCH group uses the OCC sequence [+1, +1, -1, -1];

[0172] For PUSCH repetition transmission of the terminal device 4, the PUSCH 4 in the time slot n, the PUSCH 4 in the time slot n+1, the PUSCH 4 in the time slot n+2 and the PUSCH 4 in the time slot n+3 are in the same PUSCH group, and the PUSCH group uses the OCC sequence [+1, -1, -1, +1].

[0173] For example, taking PUSCH repetition transmission as an example, as shown in FIG. 7. In FIG. 7, the network configures the time domain positions of multiple PUSCHs of PUSCH repetition transmission of the terminal device. Among them, the multiple PUSCHs include PUSCHs in time units n to n+7. Assuming that the length of the OCC sequence is 4, the multiple PUSCHs of PUSCH repetition transmission of the terminal device are grouped according to the OCC sequence to obtain multiple PUSCH groups. Among them, the PUSCHs in time units n to n+3 are in one PUSCH group, and the PUSCHs in time units n+4 to n+7 are in another PUSCH group.

[0174] The following takes the first OCC sequence and PUSCH repetition transmission as an example for illustration. Among them, the first OCC sequence is one OCC sequence. As shown in FIG. 8, FIG. 8 is a flowchart of a communication method according to an embodiment of the present application, which specifically includes the following steps:

[0175] S810. Grouping the multiple PUSCHs of PUSCH repetition transmission according to the first OCC sequence, and determining at least one PUSCH group, each PUSCH group in the at least one PUSCH group using the first OCC sequence.

[0176] Among them, the PUSCHs in each PUSCH group use the factors (or OCC values or numerical values) in the first OCC sequence in turn according to the time sequence.

[0177] It can be seen that by grouping the multiple PUSCHs of PUSCH repetition transmission according to the OCC sequence, it is ensured that each PUSCH group uses the same OCC sequence, and the use of OCC for PUSCH repetition transmission is realized, thereby facilitating the improvement of the system capacity and / or spectrum utilization efficiency of PUSCH repetition transmission.

[0178] It should be noted that the resources of the multiple PUSCHs of PUSCH repetition transmission are configured or scheduled by the network. The first OCC sequence is network configured, network indicated, predefined, preconfigured, standard protocol specified, default, or determined according to parameters, which will be illustrated in the following examples.

[0179] In addition, for the at least one PUSCH group obtained by grouping the multiple PUSCHs of the PUSCH repetition transmission of the terminal device according to the first OCC sequence, each of the at least one PUSCH group has a time sequence. Therefore, according to the time sequence, the earliest PUSCH group in time can be referred to as the first PUSCH group, followed by the second PUSCH group, and so on. In addition, each of the PUSCHs in each of the PUSCH groups also has a time sequence. Therefore, according to the time sequence, the earliest PUSCH in time within the same PUSCH group can be referred to as the first PUSCH within the PUSCH group, followed by the second PUSCH, and so on.

[0180] For example, in FIG. 7, the PUSCH group 0 is the previous PUSCH group of the PUSCH group 1, and the PUSCH group 1 is one adjacent PUSCH group located after the PUSCH group 0. For the PUSCH group 0, the PUSCH at the time unit n is the first PUSCH within the PUSCH group 0, the PUSCH at the time unit n+1 is the second PUSCH within the PUSCH group 0, and so on. For the PUSCH group 1, the PUSCH at the time unit n+4 is the first PUSCH within the PUSCH group 1, the PUSCH at the time unit n+5 is the second PUSCH within the PUSCH group 1, and so on.

[0181] The following specifically describes an example in which the resources of the PUCCHs in the at least one PUCCH can overlap with the resources of the PUSCHs in the at least one PUSCH group.

[0182] For the at least one PUSCH group obtained by grouping the multiple PUSCHs of the PUSCH repetition transmission of the terminal device according to the first OCC sequence, in addition to the fact that the network device needs to configure the terminal device with the resources of the PUSCHs in the at least one PUSCH group, the network device can also configure the terminal device with the resources of at least one PUCCH, and the resources of the PUCCHs in the at least one PUCCH can overlap with the resources of the PUSCHs in the at least one PUSCH group.

[0183] It can be understood that the resources of the PUCCH overlap with the resources of the PUSCH, which means that the resources of the PUCCH overlap with or are the same as the resources of the PUSCH in the time domain and / or the frequency domain, or the time domain resources of the PUCCH overlap with or are the same as the time domain resources of the PUSCH, or the frequency domain resources of the PUCCH overlap with or are the same as the frequency domain resources of the PUSCH, or the time-frequency domain resources of the PUCCH overlap with or are the same as the time-frequency domain resources of the PUSCH.

[0184] For example, in terms of symbols, the symbols of the PUCCH overlap or are the same as the symbols of the PUSCH. For another example, in terms of REs, the REs of the PUCCH overlap or are the same as the REs of the PUSCH.

[0185] In addition, the resources of the PUCCH overlap or are the same as the resources of the PUSCH, which can include that all resources of the PUCCH overlap or are the same as all resources of the PUSCH, or all resources of the PUCCH overlap or are the same as part of the resources of the PUSCH, or part of the resources of the PUCCH overlap or are the same as part of the resources of the PUSCH, or part of the resources of the PUCCH overlap or are the same as all resources of the PUSCH.

[0186] For example, in terms of the symbols of the PUCCH overlapping the symbols of the PUSCH, as shown in FIG. 9. In (a) of FIG. 9, the symbols of the PUCCH are symbol 0 to symbol 5 within slot n. In (b) of FIG. 9, the symbols of the PUSCH are symbol 4 to symbol 13 within slot n. Therefore, part of the symbols of the PUCCH overlap part of the symbols of the PUSCH. It should be understood that FIG. 9 only illustrates part of the slots in the time domain, and there can be other slots and the like, which are not specifically limited.

[0187] It should be noted that the PUCCH can carry or carry uplink control information (UCI), and the UCI can include at least one of a scheduling request (SR), hybrid automatic repeat request-ACK (HARQ-ACK) information, and channel state information (CSI).

[0188] Based on this, when the resources of the PUCCH overlap the resources of the PUSCH in the PUSCH group, the network device or the terminal device of the embodiment can also need to determine the multiplexing state of the UCI of the PUCCH and the PUSCH in the PUSCH group. As shown in FIG. 10, FIG. 10 is a flow diagram of another communication method according to an embodiment of the present application, which specifically includes the following steps:

[0189] S1010. The same as S810, which will not be repeated here.

[0190] S1020. At least one PUCCH is determined, and the resources of the PUCCH in the at least one PUCCH overlap the resources of the PUSCH in the at least one PUSCH group.

[0191] It should be noted that, for the terminal device, the terminal device can determine the at least one PUCCH through network configuration or network scheduling.

[0192] S1030. Determine the multiplexing status of the UCI of the at least one PUCCH and the PUSCH in the at least one PUSCH group.

[0193] It can be seen that, if the resource of the PUCCH overlaps with the resource of the PUSCH in the PUSCH group, the network device or the terminal device of the embodiment needs to determine the multiplexing status of the UCI of the PUCCH and the PUSCH in the PUSCH group, so as to ensure the transmission of the UCI of the PUCCH and the PUSCH.

[0194] In some possible examples, for the method of processing multiple overlapping PUCCHs and / or PUSCHs, the embodiment can include the following two application scenarios:

[0195] In application scenario 1, PUCCH#1 and PUCCH#2 overlap in the time domain, and the UCI of the two PUCCHs can be multiplexed and transmitted on PUCCH#3, where PUCCH#3 can be PUCCH#1 or PUCCH#2, or other PUCCHs different from PUCCH#1 and PUCCH#2.

[0196] In application scenario 2, PUCCH#1 and PUSCH#1 overlap in the time domain, and the UCI of PUCCH#1 can be multiplexed and transmitted on PUSCH#1 together with the data carried on PUSCH#1, that is, the UCI of PUCCH#1 is multiplexed on PUSCH#1. When the two channels overlap, the multiplexing timeline#1 must be met, and multiplexing transmission must be performed.

[0197] In some possible examples, the multiplexing timeline#1 is divided into PUCCH vs PUCCH and PUCCH vs PUSCH.

[0198] For PUCCH vs PUCCH, there are two cases as follows:

[0199] One case is that PUCCH#1 and PUCCH#2 overlap in the time domain, if the UCI of PUCCH#1 and / or the UCI of PUCCH#1 includes HARQ-ACK information, and, the multiplexing timeline#1 is:

[0200] The time interval between the first symbol of the overlapping resource (i.e., the earliest of the start symbols of PUCCH#1 and PUCCH#2) and the end symbol of the physical downlink share channel (PDSCH) is greater than or equal to T1 = N1 + d. 1，1 +1 symbol. Where N1 is a preset value, related to the subcarrier spacing and terminal equipment capabilities; d 1，1 This is a preset offset value, related to the time domain length and type of the PDSCH. N1+d 1，1 This is to ensure that the terminal device has sufficient time to generate HARQ-ACK information and complete transmission preparation after receiving the PDSCH. The additional symbol is a processing delay specifically introduced for the multiplexing of PUCCH#1 and PUCCH#2.

[0201] Another scenario is: taking the overlap of PUCCH#1 and PUCCH#2 in the time domain as an example, if neither the UCI of PUCCH#1 nor the UCI of PUCCH#2 includes HARQ-ACK information, such as SR and / or CSI, then timeline#1 does not exist, or timeline#1 is satisfied by default.

[0202] Regarding PUCCH vs PUSCH, taking the temporal overlap of PUCCH#1 and PUSCH#1 as an example, if the UCI of PUCCH#1 includes HARQ-ACK information, then the time interval between the first symbol of the overlapping resource (i.e., the earliest of the start symbols of PUCCH#1 and PUSCH#1) and the end symbol of PDSCH is greater than or equal to T1 = N1 + d. 1，1 +1 symbol, explained as above, will not be repeated here. If PUSCH#1 is the first transmission of DCI activation in a dynamically scheduled PUSCH or a Type-2 CG-PUSCH, then the time interval between the first symbol of the overlapping resource and the end symbol of the PDCCH containing that DCI is T2 = N2 + d. 2，1 +1 symbol. Where N2 is a preset value, related to the subcarrier spacing and terminal equipment capabilities; d 2，1 This is a preset offset value, related to the type of PUSCH#1. N2+d 2，1 This is to ensure that the terminal device has sufficient time to prepare for sending PUSCH#1 after receiving the DCI. The extra symbol is a processing delay specifically introduced for multiplexing PUCCH#1 and PUSCH#1.

[0203] In some possible examples, the UCI multiplexing sequence is divided into UCI multiplexing between multiple overlapping PUCCHs, and UCI multiplexing of PUCCHs with overlapping PUSCHs.

[0204] UCI multiplexing between multiple overlapping PUCCHs can include the following two steps:

[0205] Step 1: Process the multiplexing of multiple CSIs, 1 PUCCH CSI or 2 PUCCH CSIs (one long and one short) can be supported in one slot.

[0206] Step 2: The terminal device will sort all multiple overlapping PUCCHs that need to be processed (the principle is that the starting symbol early is sorted first, and the starting symbol is the same length is sorted first) to obtain a PUCCH set (denoted as Set#0); For the first PUCCH (denoted as PUCCH#1) in Set#0, find all PUCCH sets (denoted as Set#1) overlapping with PUCCH#1, multiplex PUCCH#1 and all PUCCHs in Set#1 on one PUCCH#1' transmission; Remove PUCCH#1 and all PUCCHs in Set#1 from Set#0, add PUCCH#1', and then repeat the above processing.

[0207] UCI multiplexing of PUCCH and overlapping PUSCH:

[0208] For the multiplexing of 1 PUCCH (denoted as PUCCH#1) and multiple overlapping PUSCHs, find 1 PUSCH to carry the UCI of PUCCH according to certain principles, and the priority of the selection principle is as follows:

[0209] 1) PUSCH carrying aperiodic CSI (A-CSI);

[0210] 2) The earliest time-domain position PUSCH; For example, under multi-carrier (component carrier, CC) PUSCH transmission, there can be multiple slots corresponding to different carriers, even if there is only one slot for one carrier, there can be multiple PUSCHs in this slot, and the earliest time-domain position is selected;

[0211] 3) The priority of dynamically scheduled PUSCH is higher than that of CG-PUSCH;

[0212] 4) The priority of the PUSCH with a small carrier index is higher than that of the PUSCH with a high carrier index;

[0213] 5) The priority of the PUSCH with an early starting symbol is higher than that of the PUSCH with a late starting symbol.

[0214] For the multiplexing between 1 PUSCH (denoted as PUSCH#1) and multiple overlapping PUCCHs' UCI: after the above steps are determined, if the UCI of multiple PUCCHs are all multiplexed onto 1 PUSCH, they can be directly multiplexed onto PUSCH#1.

[0215] In summary, when the resource of a certain PUCCH overlaps with the resource of a certain PUSCH in a certain PUSCH group, the UCI of the PUCCH can be multiplexed onto the PUSCH. However, since the PUSCH group uses an OCC sequence, when the UCI of the PUCCH is only multiplexed onto the PUSCH, this will cause the orthogonality of the PUSCH to other PUSCHs in the PUSCH group to be not guaranteed, and the orthogonality of the PUSCH to other PUSCHs in the same time-frequency domain resource as the PUSCH to be not guaranteed.

[0216] For example, as shown in FIG. 11. In FIG. 11, the network configures the time domain positions of the multiple PUSCHs of the PUSCH repetition transmission of terminal device 1, including PUSCH 1 on time unit n to time unit n+7. The network configures the time domain positions of the multiple PUSCHs of the PUSCH repetition transmission of terminal device 2, including PUSCH 2 on time unit n to time unit n+7. The PUSCH repetition transmission of terminal device 1 and the PUSCH repetition transmission of terminal device 2 multiplex the same time-frequency domain resource on a time unit through OCC. That is, PUSCH 1 on time unit n and PUSCH 2 on time unit n multiplex the same time-frequency domain resource on time unit n through OCC, and the rest can be similarly understood.

[0217] When the network configures the resource of PUCCH 1 of terminal device 1, and the resource of PUCCH 1 overlaps with the resource of PUSCH 1 on time slot n, if the UCI of PUCCH 1 is only multiplexed onto PUSCH 1 on time slot n and not multiplexed onto the PUSCHs on other time slots, this will cause the orthogonality of PUSCH 1 on time unit n to PUSCH 1 on time unit n+1 to time unit n+3 to be not guaranteed, and the orthogonality of PUSCH 1 on time unit n to PUSCH 2 on time unit n to be not guaranteed.

[0218] Based on this, in order to avoid affecting the orthogonality due to the multiplexing of the UCI of the PUCCH onto the PUSCH, for the determination of the multiplexing state of the UCI of the at least one PUCCH and the PUSCH in the at least one PUSCH group in S1030, the embodiment can adopt the following manners:

[0219]

Manner 1

[0220] In "Manner 1", the present embodiment can adopt the following UCI multiplexing rule:

[0221] Rule 1-1: If the resource of one or more PUCCHs overlaps with the resource of the first PUSCH in a PUSCH group, multiplex the UCI of the one or more PUCCHs onto all PUSCHs in the PUSCH group.

[0222] In the present embodiment, the implementation manner of multiplexing the UCI of the one or more PUCCHs onto all PUSCHs in the PUSCH group can adopt the existing manner, and no specific limitation is made.

[0223] It should be noted that multiplexing the UCI of the one or more PUCCHs onto all PUSCHs in the PUSCH group is equivalent to repeating the transmission of the UCI of the one or more PUCCHs.

[0224] In addition, when the UCI of multiple PUCCHs needs to be multiplexed onto all PUSCHs in the same PUSCH group, the present embodiment needs to first multiplex the UCI of the multiple PUCCHs respectively, and then multiplex the final UCI after UCI multiplexing onto all PUSCHs in the PUSCH group. In the present embodiment, the implementation manner of multiplexing the UCI of the multiple PUCCHs respectively can adopt the existing manner, and no specific limitation is made.

[0225] For example, taking one PUCCH as an example, as shown in FIG. 12. In FIG. 12, the network configures the time domain positions of multiple PUSCHs for PUSCH repetition transmission, and the multiple PUSCHs include PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped into PUSCH group 0 and PUSCH group 1 according to the OCC sequence with a length of 4. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of the PUCCH configured by the network overlaps with the resource of the PUSCH on time unit n+2 (i.e., the first PUSCH in PUSCH group 0), the UCI of the PUCCH is multiplexed onto all PUSCHs in PUSCH group 0.

[0226] For example, as shown in FIG. 13, taking two PUCCHs as an example. In FIG. 13, the network configures the time domain positions of multiple PUSCHs for PUSCH repetition transmission, including PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped according to the OCC sequence with a length of 4 to obtain PUSCH group 0 and PUSCH group 1. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of the network configured PUCCH 1 overlaps with the resource of the PUSCH on time unit n+2 (i.e., the first PUSCH in PUSCH group 0), and the resource of the network configured PUCCH 2 overlaps with the resource of the PUSCH on time unit n+2, the UCI of PUCCH 1 and the UCI of PUCCH 2 are multiplexed, and the final UCI after UCI multiplexing is multiplexed onto all PUSCHs in PUSCH group 0.

[0227] For example, as shown in FIG. 14, taking two PUCCHs as an example. In FIG. 14, the network configures the time domain positions of multiple PUSCHs for PUSCH repetition transmission, including PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped according to the OCC sequence with a length of 4 to obtain PUSCH group 0 and PUSCH group 1. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of the network configured PUCCH 1 overlaps with the resource of the PUSCH on time unit n+2 (i.e., the first PUSCH in PUSCH group 0), and the resource of the network configured PUCCH 2 overlaps with the resource of the PUSCH on time unit n+6 (i.e., the first PUSCH in PUSCH group 1), the UCI of PUCCH 1 is multiplexed onto all PUSCHs in PUSCH group 0, and the UCI of PUCCH 2 is multiplexed onto all PUSCHs in PUSCH group 1.

[0228] Rule 1-2: If the resource of one or more PUCCHs overlaps with the resource of a PUSCH other than the first PUSCH in a certain PUSCH group, drop the UCI of the one or more PUCCHs.

[0229] It should be noted that dropping the UCI of the one or more PUCCHs can be understood as not sending or not transmitting the UCI of the one or more PUCCHs.

[0230] For example, taking one PUCCH as an example, as shown in FIG. 15. In FIG. 15, the network configures the time domain positions of multiple PUSCHs for PUSCH repetition transmission, including PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped according to the OCC sequence with a length of 4 to obtain PUSCH group 0 and PUSCH group 1. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of the PUCCH configured by the network overlaps with the resource of the PUSCH on time unit n+3 (i.e., the second PUSCH in PUSCH group 0), the UCI of the PUCCH is discarded.

[0231] For example, taking one PUCCH as an example, as shown in FIG. 15. In FIG. 15, the network configures the time domain positions of multiple PUSCHs for PUSCH repetition transmission, including PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped according to the OCC sequence with a length of 4 to obtain PUSCH group 0 and PUSCH group 1. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of the PUCCH configured by the network overlaps with the resource of the PUSCH on time unit n+3 (i.e., the second PUSCH in PUSCH group 0), the UCI of the PUCCH is discarded.

[0232] Rule 1-3: a combination of rule 1-1 and rule 1-2.

[0233] It is worth noting that in rule 1-3, the UCI of multiple PUCCHs may need to be multiplexed into all PUSCHs in the same PUSCH group. At this time, the embodiment needs to first multiplex the UCI of each of the multiple PUCCHs, and then multiplex the final UCI after UCI multiplexing to all PUSCHs in the PUSCH group, which will not be described here.

[0234] In the following, the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group is determined in S1030 by taking the first PUCCH in the at least one PUCCH and the first PUSCH group in the at least one PUSCH group as an example. The first PUCCH is one or more PUCCHs in the at least one PUCCH, and the first PUSCH group is one PUSCH group in the at least one PUSCH group.

[0235] In one possible example, according to the rule 1-1 or the rule 1-3, the determination of the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group in S1030 includes:

[0236] If the resource of the first PUCCH overlaps with the resource of the first PUSCH in the first PUSCH group, it is determined that the first UCI is on all the PUSCHs in the first PUSCH group.

[0237] The first UCI is the UCI of the first PUCCH.

[0238] In this way, by multiplexing the UCI of the first PUCCH on all the PUSCHs in the first PUSCH group, not only the transmission of the UCI of the first PUCCH and all the PUSCHs in the first PUSCH group is guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0239] It should be noted that if the first PUCCH is one PUCCH, the UCI of the first PUCCH is the UCI of the one PUCCH; if the first PUCCH is multiple PUCCHs, the UCI of the first PUCCH is the UCI after multiplexing the respective UCIs of the multiple PUCCHs.

[0240] In one possible example, according to the rule 1-1 or the rule 1-3, the determination of the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group in S1030 includes:

[0241] If the resource of the first PUCCH overlaps with the resource of the first PUSCH in the first PUSCH group, it is determined that the first UCI is on all the PUSCHs in the first PUSCH group.

[0242] The first UCI is the UCI after multiplexing the UCI of the first PUCCH and the UCI of the second PUCCH.

[0243] The second PUCCH is one or more PUCCHs in the at least one PUCCH except the first PUCCH;

[0244] The resource of the second PUCCH overlaps with the resource of the first PUSCH in the first PUSCH group.

[0245] In this way, by multiplexing the first UCI on all PUSCHs in the first PUSCH group, not only is the transmission of the first UCI and all PUSCHs in the first PUSCH group guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0246] It should be noted that if the second PUCCH is one PUCCH, the UCI of the second PUCCH is the UCI of the one PUCCH; if the second PUCCH is multiple PUCCHs, the UCI of the second PUCCH is the UCI after multiplexing the respective UCIs of the multiple PUCCHs.

[0247] In one possible example, according to the above rules 1-2 or 1-3, the determination of the multiplexing state of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group in S1030 includes:

[0248] If the resource of the first PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH, it is determined that the UCI of the first PUCCH is discarded.

[0249] In this way, by discarding the UCI of the first PUCCH, not only is the transmission of all PUSCHs in the first PUSCH group guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0250]

Mode 2

[0251] In "Mode 2", the present embodiment can adopt the following UCI multiplexing rules:

[0252] Rule 2-1: The same as rule 1-1 above, which will not be repeated here.

[0253] Rule 2-2: If the resource of one or more PUCCHs overlaps with the resource of the other PUSCHs in a PUSCH group except the first PUSCH, the UCI of the one or more PUCCHs is multiplexed on all PUSCHs in a neighboring PUSCH group (i.e., the next PUSCH group of the PUSCH group) located after the PUSCH group. That is, the UCI of the one or more PUCCHs is postponed to the next PUSCH group.

[0254] It should be noted that when the UCI of multiple PUCCHs needs to be multiplexed into all PUSCHs in the next PUSCH group, the embodiment needs to first multiplex the UCI of each of the multiple PUCCHs, and then multiplex the final UCI after UCI multiplexing into all PUSCHs in the next PUSCH group.

[0255] For example, taking two PUCCHs as an example, as shown in FIG. 17. In FIG. 17, the network configures the time domain positions of multiple PUSCHs for PUSCH repetition transmission, and the multiple PUSCHs include PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped according to the OCC sequence with a length of 4 to obtain PUSCH group 0 and PUSCH group 1. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of PUCCH 1 configured by the network overlaps with the resource of the PUSCH on time unit n+3 (i.e., the second PUSCH in PUSCH group 0), and the resource of PUCCH 2 configured by the network overlaps with the resource of the PUSCH on time unit n+4 (i.e., the third PUSCH in PUSCH group 0), the UCI of PUCCH 1 and the UCI of PUCCH 2 are multiplexed, and the final UCI after UCI multiplexing is multiplexed into all PUSCHs in PUSCH group 1.

[0256] In addition, delaying the UCI of the one or more PUCCHs to the next PUSCH group can be understood as delaying the UCI of the one or more PUCCHs to the start of the transmission time of the first PUSCH in the next PUSCH group. That is, the reporting time of the UCI of the one or more PUCCHs is delayed. At this time, the reporting time of the UCI of the one or more PUCCHs is calculated based on the transmission time of the first PUSCH in the next PUSCH group.

[0257] For example, in FIG. 17, the UCI of PUCCH 1 is delayed from time unit n+3 to start reporting at time unit n+6, that is, the reporting time of the UCI of PUCCH 1 is calculated based on time unit n+6; the UCI of PUCCH 2 is delayed from time unit n+4 to start reporting at time unit n+6, that is, the reporting time of the UCI of PUCCH 2 is calculated based on time unit n+6.

[0258] It should be noted that when the time domain position of some parameters needs to be determined according to the reporting time of the UCI of the PUCCH, since the reporting time of the UCI of the PUCCH is calculated based on the transmission time of the first PUSCH in the next PUSCH group, the time domain position of these parameters also needs to be determined according to the transmission time of the first PUSCH in the next PUSCH group.

[0259] For example, taking the case that the UCI of the PUCCH contains CSI, the uplink slot where the CSI is reported is slot n', and the downlink slot where the CSI reference resource is located is slot

[0260] wherein K offset represents the offset configured by the higher layer, μ Koffset represents the subcarrier spacing configuration under frequency range 1 (frequency range 1) and K offset = 0, μ DL represents the downlink subcarrier spacing configuration.

[0261] Slot n represents the downlink slot corresponding to slot n', and is calculated as follows:

[0262] wherein μ UL represents the uplink subcarrier spacing configuration, represents the downlink slot offset, μ offset,DL represents the maximum value of the minimum value of the primary cell (Pcell) / primary secondary cell (PScell) downlink subcarrier spacing configuration and the minimum value of the secondary cell (Scell) downlink subcarrier spacing configuration, represents the uplink slot offset, μ offset,UL represents the maximum value of the minimum value of the Pcell / PScell uplink subcarrier spacing configuration and the minimum value of the Scell uplink subcarrier spacing configuration.

[0263] n CSI_ref represents the slot offset between slot n and the valid downlink slot where the CSI reference resource is located. Whether a downlink slot is a "valid downlink slot" needs to satisfy the following conditions: the downlink slot includes at least one downlink symbol or flexible symbol configured by the higher layer signaling; and / or, the downlink slot is not within the configured measurement gap.

[0264] It can be seen that the downlink slot where the CSI reference resource is located is determined according to the uplink slot n' where the CSI reporting is located. Therefore, when the reporting time of the CSI is calculated according to the transmission time of the first PUSCH in the next PUSCH group (that is, the uplink slot n' where the CSI reporting is located is the uplink slot where the first PUSCH in the next PUSCH group is located), the downlink slot where the CSI reference resource is located is also determined according to the transmission time of the first PUSCH in the next PUSCH group.

[0265] Rule 2-3: If the resources of one or more PUCCHs overlap with the resources of a PUSCH other than the first PUSCH in a PUSCH group, and there is no other PUSCH group after the PUSCH group (that is, the PUSCH group is the last PUSCH group), the UCI of the one or more PUCCHs is discarded.

[0266] For example, taking two PUCCHs as an example, as shown in FIG. 18. In FIG. 18, the network configures the time domain positions of multiple PUSCHs for repeated transmission of PUSCHs, and the multiple PUSCHs include PUSCHs on time units n+2 to n+5. Among them, the PUSCHs are grouped into a PUSCH group 0 according to an OCC sequence with a length of 4. The PUSCH group 0 includes PUSCHs on time units n+2 to n+5. If the resources of the PUCCH 1 configured by the network overlap with the resources of the PUSCH on the time unit n+3 (that is, the second PUSCH in the PUSCH group 0), and the resources of the PUCCH 2 configured by the network overlap with the resources of the PUSCH on the time unit n+4 (that is, the third PUSCH in the PUSCH group 0), since there is no other PUSCH group after the PUSCH group 0, the UCI of the PUCCH 1 and the UCI of the PUCCH 2 are discarded.

[0267] Rule 2-4: Combination of rule 2-1, rule 2-2 and rule 2-3.

[0268] It is worth noting that there can be multiple PUCCH UCI multiplexed into all PUSCHs in the same PUSCH group in rule 2-4. At this time, the embodiment needs to first multiplex the UCI of the multiple PUCCHs respectively, and then multiplex the final UCI after UCI multiplexing to all PUSCHs in the PUSCH group, which will not be described here.

[0269] In the following, the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group is determined in S1030 by taking the first PUCCH in the at least one PUCCH, and the first PUSCH group and the second PUSCH group in the at least one PUSCH group as an example. The first PUCCH is one or more PUCCHs in the at least one PUCCH, the first PUSCH group is one PUSCH group in the at least one PUSCH group, and the second PUSCH group is one adjacent PUSCH group (i.e., the next PUSCH group of the first PUSCH group) after the first PUSCH group in the at least one PUSCH group.

[0270] In one possible example, according to the above rule 2-2 or rule 2-4, the determination of the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group in S1030 includes:

[0271] If the resource of the first PUCCH overlaps with the resource of the PUSCHs other than the first PUSCH in the first PUSCH group, it is determined that the second UCI is on all the PUSCHs in the second PUSCH group.

[0272] The second UCI is the UCI of the first PUCCH.

[0273] In this way, by multiplexing the UCI of the first PUCCH on all the PUSCHs in the second PUSCH group, not only is the transmission of the UCI of the first PUCCH and all the PUSCHs in the second PUSCH group guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group and the second PUSCH group is guaranteed.

[0274] It should be noted that if the first PUCCH is one PUCCH, the UCI of the first PUCCH is the UCI of the one PUCCH; if the first PUCCH is multiple PUCCHs, the UCI of the first PUCCH is the UCI after multiplexing the respective UCIs of the multiple PUCCHs.

[0275] In one possible example, according to the above rule 2-2 or rule 2-4, the determination of the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group in S1030 includes:

[0276] If the resource of the first PUCCH overlaps with the resource of the PUSCHs other than the first PUSCH in the first PUSCH group, it is determined that the second UCI is on all the PUSCHs in the second PUSCH group.

[0277] The second UCI is UCI after UCI multiplexing of UCI of the first PUCCH and UCI of the third PUCCH;

[0278] The third PUCCH is one or more PUCCHs in the at least one PUCCH except the first PUCCH;

[0279] The resource of the third PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH, or the resource of the third PUCCH overlaps with the resource of the first PUSCH in the second PUSCH group, or the resource of the third PUCCH overlaps with the resource of the other PUSCHs in the second PUSCH group except the first PUSCH.

[0280] In this way, by multiplexing the second UCI on all PUSCHs in the second PUSCH group, not only the transmission of the second UCI and all PUSCHs in the second PUSCH group is guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group and the second PUSCH group is guaranteed.

[0281] It should be noted that if the first PUCCH or the third PUCCH is one PUCCH, the UCI of the first PUCCH or the third PUCCH is the UCI of the one PUCCH; if the first PUCCH or the third PUCCH is multiple PUCCHs, the UCI of the first PUCCH or the third PUCCH is UCI after UCI multiplexing of the respective UCI of the multiple PUCCHs.

[0282] In one possible example, according to the above rule 2-3 or rule 2-4, the determination of the multiplexing state of the UCI of the at least one PUCCH and the PUSCH in the at least one PUSCH group in S1030 includes:

[0283] If the resource of the first PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH, and the first PUSCH group is the last PUSCH group, it is determined that the UCI of the first PUCCH is discarded.

[0284] In this way, by discarding the UCI of the first PUCCH, not only the transmission of all PUSCHs in the first PUSCH group is guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0285]

Mode 3

[0286] In "Mode 3", the present embodiment can adopt the following UCI multiplexing rule:

[0287] Rule 3-1: Same as rule 1-1 above, which will not be repeated here.

[0288] Rule 3-2: If the resource of one or more PUCCHs overlaps with the resource of other PUSCHs in a PUSCH group except the first PUSCH, the UCI of the one or more PUCCHs is multiplexed onto all PUSCHs in the PUSCH group. That is, the UCI of the one or more PUCCHs is advanced to the first PUSCH in the PUSCH group.

[0289] It should be noted that when the UCI of multiple PUCCHs needs to be multiplexed onto all PUSCHs in the same PUSCH group, the embodiment needs to first multiplex the UCI of each of the multiple PUCCHs, and then multiplex the final UCI after UCI multiplexing onto all PUSCHs in the PUSCH group.

[0290] For example, taking two PUCCHs as an example, as shown in FIG. 19. In FIG. 19, the network configures the time domain positions of multiple PUSCHs for PUSCH repeated transmission, and the multiple PUSCHs include PUSCHs on time units n+2 to n+9. Among them, the PUSCHs are grouped into PUSCH group 0 and PUSCH group 1 according to the OCC sequence with a length of 4. PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. If the resource of PUCCH 1 configured by the network overlaps with the resource of the PUSCH on time unit n+3 (i.e., the second PUSCH in PUSCH group 0), and the resource of PUCCH 2 configured by the network overlaps with the resource of the PUSCH on time unit n+4 (i.e., the third PUSCH in PUSCH group 0), the UCI of PUCCH 1 and the UCI of PUCCH 2 are multiplexed, and the final UCI after UCI multiplexing is multiplexed onto all PUSCHs in PUSCH group 0.

[0291] In addition, advancing the UCI of the one or more PUCCHs to the first PUSCH in the PUSCH group can be understood as advancing the UCI of the one or more PUCCHs to the start of the transmission time of the first PUSCH in the PUSCH group. That is, the reporting time of the UCI of the one or more PUCCHs is advanced. At this time, the reporting time of the UCI of the one or more PUCCHs is calculated based on the transmission time of the first PUSCH in the PUSCH group.

[0292] For example, in FIG. 19, the UCI of PUCCH 1 is reported from time unit n+3 to time unit n+2 in advance, i.e., the reporting time of the UCI of PUCCH 1 is calculated as time unit n+2; the UCI of PUCCH 2 is reported from time unit n+4 to time unit n+2 in advance, i.e., the reporting time of the UCI of PUCCH 2 is calculated as time unit n+2.

[0293] It should be noted that when the time domain position of some parameters needs to be determined according to the reporting time of the UCI of the PUCCH, since the reporting time of the UCI of the PUCCH is calculated as the transmission time of the first PUSCH in the PUSCH group, the time domain position of these parameters also needs to be determined according to the transmission time of the first PUSCH.

[0294] For example, taking the case that the UCI of the PUCCH includes CSI as an example, when the reporting time of the CSI is calculated as the transmission time of the first PUSCH (i.e., the uplink slot n' where the CSI is reported is the uplink slot where the first PUSCH is located), the downlink slot where the CSI reference resource is located is also determined according to the transmission time of the first PUSCH.

[0295] Rule 3-3: Combination of rule 3-1 and rule 3-2.

[0296] It should be noted that in rule 3-3, there can be multiple UCIs of PUCCHs that need to be multiplexed into all PUSCHs in the same PUSCH group. At this time, the embodiment needs to first multiplex the UCIs of the multiple PUCCHs respectively, and then multiplex the final UCI after UCI multiplexing to all PUSCHs in the PUSCH group, which will not be described here.

[0297] Based on the above, the determination of the multiplexing state of the UCI of the at least one PUCCH and the PUSCH in the at least one PUSCH group in S1030 will be described below by taking the first PUCCH in the at least one PUCCH and the first PUSCH group in the at least one PUSCH group as an example. The first PUCCH is one or more PUCCHs in the at least one PUCCH, and the first PUSCH group is one PUSCH group in the at least one PUSCH group.

[0298] In one possible example, according to the above rule 3-1 or rule 3-3, the determination of the multiplexing state of the UCI of the at least one PUCCH and the PUSCH in the at least one PUSCH group in S1030 includes:

[0299] if the resource of the first PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH, the first UCI is determined to be on all the PUSCHs in the first PUSCH group;

[0300] The first UCI is the UCI of the first PUCCH.

[0301] In this way, by multiplexing the UCI of the first PUCCH on all the PUSCHs in the first PUSCH group, not only the transmission of the UCI of the first PUCCH and all the PUSCHs in the first PUSCH group is guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0302] In one possible example, according to the rule 3-1 or the rule 3-3 above, the determination of the multiplexing status of the UCI of the at least one PUCCH and the PUSCHs in the at least one PUSCH group in S1030 comprises:

[0303] if the resource of the first PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH, the first UCI is determined to be on all the PUSCHs in the first PUSCH group;

[0304] The first UCI is the UCI after multiplexing the UCI of the first PUCCH and the UCI of the second PUCCH;

[0305] The second PUCCH is one or more PUCCHs in the at least one PUCCH except the first PUCCH;

[0306] The resource of the second PUCCH overlaps with the resource of the first PUSCH in the first PUSCH group, or the resource of the second PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH.

[0307] In this way, by multiplexing the UCI of the first PUCCH on all the PUSCHs in the first PUSCH group, not only the transmission of the UCI of the first PUCCH and all the PUSCHs in the first PUSCH group is guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0308] The following illustrates an example in which the at least one PUCCH and / or the PUSCHs in the at least one PUSCH group are scheduled by at least one DCI.

[0309] It should be noted that the network device can schedule the PUSCH in the at least one PUSCH group through the DCI. That is, the DCI schedules multiple PUSCHs of the PUSCH repetition transmission. In addition, the network device can schedule the at least one PUCCH through the DCI. Wherein, the DCI scheduling the PUSCH can be different from or the same as the DCI scheduling the PUCCH, and different PUCCHs can be scheduled by different or the same DCI. Therefore, the network device can schedule the at least one PUCCH and / or the PUSCH in the at least one PUSCH group through at least one DCI.

[0310] For example, in FIG. 11, one DCI schedules multiple PUSCHs of the PUSCH repetition transmission of the terminal device 1, and another DCI schedules the PUCCH of the terminal device 1.

[0311] After the network device schedules the at least one PUCCH and / or the PUSCH in the at least one PUSCH group through at least one DCI, since the terminal device needs to transmit the at least one PUCCH and / or the PUSCH in the at least one PUSCH group, a certain time interval is required between receiving the at least one DCI and transmitting the at least one PUCCH and / or the PUSCH in the at least one PUSCH group to ensure that the terminal device completes the relevant processing.

[0312] Based on this, if the at least one PUCCH and / or the PUSCH in the at least one PUSCH group is scheduled by at least one DCI, the network device or the terminal device of the embodiment can also need to determine that the time interval between the latest end position of the at least one DCI and the first start position is greater than the time threshold; wherein, the first start position is the earliest one of the start position of the at least one PUSCH group and the start position of the at least one PUCCH.

[0313] It should be noted that the latest end position of the at least one DCI can be understood as the end position of the last DCI in the at least one DCI. The start position of the at least one PUSCH group can be understood as the start position of the first PUSCH in the at least one PUSCH group. The start position of the at least one PUCCH can be understood as the start position of the first PUCCH in the at least one PUCCH.

[0314] In addition, the time threshold can be network configuration, network indication, predefinition, preconfiguration, standard protocol provision, or default, which is not specifically limited.

[0315] In this way, by the time interval between the latest ending position of the at least one DCI and the first starting position being greater than the time threshold, it is ensured that the terminal device has a certain time interval to process the last DCI in the at least one DCI and the first PUCCH in the at least one PUCCH or the first PUSCH in the at least one PUSCH group.

[0316] For example, taking one PUCCH as an example, as shown in FIG. 20. In FIG. 20, DCI 1 on time unit n schedules the time domain positions of multiple PUSCHs of PUSCH repetition transmission, and the multiple PUSCHs include PUSCHs on time units n+2 to n+9. DCI 2 on time unit n+1 schedules the time domain position of a PUCCH, and the PUCCH is on time unit n+3. Among them, PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. Since DCI 2 is after DCI 1, and the starting position of the first PUSCH (i.e., the PUSCH on time unit n+2) scheduled by DCI 1 is before the starting position of the PUCCH scheduled by DCI 2, in order to ensure that the terminal device can have a certain time interval to process the first PUSCH scheduled by DCI 1, the time interval between the ending position of DCI 2 and the starting position of the first PUSCH scheduled by DCI 1 is greater than the time threshold.

[0317] For example, taking one PUCCH as an example, as shown in FIG. 21. In FIG. 21, DCI 1 on time unit n schedules the time domain positions of multiple PUSCHs of PUSCH repetition transmission, and the multiple PUSCHs include PUSCHs on time units n+2 to n+9. DCI 2 on time unit n schedules the time domain position of PUCCH 1, and PUCCH 1 is on time unit n+3. DCI 3 on time unit n+1 schedules the time domain position of PUCCH 2, and PUCCH 2 is on time unit n+2. Among them, PUSCH group 0 includes PUSCHs on time units n+2 to n+5, and PUSCH group 1 includes PUSCHs on time units n+6 to n+9. Since the ending position of DCI 3 is last, and the starting position of PUCCH 2 scheduled by DCI 3 is earliest, in order to ensure that the terminal device can have a certain time interval to process the PUCCH scheduled by DCI 3, the time interval between the ending position of DCI 3 and the starting position of PUCCH 2 scheduled by DCI 3 is greater than the time threshold.

[0318] The following specifically describes an example in which one or more PUSCHs in a certain PUSCH group are discarded.

[0319] It should be noted that for some of the at least one PUSCH group, a part of PUSCHs in the some of the PUSCH group can be discarded.

[0320] For example, due to the resources of a part of PUSCHs in some of the PUSCH group overlapping with the resources of other uplink channels, downlink channels or downlink symbols other than all PUSCHs in the at least one PUSCH group, the part of PUSCHs are discarded.

[0321] For another example, the resources of a part of PUSCHs in a certain PUSCH group in the at least one PUSCH group overlap with the resources of PUCCH in PUCCH repetition transmission, the part of PUSCHs are discarded.

[0322] For another example, taking the PUSCH repetition transmission as an LP PUSCH repetition transmission for example, the PUSCH in the at least one PUSCH group is an LP PUSCH. When the resources of a part of LP PUSCHs in a certain PUSCH group overlap with the resources of HP PUCCH, the part of LP PUSCHs are discarded.

[0323] For another example, taking the PUSCH repetition transmission as a CG-PUSCH repetition transmission for example, the PUSCH in the at least one PUSCH group is a CG-PUSCH. When the resources of a part of CG-PUSCHs in a certain PUSCH group overlap with the resources of dynamically scheduled PUSCH, the part of CG-PUSCHs are discarded.

[0324] However, since the PUSCH group in the embodiment uses OCC sequences, when only a part of PUSCHs in a certain PUSCH group are discarded, this can cause the orthogonality of the remaining PUSCHs in the PUSCH group not to be guaranteed, and cause the orthogonality of other PUSCHs in the same time-frequency domain resources as the PUSCH with the remaining PUSCHs in the PUSCH group not to be guaranteed.

[0325] For example, in FIG. 7, if the PUSCH on the time unit n is discarded, this can cause the orthogonality of the remaining PUSCHs in PUSCH group 0 not to be guaranteed, and cause the orthogonality of other PUSCHs in the same time-frequency domain resources as the PUSCH in PUSCH group 0 with the remaining PUSCHs in PUSCH group 0 not to be guaranteed.

[0326] Based on this, if the target PUSCH in the at least one PUSCH group is discarded, and the target PUSCH is one or more PUSCHs, the network device or the terminal device of the embodiment can also need to discard all PUSCHs in the PUSCH group in which the target PUSCH is located.

[0327] In this way, by discarding all PUSCHs in the PUSCH group in which the target PUSCH is located, it is beneficial to avoid affecting orthogonality due to discarding only the target PUSCH.

[0328] For example, in FIG. 7, if the PUSCH at time unit n and the PUSCH at time unit n+5 are discarded, all PUSCHs in the PUSCH group 0 and all PUSCHs in the PUSCH group 1 are discarded.

[0329] In some possible examples, the resource of the target PUSCH overlaps with the resource of the first uplink channel, and the first uplink channel is an uplink channel other than all PUSCHs in the at least one PUSCH group.

[0330] For example, the first uplink channel is one or more PUCCHs in PUCCH repetition transmission.

[0331] For another example, the PUSCH in the at least one PUSCH group is an LP PUSCH, the target PUSCH is one or more LP PUSCHs, and the first uplink channel is one or more HP PUCCHs.

[0332] For another example, the PUSCH in the at least one PUSCH group is a CG-PUSCH, the target PUSCH is one or more CG-PUSCHs, and the first uplink channel is one or more dynamically scheduled PUSCHs.

[0333] In some possible examples, the network device can schedule the PUSCH in the at least one PUSCH group through DCI. In addition, the network device can schedule the first uplink channel through DCI. The DCI scheduling the PUSCH can be different from or the same as the DCI scheduling the first uplink channel. Therefore, the network device can schedule the PUSCH in the at least one PUSCH group and / or the first uplink channel through at least one DCI.

[0334] After the network device schedules the PUSCH in the at least one PUSCH group and / or the first uplink channel through at least one DCI, since the terminal device needs to transmit the PUSCH in the at least one PUSCH group and / or the first uplink channel, a certain time interval is needed from receiving the at least one DCI to transmitting the PUSCH in the at least one PUSCH group and / or the first uplink channel to ensure that the terminal device completes relevant processing.

[0335] Based on this, if the PUSCH in the at least one PUSCH group and / or the first uplink channel is scheduled by at least one DCI, the network device or the terminal device of the embodiment can also need to determine that the time interval between the latest end position of the at least one DCI and the target start position is greater than the time threshold; wherein the target start position is the earliest one of the start position of the at least one PUSCH group and the start position of the first uplink channel.

[0336] It should be noted that the latest end position of the at least one DCI can be understood as the end position of the last DCI in the at least one DCI. The start position of the at least one PUSCH group can be understood as the start position of the first PUSCH in the at least one PUSCH group.

[0337] In addition, the time threshold can be network configuration, network indication, predefinition, pre-configuration, standard protocol provision, or default, and no specific limitation is made thereto.

[0338] In this way, by the time interval between the latest end position of the at least one DCI and the target start position being greater than the time threshold, the terminal device is ensured to have a certain time interval to process the last DCI in the at least one DCI and the first PUSCH in the at least one PUSCH group or the first uplink channel.

[0339] The following specifically describes an example of determining the first OCC sequence.

[0340] It should be noted that the network device or the terminal device of the embodiment needs to determine the first OCC sequence in order to group the plurality of PUSCHs of the PUSCH repetition transmission according to the first OCC sequence.

[0341] For determining the first OCC sequence, the embodiment can adopt the following manner:

[0342]

Manner a

[0343] In "manner a", the embodiment introduces the demodulation reference signal (DMRS) port index and OCC sequence length adopted by the plurality of PUSCHs of the PUSCH repetition transmission (i.e. the PUSCH in the at least one PUSCH group).

[0344] It should be noted that the DMRS port index and OCC sequence length adopted by the plurality of PUSCHs of the PUSCH repetition transmission can be network configuration, network indication, predefinition, pre-configuration, standard protocol provision, or default, and no specific limitation is made thereto.

[0345] For example, taking network configuration or network indication as an example, the network device indicates the DMRS port index adopted by the multiple PUSCHs of the PUSCH repetition transmission through high layer signaling (such as high layer parameter antennaPort) or DCI (such as Antenna ports field in DCI), which can be 2 bits or 4 bits, etc. In Table 1, taking 2 bits as an example, if the 2 bits are 00, it indicates that the DMRS port index is 0, and the DMRS port adopted by the multiple PUSCHs of the PUSCH repetition transmission is 1000.

[0346] Table 1

[0347] Based on this, taking the DMRS port index adopted by the multiple PUSCHs of the PUSCH repetition transmission as the first DMRS port index, the network device or the terminal device of the embodiment can determine the first OCC sequence according to the first DMRS port index and the OCC sequence length.

[0348] In this way, the first OCC sequence is determined according to the DMRS port index adopted by the multiple PUSCHs of the PUSCH repetition transmission and the OCC sequence length.

[0349] For determining the first OCC sequence according to the first DMRS port index and the OCC sequence length, one possible implementation is:

[0350] The first OCC sequence satisfies the following formula: G = K mod N.

[0351] Wherein, G represents the index of the first OCC sequence, K represents the first DMRS port index, N represents the OCC sequence length, and mod represents the modulo operation.

[0352] In this way, the index of the first OCC sequence is the remainder of the first antenna port index divided by the OCC sequence length, so as to determine the first OCC sequence by the modulo operation according to the first DMRS port index and the OCC sequence length.

[0353] It should be noted that since the index of the OCC sequence corresponds to the OCC sequence, the first OCC sequence can be determined through the index of the first OCC sequence.

[0354]

Method b

[0355] In "Method b", the embodiment introduces the antenna port index and the OCC sequence length adopted by the multiple PUSCHs (i.e. the PUSCHs in the at least one PUSCH group) of the PUSCH repetition transmission.

[0356] It should be noted that the antenna port index and the OCC sequence length used by the plurality of PUSCHs of the PUSCH repetition transmission can be network configured, network indicated, predefined, preconfigured, specified by a standard protocol, or default, and no specific limitation is made.

[0357] For example, taking network configuration or network indication as an example, the network device indicates the antenna port index used by the plurality of PUSCHs of the PUSCH repetition transmission through high layer signaling (such as high layer parameter antennaPort) or DCI (such as the antenna port field in the DCI), which can be 2 bits or 4 bits, etc.

[0358] Based on this, taking the antenna port index used by the plurality of PUSCHs of the PUSCH repetition transmission as a first antenna port index, the network device or the terminal device of the embodiment can determine a first OCC sequence according to the first antenna port index and the OCC sequence length.

[0359] In this way, the first OCC sequence is determined according to the antenna port index used by the plurality of PUSCHs of the PUSCH repetition transmission and the OCC sequence length.

[0360] For determining the first OCC sequence according to the first antenna port index and the OCC sequence length, one possible implementation is:

[0361] The first OCC sequence satisfies the following formula: G = H mod N.

[0362] Wherein, G represents the index of the first OCC sequence, H represents the first antenna port index, N represents the OCC sequence length, and mod represents the modulo operation.

[0363] In this way, the index of the first OCC sequence is the remainder of the first antenna port index divided by the OCC sequence length, so that the first OCC sequence is determined by the modulo operation according to the first antenna port index and the OCC sequence length.

[0364]

Method c

[0365] In the "Method c", the embodiment can network configure or network indicate the first OCC sequence. For example, taking determining the first OCC sequence according to the indication information as an example, the network device sends the indication information, and the indication information indicates the first OCC sequence, or the index of the first OCC sequence, or the row index or column index of the OCC matrix; correspondingly, the terminal device receives the indication information. In this way, the first OCC sequence is network configured or network indicated according to the indication information. Wherein, the indication information can be carried by system information, RRC signaling, MAC signaling or DCI, etc.

[0366] The following describes an example of transmitting a phase-tracking reference signal (PT-RS) in a time unit occupied by the at least one PUSCH group.

[0367] It should be noted that the PT-RS can be used to correct interference caused by a crystal oscillator phase error at the transmitting end and the receiving end, and to suppress phase noise and common phase errors in the frequency domain, especially high-frequency millimeter waves.

[0368] When the PUSCH in the at least one PUSCH group uses a Discrete Fourier Transform-Spread-Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) waveform, the PT-RS needs to be inserted into the data of the PUSCH before the DFT operation. Thus, the terminal device of the present embodiment needs to transmit at least one PT-RS in the time unit occupied by the at least one PUSCH group.

[0369] For example, when each PUSCH in a certain PUSCH group in the at least one PUSCH group occupies a time slot in turn, the terminal device can transmit a PT-RS in each time slot occupied by the PUSCH group.

[0370] Based on this, in order to ensure the orthogonality of the PUSCH in a certain PUSCH group in the at least one PUSCH group, the present embodiment needs to ensure that the data of the PUSCH in the PUSCH group is completely the same, and that the PT-RS transmitted in the time unit occupied by the PUSCH group is also the same. Thus, the generation sequence of the PT-RS transmitted in the time unit occupied by the PUSCH group needs to be the same.

[0371] Taking the first PUSCH group in the at least one PUSCH group as an example, the terminal device of the present embodiment can also need to transmit at least one PT-RS in the time unit occupied by the first PUSCH, each of the at least one PT-RS being the same; correspondingly, the network device receives the at least one PT-RS.

[0372] Thus, the PT-RS is used to correct or suppress phase errors, and the generation sequence of the PT-RS is the same, which ensures that the data of the PUSCH in the first PUSCH group is completely the same, and ensures the orthogonality of the OCC.

[0373] In some possible examples, the scrambling initial sequence corresponding to each PT-RS in the at least one PT-RS is determined according to a time unit occupied by a first PUSCH in the first PUSCH group.

[0374] For example, taking a time unit occupied by a first PUSCH in the first PUSCH group as a time slot, the scrambling initial sequence corresponding to each PT-RS in the at least one PT-RS satisfies the following formula:

[0375] wherein c init denotes the scrambling initial sequence corresponding to the PT-RS, denotes a number of symbols in the time slot, denotes an index of a time slot occupied by the first PUSCH in the first PUSCH group, and l denotes a smallest symbol index in the time slot occupied by the PUSCH, and N ID denotes a cell identifier.

[0376] The following specifically describes an example in which PUSCHs in the at least one PUSCH group are scheduled by DCI, and the DCI further triggers A-CSI reporting.

[0377] It should be noted that the network device can schedule the PUSCHs in the at least one PUSCH group by the DCI, that is, the PUSCHs in the at least one PUSCH group are dynamically scheduled PUSCHs. That is, the DCI schedules a plurality of PUSCHs for PUSCH repetition transmission. In addition, the DCI can further trigger A-CSI reporting of the PUCCH, for example, trigger the A-CSI reporting by a CSI request field (CSI request field) in the DCI.

[0378] Therefore, when the A-CSI triggered by the DCI is only multiplexed on a first PUSCH in a plurality of PUSCHs for PUSCH repetition transmission scheduled by the DCI, this can cause the orthogonality of the first PUSCH and other PUSCHs in a PUSCH group in which the first PUSCH is located to be not guaranteed, and cause the orthogonality of other PUSCHs in a same time-frequency domain resource as the first PUSCH and the first PUSCH to be not guaranteed.

[0379] For example, in FIG. 7, it is assumed that the DCI schedules multiple PUSCHs of PUSCH repetition transmission of the terminal device, and the multiple PUSCHs are divided into PUSCH group 0 and PUSCH group 1 according to an OCC sequence. In addition, the DCI also triggers A-CSI reporting. At this time, if the A-CSI is only multiplexed on the first PUSCH (i.e., the first PUSCH in PUSCH group 0) scheduled by the DCI, and is not multiplexed on the PUSCHs in other time slots, this will cause the orthogonality of the first PUSCH in PUSCH group 0 and other PUSCHs in PUSCH group 0 to be not guaranteed.

[0380] Based on this, in order to avoid the influence of A-CSI multiplexed on the first PUSCH on the orthogonality, the following takes that the first DCI schedules the PUSCHs in the at least one PUSCH group, and the first DCI also triggers A-CSI reporting as an example for illustration.

[0381] In some possible examples, if the PUSCHs in the at least one PUSCH group are scheduled by the first DCI, the terminal device or the network device of the embodiment can also determine that the A-CSI triggered by the first DCI is multiplexed on all PUSCHs in the first PUSCH group in the at least one PUSCH group.

[0382] In this way, by multiplexing the A-CSI triggered by the first DCI on all PUSCHs in the first PUSCH group scheduled by the first DCI, not only the transmission of the A-CSI and all PUSCHs in the first PUSCH group is guaranteed, but also the orthogonality of the PUSCHs in the first PUSCH group is guaranteed.

[0383] In some possible examples, if the PUSCHs in the at least one PUSCH group are scheduled by the first DCI, the terminal device or the network device of the embodiment can also determine that the A-CSI triggered by the first DCI is multiplexed on all PUSCHs in the at least one PUSCH group.

[0384] In this way, by multiplexing the A-CSI triggered by the first DCI on all PUSCHs scheduled by the first DCI, not only the transmission of the A-CSI and all PUSCHs is guaranteed, but also the orthogonality of all PUSCHs is guaranteed.

[0385] The following specifically describes an example of determining the redundancy version (RV) of the PUSCHs in the at least one PUSCH group.

[0386] In some possible examples, for the PUSCH in the at least one PUSCH, the terminal device or the network device of this embodiment also needs to determine a first RV sequence, and determine that the RV of the PUSCH in the at least one PUSCH is one RV in the first RV sequence, and the RVs of all PUSCHs in the same PUSCH group are the same.

[0387] It can be seen that for the PUSCH in the at least one PUSCH, the RVs of all PUSCHs in the same PUSCH group are the same.

[0388] It should be noted that the first RV sequence is one RV sequence. Wherein, the RV sequence can represent a sequence composed of a plurality of RVs. The length of the RV sequence can represent the number of RVs in the RV sequence. Each RV in the RV sequence has its own index.

[0389] For example, taking the length of the RV sequence as 4 as an example, the RV sequence = {rv(0), rv(1), rv(2), rv(3)}. Wherein, rv(0) represents an RV with an index of 0, rv(1) represents an RV with an index of 1, rv(2) represents an RV with an index of 2, and rv(3) represents an RV with an index of 3.

[0390] For determining the first RV sequence, this embodiment can determine the first RV sequence in the manner of network configuration, network indication, predefinition, preconfiguration, standard protocol stipulation, default, etc.

[0391] Taking network configuration as an example, the network device sends RV sequence indication information, and the RV sequence indication information indicates the first RV sequence; correspondingly, the terminal device receives the RV sequence indication information. In this way, the first RV sequence is realized by network configuration through the RV sequence indication information.

[0392] For the RV sequence indication information, one possible implementation is that for the dynamically scheduled PUSCH, the RV sequence indication information is the redundancy version indication information in the DCI. The redundancy version indication information is a numerical value (represented by rv id ). In this way, the first RV sequence can be indicated according to the numerical value.

[0393] For example, as shown in Table 2, in Table 2, if rv id = 0, the first RV sequence = {0, 2, 3, 1}; if rv id = 2, the first RV sequence = {2, 3, 1, 0}; if rv id = 3, the first RV sequence = {3, 1, 0, 2}; if rv id = 3, the first RV sequence = {3, 1, 0, 2}; if rv id= 1, the first RV sequence = {1, 0, 2, 3}.

[0394] Table 2

[0395] For the RV sequence indication information, one possible implementation is that for CG-PUSCH, the RV sequence indication information is repetition K redundancy version (repK-RV) information in RRC signaling. K represents the number of PUSCH repetition transmission, and the repetition K redundancy version information can indicate the first RV sequence.

[0396] For example, the repetition K redundancy version information indicates that the first RV sequence is {0, 2, 3, 1}, {0, 3, 0, 3} or {0, 0, 0, 0}.

[0397] For determining the RV of the PUSCH in the at least one PUSCH as one of the first RV sequence, one possible implementation is that the PUSCH groups in the at least one PUSCH group take one RV from the first RV sequence in turn from the first RV in the first RV sequence in the order from the first PUSCH group to the last PUSCH group; if a PUSCH group takes the last RV in the first RV sequence, it is determined that the next PUSCH group takes the first RV in the first RV sequence, and so on until the last PUSCH group takes one RV.

[0398] For example, as shown in FIG. 22, the network configures the time domain positions of multiple PUSCHs of PUSCH repetition transmission of the terminal device, and the multiple PUSCHs include PUSCHs on time unit n to time unit n+7. Among them, the first PUSCH (i.e., the PUSCH on time unit n) is denoted as PUSCH#1, the second PUSCH (i.e., the PUSCH on time unit n+1) is denoted as PUSCH#2, the third PUSCH (i.e., the PUSCH on time unit n+2) is denoted as PUSCH#3, and so on.

[0399] PUSCH#1, PUSCH#2, PUSCH#3 and PUSCH#4 are in PUSCH group 0, and PUSCH#5, PUSCH#6, PUSCH#7 and PUSCH#8 are in PUSCH group 1.

[0400] If the first RV sequence is {0, 2, 3, 1}, since the PUSCH group 0 is before the PUSCH group 1, the PUSCH group 0 takes the first RV in the first RV sequence (i.e. 0), so the RV of all PUSCHs in the PUSCH group 0 is 0, i.e. the RV of PUSCH#1 is 0, the RV of PUSCH#2 is 0, the RV of PUSCH#3 is 0, and the RV of PUSCH#4 is 0. Then, the PUSCH group takes the second RV in the first RV sequence (i.e. 2), so the RV of all PUSCHs in the PUSCH group 0 is 2, i.e. the RV of PUSCH#5 is 2, the RV of PUSCH#6 is 2, the RV of PUSCH#7 is 2, and the RV of PUSCH#8 is 2.

[0401] If the first RV sequence is {0, 3, 0, 3}, the PUSCH group 0 takes the first RV in the first RV sequence (i.e. 0), i.e. the RV of PUSCH#1, PUSCH#2, PUSCH#3 and PUSCH#4 is 0. Then, the PUSCH group 1 takes the second RV in the first RV sequence (i.e. 3), i.e. the RV of PUSCH#5, PUSCH#6, PUSCH#7 and PUSCH#8 is 3.

[0402] For determining the RV of a PUSCH in the at least one PUSCH as one in the first RV sequence, one possible implementation is:

[0403] determining the RV of the PUSCH n in the at least one PUSCH group as the RV i in the first RV sequence, i = ((n – (n mod L)) / L) mod M;

[0404] wherein n represents the index of the PUSCH in the at least one PUSCH group, i represents the index of the RV in the first RV sequence, mod represents modulo, L represents the length of the first OCC sequence, and M represents the length of the first RV sequence.

[0405] It should be noted that the value of n starts from 0, and the value of i starts from 0.

[0406] For example, as shown in FIG. 23, the network configures the time domain positions of a plurality of PUSCHs for PUSCH repetition transmission of a terminal device, and the plurality of PUSCHs include PUSCHs on time units n to n+7. Wherein the first PUSCH (i.e. the PUSCH on time unit n) is denoted as PUSCH#0, the second PUSCH (i.e. the PUSCH on time unit n+1) is denoted as PUSCH#1, the third PUSCH (i.e. the PUSCH on time unit n+2) is denoted as PUSCH#2, and so on.

[0407] PUSCH#0 can represent PUSCH with index 0 (n=0), PUSCH#1 can represent PUSCH with index 1 (n=1), PUSCH#2 can represent PUSCH with index 2 (n=2), and so on.

[0408] According to the first OCC sequence (the length of the first OCC sequence is 4, i.e. L=4), grouping is performed, and PUSCH#0, PUSCH#1, PUSCH#2 and PUSCH#3 are in PUSCH group 0, and PUSCH#4, PUSCH#5, PUSCH#6 and PUSCH#7 are in PUSCH group 1.

[0409] In Table 3, if rv id =0, the first RV sequence = {0, 2, 3, 1}. The length of the first RV sequence is 4, i.e. M=4. In this way, according to the formula i=((n-(n mod L)) / L)mod M, if n∈{0, 1, 2, 3}, ((n-(n mod 4)) / 4)mod 4=0 is satisfied, and the RVs of PUSCH#0, PUSCH#1, PUSCH#2 and PUSCH#3 are all 0; if n∈{4, 5, 6, 7}, ((n-(n mod 4)) / 4)mod 4=1 is satisfied, and the RVs of PUSCH#4, PUSCH#5, PUSCH#6 and PUSCH#7 are all 2.

[0410] Table 3

[0411] For determining the RV of the PUSCH in the at least one PUSCH as one of the first RV sequence, one possible implementation is:

[0412] determining the RV of the PUSCH n in the at least one PUSCH group as the RV i in the first RV sequence, i=(mod(((n-mod(n,L)) / L)-1,M)+1);

[0413] wherein n represents the index of the PUSCH in the at least one PUSCH group, i represents the index of the RV in the first RV sequence, mod represents modulo, L represents the length of the first OCC sequence, and M represents the length of the first RV sequence.

[0414] It should be noted that the value of n starts from 1, and the value of i starts from 0.

[0415] For example, in FIG. 22, PUSCH#1 can represent a PUSCH with index 1 (n = 1), PUSCH#2 can represent a PUSCH with index 2 (n = 2), PUSCH#3 can represent a PUSCH with index 3 (n = 3), and so on.

[0416] According to the first OCC sequence (the length of the first OCC sequence is 4, i.e., L = 4), grouping is performed, and PUSCH#1, PUSCH#2, PUSCH#3, and PUSCH#4 are in PUSCH group 0, and PUSCH#5, PUSCH#6, PUSCH#7, and PUSCH#8 are in PUSCH group 1.

[0417] For the first RV sequence = {0, 2, 3, 1}, according to the formula i = (mod(((n-mod(n, L)) / L)-1, M)+1), if n ∈ {1, 2, 3, 4}, it satisfies (mod(((n-mod(n, 4)) / 4)-1, 4)+1) = 0, at this time, the RVs of PUSCH#1, PUSCH#2, PUSCH#3, and PUSCH#4 are all 0; if n ∈ {5, 6, 7, 8}, it satisfies (mod(((n-mod(n, 4)) / 4)-1, 4)+1) = 1, at this time, the RVs of PUSCH#5, PUSCH#6, PUSCH#7, and PUSCH#8 are all 2.

[0418] For determining the RV of a PUSCH in the at least one PUSCH as one in the first RV sequence, one possible implementation is:

[0419] determining the RV of a PUSCH n in the at least one PUSCH group as an RV j in the first RV sequence, j = ((n-(n mod(L*N)) / (L*N))mod M;

[0420] wherein n represents the index of the PUSCH in the at least one PUSCH group, j represents the index of the RV in the first RV sequence, mod represents modulo, L represents the length of the first OCC sequence, N represents the number of slots spanned by the TB transmission of a PUSCH in a transmission block over multiple slots (TBoMS) transmission, and M represents the length of the first RV sequence.

[0421] It should be noted that the value of n herein starts from 0, the value of j herein starts from 0, and the value of N herein starts from 1. For example, when the value of N is 1, similar to the above-described FIG. 23, details are not repeated here.

[0422] For determining the RV of a PUSCH in the at least one PUSCH to be one RV in the first RV sequence, one possible implementation is:

[0423] determining the RV of a PUSCH n in the at least one PUSCH group to be RV j in the first RV sequence, j = (mod(((n-mod(n, (L*N))) / (L*N))-1, M)+1);

[0424] wherein n represents an index of a PUSCH in the at least one PUSCH group, j represents an index of an RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, N represents a number of slots that a TB transmission of a PUSCH spans in a TBoMS transmission, and M represents a length of the first RV sequence.

[0425] It is to be noted that the value of n starts from 0, the value of j starts from 0, and the value of N starts from 1. For example, when the value of N is 1, similar to the above Fig. 22, no further description is provided.

[0426] For determining the RV of a PUSCH in the at least one PUSCH to be one RV in the first RV sequence, one possible implementation is:

[0427] determining the RV of all PUSCHs in a PUSCH group k in the at least one PUSCH group to be RV z in the first RV sequence, z = ((k-(k mod N)) / N) mod M;

[0428] wherein k represents an index of a PUSCH group in the at least one PUSCH group, z represents an index of an RV in the first RV sequence, N represents a number of slots that a TB transmission of a PUSCH spans in a TBoMS transmission, and M represents a length of the first RV sequence.

[0429] It is to be noted that the value of k starts from 0, for example, in Fig. 22, the PUSCH group 0 represents the PUSCH group with index 0 (k = 0), and the PUSCH group 1 represents the PUSCH group with index 1 (k = 1). The value of z starts from 0, and the value of N starts from 1. For example, when the value of N is 1, similar to the above Fig. 22, no further description is provided.

[0430] A communication device of the embodiment is described below as an example.

[0431] The above describes the scheme of the embodiments of the present application mainly from the method aspect. The functional units of a communication device of the embodiments are described below. It can be understood that the terminal device comprises hardware structure and / or software modules corresponding to each function to implement the above functions. Those skilled in the art should easily realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is implemented in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the embodiments.

[0432] The embodiments of the present application can divide the functional units of the terminal device according to the above method examples. For example, each functional unit can be divided according to each function, or two or more functions can be integrated in one processing unit. The integrated unit can be implemented in the form of hardware or software program modules. It should be noted that the division of units in the embodiments of the present application is illustrative, which is only a logical function division, and another division method can be used in actual implementation.

[0433] In the case of integrated units, FIG. 24 is a functional unit composition block diagram of a communication device according to an embodiment of the present application. The communication device 2400 comprises a determination unit 2401.

[0434] Optionally, the determination unit 2401 can be a module unit for determining signals, information, etc., which is not limited in particular.

[0435] Optionally, the communication device 2400 can further comprise a sending unit. The sending unit can be a module unit for sending signals, information, etc., which is not limited in particular.

[0436] Optionally, the communication device 2400 can further comprise a receiving unit. The receiving unit can be a module unit for receiving signals, information, etc., which is not limited in particular.

[0437] Optionally, the communication device 2400 can further comprise a storage unit for storing computer program codes or instructions executed by the communication device 2400. The storage unit can be a memory.

[0438] Optionally, the communication device 2400 can be a chip or a chip module.

[0439] Optionally, the determining unit 2401 can be integrated in a communication unit. The communication unit can be a communication interface, a transceiver, a transceiver circuit, etc. The communication unit can include a sending unit and / or a receiving unit.

[0440] Optionally, the determining unit 2401 can be integrated in a processing unit.

[0441] It should be noted that the processing unit can be a processor or a controller, for example, a baseband processor, a baseband chip, a central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logical blocks, modules and circuits described in combination with the disclosed embodiments. The processing unit can also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0442] Optionally, the communication apparatus 2400 is configured to perform any of the steps of the above method embodiments performed by a terminal device, a chip, a chip module, or a network device, etc.

[0443] In specific implementation, the determining unit 2401 and the unit for performing any of the steps in the above method embodiments, and when performing actions such as sending, can optionally call other units to complete the corresponding operations. The following will be described in detail.

[0444] The determining unit 2401 is configured to group a plurality of PUSCHs of the PUSCH repetition transmission according to a first OCC sequence, and determine at least one PUSCH group, each PUSCH group in the at least one PUSCH group using the first OCC sequence.

[0445] It can be seen that by grouping a plurality of PUSCHs of the PUSCH repetition transmission according to the OCC sequence, it is ensured that each PUSCH group uses the same OCC sequence, and the OCC is used for the PUSCH repetition transmission, thereby facilitating to improve the system capacity and / or spectrum utilization efficiency of the PUSCH repetition transmission.

[0446] In some possible examples, the determining unit 2401 is further configured to:

[0447] determining at least one PUCCH, a resource of a PUCCH in the at least one PUCCH overlapping with a resource of a PUSCH in the at least one PUSCH;

[0448] determining a multiplexing status of UCI of the at least one PUCCH with a PUSCH in the at least one PUSCH group.

[0449] In some possible examples, in determining the multiplexing status of UCI of the at least one PUCCH with a PUSCH in the at least one PUSCH group, the determining unit 2401 is configured to:

[0450] if a resource of the first PUCCH overlaps with a resource of the first PUSCH or a resource of another PUSCH other than the first PUSCH in the first PUSCH group, determining that the first UCI is multiplexed on all PUSCHs in the first PUSCH group;

[0451] wherein the first PUCCH is one or more PUCCHs in the at least one PUCCH, and the first PUSCH group is one PUSCH group in the at least one PUSCH group;

[0452] the first UCI is UCI of the first PUCCH, or the first UCI is UCI after UCI multiplexing of UCI of the first PUCCH and UCI of the second PUCCH;

[0453] the second PUCCH is one or more PUCCHs in the at least one PUCCH other than the first PUCCH.

[0454] In some possible examples, a resource of the second PUCCH overlaps with a resource of the first PUSCH in the first PUSCH group; or,

[0455] a resource of the second PUCCH overlaps with a resource of another PUSCH other than the first PUSCH in the first PUSCH group.

[0456] In some possible examples, in determining the multiplexing status of UCI of the at least one PUCCH with a PUSCH in the at least one PUSCH group, the determining unit 2401 is configured to:

[0457] if a resource of the first PUCCH overlaps with a resource of another PUSCH other than the first PUSCH in the first PUSCH group, determining that UCI of the first PUCCH is discarded;

[0458] wherein the first PUCCH is one or more PUCCHs in the at least one PUCCH, and the first PUSCH group is one PUSCH group in the at least one PUSCH group.

[0459] In some possible examples, in determining the multiplexing status of UCI of the at least one PUCCH and PUSCHs in the at least one PUSCH group, the determining unit 2401 is configured to:

[0460] if the resource of the first PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH, determine that the second UCI is multiplexed on all PUSCHs in the second PUSCH group;

[0461] wherein the first PUCCH is one or more PUCCHs in the at least one PUCCH, the first PUSCH group is one PUSCH group in the at least one PUSCH group, and the second PUSCH group is one adjacent PUSCH group after the first PUSCH group in the at least one PUSCH group;

[0462] the second UCI is the UCI of the first PUCCH, or the second UCI is the UCI after the UCI of the first PUCCH and the UCI of the third PUCCH are multiplexed;

[0463] the third PUCCH is one or more PUCCHs in the at least one PUCCH except the first PUCCH.

[0464] In some possible examples, the resource of the third PUCCH overlaps with the resource of the other PUSCHs in the first PUSCH group except the first PUSCH; or,

[0465] the resource of the third PUCCH overlaps with the resource of the first PUSCH in the second PUSCH group; or,

[0466] the resource of the third PUCCH overlaps with the resource of the other PUSCHs in the second PUSCH group except the first PUSCH.

[0467] In some possible examples, if the at least one PUCCH and / or the PUSCHs in the at least one PUSCH group are scheduled by at least one downlink control information (DCI), a time interval between a latest ending position of the at least one DCI and a first starting position is greater than a time threshold;

[0468] wherein the first starting position is the earliest one of a starting position of the at least one PUSCH group and a starting position of the at least one PUCCH.

[0469] In some possible examples, the determining unit 2401 is further configured to:

[0470] If the target PUSCH in the at least one PUSCH group is dropped, and the target PUSCH is one or more PUSCHs, all PUSCHs in the PUSCH group in which the target PUSCH is located are dropped.

[0471] In some possible examples, the resource of the target PUSCH overlaps with the resource of the first uplink channel, and the first uplink channel is an uplink channel other than all PUSCHs of the at least one PUSCH group.

[0472] In some possible examples, the determining unit 2401 is further configured to:

[0473] If the PUSCH in the at least one PUSCH group and / or the first uplink channel is scheduled by the at least one DCI, it is determined that a time interval between a latest end position of the at least one DCI and the target start position is greater than a time threshold.

[0474] The target start position is the earliest one of a start position of the at least one PUSCH group and a start position of the first uplink channel.

[0475] In some possible examples, the determining unit 2401 is further configured to:

[0476] determine the first OCC sequence.

[0477] In some possible examples, in the determination of the first OCC sequence, the determining unit 2401 is configured to:

[0478] determine the first OCC sequence according to the first DMRS port index and the OCC sequence length, the first DMRS port index being a DMRS port index used by the plurality of PUSCHs of the PUSCH repetition transmission.

[0479] In some possible examples, the first OCC sequence is a remainder of the first DMRS port index divided by the OCC sequence length.

[0480] In some possible examples, in the determination of the first OCC sequence, the determining unit 2401 is configured to:

[0481] determine the first OCC sequence according to the first antenna port index and the OCC sequence length, the first antenna port index being an antenna port index used by the plurality of PUSCHs of the PUSCH repetition transmission.

[0482] In some possible examples, an index of the first OCC sequence is a remainder of the first antenna port index divided by the OCC sequence length.

[0483] In some possible examples, in the determination of the first OCC sequence, the determining unit 2401 is configured to:

[0484] The first OCC sequence is determined according to the indication information, and the indication information indicates the first OCC sequence, or an index of the first OCC sequence, or a row index or a column index of an OCC matrix.

[0485] In some possible examples, the communication apparatus 2400 further includes a sending unit;

[0486] The sending unit is configured to send at least one phase tracking reference signal (PT-RS) in a time unit occupied by the first PUSCH group, each of the at least one PT-RS being the same, and the first PUSCH group being one of the at least one PUSCH group.

[0487] In some possible examples, each of the at least one PT-RS corresponds to a scrambling initial sequence determined according to a time unit occupied by a first PUSCH in the first PUSCH group.

[0488] In some possible examples, the determining unit 2401 is further configured to:

[0489] If a PUSCH in the at least one PUSCH group is scheduled by the first DCI, the determining unit 2401 determines that aperiodic CSI triggered by the first DCI is multiplexed on all PUSCHs in a first PUSCH group of the at least one PUSCH group.

[0490] In some possible examples, the determining unit 2401 is further configured to:

[0491] The determining unit 2401 determines a first RV sequence.

[0492] The determining unit 2401 determines that an RV of a PUSCH in the at least one PUSCH group is one of the first RV sequence, and the RVs of all PUSCHs in a same PUSCH group are the same.

[0493] In some possible examples, in the determination that the RV of the PUSCH in the at least one PUSCH group is one of the first RV sequence, the determining unit 2401 is configured to:

[0494] The PUSCHs in the at least one PUSCH group take one RV from the first RV sequence in order from a first RV sequence to a last RV sequence from a first PUSCH group to a last PUSCH group;

[0495] If a PUSCH group takes the last RV in the first RV sequence, the determining unit 2401 determines that a next PUSCH group takes a first RV in the first RV sequence, and this continues until the last PUSCH group takes one RV.

[0496] In some possible examples, in determining the RV of the PUSCH in the at least one PUSCH group as one of the first RV sequence, the determining unit 2401 is configured to:

[0497] determine the RV of the PUSCH n in the at least one PUSCH group as the RV i in the first RV sequence, i = ((n – (n mod L)) / L) mod M, or i = (mod(((n – mod(n, L)) / L) – 1, M) + 1);

[0498] wherein n represents an index of the PUSCH in the at least one PUSCH group, i represents an index of the RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, and M represents a length of the first RV sequence.

[0499] In some possible examples, in determining the RV of the PUSCH in the at least one PUSCH group as one of the first RV sequence, the determining unit 2401 is configured to:

[0500] determine the RV of the PUSCH n in the at least one PUSCH group as the RV j in the first RV sequence, j = ((n – (n mod(L*N))) / (L*N)) mod M, or j = (mod(((n – mod(n, (L*N))) / (L*N)) – 1, M) + 1);

[0501] wherein n represents an index of the PUSCH in the at least one PUSCH group, j represents an index of the RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, N represents a number of slots across which a TB transmission of one PUSCH is transmitted in a TB across multiple slots transmission, and M represents a length of the first RV sequence.

[0502] In some possible examples, in determining the RV of the PUSCH in the at least one PUSCH group as one of the first RV sequence, the determining unit 2401 is configured to:

[0503] determine the RV of all PUSCHs within the k-th PUSCH group in the at least one PUSCH group as the RV z in the first RV sequence, z = ((k – (k mod N)) / N) mod M;

[0504] wherein k represents an index of a PUSCH group in the at least one PUSCH group, z represents an index of the RV in the first RV sequence, N represents a number of slots across which a TB transmission of one PUSCH is transmitted in a TB across multiple slots transmission, and M represents a length of the first RV sequence.

[0505] The structure of a terminal device in this embodiment will be described below.

[0506] Referring to FIG. 25, FIG. 25 is a structural diagram of a terminal device according to an embodiment of the present application. The terminal device 2500 can include a processor 2510, a memory 2520, and a communication bus for connecting the processor 2510 and the memory 2520.

[0507] Optionally, the memory 2520 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a compact disc read-only memory (CD-ROM). The memory 2520 is configured to store program codes executed by the terminal device 2500 and transmitted data.

[0508] Optionally, the terminal device 2500 further includes a communication interface configured to receive and send data.

[0509] Optionally, the terminal device 2500 can be the first terminal device.

[0510] Optionally, the processor 2510 can be one or more CPUs. When the processor 2510 is a CPU, the CPU can be a single-core CPU or a multi-core CPU.

[0511] Optionally, the processor 2510 can be a baseband chip, a chip, a CPU, a general-purpose processor, a DSP, an ASIC, an FPGA, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof.

[0512] In a specific implementation process, the processor 2510 in the terminal device 2500 is configured to execute the computer program or instructions 2521 stored in the memory 2520, and perform the following operations:

[0513] grouping a plurality of PUSCHs of the PUSCH repetition transmission according to a first OCC sequence, determining at least one PUSCH group, and each PUSCH group in the at least one PUSCH group using the first OCC sequence.

[0514] It can be seen that by grouping the multiple PUSCHs of the PUSCH repetition transmission through the OCC sequence, it is ensured that each PUSCH group uses the same OCC sequence, and the OCC is used for the PUSCH repetition transmission, thereby facilitating improvement of the system capacity and / or spectrum utilization efficiency of the PUSCH repetition transmission.

[0515] It should be noted that the specific implementation of each operation can adopt the corresponding description of the method embodiment shown above, and the terminal device 2500 can be used to execute the method embodiment of the present embodiment, and details are not repeated.

[0516] The structure of a network device of the present embodiment will be described below.

[0517] Please refer to FIG. 26, which is a structural schematic diagram of a network device according to an embodiment of the present application. The network device 2600 can include a processor 2610, a memory 2620, and a communication bus for connecting the processor 2610 and the memory 2620.

[0518] Optionally, the memory 2620 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a compact disc read-only memory (CD-ROM). The memory 2620 is used to store the program code executed by the network device 2600 and the transmitted data.

[0519] Optionally, the network device 2600 further includes a communication interface for receiving and sending data.

[0520] Optionally, the network device 2600 can be the first network device described above.

[0521] Optionally, the processor 2610 can be one or more CPUs, and in the case of the processor 2610 being a CPU, the CPU can be a single-core CPU or a multi-core CPU.

[0522] Optionally, the processor 2610 can be a baseband chip, a chip, a CPU, a general-purpose processor, a DSP, an ASIC, an FPGA, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof.

[0523] In a specific implementation, the processor 2610 in the network device 2600 is configured to execute the computer program or instructions 2621 stored in the memory 2620 to perform the following operations:

[0524] grouping the multiple PUSCHs of the PUSCH repetition transmission according to a first OCC sequence, determining at least one PUSCH group, and each PUSCH group in the at least one PUSCH group using the first OCC sequence.

[0525] It can be seen that by grouping the multiple PUSCHs of the PUSCH repetition transmission through the OCC sequence, it is ensured that each PUSCH group uses the same OCC sequence, and the OCC is used for the PUSCH repetition transmission, thereby facilitating improvement of the system capacity and / or spectrum utilization efficiency of the PUSCH repetition transmission.

[0526] It should be noted that the specific implementation of each operation can be implemented by the corresponding description of the method embodiment shown above, and the network device 2600 can be used to execute the method embodiment described above in this embodiment, and details are not repeated.

[0527] Other related content of the present embodiment is exemplarily illustrated below.

[0528] Optionally, the method embodiments described above can be applied to a terminal device or in a terminal device. That is, the execution subject of the method embodiments described above can be a terminal device, a chip, a chip module or a module, and the like, and no specific limitation is made.

[0529] Optionally, the method embodiments described above can be applied to a network device or in a network device. That is, the execution subject of the method embodiments described above can be a network device, a chip, a chip module or a module, and the like, and no specific limitation is made.

[0530] The present embodiment also provides a chip, including a processor, a memory and a computer program or instructions stored in the memory, wherein the processor executes the computer program or instructions to realize the steps described in the above method embodiments.

[0531] The present embodiment also provides a chip module, including a transceiver component and a chip, the chip including a processor, a memory and a computer program or instructions stored in the memory, wherein the processor executes the computer program or instructions to realize the steps described in the above method embodiments.

[0532] The present embodiment also provides a computer readable storage medium, which stores a computer program or instructions, and the computer program or instructions are executed to realize the steps described in the above method embodiments.

[0533] The present embodiment also provides a computer program product, including a computer program or instructions, and the computer program or instructions are executed to realize the steps described in the above method embodiments.

[0534] It should be noted that, for the above-mentioned various embodiments, in order to simply describe, all are expressed as a series of action combinations. Those skilled in the art should know that the present application is not limited to the action sequence described, because some steps in the embodiments of the present application can be performed in other sequences or simultaneously. In addition, those skilled in the art should know that the embodiments described in the specification all belong to preferred embodiments, and the actions, steps, modules or units involved are not necessarily the ones in the embodiments of the present application.

[0535] In the above embodiments, the description of each embodiment of the embodiments of the present application has its own focus, and the parts not described in detail in a certain embodiment can be referred to the relevant description of other embodiments.

[0536] The steps of the method or algorithm described in the embodiments of the present application can be implemented in the form of hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, and the software modules can be stored in RAM, flash memory, ROM, EPROM, electrically EPROM (EEPROM), register, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor, so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in the terminal device or the management device. Of course, the processor and the storage medium can also exist as discrete components in the terminal device or the management device.

[0537] Those skilled in the art should be aware that, in one or more examples described above, the functions described in the embodiments of the present application can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, the computer program instructions generate, in whole or in part, the processes or functions described in the embodiments of the present application. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center through wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) manner. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. integrated with one or more available media sets. The available medium can be a magnetic medium (such as a floppy disk, a hard disk, a magnetic tape), an optical medium (such as a digital video disc (DVD)), or a semiconductor medium (such as a solid state disk (SSD)), etc.

[0538] The various modules or units contained in the various devices, products described in the above embodiments can be software modules or units, hardware modules or units, or part software modules or units and part hardware modules or units. For example, for the various devices, products applied to or integrated into chips, the various modules or units contained therein can all be implemented in the form of hardware such as circuitry, or at least part of the modules or units can be implemented in the form of software program running on a processor integrated in the chip, and the remaining (if any) part of the modules or units can be implemented in the form of hardware such as circuitry; for the various devices, products applied to or integrated into chip modules, the various modules or units contained therein can all be implemented in the form of hardware such as circuitry, and different modules or units can be located in the same component (for example, a chip, a circuit module, etc.) or different components of the chip module, or at least part of the modules or units can be implemented in the form of software program running on a processor integrated in the chip module, and the remaining (if any) part of the modules or units can be implemented in the form of hardware such as circuitry; for the various devices, products applied to or integrated into terminal devices, the various modules or units contained therein can all be implemented in the form of hardware such as circuitry, and different modules or units can be located in the same component (for example, a chip, a circuit module, etc.) or different components of the terminal device, or at least part of the modules or units can be implemented in the form of software program running on a processor integrated in the terminal device, and the remaining (if any) part of the modules or units can be implemented in the form of hardware such as circuitry.

[0539] The above detailed description sets forth the purposes, technical solutions, and beneficial effects of the embodiments of the present application. It should be understood that the above description is merely a specific implementation of the embodiments of the present application and is not intended to limit the protection scope of the embodiments of the present application. Any modification, equivalent replacement, improvement, etc. made on the basis of the technical solutions of the embodiments of the present application shall be included in the protection scope of the embodiments of the present application.

Claims

1. A method of communication, comprising: grouping a plurality of physical uplink shared channel (PUSCH) repetitions of a PUSCH transmission according to a first orthogonal cover code (OCC) sequence, determining at least one group of PUSCHs, each of the at least one group of PUSCHs using the first OCC sequence. 2.The method of claim 1, further comprising: determining at least one physical uplink control channel (PUCCH), a resource of a PUCCH of the at least one PUCCH overlapping a resource of a PUSCH of the at least one PUSCH; determining a multiplexing status of uplink control information (UCI) of the at least one PUCCH and a PUSCH of the at least one group of physical uplink shared channels (PUSCHs).

3. The method of claim 2, wherein, The determining the multiplexing status of the UCI of the at least one PUCCH and the PUSCH of the at least one group of PUSCHs comprises: if a resource of a first PUCCH overlaps a resource of a first PUSCH or a resource of another PUSCH other than the first PUSCH within a first group of PUSCHs, determining that a first UCI is multiplexed on all PUSCHs within the first group of PUSCHs; wherein the first PUCCH is one or more PUCCHs of the at least one PUCCH, and the first group of PUSCHs is one group of PUSCHs of the at least one group of PUSCHs; the first UCI is a UCI of the first PUCCH, or the first UCI is a UCI after a UCI multiplexing of a UCI of the first PUCCH and a UCI of a second PUCCH; the second PUCCH is one or more PUCCHs of the at least one PUCCH other than the first PUCCH.

4. The method of claim 3, wherein, the resource of the second PUCCH overlaps the resource of the first PUSCH within the first group of PUSCHs; or the resource of the second PUCCH overlaps the resource of another PUSCH other than the first PUSCH within the first group of PUSCHs.

5. The method of claim 2, wherein, The determining the multiplexing status of the UCI of the at least one PUCCH and the PUSCH of the at least one group of PUSCHs comprises: if a resource of a first PUCCH overlaps a resource of another PUSCH other than a first PUSCH within a first group of PUSCHs, determining that a UCI of the first PUCCH is dropped; wherein the first PUCCH is one or more PUCCHs of the at least one PUCCH, and the first group of PUSCHs is one group of PUSCHs of the at least one group of PUSCHs.

6. The method of claim 2, wherein, The determining the multiplexing status of the UCI of the at least one PUCCH and the PUSCH of the at least one group of PUSCHs comprises: if a resource of a first PUCCH overlaps a resource of another PUSCH other than a first PUSCH within a first group of PUSCHs, determining that a second UCI is multiplexed on all PUSCHs within a second group of PUSCHs; The first PUCCH is one or more PUCCHs in at least one PUCCH, the first PUSCH group is one PUSCH group in the at least one PUSCH group, and the second PUSCH group is one adjacent PUSCH group after the first PUSCH group in the at least one PUSCH group; The second UCI is UCI of the first PUCCH, or the second UCI is UCI after UCI multiplexing of UCI of the first PUCCH and UCI of a third PUCCH; The third PUCCH is one or more PUCCHs in the at least one PUCCH, except for the first PUCCH.

7. The method of claim 6, wherein, The resource of the third PUCCH overlaps with the resource of a PUSCH other than a first PUSCH in the first PUSCH group; or The resource of the third PUCCH overlaps with the resource of the first PUSCH in the second PUSCH group; or The resource of the third PUCCH overlaps with the resource of a PUSCH other than the first PUSCH in the second PUSCH group.

8. The method according to any one of claims 2-7, wherein, If the PUCCH and / or the PUSCH in the at least one PUSCH group are scheduled by at least one downlink control information (DCI), a time interval between a latest end position of the at least one DCI and a first start position is greater than a time threshold. The first start position is an earliest one of a start position of the at least one PUSCH group and a start position of the at least one PUCCH.

9. The method of claim 1, further comprising: If a target PUSCH in the at least one PUSCH group is discarded, and the target PUSCH is one or more PUSCHs, discarding all PUSCHs in a PUSCH group in which the target PUSCH is located.

10. The method of claim 9, wherein, The resource of the target PUSCH overlaps with the resource of a first uplink channel, and the first uplink channel is an uplink channel other than all PUSCHs in the at least one PUSCH group.

11. The method of claim 10, further comprising: If the PUSCH in the at least one PUSCH group and / or the first uplink channel are scheduled by at least one DCI, determining that a time interval between a latest end position of the at least one DCI and a target start position is greater than a time threshold. The target start position is an earliest one of a start position of the at least one PUSCH group and a start position of the first uplink channel.

12. The method of claim 1, further comprising: Determining the first OCC sequence.

13. The method of claim 12, wherein, The determining the first OCC sequence comprises: Determining the first OCC sequence according to a first demodulation reference signal (DMRS) port index and an OCC sequence length, and the first DMRS port index is a DMRS port index used by multiple PUSCHs in the PUSCH repetition transmission.

14. The method of claim 13, wherein, The first OCC sequence is a remainder of the first DMRS port index divided by the OCC sequence length.

15. The method of claim 12, wherein, The determining the first OCC sequence comprises: The first OCC sequence is determined according to a first antenna port index and an OCC sequence length, the first antenna port index being an antenna port index adopted by a plurality of PUSCHs of the PUSCH repetition transmission.

16. The method of claim 15, wherein, An index of the first OCC sequence is a remainder of the first antenna port index divided by the OCC sequence length.

17. The method of claim 12, wherein, The determining the first OCC sequence comprises: The first OCC sequence is determined according to indication information, the indication information indicating the first OCC sequence, or an index of the first OCC sequence, or a row index or a column index of an OCC matrix.

18. The method of claim 1, further comprising: transmitting at least one phase tracking reference signal (PT-RS) in a time unit occupied by a first PUSCH group, each of the at least one PT-RS being identical, the first PUSCH group being one of the at least one PUSCH group.

19. The method of claim 18, wherein, Each of the at least one PT-RS corresponds to a scrambling initial sequence determined according to a time unit occupied by a first PUSCH in the first PUSCH group.

20. The method of claim 1, further comprising: if a PUSCH in the at least one PUSCH group is scheduled by a first DCI, determining that aperiodic CSI triggered by the first DCI is multiplexed on all PUSCHs in a first PUSCH group of the at least one PUSCH group.

21. The method of claim 1, further comprising: determining a first redundancy version (RV) sequence; determining that an RV of a PUSCH in the at least one PUSCH group is one RV in the first RV sequence, and RVs of all PUSCHs in a same PUSCH group are identical.

22. The method of claim 21, wherein, The determining that the RV of the PUSCH in the at least one PUSCH group is one RV in the first RV sequence comprises: The at least one PUSCH group takes one RV from a first RV in the first RV sequence in order from a first PUSCH group to a last PUSCH group; if a PUSCH group takes a last RV in the first RV sequence, it is determined that a next PUSCH group takes a first RV in the first RV sequence, until a last PUSCH group takes one RV.

23. The method of claim 21, wherein, The determining that the RV of the PUSCH in the at least one PUSCH group is one RV in the first RV sequence comprises: determining that an RV of a PUSCH n in the at least one PUSCH group is an RV i in the first RV sequence, i = ((n – (n mod L)) / L) mod M, or i = (mod(((n – mod(n, L)) / L) – 1, M) + 1); wherein n represents an index of the PUSCH in the at least one PUSCH group, i represents an index of the RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, and M represents a length of the first RV sequence.

24. The method of claim 21, wherein, The determining of the RV of the PUSCH in the at least one PUSCH group as one RV in the first RV sequence comprises: The determining of the RV of the PUSCH n in the at least one PUSCH group as the RV j in the first RV sequence, j = ((n - (n mod(L*N))) / (L*N)) mod M, or j = (mod(((n - mod(n, (L*N))) / (L*N))-1, M)+1). wherein n represents an index of the PUSCH in the at least one PUSCH group, j represents an index of the RV in the first RV sequence, mod represents a modulo operation, L represents a length of the first OCC sequence, N represents a number of slots that a TB transmission of one PUSCH spans in a TB spanning multiple slots transmission, and M represents a length of the first RV sequence.

25. The method of claim 21, wherein, The determining of the RV of the PUSCH in the at least one PUSCH group as one RV in the first RV sequence comprises: The determining of the RV of all PUSCHs in the PUSCH group k in the at least one PUSCH group as the RV z in the first RV sequence, z = ((k - (k mod N)) / N) mod M. wherein k represents an index of a PUSCH group in the at least one PUSCH group, z represents an index of the RV in the first RV sequence, N represents a number of slots that a TB transmission of one PUSCH spans in a TB spanning multiple slots transmission, and M represents a length of the first RV sequence. 26.A communication apparatus comprising: a determining unit configured to group a plurality of PUSCHs of a physical uplink shared channel (PUSCH) repetition transmission according to a first orthogonal cover code (OCC) sequence, and determine at least one PUSCH group, each PUSCH group in the at least one PUSCH group using the first OCC sequence.

27. A terminal device comprising a processor, a memory, and a computer program or instructions stored on the memory, wherein, The processor executes the computer programs or instructions to implement the steps of the method of any one of claims 1-25.

28. A network device comprising a processor, a memory, and a computer program or instructions stored on the memory, wherein, The processor executes the computer programs or instructions to implement the steps of the method of any one of claims 1-25.

29. A chip comprising a processor and a communication interface, wherein, The processor executes the steps of the method of any one of claims 1-25. 30.A computer readable storage medium storing computer programs or instructions, which when executed implement the steps of the method of any one of claims 1-25.

Images