CN115699656A - Wireless communication method, terminal equipment and network equipment - Google Patents

Wireless communication method, terminal equipment and network equipment Download PDF

Info

Publication number
CN115699656A
CN115699656A CN202080102097.0A CN202080102097A CN115699656A CN 115699656 A CN115699656 A CN 115699656A CN 202080102097 A CN202080102097 A CN 202080102097A CN 115699656 A CN115699656 A CN 115699656A
Authority
CN
China
Prior art keywords
puschs
pusch
time domain
pucch
priority
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202080102097.0A
Other languages
Chinese (zh)
Inventor
林亚男
徐婧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Oppo Mobile Telecommunications Corp Ltd
Original Assignee
Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangdong Oppo Mobile Telecommunications Corp Ltd filed Critical Guangdong Oppo Mobile Telecommunications Corp Ltd
Publication of CN115699656A publication Critical patent/CN115699656A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the application provides a wireless communication method, terminal equipment and network equipment, wherein the method comprises the following steps: if a Physical Uplink Control Channel (PUCCH) and N Physical Uplink Shared Channels (PUSCHs) are overlapped in a time domain, the terminal equipment determines a target PUSCH in the N PUSCHs according to time domain end positions of the N PUSCHs, wherein the priority of the PUCCH is different from the priority of the N PUSCHs, the priorities of the N PUSCHs are the same, and N is a positive integer; and the terminal equipment sends the target PUSCH, wherein the target PUSCH comprises Uplink Control Information (UCI) in the PUCCH.

Description

