Uplink channel transmission method, uplink channel receiving method, uplink channel transmission device, uplink channel receiving device, terminal and network equipment

Abstract

Provided in an embodiment of the present application are an uplink channel transmission method and device, a receiving method and device, a terminal, and a network device, the method comprising: a terminal sending a first PUSCH, the first PUSCH comprising first information, the first information being used for indicating a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located behind a second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, the first PUSCH and the second PUSCH meet a first condition, and the first condition is a condition related to time.

Description

Uplink channel transmission method and receiving method, device, terminal, and network equipment Technical Field

[0001] The embodiments of the present application relate to the field of mobile communication technology, and specifically to a transmission method and a receiving method, an apparatus, a terminal, and a network device for an uplink channel. Background Art

[0002] The Physical Uplink Shared Channel (PUSCH) supports a semi-static periodic transmission mode, namely the configured grant PUSCH transmission mode. Within a Configured Grant (CG) period, one or more PUSCH occasions can be configured for PUSCH transmission. In other words, one or more PUSCHs can be transmitted within a CG period.

[0003] How to determine the Hybrid Automatic Repeat reQuest (HARQ) process number corresponding to the PUSCH to ensure that the transmission of the PUSCH does not conflict with other PUSCHs needs to be solved.

[0004] Summary of the Invention

[0005] Embodiments of the present application provide an uplink channel transmission method and reception method, apparatus, terminal, network equipment, chip, computer-readable storage medium, computer program product, and computer program.

[0006] The embodiment of the present application provides a method for transmitting an uplink channel, including:

[0007] The terminal sends a first PUSCH, which includes first information, and the first information is used to indicate the first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, and the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet the first condition, which is a time-related condition.

[0008] The embodiment of the present application provides a method for transmitting an uplink channel, including:

[0009] If the terminal determines that there is a valid HARQ process, the terminal sends the first PUSCH based on the valid HARQ process; and / or if the terminal determines that there is no valid HARQ process, the terminal does not send the first PUSCH;

[0010] The valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a first condition, and the first condition is a time-related condition.

[0011] The embodiment of the present application provides a method for transmitting an uplink channel, including:

[0012] The terminal sends a first PUSCH and / or a second PUSCH, the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0013] The embodiment of the present application provides a method for receiving an uplink channel, including:

[0014] The network device receives the first PUSCH sent by the terminal, where the first PUSCH includes first information, and the first information is used to indicate the first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, and the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet the first condition, which is a time-related condition.

[0015] The embodiment of the present application provides a method for receiving an uplink channel, including:

[0016] The network device receives the first PUSCH and / or second PUSCH sent by the terminal, the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0017] An uplink channel transmission device provided in an embodiment of the present application is applied to a terminal, and the device includes:

[0018] A sending unit is used to send a first PUSCH, where the first PUSCH includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

[0019] An uplink channel transmission device provided in an embodiment of the present application is applied to a terminal, and the device includes:

[0020] a sending unit, configured to send a first PUSCH based on a valid HARQ process if there is one; and / or not send the first PUSCH if there is no valid HARQ process;

[0021] The valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a first condition, and the first condition is a time-related condition.

[0022] An uplink channel transmission device provided in an embodiment of the present application is applied to a terminal, and the device includes:

[0023] A sending unit is used to send a first PUSCH and / or a second PUSCH, where the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0024] An uplink channel receiving device provided in an embodiment of the present application is applied to a network device, and the device includes:

[0025] A receiving unit is used to receive a first PUSCH sent by a terminal, where the first PUSCH includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

[0026] An uplink channel receiving device provided in an embodiment of the present application is applied to a network device, and the device includes:

[0027] A receiving unit is used to receive a first PUSCH and / or a second PUSCH sent by a terminal, where the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0028] The terminal provided in the embodiment of the present application includes a processor and a memory. The memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory to execute the above-mentioned uplink channel transmission method.

[0029] The network device provided in the embodiment of the present application includes a processor and a memory. The memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory to perform the above-mentioned uplink channel receiving method.

[0030] The chip provided in the embodiments of the present application is used to implement the above-mentioned uplink channel transmission method or uplink channel reception method.

[0031] Specifically, the chip includes: a processor configured to call and run a computer program from a memory, so that a device equipped with the chip executes the above-mentioned uplink channel transmission method or uplink channel reception method.

[0032] The computer-readable storage medium provided in the embodiments of the present application is used to store a computer program, which enables a computer to execute the above-mentioned uplink channel transmission method or uplink channel reception method.

[0033] The computer program product provided in the embodiments of the present application includes computer program instructions, which enable a computer to execute the above-mentioned uplink channel transmission method or uplink channel reception method.

[0034] The computer program provided in the embodiments of the present application, when executed on a computer, enables the computer to execute the above-mentioned uplink channel transmission method or uplink channel reception method.

[0035] Through the above technical solution, on the one hand, when the terminal indicates the first HARQ process number corresponding to the first PUSCH through the first information in the first PUSCH, the first PUSCH and the second PUSCH using the first HARQ process number satisfy a certain constraint relationship (i.e., the first condition), thereby ensuring that the transmission of the first PUSCH and the second PUSCH does not conflict. On the other hand, the terminal uses a valid HARQ process to send the first PUSCH, and the valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH satisfy the first condition; for the idle HARQ process, since the HARQ process used by the first PUSCH is not occupied by other PUSCHs, it can be ensured that the transmission of the first PUSCH and the other PUSCHs does not conflict; for the occupied HARQ process, it is limited that the PUSCH corresponding to the occupied HARQ process and the first PUSCH satisfy a certain constraint relationship (i.e., the first condition), thereby ensuring that the transmission of the first PUSCH and the other PUSCHs does not conflict. On the other hand, different PUSCHs use different methods to determine the HARQ process number. The HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the HARQ process number corresponding to the second PUSCH is indicated by the terminal through the first information. In this way, it can also ensure to a certain extent that the first PUSCH and the second PUSCH use different HARQ process numbers, thereby ensuring that the transmission of the first PUSCH and the second PUSCH will not conflict in time; in addition, for the first PUSCH, since there is no need to indicate the HARQ process number through information, uplink overhead can be saved. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0037] FIG1 is a schematic diagram of an application scenario of an embodiment of the present application;

[0038] FIG2 is a schematic diagram 1 of PUSCH opportunities within a cycle provided by an embodiment of the present application;

[0039] FIG3 is a flowchart of a method for transmitting and / or receiving an uplink channel according to an embodiment of the present application;

[0040] FIG4 is a second flow chart of the uplink channel transmission method provided in an embodiment of the present application;

[0041] FIG5 is a third flow chart of a method for transmitting and / or receiving an uplink channel provided in an embodiment of the present application;

[0042] FIG6 is a second schematic diagram of PUSCH opportunities within a cycle provided by an embodiment of the present application;

[0043] FIG7 is a first schematic diagram of the structure of the transmission device of the uplink channel provided in an embodiment of the present application;

[0044] FIG8 is a second schematic diagram of the structure of the transmission device of the uplink channel provided in an embodiment of the present application;

[0045] FIG9 is a third schematic diagram of the structure of the transmission device of the uplink channel provided in an embodiment of the present application;

[0046] FIG10 is a schematic diagram of the first structure of a receiving device for an uplink channel according to an embodiment of the present application;

[0047] FIG11 is a second schematic diagram of the structure of the uplink channel receiving device provided in an embodiment of the present application;

[0048] FIG12 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0049] FIG13 is a schematic structural diagram of a chip according to an embodiment of the present application. DETAILED DESCRIPTION

[0050] The following will describe the technical solutions in the embodiments of this application in conjunction with the drawings in the embodiments of this application. Obviously, the embodiments described are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0051] FIG1 is a schematic diagram of an application scenario of an embodiment of the present application.

[0052] As shown in Figure 1, a communication system 100 may include a terminal 110 and a network device 120. The network device 120 may communicate with the terminal 110 via an air interface. The terminal 110 and the network device 120 support multi-service transmission.

[0053] It should be understood that the embodiments of the present application are only illustrative of the communication system 100, but the embodiments of the present application are not limited thereto. That is, the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: Long Term Evolution (LTE) system, LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Internet of Things (IoT) system, Narrow Band Internet of Things (NB-IoT) system, enhanced Machine-Type Communications (eMTC) system, 5G communication system (also known as New Radio (NR) communication system), or future communication systems.

[0054] 1 , the network device 120 may be an access network device that communicates with the terminal 110. The access network device may provide communication coverage for a specific geographical area and may communicate with the terminal 110 (eg, UE) located within the coverage area.

[0055] The network device 120 may be an evolved Node B (eNB or eNodeB) in a Long Term Evolution (LTE) system, or a Next Generation Radio Access Network (NG RAN) device, or a base station (gNB) in an NR system, or a wireless controller in a Cloud Radio Access Network (CRAN), or the network device 120 may be a relay station, an access point, an in-vehicle device, a wearable device, a hub, a switch, a bridge, a router, or a network device in a future evolved Public Land Mobile Network (PLMN), etc.

[0056] The terminal 110 may be any terminal, including but not limited to a terminal connected to the network device 120 or other terminals by wired or wireless means.

[0057] For example, the terminal 110 may refer to an access terminal, user equipment (UE), a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user device. An access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, an IoT device, a satellite handheld terminal, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal in a 5G network or a terminal in a future evolution network, etc.

[0058] The terminal 110 may be used for device-to-device (D2D) communication.

[0059] The wireless communication system 100 may further include a core network device 130 for communicating with the base station. The core network device 130 may be a 5G core network (5G Core, 5GC) device, such as an Access and Mobility Management Function (AMF), an Authentication Server Function (AUSF), a User Plane Function (UPF), or a Session Management Function (SMF). Optionally, the core network device 130 may also be an Evolved Packet Core (EPC) device of an LTE network, such as a Session Management Function + Core Packet Gateway (SMF+PGW-C) device. It should be understood that SMF+PGW-C can simultaneously implement the functions that can be implemented by SMF and PGW-C. During the network evolution process, the above-mentioned core network device may also be called other names, or a new network entity may be formed by dividing the functions of the core network, which is not limited in the embodiments of the present application.

[0060] The functional units in the communication system 100 may also establish connections and implement communication via next generation (NG) network interfaces.

[0061] For example, the terminal establishes an air interface connection with the access network device through the NR interface for transmitting user plane data and control plane signaling; the terminal can establish a control plane signaling connection with the AMF through the NG interface 1 (referred to as N1); the access network device, such as the next generation wireless access base station (gNB), can establish a user plane data connection with the UPF through the NG interface 3 (referred to as N3); the access network device can establish a control plane signaling connection with the AMF through the NG interface 2 (referred to as N2); the UPF can establish a control plane signaling connection with the SMF through the NG interface 4 (referred to as N4); the UPF can exchange user plane data with the data network through the NG interface 6 (referred to as N6); the AMF can establish a control plane signaling connection with the SMF through the NG interface 11 (referred to as N11); the SMF can establish a control plane signaling connection with the PCF through the NG interface 7 (referred to as N7).

[0062] Figure 1 exemplarily shows a base station, a core network device and two terminals. Optionally, the wireless communication system 100 may include multiple base station devices and each base station may include other numbers of terminals within its coverage area, which is not limited in the embodiments of the present application.

[0063] It should be noted that Figure 1 is merely an example of a system applicable to this application. Of course, the methods described in the embodiments of this application can also be applied to other systems. Furthermore, the terms "system" and "network" are often used interchangeably herein. The term "and / or" herein simply describes an association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, the character " / " generally indicates that the associated objects are in an "or" relationship. It should also be understood that the "indication" mentioned in the embodiments of this application can be a direct indication, an indirect indication, or an indication of an association relationship. For example, "A indicates B" can mean that A directly indicates B, for example, B can obtain information through A; it can also mean that A indirectly indicates B, for example, A indicates C, and B can obtain information through C; or it can mean that A and B have an association relationship. It should also be understood that the "correspondence" mentioned in the embodiments of this application can mean that there is a direct or indirect correspondence between two objects, or that there is an association relationship between the two objects, or a relationship between an indicator and the indicated, a configuration and the configured, and so on. It should also be understood that the “predefined” or “predefined rules” mentioned in the embodiments of the present application can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, including a terminal and a network device), and the present application does not limit its specific implementation method. For example, predefined can refer to a definition in a protocol. It should also be understood that in the embodiments of the present application, the “protocol” may refer to a standard protocol in the field of communications, for example, it may include an LTE protocol, an NR protocol, and related protocols used in future communication systems, and the present application does not limit this.

[0064] To facilitate understanding of the technical solutions of the embodiments of the present application, the relevant technologies of the embodiments of the present application are described below. The following relevant technologies can be arbitrarily combined with the technical solutions of the embodiments of the present application as optional solutions, and they all fall within the protection scope of the embodiments of the present application.

[0065] CG PUSCH

[0066] PUSCH supports semi-static periodic transmission, also known as configured grant PUSCH transmission. Specifically, there are two types:

[0067] Type-1CG: After the base station configures PUSCH transmission parameters through Radio Resource Control (RRC) signaling, the configuration takes effect without the need to activate it through Downlink Control Information (DCI).

[0068] Type 2CG (type-2CG): After the base station configures PUSCH transmission parameters through RRC signaling, it needs to be activated through DCI for the configuration to take effect.

[0069] CG supports symbol-level and slot-level periodicity, such as periods of {2,7} symbols and periods of {1,2,4,5,8,10,16,20,32,40...} slots. One or more PUSCH occasions can be configured within a CG period. PUSCH occasions are used for CG PUSCH transmission. That is, one or more CG PUSCHs can be transmitted within a CG period.

[0070] The HARQ process number corresponding to the CG PUSCH is determined according to the first time domain symbol (hereinafter referred to as symbol) occupied by the CG PUSCH (or the PUSCH opportunity where the CG PUSCH is located) and one of the following two formulas:

[0071] HARQ Process ID=[floor(CURRENT_symbol / periodicity)]modulo nrofHARQ-Processes

[0072] HARQ Process ID=[floor(CURRENT_symbol / periodicity)]modulo nrofHARQ-Processes+

[0073] harq-ProcID-Offset2

[0074] Wherein, HARQ Process ID represents the HARQ process number; periodicity represents the CG period; nrofHARQ-Processes represents the number of HARQ processes, which can be configured by the base station; harq-ProcID-Offset2 represents the HARQ process number offset, which can be configured by the base station; floor represents the floor operation, and modulo represents the remainder operation; CURRENT_symbol is determined based on the following formula:

[0075] CURRENT_symbol=(SFN×numberOfSlotsPerFrame×numberOfSymbolsPerSlot+slot number in the frame×numberOfSymbolsPerSlot+symbol number in the slot)

[0076] Among them, SFN represents the radio frame number, numberOfSlotsPerFrame represents the number of time slots included in a radio frame, numberOfSymbolsPerSlot represents the number of symbols included in a time slot, slot number in the frame represents the time slot number of the first time domain symbol occupied by CG PUSCH, and symbol number in the slot represents the symbol number of the first time domain symbol occupied by CG PUSCH.

[0077] CG-UCI

[0078] In order to support the transmission of CG PUSCH on the unlicensed band, the configuration authorization uplink control information (CG-Uplink Control Information, CG-UCI) is introduced. For the CG PUSCH transmitted on the unlicensed band, its corresponding HARQ process number is no longer determined according to the time domain resources it occupies. The terminal embeds CG-UCI in the transmitted CG PUSCH, and notifies the base station of the HARQ process number, redundancy version (Redundancy Version, RV), new data indicator (New data indicator), and channel occupancy time (COT) sharing information corresponding to the current CG PUSCH through CG-UCI. Among them, the information field in CG-UCI includes HARQ process number information field, redundancy version information field, new data indication information field and channel occupancy time sharing information information field. The technical solution of the embodiment of the present application mainly focuses on the HARQ process number information field, and the bit length of this information field is 4 bits.

[0079] XR

[0080] Research projects in extended reality (XR) include scenarios such as augmented reality (AR), virtual reality (VR), mixed reality (MR), and cloud gaming (CG). A key XR service is video streaming, whose arrival rates (measured in frames per second) can be 30fps, 60fps, 90fps, and 120fps. The corresponding video stream periods are 33.33ms, 16.67ms, 11.11ms, and 8.33ms.

[0081] XR data is characterized by variable packet sizes and a large average. For AR / VR data at a 100Mbps data rate, for example, the average uplink packet size is 20,833 bytes, the maximum is 31,250 bytes, and the minimum is 10,417 bytes. This means that the size of the packet to be transmitted in each cycle is between [10,417 bytes and 31,250 bytes]. In a real-world system with 100Mbps bandwidth, transmitting a 20,833-byte packet requires approximately four time slots of transmission resources.

[0082] To accommodate the characteristics of XR data, multiple PUSCH opportunities can be configured within a CG cycle to transmit large amounts of XR data. Furthermore, when the amount of data within a CG cycle is relatively small and does not require all pre-configured PUSCH opportunities, the terminal can dynamically notify the base station of unused PUSCH opportunities within the week. The base station can then reallocate the unused PUSCH opportunities to other terminals for data transmission, thereby improving system efficiency.

[0083] When multiple PUSCH opportunities are configured in a CG cycle, if the working mechanism of CG PUSCH on the licensed carrier is used, then multiple PUSCH opportunities in a CG cycle correspond to the same HARQ process number. Even if the working mechanism of CG PUSCH on the unlicensed carrier is used, different PUSCH opportunities in a CG cycle may correspond to the same HARQ process number. Referring to Figure 2, PUSCH opportunity 1 uses HARQ process number X, and PUSCH opportunity 2 also uses HARQ process number X. Because when PUSCH opportunity 2 uses HARQ process number X, the buffer of HARQ process number X stores the new data block transmitted on PUSCH opportunity 2, and the data transmitted on PUSCH opportunity 1 is cleared, resulting in the data block transmitted on PUSCH opportunity 1 being unable to support HARQ retransmission.

[0084] How to determine the HARQ process number corresponding to the PUSCH to ensure that the transmission of the PUSCH does not conflict with other PUSCHs needs to be solved. To this end, the following technical solutions of the embodiments of the present application are proposed.

[0085] To facilitate understanding of the technical solutions of the embodiments of the present application, the technical solutions of the present application are described in detail below through specific embodiments. The above related technologies can be combined arbitrarily with the technical solutions of the embodiments of the present application as optional solutions, and all of them fall within the scope of protection of the embodiments of the present application. The embodiments of the present application include at least part of the following contents.

[0086] It should be noted that the "cycle" described in the embodiments of the present application refers to the "CG cycle". For the understanding of the "CG cycle", please refer to the aforementioned related schemes.

[0087] It should be noted that the “symbol” described in the embodiments of the present application refers to a “time domain symbol”, such as an OFDM symbol.

[0088] It should be noted that the “PUSCH opportunity” described in the embodiments of the present application may also be replaced by “PUSCH resource”.

[0089] It should be noted that the “HARQ process / HARQ process number corresponding to the PUSCH” described in the embodiments of the present application can also be replaced by “HARQ process / HARQ process number corresponding to the PUSCH opportunity”.

[0090] FIG3 is a flowchart of a method for transmitting and / or receiving an uplink channel provided in an embodiment of the present application. As shown in FIG3 , the method for transmitting and / or receiving an uplink channel includes at least one of the following steps:

[0091] Step 301: The terminal sends a first PUSCH, which includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

[0092] Step 302: The network device receives the first PUSCH sent by the terminal.

[0093] In some embodiments, the first PUSCH is a CG PUSCH, and the second PUSCH is a CG PUSCH. In this case, the first PUSCH includes first information, the first information being used to indicate a first HARQ process number corresponding to the first PUSCH; and the second PUSCH includes second information, the second information being used to indicate a first HARQ process number corresponding to the second PUSCH.

[0094] In some embodiments, the first PUSCH is a CG PUSCH and the second PUSCH is a dynamically scheduled PUSCH. In this case, the first PUSCH includes first information, where the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; the first HARQ process number corresponding to the second PUSCH is indicated in scheduling signaling when the base station schedules the second PUSCH.

[0095] In the embodiment of the present application, the first PUSCH being located after the second PUSCH means that: the time domain position corresponding to the first PUSCH is located after the time domain position corresponding to the second PUSCH; or, the transmission time of the first PUSCH is located after the transmission time of the second PUSCH.

[0096] In some embodiments, the first PUSCH is used to transmit a new data block.

[0097] In an embodiment of the present application, when the terminal indicates the first HARQ process number corresponding to the first PUSCH through the first information in the first PUSCH, the first PUSCH and other second PUSCHs using the first HARQ process number satisfy a certain constraint relationship (that is, the first condition), thereby ensuring that the transmission of the first PUSCH and the second PUSCH will not conflict.

[0098] In some embodiments, the first condition includes at least one of the following:

[0099] Condition A: The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value;

[0100] Condition B: The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

[0101] Condition B may also be described as: the terminal does not expect that the PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

[0102] Condition A can be described as follows:

[0103] Option 1

[0104] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to: an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH.

[0105] Here, as an implementation manner, the time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located. As another implementation manner, the time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

[0106] Here, as an implementation manner, the time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located. As another implementation manner, the time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

[0107] In some implementations, the time interval between the first PUSCH and the second PUSCH may include the following options:

[0108] Option 1-1: the interval between the time slot where the last symbol occupied by the first PUSCH is located and the time slot where the last symbol occupied by the second PUSCH is located.

[0109] Option 1-2: the interval between the time slot where the first symbol occupied by the first PUSCH is located and the time slot where the last symbol occupied by the second PUSCH is located.

[0110] Option 1-3: the interval between the time slot where the first symbol occupied by the first PUSCH is located and the time slot where the first symbol occupied by the second PUSCH is located.

[0111] Option 1-4: the interval between the time slot where the last symbol occupied by the first PUSCH is located and the time slot where the first symbol occupied by the second PUSCH is located.

[0112] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0113] Mode 1-1: The number of the timestamp occupied by the second PUSCH is n, and the number of the timestamp occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or

[0114] Mode 1-2: The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or

[0115] Mode 1-3: The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or

[0116] Mode 1-4: The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

[0117] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0118] Mode 1-5: The timestamp occupied by the second PUSCH is numbered n, and the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or

[0119] Mode 1-6: The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist within x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH within x timestamps before the timestamp numbered m, where x is a predetermined value; or

[0120] Mode 1-7: The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or

[0121] Mode 1-8: The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in the x time slots before time slot m, or the terminal is not expected to send the second PUSCH in the x time slots before time slot m, where x is a predetermined value.

[0122] It should be noted that any of the above methods 1-1 to 1-8 can be combined with any of the above options 1-1 to 1-4. The following lists examples of combining some of the methods with some of the options.

[0123] In one example, the time slot where the last symbol occupied by the second PUSCH is time slot n, and the time slot where the last symbol occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value. This example combines the above methods 1-3 and the above option 1-1.

[0124] In one example, the time slot where the last symbol occupied by the first PUSCH is time slot m, and the time slot where the last symbol occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value. This example combines the above methods 1-4 and the above option 1-1.

[0125] In one example, the time slot where the last symbol occupied by the first PUSCH is time slot m, and the second PUSCH does not exist within x time slots before time slot m, or the terminal is not expected to send the second PUSCH within x time slots before time slot m, where x is a predetermined value. This example combines the above-mentioned methods 1-8 and the above-mentioned option 1-1.

[0126] In one example, the time slot where the last symbol occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal does not send the first PUSCH within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value. This example combines the above-mentioned methods 1-7 and the above-mentioned option 1-1.

[0127] Option 2

[0128] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to: a time interval between symbols occupied by the first PUSCH and symbols occupied by the second PUSCH.

[0129] Here, as an implementation manner, the symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH. As another implementation manner, the symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

[0130] Here, as an implementation manner, the symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH. As another implementation manner, the symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

[0131] In some implementations, the time interval between the first PUSCH and the second PUSCH may include the following options:

[0132] Option 2-1: the interval between the last symbol occupied by the first PUSCH and the last symbol occupied by the second PUSCH.

[0133] Option 2-2: the interval between the first symbol occupied by the first PUSCH and the last symbol occupied by the second PUSCH.

[0134] Option 2-3: the interval between the first symbol occupied by the first PUSCH and the first symbol occupied by the second PUSCH.

[0135] Option 2-4: the interval between the last symbol occupied by the first PUSCH and the first symbol occupied by the second PUSCH.

[0136] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0137] Mode 2-1: The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or

[0138] Mode 2-2: The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or

[0139] Mode 2-3: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is not earlier than the xth symbol after the symbol P, where x is a predetermined value; or

[0140] Mode 2-4: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

[0141] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0142] Mode 2-5: The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or

[0143] Mode 2-6: The symbol occupied by the first PUSCH is numbered Q, and the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or

[0144] Mode 2-7: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or

[0145] Mode 2-8: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

[0146] It should be noted that any of the above methods 2-1 to 2-8 can be combined with any of the above options 2-1 to 2-4. The following lists examples of combining some of the methods with some of the options.

[0147] In one example, the last symbol occupied by the second PUSCH is symbol P, and the last symbol occupied by the first PUSCH is no earlier than the xth symbol after symbol P, where x is a predetermined value. This example combines the above-mentioned method 2-3 and the above-mentioned option 2-1.

[0148] In one example, the last symbol occupied by the first PUSCH is symbol Q, and the last symbol occupied by the second PUSCH is no later than the xth symbol before symbol Q, where x is a predetermined value. This example combines the above methods 2-4 and the above option 1-1.

[0149] In one example, the last symbol occupied by the first PUSCH is symbol Q, and the second PUSCH does not exist within x symbols before symbol Q, or the terminal is not expected to send the second PUSCH within x symbols before symbol Q, where x is a predetermined value. This example combines the above-mentioned method 2-8 and the above-mentioned option 2-1.

[0150] In one example, the last symbol occupied by the second PUSCH is symbol P, and the first PUSCH does not exist within x symbols after symbol P, or the terminal does not send the first PUSCH within x symbols after symbol P, or the terminal is not expected to send the first PUSCH within x symbols after symbol P, where x is a predetermined value. This example combines the above-mentioned method 2-7 and the above-mentioned option 2-1.

[0151] In some implementations, the predetermined value in the above solution is configured by the network or agreed upon by a protocol.

[0152] In some implementations, the predetermined value in the above solution is related to the number of HARQ processes configured by the network. Here, the number of HARQ processes configured by the network refers to the number of HARQ processes configured by the network device for the terminal. For example, when the number of HARQ processes configured by the network is large, the corresponding predetermined value is also large.

[0153] According to the technical solution of the embodiment of the present application, when the terminal determines the HARQ process number corresponding to the PUSCH by itself, the PUSCH and the PUSCH that has already used the HARQ process number satisfy the time constraint relationship, thereby ensuring that the previous transmission corresponding to the HARQ process number has sufficient time for HARQ retransmission, thereby improving transmission reliability and avoiding the reduction in system efficiency caused by the introduction of high-level data retransmission (ARQ).

[0154] FIG4 is a second flow diagram of the uplink channel transmission method provided in an embodiment of the present application. As shown in FIG4 , the uplink channel transmission method includes the following steps:

[0155] Step 401: If the terminal determines that there is a valid HARQ process, the terminal sends a first PUSCH based on the valid HARQ process; and / or, if the terminal determines that there is no valid HARQ process, the terminal does not send the first PUSCH; wherein the valid HARQ process includes an idle HARQ process and / or an occupied HARQ process and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a first condition, and the first condition is a time-related condition.

[0156] In the embodiment of the present application, when the terminal needs to send the first PUSCH, if there is no valid HARQ process, the terminal does not send the first PUSCH, or abandons sending the first PUSCH, or cancels sending the first PUSCH, or delays sending the first PUSCH, or drops sending the first PUSCH, or skips sending the first PUSCH. In short, for the first PUSCH, if there is no valid HARQ process, the terminal does not send the first PUSCH. If there is a valid HARQ process, the terminal uses the valid HARQ process to send the first PUSCH.

[0157] In some embodiments, the first PUSCH is a CG PUSCH, and the second PUSCH is a CG PUSCH. In this case, the first PUSCH includes first information, the first information being used to indicate a first HARQ process number corresponding to the first PUSCH; and the second PUSCH includes second information, the second information being used to indicate a first HARQ process number corresponding to the second PUSCH.

[0158] In some embodiments, the first PUSCH is a CG PUSCH and the second PUSCH is a dynamically scheduled PUSCH. In this case, the first PUSCH includes first information, where the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; the first HARQ process number corresponding to the second PUSCH is indicated in scheduling signaling when the base station schedules the second PUSCH.

[0159] In some embodiments, the first PUSCH is used to transmit a new data block.

[0160] In the embodiment of the present application, the terminal uses a valid HARQ process to send a first PUSCH, and the valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet the first condition; for the idle HARQ process, since the HARQ process used by the first PUSCH is not occupied by other PUSCHs, it can be ensured that the transmission of the first PUSCH and the other PUSCHs will not conflict; for the occupied HARQ process, it is limited that the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a certain constraint relationship (that is, the first condition), thereby ensuring that the transmission of the first PUSCH and the other PUSCHs will not conflict. For ease of description, the PUSCH corresponding to the occupied HARQ process is referred to as the second PUSCH.

[0161] In some embodiments, the first condition includes at least one of the following:

[0162] Condition A: The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value;

[0163] Condition B: The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

[0164] Condition B may also be described as: the terminal does not expect that the PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

[0165] Condition A can be described as follows:

[0166] Option 1

[0167] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to: an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH.

[0168] Here, as an implementation manner, the time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located. As another implementation manner, the time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

[0169] Here, as an implementation manner, the time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located. As another implementation manner, the time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

[0170] In some implementations, the time interval between the first PUSCH and the second PUSCH may include the following options:

[0171] Option 1-1: the interval between the time slot where the last symbol occupied by the first PUSCH is located and the time slot where the last symbol occupied by the second PUSCH is located.

[0172] Option 1-2: the interval between the time slot where the first symbol occupied by the first PUSCH is located and the time slot where the last symbol occupied by the second PUSCH is located.

[0173] Option 1-3: the interval between the time slot where the first symbol occupied by the first PUSCH is located and the time slot where the first symbol occupied by the second PUSCH is located.

[0174] Option 1-4: the interval between the time slot where the last symbol occupied by the first PUSCH is located and the time slot where the first symbol occupied by the second PUSCH is located.

[0175] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (ie, described as):

[0176] Mode 1-1: The number of the timestamp occupied by the second PUSCH is n, and the number of the timestamp occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or

[0177] Mode 1-2: The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or

[0178] Mode 1-3: The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or

[0179] Mode 1-4: The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

[0180] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0181] Mode 1-5: The timestamp occupied by the second PUSCH is numbered n, and the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or

[0182] Mode 1-6: The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist within x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH within x timestamps before the timestamp numbered m, where x is a predetermined value; or

[0183] Mode 1-7: The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or

[0184] Mode 1-8: The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in the x time slots before time slot m, or the terminal is not expected to send the second PUSCH in the x time slots before time slot m, where x is a predetermined value.

[0185] It should be noted that any of the above methods 1-1 to 1-8 can be combined with any of the above options 1-1 to 1-4. The following lists examples of combining some of the methods with some of the options.

[0186] In one example, the time slot where the last symbol occupied by the second PUSCH is time slot n, and the time slot where the last symbol occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value. This example combines the above methods 1-3 and the above option 1-1.

[0187] In one example, the time slot where the last symbol occupied by the first PUSCH is time slot m, and the time slot where the last symbol occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value. This example combines the above methods 1-4 and the above option 1-1.

[0188] In one example, the time slot where the last symbol occupied by the first PUSCH is time slot m, and the second PUSCH does not exist within x time slots before time slot m, or the terminal is not expected to send the second PUSCH within x time slots before time slot m, where x is a predetermined value. This example combines the above-mentioned methods 1-8 and the above-mentioned option 1-1.

[0189] In one example, the time slot where the last symbol occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal does not send the first PUSCH within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value. This example combines the above-mentioned methods 1-7 and the above-mentioned option 1-1.

[0190] Option 2

[0191] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to: a time interval between symbols occupied by the first PUSCH and symbols occupied by the second PUSCH.

[0192] Here, as an implementation manner, the symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH. As another implementation manner, the symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

[0193] Here, as an implementation manner, the symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH. As another implementation manner, the symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

[0194] In some implementations, the time interval between the first PUSCH and the second PUSCH may include the following options:

[0195] Option 2-1: the interval between the last symbol occupied by the first PUSCH and the last symbol occupied by the second PUSCH.

[0196] Option 2-2: the interval between the first symbol occupied by the first PUSCH and the last symbol occupied by the second PUSCH.

[0197] Option 2-3: the interval between the first symbol occupied by the first PUSCH and the first symbol occupied by the second PUSCH.

[0198] Option 2-4: the interval between the last symbol occupied by the first PUSCH and the first symbol occupied by the second PUSCH.

[0199] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0200] Mode 2-1: The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or

[0201] Mode 2-2: The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or

[0202] Mode 2-3: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is not earlier than the xth symbol after the symbol P, where x is a predetermined value; or

[0203] Mode 2-4: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

[0204] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized (that is, described as):

[0205] Mode 2-5: The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or

[0206] Mode 2-6: The symbol occupied by the first PUSCH is numbered Q, and the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or

[0207] Mode 2-7: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or

[0208] Mode 2-8: The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

[0209] It should be noted that any of the above methods 2-1 to 2-8 can be combined with any of the above options 2-1 to 2-4. The following lists examples of combining some of the methods with some of the options.

[0210] In one example, the last symbol occupied by the second PUSCH is symbol P, and the last symbol occupied by the first PUSCH is no earlier than the xth symbol after symbol P, where x is a predetermined value. This example combines the above-mentioned method 2-3 and the above-mentioned option 2-1.

[0211] In one example, the last symbol occupied by the first PUSCH is symbol Q, and the last symbol occupied by the second PUSCH is no later than the xth symbol before symbol Q, where x is a predetermined value. This example combines the above methods 2-4 and the above option 1-1.

[0212] In one example, the last symbol occupied by the first PUSCH is symbol Q, and the second PUSCH does not exist within x symbols before symbol Q, or the terminal is not expected to send the second PUSCH within x symbols before symbol Q, where x is a predetermined value. This example combines the above-mentioned method 2-8 and the above-mentioned option 2-1.

[0213] In one example, the last symbol occupied by the second PUSCH is symbol P, and the first PUSCH does not exist within x symbols after symbol P, or the terminal does not send the first PUSCH within x symbols after symbol P, or the terminal is not expected to send the first PUSCH within x symbols after symbol P, where x is a predetermined value. This example combines the above-mentioned method 2-7 and the above-mentioned option 2-1.

[0214] In some implementations, the predetermined value in the above solution is configured by the network or agreed upon by a protocol.

[0215] In some implementations, the predetermined value in the above solution is related to the number of HARQ processes configured by the network. For example, when the number of HARQ processes configured by the network is large, the corresponding predetermined value is also large.

[0216] In one example, the network configures N HARQ processes for the terminal, all N HARQ processes are occupied, and the PUSCH corresponding to each HARQ process in the N HARQ processes and the first PUSCH do not meet the first condition. Then there is no valid HARQ process, the terminal does not send the first PUSCH, or the terminal does not transmit a new data block through the first PUSCH.

[0217] According to the technical solution of the embodiment of the present application, when the terminal determines the HARQ process number corresponding to the PUSCH by itself, the PUSCH and the PUSCH that has already used the HARQ process number satisfy the time constraint relationship, thereby ensuring that the previous transmission corresponding to the HARQ process number has sufficient time for HARQ retransmission, thereby improving transmission reliability and avoiding the reduction in system efficiency caused by the introduction of high-level data retransmission (ARQ).

[0218] FIG5 is a third flow chart of a method for transmitting and / or receiving an uplink channel provided in an embodiment of the present application. As shown in FIG5 , the method for transmitting and / or receiving an uplink channel includes at least one of the following steps:

[0219] Step 501: The terminal sends a first PUSCH and / or a second PUSCH, the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0220] Step 502: The network device receives the first PUSCH and / or the second PUSCH sent by the terminal.

[0221] In some embodiments, the first PUSCH is a CG PUSCH.

[0222] In some embodiments, the second PUSCH is a CG PUSCH.

[0223] In some implementations, the PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

[0224] In some implementations, the PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity in a period; or, the PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity actually sent in a period.

[0225] In an embodiment of the present application, different PUSCHs use different methods to determine the HARQ process number. The HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the HARQ process number corresponding to the second PUSCH is indicated by the terminal through the second information. In this way, it can also be ensured to a certain extent that the first PUSCH and the second PUSCH use different HARQ process numbers, thereby ensuring that the transmission of the first PUSCH and the second PUSCH will not conflict in time; in addition, for the first PUSCH, since there is no need to indicate the HARQ process number through information, uplink overhead can be saved.

[0226] In some implementations, the HARQ process number corresponding to the first PUSCH is determined based on the time domain resources occupied by the first PUSCH and according to a preset formula.

[0227] Here, as an implementation manner, the time domain resource occupied by the first PUSCH refers to: the first symbol occupied by the first PUSCH.

[0228] Here, as an implementation manner, the preset formula is configured by the network or agreed upon by a protocol.

[0229] Here, the method of “determining the HARQ process number based on a predetermined rule” can also be understood as the method of “implicitly determining the HARQ process number”.

[0230] In one example, the terminal determines the HARQ process number according to a preset formula based on the time domain resources occupied by the first PUSCH (or the PUSCH opportunity where the first PUSCH is located). Here, the time domain resources may refer to the first time domain symbol. The preset formula may be, but is not limited to, the following formula:

[0231] HARQ Process ID=[floor(CURRENT_symbol / periodicity)]modulo nrofHARQ-Processes

[0232] HARQ Process ID=[floor(CURRENT_symbol / periodicity)]modulo nrofHARQ-Processes+

[0233] harq-ProcID-Offset2

[0234] The meanings of the relevant parameters in the above formula can refer to the description of the aforementioned related technical solutions.

[0235] It should be noted that the formula for determining the HARQ process number may also be a completely new formula, that is, a formula different from the above formula.

[0236] In some implementations, the HARQ process number corresponding to the first PUSCH is a predetermined process number.

[0237] Here, as an implementation manner, the predetermined process number is configured by the network or agreed upon by a protocol.

[0238] In one example, the base station configuration or protocol stipulates that the HARQ process number corresponding to the first PUSCH is Z.

[0239] In some implementations, the second PUSCH includes second UCI information, and a second information field in the second UCI information is used to indicate the second information.

[0240] Here, as an implementation manner, the second information field is the same as the HARQ process number information field.

[0241] In some embodiments, the first PUSCH includes third information, the third information being used to indicate whether K PUSCH opportunities following the PUSCH opportunity where the first PUSCH is located are valid PUSCH opportunities, where K is a positive integer. Here, the valid PUSCH opportunity refers to a PUSCH opportunity that can be used to transmit the second PUSCH.

[0242] In some implementations, the PUSCH opportunity where the first PUSCH is located is in the same period as the K PUSCH opportunities.

[0243] In some implementations, the first PUSCH includes first UCI information, and a first information field in the first UCI information is used to indicate the third information.

[0244] Here, as an implementation manner, the first information field is the same as the HARQ process number information field.

[0245] In one example, referring to Figure 6, the terminal is configured with 4 PUSCH opportunities (or resources) in one cycle. The first PUSCH opportunity is the first PUSCH opportunity (i.e., PUSCH opportunity 1) among the 4 PUSCH opportunities, or the first PUSCH opportunity is the first PUSCH opportunity actually sent among the 4 PUSCH opportunities (i.e., PUSCH opportunity 2). Here, if the data does not reach the terminal at PUSCH opportunity 1, that is, the terminal has no data to transmit, the terminal can abandon PUSCH opportunity 1 and start sending data from PUSCH opportunity 2. In this case, PUSCH opportunity 2 is the first PUSCH opportunity actually sent. The terminal determines the HARQ process number corresponding to the first PUSCH opportunity (i.e., the first PUSCH) based on a predetermined rule or a predetermined process number. Optionally, the first PUSCH includes third information, and the third information is used to indicate whether the K PUSCH opportunities after the first PUSCH opportunity are valid PUSCH opportunities. The terminal sends a second PUSCH through a second PUSCH opportunity, where the second PUSCH includes second information, where the second information is used to indicate a second HARQ process number corresponding to the second PUSCH opportunity (ie, the second PUSCH).

[0246] According to the technical solution of the embodiment of the present application, for the first PUSCH opportunity among multiple PUSCH opportunities within a cycle, the terminal can implicitly determine its corresponding HARQ process number without indicating its corresponding HARQ process number through information, thereby saving uplink overhead.

[0247] The preferred embodiments of the present application are described in detail above in conjunction with the accompanying drawings. However, the present application is not limited to the specific details in the above embodiments. Within the technical concept of the present application, the technical solution of the present application can be subjected to a variety of simple modifications, and these simple modifications all fall within the scope of protection of the present application. For example, the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, the present application will no longer describe the various possible combinations separately. For another example, the various different embodiments of the present application can also be arbitrarily combined, as long as they do not violate the idea of ​​the present application, they should also be regarded as the contents disclosed in the present application. For another example, under the premise of no conflict, the various embodiments and / or the technical features in each embodiment described in the present application can be arbitrarily combined with the prior art, and the technical solution obtained after the combination should also fall within the scope of protection of the present application.

[0248] It should also be understood that in the various method embodiments of the present application, the sequence numbers of the above-mentioned processes do not imply a precedence in the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application. In addition, in the embodiments of the present application, the terms "downlink," "uplink," and "sidelink" are used to indicate the transmission direction of signals or data, where "downlink" is used to indicate the first direction of transmission of signals or data from a site to a user equipment in a cell, "uplink" is used to indicate the second direction of transmission of signals or data from a user equipment in a cell to a site, and "sidelink" is used to indicate the third direction of transmission of signals or data from user equipment 1 to user equipment 2. For example, "downlink signal" indicates that the transmission direction of the signal is the first direction. In addition, in the embodiments of the present application, the term "and / or" is merely a description of the association relationship between associated objects, indicating that three relationships can exist. Specifically, A and / or B can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in this document generally indicates that the associated objects are in an "or" relationship.

[0249] FIG7 is a schematic diagram of the structure of an uplink channel transmission device provided in an embodiment of the present application. As shown in FIG7 , the uplink channel transmission device includes:

[0250] The sending unit 701 is used to send a first PUSCH, where the first PUSCH includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, and the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

[0251] In some embodiments, the first condition includes at least one of the following:

[0252] The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value;

[0253] The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

[0254] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to:

[0255] an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH; or

[0256] The interval between the symbols occupied by the first PUSCH and the symbols occupied by the second PUSCH.

[0257] In some implementations, the time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located; or, the time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

[0258] In some implementations, the time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located; or, the time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

[0259] In some implementations, the symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH; or, the symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

[0260] In some implementations, the symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH; or, the symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

[0261] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0262] The number of the time slot occupied by the second PUSCH is n, and the number of the time slot occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or,

[0263] The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or

[0264] The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or,

[0265] The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

[0266] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0267] The timestamp occupied by the second PUSCH is numbered n, the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or

[0268] The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist in x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH in x timestamps before the timestamp numbered m, where x is a predetermined value; or

[0269] The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or

[0270] The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in x time slots before time slot m, or the terminal is not expected to send the second PUSCH in x time slots before time slot m, where x is a predetermined value.

[0271] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0272] The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or

[0273] The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or

[0274] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is not earlier than the xth symbol after the symbol P, where x is a predetermined value; or

[0275] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

[0276] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0277] The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or

[0278] The symbol occupied by the first PUSCH is numbered Q, the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or

[0279] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or

[0280] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

[0281] In some implementations, the predetermined value is configured by the network or agreed upon by a protocol.

[0282] In some implementations, the value of the predetermined value is related to the number of HARQ processes configured by the network.

[0283] In some embodiments, the first PUSCH is a CG PUSCH.

[0284] In some embodiments, the second PUSCH is a CG PUSCH or a dynamically scheduled PUSCH.

[0285] In some embodiments, the first PUSCH is used to transmit a new data block.

[0286] Those skilled in the art should understand that the description related to the transmission device of the uplink channel in the embodiment of the present application can be understood with reference to the description related to the transmission method of the uplink channel in the embodiment of the present application.

[0287] FIG8 is a second schematic diagram of the structure of the transmission device of the uplink channel provided in an embodiment of the present application, which is applied to a terminal. As shown in FIG8 , the transmission device of the uplink channel includes:

[0288] The sending unit 801 is configured to send a first PUSCH based on a valid HARQ process if there is one; and / or not send the first PUSCH if there is no valid HARQ process;

[0289] The valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a first condition, and the first condition is a time-related condition.

[0290] In some implementations, the PUSCH corresponding to the occupied HARQ process is a second PUSCH; and the first condition includes at least one of the following:

[0291] The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value;

[0292] The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

[0293] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to:

[0294] an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH; or

[0295] The interval between the symbols occupied by the first PUSCH and the symbols occupied by the second PUSCH.

[0296] In some implementations, the time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located; or, the time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

[0297] In some implementations, the time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located; or, the time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

[0298] In some implementations, the symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH; or, the symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

[0299] In some implementations, the symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH; or, the symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

[0300] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0301] The number of the time slot occupied by the second PUSCH is n, and the number of the time slot occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or,

[0302] The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or

[0303] The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or,

[0304] The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

[0305] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0306] The timestamp occupied by the second PUSCH is numbered n, the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or

[0307] The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist in x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH in x timestamps before the timestamp numbered m, where x is a predetermined value; or

[0308] The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or

[0309] The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in x time slots before time slot m, or the terminal is not expected to send the second PUSCH in x time slots before time slot m, where x is a predetermined value.

[0310] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0311] The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or

[0312] The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or

[0313] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is not earlier than the xth symbol after the symbol P, where x is a predetermined value; or

[0314] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

[0315] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0316] The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or

[0317] The symbol occupied by the first PUSCH is numbered Q, the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or

[0318] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or

[0319] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

[0320] In some implementations, the predetermined value is configured by the network or agreed upon by a protocol.

[0321] In some implementations, the value of the predetermined value is related to the number of HARQ processes configured by the network.

[0322] In some embodiments, the second PUSCH is a CG PUSCH or a dynamically scheduled PUSCH.

[0323] In some embodiments, the first PUSCH is a CG PUSCH.

[0324] In some embodiments, the first PUSCH includes first information, where the first information is used to indicate a first HARQ process number corresponding to the first PUSCH.

[0325] In some embodiments, the first PUSCH is used to transmit a new data block.

[0326] Those skilled in the art should understand that the description related to the transmission device of the uplink channel in the embodiment of the present application can be understood with reference to the description related to the transmission method of the uplink channel in the embodiment of the present application.

[0327] FIG9 is a third schematic diagram of the structure of the transmission device of the uplink channel provided in an embodiment of the present application, which is applied to a terminal. As shown in FIG9 , the transmission device of the uplink channel includes:

[0328] The sending unit 901 is used to send a first PUSCH and / or a second PUSCH, where the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0329] In some embodiments, the first PUSCH includes third information, where the third information is used to indicate whether K PUSCH opportunities following the PUSCH opportunity where the first PUSCH is located are valid PUSCH opportunities, where K is a positive integer.

[0330] In some implementations, the valid PUSCH opportunity refers to a PUSCH opportunity that can be used to transmit the second PUSCH.

[0331] In some implementations, the PUSCH opportunity where the first PUSCH is located is in the same period as the K PUSCH opportunities.

[0332] In some implementations, the first PUSCH includes first UCI information, and a first information field in the first UCI information is used to indicate the third information.

[0333] In some implementations, the first information field is the same as the HARQ process number information field.

[0334] In some implementations, the PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

[0335] In some implementations, the PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity in a period; or, the PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity actually sent in a period.

[0336] In some implementations, the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule, including:

[0337] The HARQ process number corresponding to the first PUSCH is determined based on the time domain resources occupied by the first PUSCH according to a preset formula.

[0338] In some implementations, the time domain resource occupied by the first PUSCH refers to: the first symbol occupied by the first PUSCH.

[0339] In some implementations, the preset formula is configured by the network or agreed upon by a protocol.

[0340] In some implementations, the predetermined process number is configured by the network or agreed upon by a protocol.

[0341] In some implementations, the second PUSCH includes second UCI information, and a second information field in the second UCI information is used to indicate the second information.

[0342] In some implementations, the second information field is the same as the HARQ process number information field.

[0343] In some embodiments, the first PUSCH is a weighted CG PUSCH.

[0344] In some embodiments, the second PUSCH is a CG PUSCH.

[0345] Those skilled in the art should understand that the description related to the transmission device of the uplink channel in the embodiment of the present application can be understood with reference to the description related to the transmission method of the uplink channel in the embodiment of the present application.

[0346] FIG10 is a schematic diagram of the structure of the receiving device of the uplink channel provided in an embodiment of the present application. The device is applied to a network device. As shown in FIG10 , the transmission device of the uplink channel includes:

[0347] The receiving unit 1001 is used to receive a first PUSCH sent by the terminal, where the first PUSCH includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, and the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

[0348] In some embodiments, the first condition includes at least one of the following:

[0349] The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value;

[0350] The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

[0351] In some implementations, the time interval between the first PUSCH and the second PUSCH refers to:

[0352] an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH; or

[0353] The interval between the symbols occupied by the first PUSCH and the symbols occupied by the second PUSCH.

[0354] In some implementations, the time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located; or, the time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

[0355] In some implementations, the time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located; or, the time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

[0356] In some implementations, the symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH; or, the symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

[0357] In some implementations, the symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH; or, the symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

[0358] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0359] The number of the time slot occupied by the second PUSCH is n, and the number of the time slot occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or,

[0360] The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or

[0361] The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or,

[0362] The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

[0363] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0364] The timestamp occupied by the second PUSCH is numbered n, the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or

[0365] The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist in x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH in x timestamps before the timestamp numbered m, where x is a predetermined value; or

[0366] The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or

[0367] The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in x time slots before time slot m, or the terminal is not expected to send the second PUSCH in x time slots before time slot m, where x is a predetermined value.

[0368] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0369] The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or

[0370] The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or

[0371] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is not earlier than the xth symbol after the symbol P, where x is a predetermined value; or

[0372] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

[0373] In some embodiments, the time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, characterized by:

[0374] The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or

[0375] The symbol occupied by the first PUSCH is numbered Q, the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or

[0376] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or

[0377] The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

[0378] In some implementations, the predetermined value is configured by the network or agreed upon by a protocol.

[0379] In some implementations, the value of the predetermined value is related to the number of HARQ processes configured by the network.

[0380] In some embodiments, the first PUSCH is a CG PUSCH.

[0381] In some embodiments, the second PUSCH is a CG PUSCH or a dynamically scheduled PUSCH.

[0382] In some embodiments, the first PUSCH is used to transmit a new data block.

[0383] Those skilled in the art should understand that the description related to the uplink channel receiving device in the embodiment of the present application can be understood with reference to the description related to the uplink channel receiving method in the embodiment of the present application.

[0384] FIG11 is a second schematic diagram of the structure of the receiving device of the uplink channel provided in an embodiment of the present application, which is applied to a network device. As shown in FIG11 , the transmission device of the uplink channel includes:

[0385] The receiving unit 1101 is used to receive the first PUSCH and / or the second PUSCH sent by the terminal, where the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

[0386] In some embodiments, the first PUSCH includes third information, where the third information is used to indicate whether K PUSCH opportunities following the PUSCH opportunity where the first PUSCH is located are valid PUSCH opportunities, where K is a positive integer.

[0387] In some implementations, the valid PUSCH opportunity refers to a PUSCH opportunity that can be used to transmit the second PUSCH.

[0388] In some implementations, the PUSCH opportunity where the first PUSCH is located is in the same period as the K PUSCH opportunities.

[0389] In some implementations, the first PUSCH includes first UCI information, and a first information field in the first UCI information is used to indicate the third information.

[0390] In some implementations, the first information field is the same as the HARQ process number information field.

[0391] In some implementations, the PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

[0392] In some implementations, the PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity in a period; or, the PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity actually sent in a period.

[0393] In some implementations, the HARQ process number corresponding to the first PUSCH is determined based on the time domain resources occupied by the first PUSCH and according to a preset formula.

[0394] In some implementations, the time domain resource occupied by the first PUSCH refers to: the first symbol occupied by the first PUSCH.

[0395] In some implementations, the preset formula is configured by the network or agreed upon by a protocol.

[0396] In some implementations, the predetermined process number is configured by the network or agreed upon by a protocol.

[0397] In some implementations, the second PUSCH includes second UCI information, and a second information field in the second UCI information is used to indicate the second information.

[0398] In some implementations, the second information field is the same as the HARQ process number information field.

[0399] In some embodiments, the first PUSCH is a CG PUSCH.

[0400] In some embodiments, the second PUSCH is a CG PUSCH.

[0401] Those skilled in the art should understand that the description related to the uplink channel receiving device in the embodiment of the present application can be understood with reference to the description related to the uplink channel receiving method in the embodiment of the present application.

[0402] Figure 12 is a schematic structural diagram of a communication device 1200 provided in an embodiment of the present application. The communication device 1200 shown in Figure 12 includes a processor 1210, which can call and run a computer program from a memory to implement the method in the embodiment of the present application.

[0403] Optionally, as shown in FIG12 , the communication device 1200 may further include a memory 1220. The processor 1210 may call and execute a computer program from the memory 1220 to implement the method in the embodiment of the present application.

[0404] The memory 1220 may be a separate device independent of the processor 1210 , or may be integrated into the processor 1210 .

[0405] Optionally, as shown in FIG12 , the communication device 1200 may further include a transceiver 1230 , and the processor 1210 may control the transceiver 1230 to communicate with other devices, specifically, to send information or data to other devices, or to receive information or data sent by other devices.

[0406] The transceiver 1230 may include a transmitter and a receiver. The transceiver 1230 may further include an antenna, and the number of antennas may be one or more.

[0407] In some embodiments, the communication device 1200 may specifically be a terminal of an embodiment of the present application, and the communication device 1200 may implement the corresponding processes implemented by the terminal in each method of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0408] In some embodiments, the communication device 1200 may specifically be a network device of an embodiment of the present application, and the communication device 1200 may implement the corresponding processes implemented by the network device in each method of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0409] Figure 13 is a schematic structural diagram of a chip according to an embodiment of the present application. The chip 1300 shown in Figure 13 includes a processor 1310, which can call and run a computer program from a memory to implement the method according to the embodiment of the present application.

[0410] Optionally, as shown in FIG13 , the chip 1300 may further include a memory 1320 , wherein the processor 1310 may call and execute a computer program from the memory 1320 to implement the method in the embodiment of the present application.

[0411] The memory 1320 may be a separate device independent of the processor 1310 , or may be integrated into the processor 1310 .

[0412] Optionally, the chip 1300 may further include an input interface 1330. The processor 1310 may control the input interface 1330 to communicate with other devices or chips, and specifically, may obtain information or data sent by other devices or chips.

[0413] Optionally, the chip 1300 may further include an output interface 1340. The processor 1310 may control the output interface 1340 to communicate with other devices or chips, and specifically, may output information or data to other devices or chips.

[0414] In some embodiments, the chip can be applied to the terminal in the embodiments of the present application, and the chip can implement the corresponding processes implemented by the terminal in each method of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0415] In some embodiments, the chip can be applied to the network device in the embodiments of the present application, and the chip can implement the corresponding processes implemented by the network device in each method of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0416] It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

[0417] It should be understood that the processor of the embodiments of the present application may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiment can be completed by hardware integrated logic circuits in the processor or software instructions. The above processor can be 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, discrete gate or transistor logic devices, or discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0418] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0419] It should be understood that the above-mentioned memories are exemplary but not restrictive. For example, the memories in the embodiments of the present application may also be static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM RAM (DR RAM), etc. In other words, the memories in the embodiments of the present application are intended to include, but are not limited to, these and any other suitable types of memories.

[0420] An embodiment of the present application also provides a computer-readable storage medium for storing a computer program.

[0421] In some embodiments, the computer-readable storage medium can be applied to the terminal in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the terminal in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0422] In some embodiments, the computer-readable storage medium can be applied to the network device in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the network device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0423] An embodiment of the present application also provides a computer program product, including computer program instructions.

[0424] In some embodiments, the computer program product can be applied to the terminal in the embodiments of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the terminal in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0425] In some embodiments, the computer program product can be applied to the network device in the embodiments of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the network device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0426] The embodiment of the present application also provides a computer program.

[0427] In some embodiments, the computer program can be applied to the terminal in the embodiments of the present application. When the computer program runs on the computer, the computer executes the corresponding processes implemented by the terminal in the various methods of the embodiments of the present application. For the sake of brevity, they are not described here.

[0428] In some embodiments, the computer program can be applied to the network device in the embodiments of the present application. When the computer program runs on a computer, the computer executes the corresponding processes implemented by the network device in the various methods of the embodiments of the present application. For the sake of brevity, they are not described here.

[0429] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0430] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0431] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0432] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0433] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0434] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0435] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A method for transmitting an uplink channel, the method comprising: The terminal sends a first physical uplink shared channel PUSCH, where the first PUSCH includes first information, and the first information is used to indicate a first hybrid automatic repeat request HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

2. The method according to claim 1, wherein The first condition includes at least one of the following: The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value; The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

3. The method according to claim 2, wherein: The time interval between the first PUSCH and the second PUSCH refers to: an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH; or The interval between the symbols occupied by the first PUSCH and the symbols occupied by the second PUSCH.

4. The method according to claim 3, wherein: The time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located; or, The time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

5. The method according to claim 3 or 4, wherein: The time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located; or, The time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

6. The method according to claim 3, wherein: The symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH; or, The symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

7. The method according to claim 3 or 6, wherein: The symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH; or, The symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

8. The method according to any one of claims 3 to 7, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The number of the time slot occupied by the second PUSCH is n, and the number of the time slot occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or, The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or, The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

9. The method according to any one of claims 3 to 7, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The timestamp occupied by the second PUSCH is numbered n, the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist in x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH in x timestamps before the timestamp numbered m, where x is a predetermined value; or The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in x time slots before time slot m, or the terminal is not expected to send the second PUSCH in x time slots before time slot m, where x is a predetermined value.

10. The method according to any one of claims 3 to 7, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is no earlier than the xth symbol after the symbol P, where x is a predetermined value; or, The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

11. The method according to any one of claims 3 to 7, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or The symbol occupied by the first PUSCH is numbered Q, the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

12. The method according to any one of claims 2 to 11, wherein The predetermined value is configured by the network or agreed upon by a protocol.

13. The method according to any one of claims 2 to 12, wherein The value of the predetermined value is related to the number of HARQ processes configured by the network.

14. The method according to any one of claims 1 to 13, wherein The first PUSCH is a configuration-granted CG PUSCH.

15. The method according to any one of claims 1 to 14, wherein The second PUSCH is a CG PUSCH or a dynamically scheduled PUSCH.

16. The method according to any one of claims 1 to 15, wherein The first PUSCH is used to transmit a new data block.

17. A method for transmitting an uplink channel, the method comprising: If the terminal determines that there is a valid HARQ process, the terminal sends a first PUSCH based on the valid HARQ process; and / or, if the terminal determines that there is no valid HARQ process, the terminal does not send the first PUSCH; The valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a first condition, and the first condition is a time-related condition.

18. The method according to claim 17, wherein The PUSCH corresponding to the occupied HARQ process is a second PUSCH; and the first condition includes at least one of the following: The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value; The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

19. The method according to claim 18, wherein The time interval between the first PUSCH and the second PUSCH refers to: an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH; or The interval between the symbols occupied by the first PUSCH and the symbols occupied by the second PUSCH.

20. The method according to claim 19, wherein The time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located; or, The time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

21. The method according to claim 19 or 20, wherein The time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located; or, The time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

22. The method according to claim 19, wherein The symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH; or, The symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

23. The method according to claim 19 or 22, wherein: The symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH; or, The symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

24. The method according to any one of claims 19 to 23, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The number of the time slot occupied by the second PUSCH is n, and the number of the time slot occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or, The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or, The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

25. The method according to any one of claims 19 to 23, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The timestamp occupied by the second PUSCH is numbered n, the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist in x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH in x timestamps before the timestamp numbered m, where x is a predetermined value; or The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in x time slots before time slot m, or the terminal is not expected to send the second PUSCH in x time slots before time slot m, where x is a predetermined value.

26. The method according to any one of claims 19 to 23, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is no earlier than the xth symbol after the symbol P, where x is a predetermined value; or, The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

27. The method according to any one of claims 19 to 23, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or The symbol occupied by the first PUSCH is numbered Q, the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

28. The method according to any one of claims 18 to 27, wherein The predetermined value is configured by the network or agreed upon by a protocol.

29. The method according to any one of claims 18 to 28, wherein The value of the predetermined value is related to the number of HARQ processes configured by the network.

30. The method according to any one of claims 18 to 29, wherein The second PUSCH is a CG PUSCH or a dynamically scheduled PUSCH.

31. The method according to any one of claims 17 to 30, wherein The first PUSCH is a CG PUSCH.

32. The method according to any one of claims 17 to 31, wherein The first PUSCH includes first information, where the first information is used to indicate a first HARQ process number corresponding to the first PUSCH.

33. The method according to any one of claims 17 to 32, wherein The first PUSCH is used to transmit a new data block.

34. A method for transmitting an uplink channel, the method comprising: The terminal sends a first PUSCH and / or a second PUSCH, the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

35. The method according to claim 34, wherein The first PUSCH includes third information, where the third information is used to indicate whether K PUSCH opportunities following the PUSCH opportunity where the first PUSCH is located are valid PUSCH opportunities, where K is a positive integer.

36. The method of claim 35, wherein: The valid PUSCH opportunity refers to a PUSCH opportunity that can be used to transmit the second PUSCH.

37. The method according to claim 35 or 36, wherein The PUSCH opportunity where the first PUSCH is located is in the same period as the K PUSCH opportunities.

38. The method according to any one of claims 35 to 37, wherein The first PUSCH includes first UCI information, and a first information field in the first UCI information is used to indicate the third information.

39. The method according to claim 38, wherein The first information field is the same as the HARQ process number information field.

40. The method according to any one of claims 34 to 39, wherein The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

41. The method according to any one of claims 34 to 40, wherein The PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity in a cycle; or, The PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity actually sent in a period.

42. The method according to any one of claims 34 to 41, wherein The HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule, including: The HARQ process number corresponding to the first PUSCH is determined based on the time domain resources occupied by the first PUSCH according to a preset formula.

43. The method according to claim 42, wherein The time domain resource occupied by the first PUSCH refers to: the first symbol occupied by the first PUSCH.

44. The method according to claim 42 or 43, wherein The preset formula is configured by the network or agreed upon by a protocol.

45. The method according to any one of claims 34 to 44, wherein The predetermined process number is configured by the network or agreed upon by a protocol.

46. ​​The method according to any one of claims 34 to 45, wherein The second PUSCH includes second UCI information, and the second information field in the second UCI information is used to indicate the second information.

47. The method of claim 46, wherein The second information field is the same as the HARQ process number information field.

48. The method according to any one of claims 34 to 47, wherein The first PUSCH is a CG PUSCH.

49. The method according to any one of claims 34 to 48, wherein The second PUSCH is a CG PUSCH.

50. A method for receiving an uplink channel, the method comprising: The network device receives the first PUSCH sent by the terminal, where the first PUSCH includes first information, and the first information is used to indicate the first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, and the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet the first condition, which is a time-related condition.

51. The method of claim 50, wherein: The first condition includes at least one of the following: The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value; The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in different periods.

52. The method of claim 51, wherein The time interval between the first PUSCH and the second PUSCH refers to: an interval between a time slot occupied by the first PUSCH and a time slot occupied by the second PUSCH; or The interval between the symbols occupied by the first PUSCH and the symbols occupied by the second PUSCH.

53. The method of claim 52, wherein: The time slot occupied by the first PUSCH refers to the time slot where the last symbol occupied by the first PUSCH is located; or, The time slot occupied by the first PUSCH refers to the time slot where the first symbol occupied by the first PUSCH is located.

54. The method according to claim 52 or 53, wherein The time slot occupied by the second PUSCH refers to the time slot where the last symbol occupied by the second PUSCH is located; or, The time slot occupied by the second PUSCH refers to the time slot where the first symbol occupied by the second PUSCH is located.

55. The method of claim 52, wherein: The symbol occupied by the first PUSCH refers to the last symbol occupied by the first PUSCH; or, The symbol occupied by the first PUSCH refers to the first symbol occupied by the first PUSCH.

56. The method according to claim 52 or 55, wherein The symbol occupied by the second PUSCH refers to the last symbol occupied by the second PUSCH; or, The symbol occupied by the second PUSCH refers to the first symbol occupied by the second PUSCH.

57. The method according to any one of claims 52 to 56, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The number of the time slot occupied by the second PUSCH is n, and the number of the time slot occupied by the first PUSCH is greater than or equal to n+x, where x is a predetermined value; or, The number of the time slot occupied by the first PUSCH is m, and the number of the time slot occupied by the second PUSCH is less than or equal to mx, where x is a predetermined value; or The time slot occupied by the second PUSCH is time slot n, and the time slot occupied by the first PUSCH is no earlier than time slot n+x, where x is a predetermined value; or, The time slot occupied by the first PUSCH is time slot m, and the time slot occupied by the second PUSCH is no later than time slot mx, where x is a predetermined value.

58. The method according to any one of claims 52 to 56, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The timestamp occupied by the second PUSCH is numbered n, the first PUSCH does not exist within x timestamps after the timestamp numbered n, or the terminal is not expected to send the first PUSCH within x timestamps after the timestamp numbered n, where x is a predetermined value; or The timestamp occupied by the first PUSCH is numbered m, and the second PUSCH does not exist in x timestamps before the timestamp numbered m, or the terminal is not expected to send the second PUSCH in x timestamps before the timestamp numbered m, where x is a predetermined value; or The time slot occupied by the second PUSCH is time slot n, the first PUSCH does not exist within x time slots after time slot n, or the terminal is not expected to send the first PUSCH within x time slots after time slot n, where x is a predetermined value; or The time slot occupied by the first PUSCH is time slot m, the second PUSCH does not exist in x time slots before time slot m, or the terminal is not expected to send the second PUSCH in x time slots before time slot m, where x is a predetermined value.

59. The method according to any one of claims 52 to 56, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The number of symbols occupied by the second PUSCH is P, and the number of symbols occupied by the first PUSCH is greater than or equal to P+x, where x is a predetermined value; or The number of symbols occupied by the first PUSCH is Q, and the number of symbols occupied by the second PUSCH is less than or equal to Qx, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol Q is no earlier than the xth symbol after the symbol P, where x is a predetermined value; or, The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the symbol P is no later than the xth symbol before the symbol Q, and x is a predetermined value.

60. The method according to any one of claims 52 to 56, wherein The time interval between the first PUSCH and the second PUSCH is greater than or equal to a predetermined value, and is characterized by: The symbol occupied by the second PUSCH is numbered P, and the first PUSCH does not exist within x symbols after the symbol numbered P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol numbered P, where x is a predetermined value; or The symbol occupied by the first PUSCH is numbered Q, the second PUSCH does not exist within x symbols before the symbol numbered Q, or the terminal is not expected to send the second PUSCH within x symbols before the symbol numbered Q, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the first PUSCH does not exist within x symbols after the symbol P, or the terminal is not expected to send the first PUSCH within x symbols after the symbol P, where x is a predetermined value; or The symbol occupied by the second PUSCH is symbol P, the symbol occupied by the first PUSCH is symbol Q, the second PUSCH does not exist within x symbols before the symbol Q or the terminal is not expected to send the second PUSCH within x symbols before the symbol Q, and x is a predetermined value.

61. The method according to any one of claims 51 to 60, wherein The predetermined value is configured by the network or agreed upon by a protocol.

62. The method according to any one of claims 51 to 61, wherein The value of the predetermined value is related to the number of HARQ processes configured by the network.

63. The method according to any one of claims 50 to 62, wherein The first PUSCH is a CG PUSCH.

64. The method according to any one of claims 50 to 63, wherein The second PUSCH is a CG PUSCH or a dynamically scheduled PUSCH.

65. The method according to any one of claims 50 to 64, wherein The first PUSCH is used to transmit a new data block.

66. A method for receiving an uplink channel, the method comprising: The network device receives the first PUSCH and / or second PUSCH sent by the terminal, the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

67. The method of claim 66, wherein The first PUSCH includes third information, where the third information is used to indicate whether K PUSCH opportunities following the PUSCH opportunity where the first PUSCH is located are valid PUSCH opportunities, where K is a positive integer.

68. The method of claim 67, wherein The valid PUSCH opportunity refers to a PUSCH opportunity that can be used to transmit the second PUSCH.

69. The method according to claim 67 or 68, wherein The PUSCH opportunity where the first PUSCH is located is in the same period as the K PUSCH opportunities.

70. The method according to any one of claims 67 to 69, wherein The first PUSCH includes first UCI information, and a first information field in the first UCI information is used to indicate the third information.

71. The method of claim 70, wherein The first information field is the same as the HARQ process number information field.

72. The method according to any one of claims 66 to 71, wherein The PUSCH opportunity where the first PUSCH is located and the PUSCH opportunity where the second PUSCH is located are in the same period.

73. The method according to any one of claims 66 to 72, wherein The PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity in a cycle; or, The PUSCH opportunity where the first PUSCH is located is the first PUSCH opportunity actually sent in a period.

74. The method according to any one of claims 66 to 73, wherein The HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule, including: The HARQ process number corresponding to the first PUSCH is determined based on the time domain resources occupied by the first PUSCH according to a preset formula.

75. The method of claim 74, wherein The time domain resource occupied by the first PUSCH refers to: the first symbol occupied by the first PUSCH.

76. The method of claim 74 or 75, wherein The preset formula is configured by the network or agreed upon by a protocol.

77. The method of any one of claims 66 to 76, wherein The predetermined process number is configured by the network or agreed upon by a protocol.

78. The method of any one of claims 66 to 77, wherein The second PUSCH includes second UCI information, and the second information field in the second UCI information is used to indicate the second information.

79. The method of claim 78, wherein The second information field is the same as the HARQ process number information field.

80. The method according to any one of claims 66 to 79, wherein The first PUSCH is a CG PUSCH.

81. The method of any one of claims 66 to 80, wherein The second PUSCH is a CG PUSCH.

82. A transmission device for an uplink channel, applied to a terminal, the device comprising: A sending unit is used to send a first PUSCH, where the first PUSCH includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

83. A transmission device for an uplink channel, applied to a terminal, the device comprising: a sending unit, configured to send a first PUSCH based on a valid HARQ process if there is a valid HARQ process; and / or, if there is no valid HARQ process, not sending the first PUSCH; The valid HARQ process includes an idle HARQ process and / or an occupied HARQ process, and the PUSCH corresponding to the occupied HARQ process and the first PUSCH meet a first condition, and the first condition is a time-related condition.

84. A transmission device for an uplink channel, applied to a terminal, the device comprising: A sending unit is used to send a first PUSCH and / or a second PUSCH, where the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

85. A receiving device for an uplink channel, applied to a network device, comprising: A receiving unit is used to receive a first PUSCH sent by a terminal, where the first PUSCH includes first information, and the first information is used to indicate a first HARQ process number corresponding to the first PUSCH; wherein the first PUSCH is located after the second PUSCH, the HARQ process number corresponding to the second PUSCH is the first HARQ process number, and the first PUSCH and the second PUSCH meet a first condition, which is a time-related condition.

86. A receiving device for an uplink channel, applied to a network device, the device comprising: A receiving unit is used to receive a first PUSCH and / or a second PUSCH sent by a terminal, where the HARQ process number corresponding to the first PUSCH is determined based on a predetermined rule or is a predetermined process number, and the second PUSCH includes second information, and the second information is used to indicate the second HARQ process number corresponding to the second PUSCH.

87. A terminal comprising: A processor and a memory, the memory being used to store a computer program, the processor being used to call and run the computer program stored in the memory so that the terminal performs the method according to any one of claims 1 to 16, or the method according to any one of claims 17 to 33, or the method according to any one of claims 34 to 49.

88. A network device comprising: A processor and a memory, the memory being used to store a computer program, the processor being used to call and run the computer program stored in the memory so that the network device executes the method according to any one of claims 50 to 65, or the method according to any one of claims 66 to 81.

89. A chip comprising: A processor for calling and running a computer program from a memory so that a device equipped with the chip performs the method according to any one of claims 1 to 16, or the method according to any one of claims 17 to 33, or the method according to any one of claims 34 to 49, or the method according to any one of claims 50 to 65, or the method according to any one of claims 66 to 81.

90. A computer-readable storage medium for storing a computer program, wherein the computer program causes a computer to perform the method of any one of claims 1 to 16, or the method of any one of claims 17 to 33, or the method of any one of claims 34 to 49, or the method of any one of claims 50 to 65, or the method of any one of claims 66 to 81.

91. A computer program product comprising computer program instructions that cause a computer to perform the method of any one of claims 1 to 16, or the method of any one of claims 17 to 33, or the method of any one of claims 34 to 49, or the method of any one of claims 50 to 65, or the method of any one of claims 66 to 81.

92. A computer program causing a computer to perform the method of any one of claims 1 to 16, or the method of any one of claims 17 to 33, or the method of any one of claims 34 to 49, or the method of any one of claims 50 to 65, or the method of any one of claims 66 to 81.

Images