Wireless communication method, terminal equipment and network equipment Technical Field
The embodiments of the present application relate to the field of communications, and in particular, to a wireless communication method, a terminal device, and a network device.
Background
In a New Radio (NR) Release-16, if uplink channels with different priorities overlap, the terminal device discards the low-priority uplink channel and transmits only the high-priority channel. This has the advantage that the transmission delay requirement and reliability of the high priority channel are guaranteed. However, considering that in practical applications, a low-priority channel is generally used for transmitting Enhanced Mobile Broadband (eMBB) services with a large data volume, discarding the low-priority channel may cause retransmission of a large amount of data, thereby reducing system transmission efficiency. Therefore, in the design of the NR Rel-17, multiplexing transmission of information with different priorities (i.e. information carried by channels with different priorities) is supported, so as to reduce the probability of discarding information with low priority and improve the system efficiency. However, when multiplexing transmission of information with different priorities is supported, how to guarantee the delay requirement and the reliability requirement of the high-priority information is an urgent problem to be solved.
Disclosure of Invention
The embodiment of the application provides a wireless communication method, terminal equipment and network equipment, which are beneficial to ensuring the time delay requirement and the reliability requirement of high-priority information.
In a first aspect, a wireless communication method is provided, and the method includes: if a Physical Uplink Control Channel (PUCCH) and N Physical Uplink Shared Channels (PUSCHs) are overlapped in a time domain, terminal equipment determines a target PUSCH in the N PUSCHs according to time domain ending positions of the N PUSCHs, wherein the priority of the PUCCH is different from the priority of the N PUSCHs, the priorities of the N PUSCHs are the same, and N is a positive integer; and the terminal equipment sends the target PUSCH, wherein the target PUSCH comprises Uplink Control Information (UCI) in the PUCCH.
In a second aspect, a wireless communication method is provided, the method comprising: the method comprises the steps that network equipment receives a first Physical Uplink Shared Channel (PUSCH) sent by terminal equipment, wherein the first PUSCH comprises Uplink Control Information (UCI); the first PUSCH is determined by the terminal device according to time domain end positions of N PUSCHs, the priority of a Physical Uplink Control Channel (PUCCH) corresponding to the UCI is different from the priority of the N PUSCHs, and the priorities of the N PUSCHs are the same.
In a third aspect, a terminal device is provided, configured to perform the method in the first aspect or each implementation manner thereof.
Specifically, the terminal device includes a functional module for executing the method in the first aspect or each implementation manner thereof.
In a fourth aspect, a network device is provided for performing the method of the second aspect or its implementation manners.
In particular, the network device comprises functional modules for performing the methods of the second aspect or its implementations described above.
In a fifth aspect, a terminal device is provided that includes a processor and a memory. The memory is used for storing a computer program, and the processor is used for calling and running the computer program stored in the memory, and executing the method in the first aspect or each implementation manner thereof.
In a sixth aspect, a network device is provided that includes a processor and a memory. The memory is used for storing a computer program, and the processor is used for calling and running the computer program stored in the memory to execute the method of the second aspect or each implementation mode thereof.
In a seventh aspect, an apparatus is provided for implementing the method in any one of the first to second aspects or implementations thereof.
Specifically, the apparatus includes: a processor configured to invoke and execute the computer program from the memory, so that the apparatus on which the apparatus is installed performs the method in any one of the first aspect to the second aspect or the implementation manner thereof.
In an eighth aspect, there is provided a computer readable storage medium for storing a computer program, the computer program causing a computer to perform the method of any one of the first to second aspects or implementations thereof.
In a ninth aspect, there is provided a computer program product comprising computer program instructions to cause a computer to perform the method of any one of the first to second aspects or implementations thereof.
A tenth aspect provides a computer program that, when run on a computer, causes the computer to perform the method of any one of the first to second aspects or implementations thereof.
With the technical solution of the first aspect or the second aspect, when the PUCCHs with different priorities are overlapped with multiple PUSCHs, the terminal device may select a target PUSCH according to time domain end positions of the multiple PUSCHs, and further multiplex the UCI in the PUCCH into the PUSCH for transmission. Therefore, the time delay requirement and the reliability requirement of the UCI of the PUCCH can be ensured.
Drawings
Fig. 1 is a schematic diagram of a communication system architecture provided in an embodiment of the present application;
FIG. 2 is a diagram of a set Q provided by an embodiment of the present application;
FIG. 3 is a diagram of multiplexed channels with respect to different priorities;
fig. 4 is an interaction flowchart of a wireless communication method according to an embodiment of the present application;
fig. 5 and fig. 6 are schematic diagrams of a PUCCH and a PUSCH provided in an embodiment of the present application;
FIG. 7 shows a schematic block diagram of a terminal device according to an embodiment of the application;
FIG. 8 shows a schematic block diagram of a network device according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application;
FIG. 10 is a schematic structural diagram of a chip of an embodiment of the present application;
fig. 11 is a schematic block diagram of a communication system according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments obtained by a person of ordinary skill in the art without making any creative effort for the embodiments in the present application belong to the protection scope of the present application.
The embodiment of the application can be applied to various communication systems, such as: a Global System for Mobile communications (GSM) System, a Code Division Multiple Access (CDMA) System, a Wideband Code Division Multiple Access (WCDMA) System, a General Packet Radio Service (GPRS), a Long Term Evolution (Long Term Evolution, LTE) System, an Advanced Long Term Evolution (LTE-a) System, an NR System, an Evolution System of an NR System, an LTE (LTE-based Access to unlicensed spectrum, LTE-U) System on an unlicensed spectrum, an NR-based Access to unlicensed spectrum, an NR-U System, a Universal Mobile telecommunications System (Universal Mobile telecommunications, UMTS) System, a Wireless Local Area Network (WLAN) System, a Wireless Local Area network (WiFi) System, and other Wireless communication systems.
Generally, conventional Communication systems support a limited number of connections and are easy to implement, however, with the development of Communication technologies, mobile Communication systems will support not only conventional Communication, but also, for example, device to Device (D2D) Communication, machine to Machine (M2M) Communication, machine Type Communication (MTC), and Vehicle to Vehicle (V2V) Communication, etc., and the embodiments of the present application can also be applied to these Communication systems.
Optionally, the communication system in the embodiment of the present application may be applied to a Carrier Aggregation (CA) scenario, may also be applied to a Dual Connectivity (DC) scenario, and may also be applied to an independent (SA) networking scenario.
The frequency spectrum of the application is not limited in the embodiment of the present application. For example, the embodiments of the present application may be applied to a licensed spectrum and may also be applied to an unlicensed spectrum.
Illustratively, a communication system 100 applied in the embodiment of the present application is shown in fig. 1. The communication system 100 may include a network device 110, and the network device 110 may be a device that communicates with a terminal device 120 (or referred to as a communication terminal, a terminal). Network device 110 may provide communication coverage for a particular geographic area and may communicate with terminal devices located within that coverage area.
Fig. 1 exemplarily shows one network device and two terminal devices, and optionally, the communication system 100 may include a plurality of network devices and may include other numbers of terminal devices within the coverage of each network device, which is not limited in this embodiment of the present application.
Optionally, the communication system 100 may further include other network entities such as a network controller, a mobility management entity, and the like, which is not limited in this embodiment.
It should be understood that, in the embodiments of the present application, a device having a communication function in a network/system may be referred to as a communication device. Taking the communication system 100 shown in fig. 1 as an example, the communication device may include a network device 110 and a terminal device 120 having a communication function, and the network device 110 and the terminal device 120 may be the specific devices described above and are not described herein again; the communication device may also include other devices in the communication system 100, such as other network entities, for example, a network controller, a mobility management entity, and the like, which is not limited in this embodiment.
It should be understood that the terms "system" and "network" are often used interchangeably herein. The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter associated objects are in an "or" relationship.
The embodiments of the present application have been described with reference to a terminal device and a network device, where: a terminal device may also be referred to as a User Equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a User terminal, a wireless communication device, a User agent, or a User Equipment, etc. The terminal device may be a Station (ST) in a WLAN, and may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA) device, 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, and a next generation communication system, for example, a terminal device in an NR Network or a terminal device in a future-evolution Public Land Mobile Network (PLMN) Network, and the like.
By way of example and not limitation, in the embodiments of the present application, the terminal device may also be a wearable device. Wearable equipment can also be called wearable intelligent equipment, is the general term of applying wearable technique to carry out intelligent design, develop the equipment that can dress to daily wearing, like glasses, gloves, wrist-watch, dress and shoes etc.. A wearable device is a portable device that is worn directly on the body or integrated into the clothing or accessories of the user. The wearable device is not only a hardware device, but also realizes powerful functions through software support, data interaction and cloud interaction. The generalized wearable smart device includes full functionality, large size, and can implement full or partial functionality without relying on a smart phone, such as: smart watches or smart glasses and the like, and only focus on a certain type of application functions, and need to be used in cooperation with other devices such as smart phones, such as various smart bracelets for physical sign monitoring, smart jewelry and the like.
The network device may be a device for communicating with a mobile device, and the network device may be an Access Point (AP) in a WLAN, a Base Station (BTS) in GSM or CDMA, a Base Station (NodeB, NB) in WCDMA, an evolved Node B (eNB, eNodeB) in LTE, a relay Station or an Access Point, or a network device or a Base Station (gNB) in a vehicle-mounted device, a wearable device, and an NR network, or a network device in a PLMN network for future evolution.
In this embodiment of the present application, a network device provides a service for a cell, and a terminal device communicates with the network device through a transmission resource (for example, a frequency domain resource or a spectrum resource) used by the cell, where the cell may be a cell corresponding to the network device (for example, a base station), and the cell may belong to a macro base station or a base station corresponding to a Small cell (Small cell), where the Small cell may include: urban cells (Metro cells), micro cells (Micro cells), pico cells (Pico cells), femto cells (Femto cells), and the like, and the small cells have the characteristics of small coverage area and low transmission power, and are suitable for providing high-rate data transmission services.
Before the technical scheme of the application is introduced, the related technology of the application is introduced as follows:
NR Rel-15 specifies that a plurality of overlapping Physical Uplink Control Channels (PUCCHs) or a plurality of PUCCHs and a Physical Uplink Shared Channel (PUSCH) can be multiplexed into one Channel for transmission when they satisfy a multiplexing timing relationship, which is defined in TS38.213. Otherwise, the terminal device may determine that the situation is an abnormal situation. The multiplexing timing relationship here is mainly to ensure that the terminal device has enough time to determine whether Information carried by different Uplink channels needs to be multiplexed, and time required for Uplink Control Information (UCI) concatenation, encoding, and the like during multiplexing transmission.
When the multiplexing timing sequence is satisfied, the terminal device first determines an overlapping PUCCH channel set Q, which is specifically as follows:
1. determining that the PUCCH A: the earliest PUCCH in the overlapping channels is started. And if a plurality of PUCCHs with the same start are available, the PUCCHs with the longest duration are selected. Both are the same, optionally one.
2. PUCCH overlapping PUCCH a includes set Q.
3. The PUCCH overlapping any PUCCH in set Q is included in set Q.
4. And multiplexing UCI in all sets Q in one PUCCH, and determining PUCCH B according to the bit number and PRI of the UCI.
The terminal device determines whether PUCCH B overlaps with other PUCCH. If yes, repeatedly executing 1-4. The set Q determined by the above method is shown in fig. 2.
After determining the set Q of overlapping PUCCH channels, the terminal device determines UCI for multiplexing the intra-channel bearers in the transmission set Q according to one PUCCH determined for the set Q, for a specific procedure see TS38.213. And if the PUCCH does not overlap any PUSCH, the terminal equipment multiplexes the UCI in the PUCCH for transmission. If the PUCCH overlaps with at least one PUSCH, the terminal determines one PUSCH from the at least one PUSCH, and multiplexes the UCI in the PUSCH for transmission, specifically:
1. acknowledgement (ACK)/Non-Acknowledgement (NACK) Information carried within a Channel in the set Q, and/or Channel State Information (CSI) Information is multiplexed for the intra-PUSCH transmission;
2. scheduling Request (SR) information carried within a channel in the set Q is not transmitted.
The process that the terminal equipment determines one PUSCH from the at least one PUSCH comprises the following steps:
(1) If at least one PUSCH includes a first PUSCH scheduled by Downlink Control Information (DCI) and a second PUSCH configured by a higher layer signaling (configurable grant configuration or semipersistent onpusch), the determined PUSCH is one of the first PUSCHs, for example, if a plurality of first PUSCHs satisfy a multiplexing condition, the terminal device selects a first PUSCH in which a corresponding serving cell Identity (Identity, ID) (ServCellIndex) is located in a carrier where the plurality of first PUSCHs are located, and the first PUSCH in which the time in the carrier where the corresponding serving cell Identity (ID) (ServCellIndex) is the smallest is taken as the determined PUSCH.
(2) If a plurality of PUSCHs (namely a plurality of first PUSCHs scheduled by DCI or a plurality of second PUSCHs configured by higher layer signaling) meet the multiplexing condition, the terminal selects the PUSCH with the time before the corresponding serving cell ID (ServcCellIndex) in the carriers of the plurality of PUSCHs as the determined PUSCH.
In NR Rel-16, ultra Reliable Low Latency (URLLC) traffic is supported for better support. The physical channel may be configured with a level 2 priority (2-level priority), i.e., high priority or low priority. Typically URLLC traffic will be transmitted using a high priority channel. If there are multiple uplink channels with different priorities overlapping, for the channels with the same priority, the terminal device determines a multiplexing channel by using the working mechanism of Rel-15 (if there is only one priority channel, the multiplexing channel is the channel itself), that is, the terminal device obtains two multiplexing channels respectively corresponding to different priorities. If the multiplexing channels with different priorities are overlapped, the terminal equipment only transmits the multiplexing channel with high priority and discards the multiplexing channel with low priority. Where HP represents high priority and LP represents low priority.
Specifically, fig. 3 is a schematic diagram of multiplexed channels with different priorities, and as shown in the upper half of fig. 3, a high-priority channel includes: PUCCH for bearing URLLC SR, PUCCH for bearing URLLC ACK/NACK and PUSCH for bearing URLLC service data, the low priority channel comprises: a PUCCH carrying eMBB ACK/NACK and a PUCCH carrying CSI. In step 1, for the high priority channel, the PUCCH carrying URLLC ACK/NACK and the PUSCH carrying the service data of URLLC overlap, so the terminal device determines that the PUSCH is a multiplexing channel by using the working mechanism of Rel-15, that is, the PUSCH can transmit the service data and ACK/NACK of URLLC, and the multiplexing channel can be described as the high priority multiplexing channel. For a low-priority channel, a PUCCH carrying eMBB ACK/NACK and a PUCCH carrying CSI are overlapped, so that the terminal device determines that the PUCCH carrying CSI is a multiplexed channel by using a Rel-15 working mechanism, that is, the PUCCCH can transmit eMBB ACK/NACK and CSI, and the multiplexed channel can be described as a low-priority multiplexed channel. Since the high priority multiplexed channel and the low priority multiplexed channel do not overlap, the terminal device does not have the situation that only the high priority multiplexed channel is transmitted and the low priority channel is discarded.
Wherein the lower half and the upper half of fig. 3 differ in that: the high priority multiplexed channel and the low priority multiplexed channel shown in the lower half overlap, and therefore, in step 2, the terminal device transmits only the high priority multiplexed channel and discards the low priority channel.
If the uplink channels with different priorities are overlapped in NR Rel-16, the terminal equipment discards the uplink channel with low priority and only transmits the uplink channel with high priority. This has the advantage that the transmission delay requirement and reliability of the high priority channel are guaranteed. However, considering that the low-priority channel is generally used for transmitting the eMBB service with a large data volume in practical applications, dropping the low-priority channel may cause retransmission of a large amount of data, thereby reducing the system transmission efficiency. Therefore, multiplexing transmission of information with different priorities is considered and supported in the design of NR Rel-17, so that the probability of discarding the information with low priority is reduced, and the system efficiency is improved. However, the multiplexing transmission of information with different priorities is supported, and how to ensure the delay requirement and the reliability requirement of the information with different priorities is an urgent problem to be solved.
In order to solve the technical problem, according to the method and the device, when the PUCCH and the PUSCHs with different priorities are overlapped in the time domain, the target PUSCH is determined according to the time domain end positions of the PUSCHs, the UCI of the PUCCH is multiplexed into the target PUSCH for transmission, and the time delay requirements and the reliability requirements of information with different priorities are favorably ensured.
The technical scheme of the application is explained in detail as follows:
fig. 4 is an interaction flow diagram of a wireless communication method 200 according to an embodiment of the present application, the method including at least some of the following steps:
s210, if a Physical Uplink Control Channel (PUCCH) and N Physical Uplink Shared Channels (PUSCHs) are overlapped in a time domain, a terminal device determines a target PUSCH in the N PUSCHs according to time domain end positions of the N PUSCHs, wherein priorities of the PUCCH and the N PUSCHs are different, priorities of the N PUSCHs are the same, and N is a positive integer;
s220, the terminal equipment sends the target PUSCH, wherein the target PUSCH comprises Uplink Control Information (UCI) in the PUCCH. Namely, the terminal device may multiplex UCI in PUCCH into PUSCH for transmission.
Correspondingly, the network equipment receives the target PUSCH sent by the terminal equipment.
Optionally, the priority of the PUCCH and the priority of the N PUSCHs are different, including:
the priority of the PUCCH is higher than the priorities of the N PUSCHs; or
The priority of the PUCCH is lower than the priorities of the N PUSCHs.
The method and the device can multiplex PUCCHs and PUSCHs with different priorities to one channel for transmission, and do not discard a low-priority channel, thereby being beneficial to ensuring the reliability requirement of the low-priority channel.
In some embodiments, the N PUSCHs are all PUSCHs that overlap the PUCCH in the time domain; or the like, or, alternatively,
in other embodiments, the N PUSCHs are PUSCHs that overlap with the PUCCH in the time domain and satisfy certain conditions.
Optionally, in some embodiments, the specific condition may include at least one of:
a first condition is judged according to the time domain starting position of the PUSCH;
a second condition judged according to the time domain end position of the PUSCH;
a third condition judged according to a symbol for carrying UCI in the PUSCH;
PUSCH scheduled by Downlink Control Information (DCI).
By way of example and not limitation, the specific conditions include at least one of:
judging whether the time delay meets the requirement of data processing or preparation according to the time domain starting position of the PUSCH;
judging that the transmission delay is met according to the time domain end position of the PUSCH;
judging whether the transmission delay is met according to the time domain position used for bearing the UCI in the PUSCH;
and scheduling according to whether the PUSCH is scheduled by the downlink control information DCI.
And selecting the target PUSCH from the PUSCHs screened according to the specific condition, so that the time delay requirement of a high-priority channel can be met.
In this embodiment, the terminal device may select the target PUSCH only according to the time domain end positions of the N PUSCHs, and in other embodiments, the terminal device may select the target PUSCH in combination with other information, for example, the other information may be the time domain end position of the PUSCH, a serving cell ID (ServCellIndex) corresponding to the PUSCH, and the like, and the application is not limited thereto.
Optionally, in this embodiment of the application, the time domain starting position may be a starting symbol, and the time domain ending position may be an ending symbol, or may also be other time units, such as a time slot, a micro-slot, and the like, which is not limited in this application.
As an example, the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
In some cases, if there is only one PUSCH with the earliest time domain end position among the N PUSCHs, the terminal device may determine the PUSCH with the earliest time domain end position as the target PUSCH.
In other embodiments, the terminal device determines the target PUSCH according to the time domain end positions of the N PUSCHs in combination with the time domain start positions of at least two PUSCHs in the N PUSCHs and/or the serving cell identifier IDs corresponding to the at least two PUSCHs in the N PUSCHs.
For example, if there are a plurality of PUSCHs with the earliest time domain end positions in the N PUSCHs, in this case, the terminal device may further determine the target PUSCH in combination with the time domain start positions of the plurality of PUSCHs with the earliest time domain end positions and/or the serving cell IDs corresponding to the plurality of PUSCHs.
As an example, the target PUSCH is a PUSCH with an earliest time domain starting position among P PUSCHs, the P PUSCHs are PUSCHs with an earliest time domain ending position among the N PUSCHs, and P is a positive integer.
As another example, the target PUSCH is a PUSCH with the largest or smallest serving cell identity ID among Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position among the N PUSCHs with the earliest time domain ending position, and Q is a positive integer.
As yet another example, the target PUSCH is a PUSCH with a maximum or minimum serving cell identification ID among T PUSCHs, the T PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and T is a positive integer.
When the UCI is multiplexed and transmitted in the PUSCH, the UCI is usually mapped to the first K time domain symbols of the PUSCH for transmission, and the value of K is related to the scheduling parameter of the PUSCH. The earlier the time domain starting position of the PUSCH is, the earlier the time domain starting position in which UCI is mapped means that UCI is actually transmitted, the earlier the time domain starting position is, the processing delay of UCI will likely be low. However, if the PUSCH itself is actually long, the UCI may also occupy more time domain symbols (that is, K is large) for transmission, and the transmission delay of the UCI is not necessarily the lowest, so in the embodiment of the present application, when the PUSCH is selected, the ending position of the PUSCH is combined, which is beneficial to meeting the delay requirement of the high-priority channel.
It should be understood that, in the embodiment of the present application, selecting the target PUSCH according to the time domain end position of the PUSCH may be a first determination condition for selecting the target PUSCH from a plurality of PUSCHs, or may be a further determination condition based on other determination conditions, which is not limited in the embodiment of the present application.
In other words, the selection may be made according to the time domain end position of the PUSCH first, or may be made according to the time domain position of the PUSCH further on the basis of selecting a part of the PUSCH according to other information.
For example, the selection may be performed according to a time domain starting position of the PUSCH, the N PUSCHs may be determined, and the selection may be further performed according to time domain ending positions of the N PUSCHs.
For another example, the selection is performed according to the serving cell ID corresponding to the PUSCH, the N PUSCHs are determined, and the selection is further performed according to the time domain end positions of the N PUSCHs.
In the embodiment of the present application, it is assumed that all PUSCHs overlapping with the PUCCH in the time domain or PUSCHs overlapping with the PUCCH in the time domain and satisfying a specific condition constitute a first PUSCH set. In some embodiments, the N PUSCHs may include all PUSCHs in the first set of PUSCHs. In other embodiments, the N PUSCHs include a partial PUSCH in the first set of PUSCHs. Namely, the N PUSCHs are PUSCHs that are screened from the first PUSCH set and meet a certain condition.
As an example, the N PUSCHs are PUSCHs with the earliest time domain starting position among all PUSCHs having time domain overlapping with the PUCCH.
As another example, the N PUSCHs are PUSCHs having the earliest time domain start position among PUSCHs that overlap with the PUCCH in the time domain and satisfy a specific condition.
That is, the N PUSCHs may be PUSCHs with the earliest time domain starting position in the first PUSCH set.
In this case, it can be understood that the selection is performed according to the time domain starting position of the PUSCH, and the time domain ending position of the PUSCH is further combined with the screened PUSCH.
As an example, the PUSCH with the earliest time domain end position among the N PUSCHs may be selected as the target PUSCH.
If there are multiple PUSCHs with the earliest time domain end positions, the terminal device may arbitrarily select one of the PUSCHs as a target PUSCH, or may further select the target PUSCH in combination with other information, for example, determine the target PUSCH in combination with the serving cell identifier IDs corresponding to the multiple PUSCHs with the earliest time domain end positions.
As an example, the target PUSCH is a PUSCH with a maximum or minimum serving cell identity ID among S PUSCHs, the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and S is a positive integer.
Hereinafter, a specific example shown in fig. 5 and 6 will be described with reference to a target PUSCH determination method.
As shown in fig. 5, one PUCCH overlaps with 5 PUSCHs, where PUSCH 1 is transmitted in carrier (CC) 1 (i.e., servCellIndex = 1), PUSCH2 and PUSCH3 are transmitted in different time domain symbols in CC 2 (i.e., servCellIndex = 2), PUSCH 4 is transmitted in CC 3 (i.e., servCellIndex = 3), and PUSCH 5 is transmitted in CC4 (i.e., servCellIndex = 4).
First, the PUSCH with the earliest starting symbol among 5 PUSCHs may be determined, wherein the starting symbols of PUSCH 1, PUSCH2, PUSCH 4 are the same and earliest.
Secondly, the PUSCH with the earliest ending symbol in the PUSCHs with the earliest starting symbol is determined, wherein the ending symbols of the PUSCHs 2 and 4 are the same and earliest.
Then, a target PUSCH is determined according to the ServCellIndex corresponding to the PUSCH, for example, a PUSCH in a CC with the smallest ServCellIndex may be selected, where the CC corresponding to the PUSCH2 is the smallest, and the PUSCH2 may be determined to be the target PUSCH.
Therefore, UCI in the PUCCH may be multiplexed into PUSCH2 for transmission.
As shown in fig. 6, one PUCCH overlaps 4 PUSCHs, where PUSCH 1 is transmitted in carrier (CC) 1 (i.e., servCellIndex = 1), PUSCH2 is transmitted in CC 2 (i.e., servCellIndex = 2) on a different time domain symbol, PUSCH3 is transmitted in CC 3 (i.e., servCellIndex = 3), and PUSCH 4 is transmitted in CC4 (i.e., servCellIndex = 4).
First, the PUSCH with the earliest ending symbol among the 4 PUSCHs may be determined, where the ending symbols of PUSCH2, PUSCH3 are the same and earliest.
Secondly, determining the PUSCH with the earliest starting symbol in the PUSCHs with the earliest ending symbol, wherein the PUSCH3 with the earliest starting symbol can be determined as the target PUSCH.
Therefore, UCI in the PUCCH may be multiplexed into PUSCH3 for transmission.
Continuing with fig. 6, in another implementation, the PUSCH with the earliest ending symbol among the 4 PUSCHs may be determined first, where the ending symbols of PUSCH2, PUSCH3 are the same and earliest.
And further determining the target PUSCH in combination with the ServCellIndex corresponding to the PUSCH with the earliest end symbol, for example, selecting the PUSCH in the CC with the smallest ServCellIndex, where the CC corresponding to the PUSCH2 is the smallest, and determining that the PUSCH2 is the target PUSCH.
Therefore, the UCI in the PUCCH may be multiplexed into PUSCH2 for transmission.
In summary, in the embodiment of the present application, if the PUCCH overlaps with multiple PUSCHs with different priorities, the terminal device may select a target PUSCH from the multiple PUSCHs according to the time domain end positions of the multiple PUSCHs, and further multiplex the UCI in the PUCCH into the target PUSCH for transmission, which is beneficial to ensure the delay requirement and the reliability requirement of the UCI of the PUCCH.
Method embodiments of the present application are described in detail above with reference to fig. 4-6, and apparatus embodiments of the present application are described in detail below with reference to fig. 7-11, it being understood that apparatus embodiments correspond to method embodiments and that similar descriptions may be had with reference to method embodiments.
Fig. 7 shows a schematic block diagram of a terminal device 700 according to an embodiment of the application. As shown in fig. 10, the terminal device 700 includes:
a processing unit 710, configured to determine a target PUSCH in N PUSCHs according to time domain end positions of the N PUSCHs if there is an overlap between a physical uplink control channel PUCCH and the N physical uplink shared channels PUSCH in a time domain, where a priority of the PUCCH is different from priorities of the N PUSCHs, the priorities of the N PUSCHs are the same, and N is a positive integer;
a communication unit 720, configured to transmit the target PUSCH, where the target PUSCH includes uplink control information UCI in the PUCCH.
Optionally, in some embodiments, the N PUSCHs are all PUSCHs that overlap with the PUCCH in a time domain; or the like, or, alternatively,
the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition.
Optionally, in some embodiments, the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
Optionally, in some embodiments, the processing unit 710 is specifically configured to:
and determining the target PUSCH according to the time domain end positions of the N PUSCHs and by combining time domain starting positions of at least two PUSCHs in the N PUSCHs and/or service cell identification IDs corresponding to at least two PUSCHs in the N PUSCHs.
Optionally, in some embodiments, the target PUSCH is a PUSCH with an earliest time domain starting position among P PUSCHs, the P PUSCHs are PUSCHs with an earliest time domain ending position among the N PUSCHs, and P is a positive integer; or the like, or a combination thereof,
the target PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position in the PUSCHs with the earliest time domain ending position in the N PUSCHs, and Q is a positive integer; or the like, or, alternatively,
the target PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in the T PUSCHs, the T PUSCHs are the PUSCHs with the earliest time domain end position in the N PUSCHs, and T is a positive integer.
Optionally, in some embodiments, the N PUSCHs are PUSCHs with earliest time domain starting positions among all PUSCHs having time domain overlapping with the PUCCH; or the like, or a combination thereof,
the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition, and the starting position of the time domain of the PUSCHs is the earliest.
Optionally, in some embodiments, the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
Optionally, in some embodiments, the processing unit 710 is further configured to:
and determining the target PUSCH according to the time domain end positions of the N PUSCHs and by combining service cell identification IDs corresponding to at least two PUSCHs in the N PUSCHs.
Optionally, in some embodiments, the target PUSCH is a PUSCH with a maximum or minimum serving cell identity ID among S PUSCHs, the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and S is a positive integer.
Optionally, in some embodiments, the specific condition comprises at least one of:
judging whether the time delay is met or not according to the time domain starting position of the PUSCH;
judging whether the transmission delay is met according to the time domain end position of the PUSCH;
judging whether the transmission delay is met according to the time domain position used for bearing the UCI in the PUSCH;
and scheduling according to whether the PUSCH is scheduled by the downlink control information DCI.
Optionally, in some embodiments, the priority of the PUCCH and the priority of the N PUSCHs are different, including:
the priority of the PUCCH is higher than the priorities of the N PUSCHs; or
The priority of the PUCCH is lower than the priority of the N PUSCHs.
Optionally, in some embodiments, the communication unit may be a communication interface or a transceiver, or an input/output interface of a communication chip or a system on a chip.
It should be understood that the terminal device 700 according to the embodiment of the present application may correspond to a terminal device in the embodiment of the method of the present application, and the above and other operations and/or functions of each unit in the terminal device 700 are respectively for implementing corresponding processes of the terminal device in the embodiment of the method described above, and are not described herein again for brevity.
Fig. 8 shows a schematic block diagram of a network device 800 according to an embodiment of the application. As shown in fig. 8, the network device 800 includes:
a communication unit 810, configured to receive a first physical uplink shared channel PUSCH sent by a terminal device, where the first PUSCH includes uplink control information UCI;
the first PUSCH is determined by the terminal device according to time domain end positions of N PUSCHs, the priority of a Physical Uplink Control Channel (PUCCH) corresponding to the UCI is different from the priority of the N PUSCHs, and the priorities of the N PUSCHs are the same.
Optionally, in some embodiments, the N PUSCHs are all PUSCHs that overlap with the PUCCH in a time domain; or the like, or, alternatively,
the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition.
Optionally, in some embodiments, the first PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
Optionally, in some embodiments, the first PUSCH is a PUSCH with an earliest time domain starting position among P PUSCHs, the P PUSCHs are PUSCHs with an earliest time domain ending position among the N PUSCHs, and P is a positive integer; or the like, or a combination thereof,
the first PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position in the PUSCHs with the earliest time domain ending position in the N PUSCHs, and Q is a positive integer; or the like, or, alternatively,
the first PUSCH is a PUSCH with a maximum or minimum corresponding serving cell Identity (ID) in T PUSCHs, the T PUSCHs are PUSCHs with the earliest time domain end position in the N PUSCHs, and T is a positive integer.
Optionally, in some embodiments, the N PUSCHs are PUSCHs with earliest time domain starting positions among all PUSCHs having an overlap with the PUCCH in a time domain; or the like, or, alternatively,
the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition, and the time domain starting position of the PUSCHs is the earliest PUSCH.
Optionally, in some embodiments, the first PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
Optionally, in some embodiments, the first PUSCH is a PUSCH with a maximum or minimum serving cell identity ID corresponding to S PUSCHs, the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and S is a positive integer.
Optionally, in some embodiments, the specific condition comprises at least one of:
judging whether the time delay meets the requirement of data processing or preparation according to the time domain starting position of the PUSCH;
judging that the transmission delay is met according to the time domain end position of the PUSCH;
judging whether the transmission delay is met according to the time domain position used for bearing the UCI in the PUSCH;
and scheduling according to whether the PUSCH is scheduled by the downlink control information DCI.
Optionally, in some embodiments, the priority of the PUCCH and the priority of the N PUSCHs are different, including:
the priority of the PUCCH is higher than the priority of the N PUSCHs; or
The priority of the PUCCH is lower than the priorities of the N PUSCHs.
Optionally, in some embodiments, the communication unit may be a communication interface or a transceiver, or an input/output interface of a communication chip or a system on a chip.
It should be understood that the network device 800 according to the embodiment of the present application may correspond to a network device in the method embodiment of the present application, and the foregoing and other operations and/or functions of each unit in the network device 800 are respectively for implementing corresponding processes of the network device in the method embodiment described above, and are not described herein again for brevity.
Fig. 9 is a schematic structural diagram of a communication device 900 according to an embodiment of the present application. The communication device 900 shown in fig. 9 includes a processor 910, and the processor 910 can call and run a computer program from a memory to implement the method in the embodiment of the present application.
Optionally, as shown in fig. 9, the communication device 900 may also include a memory 920. From the memory 920, the processor 910 can call and run a computer program to implement the method in the embodiment of the present application.
The memory 920 may be a separate device from the processor 910, or may be integrated in the processor 910.
Optionally, as shown in fig. 9, the communication device 900 may further include a transceiver 930, and the processor 910 may control the transceiver 930 to communicate with other devices, and specifically, may transmit information or data to the other devices or receive information or data transmitted by the other devices.
The transceiver 930 may include a transmitter and a receiver, among others. The transceiver 930 may further include one or more antennas.
Optionally, the communication device 900 may specifically be a network device in this embodiment, and the communication device 900 may implement a corresponding process implemented by the network device in each method in this embodiment, which is not described herein again for brevity.
Optionally, the communication device 900 may specifically be a terminal device in this embodiment, and the communication device 900 may implement a corresponding process implemented by the terminal device in each method in this embodiment, which is not described herein again for brevity.
Fig. 10 is a schematic structural view of an apparatus of an embodiment of the present application. The chip 1000 shown in fig. 10 includes a processor 1010, and the processor 1010 may call and run a computer program from a memory to implement the method in the embodiment of the present application.
Optionally, as shown in fig. 10, the chip 1000 may further include a memory 1020. From the memory 1020, the processor 1010 may call and execute a computer program to implement the method in the embodiment of the present application.
The memory 1020 may be a separate device from the processor 1010 or may be integrated into the processor 1010.
Optionally, the chip 1000 may further include an input interface 1030. The processor 1010 may control the input interface 1030 to communicate with other devices or chips, and specifically may obtain information or data transmitted by the other devices or chips.
Optionally, the chip 1000 may further include an output interface 1040. The processor 1010 may control the output interface 1040 to communicate with other devices or chips, and may particularly output information or data to the other devices or chips.
Optionally, the chip 1000 may be applied to a network device in this embodiment, and the chip 1000 may implement a corresponding process implemented by the network device in each method in this embodiment, which is not described herein again for brevity.
Optionally, the chip 1000 may be applied to the terminal device in the embodiment of the present application, and the chip 1000 may implement a corresponding process implemented by the terminal device in each method in the embodiment of the present application, and for brevity, no further description is given here.
Alternatively, the chip 1000 according to the embodiment of the present application may be, for example, a system on chip, or a system on chip.
Fig. 11 is a schematic block diagram of a communication system 1100 provided in an embodiment of the present application. As shown in fig. 11, the communication system 1100 includes a terminal device 110 and a network device 1120.
The terminal device 1110 may be configured to implement the corresponding function implemented by the terminal device in the foregoing method, and the network device 1120 may be configured to implement the corresponding function implemented by the network device or the base station in the foregoing method, which is not described herein again for brevity.
It should be understood that the processor of the embodiments of the present application may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The Processor may be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, or discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software modules may be located in ram, flash, rom, prom, or eprom, registers, etc. as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and combines hardware thereof to complete the steps of the method.
It will be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of example, but not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), dynamic Random Access Memory (DRAM), synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), double Data Rate Synchronous Dynamic random access memory (DDR SDRAM), enhanced Synchronous SDRAM (ESDRAM), synchronous link SDRAM (SLDRAM), and Direct Rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
It should be understood that the above memories are exemplary but not limiting illustrations, for example, the memories in the embodiments of the present application may also be Static Random Access Memory (SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (enhanced SDRAM, ESDRAM), synchronous Link DRAM (SLDRAM), direct Rambus RAM (DR RAM), and the like. That is, the memory in the embodiments of the present application is intended to comprise, without being limited to, these and any other suitable types of memory.
The embodiment of the application also provides a computer readable storage medium for storing the computer program.
Optionally, the computer-readable storage medium may be applied to the network device or the base station in the embodiment of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the network device or the base station in the methods in the embodiments of the present application, which are not described herein again for brevity.
Optionally, the computer-readable storage medium may be applied to the mobile terminal/terminal device in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, which is not described herein again for brevity.
Embodiments of the present application also provide a computer program product comprising computer program instructions.
Optionally, the computer program product may be applied to the network device or the base station in the embodiment of the present application, and the computer program instructions enable the computer to execute corresponding processes implemented by the network device or the base station in the methods in the embodiments of the present application, which are not described herein again for brevity.
Optionally, the computer program product may be applied to the mobile terminal/terminal device in the embodiment of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the mobile terminal/terminal device in the methods in the embodiment of the present application, which are not described herein again for brevity.
The embodiment of the application also provides a computer program.
Optionally, the computer program may be applied to the network device or the base station in the embodiment of the present application, and when the computer program runs on a computer, the computer is enabled to execute a corresponding process implemented by the network device or the base station in each method in the embodiment of the present application, which is not described herein again for brevity.
Optionally, the computer program may be applied to the mobile terminal/terminal device in the embodiment of the present application, and when the computer program runs on a computer, the computer is enabled to execute a corresponding process implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, which is not described herein again for brevity.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the technical solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. With regard to such understanding, the technical solutions of the present application may be essentially implemented or contributed to by the prior art, or may be implemented in a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (50)

  1. A method of wireless communication, comprising:
    if a Physical Uplink Control Channel (PUCCH) and N Physical Uplink Shared Channels (PUSCHs) are overlapped in a time domain, the terminal equipment determines a target PUSCH in the N PUSCHs according to time domain end positions of the N PUSCHs, wherein the priority of the PUCCH is different from the priority of the N PUSCHs, the priorities of the N PUSCHs are the same, and N is a positive integer;
    and the terminal equipment sends the target PUSCH, wherein the target PUSCH comprises Uplink Control Information (UCI) in the PUCCH.
  2. The method of claim 1,
    the N PUSCHs are all PUSCHs which are overlapped with the PUCCH on a time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition.
  3. The method of claim 2, wherein the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  4. The method according to claim 1 or 2, wherein the terminal device determines the target PUSCH from the N PUSCHs according to the time domain end positions of the N PUSCHs, and comprises:
    and the terminal equipment determines the target PUSCH according to the time domain end positions of the N PUSCHs and by combining the time domain start positions of at least two PUSCHs in the N PUSCHs and/or the service cell identification IDs corresponding to at least two PUSCHs in the N PUSCHs.
  5. The method of claim 4,
    the target PUSCH is the PUSCH with the earliest time domain starting position in P PUSCHs, the P PUSCHs are the PUSCHs with the earliest time domain ending position in the N PUSCHs, and P is a positive integer; or the like, or a combination thereof,
    the target PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position in the PUSCHs with the earliest time domain ending position in the N PUSCHs, and Q is a positive integer; or the like, or a combination thereof,
    the target PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in the T PUSCHs, the T PUSCHs are PUSCHs with the earliest time domain end position in the N PUSCHs, and T is a positive integer.
  6. The method of claim 1,
    the N PUSCHs are PUSCHs with earliest time domain initial positions in all PUSCHs which are overlapped with the PUCCH on the time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition, and the starting position of the time domain of the PUSCHs is the earliest.
  7. The method of claim 6, wherein the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  8. The method of claim 6, wherein the terminal device determines a target PUSCH from the N PUSCHs according to the time domain end positions of the N PUSCHs, and wherein the determining comprises:
    and the terminal equipment determines the target PUSCH according to the time domain end positions of the N PUSCHs and by combining service cell identification IDs corresponding to at least two PUSCHs in the N PUSCHs.
  9. The method of claim 8, wherein the target PUSCH is a PUSCH with a largest or smallest corresponding serving cell Identity (ID) among S PUSCHs, wherein the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and wherein S is a positive integer.
  10. The method according to claim 2 or 6, wherein the specific condition comprises at least one of:
    judging whether the time delay is met or not according to the time domain starting position of the PUSCH;
    judging that the transmission delay is met according to the time domain end position of the PUSCH;
    judging whether the transmission delay is met according to the time domain position used for bearing the UCI in the PUSCH;
    and according to whether the PUSCH is scheduled by the downlink control information DCI or not.
  11. The method according to any of claims 1-10, wherein the priority of the PUCCH and the priority of the N PUSCHs are different, comprising:
    the priority of the PUCCH is higher than the priorities of the N PUSCHs; or
    The priority of the PUCCH is lower than the priorities of the N PUSCHs.
  12. A method of wireless communication, comprising:
    the method comprises the steps that network equipment receives a first Physical Uplink Shared Channel (PUSCH) sent by terminal equipment, wherein the first PUSCH comprises Uplink Control Information (UCI);
    the first PUSCH is determined by the terminal device according to time domain end positions of N PUSCHs, the priority of a Physical Uplink Control Channel (PUCCH) corresponding to the UCI is different from the priority of the N PUSCHs, and the priorities of the N PUSCHs are the same.
  13. The method of claim 12, wherein the N PUSCHs are all PUSCHs that overlap with the PUCCH in a time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition.
  14. The method of claim 13, wherein the first PUSCH is the earliest PUSCH of the N PUSCHs having an earliest time domain end position.
  15. The method according to claim 12 or 13,
    the first PUSCH is the PUSCH with the earliest time domain starting position in P PUSCHs, the P PUSCHs are the PUSCHs with the earliest time domain ending position in the N PUSCHs, and P is a positive integer; or the like, or, alternatively,
    the first PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position in the PUSCHs with the earliest time domain ending position in the N PUSCHs, and Q is a positive integer; or the like, or, alternatively,
    the first PUSCH is a PUSCH with a maximum or minimum serving cell identifier ID corresponding to the T PUSCHs, the T PUSCHs are PUSCHs with an earliest time domain end position in the N PUSCHs, and T is a positive integer.
  16. The method of claim 12,
    the N PUSCHs are PUSCHs with earliest time domain initial positions in all PUSCHs which are overlapped with the PUCCH on the time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition, and the time domain starting position of the PUSCHs is the earliest PUSCH.
  17. The method of claim 16, wherein the first PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  18. The method of claim 16, wherein the first PUSCH is a PUSCH with a largest or smallest serving cell identity ID among S PUSCHs, wherein the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and wherein S is a positive integer.
  19. The method according to claim 13 or 16, wherein the specific condition comprises at least one of:
    judging whether the time delay is met or not according to the time domain starting position of the PUSCH;
    judging that the transmission delay is met according to the time domain end position of the PUSCH;
    judging whether the transmission delay is met according to the time domain position used for bearing the UCI in the PUSCH;
    and according to whether the PUSCH is scheduled by the downlink control information DCI or not.
  20. The method according to any of claims 12-19, wherein the priority of the PUCCH and the priority of the N PUSCHs are different, comprising:
    the priority of the PUCCH is higher than the priorities of the N PUSCHs; or
    The priority of the PUCCH is lower than the priorities of the N PUSCHs.
  21. A terminal device, comprising:
    a processing unit, configured to determine a target PUSCH in N PUSCHs according to time domain end positions of the N PUSCHs if a physical uplink control channel PUCCH and N physical uplink shared channels PUSCH are overlapped in a time domain, where a priority of the PUCCH is different from a priority of the N PUSCHs, the priorities of the N PUSCHs are the same, and N is a positive integer;
    a communication unit, configured to transmit the target PUSCH, where the target PUSCH includes uplink control information UCI in the PUCCH.
  22. The terminal device of claim 21,
    the N PUSCHs are all PUSCHs which are overlapped with the PUCCH on a time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition.
  23. The terminal device of claim 22, wherein the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  24. The terminal device according to claim 21 or 22, wherein the processing unit is specifically configured to:
    and determining the target PUSCH according to the time domain end positions of the N PUSCHs and by combining the time domain start positions of at least two PUSCHs in the N PUSCHs and/or the service cell identification IDs corresponding to the at least two PUSCHs in the N PUSCHs.
  25. The terminal device of claim 24,
    the target PUSCH is the PUSCH with the earliest time domain starting position in P PUSCHs, the P PUSCHs are the PUSCHs with the earliest time domain ending position in the N PUSCHs, and P is a positive integer; or the like, or a combination thereof,
    the target PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position in the PUSCHs with the earliest time domain ending position in the N PUSCHs, and Q is a positive integer; or the like, or a combination thereof,
    the target PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in the T PUSCHs, the T PUSCHs are PUSCHs with the earliest time domain end position in the N PUSCHs, and T is a positive integer.
  26. The terminal device of claim 21,
    the N PUSCHs are PUSCHs with earliest time domain initial positions in all PUSCHs which are overlapped with the PUCCH on the time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition, and the time domain starting position of the PUSCHs is the earliest PUSCH.
  27. The terminal device of claim 26, wherein the target PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  28. The terminal device of claim 26, wherein the processing unit is further configured to:
    and determining the target PUSCH according to the time domain end positions of the N PUSCHs and by combining service cell identification IDs corresponding to at least two PUSCHs in the N PUSCHs.
  29. The terminal device according to claim 28, wherein the target PUSCH is a PUSCH with a maximum or minimum serving cell identity ID among S PUSCHs, wherein the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and wherein S is a positive integer.
  30. The terminal device according to claim 22 or 26, wherein the specific condition comprises at least one of:
    judging whether the time delay is met or not according to the time domain starting position of the PUSCH;
    judging whether the transmission delay is met according to the time domain end position of the PUSCH;
    judging that the transmission delay is met according to the time domain position for bearing the UCI in the PUSCH;
    and scheduling according to whether the PUSCH is scheduled by the downlink control information DCI.
  31. The terminal device according to any of claims 21-30, wherein the priority of the PUCCH and the priority of the N PUSCHs are different, comprising:
    the priority of the PUCCH is higher than the priorities of the N PUSCHs; or
    The priority of the PUCCH is lower than the priority of the N PUSCHs.
  32. A network device, comprising:
    the terminal equipment comprises a communication unit, a first Physical Uplink Shared Channel (PUSCH) and a second PUSCH, wherein the PUSCH is sent by the terminal equipment and comprises Uplink Control Information (UCI);
    the first PUSCH is determined by the terminal device according to time domain end positions of N PUSCHs, the priority of a Physical Uplink Control Channel (PUCCH) corresponding to the UCI is different from the priority of the N PUSCHs, and the priorities of the N PUSCHs are the same.
  33. The network device of claim 32, wherein the N PUSCHs are all PUSCHs that overlap with the PUCCH in a time domain; or the like, or, alternatively,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition.
  34. The network device of claim 33, wherein the first PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  35. The network device of claim 32 or 33,
    the first PUSCH is the PUSCH with the earliest time domain starting position in P PUSCHs, the P PUSCHs are the PUSCHs with the earliest time domain ending position in the N PUSCHs, and P is a positive integer; or the like, or a combination thereof,
    the first PUSCH is a PUSCH with the largest or smallest corresponding serving cell identifier ID in Q PUSCHs, the Q PUSCHs are PUSCHs with the earliest time domain starting position in the PUSCHs with the earliest time domain ending position in the N PUSCHs, and Q is a positive integer; or the like, or a combination thereof,
    the first PUSCH is a PUSCH with a maximum or minimum corresponding serving cell Identity (ID) in T PUSCHs, the T PUSCHs are PUSCHs with the earliest time domain end position in the N PUSCHs, and T is a positive integer.
  36. The network device of claim 32,
    the N PUSCHs are PUSCHs with earliest time domain starting positions in all PUSCHs which are overlapped with the PUCCH on the time domain; or the like, or a combination thereof,
    the N PUSCHs are PUSCHs which overlap with the PUCCH in a time domain and meet a specific condition, and the time domain starting position of the PUSCHs is the earliest PUSCH.
  37. The network device of claim 36, wherein the first PUSCH is a PUSCH with an earliest time domain end position among the N PUSCHs.
  38. The network device of claim 36, wherein the first PUSCH is a PUSCH with a largest or smallest serving cell identity ID among S PUSCHs, wherein the S PUSCHs are PUSCHs with an earliest time domain end position among the N PUSCHs, and wherein S is a positive integer.
  39. The network device of claim 33 or 36, wherein the specific condition comprises at least one of:
    judging whether the time delay meets the requirement of data processing or preparation according to the time domain starting position of the PUSCH;
    judging whether the transmission delay is met according to the time domain end position of the PUSCH;
    judging whether the transmission delay is met according to the time domain position used for bearing the UCI in the PUSCH;
    and according to whether the PUSCH is scheduled by the downlink control information DCI or not.
  40. The network device of any of claims 32-39, wherein the priorities of the PUCCH and the N PUSCHs are different, comprising:
    the priority of the PUCCH is higher than the priority of the N PUSCHs; or
    The priority of the PUCCH is lower than the priorities of the N PUSCHs.
  41. A terminal device, comprising: a processor and a memory for storing a computer program, the processor being adapted to invoke and execute the computer program stored in the memory, performing the method of any of claims 1 to 11.
  42. A chip, comprising: a processor for calling and running a computer program from a memory so that a device on which the chip is installed performs the method of any one of claims 1 to 11.
  43. A computer-readable storage medium for storing a computer program which causes a computer to perform the method of any one of claims 1 to 11.
  44. A computer program product comprising computer program instructions to cause a computer to perform the method of any one of claims 1 to 11.
  45. A computer program, characterized in that the computer program causes a computer to perform the method according to any of claims 1-11.
  46. A network device, comprising: a processor and a memory for storing a computer program, the processor being configured to invoke and execute the computer program stored in the memory to perform the method of any of claims 12 to 20.
  47. A chip, comprising: a processor for calling and running a computer program from a memory so that a device on which the chip is installed performs the method of any one of claims 12 to 20.
  48. A computer-readable storage medium for storing a computer program which causes a computer to perform the method of any one of claims 12 to 20.
  49. A computer program product comprising computer program instructions to cause a computer to perform the method of any one of claims 12 to 20.
  50. A computer program, characterized in that the computer program causes a computer to perform the method according to any of claims 12-20.
CN202080102097.0A 2020-08-14 2020-08-14 Wireless communication method, terminal equipment and network equipment Pending CN115699656A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/109265 WO2022032654A1 (en) 2020-08-14 2020-08-14 Wireless communication method, terminal device, and network device

Publications (1)

Publication Number Publication Date
CN115699656A true CN115699656A (en) 2023-02-03

Family

ID=80247580

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202080102097.0A Pending CN115699656A (en) 2020-08-14 2020-08-14 Wireless communication method, terminal equipment and network equipment

Country Status (2)

Country Link
CN (1) CN115699656A (en)
WO (1) WO2022032654A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023206224A1 (en) * 2022-04-28 2023-11-02 Qualcomm Incorporated Transmissions for overlapping physical uplink control channels and physical uplink shared channels
WO2023216129A1 (en) * 2022-05-11 2023-11-16 Qualcomm Incorporated Uplink control information message multiplexing on physical uplink shared channel resources across different transmission reception points

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110474747B (en) * 2018-05-11 2022-01-25 中兴通讯股份有限公司 Signal transmission method and device, and terminal
CN114340008A (en) * 2019-01-11 2022-04-12 华为技术有限公司 Method and device for multiplexing uplink control information
CN111435878B (en) * 2019-01-11 2021-10-01 大唐移动通信设备有限公司 Information transmission method, terminal and network equipment
CN110768773B (en) * 2019-09-30 2022-05-24 中国信息通信研究院 Uplink information multiplexing method and device

Also Published As

Publication number Publication date
WO2022032654A1 (en) 2022-02-17

Similar Documents

Publication Publication Date Title
CN112369094B (en) Wireless communication method, terminal device and network device
CN113207178A (en) Power distribution method, terminal device and storage medium
CN112672424A (en) Wireless communication method, terminal equipment and network equipment
CN114364040B (en) Wireless communication method and terminal device
CN115499114A (en) Wireless communication method, receiving end equipment and transmitting end equipment
CN113261378A (en) Random access method, terminal equipment and network equipment
CN116235613A (en) Wireless communication method, terminal equipment and network equipment
CN111869314A (en) Wireless communication method and terminal device
WO2020034223A1 (en) Harq information transmission method, network device and terminal device
CN112219419B (en) Wireless communication method, terminal equipment and network equipment
CN115699656A (en) Wireless communication method, terminal equipment and network equipment
CN111434065B (en) Method for transmitting uplink data, terminal equipment and network equipment
CN115362729A (en) Side feedback information processing method, terminal equipment and network equipment
CN112640345A (en) Method for determining HARQ-ACK codebook, terminal equipment and network equipment
CN111670596A (en) Channel transmission method and device and computer storage medium
WO2022032515A1 (en) Wireless communication method, terminal device, and network device
CN115804185A (en) Wireless communication method, terminal equipment and network equipment
CN116250310A (en) Information transmission method, terminal equipment and network equipment
CN116210314A (en) Wireless communication method, terminal device and network device
CN115299082A (en) Wireless communication method, terminal equipment and network equipment
CN115668836B (en) Wireless communication method, terminal device and network device
CN113765642B (en) HARQ codebook determination method, terminal equipment and network equipment
CN113691355B (en) Information feedback method and equipment
CN111869146B (en) Wireless communication method, terminal equipment and network equipment
CN116210268A (en) Wireless communication method, terminal device and network device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination